From 6eb9f88fa230e91888f49e791c94ce1836f04ede Mon Sep 17 00:00:00 2001 From: Johannes Schindelin Date: Mon, 4 May 2009 14:26:00 +0200 Subject: [PATCH] Install gcc-4.4.0-tdm-1-g++-2.tar.gz Signed-off-by: Johannes Schindelin --- mingw/bin/c++.exe | Bin 0 -> 206848 bytes mingw/bin/g++.exe | Bin 0 -> 206848 bytes mingw/bin/mingw32-c++.exe | Bin 0 -> 206848 bytes mingw/bin/mingw32-g++.exe | Bin 0 -> 206848 bytes mingw/lib/gcc/mingw32/4.4.0/include/c++/algorithm | 68 + mingw/lib/gcc/mingw32/4.4.0/include/c++/array | 60 + .../mingw32/4.4.0/include/c++/backward/auto_ptr.h | 292 + .../4.4.0/include/c++/backward/backward_warning.h | 56 + .../mingw32/4.4.0/include/c++/backward/binders.h | 168 + .../mingw32/4.4.0/include/c++/backward/hash_fun.h | 167 + .../mingw32/4.4.0/include/c++/backward/hash_map | 590 + .../mingw32/4.4.0/include/c++/backward/hash_set | 558 + .../mingw32/4.4.0/include/c++/backward/hashtable.h | 1125 ++ .../mingw32/4.4.0/include/c++/backward/strstream | 176 + .../mingw32/4.4.0/include/c++/bits/algorithmfwd.h | 805 + .../gcc/mingw32/4.4.0/include/c++/bits/allocator.h | 181 + .../gcc/mingw32/4.4.0/include/c++/bits/atomic_0.h | 463 + .../gcc/mingw32/4.4.0/include/c++/bits/atomic_2.h | 449 + .../mingw32/4.4.0/include/c++/bits/atomicfwd_c.h | 174 + .../mingw32/4.4.0/include/c++/bits/atomicfwd_cxx.h | 109 + .../gcc/mingw32/4.4.0/include/c++/bits/basic_ios.h | 474 + .../mingw32/4.4.0/include/c++/bits/basic_ios.tcc | 187 + .../mingw32/4.4.0/include/c++/bits/basic_string.h | 2692 ++++ .../4.4.0/include/c++/bits/basic_string.tcc | 1144 ++ .../4.4.0/include/c++/bits/boost_concept_check.h | 787 + .../mingw32/4.4.0/include/c++/bits/char_traits.h | 575 + .../gcc/mingw32/4.4.0/include/c++/bits/cmath.tcc | 55 + .../gcc/mingw32/4.4.0/include/c++/bits/codecvt.h | 497 + .../mingw32/4.4.0/include/c++/bits/concept_check.h | 80 + .../4.4.0/include/c++/bits/cpp_type_traits.h | 419 + .../gcc/mingw32/4.4.0/include/c++/bits/deque.tcc | 863 ++ .../mingw32/4.4.0/include/c++/bits/forward_list.h | 1306 ++ .../4.4.0/include/c++/bits/forward_list.tcc | 478 + .../gcc/mingw32/4.4.0/include/c++/bits/fstream.tcc | 926 ++ .../mingw32/4.4.0/include/c++/bits/functexcept.h | 93 + .../4.4.0/include/c++/bits/functional_hash.h | 68 + .../gcc/mingw32/4.4.0/include/c++/bits/gslice.h | 182 + .../mingw32/4.4.0/include/c++/bits/gslice_array.h | 216 + .../gcc/mingw32/4.4.0/include/c++/bits/hashtable.h | 58 + .../4.4.0/include/c++/bits/indirect_array.h | 210 + .../gcc/mingw32/4.4.0/include/c++/bits/ios_base.h | 982 ++ .../gcc/mingw32/4.4.0/include/c++/bits/istream.tcc | 1022 ++ .../gcc/mingw32/4.4.0/include/c++/bits/list.tcc | 416 + .../4.4.0/include/c++/bits/locale_classes.h | 812 + .../4.4.0/include/c++/bits/locale_classes.tcc | 271 + .../mingw32/4.4.0/include/c++/bits/locale_facets.h | 2602 ++++ .../4.4.0/include/c++/bits/locale_facets.tcc | 1344 ++ .../4.4.0/include/c++/bits/locale_facets_nonio.h | 1914 +++ .../4.4.0/include/c++/bits/locale_facets_nonio.tcc | 1330 ++ .../gcc/mingw32/4.4.0/include/c++/bits/localefwd.h | 183 + .../mingw32/4.4.0/include/c++/bits/mask_array.h | 206 + .../lib/gcc/mingw32/4.4.0/include/c++/bits/move.h | 98 + .../gcc/mingw32/4.4.0/include/c++/bits/ostream.tcc | 407 + .../4.4.0/include/c++/bits/ostream_insert.h | 127 + .../gcc/mingw32/4.4.0/include/c++/bits/postypes.h | 241 + .../mingw32/4.4.0/include/c++/bits/shared_ptr.h | 1591 ++ .../mingw32/4.4.0/include/c++/bits/slice_array.h | 272 + .../gcc/mingw32/4.4.0/include/c++/bits/sstream.tcc | 273 + .../gcc/mingw32/4.4.0/include/c++/bits/stl_algo.h | 6090 ++++++++ .../mingw32/4.4.0/include/c++/bits/stl_algobase.h | 1153 ++ .../mingw32/4.4.0/include/c++/bits/stl_bvector.h | 1024 ++ .../mingw32/4.4.0/include/c++/bits/stl_construct.h | 129 + .../gcc/mingw32/4.4.0/include/c++/bits/stl_deque.h | 1819 +++ .../mingw32/4.4.0/include/c++/bits/stl_function.h | 715 + .../gcc/mingw32/4.4.0/include/c++/bits/stl_heap.h | 578 + .../mingw32/4.4.0/include/c++/bits/stl_iterator.h | 1041 ++ .../include/c++/bits/stl_iterator_base_funcs.h | 197 + .../include/c++/bits/stl_iterator_base_types.h | 168 + .../gcc/mingw32/4.4.0/include/c++/bits/stl_list.h | 1533 ++ .../gcc/mingw32/4.4.0/include/c++/bits/stl_map.h | 871 ++ .../mingw32/4.4.0/include/c++/bits/stl_multimap.h | 800 + .../mingw32/4.4.0/include/c++/bits/stl_multiset.h | 697 + .../mingw32/4.4.0/include/c++/bits/stl_numeric.h | 373 + .../gcc/mingw32/4.4.0/include/c++/bits/stl_pair.h | 261 + .../gcc/mingw32/4.4.0/include/c++/bits/stl_queue.h | 586 + .../4.4.0/include/c++/bits/stl_raw_storage_iter.h | 106 + .../mingw32/4.4.0/include/c++/bits/stl_relops.h | 131 + .../gcc/mingw32/4.4.0/include/c++/bits/stl_set.h | 708 + .../gcc/mingw32/4.4.0/include/c++/bits/stl_stack.h | 299 + .../mingw32/4.4.0/include/c++/bits/stl_tempbuf.h | 206 + .../gcc/mingw32/4.4.0/include/c++/bits/stl_tree.h | 1495 ++ .../4.4.0/include/c++/bits/stl_uninitialized.h | 478 + .../mingw32/4.4.0/include/c++/bits/stl_vector.h | 1233 ++ .../4.4.0/include/c++/bits/stream_iterator.h | 211 + .../mingw32/4.4.0/include/c++/bits/streambuf.tcc | 174 + .../4.4.0/include/c++/bits/streambuf_iterator.h | 392 + .../gcc/mingw32/4.4.0/include/c++/bits/stringfwd.h | 77 + .../mingw32/4.4.0/include/c++/bits/unique_ptr.h | 450 + .../4.4.0/include/c++/bits/valarray_after.h | 549 + .../4.4.0/include/c++/bits/valarray_array.h | 699 + .../4.4.0/include/c++/bits/valarray_array.tcc | 241 + .../4.4.0/include/c++/bits/valarray_before.h | 730 + .../gcc/mingw32/4.4.0/include/c++/bits/vector.tcc | 681 + mingw/lib/gcc/mingw32/4.4.0/include/c++/bitset | 1396 ++ .../gcc/mingw32/4.4.0/include/c++/c++0x_warning.h | 36 + mingw/lib/gcc/mingw32/4.4.0/include/c++/cassert | 45 + mingw/lib/gcc/mingw32/4.4.0/include/c++/ccomplex | 44 + mingw/lib/gcc/mingw32/4.4.0/include/c++/cctype | 101 + mingw/lib/gcc/mingw32/4.4.0/include/c++/cerrno | 53 + mingw/lib/gcc/mingw32/4.4.0/include/c++/cfenv | 61 + mingw/lib/gcc/mingw32/4.4.0/include/c++/cfloat | 60 + mingw/lib/gcc/mingw32/4.4.0/include/c++/chrono | 672 + mingw/lib/gcc/mingw32/4.4.0/include/c++/cinttypes | 71 + mingw/lib/gcc/mingw32/4.4.0/include/c++/ciso646 | 33 + mingw/lib/gcc/mingw32/4.4.0/include/c++/climits | 60 + mingw/lib/gcc/mingw32/4.4.0/include/c++/clocale | 61 + mingw/lib/gcc/mingw32/4.4.0/include/c++/cmath | 631 + mingw/lib/gcc/mingw32/4.4.0/include/c++/complex | 1587 ++ mingw/lib/gcc/mingw32/4.4.0/include/c++/complex.h | 42 + .../mingw32/4.4.0/include/c++/condition_variable | 225 + mingw/lib/gcc/mingw32/4.4.0/include/c++/csetjmp | 64 + mingw/lib/gcc/mingw32/4.4.0/include/c++/csignal | 60 + mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdarg | 60 + mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdatomic | 848 + mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdbool | 44 + mingw/lib/gcc/mingw32/4.4.0/include/c++/cstddef | 56 + mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdint | 79 + mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdio | 205 + mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdlib | 242 + mingw/lib/gcc/mingw32/4.4.0/include/c++/cstring | 123 + mingw/lib/gcc/mingw32/4.4.0/include/c++/ctgmath | 41 + mingw/lib/gcc/mingw32/4.4.0/include/c++/ctime | 78 + mingw/lib/gcc/mingw32/4.4.0/include/c++/cwchar | 291 + mingw/lib/gcc/mingw32/4.4.0/include/c++/cwctype | 126 + .../gcc/mingw32/4.4.0/include/c++/cxxabi-forced.h | 51 + mingw/lib/gcc/mingw32/4.4.0/include/c++/cxxabi.h | 608 + .../lib/gcc/mingw32/4.4.0/include/c++/debug/bitset | 369 + .../gcc/mingw32/4.4.0/include/c++/debug/debug.h | 130 + .../lib/gcc/mingw32/4.4.0/include/c++/debug/deque | 515 + .../mingw32/4.4.0/include/c++/debug/formatter.h | 392 + .../mingw32/4.4.0/include/c++/debug/functions.h | 383 + mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/list | 653 + .../gcc/mingw32/4.4.0/include/c++/debug/macros.h | 246 + mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/map | 37 + .../lib/gcc/mingw32/4.4.0/include/c++/debug/map.h | 412 + .../gcc/mingw32/4.4.0/include/c++/debug/multimap.h | 400 + .../gcc/mingw32/4.4.0/include/c++/debug/multiset.h | 396 + .../mingw32/4.4.0/include/c++/debug/safe_base.h | 220 + .../4.4.0/include/c++/debug/safe_iterator.h | 643 + .../4.4.0/include/c++/debug/safe_iterator.tcc | 143 + .../4.4.0/include/c++/debug/safe_sequence.h | 183 + mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/set | 37 + .../lib/gcc/mingw32/4.4.0/include/c++/debug/set.h | 401 + .../lib/gcc/mingw32/4.4.0/include/c++/debug/string | 1074 ++ .../mingw32/4.4.0/include/c++/debug/unordered_map | 608 + .../mingw32/4.4.0/include/c++/debug/unordered_set | 601 + .../lib/gcc/mingw32/4.4.0/include/c++/debug/vector | 551 + mingw/lib/gcc/mingw32/4.4.0/include/c++/deque | 75 + mingw/lib/gcc/mingw32/4.4.0/include/c++/exception | 151 + .../mingw32/4.4.0/include/c++/exception_defines.h | 49 + .../gcc/mingw32/4.4.0/include/c++/exception_ptr.h | 178 + .../gcc/mingw32/4.4.0/include/c++/ext/algorithm | 524 + .../4.4.0/include/c++/ext/array_allocator.h | 154 + .../gcc/mingw32/4.4.0/include/c++/ext/atomicity.h | 113 + .../4.4.0/include/c++/ext/bitmap_allocator.h | 1145 ++ mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/cast.h | 113 + .../include/c++/ext/codecvt_specializations.h | 507 + .../mingw32/4.4.0/include/c++/ext/concurrence.h | 322 + .../4.4.0/include/c++/ext/debug_allocator.h | 124 + .../mingw32/4.4.0/include/c++/ext/enc_filebuf.h | 62 + .../4.4.0/include/c++/ext/extptr_allocator.h | 176 + .../gcc/mingw32/4.4.0/include/c++/ext/functional | 425 + .../lib/gcc/mingw32/4.4.0/include/c++/ext/hash_map | 590 + .../lib/gcc/mingw32/4.4.0/include/c++/ext/hash_set | 558 + .../lib/gcc/mingw32/4.4.0/include/c++/ext/iterator | 113 + .../4.4.0/include/c++/ext/malloc_allocator.h | 134 + mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/memory | 195 + .../mingw32/4.4.0/include/c++/ext/mt_allocator.h | 751 + .../mingw32/4.4.0/include/c++/ext/new_allocator.h | 130 + .../lib/gcc/mingw32/4.4.0/include/c++/ext/numeric | 146 + .../mingw32/4.4.0/include/c++/ext/numeric_traits.h | 135 + .../include/c++/ext/pb_ds/assoc_container.hpp | 683 + .../basic_tree_policy/basic_tree_policy_base.hpp | 173 + .../basic_tree_policy/null_node_metadata.hpp | 67 + .../ext/pb_ds/detail/basic_tree_policy/traits.hpp | 85 + .../include/c++/ext/pb_ds/detail/basic_types.hpp | 211 + .../detail/bin_search_tree_/bin_search_tree_.hpp | 497 + .../bin_search_tree_/cond_dtor_entry_dealtor.hpp | 70 + .../cond_key_dtor_entry_dealtor.hpp | 81 + .../constructors_destructor_fn_imps.hpp | 218 + .../detail/bin_search_tree_/debug_fn_imps.hpp | 272 + .../detail/bin_search_tree_/erase_fn_imps.hpp | 120 + .../pb_ds/detail/bin_search_tree_/find_fn_imps.hpp | 182 + .../pb_ds/detail/bin_search_tree_/info_fn_imps.hpp | 64 + .../detail/bin_search_tree_/insert_fn_imps.hpp | 211 + .../detail/bin_search_tree_/iterators_fn_imps.hpp | 136 + .../detail/bin_search_tree_/node_iterators.hpp | 237 + .../detail/bin_search_tree_/point_iterators.hpp | 381 + .../bin_search_tree_/policy_access_fn_imps.hpp | 56 + .../detail/bin_search_tree_/r_erase_fn_imps.hpp | 120 + .../detail/bin_search_tree_/rotate_fn_imps.hpp | 156 + .../detail/bin_search_tree_/split_join_fn_imps.hpp | 146 + .../ext/pb_ds/detail/bin_search_tree_/traits.hpp | 250 + .../ext/pb_ds/detail/binary_heap_/binary_heap_.hpp | 357 + .../pb_ds/detail/binary_heap_/const_iterator.hpp | 152 + .../detail/binary_heap_/const_point_iterator.hpp | 144 + .../constructors_destructor_fn_imps.hpp | 159 + .../pb_ds/detail/binary_heap_/debug_fn_imps.hpp | 72 + .../ext/pb_ds/detail/binary_heap_/entry_cmp.hpp | 93 + .../ext/pb_ds/detail/binary_heap_/entry_pred.hpp | 93 + .../pb_ds/detail/binary_heap_/erase_fn_imps.hpp | 246 + .../ext/pb_ds/detail/binary_heap_/find_fn_imps.hpp | 91 + .../ext/pb_ds/detail/binary_heap_/info_fn_imps.hpp | 64 + .../pb_ds/detail/binary_heap_/insert_fn_imps.hpp | 183 + .../detail/binary_heap_/iterators_fn_imps.hpp | 72 + .../detail/binary_heap_/policy_access_fn_imps.hpp | 56 + .../pb_ds/detail/binary_heap_/resize_policy.hpp | 253 + .../detail/binary_heap_/split_join_fn_imps.hpp | 172 + .../pb_ds/detail/binary_heap_/trace_fn_imps.hpp | 78 + .../pb_ds/detail/binomial_heap_/binomial_heap_.hpp | 116 + .../constructors_destructor_fn_imps.hpp | 61 + .../pb_ds/detail/binomial_heap_/debug_fn_imps.hpp | 49 + .../binomial_heap_base_/binomial_heap_base_.hpp | 234 + .../constructors_destructor_fn_imps.hpp | 97 + .../detail/binomial_heap_base_/debug_fn_imps.hpp | 98 + .../detail/binomial_heap_base_/erase_fn_imps.hpp | 192 + .../detail/binomial_heap_base_/find_fn_imps.hpp | 73 + .../detail/binomial_heap_base_/insert_fn_imps.hpp | 216 + .../binomial_heap_base_/split_join_fn_imps.hpp | 232 + .../pb_ds/detail/cc_hash_table_map_/cc_ht_map_.hpp | 636 + .../detail/cc_hash_table_map_/cmp_fn_imps.hpp | 83 + .../cond_key_dtor_entry_dealtor.hpp | 117 + .../constructor_destructor_fn_imps.hpp | 191 + ...onstructor_destructor_no_store_hash_fn_imps.hpp | 55 + .../constructor_destructor_store_hash_fn_imps.hpp | 56 + .../detail/cc_hash_table_map_/debug_fn_imps.hpp | 74 + .../debug_no_store_hash_fn_imps.hpp | 49 + .../debug_store_hash_fn_imps.hpp | 53 + .../cc_hash_table_map_/entry_list_fn_imps.hpp | 91 + .../detail/cc_hash_table_map_/erase_fn_imps.hpp | 103 + .../erase_no_store_hash_fn_imps.hpp | 101 + .../erase_store_hash_fn_imps.hpp | 95 + .../detail/cc_hash_table_map_/find_fn_imps.hpp | 71 + .../cc_hash_table_map_/find_store_hash_fn_imps.hpp | 41 + .../detail/cc_hash_table_map_/info_fn_imps.hpp | 100 + .../detail/cc_hash_table_map_/insert_fn_imps.hpp | 43 + .../insert_no_store_hash_fn_imps.hpp | 70 + .../insert_store_hash_fn_imps.hpp | 71 + .../cc_hash_table_map_/iterators_fn_imps.hpp | 83 + .../cc_hash_table_map_/policy_access_fn_imps.hpp | 88 + .../detail/cc_hash_table_map_/resize_fn_imps.hpp | 133 + .../resize_no_store_hash_fn_imps.hpp | 54 + .../resize_store_hash_fn_imps.hpp | 54 + .../detail/cc_hash_table_map_/size_fn_imps.hpp | 59 + .../cc_hash_table_map_/standard_policies.hpp | 46 + .../detail/cc_hash_table_map_/trace_fn_imps.hpp | 72 + .../include/c++/ext/pb_ds/detail/cond_dealtor.hpp | 125 + .../detail/constructors_destructor_fn_imps.hpp | 103 + .../ext/pb_ds/detail/container_base_dispatch.hpp | 332 + .../c++/ext/pb_ds/detail/debug_map_base.hpp | 360 + .../c++/ext/pb_ds/detail/eq_fn/eq_by_less.hpp | 68 + .../c++/ext/pb_ds/detail/eq_fn/hash_eq_fn.hpp | 179 + .../constructor_destructor_fn_imps.hpp | 223 + ...onstructor_destructor_no_store_hash_fn_imps.hpp | 53 + .../constructor_destructor_store_hash_fn_imps.hpp | 54 + .../detail/gp_hash_table_map_/debug_fn_imps.hpp | 55 + .../debug_no_store_hash_fn_imps.hpp | 71 + .../debug_store_hash_fn_imps.hpp | 77 + .../detail/gp_hash_table_map_/erase_fn_imps.hpp | 100 + .../erase_no_store_hash_fn_imps.hpp | 85 + .../erase_store_hash_fn_imps.hpp | 86 + .../detail/gp_hash_table_map_/find_fn_imps.hpp | 70 + .../find_no_store_hash_fn_imps.hpp | 46 + .../gp_hash_table_map_/find_store_hash_fn_imps.hpp | 40 + .../pb_ds/detail/gp_hash_table_map_/gp_ht_map_.hpp | 677 + .../detail/gp_hash_table_map_/info_fn_imps.hpp | 58 + .../detail/gp_hash_table_map_/insert_fn_imps.hpp | 43 + .../insert_no_store_hash_fn_imps.hpp | 111 + .../insert_store_hash_fn_imps.hpp | 118 + .../detail/gp_hash_table_map_/iterator_fn_imps.hpp | 83 + .../gp_hash_table_map_/policy_access_fn_imps.hpp | 100 + .../detail/gp_hash_table_map_/resize_fn_imps.hpp | 137 + .../resize_no_store_hash_fn_imps.hpp | 72 + .../resize_store_hash_fn_imps.hpp | 74 + .../gp_hash_table_map_/standard_policies.hpp | 74 + .../detail/gp_hash_table_map_/trace_fn_imps.hpp | 74 + .../hash_fn/direct_mask_range_hashing_imp.hpp | 58 + .../hash_fn/direct_mod_range_hashing_imp.hpp | 58 + .../pb_ds/detail/hash_fn/linear_probe_fn_imp.hpp | 53 + .../detail/hash_fn/mask_based_range_hashing.hpp | 107 + .../detail/hash_fn/mod_based_range_hashing.hpp | 108 + .../c++/ext/pb_ds/detail/hash_fn/probe_fn_base.hpp | 59 + .../detail/hash_fn/quadratic_probe_fn_imp.hpp | 53 + .../ext/pb_ds/detail/hash_fn/ranged_hash_fn.hpp | 359 + .../ext/pb_ds/detail/hash_fn/ranged_probe_fn.hpp | 327 + .../ext/pb_ds/detail/hash_fn/sample_probe_fn.hpp | 73 + .../pb_ds/detail/hash_fn/sample_range_hashing.hpp | 77 + .../pb_ds/detail/hash_fn/sample_ranged_hash_fn.hpp | 77 + .../detail/hash_fn/sample_ranged_probe_fn.hpp | 77 + .../const_iterator.hpp | 162 + .../const_point_iterator.hpp | 154 + .../constructors_destructor_fn_imps.hpp | 152 + .../debug_fn_imps.hpp | 141 + .../erase_fn_imps.hpp | 150 + .../left_child_next_sibling_heap_/info_fn_imps.hpp | 64 + .../insert_fn_imps.hpp | 175 + .../iterators_fn_imps.hpp | 88 + .../left_child_next_sibling_heap_.hpp | 349 + .../detail/left_child_next_sibling_heap_/node.hpp | 123 + .../null_metadata.hpp | 55 + .../policy_access_fn_imps.hpp | 52 + .../trace_fn_imps.hpp | 95 + .../constructor_destructor_fn_imps.hpp | 141 + .../detail/list_update_map_/debug_fn_imps.hpp | 57 + .../list_update_map_/entry_metadata_base.hpp | 60 + .../detail/list_update_map_/erase_fn_imps.hpp | 135 + .../pb_ds/detail/list_update_map_/find_fn_imps.hpp | 90 + .../pb_ds/detail/list_update_map_/info_fn_imps.hpp | 57 + .../detail/list_update_map_/insert_fn_imps.hpp | 106 + .../detail/list_update_map_/iterators_fn_imps.hpp | 80 + .../ext/pb_ds/detail/list_update_map_/lu_map_.hpp | 359 + .../detail/list_update_map_/trace_fn_imps.hpp | 59 + .../list_update_policy/counter_lu_metadata.hpp | 86 + .../list_update_policy/counter_lu_policy_imp.hpp | 51 + .../list_update_policy/mtf_lu_policy_imp.hpp | 55 + .../list_update_policy/sample_update_policy.hpp | 74 + .../ext/pb_ds/detail/ov_tree_map_/cond_dtor.hpp | 74 + .../constructors_destructor_fn_imps.hpp | 273 + .../pb_ds/detail/ov_tree_map_/debug_fn_imps.hpp | 84 + .../pb_ds/detail/ov_tree_map_/erase_fn_imps.hpp | 193 + .../ext/pb_ds/detail/ov_tree_map_/info_fn_imps.hpp | 60 + .../pb_ds/detail/ov_tree_map_/insert_fn_imps.hpp | 63 + .../detail/ov_tree_map_/iterators_fn_imps.hpp | 103 + .../pb_ds/detail/ov_tree_map_/node_iterators.hpp | 292 + .../ext/pb_ds/detail/ov_tree_map_/ov_tree_map_.hpp | 522 + .../detail/ov_tree_map_/policy_access_fn_imps.hpp | 51 + .../detail/ov_tree_map_/split_join_fn_imps.hpp | 137 + .../c++/ext/pb_ds/detail/ov_tree_map_/traits.hpp | 183 + .../constructors_destructor_fn_imps.hpp | 91 + .../pb_ds/detail/pairing_heap_/debug_fn_imps.hpp | 53 + .../pb_ds/detail/pairing_heap_/erase_fn_imps.hpp | 236 + .../pb_ds/detail/pairing_heap_/find_fn_imps.hpp | 50 + .../pb_ds/detail/pairing_heap_/insert_fn_imps.hpp | 101 + .../pb_ds/detail/pairing_heap_/pairing_heap_.hpp | 216 + .../detail/pairing_heap_/split_join_fn_imps.hpp | 140 + .../ext/pb_ds/detail/pat_trie_/child_iterator.hpp | 93 + .../detail/pat_trie_/cond_dtor_entry_dealtor.hpp | 79 + .../detail/pat_trie_/const_child_iterator.hpp | 111 + .../pat_trie_/constructors_destructor_fn_imps.hpp | 214 + .../ext/pb_ds/detail/pat_trie_/debug_fn_imps.hpp | 117 + .../ext/pb_ds/detail/pat_trie_/erase_fn_imps.hpp | 319 + .../ext/pb_ds/detail/pat_trie_/find_fn_imps.hpp | 269 + .../c++/ext/pb_ds/detail/pat_trie_/head.hpp | 124 + .../ext/pb_ds/detail/pat_trie_/info_fn_imps.hpp | 58 + .../pb_ds/detail/pat_trie_/insert_join_fn_imps.hpp | 465 + .../ext/pb_ds/detail/pat_trie_/internal_node.hpp | 599 + .../pb_ds/detail/pat_trie_/iterators_fn_imps.hpp | 120 + .../c++/ext/pb_ds/detail/pat_trie_/leaf.hpp | 171 + .../c++/ext/pb_ds/detail/pat_trie_/node_base.hpp | 128 + .../ext/pb_ds/detail/pat_trie_/node_iterators.hpp | 338 + .../pb_ds/detail/pat_trie_/node_metadata_base.hpp | 86 + .../c++/ext/pb_ds/detail/pat_trie_/pat_trie_.hpp | 515 + .../ext/pb_ds/detail/pat_trie_/point_iterators.hpp | 484 + .../detail/pat_trie_/policy_access_fn_imps.hpp | 63 + .../ext/pb_ds/detail/pat_trie_/r_erase_fn_imps.hpp | 103 + .../ext/pb_ds/detail/pat_trie_/rotate_fn_imps.hpp | 150 + .../ext/pb_ds/detail/pat_trie_/split_fn_imps.hpp | 254 + .../detail/pat_trie_/split_join_branch_bag.hpp | 93 + .../detail/pat_trie_/synth_e_access_traits.hpp | 229 + .../ext/pb_ds/detail/pat_trie_/trace_fn_imps.hpp | 113 + .../c++/ext/pb_ds/detail/pat_trie_/traits.hpp | 350 + .../ext/pb_ds/detail/pat_trie_/update_fn_imps.hpp | 55 + .../pb_ds/detail/priority_queue_base_dispatch.hpp | 91 + .../constructors_destructor_fn_imps.hpp | 100 + .../pb_ds/detail/rb_tree_map_/debug_fn_imps.hpp | 78 + .../pb_ds/detail/rb_tree_map_/erase_fn_imps.hpp | 289 + .../ext/pb_ds/detail/rb_tree_map_/find_fn_imps.hpp | 39 + .../ext/pb_ds/detail/rb_tree_map_/info_fn_imps.hpp | 46 + .../pb_ds/detail/rb_tree_map_/insert_fn_imps.hpp | 115 + .../c++/ext/pb_ds/detail/rb_tree_map_/node.hpp | 138 + .../c++/ext/pb_ds/detail/rb_tree_map_/rb_tree_.hpp | 280 + .../detail/rb_tree_map_/split_join_fn_imps.hpp | 313 + .../c++/ext/pb_ds/detail/rb_tree_map_/traits.hpp | 124 + .../constructors_destructor_fn_imps.hpp | 88 + .../detail/rc_binomial_heap_/debug_fn_imps.hpp | 121 + .../detail/rc_binomial_heap_/erase_fn_imps.hpp | 107 + .../detail/rc_binomial_heap_/insert_fn_imps.hpp | 154 + .../c++/ext/pb_ds/detail/rc_binomial_heap_/rc.hpp | 262 + .../detail/rc_binomial_heap_/rc_binomial_heap_.hpp | 198 + .../rc_binomial_heap_/split_join_fn_imps.hpp | 81 + .../detail/rc_binomial_heap_/trace_fn_imps.hpp | 53 + ...hash_max_collision_check_resize_trigger_imp.hpp | 211 + .../hash_exponential_size_policy_imp.hpp | 90 + .../hash_load_check_resize_trigger_imp.hpp | 289 + .../hash_load_check_resize_trigger_size_base.hpp | 94 + .../resize_policy/hash_prime_size_policy_imp.hpp | 161 + .../hash_standard_resize_policy_imp.hpp | 249 + .../detail/resize_policy/sample_resize_policy.hpp | 125 + .../detail/resize_policy/sample_resize_trigger.hpp | 137 + .../detail/resize_policy/sample_size_policy.hpp | 73 + .../constructors_destructor_fn_imps.hpp | 102 + .../ext/pb_ds/detail/splay_tree_/debug_fn_imps.hpp | 74 + .../ext/pb_ds/detail/splay_tree_/erase_fn_imps.hpp | 157 + .../ext/pb_ds/detail/splay_tree_/find_fn_imps.hpp | 99 + .../ext/pb_ds/detail/splay_tree_/info_fn_imps.hpp | 39 + .../pb_ds/detail/splay_tree_/insert_fn_imps.hpp | 93 + .../c++/ext/pb_ds/detail/splay_tree_/node.hpp | 125 + .../ext/pb_ds/detail/splay_tree_/splay_fn_imps.hpp | 283 + .../ext/pb_ds/detail/splay_tree_/splay_tree_.hpp | 298 + .../detail/splay_tree_/split_join_fn_imps.hpp | 112 + .../c++/ext/pb_ds/detail/splay_tree_/traits.hpp | 113 + .../c++/ext/pb_ds/detail/standard_policies.hpp | 136 + .../thin_heap_/constructors_destructor_fn_imps.hpp | 106 + .../ext/pb_ds/detail/thin_heap_/debug_fn_imps.hpp | 112 + .../ext/pb_ds/detail/thin_heap_/erase_fn_imps.hpp | 296 + .../ext/pb_ds/detail/thin_heap_/find_fn_imps.hpp | 51 + .../ext/pb_ds/detail/thin_heap_/insert_fn_imps.hpp | 326 + .../pb_ds/detail/thin_heap_/split_join_fn_imps.hpp | 126 + .../c++/ext/pb_ds/detail/thin_heap_/thin_heap_.hpp | 351 + .../ext/pb_ds/detail/thin_heap_/trace_fn_imps.hpp | 55 + .../detail/tree_policy/node_metadata_selector.hpp | 116 + .../detail/tree_policy/null_node_update_imp.hpp | 50 + .../detail/tree_policy/order_statistics_imp.hpp | 141 + .../detail/tree_policy/sample_tree_node_update.hpp | 72 + .../c++/ext/pb_ds/detail/tree_trace_base.hpp | 209 + .../detail/trie_policy/node_metadata_selector.hpp | 116 + .../detail/trie_policy/null_node_update_imp.hpp | 50 + .../detail/trie_policy/order_statistics_imp.hpp | 183 + .../trie_policy/prefix_search_node_update_imp.hpp | 151 + .../trie_policy/sample_trie_e_access_traits.hpp | 89 + .../detail/trie_policy/sample_trie_node_update.hpp | 72 + .../string_trie_e_access_traits_imp.hpp | 99 + .../pb_ds/detail/trie_policy/trie_policy_base.hpp | 249 + .../include/c++/ext/pb_ds/detail/type_utils.hpp | 167 + .../include/c++/ext/pb_ds/detail/types_traits.hpp | 82 + .../detail/unordered_iterator/const_iterator.hpp | 129 + .../unordered_iterator/const_point_iterator.hpp | 151 + .../pb_ds/detail/unordered_iterator/iterator.hpp | 150 + .../detail/unordered_iterator/point_iterator.hpp | 143 + .../4.4.0/include/c++/ext/pb_ds/exception.hpp | 103 + .../4.4.0/include/c++/ext/pb_ds/hash_policy.hpp | 604 + .../include/c++/ext/pb_ds/list_update_policy.hpp | 136 + .../4.4.0/include/c++/ext/pb_ds/priority_queue.hpp | 125 + .../4.4.0/include/c++/ext/pb_ds/tag_and_trait.hpp | 363 + .../4.4.0/include/c++/ext/pb_ds/tree_policy.hpp | 162 + .../4.4.0/include/c++/ext/pb_ds/trie_policy.hpp | 355 + .../4.4.0/include/c++/ext/pod_char_traits.h | 182 + .../gcc/mingw32/4.4.0/include/c++/ext/pointer.h | 551 + .../mingw32/4.4.0/include/c++/ext/pool_allocator.h | 263 + .../lib/gcc/mingw32/4.4.0/include/c++/ext/rb_tree | 93 + .../mingw32/4.4.0/include/c++/ext/rc_string_base.h | 718 + mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/rope | 2958 ++++ .../gcc/mingw32/4.4.0/include/c++/ext/ropeimpl.h | 1701 ++ mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/slist | 1077 ++ .../4.4.0/include/c++/ext/sso_string_base.h | 568 + .../mingw32/4.4.0/include/c++/ext/stdio_filebuf.h | 157 + .../4.4.0/include/c++/ext/stdio_sync_filebuf.h | 279 + .../4.4.0/include/c++/ext/string_conversions.h | 94 + .../4.4.0/include/c++/ext/throw_allocator.h | 448 + .../mingw32/4.4.0/include/c++/ext/type_traits.h | 204 + .../gcc/mingw32/4.4.0/include/c++/ext/typelist.h | 544 + .../gcc/mingw32/4.4.0/include/c++/ext/vstring.h | 2575 ++++ .../gcc/mingw32/4.4.0/include/c++/ext/vstring.tcc | 696 + .../mingw32/4.4.0/include/c++/ext/vstring_fwd.h | 87 + .../mingw32/4.4.0/include/c++/ext/vstring_util.h | 180 + mingw/lib/gcc/mingw32/4.4.0/include/c++/fenv.h | 58 + .../lib/gcc/mingw32/4.4.0/include/c++/forward_list | 46 + mingw/lib/gcc/mingw32/4.4.0/include/c++/fstream | 918 ++ mingw/lib/gcc/mingw32/4.4.0/include/c++/functional | 78 + .../gcc/mingw32/4.4.0/include/c++/initializer_list | 72 + mingw/lib/gcc/mingw32/4.4.0/include/c++/iomanip | 296 + mingw/lib/gcc/mingw32/4.4.0/include/c++/ios | 47 + mingw/lib/gcc/mingw32/4.4.0/include/c++/iosfwd | 160 + mingw/lib/gcc/mingw32/4.4.0/include/c++/iostream | 76 + mingw/lib/gcc/mingw32/4.4.0/include/c++/istream | 833 + mingw/lib/gcc/mingw32/4.4.0/include/c++/iterator | 70 + mingw/lib/gcc/mingw32/4.4.0/include/c++/limits | 1256 ++ mingw/lib/gcc/mingw32/4.4.0/include/c++/list | 74 + mingw/lib/gcc/mingw32/4.4.0/include/c++/locale | 45 + mingw/lib/gcc/mingw32/4.4.0/include/c++/map | 68 + mingw/lib/gcc/mingw32/4.4.0/include/c++/memory | 100 + .../4.4.0/include/c++/mingw32/bits/atomic_word.h | 47 + .../4.4.0/include/c++/mingw32/bits/basic_file.h | 108 + .../4.4.0/include/c++/mingw32/bits/c++allocator.h | 37 + .../4.4.0/include/c++/mingw32/bits/c++config.h | 1431 ++ .../mingw32/4.4.0/include/c++/mingw32/bits/c++io.h | 49 + .../4.4.0/include/c++/mingw32/bits/c++locale.h | 91 + .../4.4.0/include/c++/mingw32/bits/cpu_defines.h | 33 + .../4.4.0/include/c++/mingw32/bits/ctype_base.h | 61 + .../4.4.0/include/c++/mingw32/bits/ctype_inline.h | 72 + .../include/c++/mingw32/bits/ctype_noninline.h | 240 + .../4.4.0/include/c++/mingw32/bits/cxxabi_tweaks.h | 58 + .../include/c++/mingw32/bits/error_constants.h | 125 + .../4.4.0/include/c++/mingw32/bits/extc++.h | 69 + .../4.4.0/include/c++/mingw32/bits/gthr-default.h | 768 + .../4.4.0/include/c++/mingw32/bits/gthr-posix.h | 895 ++ .../4.4.0/include/c++/mingw32/bits/gthr-single.h | 292 + .../4.4.0/include/c++/mingw32/bits/gthr-tpf.h | 229 + .../mingw32/4.4.0/include/c++/mingw32/bits/gthr.h | 173 + .../include/c++/mingw32/bits/messages_members.h | 90 + .../4.4.0/include/c++/mingw32/bits/os_defines.h | 54 + .../4.4.0/include/c++/mingw32/bits/stdc++.h | 111 + .../4.4.0/include/c++/mingw32/bits/stdtr1c++.h | 53 + .../4.4.0/include/c++/mingw32/bits/time_members.h | 90 + mingw/lib/gcc/mingw32/4.4.0/include/c++/mutex | 771 + mingw/lib/gcc/mingw32/4.4.0/include/c++/new | 112 + mingw/lib/gcc/mingw32/4.4.0/include/c++/numeric | 78 + mingw/lib/gcc/mingw32/4.4.0/include/c++/ostream | 568 + .../gcc/mingw32/4.4.0/include/c++/parallel/algo.h | 2364 +++ .../mingw32/4.4.0/include/c++/parallel/algobase.h | 281 + .../mingw32/4.4.0/include/c++/parallel/algorithm | 40 + .../4.4.0/include/c++/parallel/algorithmfwd.h | 898 ++ .../include/c++/parallel/balanced_quicksort.h | 477 + .../gcc/mingw32/4.4.0/include/c++/parallel/base.h | 471 + .../4.4.0/include/c++/parallel/basic_iterator.h | 42 + .../mingw32/4.4.0/include/c++/parallel/checkers.h | 154 + .../4.4.0/include/c++/parallel/compatibility.h | 350 + .../include/c++/parallel/compiletime_settings.h | 75 + .../4.4.0/include/c++/parallel/equally_split.h | 87 + .../mingw32/4.4.0/include/c++/parallel/features.h | 104 + .../gcc/mingw32/4.4.0/include/c++/parallel/find.h | 401 + .../4.4.0/include/c++/parallel/find_selectors.h | 192 + .../mingw32/4.4.0/include/c++/parallel/for_each.h | 97 + .../include/c++/parallel/for_each_selectors.h | 360 + .../mingw32/4.4.0/include/c++/parallel/iterator.h | 200 + .../4.4.0/include/c++/parallel/list_partition.h | 176 + .../mingw32/4.4.0/include/c++/parallel/losertree.h | 1021 ++ .../gcc/mingw32/4.4.0/include/c++/parallel/merge.h | 261 + .../include/c++/parallel/multiseq_selection.h | 633 + .../4.4.0/include/c++/parallel/multiway_merge.h | 2145 +++ .../include/c++/parallel/multiway_mergesort.h | 475 + .../gcc/mingw32/4.4.0/include/c++/parallel/numeric | 500 + .../4.4.0/include/c++/parallel/numericfwd.h | 203 + .../mingw32/4.4.0/include/c++/parallel/omp_loop.h | 118 + .../4.4.0/include/c++/parallel/omp_loop_static.h | 117 + .../mingw32/4.4.0/include/c++/parallel/par_loop.h | 135 + .../mingw32/4.4.0/include/c++/parallel/parallel.h | 42 + .../4.4.0/include/c++/parallel/partial_sum.h | 220 + .../mingw32/4.4.0/include/c++/parallel/partition.h | 429 + .../gcc/mingw32/4.4.0/include/c++/parallel/queue.h | 149 + .../mingw32/4.4.0/include/c++/parallel/quicksort.h | 179 + .../4.4.0/include/c++/parallel/random_number.h | 124 + .../4.4.0/include/c++/parallel/random_shuffle.h | 519 + .../mingw32/4.4.0/include/c++/parallel/search.h | 172 + .../4.4.0/include/c++/parallel/set_operations.h | 524 + .../mingw32/4.4.0/include/c++/parallel/settings.h | 281 + .../gcc/mingw32/4.4.0/include/c++/parallel/sort.h | 229 + .../gcc/mingw32/4.4.0/include/c++/parallel/tags.h | 191 + .../gcc/mingw32/4.4.0/include/c++/parallel/types.h | 155 + .../4.4.0/include/c++/parallel/unique_copy.h | 192 + .../4.4.0/include/c++/parallel/workstealing.h | 306 + mingw/lib/gcc/mingw32/4.4.0/include/c++/queue | 67 + mingw/lib/gcc/mingw32/4.4.0/include/c++/random | 70 + mingw/lib/gcc/mingw32/4.4.0/include/c++/ratio | 303 + mingw/lib/gcc/mingw32/4.4.0/include/c++/regex | 68 + mingw/lib/gcc/mingw32/4.4.0/include/c++/set | 68 + mingw/lib/gcc/mingw32/4.4.0/include/c++/sstream | 576 + mingw/lib/gcc/mingw32/4.4.0/include/c++/stack | 64 + .../lib/gcc/mingw32/4.4.0/include/c++/stdatomic.h | 218 + mingw/lib/gcc/mingw32/4.4.0/include/c++/stdexcept | 150 + mingw/lib/gcc/mingw32/4.4.0/include/c++/streambuf | 799 + mingw/lib/gcc/mingw32/4.4.0/include/c++/string | 59 + .../lib/gcc/mingw32/4.4.0/include/c++/system_error | 360 + mingw/lib/gcc/mingw32/4.4.0/include/c++/tgmath.h | 42 + mingw/lib/gcc/mingw32/4.4.0/include/c++/thread | 284 + mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/array | 54 + .../4.4.0/include/c++/tr1/bessel_function.tcc | 627 + .../4.4.0/include/c++/tr1/beta_function.tcc | 197 + .../lib/gcc/mingw32/4.4.0/include/c++/tr1/ccomplex | 34 + mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/cctype | 49 + mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/cfenv | 53 + mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/cfloat | 42 + .../gcc/mingw32/4.4.0/include/c++/tr1/cinttypes | 63 + .../lib/gcc/mingw32/4.4.0/include/c++/tr1/climits | 46 + mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/cmath | 507 + .../lib/gcc/mingw32/4.4.0/include/c++/tr1/complex | 91 + .../gcc/mingw32/4.4.0/include/c++/tr1/complex.h | 34 + .../lib/gcc/mingw32/4.4.0/include/c++/tr1/cstdarg | 34 + .../lib/gcc/mingw32/4.4.0/include/c++/tr1/cstdbool | 40 + .../lib/gcc/mingw32/4.4.0/include/c++/tr1/cstdint | 76 + mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/cstdio | 54 + .../lib/gcc/mingw32/4.4.0/include/c++/tr1/cstdlib | 54 + .../lib/gcc/mingw32/4.4.0/include/c++/tr1/ctgmath | 34 + mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/ctime | 34 + .../lib/gcc/mingw32/4.4.0/include/c++/tr1/ctype.h | 34 + mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/cwchar | 54 + .../lib/gcc/mingw32/4.4.0/include/c++/tr1/cwctype | 54 + .../mingw32/4.4.0/include/c++/tr1/ell_integral.tcc | 750 + .../mingw32/4.4.0/include/c++/tr1/exp_integral.tcc | 524 + mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/fenv.h | 34 + .../lib/gcc/mingw32/4.4.0/include/c++/tr1/float.h | 34 + .../gcc/mingw32/4.4.0/include/c++/tr1/functional | 63 + .../4.4.0/include/c++/tr1/functional_hash.h | 53 + .../gcc/mingw32/4.4.0/include/c++/tr1/gamma.tcc | 471 + .../gcc/mingw32/4.4.0/include/c++/tr1/hashtable.h | 53 + .../4.4.0/include/c++/tr1/hypergeometric.tcc | 774 + .../gcc/mingw32/4.4.0/include/c++/tr1/inttypes.h | 34 + .../4.4.0/include/c++/tr1/legendre_function.tcc | 305 + .../lib/gcc/mingw32/4.4.0/include/c++/tr1/limits.h | 34 + mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/math.h | 186 + mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/memory | 67 + .../4.4.0/include/c++/tr1/modified_bessel_func.tcc | 436 + .../mingw32/4.4.0/include/c++/tr1/poly_hermite.tcc | 124 + .../4.4.0/include/c++/tr1/poly_laguerre.tcc | 329 + mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/random | 66 + mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/regex | 64 + .../mingw32/4.4.0/include/c++/tr1/riemann_zeta.tcc | 435 + .../gcc/mingw32/4.4.0/include/c++/tr1/shared_ptr.h | 1020 ++ .../4.4.0/include/c++/tr1/special_function_util.h | 144 + .../lib/gcc/mingw32/4.4.0/include/c++/tr1/stdarg.h | 34 + .../gcc/mingw32/4.4.0/include/c++/tr1/stdbool.h | 34 + .../lib/gcc/mingw32/4.4.0/include/c++/tr1/stdint.h | 34 + .../lib/gcc/mingw32/4.4.0/include/c++/tr1/stdio.h | 34 + .../lib/gcc/mingw32/4.4.0/include/c++/tr1/stdlib.h | 52 + .../lib/gcc/mingw32/4.4.0/include/c++/tr1/tgmath.h | 34 + mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/tuple | 422 + .../gcc/mingw32/4.4.0/include/c++/tr1/type_traits | 249 + .../mingw32/4.4.0/include/c++/tr1/unordered_map | 61 + .../mingw32/4.4.0/include/c++/tr1/unordered_set | 61 + .../lib/gcc/mingw32/4.4.0/include/c++/tr1/utility | 56 + .../lib/gcc/mingw32/4.4.0/include/c++/tr1/wchar.h | 34 + .../lib/gcc/mingw32/4.4.0/include/c++/tr1/wctype.h | 34 + .../gcc/mingw32/4.4.0/include/c++/tr1_impl/array | 287 + .../include/c++/tr1_impl/boost_sp_counted_base.h | 239 + .../gcc/mingw32/4.4.0/include/c++/tr1_impl/cctype | 43 + .../gcc/mingw32/4.4.0/include/c++/tr1_impl/cfenv | 70 + .../mingw32/4.4.0/include/c++/tr1_impl/cinttypes | 64 + .../gcc/mingw32/4.4.0/include/c++/tr1_impl/cmath | 902 ++ .../gcc/mingw32/4.4.0/include/c++/tr1_impl/complex | 370 + .../gcc/mingw32/4.4.0/include/c++/tr1_impl/cstdint | 75 + .../gcc/mingw32/4.4.0/include/c++/tr1_impl/cstdio | 44 + .../gcc/mingw32/4.4.0/include/c++/tr1_impl/cstdlib | 65 + .../gcc/mingw32/4.4.0/include/c++/tr1_impl/cwchar | 58 + .../gcc/mingw32/4.4.0/include/c++/tr1_impl/cwctype | 43 + .../mingw32/4.4.0/include/c++/tr1_impl/functional | 2130 +++ .../4.4.0/include/c++/tr1_impl/functional_hash.h | 183 + .../mingw32/4.4.0/include/c++/tr1_impl/hashtable | 1266 ++ .../4.4.0/include/c++/tr1_impl/hashtable_policy.h | 865 ++ .../gcc/mingw32/4.4.0/include/c++/tr1_impl/random | 2407 +++ .../mingw32/4.4.0/include/c++/tr1_impl/random.tcc | 1577 ++ .../gcc/mingw32/4.4.0/include/c++/tr1_impl/regex | 2708 ++++ .../mingw32/4.4.0/include/c++/tr1_impl/type_traits | 501 + .../4.4.0/include/c++/tr1_impl/unordered_map | 370 + .../4.4.0/include/c++/tr1_impl/unordered_set | 360 + .../gcc/mingw32/4.4.0/include/c++/tr1_impl/utility | 120 + mingw/lib/gcc/mingw32/4.4.0/include/c++/tuple | 697 + .../lib/gcc/mingw32/4.4.0/include/c++/type_traits | 605 + mingw/lib/gcc/mingw32/4.4.0/include/c++/typeinfo | 196 + .../gcc/mingw32/4.4.0/include/c++/unordered_map | 78 + .../gcc/mingw32/4.4.0/include/c++/unordered_set | 78 + mingw/lib/gcc/mingw32/4.4.0/include/c++/utility | 94 + mingw/lib/gcc/mingw32/4.4.0/include/c++/valarray | 1086 ++ mingw/lib/gcc/mingw32/4.4.0/include/c++/vector | 77 + mingw/lib/gcc/mingw32/4.4.0/libstdc++.a | Bin 0 -> 1937528 bytes mingw/lib/gcc/mingw32/4.4.0/libstdc++.la | 41 + mingw/lib/gcc/mingw32/4.4.0/libsupc++.a | Bin 0 -> 158118 bytes mingw/lib/gcc/mingw32/4.4.0/libsupc++.la | 41 + mingw/libexec/gcc/mingw32/4.4.0/cc1plus.exe | Bin 0 -> 8081920 bytes mingw/man/man1/g++.1 | 15351 +++++++++++++++++++ 649 files changed, 206355 insertions(+) create mode 100644 mingw/bin/c++.exe create mode 100644 mingw/bin/g++.exe create mode 100644 mingw/bin/mingw32-c++.exe create mode 100644 mingw/bin/mingw32-g++.exe create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/algorithm create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/array create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/auto_ptr.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/backward_warning.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/binders.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/hash_fun.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/hash_map create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/hash_set create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/hashtable.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/strstream create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/algorithmfwd.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/allocator.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/atomic_0.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/atomic_2.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/atomicfwd_c.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/atomicfwd_cxx.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/basic_ios.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/basic_ios.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/basic_string.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/basic_string.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/boost_concept_check.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/char_traits.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/cmath.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/codecvt.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/concept_check.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/cpp_type_traits.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/deque.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/forward_list.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/forward_list.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/fstream.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/functexcept.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/functional_hash.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/gslice.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/gslice_array.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/hashtable.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/indirect_array.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/ios_base.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/istream.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/list.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/locale_classes.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/locale_classes.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/locale_facets.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/locale_facets.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/locale_facets_nonio.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/locale_facets_nonio.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/localefwd.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/mask_array.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/move.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/ostream.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/ostream_insert.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/postypes.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/shared_ptr.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/slice_array.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/sstream.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_algo.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_algobase.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_bvector.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_construct.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_deque.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_function.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_heap.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_iterator.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_iterator_base_funcs.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_iterator_base_types.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_list.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_map.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_multimap.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_multiset.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_numeric.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_pair.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_queue.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_raw_storage_iter.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_relops.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_set.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_stack.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_tempbuf.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_tree.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_uninitialized.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_vector.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stream_iterator.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/streambuf.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/streambuf_iterator.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stringfwd.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/unique_ptr.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/valarray_after.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/valarray_array.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/valarray_array.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/valarray_before.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/vector.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/bitset create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/c++0x_warning.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/cassert create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ccomplex create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/cctype create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/cerrno create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/cfenv create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/cfloat create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/chrono create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/cinttypes create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ciso646 create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/climits create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/clocale create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/cmath create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/complex create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/complex.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/condition_variable create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/csetjmp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/csignal create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdarg create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdatomic create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdbool create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/cstddef create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdint create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdio create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdlib create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/cstring create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ctgmath create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ctime create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/cwchar create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/cwctype create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/cxxabi-forced.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/cxxabi.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/bitset create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/debug.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/deque create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/formatter.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/functions.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/list create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/macros.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/map create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/map.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/multimap.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/multiset.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/safe_base.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/safe_iterator.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/safe_iterator.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/safe_sequence.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/set create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/set.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/string create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/unordered_map create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/unordered_set create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/vector create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/deque create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/exception create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/exception_defines.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/exception_ptr.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/algorithm create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/array_allocator.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/atomicity.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/bitmap_allocator.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/cast.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/codecvt_specializations.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/concurrence.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/debug_allocator.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/enc_filebuf.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/extptr_allocator.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/functional create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/hash_map create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/hash_set create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/iterator create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/malloc_allocator.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/memory create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/mt_allocator.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/new_allocator.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/numeric create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/numeric_traits.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/assoc_container.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/basic_tree_policy/basic_tree_policy_base.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/basic_tree_policy/null_node_metadata.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/basic_tree_policy/traits.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/basic_types.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/bin_search_tree_/bin_search_tree_.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/bin_search_tree_/cond_dtor_entry_dealtor.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/bin_search_tree_/cond_key_dtor_entry_dealtor.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/bin_search_tree_/constructors_destructor_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/bin_search_tree_/debug_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/bin_search_tree_/erase_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/bin_search_tree_/find_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/bin_search_tree_/info_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/bin_search_tree_/insert_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/bin_search_tree_/iterators_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/bin_search_tree_/node_iterators.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/bin_search_tree_/point_iterators.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/bin_search_tree_/policy_access_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/bin_search_tree_/r_erase_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/bin_search_tree_/rotate_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/bin_search_tree_/split_join_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/bin_search_tree_/traits.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binary_heap_/binary_heap_.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binary_heap_/const_iterator.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binary_heap_/const_point_iterator.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binary_heap_/constructors_destructor_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binary_heap_/debug_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binary_heap_/entry_cmp.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binary_heap_/entry_pred.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binary_heap_/erase_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binary_heap_/find_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binary_heap_/info_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binary_heap_/insert_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binary_heap_/iterators_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binary_heap_/policy_access_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binary_heap_/resize_policy.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binary_heap_/split_join_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binary_heap_/trace_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binomial_heap_/binomial_heap_.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binomial_heap_/constructors_destructor_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binomial_heap_/debug_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binomial_heap_base_/binomial_heap_base_.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binomial_heap_base_/constructors_destructor_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binomial_heap_base_/debug_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binomial_heap_base_/erase_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binomial_heap_base_/find_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binomial_heap_base_/insert_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/binomial_heap_base_/split_join_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/cc_ht_map_.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/cmp_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/cond_key_dtor_entry_dealtor.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/constructor_destructor_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/constructor_destructor_no_store_hash_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/constructor_destructor_store_hash_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/debug_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/debug_no_store_hash_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/debug_store_hash_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/entry_list_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/erase_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/erase_no_store_hash_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/erase_store_hash_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/find_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/find_store_hash_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/info_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/insert_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/insert_no_store_hash_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/insert_store_hash_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/iterators_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/policy_access_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/resize_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/resize_no_store_hash_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/resize_store_hash_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/size_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/standard_policies.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cc_hash_table_map_/trace_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/cond_dealtor.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/constructors_destructor_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/container_base_dispatch.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/debug_map_base.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/eq_fn/eq_by_less.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/eq_fn/hash_eq_fn.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/gp_hash_table_map_/constructor_destructor_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/gp_hash_table_map_/constructor_destructor_no_store_hash_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/gp_hash_table_map_/constructor_destructor_store_hash_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/gp_hash_table_map_/debug_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/gp_hash_table_map_/debug_no_store_hash_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/gp_hash_table_map_/debug_store_hash_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/gp_hash_table_map_/erase_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/gp_hash_table_map_/erase_no_store_hash_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/gp_hash_table_map_/erase_store_hash_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/gp_hash_table_map_/find_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/gp_hash_table_map_/find_no_store_hash_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/gp_hash_table_map_/find_store_hash_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/gp_hash_table_map_/gp_ht_map_.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/gp_hash_table_map_/info_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/gp_hash_table_map_/insert_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/gp_hash_table_map_/insert_no_store_hash_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/gp_hash_table_map_/insert_store_hash_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/gp_hash_table_map_/iterator_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/gp_hash_table_map_/policy_access_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/gp_hash_table_map_/resize_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/gp_hash_table_map_/resize_no_store_hash_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/gp_hash_table_map_/resize_store_hash_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/gp_hash_table_map_/standard_policies.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/gp_hash_table_map_/trace_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/hash_fn/direct_mask_range_hashing_imp.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/hash_fn/direct_mod_range_hashing_imp.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/hash_fn/linear_probe_fn_imp.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/hash_fn/mask_based_range_hashing.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/hash_fn/mod_based_range_hashing.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/hash_fn/probe_fn_base.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/hash_fn/quadratic_probe_fn_imp.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/hash_fn/ranged_hash_fn.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/hash_fn/ranged_probe_fn.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/hash_fn/sample_probe_fn.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/hash_fn/sample_range_hashing.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/hash_fn/sample_ranged_hash_fn.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/hash_fn/sample_ranged_probe_fn.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/left_child_next_sibling_heap_/const_iterator.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/left_child_next_sibling_heap_/const_point_iterator.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/left_child_next_sibling_heap_/constructors_destructor_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/left_child_next_sibling_heap_/debug_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/left_child_next_sibling_heap_/erase_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/left_child_next_sibling_heap_/info_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/left_child_next_sibling_heap_/insert_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/left_child_next_sibling_heap_/iterators_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/left_child_next_sibling_heap_/left_child_next_sibling_heap_.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/left_child_next_sibling_heap_/node.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/left_child_next_sibling_heap_/null_metadata.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/left_child_next_sibling_heap_/policy_access_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/left_child_next_sibling_heap_/trace_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/list_update_map_/constructor_destructor_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/list_update_map_/debug_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/list_update_map_/entry_metadata_base.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/list_update_map_/erase_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/list_update_map_/find_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/list_update_map_/info_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/list_update_map_/insert_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/list_update_map_/iterators_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/list_update_map_/lu_map_.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/list_update_map_/trace_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/list_update_policy/counter_lu_metadata.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/list_update_policy/counter_lu_policy_imp.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/list_update_policy/mtf_lu_policy_imp.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/list_update_policy/sample_update_policy.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/ov_tree_map_/cond_dtor.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/ov_tree_map_/constructors_destructor_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/ov_tree_map_/debug_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/ov_tree_map_/erase_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/ov_tree_map_/info_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/ov_tree_map_/insert_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/ov_tree_map_/iterators_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/ov_tree_map_/node_iterators.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/ov_tree_map_/ov_tree_map_.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/ov_tree_map_/policy_access_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/ov_tree_map_/split_join_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/ov_tree_map_/traits.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pairing_heap_/constructors_destructor_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pairing_heap_/debug_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pairing_heap_/erase_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pairing_heap_/find_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pairing_heap_/insert_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pairing_heap_/pairing_heap_.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pairing_heap_/split_join_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/child_iterator.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/cond_dtor_entry_dealtor.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/const_child_iterator.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/constructors_destructor_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/debug_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/erase_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/find_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/head.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/info_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/insert_join_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/internal_node.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/iterators_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/leaf.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/node_base.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/node_iterators.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/node_metadata_base.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/pat_trie_.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/point_iterators.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/policy_access_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/r_erase_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/rotate_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/split_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/split_join_branch_bag.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/synth_e_access_traits.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/trace_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/traits.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/pat_trie_/update_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/priority_queue_base_dispatch.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/rb_tree_map_/constructors_destructor_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/rb_tree_map_/debug_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/rb_tree_map_/erase_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/rb_tree_map_/find_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/rb_tree_map_/info_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/rb_tree_map_/insert_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/rb_tree_map_/node.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/rb_tree_map_/rb_tree_.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/rb_tree_map_/split_join_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/rb_tree_map_/traits.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/rc_binomial_heap_/constructors_destructor_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/rc_binomial_heap_/debug_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/rc_binomial_heap_/erase_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/rc_binomial_heap_/insert_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/rc_binomial_heap_/rc.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/rc_binomial_heap_/rc_binomial_heap_.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/rc_binomial_heap_/split_join_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/rc_binomial_heap_/trace_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/resize_policy/cc_hash_max_collision_check_resize_trigger_imp.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/resize_policy/hash_exponential_size_policy_imp.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/resize_policy/hash_load_check_resize_trigger_imp.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/resize_policy/hash_load_check_resize_trigger_size_base.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/resize_policy/hash_prime_size_policy_imp.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/resize_policy/hash_standard_resize_policy_imp.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/resize_policy/sample_resize_policy.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/resize_policy/sample_resize_trigger.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/resize_policy/sample_size_policy.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/splay_tree_/constructors_destructor_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/splay_tree_/debug_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/splay_tree_/erase_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/splay_tree_/find_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/splay_tree_/info_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/splay_tree_/insert_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/splay_tree_/node.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/splay_tree_/splay_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/splay_tree_/splay_tree_.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/splay_tree_/split_join_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/splay_tree_/traits.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/standard_policies.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/thin_heap_/constructors_destructor_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/thin_heap_/debug_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/thin_heap_/erase_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/thin_heap_/find_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/thin_heap_/insert_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/thin_heap_/split_join_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/thin_heap_/thin_heap_.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/thin_heap_/trace_fn_imps.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/tree_policy/node_metadata_selector.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/tree_policy/null_node_update_imp.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/tree_policy/order_statistics_imp.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/tree_policy/sample_tree_node_update.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/tree_trace_base.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/trie_policy/node_metadata_selector.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/trie_policy/null_node_update_imp.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/trie_policy/order_statistics_imp.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/trie_policy/prefix_search_node_update_imp.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/trie_policy/sample_trie_e_access_traits.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/trie_policy/sample_trie_node_update.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/trie_policy/string_trie_e_access_traits_imp.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/trie_policy/trie_policy_base.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/type_utils.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/types_traits.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/unordered_iterator/const_iterator.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/unordered_iterator/const_point_iterator.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/unordered_iterator/iterator.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/detail/unordered_iterator/point_iterator.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/exception.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/hash_policy.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/list_update_policy.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/priority_queue.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/tag_and_trait.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/tree_policy.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pb_ds/trie_policy.hpp create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pod_char_traits.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pointer.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/pool_allocator.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/rb_tree create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/rc_string_base.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/rope create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/ropeimpl.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/slist create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/sso_string_base.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/stdio_filebuf.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/stdio_sync_filebuf.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/string_conversions.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/throw_allocator.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/type_traits.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/typelist.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/vstring.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/vstring.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/vstring_fwd.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/vstring_util.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/fenv.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/forward_list create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/fstream create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/functional create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/initializer_list create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/iomanip create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ios create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/iosfwd create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/iostream create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/istream create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/iterator create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/limits create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/list create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/locale create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/map create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/memory create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/mingw32/bits/atomic_word.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/mingw32/bits/basic_file.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/mingw32/bits/c++allocator.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/mingw32/bits/c++config.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/mingw32/bits/c++io.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/mingw32/bits/c++locale.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/mingw32/bits/cpu_defines.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/mingw32/bits/ctype_base.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/mingw32/bits/ctype_inline.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/mingw32/bits/ctype_noninline.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/mingw32/bits/cxxabi_tweaks.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/mingw32/bits/error_constants.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/mingw32/bits/extc++.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/mingw32/bits/gthr-default.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/mingw32/bits/gthr-posix.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/mingw32/bits/gthr-single.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/mingw32/bits/gthr-tpf.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/mingw32/bits/gthr.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/mingw32/bits/messages_members.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/mingw32/bits/os_defines.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/mingw32/bits/stdc++.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/mingw32/bits/stdtr1c++.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/mingw32/bits/time_members.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/mutex create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/new create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/numeric create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ostream create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/algo.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/algobase.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/algorithm create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/algorithmfwd.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/balanced_quicksort.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/base.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/basic_iterator.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/checkers.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/compatibility.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/compiletime_settings.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/equally_split.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/features.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/find.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/find_selectors.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/for_each.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/for_each_selectors.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/iterator.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/list_partition.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/losertree.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/merge.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/multiseq_selection.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/multiway_merge.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/multiway_mergesort.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/numeric create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/numericfwd.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/omp_loop.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/omp_loop_static.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/par_loop.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/parallel.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/partial_sum.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/partition.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/queue.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/quicksort.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/random_number.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/random_shuffle.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/search.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/set_operations.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/settings.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/sort.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/tags.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/types.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/unique_copy.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/parallel/workstealing.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/queue create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/random create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/ratio create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/regex create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/set create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/sstream create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/stack create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/stdatomic.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/stdexcept create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/streambuf create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/string create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/system_error create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tgmath.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/thread create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/array create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/bessel_function.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/beta_function.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/ccomplex create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/cctype create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/cfenv create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/cfloat create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/cinttypes create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/climits create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/cmath create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/complex create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/complex.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/cstdarg create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/cstdbool create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/cstdint create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/cstdio create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/cstdlib create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/ctgmath create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/ctime create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/ctype.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/cwchar create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/cwctype create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/ell_integral.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/exp_integral.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/fenv.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/float.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/functional create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/functional_hash.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/gamma.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/hashtable.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/hypergeometric.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/inttypes.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/legendre_function.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/limits.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/math.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/memory create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/modified_bessel_func.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/poly_hermite.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/poly_laguerre.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/random create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/regex create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/riemann_zeta.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/shared_ptr.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/special_function_util.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/stdarg.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/stdbool.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/stdint.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/stdio.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/stdlib.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/tgmath.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/tuple create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/type_traits create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/unordered_map create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/unordered_set create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/utility create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/wchar.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1/wctype.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1_impl/array create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1_impl/boost_sp_counted_base.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1_impl/cctype create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1_impl/cfenv create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1_impl/cinttypes create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1_impl/cmath create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1_impl/complex create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1_impl/cstdint create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1_impl/cstdio create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1_impl/cstdlib create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1_impl/cwchar create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1_impl/cwctype create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1_impl/functional create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1_impl/functional_hash.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1_impl/hashtable create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1_impl/hashtable_policy.h create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1_impl/random create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1_impl/random.tcc create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1_impl/regex create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1_impl/type_traits create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1_impl/unordered_map create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1_impl/unordered_set create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tr1_impl/utility create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/tuple create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/type_traits create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/typeinfo create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/unordered_map create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/unordered_set create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/utility create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/valarray create mode 100644 mingw/lib/gcc/mingw32/4.4.0/include/c++/vector create mode 100644 mingw/lib/gcc/mingw32/4.4.0/libstdc++.a create mode 100644 mingw/lib/gcc/mingw32/4.4.0/libstdc++.la create mode 100644 mingw/lib/gcc/mingw32/4.4.0/libsupc++.a create mode 100644 mingw/lib/gcc/mingw32/4.4.0/libsupc++.la create mode 100644 mingw/libexec/gcc/mingw32/4.4.0/cc1plus.exe create mode 100644 mingw/man/man1/g++.1 diff --git a/mingw/bin/c++.exe b/mingw/bin/c++.exe new file mode 100644 index 0000000000000000000000000000000000000000..8c36648f36fb61139122cbc211d516de69fe7a1d GIT binary patch literal 206848 zcwX$i3v^Re_Aq{Ll0qmcw@9mq6svD*Vs?obZ3Z#h(liD*AnSNu@ab z%S&cG^t<`#k3ad?gHPW3Nc#QvKKkfma{7G_q(7-Vn*O^-(+h5znf}OQa~~L+l$1D} zmodX82-C#`VN2Pmsd~Asf@JJ38m<*&Q4oeh>&}O|&Vz(x_+JVzY#lxuSi2Eo(lbA9 zq?a+vjMOhdNN2eCCz+un3vvJMF$$J`!vF98#>x*Ykl}ake33N>`x@;8`*)8p{+_XO z@0IU`XKNpU_1z4=3&b9HR^cB1*e4m{J(;cWk$ zSl;hgc|;qak&p<#!+PRdh4KEg<^O;G{_pwcP=9nC9IO_d&}`<6-Kug*6EZqAA?Ia5 z@IRfOyFSd%p$3$^%c$Kc0YDX@1_@Cm4-+-%DifCO__4h3v2 zwe&uCZInFaP>!p+Rlb-I5WO6eH0yZPG(0#Caxz?3w_m=ZH_i;i=?^&Jq|*3*!NZSY zKCDSi4*vcjXntFJFb{r%pJNJ^VJ_F(S56IwlBSjdRW=9z0x0Ux;lW#g%8V>=RVE|i zvPbo1g{(lkQks8eAOX@flKMC#1S?NNg0JH8=={WVLo9t+e7crY2{84?qR96?`Eq<; zroUr<*!&KvKz}VM8+zs0B4^;}tjHCDpF;m{0m@z)fL0~}1Y7v8$8gBZ0PY8Pm?hG% zWi!de@K0FYmd(*}eKrfy1J+KopDw=@OYuJ<3R^bML%i8AA(DNHMN6af&DQezTq2(t ztF>aaK(hBC1I&88ECek?(465WXa;iM;3;@_)g<3}7qo!QvlO8DqDN?0pw88|ic~Dm zW5X^k1R}d?Qtsq!fjkB3W}mG|ufzN>tQr4;Wa(quuFHgWLC8U|E}LC71(XMI>i>W^ z&m1gwTWKQxpf*#v;az%}CM~TQ`sCRy5A;1HXvW~nkgVNl^6XZQ1`;p{|J?y4{@3() z2VO=gU_+GiPI;j0RZa%uj|Mxq%>Jo>NW+oq~Xb8+pan)31m=d~YG^>Q;JHj#3qFNJNfNLKOJe3WB{4h>=r=WUn>@mqIacX}hhb{n$cB}O zn5!n40W*+b$z$VrH_XF80>U1He)fdBstv5l&`hY1=E_T4OIZeMhX zGyD9plKaodS}g;Br+IS?x!C}D5g>V)+ZP`$uZQ9Dr3}tYZGZ>q`Hzq}1=MdlRvFVU zNu|HO{DjN|M0oP4fN|^t3m%|swN?|X>jZ6L9lT_=OK#wHz{Q$zLNpw2yrf|zVrfY= z_?OC8H;?>6-8u5>%#({RQ>)cf%&4}zYKGo<7f=WK;k<5)e2BzMXb8>^H5H2pe}mH# zL?Q|WKLCPj?}XJ&O$+^j@Yvj>v@%Ge_Jyv7Bxh0(9u1+nz3HuP_vMK=U!BuL-sM`; zU_oz840n!dTdUgFl&523Z4Fw|aD1?DaD%W}4E#4>tHa?9*lO5M1^(39cEkU#;kA`P ziBp!+&}zjE8GahwnkLoHD~8)$91$byRdW$`b(M8H}0j6`E29MX@(Wt7dDfH5mYILHVr}x2oC0 zBMvNRAu%M${VNXM)qL);_DxmoZGhUbN-b`27Vj1mw^rPuDGi#vsbdve+$JbnP2ojl zK+{|&43cLKbqY{7Xm&rKo>8mh{wD$|E#;ooX4b+Exc85UD^Pzzdr2(Xjza z4|Y8WkG9oXQ4R7^&0fQ?zi03)TPr}RbcBAvpst!ZG?HG&ZlF%+I~0$ay;4(ZkiR27z zKN)7GtyOcZ4juXxDO%%+NN$rz(@PA$VzgC;o3ykwOvVhxMe;c3;XCJ{aFRUESfyIp z+Or`3izEK~j4A9Yt`p?*I6Kmc>-dbQpiz+AL!d>`#2TJh*=yd1`U4hJXQpzY+Jy&M zwVQ6luGQ&DG?Un{zey<#dI}B&O*5JZC6u@!G(Lirhm5DsUi!U+Ruj64%NSb6*(%8Q z9bShS+Xj>7rTzR9JY*Y>=PPk_N+*xb^t9OSY=1 zh^VER@GrGN-7#{H`t``YnWqb9OBBnG!mu&Y7mY?!LN0kMje z7oAC0TG1QyuV&YLns9)#dxibbD3T=rf-J<(dj)}-K_4=sk@gZ zh?X-0b)|?hAaodNg7v@H;)%%jX5N&n9Mk$@$vE}xZNUrX; zm?d{Y32I-cL%k{4H`%04HbXv|N|Q|}y34V#>ST*bt&TRsgT(UPC`#)J#ZI^2zcOF2 zO73})*i=Mj2Tj3N?!19o8FD~!WqMgI8j1mRhQ$>etaj&2Da{p>!+``W{~mbWgnvSZ z7(a^2Dy`V!DmELGIpuCLc@|C0=nN;87G_Sw_eEL0p}2SjW10-Fnh{jdHthm5N0Enp zbsrK^Y1Agu>w~Ba8+q2npJ(`Wc?WH`92-W<$owSgEifA@67mFHUEBBzm!G6VqDlv) zU5KUC0(%GZ;R;>ZRc~bxwg`p>gb4p1D$rCjr zDV!6A2QOgFKEM@wmi|sG{rJ5sJ^VqmuF5>Dt0h`j3$2H!T>yF}U@pPF?1RkkT!GI! z;F((}>DZ-p@Sfq1%752Et6Ce!BGkI$4ZbN6Kz6mZ2aAh9vo08Z0X(aLj#b{9BF?UH zazAI+9NARcciiOKzGHniiM7DSK{#7TVUs6-ekPCeIhynlT7Ea#8gt`p4XYqXWqxU$ z-}k@?9GudTRj#f+a)zrbQTg2WxVY(OX!-}nj<=MLy)#T$Y65C~@A@83*c5`K_2`ib zTjrG_Zb-+~=9OmXCC1IK(V7Cfxy8A_Bq(>%LxLbrf(LDIPu_TQM9a7MEXkQSBtJO~ zX7RR;RpLz0?k%;}1OaCfTW#84L<2@QGx_PPS|LlFX$gM-^})<<555g^8^&!}484@- zFqBryw>QHO=38LFgx@ID`4KKvKTCj8!~cx&^KDvcD-Jhsf$FM#CZnTG8=@Aqy1GQ^ zg^egX?l6O-@@&ROrPVvkdGb~{Ra*Kdcz2$hCnq{jJ|cOR!dodQ50gR3*>prFo~E>P zye0jqN_xe%dy*Xr*#khJrk2!(tn;hlJJjP<2TaD|HqF+GhL5dHb+m>h=x3oTkevCI z#ljrvv9evqVX+Jx(z*WDx!scJQ8N}I1>e0pgvq_5J( zyZp(Jq8y20*bUUDBhu1)QQA|VoD0N9m7sHh;W1^ObAfS; z(!$I?&DKI|6x1f@>WsUns}58dl~3ZT4E=`df32aUNK9sAdy~~#rbFyPo7LH!F1b(R zcy;%a+`rJnC5oxE(0e{4$tM6TcR0JjqWO~2MoVrK$7)B|RGRM{B(1BKK4vWX9ngLS zCG6}TBky;1kCMN4cIU_~kVD=H`Q=7uw^ja9Z64VUBkAnEQZa{y0R5qixO$3r3CbPi zNFvb6fDhlO<>36w@T*FTTGXU&F4e99MVlGBEjp_zC?Zxhh&1SaknYUxBPgcY$rdpm z$eLBus?=#kP2NH7M&&nZvp%xWMIeGms*dk2(K}mI_k<3@^2tX`d51SYlD$w4XJ0NK z$eyGG)aG!%d8JlwGNfJa?9P&No!!N9wzK;(N^UxW$s6fjZjrR5KaNl{Q`I);GU7acKH7UQ4cfqum6g$X(+HPxb=o~gzT9t3s ziaK{dzTuC_@t92HnuOd>7ht8@L~_J*N*=U#k$Vhg+6>OO;4Rr8s;XDcLTmQ6!7y+_ zo}exmT;7Ji`KCa=1!d^Q2q~885vI@HknEc_RK3Bhx_B)9_zV@N7F6iG*gex$io7g_cUKZa0JaMvfiPurLhhBn$%M!$>e?&->XL+^;rh7?DJP4jks>C+M2;= z5B9l1SD`gWlV)oUJFzH}5Y@8*FZlg5R9y(k)*M3K3-dl=YjN3HlQnxwCb4B{sb+|F zThzOKJHTp%^hg52Lrt(6)m=Re8lP!MCNou@Z$evU=UHqS9pNjqEsZ0n5-S@O60sm3 zwONyZtGA&$>ORK16VY7885}nX7l||q=_7iL0xWZF{QpeilG_QH|7+vc%#B;XinC=yE#0gkDRB*1J6UhYdneCq z<}15YPVKg6E+vRHYaBu zU35j}b7rMOT?k@}Oc3s{a`=Pu987BYm8P{~*nkT5F~%5k9>>m{0O4l=c`TJxOY0iN z?IfXr+vLp^v$G`kaGq@_{9-Y`!|dC_1Ll>YD;y!W0wfpe z$WnerhqhX+&bD|dFLGa3Z8Bu{;Km_oJ)p%H){4dil~w6{sVf8w*P4RRP0kePH^%_ikJ4f3_PwnWqbIvY_IO#>5eF7!Vm67COc za57Y%xwrV1%-Kl#SwQ+eOkrptg~1;T&y12@OU3b18?X*rvv#9NHETCo)G6kGm7)g% zRub=dD&a+JZK1oNQ_%C!U|c@iG8#h$l#-1h++{1r4yrcjM+5c4)|6>$kbFDQ2bXpa zh1r-Ze}}U4)GY+JI*Z%V-XO&ju{DIIGad$MP*u2$@_&ap<(?P>NpT2Z&X8O_J(pfyfWzX)4M z=N>0p;N8rWU*)j6Yvk5o^(ivk7CW=XDHG5eG*iUfkEvBKoj=woM*LI#BBL?<6?PB0 zaszfH?MI+o+z=(ubg|bPlaONCh3a5!s_9)ig*jgKUHvp0p#i!k3FF6VT$wtPu0 zvfU-bSW0oSZjmQewHinZ$EA8K*#9a~ScyrR1>RL{9EvLFxoVBhuG9c>;y{_f4x}H5pUEOgRdel`$b(K+F%g$QY)tGge zURPPHt^wz$YiV2tsw<|uZ&yK6O7deFH;Y-R8{k2nU0#W}N}D>NL`}uCfC;yHgiQ~Z zb91@lEv1i|I>ky39pqu2PWgO|JfXDjN|}cTKl>TCUAf)wGo7~*%dgsJMA1!^AWNA$ z9$H5=>g@=-VtjkEx)WVg7=J@Ka(#1i;p~|fvP>r>79epC)Nrl7a$g^aJI~Xj{r zcK{AwHm~Ed+5bJuBmIXwm+y;;f6DXW_wn{vwq~OpnWgg#xD8~{&Ql#N-oz67F63Tg z2-xDiMJ#db2IEk2-zK6JeVydK2_8NnP05BzqmbDkd5+S?5-3s@-}Dj_PLzQ?c20fI zM7VL>24r3OA)=>|f!xW}`0zmTkAO&3+7@M@Qa%u6Dh@x$RT%rhHxkclQM+OK4myM^ zNB&wHBz8lydA`MU=nE-o!99r2iTzr%878$k*bMAht#uVQ86>wP_Uf)TPb{(Rrp8Je zZM&*k&C*84?tTq9Lbf2V4c0}!&B?wFUp|JHoE&<50Uxg;ly?Op7S}S({{UJSwj!-_ zvM&J@qB!R|_))&|bS}6XnpRc?+<10rM$}O=uhdz*>k`S04zN!W7-7i~@(tJj?A{{3hhqSJEAX22!b?4!&xFDy^Wb;E62J;K z!$b4&ZQ%~oWse{Py|miRW}p))c4}468m&m3&^~BNMtsHF*nWHqPORJavdMUTugSP5 zZZiIPFX2}p{>Z&?doRdaG{vlL)=+aFob|Y+xF7D#XFhIOoanpFq*+ZK+>U3C^Wg0( z(6Z{eEe{$*))dnsqdEoYkIEoA4K|NP|9Y#M3=~mknAOKEnj=}Ak*p0uC$LdxHgS7E zt>`ZN0{w!sV3GiR%H1?)Tgpq2+Y~rY!YKPp&x2M28tjXopvkluirca2CK&Ve2FC4D zfyc!IBzKW0^a>=%vbW722F)H>2Qyu)(mR)Z12Z3?<$^1ml3CR9)C$ef93Ba6L4w}= z54MT5d>T`4n&byuKY!`g=!#dE_EGF$vpk^B&{!&cGSu@e}ZXLxAMJO+zi@EoSzd2CB29n zOrTCN{}f|;6L2ZMw;N`j4VSSHm#g$lP~0AdLQyZo<$=Q|kg>@2B=mTl?{`Pzb%G;X zphm^ab`(O=R6V8!+rB?~c(OY9|kv8Tl*{KpW&WfNnfEdybp}`f(o&43ZPI zd=pD1`x=Req+dckRrYDdaCMLJ#52lEhVm>>UJ%Pu_RZ^2P5~>Y9?IDo(^G2IFT6H$ ziET3#@EjEIbhJT_bZ!=vIRRS@?lQu914|QTdrw(}7 zo@o_8R^Id-&VlLrT7j}(hDi|q2RyreI8AE{HzYR%UoT|iyFu;?w5&(@0DYK|B?{q9 z@#C7BLM~j%jk_fph2i+}#4L&e;(OjOI4tz1R&wtY{`=6MTlCPM^7K41Drc)5TGCLo z1X2g1cHbO)=ojdB4uU)pc|bXBY^I(-K0UNFkdVS7s$#J^EKaCLsT3QF3uQeG)KRup z?nM5v8R}db_Hus9JqHv!blWvztg{q?1ag~45T!+8{)30Lqzcl-CC{lo*z?i3j9R1n zFgJw2qh*=uoLrfLmG40VG8G}n|L+7;)lfc~tG!=l;$CV-q;#_L+R=)6Ua1v+{8T_QZI4Duxaz1YNB!BCasdb`-v}de=elVNMo^tTOQ}{==bM!k@ulFl-&1I2 z4Y9gHCf84+I+8484Y z+#kQ#YjpdS%R~80_sJeEUy5>H+DPj62Y`}~7?S%^^ch_$o3iI9yAT6PnFECdmjX(- zzE%*dq0PTy{Aa0^#ee#Zu+Xu)=&4DqXHO*2zeq+O5l#{JW|*WIyS3uV@Zi!+dG86? zjG}i4l$ljjC;3$D*sQ%K?W+6?Kc-7%{%x&3dmHFZ7`4QrGq|Y+#aqyilF^8H%c}b| zF!xYB)_L+G@)7@44QTc@T&ABH*mQoSDH7S%N`@y}Mq+nnL-7Eh#kSVWhK1eCBxUw> z)Fj<@Ne`1$wbzASK83u2Q|3~njGPN16~?tM+LZHw&%mg|63i^BmlvL6T;9NOnUG82 zw$a$y(eMtLif@e$xJM!vay>?`&Dmz65RZS9>S4QoMST&d=!SLU+Dxg+57D}rUZPzMC^V8UC9!N2O-k#ie!LN*F79MX;#> zO0`#nmvIhJ&p8sUl9xX2jzlU^84QKsDWj9NeS>SRV*yXe7$vv45egs%;VZQA!fAvL z0ahq*5>gGJzjvWhOgu4Ea*|B5UTkanacoDWb~Bh?a*}Fb%?K^;#{A*Kkl{m|qK-z& zT#wIF+4Dc}Ij51?gqQd4X%nt8#cV>)Hiol&U{9PiaX9yGW6c=)t*do0#l*n!#Z0Z2 z=cC`o%zGH5^|DQu!+$)u9QlB4nd(@j+Dp}HuOMx#13fd#cZaAct2~|ZG#22DVRuY( z!KGJXX8HotB#;_jqq>W-DxYgQ!A+f!2#qI-rE!2cg$a9Y!tyashUWO(s3wR0tsEm-|MPHLiH=c1(GOPwfFCC{_i+yn%(8dIWm|EKmal15uL zjP}>0b^ge3&-6EQg&uotr2EYo6YG0u6|T5L$0*9Q8~3`FS(({~%pNNz zN$VOq-REJ1$r3psKl~HOgk7T?D{!(HB~(IiilXb5v+{*WDA{Xrnbdz38lV=HsoTS# zu0554pyvRTd6!9PSBZJ7ARbFw`X?umCbkoJnk%A6Zm>H9SHvN?ufvJj=!*Ovq+n)) zvQFKl6_pXnorLmx$$bk>Is0;08(?NF$I{+}(zL?l5b|3f!D<|v2kQCQpa$^Oc`&a> zO72?xEt1?D;TIZe&K@cE&n}|92RcH5-PI<};ChToJz5SVQj1rpJE>n5On3zQwJ2F( zf@6-}smocXpvB9z;uX*}ZM-XTh2#$O?|l@apkEq_pnksvAu@gV#jfw$RePCwRITGQ zR(EXLxhl5G{$yJry;60peTC$Cy+1CLF|}5)pw?=*yVh#F+vPX8stu46XF#}y)Yg!n zcF%!!0Uj>;8g8xz?;e7hc{z@mT9~5J;Axbk&IakV9H&LHMD$e$5ZRwg;v@59683^d z#;+EdS(o3xfI?AFS?X!?O+6~4(ABPBOYAaQ&#ieuc_w67o+6{rW#Tq_E- zrt5UI1Vd4RmuyAPj-af~@I!H5ql73fMgH|KSP>aph=Q7}G)Yxn#}ez=ix6bw!7fhH_e#Q z7)D(#J6%rpO%<~*ll$d?Ar3i|gL#^5#gt(8myyWID}Yu+6*F&ac|jSp<*hEpaQbz# z*fhQ3eO(+Y8?l@m>xVAh9Q6yp*@$mxcxI^gk(y<+;_=WA3nLfPdh+Y=C*{d#`&#K- z#Iq7oGovwhA*;r%AQOI?Bzf~(pcwbL)!N$N|Br&t-i)ILQ` zX^**4TKedTNF@787U-zj$~4E4k=3eWd4?a9x1tgZD`$as;$H0nTy)bh-fjhVsqsbo z)kN}h(2Fumvy}mp>8IJ3II|N4Wq|7@vxx$OY6}KiMA})Hh_x?%ODihz8bgPU^AVqd zBfj)F8;SwIA3_J=rIga9W7?BE?I;L|P(w6r7N*VSX&+)*1*Vm+A@xAMP9Lb3a1D$- z9=~ML>5Y;JJt*}^7Exu(S(Qt!k!U%~F=>BiJYsWatQP2iTWyw zw50JQs^pn^*>57cw@2oMab;u1;2%&w8P9Zc3r`8o?vZCoC(YsaX%4qkvZ>rRHkHMm zQ+YimLEZwK%8zfwye)pnRDJ~joY#UTZi30WJ_-4>z13%H=3IrA0ne5R*+LUe;kGeu zi-P=Jdig2b<0z-yPt!8JrE7kPZ|UFREk832vn>85bPPFX+H$58E=^?lSM<#PaF6_V zvHZ(f{^pZ>E?tXrBJUSAC;kr5(28Gh?;5mkhp&psCvFR!2N$9V@!7pFS-g@|JC|w z&j+zTH`ahXf^tgNg`GJEQ5%!oQeU+8=vV@*+pT1+fW4MX=2IHNrKQaPEf3;yZP#X) zJdJXKbJCUaciIedRw^<+r4gy43Bmc_bHv($@fI=sDG_Z35-sT%BbpD23jN_&RALx( zYE|{6u(Pp`xkxS=;^=fcN{xx5xq5O#cl6X!?8Hwm(u-hvF`_dWEbiixXyO&Tl<&LF zEQLbESOGYzS(q3bwV0Gx*1_k(ZP=~fcCc=}0>y>OI&dzK_DlHL&q*FnBFfYi)?ibT zK+&A+jAhXA6Sp+*)TOn9ojf5mfbS7-!=vE&Q>btheuY{&RDWRyIv|&DHhVqxVs~kI zY0tU5;%NL_e&s05*xdHB%0&~)keq59q4qK z;wG8p6Eafs0seM7n@nnZa7sHHvj>6ch2CQLnz9^> z^lQ9{&aQO%a%WdR`4VSWjy%-aRV-iN-Xag;8hVM@nisn080D!IK!X=SgEx2+0i_>T z|HHd$ndSttKG<@Y>1fxtlhO*d5>|Q?=Oi*)v4IqAm!CM{$0MV9Fr}hnt(-V-0ja}W zqnHc!Ay@lnMHLQKTsy@@qy31*)|&bV>O@rUwIn>Z&b4Z8V&{yBDJIOsmfT^WJv!0; zW+6+1+^87Cjjy~79?C3?A^)A~c?jS3;pR6Lftj1|jS}3vc;GBJsZy~~c~olfWHkm! zknO?XY>irynUyhr1dneZp8)H3!7wP7xlrL9nL3d3m zb#`ANUr^{hA3%eg-6NI5=!PEx?VK78<%ah|o322Wc;ZG>74Tky-ZJGgTuT#iHiSk4 z@9^0wcwc^xO!m(s$@l453DZ{k*!D@>F);T_hkHcn68^R;8UFmkQ6_8DYieO}@Q*5B z>ORcGq46BNmUABC&u6%Uf;SC~bB0Xmj&8P7;#GQLXe3b9`7Dla5=ND5#}UpmK$-6! zWP(ET1GrCUfBTtL9K0y5iln1GdPxXh=m?=pPV{WR2ho&oJDGP8`$pQb?iI(Qz=)3I zy5&4N@@Z?~bAh%~L$$y3EObt^&>N5TOv$?lR{*LIEPe0sp6QoTIw}WjDuyD6aCBsK zaLFd*(<{o;6Y|J=G!FXrDZYdUl)5&X(O1vr5rve&lD~K)42I}V*K&YztMjJ81({^B9MT^B{E`P z0YAZK`{`R8Flr+W6d70Yi^z8{iPiZTTZ+syq2x$qno60P#P(7MEk$QdldnK$^%9lo zA@&kA37e}q+$uF!vpZF`{Aq;8*Y%N#ZVC_kA!B-a--mA3xDT57~bv_w_^Q?s{r{yaj(M1dGWE zdRb^;JK=&_!|m759Y+Yl+(Z?y>U>WcVv^xHvq)pqTR5O?3QZa{LKhrH$MSgr!`R1a z^9;z+_J;u-nm;7gd@0&|RH~fNBeD=Z9R3mAC~blJg*-M1(4Ys#d{R-l=WD`mT()dv;Z^Qvp!aA)OYh0q8F~`v4(iI z_Wy%}Hjr=yf1&}tIEahpSn#pE$U~0BoyAQKz7&a9PJcNN=W$0zvqo0D&(von{#r3e z9cOMU7pVREz$B-aqgDG%zLaDZvR?JQ$(LYyHdg*m-4JtGZcJTEc_XZ6lAUd%@V5h}CHJwvJWmN#B#^Xz3G% z2d^EDE=xQ|&ZESF*8xPcwFd7y9Wx8#;zyA3w$@m@zvRIUZrl>Yt$xjFVnL!TOl&;p zfD21w!#Zp~b{gjd`WMRpg_~N@Yg2p$15N|w9-gLd_L}j`^?i8ex@Zb07s`QJqwWU- zt+VmRNTk*{R(Dolp}~y+!?QV>qfNWY)2Vo3Rj-63{jgbWL9#`R#hAp(Tm(qrf5zS) z#rJ<@Y^lT$yx=`?MQEmE-K?65G4MJ`Lfxl(objKd+UoJ(Ym-oGYXPNa1I;U&pXQaV z5&j3@f2~+++b($fWT(rf?0$-|Fx-)SiR9iRG9OA9&&6V5S9U-77rf?Y9i(KBmfUrO z(Tdx<9pOIgYycQV(#K_F75#A^9gh7edyKq4dz8E{J4fD=JzCxcw$qMmtK67BQ6^E(nM4^*`%C@}cEdu+y&3Spj@jibZW5Fx zXK_GKzM|s{b?z-n4W3F+HfHXTKatio!r~a&p%&p;GY=jp3)q@zR+EEJb+mdK7tQ67 z#eTK8PCc&HqAf9qpS>kniqTGMgLRj%Xs5NxWtzRkvxT3(H3&+o=4ghYd%ub#OW)f3 zB$3A^XDO`)DO_#SaM->biIKHtTDn9R z)xIY9&vZ^2&AvwRV7LdmMx`?UBwL$2+}l?z+Mp`_(6y-H!Qe=qq40!##A6sCy!*@B zH)D5b7(BQjebHp{{0x{^ioTyLI?GvnIjsY+-MJu1gmr06!b<>}gF8-wksQTZxXarY z$qR+yVPYT=4Co2{_8yuJ73!{$M^#5tz(#H;S8;_P8&yXo4>zy#_+diuy8xQGgIu#U zYsnhL$;I_Nxb9+oM*K#zRghEI)%s@=z)_;JxEA_#y@=Nd!3uvI8T!RI>-%PBG4gmF z+s%$fT4GINZ_XDGb*>kx2i#IumnfHdlS5DA^hir! zRt#N@2Lh^L;v73m4kCgke1@1RvyR<@^xS#2#Dk?QYR!| zA#xu_n^B)){A7#f@YC)r0Ptu{@QyT+!8I6=-X5Iw8L^gic+A1pY&4^1qA8fS7oiJA z>at_&3Dm}Q{U=;P8c-S`N$OWXsfdG<$X{rE0ro2lBL)6by{S*WEK#n5i>nvCcP5|I(@b=RhvKo|CsB(EOBpbh^v=8wzx<2!p zljwHUXs?6z(9wFBi-pu8>K%Yu3&sILX9Khl%PGe^w$+~9@-=jEM20V4)as~DieoZU&v&%POv%isF*!To~?EOUMeUZxW70_o&s-r+`y=!)!c?2 z{SJ&*_Zp;Sq4T;#r5mri0HbYBcB1lk_6$$$&P9eqd5gLy98^0pi&jgnkx-esODkR- zHmKFUyoh&N1l@=U&aQq+pUe|a|HK!6-?g~-*ZO9P-Wx>R5xJri@lw&~PQtqLMDH|Ftp+^hTlRvFhn&wE5|yBDhUlFlqL}>wM$tPMg}935du=!wp~!B% zd17A47bR8DBIilSgEg8!$2p+d*1)=OtQmPUD8G+Qs_+h0tK7Tg3rq3jz#p6^eN7+_$WsXK^)_c%y2XtfP(a<%xK%>>KA!pK_&=javKk<>M$5Fbu{iU7|gq8TB zB@s%BTD8vr9aJa4-wIVWm~vG;#g|gLo=*AfENSj|H*^uzhMsQEKasB=5BGu2S=61r zTSf0=>Ky6`+c9?8Z01YtYi_<&T|kU^khjo`o78w~BW_YZZD1>N07oCNnxVfEMIV6Z z$3=#ISY+sZIeHdHzyAW}jq8HqyoIP7n*rVP6TJFnBS+@ydS19gT3081yo9zjI;%<~ z_bekjq5Ul2I={C{o+ofJ?F=Wywm+=OM9{c#vwT$XYTYh}nuB%kAVt<%HAh9T_N{ z(28H<*E-Fwhu$Wq(Og{jbC8ZqW=&lU8DQ4uuEv^Iq2J=S@Hk3Y%~h0Bn0XXrP}@lp zYa zT-@{6p}N)8)lYiK-Cq#&GWtGnrZS`t1Ri$NQn3OSoV@AtNaR1`Vzq4GUj3XVtMo2D z59A7wdz;WZh%lG#?fX25Vjsr2erWeC67d|%@$iG$bJ*ptwWdMiY6}L5=W1uh7IhbE z;IMNykdP<_rK<+C=<5V|idI}-7_rsEvd;p2z^@!tkB;od`OJ@#tB%s308P(4t~p92 zcUlrklSuYB$%Cc|v`Ps59`#vVAK1+`c&q|%cp6Y{p^%vIz;2VN1y^GFlCz{Qr!d7P z)m{e^1uT4@=}SCIfusM-5uBoxno(0K)jqD`I#F6W?L4%_P!iyw8vF^Tm1>R}&0eVv zeK}8c)X+JDdWw|48u@W?Jy=%036A|Km%e1VKurRo2TWLG5YUPvc%c+z_DyE5%J} zagAoH&$QJ@OYvS&y1cJmwQo?rsQSU67S)N{)gr%kk-BHo@7@C%;pZRl{PT%HdNkIa zO|L)#!d?T|rZ*6aB_ON}r0k|O2uqB@1|jTaXa)s+G1wSr&!#tez&s8k^2Q}r7V{L} zO>8=A^h-BHV&U4J&1gMMB=!W_$i>NcftJ1)%otFcS`X|Ft!Bx6)rFwv0Ta0LLR8A+ zM0TtE& zSNwu(w|C*lPhNSSG3Hl(IXBZ(5vQ8*qow}XW@vmlcmpUh-)X!Y@!aJQGcEM<3xBNq zmY<@Z1-5TOH_+)gKDq$P52v8 zN~zOQGWZtEroa9Z=a1~zv;rRVeVMmp+osJp9|r306E`*C`yl=OvP}o@eX#zXy2<>{ zIDE0eE00J={mp zwe5wWaVOF4-t_hwZdl?%Q|7Wob_Op=oy8*kJgConf@`|+-^e`dAY$WQ=T$OZLToDZ z{>dJU=HHMQk^vSsm{{lFK*HQ;oqS1$<|AHgkP+{SK*B>h9$?%|?T@S6f#u(W%p*1# zh9W0sE!03ur^ipf=Yq)o+ zg1`GUWwrK{S;ZqqAb=8(MfomrU=^+1``#Qd`3TJF(Us4F_dXv^VEH= z;2FjBR~87E9`c zNmnOAYmVdWS?jW`21R}C?UH*LMm!fU)2>&GD?<0tUP;`-rml91qPniE*LP z(_-VgNYR}I1q9bEL*Fr`;J;7`>$8?hr-)&d=A6V$Gh|$$o8Zw~&>z%E*$gty^YAg? z0-=7$fKC0`7Ao_n&cq-)erq(p+KHdro@B3)JQE<9uBDuM6VV`U5Z#HhqMOS%RP|X71m00uZCg z*PCO&Sp&8OO`yhd>!@>Pn%Q1&m?8l|_I!kgVvH&B>i10-me)Jax z-@@VZID8j}Z|CqEIlP*~cXRk}Is9D?KfvL`IQ$h3@8a-29R4ha3-2-bArph&$KhrU z-@)P2ID8<7Z{+Z+ID9aNzs2E0ID8m~FXeCphhM_sPjUE9#~6G#hu_8FjT}CL!wWh5 z6Ar(g!^bi>mqz6nxvKz|c#3lgP=z%IaEDLSIiHwZ0Rt$fI1@@bdRksQ+6zBw5uAHa zh+d+y%qR+>2^d>uTZKNJ&|HiLFWP{NYap^j#|G{vNC$}?eBd>Z9bFhRGy^P_*|-~a zpXB+tovt`_E-(n}+ZkhUj>77_!^rydI>rluoT%q}D*6tj(geoS>tOAF`giyf9>>lc zQts^GB{2UkqyoIeJYWUfs47h^TZ0LzR%WUvU8lhWTWUlR(V*p$QSVs{udH$Ga|qPH z-y3oNjvA=^&2`!!xmVzsqi4*nLk3o)8GG|jAYS-gVw2Z$HaX}RlhpS5OnV)Wq@QlW zX+taV2<&g@$Q6voRDC>(YS2D3{XJhTqLDa#g!Zmk?UE-G$_qV%!ZB?LDAw9U@*yZ? zbi{xTdp9uGTVY6G{tqpO91aV6rC%Q6&W5PlBCS0(=G<@8jh+hJ5;bY&RH?|R{_J5$GP^mlQ~_l?hV`UjN2Uf ziCWY7<7x}e7tf{EXKc~^hEG=TNa$Y=qcpA0M^}U~>WbJE=Zcs>yiozRo4J>y*B{Zb zoe#1@(V#*h{L0yy`NXMMGxJ4^XW1Lh``@+ktB-gaGylsrZi@(d8&P@d(MGI=v>B$h z{42sP`@5WdkjC^FCfQeE%-yRz3BOf?i~)Z!CYbF`xp5{fQ(@vwn>^}{IloF;WKWFqX(`w#9HLpgG zteUbP2wBiq)I(YL{RpW+0l&53s6mG1%f1$w=lauU9FiRn2?%2zy#M}r0V{AC{m#Q> zr^##JGkHvG_0WlWSZrAGrw0Hu-sfnAl85@}Qw3*Swt+5y>BB90Fhzjhs$PLv>0HVx zG@kHQe97~WD6m8O3~?(i(u;tAl~^}-Cx!YSJ~s#d$9_SNdk^k_*&nJt%U6VSWF-#y z9Yn_1i#UCb^b7oQK%72D`b7s8mhgC-evxqa+{=|Y92Z6z!KEMkPfR0*+qw3Cz;%={ z#4p$WXMTZ*v{F_9V(2PlcQAedMgdD4&0CS?Z@+}<;lptq9DXPgQ(>9M@n5F|T|>(t z?}{9Uf9&U&k^@QC0KbvL|JE6&=K%b-9Pa6i({lhm zjKd%4jMH-f-iN~-opE{&zz>~d@SM&#JqPCvhhNqir{@5CBZnt-#_2f#e~ZI^iPv)g zzLdki`z21#0r*oK{`oI)dJe$v;_!d|5~t??yzrz>XHxCR6#uagcSpAL;ZDr$ELOlY z1#*G8hNGLr3;bi46*vQv9Dd|!N4r_lJf3vdd%AKP+zCnaeOg?QH$ZwQ7ykI>n8ncO zqj=B<#j=Uv1=zJ9!TY;~m6#UkAS zuv@-V%Qv$xqO!}fA%_et3(kkav^y=H-O8SF+@u2I(#_KsVfsu+58<6EVDp9wk5Hd1 zxch-i;=B$#pzAl_$Pv7Y}9p34_- zlGMZ{%;*w?m?)Tw{m#{}fpw}F%!Ra(b2ci!*LHz4;SpmWC2rW%ek^ zy~N14zlpc)&6rtvUbGN5`pPi%-B{|W6VWQ_jojnJtUR@<>U&e5AkkC~ydobJxe0Hm z6B4Z}5e4kjkcqA5Xq|tJHT>^-sfu+IT2~tpXRRqb(AhPbePs|Y#TuGeIN58t+Py^y z;`s)j$r!x(ZKgsNHGxJLst)z6VMVNl>}b2)F9~=;h!dj5a27(aEd3x08KIO(@`UDSp!@!{9IQhH1>JoQAOs?^{WUg-9`8ic<$ zdC4fOz3*Aftt3ej!L`_s;Evg4H4_WLJD5$LruL# z6@8OM8gHyYJwn?&^=bfgw%wtt@URnoZzcG2Cr$DSAZBo}%BJy-7-g4r>a$^%ZXVRg zIru%tIUkxb{CI8qUj3TF=HR|nSS~sHst?3S@x>~g6zeb+5o*QS2J+gH{}rw6%FgIG z;--GIMzA7r2+mP!bF9|s2T)_HU=%~|Yk`3g?R3?C6H;0Mo2Jfa>7&_dREuG;;wJz)kRNtiaAhVW(sS8nML{+m@T?Xl*$Ob7otOvP{387s>J-4 zAMMA`&dM>8yV(-;r2_n~`|(UgBey+Qp|tLLF^(>r4}jX@n{VKYW^yQQn1K5qI~H9} zqj^#;%NzVQmQ>3aNc85h+*tANMX@||ML$t5>cHkCgptsS>$C}(7^9O!D@IMy`AJ2P zG3g&9R*Ak7-q4X7-3j-+h$N^0t$tG*h@oN3e>D`E5$y9~T(j9!xH#6PIdMzcGv*X! zE5K}DzreC>i*+T~5l^W!)-034$+5K~N)7`{ipKCP=O}Mb0lFuzx{?~On>1L5~&)zbvLk_zJ)5~rJY}z@F({(GW3`gYy@6A8g1y2KJjz* zzz`n!+Tx>7N{aCx?&c@Q*k=pTnJ8rlZpm;iEYGAsx=~2XXie4%c0f zC)*kPS`OD;kUwyEI*02n$S*kD%;CBV@*@s!=aWEpLH?D)n>k!}LAp5H&*8cY@(&!o zn!|M$vUJ+W`aqc$)=v;^4{UIkISov&ps~C9X|WG+<*A&<8s5{vyaQwhtEDP7aczP zxEK$geO$ta&OR>N51oBnK0S2yaanoj%yD_?(3#`%+@Uka<-tQ|j?2tLXO7GDht3?A zQLH^|QxSD#pJ_;ztx59zLejq;WVmr6vI(E*HBzD2-a_41@K|VyauVVo?06NhIG=@m z6xH64u^X6~>Zqd|MjMbzUWgwI7~-lj(N1(>_($JOqH3pAF3V&!g;MZNZQ?_C|1sl3 zK0)V0F81_*T#P(Oej53Y`~>nI`47l<Zk#9#{BhN%WBioV3$dfY~iNlmt zk31T}GapC|ovWn%%tq(vX$IH1N&<)P!ZQJ#p)Aldh*;rIbruT3lJQUtWOu-{j3fes z71aa^j9hmyT4Gz*sq7A<l*D1v2&QD7QLRN}VFq+slZBpy?rDuWacgjs>-$AqBV*tAWS=8TbY|u$b@)9= zN(z7Gd)A;9Z*V?q5R??QyYIe)=?~h3wW_iKo3n{LDD)la$}pR9c!eU5Nw-gk}21-1&Gfh`kPvc$Uuqa~9R=DXd)gF+}A)vh;fVLVIONa;;V5 zau2`J$CkpfX#$NHF*^5Z{Ce=bW%y| zek|^7JpRF^n;oW`7;VXdU*psfF9 zsZLfBH!S5{ahfh`!Reshf?H8J&a%}M=V_+rSK{^9E^3H@jNVMhs-`Z)#qkcB7^n=s z{#+!o52{=mNN^11AyQ8Vp(?-$B~;Ehu~Q@#G?E zdP6!;(>sw3+S3Pk#m7qz;(?HvlKWZw1wCtW0{N12Rr`i)P`2=skc@n;2=LmkQ1`-n z6F;X1;Itd)0TjNE=mGS-cj*Dty>fa0ZEqPpfU@@zJ%FzF0zH7LSxgV0^U3r8D&HUI z0a|h&JwO|7rw3^946d)e&0UeN9$0Kb95Lxwm# z0^nD3_#N?j1i&xi@Vt0E0^mjtzcOBr0C;#mgP#|#M*w^~hj$BcdIZ2fLYy7}@cA767a>lM0Qj98{yc~4uGf5m!{jfBxn0LG*c}MdU9J}~ z7#(ld-K~8Y>?(xmuGWqp2}b++x|?u(^UiBku+1F;wkXI)vu24@D)ZtPI?QB z82*x(Jx88M$B-|2o`U_az;g&7yBE|5cuUM2b`i^6KcKF3O=KJhv)Tel6x5S}xSbjL zWlrK)Jotb=F{}DqNVIhmdi_5mQP6nJ>v3KrE({)QB0fD4#dWfURm}Ok_T60}KMo_D;YSlidd)u)M*B`Y z_m8iH!pA+fGW8V`YG82(J}@*~ZS9dKPO(!(H@gnrrrKMA8+PKfZ_#cu1ro-?qMQp> zmo|toKz6V6^u$Q!Ryou6M8umLDY3O;uzO%22D>Z6LK_ESO!VUs@05tM3lgSU1OX%a z-1rerwLSBwvQK57^GF#Ud}t#w*cMl<2{)SYb9exJupV`~mdx8ta^Kp7d$9SGTHJ!h z-_*-M8Ae+jX(KXbM|M#eaO)||P;9xz8U+`B*8>&z>w~{L1C_wHAnF-6S*?XO(oI%? zp1kCbEN=ht`+7#~2rL8LpmZy1-2a4Yg(8Ea0C!^mDV#bTtFW~$ug(?1zhT#XG9ca; zioba9Kf}{0XX5z}duz`-Z1{ztGXQUXHQ!&P8ov2T;Dv|Zr7tca%2R1^Bq6kaMbQ8W zKgE zM?;hvKSWnSJ1Cvq5^GGOXZq{QKWFPt;WE*YYK?KNH~w#0-)W9-y`1}B&2s@8@Yokn zO^yW{FxkSsSUw*=NN2LdA{KS6=Tbi{wZ9HFn2F+V8@GAP*iEfXjMu*F9gqWguSEA0)gt&t4Bx=kx?U?kRZ zuyA!7`>wXHV9=!)q4#x@fTtcuxPE8{O#LIaN;6DmLN8!|hnwS!2$bjiom{Ud*P5BU zThNET<&^TB=@9hI^ql}d!HYh^t9?%PQw~((nhNHB2&Oml&I-S0tW& znqp2@b+Uf3GhQm(bN%~FiM;Ni{1P{+_ZqC1&{-L5j?(>mVsot^ST*_vU1o#i{?v@~ zls<`92lKR!eG)H?K8Z({tpb6#H?8Y$&-aO) zW0RAjlzRcXTt1#5$%*vw$lx75C}u)WSRumPhjRtILT4O1AL;C#!_G|6g&ex>Ao z(1dJ>s+j~smJ3ZRFFUN4gz;#>Q%mryT~AnW3C04Uo5{0Vk;0QQ8iU_|f&tQ=-SQZ1 zrYU~Tv*}*DlrCl2q2-$Zxq>4r+j;1(oEeCVMr13AR^P1HVLB~|*4A`pyxqG|4=zr_ zMGfUbDUoue zqM=R0D71-6v0y23A)UuQ#=@HRQCL%4>J2Ov^fG?G4>TOwLw8)Wv;Wic=o`Jg+wul) z%b%>l@1Me}j>3QLjq(?c@`^RMk)f1jY{9QOwMuN?YSF&7 zN_7TM86BJ%m@~)0*qUlBR?Cv(o)`|Q2;+H0@9*1oJYGO@3uA(6lh(O+0`42lqhqX*BUa9r|p-ed3| zE%n?5|0cs}RN<0irv%_gIe0?C0nkK26mjEAJq0+#azH|?2#y_}@E`q-9Be|Sk4HDf zeI$RCCVwe?_y>YT`YRn&wD)yfR#{9%3l9?u)d^5U6yHw$ZYxbAkwGZ=%YIHbKrZJ?Sy4$0(;Qgf8*@2?g;ZIqqXWq9+m&faJd2<`vbQY3A%DHfbs}~#ab(lP(NLRPG+a2zmkDSZ(j3>fjp%3vN zX{=)lq}hUN+h2;24m@K8=9HW#0?9lWpIII|e z*LaKLw!Brn1-Q!1nz)A3_JrmSIHff-uB5}xLd z2YSABX^N#aCJwR6H43$sQ`WdyujCg;Gu?pw=$G(~59LL>gAzmtP3sGyi$7dI3{`qA z5SsV7_76&L{M3TYt=?rMvM+(R-?0#pkzD-}O|Ze+PrDCy;4*w$V(8vVFx@#6nZ8HI{Ds;WAJt@o;VqEn0pG{vd?sa&-WbBvK4H%S2skmlt9Vh1aFAjLQVpvVHB2 zW;wVVLv#RZ>0&--EuBkNn#WA2;+!4I-^HWD*YV_7%;+cq5!;=eial4Eo@?bB4t2f8 zwn@O*X~V5xcB}XVb36)8{PiUJ0gU~A15nU0CjQoLfk`<%WtkvPU4w3%ARU{_{sH$- zMEu%vdXC?;RCL+0BN=@0x>eKyHvRFB2#sGJ!Dk}ut%GykFEk7|`%GQPxtBguoUN?r z@o8V7R8mQwprqgyQ+i=@6*39_`PuzR!wt<>$Twq425XCa%-vP#e8-Rvb|=E|b^icY zs-ypPd_9f7h(-BCTgvg846k7vWvW`)HTsC+>r{G480XIAMq`P(N4ps$KB#k-b}iO2 zojbMP5GT%jJrFl*TSy$ewoKMmeFHV->T=;o`sIwFz>2WGn%jQ?t1f1xgZ*3m4JdK| z$X9p@6X?GN^w0VcXgZ3!V!}bAw)YR9w*K1d2htt2e}DS z+@#%!lbu6xt1Hyz8Q*+LoX2}ZqT3N_`xRuHyl9HB1V#|>4T)eWG+c^s>Ue0zVbV@-^45`xyGx%~jaky&$w6)&N1P5gDi1fQu1>`TWk3#wO~O~D zkII@D8I;(gj)m8pjH?msPG{MNEavn5W#e`0ijyTcS%nmznY=Vyjm$Woj=Hd&;4n1ICQPCh-eU z^bvMS+jRiR@9ob@eiX^zJneV;G0r=+wcKrf(QRL0#x_i>;5NL85LR;Nvg2g8@{Q4A zgpYFXtRPJ?;A=H`AA~+7G-1*$#&|nRy_@A=DOL=;n^oV=Ng#h8bu3@gq+U2C36|V* z3=Q=6en+lrIMVT*9_H7DP^6LT2|X8XnNNxgPkbs^qh0m3tF8`GH;I*47xuNocdF+> zbl>wBvV@cz!ohLUPwSfG`d(5m&rvIjCo7f3)RgdK*wd9GW2W+QrE(9 z&e?ZTuZ{OiPg7%TiW-v=pNQ*qHnf~?{PAqkpGqe}K!zTMOo3Ow>~;-80~#{=`U<<= z*QFq&_V*Jkv&UgH{^keZ{CUjzp=w+>G8~k4=IFOb9PD;X4zABhulQJU5c3F?75onk zCIkpF6chdiDTn_6MPO%OLKzoWm$R3ODcPaVu_cE^;ob702u}q#yexgJj;FQ-HYWA; z@QF!viWTQ&I^s7y#+@-B04+K%#-*|QU^%#~zsXdZ0}sh$iuKPZY>E}i=z z18_N3VH3%*sQTmDCwHmxb-rB^2Fv+9=!4JM*%6h6i2O5q6Q6Dh{qJ}F1} z>Wx-4H-3T?Af?*Iq9QyF$5V24P84PhJX{k!u!$$mhecfNVI~asTFH)*!;Y97U4-dp z?8!~3xkGP?f8Ge{tGh+KBXuaaM6th<3KMrTRf*RAUih|_gI5Efw-r(tg-wS;!BmGy zVCTK&OjN5GBVY?ZXrYEDMvCku8`V3lWXSdNmtHJ~;A(whpsB#o@?=~cI#pLY`a@ig z^@tX2bhJD%ghaK!Og4FQ17(X$9;tF-LW81*6M;0#)&wT72b?D!gsJCP@4KGn0Dsxp zCeIb3Qg!+}saSUB>S4gH&}GAqnxOBwb)|u9L~CNrD^vB3S@n!e%fR|F~@DwLB z)o*4{dhLA>0^Bn1D9qEqbXyY_dI_GJn=)?CQN{m*_c9%ecm5zEui!u)x2Ke`l|#i4 z#0ITH=Oy))b3olJbkQh*Zrfu*BfSi2We(bzNA+vx!$?^>Jte9;ZhL(dpX!69!2t6#fz5 zxu-22wwyYFi%)v&YF_+a6#b+%(JjU$Uq2_Njajdiv@ehA15fHuCtKB__o4yB172zx z#+dfJxGyssCBKY{i=-g>$B5akv=3Ny)rw!UhUiu89g z(ko7CAJTu7k$z)#dU-wCpONm$POnA!tr_XhWT$r`{i=-g>g@Dc@1gyt$8ROl53V_F z`;H@h+nUqjKW!!2pOJnN{gxp8R~hLyWTziO`Xd?X<4>Z``)Geg`h@KCc}Tx1BmLU! z^wmfol97HAqaH%~!PV*XvXkmxh4yEppTvKDq`#YyJ~2DJ1?j)aNWUpN-TndEpOHQ_ zJADSyZ_P-bot^$B(yv;5+V&N%M*B0;Pv#G#AN=67->*dawv6Y}xQEsem<5%lBm}xB^CQIyVR^`7-TBgu%#Xa?^vu)bULtI4|c~4Ab8#`vbQZjBmpUtb# zTKOS8A__uAiRNke;zRnPwl)>p;SzO1(SQmB?y%G zTwipr#1nc2B`VIY#K@VoYGpylY4_g6 zFo(0t^Pv3RBR0oayn1fI4UC-V3n*5ue>@+j0#2=D0$1W~rdNO2IFsj1D)W!jM6+i( z743Ol=?-kTgq=llT-2_tcg5S4h-So#nuk2l-)hfKRQop|a8xxE%JpO?n zTS)Df zHta!JpY7-Ds&KelpSYdz+^puRMYYjN3H{F}oNzm9HOB=j%>jK>_iFF+kxHrTb`dA3 zY^EG+Gl|2K*nv{LJDaU=ylg_TPrj*&$Y9@>OkDgmxWApNx?2?UIvAwX1~dP(Gw!}l z)z?~!Lml2u)qVx6z)E~ccCx#}v0Ywt8{QB-WM}m1rxe6L83uzOpTJ5h;!@yD$#E)* z`cU;>LPT&hdJ~Rga`2dm*UFO4u7I=CTI%a~@&(n|?r^rs!8d`oyFoGI0zcXACEDu* z@jq^UP!3&!HTTCY56Phm_{n;y9KzxkA4oQ=-4lXLifd)u^a6URGiJK9Tyb^~p{OO{ zYKi*4!K}Jg2DF^$BRSZ@GAOJs5161~x;o*?&bc!FQ9YWuGDUK-kNcpw@ySD?PYXVI z8=0^vY71Tbt9C-%_T4$ky;XkTJ| za~q#eC7vv4*tkA57H1G|s=S8lwyT2?=+0H3_ET^tNIyhEn5_Rb8r{k^_M-pB{)4!M zRnn#}^ENwM#7`G9>xh}PB|B7K7vIP2a(FxCMR22|d`!057u3CoG~w*Pd7~mpscA=u z5jnVpK8-#uDZZ7F8>FynJ$A6c`(>BP!53kHx>jS``*BOki<0VV*HojqdlJLz(>Z^7=0G4#HI;cSpcJi0|BBJh)q60lBFXDnMSu$CZ8U z(dl`8>+B>y*_nlKCs{&y*2&qhbNM@~yy$FPlX164J?7)<1|tu>vqxp{Bw-buDxFYV z9qWc8&B}wQ1If6e#szG#ii&6C9bb2jQGoD;w9+Kx`A7moO1!yT*p^Fl_=P(BIUOF> z;TP-hc?=hRK`;Lv*07l!eNK< znq#IryPB=bTm+~_)ifJh->z=9zFkLe`^X3zU2#^cwN= zQkxvaT`_hCAIhVr8>yX&uR}Y=X97s}s@CV1TIC=lhsgC&A9C4$rMTL)O}rdR?R)!H zv`<8F@zMKx_wsvxtoHBF$G+%VtqA_RmK0Z}9fW(vt$PFShVL%VsCDlb>x|Dnf$zjM zJ0A_iaW;cPw0~gFn3+)wY={otE>nG-QR^B*5Iyxv2%^m-72ywevm&vVGM*Q;?fQxC zHN}~lW&Vb@rZt>u~8(&@6+LT>F^CY{3ab@RnAJls>7{*`M(~qmdTAafQvR;v(VPNb z2Jk03cv%WO9N@h=_%{aFd!4e4dWW@5F{(9RuV`UTY8<25`%+(AO#B?3CGmi5N`0+W zr(;N81>VoE6vYfcG46JpdHC)!G2XWvW2PbDAzIm=K27+A6J6~kYp2rj`<5)@RFQP5Zv z^x#_pxi|C<9-kIt4~V4TGkVf>l*ISnb@&_|K2?X8>hQ~Tf5CU@@bBvI;fAAO7KJN$ z{ZCJNUswNs%2Znks(tkrk@Pz~=^<|0O0=y_PYUQs9>#ek>UvL4x?fM4r{nOl4mW%o z1ayAHSM@RxP?^*Y?}ZSW@@evuA0d>gFM;j#{I(BT_& z_>n&gxZ&Givku>-!wugC|Ip#h3>Ur)cIvQq1&nOkuyVlSI&6-B zT>@A_hutG!d}i13JpsE(;1jCE5t$u4G|bxgBQRdlap}A^wZ;yonbgwhXx9@w*nfMyDL(`7jpLy9dO;_GyKjF z3b?X0&}c4cOAMGRE)0=C^0{U%*IX5aNt$cbAor%Xysmv()U z@3a_sL9zy&WUq7j z*6idpUie24LSN}IT<~-D#PXRLHe-!V_1e{;NHDx;ZZ~{->Vc&A9N3>k9}b2(Symd! zBdXbnWPEJr1XTy8@9;3`zpgkn*aQj0k%PYxa`C_Y$|S-(h!hdnD*oQD*cvBoIbO(3 z>x_?pYTc~#u%OassqQySdPtk21c{d8>f>eJe@1RI!`~>Wr8B&(jy})k$Zg3KU|lSi z>B`j+T^GM0h6XmKqPHcLR>yWvA^ z@tq*gygvu90oS~7A+GF7CBODZQ|cnX9HgvSjnatXkv}pk zjL1wJiTTrViC7gCmyiZiTi<>eLvE&;hre#PwQ-wUCn=c=_AP*)1V zeTP>P1RrtBv^^&n-<23Qi7jLYh5Q$z!LKnM=0MK?c_Ew{CW}MUMrB`b83zs_ITc@o zitRA>muoMcI7P-^F^U%mQC)mB<<p?i7~wmj_>0{x_bB7`p4V zEuuc7>$u@-orIOP7x9JH9tRUD~!da-{t7sqP-5; z;SJJc5LyA?UI1%TMS(NczDlsfyP`WgVBw#GgANjw@ zlKiOYAmswI_#3ZWw1$%2X?p+9o&<&lN3=A??IceEJ-KplFpjYFkbPP}57B9d1HEQ> zVOI{;@vMOczp{z=LUFgw|CIT`)uA}squ$mOOJKziSaikr9%ath4SVq>Iq0JLSHet# zT-%_yTHtYgePFk&)GQ&DNO3kab7PpCp?UgK$>EY@vvZlCF-xi1q-#mQw52KYkX?uPpLJDzouX|hEYo5?UP{iH}Mi+ zBhxTql7y1VXEw^y9!`qbIhlFsFGqYl8BTR+72g6!ITsu7@@)9vZ-EmoT5sPea6kRg zKFfkzQ}u4r;V%F#`iobhxDSDgwiH(Wx2J>hTKM$os9wAOh39Q|SkIBnxg%;s5Zd z4{g6TNYbeeuJot$nqW%WbnadF)AfJqme+I2msQ%Ku< zc7qY*^+ae;zNfL22W5TjUm;Tmb6z3TL(o9ht_HZZN6Z)ATFCWROu7u$b|2B_5kIP2 z2RNn)?Lz@y>%vPj4wcvPEUg8P;Movle{a+ZlwN(>>dBC5IQGj@4O4FPj>CatB-PfK z45_9aCwv;ewg$eC1AV#jb1e8Z3$<Z{Z#8!;~HLIO2Q_ z+#-iQ1caxnMtZ7UX49sCf_EGY9FydQ=#a+FoJ-5WStazctU$ZC2i@i=T>E!atKxf} zIp^bPcdDv~@!Ele`wt@=%R!o|;KsJYM-EF-ER$mFw-pXhP|= zSlk7Xv%@usz^8fdO51jaYYs+S2lHKtaDF*u?-x4k-743&B({;F(i+%cXO&N0+aT9p zmsqw6krLD3v>mFfSGGV6>x$UIuI)l0F%k|SFdF@20vC|f{7ews?X`aY{Nv(6=k4}}$ ziQj_Hx&D}PH1O&1e*44ue0)1&ouWwDMrM_>E9&b?3)%DVxLDKKnx4 z{mb)=^7qP~tCXYILUDG*f7!>?*;LLnXGfX}_%b(5s#*hyI}9WO4ZuL!Hg~;$-iQ+e zJ=R2p(i)vU;)HTEK3ufoZ7NnG^`Z;SC_bfxXwlixX%>R{=bcRjG*U)N?UUC|OX{hG zBdD-VjH4VxQBZsHWatSbT~&&(KuPMca&Ku8373g%2yuMU-u zt;`HxqO=@oB}tI)Xq_V~yOhR*ucgLHbV^d$g-d)xk|qNfzu`sRyEJU%OW2;j0)<7d zroYrEbX}8DSBAIBLM1dV$!8AW1wMZ6i^x75*?G$rx~GDfp$;D_x7w*?&+AQZu4Eft zozPGrqOf62TYbceg`Z#Gu~b=u>s8HsOJ*d#2#rb_I^xLG)8y3C^wiT-{fW4!Gz3iL z;N?R}l-6G%SV@fn>(E9|!Tc}S>g0F1{_2wGjfee5AC?!ukXE@I>Vp|}(|f5Rola)?~NFZUSxxSLJHRpg)uo$9!L|V&{5Ln7= zWgi-_61n?<=VOJuW?Ql`#@$5Sh@62=vl8NtS;Hr5*PzFhZsjE$Bd9GKBiF6By@dQ_ z*UNPc{Tdy0f^WVUY%)d6VtbS({#=^RBG$aJi{)T3e00BrBC%U~9=##*!a)39F9&mx zDyrftz;!DaMdI&;#QN~OHMSoN&0@yVqO4)`Vk)BvA<6uwG><+~3%+TV7i=7w;+rR^ z&HtWn5PVzo9&}wtx2GP(DSaw)4B8{DVBU#NH+YGWlvY&nU*;X`lnQe5x=pYPmb%V- z^hN|SkXHrk*A;U^qEjR#3X&>+AKg6DXhU#tstwSa|9u-8>WnsAcOt6|b&Nt=ivOAG zMVqE`o2I7PH1*^*;gYB5V$XoX+&0n=&qtqKr8gytzY|jpNcF)BgHrhS9zPTOO)31J zIIiR0H2Q$@QAQuseOn)>byJP@or1p-)9y<5iVeMTAc^KoL!t52;lr@GEBck?SZvB)r%INe#t&SDq)5@W^MO2+N zXrq%`{YU%B3;#Zh3HVI8RRD9P7bs&*QdN*?x-L zVa&)Hq<6+qpMAMcu%weIJC`C5Z{-NJZWNXN zD)Ry+jxUCwza}%hBFS11X`f0j<(g(!qx?R(VE$3`tGuunH?}A(&}1gHWn(;B zX!Z;>Q9k6Bi`iUuv1el0-JS_T3Yq1gcYxStuBE=$S&8>l@{=jnD!_Y$(#sx~LvV60s3rPa zyAQYSU*fJWDvnE3C#!+lp>LSFJXv?Eb@(D|7E(@(yFQ8VU3mz(8n8i8QfZ2mON7gF zjTK_p%`um>WwQ6V#BpV#NvrM25ckUY0|`1$4&j=M_FM2mV2{~R2Z1X;W$O=xF*4ZS zJ4z1Dk#TjGvic8Y&KGlf*^mo8g!3ssIV2{w(`rj;UhYoIsT;pJlRlpwHToQ}b~EJi z>2>W>^`-mL9Ya&I99n*m5so1u0;?0F8x__rfF+|ZFSv4K3e(pPoe8FIJZ)e)N?`hq z&?*9qpUF@v0?Yy?1J3|+q$wp%kLW1>@FbL_GeG&F^HV7AKX@i6A5jgIy$ApEDBpPC z-=qBIc`1~yJ0p~ZDo4qfNB`$^DOw}$yBGbu1aady-}jLT0gErJP(Sz)q} zbaQWcptVpH7Xzc1BucCD3*?|1F?cy&AZ~u3p)fjKDu_hc=4ed}QVRm{LI)R23Lb9k zGjSgMGR#?wNkRW07QNl9w2tl;6*A?fG3CmOQk1hEI0MQlbsZ#z!qJ`dH{PcRDyj^O zFi;N8+Rqey@&6A+Z=gShpbQ+ z3|>L(>i-0<%+zrX%Arb{BD8Z4oun~i9te#>(#AvCEiB)c%+UV-RXbOomDc~e&!nAK zgj4$ezW+=+GZA0-^}p|$qa#u%&)Ih-DEk%~C?EU!KaX)x%43NLfFv@I^Sp&Tt1(7(2$HcsW~EK z5i@k=#^q4=@M@Jd?JLk(^w>GkNhiiIQH1In%N-c5mKu9(;c9cLFK~g#=nE?~bC^x6 zr7%vcAx~5ob*!c6>e=qR6mPwiI1}Dl5ip2yRYEr-iMOOW!N!T_jfUl?8rG|&o7*o1 z?aF`_3SC*utAV)X-?sEvPP(PUbwRbzWLi5KeDJrG^-Y2Pb=I3S+=S%taR@A)SBX+Uub8-J#*$8-1ANRUoEm;hTt5jd&nMbc;iAV1bk6o^B5d9Fb=9c;7&<~EKS|A4(lU6(bC{||W zXRP#$b0eeBfmcOuvM9VJK?Gn75|uhFy`P^6Eg$z8v^?5{nL`fkg@bs*z?t)oF5Mc( z@GuH!7Mj^(Vx-BzTEbzMXnTks@a4)FRyi-t6khVq@oS_-oUO_F`J%PGT8+8g*p&?r-a-FprmJ=3@L4 z{Z@7f%{Dlj$2<^dNiD|xfq;==V(Sw9mD(X4EZ1)mE5s3dewekx2>%UeSMX~3&*;ku zyqNxO$;LoW(qnm`C10-R>Z4UsYhtmXdP%CjUTREivuWlTQ>r{}D{0W~+YNJ36b}XM zVtx(_ZY#Hi?Pj538*D(DDzhVc5D)T#?ZinsPyE;JGvSH*9yfU6^Uuy)Q%$L+4+7UI zlK&_I&r?_VkJ3DG7d>cC&>xJ3`x6`j`*AsRHwM&w$fOJ8VCYzC>3YGV$1()gMmtvS z&H9$~+CrQW$#*o#Avk9h3Prgbs>VP|NiIt)Z@@{COVTDDGuS6)8YzU=DjMCUk_N-6 zyDcO3z#POL*b1lae>&U*ukL^HelqwXa#-av0XT*p?IM$2 zc?lO5#g?e*>MD&2)*9H~WQs`P5RP_4Z^rh!Aq)mX7_1S(AWvintU*a8&j9}#yv`sC zkMI*OHFB^DgQYvz;JI6XE~W8Lpvd>B8|ZnJ$>|L|WQdnw`p?Bohez$iF31Rs|4EKsIrwMpGwwMa zY!SZWG`SzRuywNF8~?oFP$IBhEmqgVxrzVvKT5cUZYKQRuHkE){-fi?v48*3336~6 z6Xh~FG`}z1nzQn8uG!sXyg$YKs80y_NWr?gT)#15AIP^?zMu?7=4&K&y%~;yVe5Os zPfxg);N^*!z)6?jO^MtoH%11A^BpU6HHpoGn0ZL7LbAjv%-PcOfB%UunOGzex@MD3 zmj|70`zHq0o{5o(ypNVOhY68rHHVuFrs~0otxSeuIjkKxo>@U)wxP?C@+_p&JAb;<8&jli* z=cclpIRnt4&*>f7rqd;{(SKcy_kW2GW5J;U`|D~v;~0CVj(eU};67g99z2#sK&r;u zs&X}n^?a$~a$F`t8dUfkFZA=hefk~K%f)56eI7u&b!e3i{a=P2(xFpy=z50s=+J38 z^v?`Eu0wCrq0ckaloZezI&{8=uaG?#8m1@wSS08J_s9H^RZqKL|7a>hZ94Qp9eNEz z?K;$>Lq{4F4A&DLGb+GpY+T}x3X+h$XtPPI(yC&WHsq(7)9BE^z^uoQx>Hy>pI3zjL2!9bnIkTBFTSVsT0&5O& z=KMh4NY534zJ8uDfi*o0a%6n}vy;9LbdDt1H(c4T91!CoYdi+l9On}3(dyPfPd|CV zZ%wd!(H|!7b?Q(qc03h3-ICpe+r@dMb2#yW?8HDP+)YmRuR-sbJR_MDfpL^^mHDKM zW@;HV!^-tJ(i!hFe`|H8Z-$La$f&B|Zkd#8)ZE(`fTN+)HM z1o8zZBR@7fGz(4XjadixoayEUT&aPRY!+6DQKot$L;7qwLfn$6;HnV4w; zYcSMlB72BsCHNJE2B+$m$&GVo*ZqQI+oTh^Om47Xy7?BFEC+W{QeO)(MaCex#*!_Y zvoI2Y(03gc^?_KZZ_6wK#&l^R382_OiN8C`qz_2V5He={s~7N9U-nn=0D#kUV1W*N z5I{|DuFNA@4&K8rqEmyn9TUqeH!_fU zUk*;>7pr)=nqO?<U*6`39z(Sdx)iN#FSCKQhbnq`tck<)zk^W;_UW4GiUQcFA>!0~=`Q zr&W9eJE|zPj#=~%ypKq|+y9YS$nXb^1@QcjpctLGZKK54`hOp0o%U)1m7JBT$imNMH-9KQz3|UmQXi_V#k38J~WkW+NbG5cr10cAOyh_$*TP|Yw6JU zGed)#MTD67r@$Vw_T&Lj$eto=`8K?toqE55-_J?CkL34rQ||@zz6yuL14kvV`JH@K zUrEFYuFieppbRh9B<|8pdEi-3n_Q|c3Ni1^5#)w~D5j)Mwq+Qk5%kXMhBS-AEts_>20kfZMv@T_{fRuN)ZN z6f+GAPm`#L;b~^ErW2lQL7(wrPI$64IxR=ps;|8@VOyadSw;v4(Q<||2e*-&uT4>zv&4=5t2-?)UaOZOU%?+C6Az?BoFBmSE$ zY^e`Yt$b%g|CsN#r=QiKj6j=r&&s7#Lt?SGn-SPMLUk8JDvAP~TA;-rt|%f|DN4pI zY^N<=DoW4OOV7MB@-z53xuZZWP$y&6($yLD6w84xx)pDSae9B(!8cS_S7c&Qpv4yG z>T$(=#|?E|Wa=in4QOm&Wt&$DLZ$w=7C}ErBL8M2fS;;p~(bN@l+O;h$V2`F)fzcq=%o$;>B4HTIHHS2$d0B)x81FX894#;TLj zlZKEi(F!wtV-7S~<+bIabSgOnXOV$DRw9$6 zwd1+Ts@=$QWnw^W`2;aPO=W7d`uXmLrWW{kRme43pD5It7g`I3!OdRMrYp% zrt{&7B9b;wLXX@*5XHGuy9X)G%?{^I&u}7LW2bN{*`Zu5AvV#Ml>9)>@w$noA(UnI zfR*%Z(&#AFwKHn{+j)>;o!#-hKQft8Lu9kk0ta|Us3&ll3f|3J9ife$b<|5+zo7KQ z3p_q;Gzd3p%JGc*l9#B?0y1R+Jei!K~i7^v=@YNfHGl85;Lkh+>VOSp%K>XymwU1WtKl zv>Raz*oP_&E7fU__uoVu(o-OU){#Uj!fm(;Tuv)cTH}q-hkJG24mR~X*Rs#mdrYRV^}NdY z#{{b)#5r!e%__t_p-m~Hhq5lZhjHE*?nwM?na#jXv;d03zrP;W?%ye$CzNW$Ju*nex3rfD1D} zSweuq%uk*pfF<*j*9dT+CgYQp1o*Tj!==zpR zv+rQ%e;lts^(|Ap?W*?$_<;CWty$XmnOSu%X|@)0R>G0VF!3{7{0za5#l13O4zyST zox8*4iOMF2Yx$gw2;$@3OqIdrn~uW`uAmaV1HDrdmOfNon#Bx5xY)#*1&22%Ki!`) zTD)Op1vGrsWmBR*<1d1w1}wt%qv|c-jJ0_7g{32kZ?Vc2gChKGxHmM1?x%+wX5;3N zN7pTyLqAGA%`l#vtHHboxhZAdRaCvU8^vBc-*OXGvbb*ARq!(x3?=2zx*^QYrOw52@B>^?@!B!2ma*@X#gj`zXt^BxY&Z`}ha1^O zU=73MU&%6E4h4~Sg`mn}Pl>t)pE!J!6Ap~TMu5XbuMeFAGAx$s^NeqUlj&P!7yOAj zTa{zl1kkSzEryw11+ly0M_h1t&M;LhwXOl>RL08@n{8L?Ky;;UuE8Fc@(KyN3{`7h zQ@zhYT-$S1-%`b%rC-~eXK8^PnkYeR z=gPsC3H36w9P9(Re1&Qr@_rY2y@l#*D_kJ^3Y6=p5OtPKtplPCMoA8y2hur%W1KdN zbFq@Ex(d}ns&l!cb+%b)h3A$9Z=3Yc7as_owjJ4}_()O&$B?9U(?nCKcpG@qS*jN1 z&hG^q%fY(}nE$2b`PU1;6aao)^S%ZoIuZGNG1)l zOth)PIeAGsc|kvLj;}@WZMM*uDyURC2wmTD$96(@yJMHU@DY&T+d$NN`Z<6b)t&N=)N8=-Bhg%!s7B~f{ugcBA+}^X4 zruKlhT?+WxO>*dbP{i39GYtytGsBOKdxPqE@lf>f$q}dV4p>u)uUW_Lm+MsXjW2$95t=8J5^VEpwXNjv}z5Z zXOY+5%D2j`W~mWwzmIA6V>Qav9_bg3BD4uHd!$^_%`oTc@-fcM(dp%6XF(8*?r^lq zPpuvb##-(0Zk}_8>fPMPP;jQVH&MT;*}M!iTqOgL3t6 zRNrc4-fygOeI3x0*D{9eP{2Ziv+6gt=BnRt9MtIJR%+I>$G9zgx1X4`Ju*1VAEK$> zmxM8v8U-!dQ?zhxCN@y)FA~ue z&x@xaf$H0!RJ}~f*kbyz3nDy?dx!2Ie2n-88j{rG<(b6uU|K5PlPOH!8Il&J&ktc? z8mWaqR9DOr`Q@ModBoLli00eyO7QyJzD@FTO@{n@u3=mg3FKau{V+b);qh^H4Q^da zC|FpsZBVOL9_L=#piW=aqqtXtrCl3T`}>M(vt!f4w?rR5O5a4Qez#ZI+W09+nw8QP zwPu<0p~baSaW^D#F}KhFDo}>0(~c`c)M-7+prorIdix2)-J@~wwKb5i(&$j#BpNo) zZX@j-ORUoo28%|T>&@9`N2IdB@o%P8Hc?etIjY4q}O81e2*T*bw(4`>{OoxlOoFI&+>Gt##TX2-MX1FNGp-1*T zl+l{oaCt8}%Rt{DGy4AP^Qot?lYSN>-{PNJWRk-hdZ>UrK!j7XuKwwImiAyE+R+2J zFDFiSFohQNWH<2L!RZFxTad|&>3Mu2$jB-N^X8|RA}D{obSg83E(2D-I040TiZF1!E2Gv$$|lvd8os$~BPs$7R>#&yzEO4wzL5mqe0G?{m0WLA znn>{J=55qY|ML~HTYQu>$86Zt-B=g%wT2}akMK(po+c@~sF>fPn3U*53vV_D8p*D1 zm)BNXSX2ahO!A_C5?4w z!(?EjAh0Lb-%EtaVw4jT z?#hxwzdQt5wpUZ9GVkP}J?^FI)#mwqq6t4ES!{7GLl}^8^OFL0hvDVQbMZS8L|(sA zmihAYO(hKuAKrP`$-izG*Xqp`s*?)$=fveti8XEq+0Ng`SZCo#BFB3%^{^uGG^YSE*8*&ToYDryw(V_b_Bm*3I&1kDlt01rMwuy7!}*ZWPLJBZ@cOLF}%mCe+M zRT^&{B!_;@f{mx#28HibCN97l8)cqqmgM^BxspDT3x}7FE0pEXz4S%W)$ZM)a(30_ zmt2dbErB&mO%acSW`2ir^PHjL+zr`c#z1zje&kSk9BbHOBdWtMQhjc;FeD71mC{F% z+(4(Lj9BTRd=XQ32>dUQ!fYKjL6H70JQKa3SO;Zr)Y3FZ+2_-|pG%B&M6SO^@vffl z6YLSp&tv|=81=QnSZP(*_{w4joasJ|Hup8le{SEM|5lsByz>7|pF2s1X|8%vto&5H zXee!hm9^>LWDH~Co%9eskdwtb6OL!|PR7jCj4{W@4|#(4V?Sd?NLh9d9>I19Q^-47 zS7wJ(Lz$CTDZSs`!AVlCcER&IYtEPPZA8Y@2~6FK9d!az*o`W4yu(G9{^}TZlo(U5 zP4OS89Oa)7_ZA=ZebUT7R)4 zBryDgHB%f0_xBpw3>FGpi?M)soBeQ8x%a!Nu{UCXftwg|{xT_F4qiy;1=}7?XEUd> z)roAlInwt{sugl*1#1N?9v8lh=WnOG7U(-I*Z!toifjMh*&t`Yv&PcE1^d`n;5ZT} zhyV`_s*OODVyD-#VRGm_`h7>D;$cpxHLY^}4N__qJ6dIdqp)C`XSILaP&pK#%!yUC zC2ff<1|Jc39KlUTo=<~_p_y8IkQd^7kIq$n@~@l3Dvm>FFm)uWNs~v8I{tu!;qwhp z$EV~1Ce}099eMDFhxBENvFT+BrKTN|pKmGI&{(U;Q)`}6>=w0%S9Lk4G98n!xKDw`x;mvk9*0e~!Vj_q! zq}_`kjTag|N`)d8M_ z;El`MO2)0cpp%-9gYKk-OfoCIfhPEqD;q*=V;05^A}GPw`7!)YXmUlFi!AZuWsm-wi(`zW<+t;Et->v8U4C849;uiqUShH3v}scg zp_!Ytujy+!RK<0+#!RM|WYT)~am|t8+1i!%61Om@h&3PX>yifT-96djFeTjH<2A^| zP&vIGuD2-yC4cUrt( zq)$XcQ)2$xg}l-WtkUAg-WGWwP1$_M;|KL{a!hxD3!Lr<5ud{KazCF+AA7=TaFz3?-M+ZW4VL0 zYT~xYZ5HO`2XJ(~m(rhti_%_FXD9Nm7ktpQmuyT7A?=;)9$!IZ`oNsvbeq|mJF(Q& zJ}>TYwd0g=wbjughX#m!wU{(W)AkCn`ExENy_?9^O&%Dqi>y~A=NlYdBdL4*5Dp_* zh*1yFQ=|gw1WwU)9m4kwu*2*NBGS?VIrxYb%clFn5*R|3>$gr)eEz7lPH1Z{V1=@Q z7*T3gy-Vn2g(s8ul$b$Zgspj5M0T>&@Cquy}?^Lt<0oE9S11s{2hivXuUuOk$(i0(JCw zzt(WBuni1N)wMEWollCYb|+Dl?BKK!j6;%<5oG#$ZzHo;)2tZCRQ?nwYh*X!I8k8D z3^7QiX~KocWZVS(7}v>!5m8^A)Q0TK?oRAeUk)SSAkgiAWEU&F^%Y6&#>3o5(tEW^ zmIU;er(HlLMsCcZ!3Oqf{LJDw@I+Dicz9KTIW@}U&8E+WyQNeU4z%C^@OpF`g&!0GwEpKr)EUo z6X7@BJdS&j$ey`^_y-FOJMRXq9^*ACDxa9t9A9R=zOpw(f?w~=N~uYw+_E<Dox56uE4c)>S^WuS(@4H{WACZ$ zKMi`jCY}yGc6@dUdW*~gy|)ge80%*6vyd6?u4sh>C%srxX}}UYnYBC-8yc>)JUYz^ zL{gkF`$s1++|R+yC*yhTY4N-+g=gXo<)F%PL}Am4j1azUik%^ja|i9Yk<>gXrutS& z&C16FCV{8>{f|~y6c%1WJAU{!R;b(6K}z8Z>M&(GDb&O1ugy@V+wDT)iDj`w!%5A+ z4Lt3u6ImlI+(oZ7yw+dzEGyj4lELe0kk>l>EGaCcHDihUc^jE>Dr2MA7e?>2YOiYI zH0({V{Vkg5a})_T$nDUS-$dx7jfu0!_8*vYq)l;?*mgIB+TQWs7X>LP0G z;I31!ngpyaJ$?%Oa=?e4$ntCLwBZz$tAG%|8313g;-kMK6eh}L6=%5dh=+F*5uqe&}IPFr4;_PsA%-gN>N*~jND2FeCc8>M>4quMy z>lnRDt;VH<5uxN0g=%iZRMwxYB+66Pk2EXJ+XWuL0ffWVMP%syMKXyqS6F?VPvFv; z4&OXVlf1J@{a=Kbi={Q4a`bbsz4d$r4Bsg~g9}+o(-?$&*cmN4OONe1ilC0|Ph3Na z0Bd+wi7F(!*yR0gC6)=in^kXDLaxQe8zuV7a!uac%9|Y9pZp5@S~abskJW~fb8`p@ z?7|$CzWe5~^Tjv)^hzgUuXe{vKVg1Q{@$mbR6&rg0482&YflWhsZuKf zEq5K+rTw#y_W~x}p!G}gc?D9MJiq4V)@n+h@L6vgT#B82Y> zYH-AQ7HK4)m;%d&v?(l+TFrW6Wp<2g`0iFZ#vpd9En+n%HsXw5o7O@V)gqW~K96=w z>N`YZh~6NnHC>5;Se+@e5D*8-CNhn*kD(cK$1m*=Ee%!C`v*`-IX(d)!j*~z<3R+6 zciML;WgT0d$rHx;$5VKncv`I)p?Zr{-zddbl*#vsw?L_}8ytV#sbysFJ;sQehRG@1 zZ+xCSp5@Pc9>;1cJmq{6bx46XPx#}$FX~(UKGqoyz8-On2z)9vewq_;b_6&qop4aQG$t87{t|+ee+NAyd#tjq&pX8|LXgu?g&a zjccMA<4o%!91%UIh3p#~mUb_T7haEvR&_7)%tp{&S3%SohRb%2^;UQ~oLsAMf*vu3 zLk)AsA^5VdtE5eFE~f$zL-p5+b(?B^Ua8t;kGP($#pQ$muXjkg5J(V ze3_(Olw`Sddth%d)&jTd1O|1#pQ6sx3{0kq@ND`))p!x%aio>0Q=I8r-!5XjISz^d zZIS+!k=(HJV6|L-RDLgbeZ$3-rpCBA&?%L)`Hx;fc3`xSm|(A5?>wmVj&Aba9^B}; zRjG+5a%a}kqf@PkQyBy>irGrV3{Drrg{)V0&HoZh2vUz)v$wzXr6t!?niMCOI=ad8 z9u-1gnKCNh==U9@4;#rka_uDzpkIq>4K2Y*+a9wgFVJK0$VyW>bimA7s@YO`Sd?M) zj3x!!c=2|LHJ@~xfvi{r>5QJYR)NHcr92<-`C_|DL#L=Xe)a?ep-6iB;XG&$O$6(k zGh#S#@x+g>A=h4PM0bP^d(T?g$*sg}BRXDM0 zJ|$b*oI8w)z9I#{SF7nOnqNmYn{fW0CWU6x9%|J}ruJWFrs=?qjFn91UZO&y1oEu6{IqdJw)c(oC2%ADjOw$vz?ehr@zVKDjMue(q#keW^Rca7MuP&)5b$886 z(3FQePgBnU`CCg4BgA4&ms-<7W4`cRj+jWSG4^tksl3|Jhx}bJlPQs>hoMRd&YgOk zMfAtz+{m5y&^BHu{T3@X)p9K&Z*@fml^iDR?wXmk{@zm0ca@eze`-4xUp%C;mm}sw zskd8c8ofzrbbR!PS@|eBQHtCwDUHE4@8)RLb-5_}g|mTk2M7D@ikOueQe-;HO6A}) z7O|zX5LYyvT|Cy?JT|@DLrUWqqSG!?1V}CKEp>Kz@?v>2Dxmz3Al2!2xr4v;kE8M~ zrgB68^2=aTeUh-%R!4G!4W5BzmwUg7<<8(Y?}2q5YF=Uh)NDTQh4sQ%u1U=^Sn;!Q zrmXmZe(_si5x;gFZqwhMLrr@v zH6zYRv|4@7a_& zVN?72%LdKx=EqDk%BR5Z_SaM#UU0-EKd}_NCOC~~*r?URYT}jV*I8RRn zc={6!)gk_}EA_ItwO{N$vd)wsDRfKn}JZaK()3;5+%$QnStU3#b zCq_2wAsaCWXB3YRQ*j|ULOO{fIG3}XR|XOHyEr~@9C%_B+y7idp<2mfbpR#YuE%hH z_8KgpwT2FR`m63%eD>rujD#ws&YNTGU~#C4kDYZu3%K(dUXMkk0bi?$J|+Z-4=V^B zXh{Zqn@yf|ut%wi%LFX(R&B`+KAMl+6z0EB8})aTf>p&(Gl8`aaLICqhei2&W6=)A_RX=30Y@Gq-S(wS zd+HJvwwR-?DA|!1SX(y1bM?3;?=_Xg{FU-r(y*xs>#2Zn6TO{BZ((;={2c;BsKFoPJE@zGSQ+k>nsI0+jq5!ER{|b(|1;GEv`i%9;)I@_v;G69vuH&gbyh z>}=pU-n$v|5+e#x;I?nw6ZlMu)^yNVut&Ymae(4AC=M}SRp$t{xe96Q#BoMRi9u$~ z4ERP$o*}BwrcSC--6MI%Dl1M-BZ?NA(+S1t1f@IUY&#_oBOblVAQ_uRGiy`LuxU7h zP#aHPNrb07UHVmI9+2(=e7xZ*aPgy;#&;l39dalIBo|~pDy%xMXojy;>b6UoO@%}} z?fXeC!-iPe(dZH6pUU&B655QHXe<4Vdx2B4TE`%&=I2+zsI;h@`ou3|!3p@1dj@(5 zjRgI}=dQ$uWC8H29K2Vr&gjQMgagLSyeq}%!$q}Np6RAYUfBT8;j)pQ17-a@Uq@FQ zMaA8iG)H=h{k{D>=PRL3z4@2xeLjlI@YqNeCcZ3Bw5iU*z&Mj9C(vL`93JB={6Fly z4SZcyl{b7^0<ADVqfJQqB)v^PprN5@C<-;)+Nxs5=zusg&OD=|qoX(~mVzy4)dC&q0HYNGK`VAl}EvKlZormak ztddP?sm{eY%-bkZ!FeKSf%0l8o+AK^k*<%h1oQViMxbdVxewlGfS$SL@xqCd?8om} z!LhxbZ+9;3Lswt-hL#0Kp2wBBl`UXTm^5p#NJ;wR-#X90O-+2qx4vH~GI!^mJ1!mV zT&0u(Gh~rJxp8hOvRvPlg!3wR^K>o`?_-SV(zqJ!0xRslK)p!G${bHyo_d!B24TY8||B8G_4oa195WDAVQjClb5I znp7i2T1G3Drk1Tj&tewPf@NG(#J3Rh8#@{6;1G)%qkKxKuXCbZED@UCgdfYJDIj`Zhp}Ei_ z)9{}C;-}dRz|E`lYVG6n<)P;)&gz=2B%;x6^C<1acXzv)5=(P<{QbXSzfYg>PEdLI z7CGN7vqx8>QLh=j5qZuVtNaGH&DMpusw_|IC-w*G zxNY9flXqTt;;iX~H;p=#J5Sts?&x*1Y0zFg{&9;)lmQW}{zU1xZ%tL!iSR{moSGji z!x#@}9x@$scJ3MYp1{=zSMYhzy5pL-Bc({?#OKBv2|aNG)PKIjl^pgGRgPas(MrpY zZ96Ht)sg2-xmv!H1l>aKSo=$3ZO3)PUiLblb}f>;R{y}gpshRucnmxaOp&YkKDFZ8 z<%TsHoFk8zkirwYANUkRhVSYz^W!CkzHM#daWywA%#A{jyj;CMQpwWiSH^pnV2U3v zQRh$m73j^x{oK|h|5J-LjXYOTxMH-0WzTyJkC&7MXMDy*U?R}ev(YOw2r3XHT{yd1zK>W6&<8QjcU?KG5ZrN^O zy0?sScng}~?ukJg69MIg5c6%6HIc*Su2K0TJE5i5``KL{WEDD@{HGHSFsVFNNOU zrm(iiy?9*<<+Nzq(Wd1Q-(}Q{|XkTk+7&69aD<89p?< zFqU+F#{e#7&WQz#@7BVJ2*R|~wpBhfUNLfH8ZXh2*?Ll3z}suPJ_zm@bFFIU z+qpS;zHy`MoS<$cl2f(w7#gsB9#Ir()q{{t+74iP+{LW*frhquOlMv>aaKjuj@P-h z50ogYZF8iyx*TWga?p1@IV-?;Rh7O(nT;Q)p}1(W(sXLB%ec9?osK=J^!#lL<(9{` zqdx{;SgrUG3Vs2>w_rPA+g$3!&v7Zd*r`cPe{8!-D{c1i8aS$W!)r5LR;2`1Wkoyf z`XY~&BT&~wDg)z#k15kq*;0x$xf}{Ff**!O`QB2b1taW!9ySLkVrl&cUavoS?7MI9 zzJ`f5<&h{wIM;11)7M-q8t(!U?i_F(ti~L@ZWRXqs)aR5l?VRaR3l{`4W+p>$mT#K z!2V3z9C}m+88@K6VFu=LRSBigmAdISs+|(Bh!(3z(?XRhjgR+p$QD>Dp)f4}RslP5jdd@ijd>nX+f zjWD+){&+Ts0WMOVUFw*zzeP#D>cIB?mO1J%m&s+zJQXt4W1)J~sK*lZSf(CVtH*Nn zXi|?BE-9{UUA4buEdq)UV|{(I34a?Wi_N3&*wH|5&lIkzf2RJ42ewmSqH1^P>5)B^ zqiZX$fR&ycozd|4(DP$AOw+*PMCl?RxNp018`3x0yo>P_X8C-2yaQ1l`pI`1E(6lf7`9nDx9heRXbqX zpz)5L&)A5%_YjmZ?jD_6s{CIrvR@v9oxHbyfhAm5C%W^QJ7!$-4isys8VnIwiaj)7 z?%NI5ZF`t9-LSx5XC};B-G_>eR(uSjLMJ#BN?>{kc8@zWA}2nk_4yZZ#!nRHjH+fu z&J72LrajxW=pS%zp15PhXft5-&x}_58P(%L z->{s%fTid2A`LGN{kY-9;`I7wu;H#QMjnSEVd8=MXD0q7;gdUcd$jF*W^kq!FLz(V zeK7nB{qQ#-=su{VZly#ljZstvxc|Fdo3$#NOTGcOsK7`Q=(&?^Tq+44r{$ z_~GOC?F!(3E`&5i45KZL!*a5-J}%1 zG-0c7)q_W=%(%K18@iuXl6VCSk5*lHF4BG5G{sGO3<$-a zicDVr#QwG!KOw|?*VlLgIJlYxswPuF7H+s(jyD8{dp$)SKZ-v;qCZNX0kxuub-G9d z`z0V4`vlx&>aNB9Ao%QWU51vOJ=SsZuGe6c(SNBfcjPj6hi%U#RB^S%xEqN+?+a62 z)XMi8A8j=}T3mALZE0MaC#|!Is?s+Tm3vZ(c z6Z_mTj9aNIcRo{`{zdrncpKG&MV()9gBC7S0~)dhm3N$g6UXodkJ^ddLE1wz`VwMl zFBXn={9=<)yhSJm;ovPcK88Q>bk*Pf5Rs}+D*dy}Csh!97*Yi|M->1NSX=CN^JHOl z;V5|jx0Hx}VZA_;341xh_@zrQo{6G=dSAs{ zquf3250|=*Y#*4`ShWKeAC?Z+KX&)*st2E-iY;gvd2MOo?2*@QDLxO)BE4^?_llN@ zU+!+@D8+vss~FST!gVSuHj;VI_HDrU{}`+sI9&DMg@mso;^O=H-4}ZJB80E>bnV`8 zcm*j{d}a0M`melBE6o1=6<@(5D!nqk^9^XFc=wg%DK*JzAEtHYywcO-(tSX29`!HzoWB=+Lz+c`hYr8hQ9E<$rS}eZITJjr}9= z?UA$CJIOJeHKvkH{KhRAAH9HwwEgo8y;pp!{bWFI1fAj!U|YARScwHhYqzPm$7v;c z9u2u0Qh3|JhQn1mu0WS;fny%XcjvKG$6G_kaVUzaU-$>O5{CcSjnw9K7Q#qZOYV zo%3gUQ@LUu&j+HU2Vu`~52YFF!WQ88-$7g3_6U940Akj)2Sl>%VCmt8gLh0XJxM+E zE*b(j-SWujmPaQl6T4S86c1H>s24@4_~PiCujoAPeLLrI1m~UCaiORh<9CBuZF_Y5 z1N?ks{QdMi_OOy$4kFpBZ^INi#%`D^7G6gaYy3^%ocE%_d*1+0<0?c--+B4TkzY@% z`ruoq`__(wymqWQk2mixe=EDLdHcvuj9D_Te-KCdnzfU5~4A#j| zV;{KKFz#M`vT3Pu9NTnD;f{S3*DT$)>Y8cXRZ3PK|C5V(h`sh}r5C_e_kO2utIj*Q z->9<(?0qd2i1&oVi&DJpD~zfgw<^JH^~tsacc0UAO`!r?*bTp|V*BKMXVvYCOk27y zGToRMrQD5)o%`D!;pOL^`)38XFlrLu_90>(tx3N1HzC*%{n&-pQ5M zbR8=G3>KtMkGAcpJw7(CWo+KX4aI|Z5JUgS*qqNJBye5RyK4Ux%20gK|}G`st-N- z8y+WPO`m5=3Y68|(|^<3SWQkvefG{{l*_UI{TsFlJ@&EJ)$_yj{2GgRKl%-CP`>;I z^SH`S7p>(?UfLmpJa(++_29Q@zHgQ48_juQO~z=6J6Tv%|HOkQnZ?F>_DgQMO|wqY zaxuE?b&@2WFCCO^%86eIea14srE>J5Lz}>z7B0~v`DM1vDm?|82&8vj-+7{Vbl-I2 zKE(9xZ8DC^u`RPH^-`iDocC#PP-SGZdB((XpWa!}ysz{!%v3auGzX=m1kJ4Nu~JS z%eoXlQal;-wAB4`hcLitzy6M6Pl9vEmHskJ{05DEXYyi_H6f3G6bp z>{*oSFG|H3ijO(=2?FodJdG!x!HGuUMlgr)mUihxem4=;tC|)SmNv~Nj(bQEjO~=T zrLZ&t1BSvos~$XFdf~3;un&AfSp~Kf9z#?rF7_tJZ$R|oUfCO&Cwnp~0ybsGmodH{ zjkL|Em>8+wGx4-<-EI;Gp#M6}Q?M)AtxUd-&*ozUZ)Fc?hlKmz-*#9%jxaGkq3y>` z-hE-!m-mV-;IyipYnZyjJK)UGw!>>1+Kvo0(kcqlxtcybZXYJFR{SVyj6-vjtyU|u z1V{E)>;~q$FD$h^3sanp0Jj~QcsmXJg>1%Md?sz1yPUsK9>?y*nt$@xMFiNbw0zJ=>#MXsbs={QW*wH;Z=wKOo<-mC5e=#m zRj{79I_^YY>8M3{K|qYEvM~a5iQ06I3<2st&llq83f9G9BZ>OIa!&nW)CO5ydrK$-d~0O#2}kziIARq=FJ$4Fju( zzp9oS3{w>OGwcoKS#SdtZ>D+pH2~Luow^b6p5d;$I8!YalbwIG6Byj$a76is51mla{)N8@Cu3@og<_n@oILZpA zA&)wawjV*N*WXMv+fT^~=M$b2t(9ig&KW#SkL;s(QnDX{3vWA&1E+lQ;CgRT9 zo+XLi?eR{41qC!LtSJEFP)-|vG1Aq)rla_r~KeNiBC z?AJU)m=BfevT=c{9iWCsmsLrZq48;segORYC#yWILE>B}KWOY}p2lal_1H0ZHPY|n z=X>uJ3hwR)xAD=1t~o>qH+_MGykbS-f$^$R=RBOham>XJDBmxfr}I^OImrdyfff*MV#{YfKbb98Y2XaF zSm{esdi3RkrKjM-d2H46lZfhH2ZQ?Obz>{fZg_O)O?=!yFMhjgAE&MzTR-EqQv0EA z?xFtqDz3dCN%_UUDE^~ft&}CscoTbOIr{OcPw$=m(2?1oyWe@}*O!*|)qf8j#-6JG z(fFGw%Ew7~t$(=mM*R=YdWX>#F)sXr3i?~(_Y%L;Xl#LZDsgA_2zzrptJJ1k092IV z5tkrm;~>GwiMmlvI?74!dN>Nb+;sBx!G1kGCrwd?pLRI$6a zAAxGP>(H+0Q$;(8Ez5^XKbZ8rf-OJCpE}z^vuA2F51aQ>7Tpp^&I)0=0JJ6SxHu1L4^pgh#;iKpBT1uh2XL~}! zuEIG`8yBicmbi3m?X-zXk{=3{cfYxn0B_p<+ESA99_3K+g~uKq*)#p_*%OCkzwW*z zM4MoH`qq=PM=wHPY-I%zyZiA<6z>?Vsb9JrRaY`;#eE$kt-Re*yK_(J;lhQb6JuXr zgzqQkd;*`YE1n?Q_v~P+F@DF#-Z=U0o3{|j9BJM}pNxrF#ANTpD>2$HO*}XTsm74> zUH8q!5dRmdaK#o{C$}&`z8}De5zvIM-r9uk6LVBDS};bZjXX4C8i_b9#$B)CYyM|j zKtA{%%6rc}Hi1NA3d`u13~>uw^{Es4NCf;#bo0S# zSd%BPWjAtu4HaSf%X?{oH*~N9L1UT@&fws59h`mFa}=!5LG#2zZp@Yw-!coc?&A0D z$eDiIt3HLhX|``&f^tykK71`bbk}1r_-0%!g-g#j&Z6eP7gc|1ScP&LYqoDLaUf9t zXMW-Zb$_n~acNom*vTW_KFF;Yzw6KyTmBaNK2=}YgVA=ux%y<=RbyS>Bl?O~ns^hX zt3NUGc*E0$*^mGD+U|Xz;{;e7BzJ$%xhRz5vRxas&mw|>Ir_k z7vE~m(P!80dL9-cV_kptRg<2dZ-uSoSlc(hP+Qvnph-Rb;-?{d4^aFY5)dB0XYiWa zL67lk;qCh2uXY&vVvPM~;eCHZ86!k$)MJ@?tbOUOR{FO7z&0BDe-HUq9f1>sw0+f!F4vc~Y>TuUs z<_ECO;wXFRVCiw}0iG_K(;CZ@Sa88Z05mn!KYUG7WOI=5+ zcKk5~?`}W(eQ$dbaerPqOi_-^JYISl!JoN0BH}yFZ9o}L)>$p)~A zVjp}*v5UE4`o=3GFJD?* z-f+C?13L_y!aut8PM$OMC;f4WlX*d5s6P>aQ_V>r=6io@U&ATL!*{nIdUE_cSOFcO zuRkdrX8^ta6vvS0{bw_OPeD}%fO~lsXxk{cb@?0;^weq}Lp3CLgA}y=CEC)}j^`&Z8Nt)?aYd|FmCZ18yrZi0lrrsA#%WBZDK{D1WdCrh{74kIY`MT~`34cVwUy|n> zfxjZ*Ps_7X;D03Hd*t~Ud2W~IDv38&o(Bc~h#o%z|GI<^$n$x5j?42|c^VS`sDuaP zd5bP*R6Q5!a_at&rzy`Gc~;2tB}q3=!p9~2ygcXXcGTsN=j-x)T%L0nu6Vcc`~K$} zP;@T4u*DcJ(mTsFSaGffCq)17Zv21b-yP4l8f$;vYGm(ibz#>^xI>=)-y09L8iilB zf_-uSJ#c?8J^qawEBU$nBMN?&z@HcRvQ}k$G*jRw1l}a^HQbn{;BkSUC*Vqf_l4rW zMc^%=d@mMwDum~9f#(GNW`QpkctPM72>d#M4+wm=z;6-ws!+bS3VbM(Z%W{61%9r; z3j*IR@CyaLOW->MK11MtEb#RqJj=hJ!V7n+XNACzNk4Uj%K34@vrFLT2>f1w|B=AY z7WiKXe0Qk*KQHi2Av_po_;*t%{#PV^hm>=Uzz+z#QsCzc{Aq#T+oHyguJ3cYe`Q?h z_L8V@T4zI=DE9o7l_Bcbuo zCGgq1gXM_}eA({cco-1))dIgr;2#qBk`VmU0{@ugTPg4_2;20C8|Tp3D~)C6tTb++-@J2I8Vl(+d*(`G6a99bx6=3s z{SMLZ)0HaC0eXJFQsq0%P;_*fy!*o^k_{c3)@`_czFEkcIV!C=-v=o4*=AHDteb_38bv2>WU>|^NM?G?o?P5%}e<+<)WvenciZw*QP$@R>|A3Y;Pv{erg!YXk8gu z)wX)g+I81nx4!-Q4IMXZ?A+9KlP&X% zA;X++U`UxmM$R7SPG*t?GZ9UuC=2yKO?vHuX%EmBrw}a^ozRzDJ{z-XP!y7B8piAN z*tGNcY#zhatf3ga`DmKnYiD(&>?jQ@r`VGwgi$k5Or>aq^it(=G?43Nb=q9t1T{@E z;}r767!T1pV*$X`byp_%&n&~&`_lE+dKy|rrkL`5>x;TWg8*`eq3_IZy{<%I0wsQGPeCYcV#o{rCE1d}aFeYW1uRmGk4i@bmOuvHsLJpSo5( zYp$F8?E?DtPWol&_YwM;f~!fMH~Dby+~B?6>wEt`z2DNI-Y=mtzr3-<7@+Vo^gGzz zV$8n2#rVbQ@@4CwZ>j6m`(M)Y%h!8&@Vu08zggZtdP9rxCHg%_zu6muc-CwTrt79~ zzc0=_O0%4PPJfaHsG3&stgQw#(IZ;>=nH+Y78%twH@2?tYJ)D>=*dT8dJy$wa^ zA%z?_d3PpDliG-7i}W2eqGd0x^CBXv^2*yx9NfHA_zbf$+;onrX}?f|M7Ee=BHm-0 z3S(UO43LC$u7GbkE4PUV7ER@;Q3mxQ?R_--v8&Z0NadIOHEpY|Hfe#Q^>WGr`|5w1 z$}LVMGq-mOI-x^IrYN3}5F#>&M!krIue$-+OFo zd0IH%SIiR2;jX9d3QH_bG_CsDXkTr#Z!+3%Fla;-^0e+JV^%sFFQ#nA0vlt*i|Jes zF%HH}=t|1`Cdx!Ok1T~;4%Dy^RbgFBJur(#;H=;{5g11lmP-Yws(mz~4J)C+;5ZzN z;hG3hl}I)>m{0chfyp+nT(+#iT%9Lwr8Ao-(6VWpt1+XvpO%>GGO;=^(VO}}R6sc> zrXw-0F&zqlb9S=De9Y!C8YArJy;wFAPb!|rG&l9xgqYG_zhM@or0y#WUc=MZ-b#x( z(zUm3jI3?FepBnpb?et{dbdfS)$2B0-`3e_uHLZGY&APtH*Q)N=~~~q(d_8j*s-Cr ztq#>s^x3JLVOi?Ip=Np#NhPjMpjIFR-roWvNE~XMcs(meT~)9gJDQL6Su`$O5KB8T z3vQ60hk(ySq15`z%t(10okpnU8YF(HF){_cqK#mYKUMx@$AC3m{^%iQ1SW|F^C}@Tjp7D|p)o0q|8pp%H)KO;+z-J7sZhLB@Uugt$^zY{ zPN0F_!vk5(gJ3#_h0+4lTrOU7Fd}$-YRzPh{`Tjixg44)luqEmgbNldFoeD`VWkq< zSYvq(@G4HcCIWhCNTK{e#47_R{k$rd$V~QTh~N-cYsaGCUVTl%D?u`mq$O_Uy6d|( zty|w|Pz%ujmod?7EDq&15Xdc)om8CaU?ck4A7T;_Fg4~4hn6clu0z~*z6dmfL6p6^ zP|hY$tMx7wbs*g5iiNm(c?Xuowjn&(F34f2XxY4rI+b})| zjK1=RIAxf)a(H;ytlpN0+a!TmifmiyXs#Ji!a%cn@vu>6UgHu(Nd=j7j(QA?!?x8b&YgLHxSgC1}2^H z+u>W=*1D=~V`l)br!=q!i1Pw*cP6ofo?^jHQS(mv9*}IbP=j$`KvIpSQjM}&h``J1 zKWjwt(R|XDV7anP%1Ys(e<1a=A|!|zz}RM9SDMHaI%WzT>vE#KHcQ+$i(Y3751P6< zT8TC&NF$J%W|)+l`d=Hwe9okg7CM^-pAtF|OL4zZGe?8a7CgK%n3MmlN;a+M?<<kuqjGunl(_REwZ*s zVVRAN3z~9?fXpfOSh9B5POWZlt*M%#OkfR@(Cq1WW!m0lkfy*v16fmJR^4f7p9pmx z&FRNet~g%b+io#D>dwWRrPB+`HD!98V3DJTgu9$Fj!7Iy8627qpc#m&gwU$AtSr-W zqbv&(#L19Qr3e{o?lP#bn)HLZt-@SS6MbJ1DkrPLSZPP2L(-cZah4B<$0s%6b;T)g zxPt*NL?~(HQfd77LQGYtOiX9IkKi|@OL>f{Mhdi>%e9s5Pg+NEtP{2i{m@309sC5C zWlsH%b07i8Z6oPIUqAcC#$jmrYxy9>V+wGoC8Fugt=Uo8f<) z&K<~F3Z%*E1ST$V$k|NHR(0^Pvw?rBva)BwIsx7sO55=yHL1er(jYL&W&UAp!Z*jH zZXkJ6F;-LKfe=s*&nCc8e|x}=6$?W4ZKCj4%cMo6J(Y0L1iXQ9v4N;dJ{h+|n?{Ny zQN)(Y1>G^BR>`@YokG01iFh!Qzw>b)##YBEa;ZetP^`3SZ)ic3=&HMPq8xW{U+(4Vv~@cVelu z1H^>LPGlf`C-c9mZ``d);fWI2R4Ut#mEIFxPdOJlh}b}qM)fr^i~v@XH<}~?Tycd* z)J@3ar$V;~5f+(gJ4&6Ow`oWg^qh&?i6{|XVnO<%Ta(n(*~FGdDuAd-4c0TG zjKZV%)J4S%Gmu&%Cfgv2U4TZ*F!q05*&5ZQjRhNeZlgj{`&tnSC+QaiUU7v{*N!jr zDHbypFd#NCK!0*M{GlH}lseMUVbmdBH0~G+TH{f?^%!*tW5H_Cc-5_@U^Y+B4IAmL z0LZ56=?%D6BYmP_8NK08qTvtlMt>5^uA(>mNi18AH~Nz|7Ho_b7+20%K&%x_9eRyA zM%``Etx;pawfI{XgQbm8_x@xKaEcr=T4Jbs^|rR5_M!In#_Ad>S-d+I&A}X{n`%{S zR@cy@Te?aISvTeahZUu$-ga4ABmHUTKkbbk4XNG+ysXrZriK!}Kx4JN=K3x(0;OIm zo9U(QbBa04Du);?FCLFeBGI%$4ZBD$6YjEcCPE&2IOI!cQE`VdSqto3FSFTzl&$H^ znW4JUTG&76s1sHzk*$@dlQK=1kU7}jm6nlqtxR4pvZ)Iy4+c1ID>jr8B8$^UcO#|-^D zbtB=QnopPrHZfD6sROi3yswyKdf&$eD9mTbX1eCQ6__*p9cQ6Y*GKbNWb6N^IsISV z?f(HYE!@ZYAIj8Q=Kx6-`vHnUv~sb&=IUf!Z>(?9=+OVFH*cGiV)1bGjsF>Awp@9B zx0*~@3pLK`k~G?KIr(h(#t4s@avhWmm-Teh$*6OT7H^+0oCp2sY$OS^x+dzR)%dNI zfR_bj+G+~20UtICD~iPncPHj-nPF;y-L(i^c*0l->LMkL5@XYk7e&O=P`D=-0E6>>UE>84>O_6WdFM@cAE8*XSQ#ZX5KWg`1sr5 z^y{@MfF_Tp%RKR}cX8&-+EU&m#nvnOc3A@UU>3G!sd?F^oCDmFnJn7GL{bcDl7b0} zkyw`fnW-2;^OP&EqPc08y0aBXwKf-7JnX}A8P@jxY#xdNZ_kWMISB^w$xBDe)#A&e z87FypA)lna&Gk8Iy}3MR$D^4-GNxA^FO6D~ikY~b7^c?uwdU|Ojr1kS-)UhTmN^q< zpRNrSU9X^2+GJTfLhPflMzPu%_E&l8e&k*}!@l$WQD-pgfU#|B8y}zDvJ&w@H(a@% z;tmHUA~LcBYDVb*O*?QB@R(`bbNe*NL^u2cFg3ZT@*u1>zZ;@Gb@R+|=V{{^o3 zbR4E`lGCcE(&f0mG%Ki3M~&*#tmBkOCJhv2KSL;ER=${l1p=Q&;K^ZUthgOZIm0X# zoQ~J@7w?P|N@tq6I~GnoAZ19#f^4Z#y={{Is9XbCSAjgr>_RUFz@W%zwe0 zLAu|u*Uc&Zoq@DG#lNXlyZ?n#Z>qxn2UK&?9J%6(P*6{r$!pDjs;a=t?+mpC>9TTs zI;1bqX#agGgQ@fSPf!}1$*?#@|Np*U|C{#fZ?&|A)j~#i{SCFt>DS@kPBjFIHmMA! z`giZ%R^$G?LBBAcF9Z7$g&zpP_LqTuyA1666n-)UJ6s0#&t+iGm4W@V3~Ztd?B``* zFP4G5OySo~hq73Zk zWndqt@I4{eXUf1nTL$)pGO#a~fqktEY)={3x5~f}KJZ=TS55yz9S(dy2m>A3`gkxc z!n;B+(3clOu#3yU7M6k4mVwokfgxP+L=XmA_thtZu#3vTE-eE?cuxohI`s5E24O49 zz}A<6-B<>O@be)U=-=4Y@^?a*QD6%Oic%U@in_1nMj^&E-hLZ(26Rf^!H!EOd z0O-EzN|pAVS2zClCssvZ>`2c`n~tx6ujr(6g(;L9Q}&)`(yguL%%)rdz6053|KpJ zTlFV1@oc|CVv1Aj5uaZI0~bm$V#JzeQ+6PRz*G!%HXYjAbexYb+X}*lG61n*j6Ue# zn#TB(5^jDQ)<`Ui{z@D^=iX?oR4+<4(6IPmCYlD&!#1Q!VcBN)s#K~yn#@EtZtBF? zE#_M4NxZS_49t@(*vMPSbhOvDU=_nSY7~xcbtbW!71gi`WH)&9pXUEBTK(hS*!2s~ zk8Z$Ko_pXLhWUH|zFDQCFb*cgn>loquSD*dh343jXgs=vxceotqp$?bKK?-LpcL_> z!$~qJ#}}fWyXs0S&t3uZgZ>Zd1h$)#SR?piID=^zy?aq&0|Qnf743DJ7qO|9_M&Au zwldKd3$AD(>Vg(|$#IBu(31YK)Tv)zO{slpFn9p%woadib~QB=(^n|xw$yEwJrJ{V zQUqmzmb<-I5Hv5^w5r{zH>GVC=@=wE7xSs+zCt0_xO8cMe}7#eo{#osGj$oeurzPS z>`Vc)jN&STBK`4ZN`bdaINAXIuu;@|cn-8G$yZr;>35;fBo%iKYnv^ZEJ(B- zm}=4qxYwwa!pc~uU{=K!UkuQP+BTa*rBXJ0y;-SjHs^qlHp&i4jr3z3J6aHY0Mx2{ z=yRcBw-Yx}+YBq+oHxHgC)FC)_o6%Rdy<)@#&(2@PCgjRFn0Uk8ul52xg>T6id-!^fJmhz5ed5*HYNZQY&3s59bd!O_<(kdIp5}#VuWH(#oSS2JEa&F^ zHL+aZS7|R`8H+IrCaLI*av;EPir>=bD-EkdL38k$!ecD13+Vubz*QuD4j>Ri?FNS; zxF=>MMhXt15W^cq{RDt!4t_ukYlEQ`x$cXaZvF;Hgg-PJw_%JaFJ;zb-&dC2DK~s? z?yJR%wqr~NU`;X9A91AQ_Ww%tE~Le<+BlpHyVwdllW-wnmldE@`kS~ZQXfMTd5ss# zbGbE@&#hB<*$R88@QN=Ux_srC$`_X<%L_G;7qEI#+1Tw=RP+d&OdHnw=rwPvliZ-0 zYJ|BU&59py&0!QfW8R^RGXv z-n;2NCGadg-!Ex*(DOqA|5JM2C+~kv&#z0IJ@h;z_@AQZFD1_F^t|VO^?v?|R%5{l z^}dXr?ec!B4?aZCKa}^o=^2-_pQQKCoKX1xkGy}GeqW{EcTcD?9HHln@_vGzvtL&4 zZ>Q&#^4>(xP4fO;dZy$(OV9VetlEDV@cUH0AEfs`qu&?l_htD3{vbUc{u`C{AiX~$ zc>aZ+FU$LkS6YoXy`tVPq~~{JJX}og3tmxpE~n>J66c-tJR~@;rS}=1RrS4v-v3qL z1N8pCB>pGqx#Y9z{qywREboufdraPcLhly~o?p@XCV|g*mFg+)i|D=nRrP)~J=^4c zEj>Hry_25reO2Mf)ALrT%boPTOXBSI#s4@x@A;gHe;>X7wZQ+5o(~9~2kH5kz@Mb& zNB>sA|C!#uCHRlh`>!OA6zg+v)k<*A$*8J&OV#r00mdfABRm zFED;SMDOiB|YbtA2P(G(i5J8lx<`|zz4M%PJ^b_G@y4$B%%)Sh$Nm4C5jm* zny@*bnQ}I*avEb)28xF-b=hiGS`vsl1|i0S(`l*Rbe6R%p29QL8&5*{mZCn0r+Tlt zvYa80l>!sP(Wu=rc8Xu4@vYIEO6>I6sg%-Pdq;dytS6vgeAtu#MK(PhrEuA-?4WU_ zbed(p*nK8MStXOPCQPP|-B%YKRt1E+3VumvQ*m}FCt2D9cyqQ=b8tKO)uZ$y@RijY zszuE!*|Sm_5!|mR8?|7sKRUhl*uBXNH*xZ+6YLC-x`w(#9&hte&^uPJ=+(iWrg?3Ko@!!3sXryZ+fSa!SD z3P_Q@-ZmC!(75XLM$Fi}yF;=~Tk&Vz;>%a_hYtF) zj-KtS8cFm4jx3Cr;=}4-YF)fq9ad=P2&aspqVZpayL}D+?cl#RD9|R=kO8|d{N2QV zZ)ikGhL9O!x7u%j$6fW0(&g=Rln?6mUNzL)8}FgN?9!K>v1}qij{$jZO*>aLTJcqg zyq5k%=(%d~IiwQBYH)(%t4uVy--Rrz&&!@kIc zzCd*Mb<^6Z)9UjMJO!w;V>loG@3SK|{@*?BT^}4pz9ZKwO?@(2O{XaTjSY25PeqFZ zh{!u7>?T>JxWLWo9+~87Qv1QCo?rTOc9|JD#q8bMsCQlva?f$|pG0u>-H>VI4WA?l z^E^S68`?(oPyjz63xvG*>=v3|+}%#JS!j=?v;5g@E>`%+?rn@*AKUgu*pPpyq2%li zFqu*NR%x3GXJI3=KuyJsai%BLjp{XK^?I{zK zl%Luh81M+C{X1>w zxh=wf2xb^ZDpwju>GxCm{fvGu(C=lrd+^!m>b^#~i(o3>(ek}nKbu%ryJDt}AGe(t zO+dA~m`#{bpZjRUb}BA$ln3c0;vaE|sddXsOuxhEC8qK$ zZ3HZZ4ZqeHUfr7bv7)(YYcy4~SIq2$8)JZM&?5N?pI-c(%7#0zdhArTpWRGEdGno} zd!~r%LJ{56$l8BLLu)D-Rre}MBdL#u>o^+wO;&3YaS9Gvf(k{HrQgo4nAytvQS4Vt z!%!wKDiy4wSYSVEi>yVa+IaANH)TKCIRy^vMQMMfNhb!!KfZ0Mh%wbiIBsTDr%8h` zno%MWE}ybiH8Fg}&D^{zw#;0`icxAc`Ji07@kek`NkXREd0oQ14X*8UOd1QlBn4-d zNc1GUPTy{`tGpiDtY?+{YWmNSR{1d<|A{eVgP* zX%@NP7hyATjcg|q!rS4bF{GHD`m=WGsWvg&R~z^vE-YtmhBn)aKB(PXN5aKC!yTQAt->Wc&V4m0d3nge0!a>nbj>?(}qpso+SEsGZAy#n~8DI2db|81NSGXQDaof zUR!x8Q-dn0eRopvTUV}Qv6iT8#&!P6+tKlO9(#6v+)mNSC1dQXvk2#!G-1+q8vcPL zHfp&!+S{AAd#Th`-YyjLnPB-83`J1>HH(xEYmi#wz{uvKgNz1*KdJ6T@ukmY#iy$N zj#BV_A-)^+ICU=z>}k+dUwZz)cb-tX$cFaz4cD7`GmcFh+Ss^<)=na$vPe=b9b84h zQPMdYqA-vMmdm}WN`D7MfN$qyrfB=F_%dBC56Dnis|U9%IWE3r0v*GjFbJYCIii7F zsLT>uCx!@`mF;7Hd6-p7Dv#9)mp>+@rs7fyvGf27CY2VW1iocaf(@RZOjE_?W}_nY z*h%(~DoH(u#=X&e51h%0chD>kqyjPdL>ofoOJ<@uVoGy)cE{~TqJhP``kQ;AanH&t z7Ig}t_67*0&~ez!xL*QNmskLk;Zs|*{BT`}?v) z7~mBcjS){K60n=oml3S%+`tLy8yc1~b`7|4*)m)cg+{b^Mug^=5-RZ-StLP@G8j>g z?M)z^{(Z%0YI5J`beiu$EZkQF^1d0ffh{ zE3FB)bD0!ZSDsc4ni*miksfr$3=(2A~_Pi%2h|vhKD59-d-B-ey`g4!0U`ap*f zN1RMpsVE7WA-<)+>tB`xA4j@+ft})YHcoFy#>tCm-^JFU`V(nz)M~1TES5r~aF-dL z2f}S*^a}65T(+1>=~$MYirxz6>&`Rc1A(UblxTchqKa*3S-`zI&gE}(5e?xm(f>-m zQVeH}OUa6v{wNd$wQl_=O@bu5l(q-s3%6W9@_F~dt!yk-%(J1==0qwREm*c%IP~0t zT8kHSe8dZ{LUIR#k`XvXvM>k~tV0RYTNF95lop%}{Vn7Z7_j_;l~yH@JD;fQvm}Zt zUPyg`{;fc=pJU;|Z9m>XN+FjL*}T4My%JwNJjw)=xX}PlhZ%>A%ipaY^)7~HTCJoa zFINvcQG99xqROW)qvkjyzORTRTNm?a$@09l{tR+X;j~;=B6+whmxpig%G*PIp_^Y4 zIp!cpAsXOHE1vA7F*0aJ^F9=yAy&%H^pe2s!{Y;MRBoDPys;WQ1sRVR0$RT?&dY&a zWrIh|bww8Or3SP#b1Ll;)$y&uK}`kWm#Y~qA6w&JXPAfPb=HfZbo44+9Z<;ZQ&IE3>UzM8yX3J7)+7H88{;AiaqQ&uMdR6i-<*${Y<9@vL>#AY z`s8{Y2jh(OR#8WCP&oYf9JbeFTv=Zf)oVH56{G5QM?3EN9%n3kQG=CDBuKu~vP}tSWxJ^fu zW&sqPqhd}m71>5RAPV@)>d69fCl#V|vTQGSYGRmzb41|8EWpqSEM4Z11w3f*Pi(*YoFEiX6PV8^wiV6 z_$NHNZ$4r}3ehIfd=0!)mbMSNiV78pI*)tKn|@4_HKq`g>cc1cT~GYh+t)eV?Hw+r z4<)n2Rv*!ZDrk1Ui}~$#@h>XRNleuK6?-9)90x zh=82R6WimYw7yuYfRlQ1h}gsCB|fxR1(b5^cPMX2F3`AYYke8G8!8r4^|JZ+c3q^m z?6}*HYB_M3MHca{yL_Xin07x8;AWZ67P5*RKI5_CrXVzGgD$+*c)AXKOHE!js~~w; zdS8zbq-ge##2@M>)>E=|zfTKSRv)M2bTDvsJ`)_5^A&J@aQ5*fS8_Ft6U*}QNemim zH_$`PQ9`g|v(~pH{24;=g?1reu65lZesp z_L$Ijub2`Kd3I%zd?~LsRbk2LZ9L8e^vVa2bclPq z0wxp`r{1mywoZD~S_X|nhHowl(ws?awm%{z(PbHrV@;mluQjC zr;*@Z@x}<#3CpJ!^w&v&6}!_XN?B~%D^8h3SXH0E%Anb99@tZ@L9PXp9{j$94y&dE z{F#ogb=}|)D3%@1;4VX@Ao8{=e7Fj1&mP=M2;rn2bESaOvHiJxv^O0M@C4LNnx)oX z5s%imSk|Mte1{~79Z4)`{zelY`S%2taTQaae)vo_QCAr_6gT6qTywxfHqTbL_! z#SFzpGakM`Z_-?H6`2wN7sKJ$=w`)M2m|4!QTs!F;aSB~gF>5#qYdX%3(hxdBDJgw z)v^Z`Tw;dMl)i)x#k=APa4<@m$>x3S6*V=G=eb*FX+2J)%;A-!7n%pIUL&ZC)M-T1 zr1g*@#d&RnS;Q8;uHb5_I1t_V5<;Ys{YKUv`tnv|(<)}vi%*y6c&R*Xz2U7-Q|s&X z_Ku*07SqKqgVse(!!PaWb5(tWgq!@0nMw${E(+>7^#&Y4>#-0YgQeFgCV4X#`V)tS zd><1kl^`kVEH>Z3_7ShCSg&Hd@1!?)eeK08K!E+Fbhn!-jkoFRc2*Eqvj+m7V>vc9 zVC~TU6eL34kYUD$S%)a@o0YgO3U|r&uU~$Hf02KESMo{|daJr`=WsG&UvUG>bD*s5 z7oVylBwGm%JxMIts&VI!;^dRKGzRFeCo){+X{A3O!Oc1@r znJd@N#xL1oDo%}*%kdR`Tzsk{6MR2fE`vUY?4L6l$ejXj4@K|@ppV|>a8$9I%xlXY zytI@jh9DCwMMR?zwDIt7D?tIN^h#QjBtcdvnQ?--H>9SSame#dtz^cgby69S8znlr z^uXUQEgD!;J6UIw8ua8&Z*64)=9N3+vxV@?BeeXLF&88gp4pQm7s)3;*93|>@Z4jq zo0i5y0uZrAo_;ul$FDhduNwAr%$)l6Otv3up<>E{>EX1YH^a$2t_|QQjdXTC1a4^3 z8s%A7DUPT|UlY%>SI&sRNloyKm^Z%Ane^GGw$^sKaoyoG5os81g*7BEGGgn?_?b+I zu@VTFhFSidIRW{O`1t6RZ_kOBDIq+PhWAkeu^Cb>s<<8r@}&$j^*~8#fi$VC6N4L6 zL3FMlUB0ZIoL#0U%5cG#F5??X%B-P$GBsL4?c?%${v-^HL+sMko>IrFqw3a}r03n5 ziUw(do1;kTt{IrloEcbl3jx1cB-U(=2HQ!02o&C()jB<)QhpI!eZsm7_T-mf%wf+> zZW{MhDPa1bX|KNXlr<1~pAkd%RxA_d;zf0Qb9ZD3u^;Iql|hfrC8qM6r3Qi$LtLau z#iC@3c}EQpU*4jzU`r-fZ&4>MiRfP|t!+N57J7Mzt~B|6qcs4Skn zZr0&NnyRKvkA)0kXIqO`HM~#5cb?ZWjDRAQEMS756tnL3f$TpI^ zfuDz@-G<(wbzYs45XFRwWJ)Ar_tQKJQQM%ksNs>-scl6iji>EsW%Z6I)70LaPZbi5 z-t2;I;}$n0y|P~M?ThkFq`VfXv5)9HR{Y65Y-0VQkYQO6K=8XSKD?-vE4%s-h^A7d zEN>^0=No0>+naRvIu+j(-5RA?kH&;ea6X>09g)2!ZCNsIt#ag0w%>#X6tWf0B8q(C;!WL}~ZTEVS^N261=!DV66wiz&s;|M1D zz+`csd3v>};rJ0{vI>>aswBd4SR|RdRqA0agNcaRARBZWWpFBdBmt;0ImFYk>Fi`I zD$i5ku#=3!SHlcVNnZ_}w6RgMNou>8K=aMp?ZN)6>O05D#*$Gs7sl~-9v5Kl{6=TI z*CysYN>Srid5h5RnIR${8b>6?X)>qwWLW@K3=(f%61F-n0?Al?`D}(5SsE`mTW=|X z;?W=lHVZy0PaYJIcCnGeEszvp7WwobgDCscQZ714?u)}+sfSa;mlE8c){!*KkGecU zflaW2>Lg{|7$7iwu!k!>X!gTI0mPcwsLs|K+dQEbne;>{0a3cX;23tnvWcox?nL|I zMV<`A89A|N&h`s*jEj9f867GjaTG4hWiiw_SZ(_0_@yJ@piD6c(#4dLdzyJoEdy`L ztkBL4Ix(`e+L8|mIjoDwCkJ@k=+S}HitWbE-pci@oxsdC@fOj@7~3JaeWN(_tjS-* zbY7qH!ZI|#;=LR>Nc50U73;IOE?}@|%=3A99B)`6;+nn0RMC_IL*8M1f>bW|1rxcrcb+>q`bTm*(CE}En#nr8zyy?<6ZTZL zmuApX(DZn*p>OekA6+oyLi#y4h-f^>}oA;aa;JpO**p`Guxy2+f6Tw z2`gKuPm_E8*KRev zd{kc;1z4b`l#0VW_C~m9?H|O>VV#RDWA_sWfQhbf@ZN$F`JiKj>#$GJ&5 z1ieCs&S@xhHlv`0#j}T3>l|yB++|hh*rNZj$TK6N0o#Wz@pM&U_yB}FU@SgehO%w6 zx#^h}3SAUqC^<{#O9REbzdkZGgL-N?y^-Wids>d{D7F=q(q2y7B(&;9L_*~_vRQu! zLYuH0t(XZ~rg&@x;2w8XIPOM%LUs?Edy>5t%&nstMF+jGYgBUdf876f4VWHAVe@&Gm?>bJI3MZUgQQdLrrcX+bWpjgABXZGR zMcgKt=>rdDr)*LhvW8%AL@)t6Wb@M9%H;$^c(kbC(Q5`<0uSVbG!E_nX0BVyB%86` z)12q&AL(pcVyXx%g*c*;Oy>1LPC??_p3G?nm#4sid89SLw~5#p8^BIBPTN~*hey$c zls%v~{gN?RT5ujjA3+d|tL4H|*&G5kQI}e*E;Tklj8~ddY^o|sNZpW=jeFHhiqfiF zbrysz&fZ{&CwD|6Xc+6%ao0tw;Qfr!q>5>^UC3Il0Yw7S;k0si$I$lp{7JDBlQBgd z(@jBm{0`2kUzs~$(nz&T%MohTC)s{K(Texb)MbyV*!^CQQ}>V#J@Jg4l=Z5r7uB9V zmq;N~>T6RSOs3CFbpUBCPvYXRs@8kR<}Dgrl_21nAt75x zRyf5!zTw=#+fV*!qdFco32^qoBhoZkX6=eJdv?{?~yi zyA9glIgQa`ES&6!L`4ym?8ND4ab=r$wnHnEw_l+l=c$&cL7_t62}KEUx?++nkhs!{ zC6e$7r}d8|=GKj?ucXo{J|Qqd5YLZ7c7D`~pW>9bM00+!t;9@3}M z6S;S~xZ5pJz3A{EQJ4|JuyZQ_?)@)%Hh8J~Xhx-EJP%O2fUG$-j;#g5O~f@*gGH2# z!Hk*6PKx82Y^$!ys=+W$RX7-P4q^a_hQWPjPxg>W53Bej@vqp4lO#c@k&(fBDXuy2 zQEo%iZjzg^2@_5E%EDCNthuGgMZcx178AywS|MfCJrsf=y?e&gUs<Imt%VyLeA&cc@SEE;Em%vISu8i@DLQhVum|kl8jBtLguUEW7HK3inVy1}> zJ(D%Bk6zC%OK7OE{y=sZT$ehWdH|{({c(usk-jZX}xTNfx*l z&kP%%4(1hJ(a6jqo)cN7==@dO0WkNiSPnf-JyzV4x(Q`AZ>i%Mv_9g=yK^{*%?A{< zGTo<;XJdNk=(X8RmN;HULl20|Ys+2rSz8LpPI5HM6sjg|H*?F!SWW)6_m{MQL%R5|574 zjU#X#dKe*5a1r8hCTTwR%_De}!r?-%m|-hNW?{NqcN(rVl&AaoJ$VGRAn3 zx5|D?tWMfjc2!Klr%L`?pvx33*;qw;c>5M>uJ5w6J(U|l#TTIj<08n@fEZCaPio0* zP3E(5Gy+MNH+bp@C1?2zG?CJ^lTb$KN@L;Q(qJpeBoi{>fRai*msQfo8u@NQsAM}( zx2Ez%xC?eipmDgV*2y;%EaUhUG`&R_eN5VB8+37S1QEBV*jVc=@>wJ~Sz#rZWwWgS zon$|h>H*fRFPp(~f~$1s9d_g%Pk_U0L{XG63wLdxz59y9p(sthIQI_CHt%=8@}X z1YLZ>t^|2e;_&=OFffkTOqa+v9HkaB%9cf)XQO_B){Z8%O0cfIWBt0wx=q2IdN)H~ z$xm1AK!G!=>n97)`iozNPG*zzoLz4g%bRanPdb8uLJGji8j*71fw*t}oo z?wbj_0j^Vs^#}&GL&MHLxMMxfof;2YlKeZ`K_7mMOU^_9 z*pyruXVVPIXZu-9OlJ75JuTo%`}tuaQ@aNxc~)9@47h4GM^3$m>!RTv4`|~q zN?w0)xt~%7d-f)J+rJz}_i_*R*#;$!o(pFb7jNKtvAtuOLSmAWOX#rEXJyQ!DtOvF zH2-_1WeUVURhgtDes;#SWwc0`z(%6QK7ie|p`Sg*@J# z^U@?YGMzzY7)s20<&l?KK|Y&nZ`8Bfeo?3VIJ9U!rUNHmPPVLV=5 zAJ~?r30hX1S!?haAZ2ccHs1uLvPvm7c&vM8V@!XGz>Qd{H_JAXGVTMQny^hKHhHIIjh{-K3V3Qf~96x zO}Gr*$5k^{H7C^6a}-Z1(?rcWuUeDvc?WnB%DNmoga5a^vw@SctoQ!4%L)r3A|isK z4!Gzd%(B3W3-PkAyyz~h?24G^GCMQ7J1{#l?##lHsHCfsQlg@wqGDoVp`lSxk&FJ_QQ3)8lvtj6e*gdfy6*eBXYK_&o%1};=Q+>d<<8vS`~Sb*-{0taH$s`W zqq^OOv>DHF8oU;B_BD%`p2(C$!b2+hC_q{j*407>VDX5}q-3Y{QdD{wvbc((%4Y?+ znnz>Z&Oo!C{GlCA@@~Mh+MM@r$!bE~U#p{STUGRg3*+p5DGP9sCkvUCM{a=&`Ve(i zcIw}}ZG`Unu0#=43&jHUFmD zH2%z5$6K$D9C0TZbZ1sZ1@xjpOIRzF(<5go?@t;<%+)ARmVnAhb1dV|GUyRR%gwpW zR&7l^>k|k?N_M}mqQi<2AG7?QlA=Z_1oTA)dift`WLjt=>m;51g6Pxo#H_R9g4e0C z=B^gnjYxMwJ09qR*v@y4M+`XcaYRNtf;xm~9EtndNnYmE5lT=dF{igX<8mxS(1({2?VvPaS#jjlFzg8F3jthBDADbtmRWn7JV>Q=8ZJcdr05p<^1 zj-{82cqjC8o@Dh%tc4nO|HEz2rzx;`pc>83QfHz!nzojINM~JIj6rjxvE*0NL6EIW zdKQ5v?)Yt4X%UlNZNuUPODdacON_2$Fim@goOVoOeWPx22o5mr;uecu7f#7hj%>A< zURYu44DuidRk9sPUTb_Jc5q?t30b*=8S$?qJIOgrwcrnq`ZtiO&T1pzf2?&wQLmeIxV;;CiYe zbwx}a^F(xYkWZh%x9-fb$CnpImo^28D^t{&t`CI+iy8w<$M-SfoQTDdZo*NXIQGmt zIZr8m?7Ih?bxpK22xTW!kRrYo0Hu^QRLg5$sF1UE0tL*A-nlP4r46Iz8ZP~a*OIw| zulN=gOTyjV!El6^p*a3G_tbdZDrafXG>kK@Gl|b&ORiz3G%Tv&Wgf`pvR^6Il379vzgU2fD5OLZIwkzEg3RGsBz%px&t2NmR=34m_pT8arD@ zBUz)IY4?m@c1`v141+Aua=kDO9vX94Px%{QIik@Q9cSX3Pg}h36R|a;J zbzhAp(ti)dNUQOX83mFxfpmxReP%yfCM!la5rUPH{kXhcnP; zImxQ!6rUkOKTMn$HPZM~4cv)yI@tO|G^lNh^2%IuK1F*{S`wD5Zrj;UJa_x(?B^VT zmu-uEk40-L9Co|^`p%lgvVVj}5ChJgHgazlH=8DM>ayo)Q+!%Y%6xS^)UjM0(sSpH6a|lSZ%ruNPV*e@MsfW@&e|RW zrnvi^d5wW9!3z&`+kk8GDJ<5>=i*43U7bMYj_~Gv?t0M3uiHF#Poii|(H_VX*bDC2 z`z?WQ_I{^gQFTH(D3tr$PoAX{$veoyV*YLAoEEaXd(bOs$SwSYp{=Dk00gybwUjS{Vh>?{K4AD|c2gng^|DEYRX2?XYMhH(O`f zI7|IE+bQ?h(9A_vfO_tKIffgoZ8s-qrC0T=|5Dv2;2oaFq`arou30^5Y!J>P74|7c zXn7Syas&^k$90X}qG1>Q;TCno_c! zr85$so8mqD6P#1m^u9}L!=t5*k0I`yRVHgyLV>a%?@$pchZOU9-oD%MygJIYjzpmR z11gbLl#;eNuS(3GWwyt5cz=NmdYVaktwRTX+XrcT*zFD70XK1-w)Yk0v>f?;?(ZFQ zKO(=AUHzC=r#>Lm+1$5Se%m{)rSH>$mj4hRrb|KDa3gv zz;m?iw3v^Fo8pmxvnbBhZV!$dot~NEJ{(9IxJ9XJ*Xm?yjUK);wul30UkG|4ZC%vE zlxw|Y3P|sC=1EvlN6LfJlZ^A3J&MyEPk+vhb#o9@>w5yZSt6ash-_fsuCcxM*YtvE zBWg;txcjoj#-!7pb529cIt)dxFX7iA8gv)>@j6!}*KHnet(vqCWi**vrP*b)C^uu; zQpQE~kWe&ek0^D~x&mp9h}$RC$i-Ar9a~G%tPv&CfRR9Q+9sj2?*J58u1^cmr5w)} zIz1l$Lp@EMKDWU+YXqU+9$FRSk?YP(JQ!+8)9Dy={HB~I>*g!xgjw@WESa^zH))pj zc4jg$w=IWo3-IWPK2uk&#FMq=)(F3h#&J_rCMeu;-wG!^;Av+nN0zz?W{iQpcg4A^ zH)|JZ-#pEuCqogh3_m)i9H05xhhQ*5wGsj}eQdk=0-h`#8Cisage>D5B9HXh!3R#- z9)|{me;4PHbfOO()MGPkKkIyfNG#2#2Dw#dEb&j;GV2(~(|7&va|X|^_&xX7@6NQ? z8YN%oMR|@B=okT$gB{)OY^%z7=CO%#w*VU0c4l3MaH=Z5g>K<=A@U?3-K_RESAfFLp{bPv^_@6@3;!=jfOsZ6kj@ zeXgS>HBnk}>6zYCm2~JS72yJ{`Al>2q})BEi_EaT_$;8$_H?E`b)^@iWui3pSt&=T z={}T16DcxRb<39Dc0OrPWb{%G)`dQR*(qnO?xt;{)+oGg*499G1{kQra|l<-9Q}U95QQ!-8P4%T$Hw z&U0stg>zV|8xpKj51ZO{HTtF^30Xhac~*+}sYL3eaSDG~ojAEhfH-2^Y?@cf-McRd zC8jUZ);s4z`T`!>rQ*oa9=o(7mq7a~xtiut%?ePi6P*Da?vUuin<)*NZI_~JHQxs_ zmrn!awK0^u<7>#>tcIk=@=MK`v3d)}Smz{k)-hI;tq#hm3|v>V^Z6BgNP}6GK>I@7 z@zRNUyRaE~q19))DUob#C5?2fo>{L-b0>65Y@1YooF&XcRo&SXi4c$V($qyCZI@&V zZ;0ekm^Fa~wY9YYM~*kFX+=@@CXBQmHyD5gGbS0G)T#-&L|v>uyazp z(aPb?omRQ9*PMv%InqGCOa4pS?XaxfN%QDL@ciuUZ)bn`(cQctgc@6EUIIUG)#XH)&5}h;|LVLdHF}kv?QEIs9CFi-T zf;d@7aY2QNmXA1k>8ypIIR{>JI>#^Q&WAnTX?F+H*LBfM9v9raL?LX>L(}6F(j9eL z5;ESZ*SwlxHzZWI_iw40Wd@YJ+Gl0`ygHFw%VSEh@LD5r&A<;}zoU$4%cf46NNu%x;%&5NFGW*n?rT|!WHHdJZ2kJNKKJNYn&nM>Ad;gc<=mifg`EGE zO2%Vh8C2COQtq7zGL4ukOcU>>Ozl%lN<=!J!s+vhri{sJe69dJh{@80P&nMxL9Op- z#D9PYm56M~lReh*B!JoavVtxXFk<#yNcv9NnD^d;}`O#-dmgX$Zh!QmBeOh%D;0SU@2CUrn_nB7&KZ-R?Ua2NgGT?1Y`o4 zZzpfVdsJU#+G8l5((bv|^oSaJ&e2XzyGGU`n&bF#`tU;dFmp~ZVc8pyNCtDs!0de` z+D>}Motbea#>qMvI5V1qd}VCTJPeNkaBmp(itMwYZI8}T9(r^t6Hn8iLNu=X9q#X| zW%pe$vW5n?!fR!>i20=*6r?F5jp*w&P7lQl0%-3TH}iR`;x99dPMMHwB-@iI?#~3> zYj>QnDB7kgogHUXYNA_5$Ov>O&2#45`RKIb%j(rQLjip32G8-Dqc0@iX7u_ZGvJ}~ zXx165)@l^$-I0)%UB&qmWgTa&tSlPiRn~oB(Ru_$$)fTd*LZ9vA zjNQBY#{7?XA~$FS&IC4V4fFbXt*5cEGFV;RkTc3+mg0&;yYoH|T*);U0XmC~^Fa3N z=8QIvdsBQpvU_fukB|(wD(4(gIL~(5{FY3`EH!Bg1BnM&-suLF z>@(G^g06%egvo@fLITYl1^H!-Y`gY+T{RQ)v&ns z*r}1uvP>t#&Ky_NnWl1I_IfuhCv%%$;pnPhSaNiq`I*LqLUhnobQLOpewMYfLv+Ow zE4}Uy=>1}em41aux-;aKS<(7NKt3CCnM}YcD9JGpG(x~GYJB{jx6hz!7iX^2yz=*HV?IZFH zjb`gRA)!utaI$ZBqN9|qsH3bi<%IbX-tfAZGggCtUEz$kQKM3i+qq+K+#59;72<0G zG`mVZHfO8R!sQ@ce;nlLpK3i%yqcHqWUp|hiK0+I&l5?t%|eQU0lM6!W63J7+A#8JO~nrr@dMd*4VA zCS4ZqsrX7=+Lg9i>)ylhxfkhologGehr2^acC^8i`=ZUwc+e~lWLt(FsrKAH>_}3# z$x$6lWt=l@MGtVZgPVZ^e8P{9Q)mwcH9M)Gb^Ptzd*cxAi$OW=Sy^Rcj)>lmmrf!y z+U(uq=EeZ;g;Z<-zXE@yLOhb~9UU@be2z`dd&d|N;u17WE7YV@VamHMxzn16bT=q~ zJmnt?b4kYM^wE4SN|8>P)1{^1vUt-yrB4nEB(a#;XP|eQrGxE!yaD-v4z1!<`vJ56 z+PS|pO{ZH^$jRFQSC3a|M_O*ll(9J829>s6maVN+Gr3Fjm&DR^&2VF;D-uh3lfEmc z`+U}etMzMZWBR1Wwc@n3dc-6e$?f6k!5gpRdFq4emY^A`bMlYWH~Mi-K=6>J z_W(SOtK8>42jTJHr?Yh@@j*|+Tb=CWJnyXIv+nH(oKI=kJ@!IIf;so=8>zZFd3UN- z;w}ax#kza!jC)DJY~5$#bd>4Uv_60zlHHxrRwv$gX5MUJCOfkGDow?*8Bxoca`GO`wjwf5aXzpBBkdOVGV7>&WsN>4> ziJ*a1Q(PUl+Yu6B5Ye*q~!$tXAYrr?Mj&c&(v!Y-N8SzND&s! zTUgm7uPwr#G~dK|JbyJdRaP~+7O~KTFRQ@on}%s@(XS*%?DkXtRhwt~oW!6Zs?u^!3ffedepVB8}#^Q@rht zGnMoL^(%0kx#KOyqg(MTpb+ zhS#S~ar4~NDJ^u!)YS560a;YvF*TBqc^I>IZfecK ztK_J^DmbA&l!&Febl14JvZ|i;u(>NGN=TzKCq~Ob+GubhNXOdK8Vx$2lg?nZnSAY(Nh>phLDHS!_E|pLRHf%#-EalHlkS+siB2BcrQ|38)fum9ARl}y%ur*Py|E?Iiw@#@?Ft(DJF?TEzVKJgj~ z)YR31w$faI4EIox;=G7n3|-!qo)}19rw>`2%ZZ@1BV@Vt1H|z}j$n$-x%HJN9?`9Q zcyNTK*Es+31>e-Fu91nzz~ZRM7L~draW3~Mu322!FkZ%1LXz|4+=z}=x?qUxXJ0#e z2i!d?x7WVv7ZhmFBcebZ)w`HoKJscpsMS65X8P8-)|r*a0Ots&ImO=~+iC zN|R72>F4vPUx(T5(wgF-)DU0QPJu=n%V>{;J_*E>wzEuM&~Uv%>sAGMHWK@WZS^ zMV`6ooPVdf((TeV;GdnevW-q{<6o#*%Itd{$k|ewa4DfHjT0_I63G-*=0OyNu?}7( zu|QVDIS(YsT4BLE<>S#%YtD9gxetpg1|rTCIW$X&_dQxtbPfQu*}1`%y@bGBDOXId zPDK$(f2Wnn-}2J&tRjvKZr2YD)phk()SbBRQ^{1AR`DI9evwzQ>lWS{+u140-aT2? zJ~xI=!a9*W>qfXvTlBzNUeO{#nv}?G8$zD<+j;71cL!dY_3$Afbo$t;v>u{E)s^Ok zsgu04-R8HcJnLJnXa6U0Wy>)|La_I;)w_frufwRM$rezjHHR0iKy!s zk`_-Y;Po9#YM1JcwunsatIc6tF!ckupzMRSVg6I44p~z&`Go9o^-unQ`lskGp<~JyRRtKG zw%F=pK@o0kw7De{7}utkU+d$vXfh=(yIDwOS0Xyg-8tdgZCn)%$76JU{4BME2dA9- zX)3E0P_Ur5!fWWaOr64&<(08SB)K{*BZ@RUM~t4Be$>1x7I^zmiDWpHau&pAod-gj z3nFM;l3z`mB1-*TXKp%sjLM9n(Q32ej6|bEM>HbElQX8q%`x<_<%Bw_8pgXePMGkY zvy(!w8p5K8hD?J=v|W>Cgi~&@&{vglL(mMeIw$kkoz~Wv%>1UJ5x$fFZd!mgchos) z#4Lv8R;w&U<}-L=ytdaJCS-@Zdh~gN$+mmj2qVxyG5Lwo!PdTIXLD^1^Rm)B>Hw5+0F`cKBIg}K?+u(Fs2}fl( zKjhUgG@ZqMqK95clw7_HX^y%e%ijzqo z6D5mSyVINn05sJaUn67JVH$)B@g{W>>Rl<_1th&*m65KN7WlH7Tu~BONMq*Cf)>lB zD5rj2>cK5g-WpCe({NB{jA!xVves61gd_BmbOICC8N55RGm2)sp39wAU0vdMe|ot( zA^&TE^69Ft_e+svv)-OQy^nXN`@Gw&YUoywaL6189$J;;)bHrxFRfEbOQ-s}!9+W~ zkfoi3%8w&co-H%|Vt>CHnduj2Nwg)p?DzGJP+Y0fp#`+7xzl-*Q{IV%y-s_Sw5?P@ z@%{f+a^z5%?i)`zVd57gj+XMi(w&_~kEvmL-|2k%3G1NvJyx0)d-!WCot$1iefkV? zW6qPZ(i8Fz&Es{*lqswtxg1TowjIxnxx(>iTPV!;^XNHJI}s+GkqvoGcRsCS8-moR zamEDg^Bl5TIHfYmYY zZ+Jg?UZD9~VDx!2e=zfDO7*w-JK#sW@&@tesv%XXZAg_PpKbq5LyZ1HU;Z)h4J@C> ze0G-og{M}jlTY<<&*yxwV&?h2ya{aSseSAJ=BdVg4zIA~zXkrPC7&HWrwpx9Lx;K? z{=2}IzaDJe(7xTj6Kt2o=Va;s9oS)u7iRHuPpeX6PV>0W^O*@&ahe-G(_B&hw1LIF z+@t?-ul*Z@9<)Q%*|S_?hCriHdA5P!TJBUIKef%kw3cc;lcIzxgAPzD7#;l_(wm zb6q|Itd99mHA(X_i?0UT$ove1O>X#o1#F+zKUvFfv%=@(QB`W>C`n&aRIdNmfc1=$ z^fT3mKLoaYl=zRv2xo(DTHw0xmtaRnN%%|pFDfjnbNQ^ZkUq{5PI;fgugT(fg6&{F zTG6~Ch5sgt{~YX{v&4RMH`smKE&okDyGk{jE%7^@pA@Mb7T*B2jrj;QL-S0NtN(jo z2bd35AJY1FTJooju2Q2%6Ca>vDsg|!rLO!Uuw|pgeY3RuE=ztR*w)dKerBuO@ckax z0nO)V{ktvsA?H-75$6!^&lT4+lmd~HzwmN75l@JIN0%AcpfcAX>cmzpq;PyaWr z_#xNpbb ze7IG9%mZ7-{B%{PBz+FI;{W=9+y1E+c~AJ>3cf|l>-ym$WqsZ!`^N}hq^NQ!PfhjwSg)>I$XHFDravV41NJ|4aBuk*cxkuWev^#!CEOsl3^Jr?{fUU1oE$1?!Ou=!u%vf z>rlx3uUY(Vux;Zcd|EUwu=2-G!HzILLxnXjvf`)Y0@P0z5IHi{0pVarwE?+`mnTy1I z*J=IRtoYjswww6~)v5I#wA^WX|NCGE zgOa~*P~yM$Ek3pc?bj0V-;G+n$!gzS4Hjp9in>XO|J8l2{8M0iOC)`*)4agqe+Mg^ zBB=L8%lJ@mri!YyK%D4XN7A58TP>Z*Nubm|R>(Tmatnl9nwny84 zs}lbYx5DoiV23A3_}-?Z{g|=p?<-4DewB**Zdc;IO_uxyu&t$%zSnE}cUk4vkH8L; zO8kC|pA@NGR{lR_GV;%43Ew-k{BX;E)nH2}i~sIquGC12Zw1@Q{A9I3iT}#1^64Ph zQ7!**euDI6<)88?C_kqN|AglDr^n%^sk?-a9c|hF0NBncl0P>pvETmu1neEH|89}@ z@TpS`KTX{ud~CqdKNo!2RN}+by-M1BwaSO*!SM~q{d3_ZRjT|F(Z7|S6scm%fA@p!xJ1f_$CboS zfo1<8u)~*#|3B%czZ~U5x!C`N%Jtt$u(iyGsBQcN@n_|)r@{7=OZt0K~OiH zzfWoTGRu9Vr^A2KiJzsO(tNlTziYv6oi6ETyXF;DE`I`S_jIxUY0W2E;qxP~Urm?% z|7p!jEuKFE@i#;K_ZgMz{>#B4GsOKnw0xN*|8cM_GerM0nwML=7wnB0;=X4!pK0-T z!3KXw_-B>WpZ2F3td2SQrApjaVaaE}Hhf6(=X08GveNI1V6S~h{P(=pUuLDhyJn(( zn<@JJ#^=6AjJY$u>v7m@&XM%&OrB zm45;JRc-&vTK=Hbe|-Bm_8$Q+tdQ^{UYHd`4HZUyuzE%1hVQiwAEmynSh&LGYrr?L z{xj99KJqVuy{7H|4nHZ*>z(iVzpxVRk4h;&zMI9#ECx$eO8NJ_EZz@hGuSTXBh_nJ zoYLQK!46kS`ux6<_KW=)T!s3#O6>muKSBDn+Anv3?O=Yk`WLN#o7KPh1DL9o_}#DN z=UeIbe6UjHgVYaIZu(pgwn_8XefWN`1DgNHhmWj*{u<(^oA~v_{~cgkYQ%j%<|l!? zBFlf@2Rm3J{{IO-DbB02+<#sz>YrNTXQ-cQ-eiprtpwY^e6)H~^CMRM^(NT+%+FCj z)4a@Tzs{eF_SIam|1BeL@lS#6oGaz)&sA>xeP^y)z8(RDc^9m30r4T~kjf38`C!WyNdEhc%GJLXY@_DC zen0*W*!!1C z`1|p(m!W-jnS}3Qeo~yb$*R9sfUUhu@G?oCf6~0y zYJUx{L;Y7L_8-xFla>A(!P@IY{?D2hSo!C1uw9z}#mHOj$3K7-)Qf&U|4#s`VLsfK zr@?yaC4Ic7_3yI!r#ry*)QkWB%1;6&X~}0H+FuK+l+}LmiEP;YDJa`}zN>%hA8PocKu9pXCF}{=7o$ za*6)|dAa%fC|JQ_aetwY|1JcpSSppSejSbVX>-ym_nYO>;Q6WA8!{e9iPAM60k z$$5j+U?2NWX+-_rNPMt5Mf{gH+#27g16$5~s2buU-vhQ;^Ha6_ek=X{39O(=;%BJl zHCF$p46Ii3({%hSwfwiN$FYZ14Js=!G?<^nxA6a6;=TvpJ4?pS3DmCm%l0R9E*5O-VjbBUzn|Y;_Ka_r^ zWwrnB2itk2`2Soj-($6Je+l+J^E1?WKJG7HTBYVM75xF9^z+10H-5+XxPLeJ3ri*a zkM)uNu_Hf7o$r%B-v&RrRKl-FyZ@loemVcDDmC#c;sbp1PX??9W?bIMzUB9`V7<)! z+jj#$T&0R&F3daASN=+{_79W&gVlKLzFk)R_Gz%)AC~gtBA@X26PUVM;&+0N|1Sos zV?Inx)cW^Z?W0v-Jy(l^XCz({}%&Wca6BOO!Fpd{QPOKoy<>C z7whmTv+Dl?U`Mq4G|ii=_RD40qW^v^@qy|R&Fif4;d!t<%nMby=F6?}rLeh54R01c zUGoM@{z|a+X7S$)pZLEWY;&`upAY46`_J=v32eWXpP5JFcS=Pp`v)wC{maGuvvl}m ztn^U{wsg7pf3|jCk(EBzfo)+vO3g9p%W8l1E_eIS6+Z6Y@9<%&lDRjBA9DCfs>&yQ z|H0w?Rkd(W`TFj1w|uDavAmwfli!<-9=IQV&veMse zV4Fiy{>?YxXQkhtfW5=~RJFixt9}Z$!2T8q|4V)BzYc68^Rv`tKKyH7`&-2Ry1d-- zb4nQHbC~$)s@_Mw6YRFI*uPNwZ@85|wu0?pex_Qad9PKz{tWCe^P#@w!-pa$pCaNu z%{}Gs?O4zW0Jo@n)h1m_vgX(#U%V&G%v8y*Qgb!Usn(>RAJ4RTIJ^=u;nWxd?K1Jv-r(m zn^s8pM>St=@o$42SRwYen((v2|H74MKdqGX*=GD_$%nu)E8Y0X4!>u>_N)~D$F%-- zOa67RgUtQMN6v_&{Sue>U8&{cR{FaJteg1=71umv@$F!{<6^&G`uiJLL5IX&Li;ac z$zKFk-XZQw3Rm40zYc6ehuELe_V2gy&&$M^pRTUce61xvEa8^loj&E$x!~mqNq_0Q z-1ft#!1g3We@5$HXX*bn*pY;k4_zjIS@rwKB*Hf-@xMy*{Z{$im^AILA!@bgSN10i z-kp^6(XHi&Tj_r**v_Qbzee*O%YAQv9Z7ofmnVJ}q)>vgbqt`q(1wExz_fAp0q>f%o1pH2y%k7jW) z9|7CgDe^aK{Tr(j{pX~};*dAaq+gJ9d!lKyYi_V2RFm*0a8&JZ81 zZqxP`Sm~n&yq=jb!+~#=4O7DOfRvul7Bv}`7SH}jK0C} z)757*KVtF8;PY>g^tnU3f4J4ZNP?}`{29$NR{Xs}>;{RyXLb6tKLc+>|M5o2AD`9s zm)Yxwz~CjM>BrmtDY^;u|4qbCQ=b!gWqyUodN&5Y~mann;H#dN7Sl74x{|;90QAvMaH1TJ-fAU97`W>ux`?zlo zc*95g*1r*K>qo_XU(UK6HSsyIJIQ{qC{i zIk4Vi@V|f++#>noMIZOg1zUEDg#TWhzD)k6&qu*F+#>1cYnt2T*K=UKw@CcHr1@s6 zeElO>L63z0*G>Mk(svnH6Z3Oaud(0Ke-GI99&z6{O!~Llr~APUG9RM8>EpliZ$?mv=jGOa_knF;ev;akms>vc64UbE()Mq${5R${)4n`az2cL8%D|W2MtrRLwwCX) z;{Q3Y-rL0euWDXkm4E$iuTrCLCw`{-j^@2q`B4wnbi26!yLq|eGdF{6zFp$yds=?0 z<^C7IUS)o=dQJ0fcKm@Ate5olea*|P{?!Dq`OME!KQQrY`7a5!e!Zmce-S>W$tqty z2lg8Ck!ru@+pYHHsE?t1{uuF5zU{}YV7osi@#Dvb-%+KC?~wTM%fBnYdhU?$eM7sy z#&X|ouvhPp^!H=qKYM*3*x)-w|4&T%wd$WaU`=;Q`2Ez#TkXT!z_#2e`rq_PzyAt$ zM9cq7%kQ`HN67|+&j#WJ>Mcosd2y?M8U|atLBi+fT0Uj*Ua&*V$EX7)e_6cr<8c4S ziJzx_p?SB(d%(7QT=f5|Nk5kVe*|`z`3Ut(<9^HkBR+xn`2_J()WJMzA9zDxG1zkE zgVo!4RKI!oqhLEU|CNvY@4(*I{MXFUf3@5{>#izQcNg(N>X1+PC&AX;CGqRpn*ew&xuz8SI+`FEq(|2rQ(1FUYN`2QWPe}|R-9t7LHQS#UCHQ#0BuXn+Q z-Ywz#Z<_D4Yw101{rV@7x5ZT}__}+<{eJoLTVMz7k@CZjUvMw#&wC|*{6)JjbGh3-3xln_ z*CRjBaO!A11Gbxae|6Ny|G&N0l4ew;68C5$rokG zw}EvtAENTOXNvZVH9qq2eXjfS^K;$*Eco90Bz^Q_d89u}{%x@LnV-%(PqOQ;ru&h8 z?-&1{r0wsu^4~_Vt<3$`AD#OE%Et#J{SVOg@3Qho6fDJjfGX7bGgkTaNw8fHi2ny_ z`Q4WMTVRJCkn}T1^NbZg!Oe*O&62)P)_k2+{@en#akIqVV9lGX@vF~+?PXr5PBGzU z@q=JTH%s|6MDrt7{V?jmDmC#ziQiK-FR=J>u+)PRzC$(NWBKn1u$>Qz`%csRpcVeV z22&47{u-uvuNA-NfnD^F$e(V)-)i5?2W!%NxCuY2e7X&6EAune8ODAq|GWgY{~<|V zBQ)P@x&NR((Bw((&}pQAM2XUXpd>wQ?AF0lk^mYELmV6ah!xoVrt>w$C^wR~_vqk)Oj^?jf@=t+D`7~IaEBclF z`8@c(EfW9dY5Dz@eBL7npGSxf(lc`iAItv9U^5>P_l+^(V}*b8kt(PCJJ!ekRSrKx zo$tdx4!->niQgh)zm>j!1a?r{KTh*EEcc)FDDwBCB7cGAZ(6()tmjd2--RZBSpA2m zzL(|4lLOv-0=zV7*#?s^-Hj{w`SICq=$2Kezsv4A$^TasS0W{ARGb zKPlle&G_Fce?9}&%Y3-H#Bj_1gP*8UrB4t)PnDbWVYx2^mU%+*&vfHItNryT*p4S8 z|ILu}owwgAAAbmTBrXmp*?Dc9?mAnr+-? z*?-=XDF2_7{5{9V{(7+GPfGk$`0$&+)-yjzRr>Jfz;-_=_E%~94_fK_PhbU~68+Vh zueb6~F<8Z?B>n03i^qT4z;-hqrfTzZ$G83itnew~{ncEpf4^0JT>@6|l(>JMkNd-5 z>zI#J^L6|kvfTd+*q)~({1)Wrjvoxzj{e_v;?DUjp7UX*gVE(k+I zr+?z%-QXX8#?AjqH4Mz4{OYHq|MnEv4(9z-JI7zcz%rDN^p)K34Y1dqk??61o=4os z{}Jr{XT<+)!Yd4?pW~iI`}A4SAGP%N)B0<{>Yo+;F|FUYkA7YQcHOg5KH2Wi*Y@8D zw&__ZA6I6%kJ<`913Suml!|BRC;O*;7VWRkihM_w{7{%A*gEE?s6>`L>3Q; zYv`a}$UF51*ikKS_%@3d?L_-(rg=W0&af$+Eu!<~^|CpO^e$?C-JC zM=jVg=4YtevgFs10o%&_9CdpZrwsbu=S}%^idrv@uGnmaf8iJ4zb}yd2*>^-m%8?M zfvx?5g#R5`@lX062HWukNuPIS+mGL`e!Jem<4M^VO%pcI^@SpUU9{>JZq`J^tkr@zSrN{rFYU|8$Ogp}GxhGxMS9 z(>d{1sGb4a^Hs_JpV8s>j@7?-9qb+Er#tCmlU2Tqcmd_l3wHh+TDZk3pQ^x`UZ_%b z{a3TdmA@Wr6Z7Hfv)X>weM8lE!Crqs{O8EmyYhbo`^O7*_`rP@AN69D8uOyaKQH># zR?B@CgUxwS-2XYvw^@7%*flRo{One_<0ombbuYU9pOf{<+h9jtl>AG)C`-O%Zx#PF z^4a~Ta`2gZN#5Dt?`hvQgSA+kGDVqHzO4mYzt?piou7Bm>c97by}|rchkHI>L;3SH z;{DXuq|ovBZ!%aNb6Fpl-G5sPwvqWTt>63k5!ivR+4&Fdx5kHty@dA5OD@lruL8UD zC5hiXKJIG)>wd|#KRfy&C_s!o1JN$LY|HQM`|DWCq_xJYA=YY*W z25$$;^t$$EyZ;fe?Z@EXCuZr-=Ka2b^79*g^B~yFZ@Bp@+yB+ytWpi%?3;fKY|}Sg z_htL<+hA`TgP-~`!tdq2`RtcX_z(5v4d9WN-T2Su54~*S$6tO2_}-WM=Dz_u`m&q9 zv%_!9KJ-ua+4;-+xdLqYKG%QQ{1&hc``q-OJ-+k}uzk#(^1;L30z0(NjbF-NMb`NL zfNxc)LEm!aDgXD_^F!{9BZ;KG^$)+&Di{x|V2Umgq2s@U-RNphm_UXODG%!NzmqL1 zQ>bX2OlN z^(t5o(<;~J1?i4G&rKKMu=%M(rYRHc&Zs83_TAhQZEmm*b#==XBJTaz=Kg2#gi_wYk7miC`80d)cvG0Qr3lz-! ze^2o81Gy4~;68=LF1I zj&vdlNfDh_+`M?vq9!$oZbev4?Wyd~%=SzsHDl7G)vH&RWFnoRwq&9t5zS2MjE3O_ zvbm+JEnSjoPt8{B8dcm>Qy-ihV2x9!j1T1Mv_C-!>p*;RFdPcEM}u^~@vL!Oxj=4t z%%)Sa!~%*gNVP@jfd7@#@LzDM3h^z_`cJS-tt=1nO;@3gNNcELa;c*Grj^_d8_+k# z1=K8jQ+$mSQu@kr^@%qt)Ml7^nDb$d{!ue~?d_9~V+Q!- zzx={{<^5M(SXEF}h<^py#P8qbg{A6P|Ayz~{`0=Ev7hxX|HS?|()c#ApY<>Q#Qqui ze4h~cANI-1?^keA{{e*q2c10llp&`MJ#EfsFEnze(+S+3)R>tXG*6TXcnXXlSfnl+q}GQe*M}TZoFyTM{mBR=hoY9U;nW??%eS4Pu#Wf?tAXtbl?3CY<}>ehqpZP z=wn+S|Kt}PjA_x$H}ef|qy-2J65e`U{CUwCov*IxR1?>D~r z^1g4q^6gi@^WE>g_Wd9H%l;p}{-Za3{F9%)`Lnlve&84X`pbiF|LWI=e)HSkz4QBj z`@`XX|Kp#I{P{2M9)0hxe|!Hw{{D}D+W(bR)it$q=gnVm>1B2G3l}w9zPPdJiX~Sr zz3Ri_|GxSE75?9Q5cP+T*`)uz3bQxM41L>Q#+ZXX&$4xd;tABrp?Io2q*~BES*gNk zUBy)-))vbszS%~_>9$$Lm%OPIUA%@C8C`+il}h1xx4eo^&E4;Kf4_IQ zLVfjjsFQzNp%(tueg4!Rj<4%@#@6@0!(0i!M76sg{kP-4|6gr}!_GXIn~qkf6)@A^ zuTVX3&(fpvH{0}o_xQ%V+xQpxyY;889cfRvi`Fqx1kN@rmHKF&s zzvtrj6qtocx)*9yEZLQ&J6q{GHoCKnE^MOvo9d$-$<8%+(jMwUUnrt}II2>;4fERB zmFghOu+f$3jp?7SPcea>CXNfVt$q-+vzuyFNJItrg&eieim`b&HY^B;Z zzEW){tyF6!hAt!2JEfN>v5BP9b|Ps8o$zd>bl-Q%5L+9>jtK-w){*SO$fY z@wnXX9BxN%BupJohnXjVaGb7{rVAidQ)h^8?hLeq!Yk8w?pi}n+}m2!6$y4lG!nR) zE||RfTI)$MJy}+4Jy~|W<)%c2`j*L7JY9B!>kV`Pqk(85g7VTlqnpp7d=sUQC-G^Z zn=JXxI>_lOv$J1Yobw3X+GL<5)@HeHJiB#Aqr{#@~?B6G1KFGVq z4%5yz?#S=sx8H}xng?h7HikZhmNCBvYqMIdZc&}8vqfDQie=^|I~$Q+;?YGs6r>s| zo8~K35>9rg>O~6|UC~se&L5+1GHsCi?9{P8o9il79A+=fvbmLNcP;WGOcTsIH8PJ; z677zvl9o^gHgzBY7hF=UA}}$S1Wdn6`c4Dv^rid}zl7sSzVkR0OGRl&ArMQ@rMq+& zt4gNm&gE!FD#@3o@-yeXP@L{!ULzOjMl(^`+us$B@RfUExx3XzG+U>>KnxdT@u>@Vv=;L}x^S>&uR=+QoIiq*+_wO(x@O{|yYIPP2rRTBu zJ06Dm!L#vqF3hR;eii!#V-sQyoh58Q~NWChXLVfEqL|JuZz1rzq)= z3N{p{ySy`$0LR6<0xfGYQF>WXD&@?Sigq`*MKjGb_KB*xHAHs|gLfq&$uJKaBEls` z&qu@{eGl^3K*~C@D)T{o`c5g=Xa1kQyKjAWY}`JQ8LRXRSIY3Nel`geR%@(n5)F<` z3a@FSVMBc*a*)P-OTtQ(1}?ZDFt(a&7|i>{JOmGv#E&}r^XCaFLulk6Bv z?#Ii)*)%v9m^CXvf0M1n&CS}PW)T_B`hB#pTt_U;_1M^KcZ4F5V_MChAl|53P*r`^ zy!r(T=LKu$2b*f@CkGoZt-CZhuWA0`AU(cv>Xbes;QxRAul}?z@8^8q)7DQN3iVUF ztY?SutgNM3uyfLR}Lbw7&l+hLxE*#pxH^Ie$NVcvo{WWD=Ge9w>eQ^R1!!j!^P z!PLPlfmsf-0wx1o+w#QQTU2d#EMr=tJJsA+LM!^2nitK`*M+D=@aB{}{HB+ylM%P+I)|Rl z?TW`6LYa2`=H>LPo+kjs6?hh>XCwuOcCzHX^rVsJ6`Nv^OOq4nn|hQ;6B-Vr6SB|I z?=hr^(ubQd7i-zBs zs<|~n%|V19H84`Kh?=3A`N?e6j5cXBu}W2_W@_ZBMT#3B>T>$q8R<%?7S-I9pxIq@ zp=u@t9U-*JI@{8!6u&!Kn!{b4%^jg`rDo!Hs<|2JVx8pf+48%Uu1crXW6jNJv~NPG zRC8tx+Q;e|)f|$(cM{*y>1bz0t%19v-88y)v*Ux!su}H`L{h0Q!Y}c3OINFUh5gc; zOt(s~DD@lF980z+^*j7chsB0#^O}?R8#U9f%M+jXFU&vO_Uw*ebzcn3=u2i-8t(j;%uIA;pu0|^w?_8D- zr4(VRGrvQ-Vs$>+eeBjX^o_2aS2yKr%hb*Jung()*8J}e=SsDWzOkZD(Kr03)UNzYQbv8hoWIHhlqyoyXkXRQ^Qx}aR_PQ{efm$D z%W4-dtgV|mr6dxktMSxuJUgE0NUsWaW<;VGzyGHh+y681`-;Ze#cl}x&-?r@y{D*Vs?obZ3Z#h(liD*AnSNu@ab z%S&cG^t<`#k3ad?gHPW3Nc#QvKKkfma{7G_q(7-Vn*O^-(+h5znf}OQa~~L+l$1D} zmodX82-C#`VN2Pmsd~Asf@JJ38m<*&Q4oeh>&}O|&Vz(x_+JVzY#lxuSi2Eo(lbA9 zq?a+vjMOhdNN2eCCz+un3vvJMF$$J`!vF98#>x*Ykl}ake33N>`x@;8`*)8p{+_XO z@0IU`XKNpU_1z4=3&b9HR^cB1*e4m{J(;cWk$ zSl;hgc|;qak&p<#!+PRdh4KEg<^O;G{_pwcP=9nC9IO_d&}`<6-Kug*6EZqAA?Ia5 z@IRfOyFSd%p$3$^%c$Kc0YDX@1_@Cm4-+-%DifCO__4h3v2 zwe&uCZInFaP>!p+Rlb-I5WO6eH0yZPG(0#Caxz?3w_m=ZH_i;i=?^&Jq|*3*!NZSY zKCDSi4*vcjXntFJFb{r%pJNJ^VJ_F(S56IwlBSjdRW=9z0x0Ux;lW#g%8V>=RVE|i zvPbo1g{(lkQks8eAOX@flKMC#1S?NNg0JH8=={WVLo9t+e7crY2{84?qR96?`Eq<; zroUr<*!&KvKz}VM8+zs0B4^;}tjHCDpF;m{0m@z)fL0~}1Y7v8$8gBZ0PY8Pm?hG% zWi!de@K0FYmd(*}eKrfy1J+KopDw=@OYuJ<3R^bML%i8AA(DNHMN6af&DQezTq2(t ztF>aaK(hBC1I&88ECek?(465WXa;iM;3;@_)g<3}7qo!QvlO8DqDN?0pw88|ic~Dm zW5X^k1R}d?Qtsq!fjkB3W}mG|ufzN>tQr4;Wa(quuFHgWLC8U|E}LC71(XMI>i>W^ z&m1gwTWKQxpf*#v;az%}CM~TQ`sCRy5A;1HXvW~nkgVNl^6XZQ1`;p{|J?y4{@3() z2VO=gU_+GiPI;j0RZa%uj|Mxq%>Jo>NW+oq~Xb8+pan)31m=d~YG^>Q;JHj#3qFNJNfNLKOJe3WB{4h>=r=WUn>@mqIacX}hhb{n$cB}O zn5!n40W*+b$z$VrH_XF80>U1He)fdBstv5l&`hY1=E_T4OIZeMhX zGyD9plKaodS}g;Br+IS?x!C}D5g>V)+ZP`$uZQ9Dr3}tYZGZ>q`Hzq}1=MdlRvFVU zNu|HO{DjN|M0oP4fN|^t3m%|swN?|X>jZ6L9lT_=OK#wHz{Q$zLNpw2yrf|zVrfY= z_?OC8H;?>6-8u5>%#({RQ>)cf%&4}zYKGo<7f=WK;k<5)e2BzMXb8>^H5H2pe}mH# zL?Q|WKLCPj?}XJ&O$+^j@Yvj>v@%Ge_Jyv7Bxh0(9u1+nz3HuP_vMK=U!BuL-sM`; zU_oz840n!dTdUgFl&523Z4Fw|aD1?DaD%W}4E#4>tHa?9*lO5M1^(39cEkU#;kA`P ziBp!+&}zjE8GahwnkLoHD~8)$91$byRdW$`b(M8H}0j6`E29MX@(Wt7dDfH5mYILHVr}x2oC0 zBMvNRAu%M${VNXM)qL);_DxmoZGhUbN-b`27Vj1mw^rPuDGi#vsbdve+$JbnP2ojl zK+{|&43cLKbqY{7Xm&rKo>8mh{wD$|E#;ooX4b+Exc85UD^Pzzdr2(Xjza z4|Y8WkG9oXQ4R7^&0fQ?zi03)TPr}RbcBAvpst!ZG?HG&ZlF%+I~0$ay;4(ZkiR27z zKN)7GtyOcZ4juXxDO%%+NN$rz(@PA$VzgC;o3ykwOvVhxMe;c3;XCJ{aFRUESfyIp z+Or`3izEK~j4A9Yt`p?*I6Kmc>-dbQpiz+AL!d>`#2TJh*=yd1`U4hJXQpzY+Jy&M zwVQ6luGQ&DG?Un{zey<#dI}B&O*5JZC6u@!G(Lirhm5DsUi!U+Ruj64%NSb6*(%8Q z9bShS+Xj>7rTzR9JY*Y>=PPk_N+*xb^t9OSY=1 zh^VER@GrGN-7#{H`t``YnWqb9OBBnG!mu&Y7mY?!LN0kMje z7oAC0TG1QyuV&YLns9)#dxibbD3T=rf-J<(dj)}-K_4=sk@gZ zh?X-0b)|?hAaodNg7v@H;)%%jX5N&n9Mk$@$vE}xZNUrX; zm?d{Y32I-cL%k{4H`%04HbXv|N|Q|}y34V#>ST*bt&TRsgT(UPC`#)J#ZI^2zcOF2 zO73})*i=Mj2Tj3N?!19o8FD~!WqMgI8j1mRhQ$>etaj&2Da{p>!+``W{~mbWgnvSZ z7(a^2Dy`V!DmELGIpuCLc@|C0=nN;87G_Sw_eEL0p}2SjW10-Fnh{jdHthm5N0Enp zbsrK^Y1Agu>w~Ba8+q2npJ(`Wc?WH`92-W<$owSgEifA@67mFHUEBBzm!G6VqDlv) zU5KUC0(%GZ;R;>ZRc~bxwg`p>gb4p1D$rCjr zDV!6A2QOgFKEM@wmi|sG{rJ5sJ^VqmuF5>Dt0h`j3$2H!T>yF}U@pPF?1RkkT!GI! z;F((}>DZ-p@Sfq1%752Et6Ce!BGkI$4ZbN6Kz6mZ2aAh9vo08Z0X(aLj#b{9BF?UH zazAI+9NARcciiOKzGHniiM7DSK{#7TVUs6-ekPCeIhynlT7Ea#8gt`p4XYqXWqxU$ z-}k@?9GudTRj#f+a)zrbQTg2WxVY(OX!-}nj<=MLy)#T$Y65C~@A@83*c5`K_2`ib zTjrG_Zb-+~=9OmXCC1IK(V7Cfxy8A_Bq(>%LxLbrf(LDIPu_TQM9a7MEXkQSBtJO~ zX7RR;RpLz0?k%;}1OaCfTW#84L<2@QGx_PPS|LlFX$gM-^})<<555g^8^&!}484@- zFqBryw>QHO=38LFgx@ID`4KKvKTCj8!~cx&^KDvcD-Jhsf$FM#CZnTG8=@Aqy1GQ^ zg^egX?l6O-@@&ROrPVvkdGb~{Ra*Kdcz2$hCnq{jJ|cOR!dodQ50gR3*>prFo~E>P zye0jqN_xe%dy*Xr*#khJrk2!(tn;hlJJjP<2TaD|HqF+GhL5dHb+m>h=x3oTkevCI z#ljrvv9evqVX+Jx(z*WDx!scJQ8N}I1>e0pgvq_5J( zyZp(Jq8y20*bUUDBhu1)QQA|VoD0N9m7sHh;W1^ObAfS; z(!$I?&DKI|6x1f@>WsUns}58dl~3ZT4E=`df32aUNK9sAdy~~#rbFyPo7LH!F1b(R zcy;%a+`rJnC5oxE(0e{4$tM6TcR0JjqWO~2MoVrK$7)B|RGRM{B(1BKK4vWX9ngLS zCG6}TBky;1kCMN4cIU_~kVD=H`Q=7uw^ja9Z64VUBkAnEQZa{y0R5qixO$3r3CbPi zNFvb6fDhlO<>36w@T*FTTGXU&F4e99MVlGBEjp_zC?Zxhh&1SaknYUxBPgcY$rdpm z$eLBus?=#kP2NH7M&&nZvp%xWMIeGms*dk2(K}mI_k<3@^2tX`d51SYlD$w4XJ0NK z$eyGG)aG!%d8JlwGNfJa?9P&No!!N9wzK;(N^UxW$s6fjZjrR5KaNl{Q`I);GU7acKH7UQ4cfqum6g$X(+HPxb=o~gzT9t3s ziaK{dzTuC_@t92HnuOd>7ht8@L~_J*N*=U#k$Vhg+6>OO;4Rr8s;XDcLTmQ6!7y+_ zo}exmT;7Ji`KCa=1!d^Q2q~885vI@HknEc_RK3Bhx_B)9_zV@N7F6iG*gex$io7g_cUKZa0JaMvfiPurLhhBn$%M!$>e?&->XL+^;rh7?DJP4jks>C+M2;= z5B9l1SD`gWlV)oUJFzH}5Y@8*FZlg5R9y(k)*M3K3-dl=YjN3HlQnxwCb4B{sb+|F zThzOKJHTp%^hg52Lrt(6)m=Re8lP!MCNou@Z$evU=UHqS9pNjqEsZ0n5-S@O60sm3 zwONyZtGA&$>ORK16VY7885}nX7l||q=_7iL0xWZF{QpeilG_QH|7+vc%#B;XinC=yE#0gkDRB*1J6UhYdneCq z<}15YPVKg6E+vRHYaBu zU35j}b7rMOT?k@}Oc3s{a`=Pu987BYm8P{~*nkT5F~%5k9>>m{0O4l=c`TJxOY0iN z?IfXr+vLp^v$G`kaGq@_{9-Y`!|dC_1Ll>YD;y!W0wfpe z$WnerhqhX+&bD|dFLGa3Z8Bu{;Km_oJ)p%H){4dil~w6{sVf8w*P4RRP0kePH^%_ikJ4f3_PwnWqbIvY_IO#>5eF7!Vm67COc za57Y%xwrV1%-Kl#SwQ+eOkrptg~1;T&y12@OU3b18?X*rvv#9NHETCo)G6kGm7)g% zRub=dD&a+JZK1oNQ_%C!U|c@iG8#h$l#-1h++{1r4yrcjM+5c4)|6>$kbFDQ2bXpa zh1r-Ze}}U4)GY+JI*Z%V-XO&ju{DIIGad$MP*u2$@_&ap<(?P>NpT2Z&X8O_J(pfyfWzX)4M z=N>0p;N8rWU*)j6Yvk5o^(ivk7CW=XDHG5eG*iUfkEvBKoj=woM*LI#BBL?<6?PB0 zaszfH?MI+o+z=(ubg|bPlaONCh3a5!s_9)ig*jgKUHvp0p#i!k3FF6VT$wtPu0 zvfU-bSW0oSZjmQewHinZ$EA8K*#9a~ScyrR1>RL{9EvLFxoVBhuG9c>;y{_f4x}H5pUEOgRdel`$b(K+F%g$QY)tGge zURPPHt^wz$YiV2tsw<|uZ&yK6O7deFH;Y-R8{k2nU0#W}N}D>NL`}uCfC;yHgiQ~Z zb91@lEv1i|I>ky39pqu2PWgO|JfXDjN|}cTKl>TCUAf)wGo7~*%dgsJMA1!^AWNA$ z9$H5=>g@=-VtjkEx)WVg7=J@Ka(#1i;p~|fvP>r>79epC)Nrl7a$g^aJI~Xj{r zcK{AwHm~Ed+5bJuBmIXwm+y;;f6DXW_wn{vwq~OpnWgg#xD8~{&Ql#N-oz67F63Tg z2-xDiMJ#db2IEk2-zK6JeVydK2_8NnP05BzqmbDkd5+S?5-3s@-}Dj_PLzQ?c20fI zM7VL>24r3OA)=>|f!xW}`0zmTkAO&3+7@M@Qa%u6Dh@x$RT%rhHxkclQM+OK4myM^ zNB&wHBz8lydA`MU=nE-o!99r2iTzr%878$k*bMAht#uVQ86>wP_Uf)TPb{(Rrp8Je zZM&*k&C*84?tTq9Lbf2V4c0}!&B?wFUp|JHoE&<50Uxg;ly?Op7S}S({{UJSwj!-_ zvM&J@qB!R|_))&|bS}6XnpRc?+<10rM$}O=uhdz*>k`S04zN!W7-7i~@(tJj?A{{3hhqSJEAX22!b?4!&xFDy^Wb;E62J;K z!$b4&ZQ%~oWse{Py|miRW}p))c4}468m&m3&^~BNMtsHF*nWHqPORJavdMUTugSP5 zZZiIPFX2}p{>Z&?doRdaG{vlL)=+aFob|Y+xF7D#XFhIOoanpFq*+ZK+>U3C^Wg0( z(6Z{eEe{$*))dnsqdEoYkIEoA4K|NP|9Y#M3=~mknAOKEnj=}Ak*p0uC$LdxHgS7E zt>`ZN0{w!sV3GiR%H1?)Tgpq2+Y~rY!YKPp&x2M28tjXopvkluirca2CK&Ve2FC4D zfyc!IBzKW0^a>=%vbW722F)H>2Qyu)(mR)Z12Z3?<$^1ml3CR9)C$ef93Ba6L4w}= z54MT5d>T`4n&byuKY!`g=!#dE_EGF$vpk^B&{!&cGSu@e}ZXLxAMJO+zi@EoSzd2CB29n zOrTCN{}f|;6L2ZMw;N`j4VSSHm#g$lP~0AdLQyZo<$=Q|kg>@2B=mTl?{`Pzb%G;X zphm^ab`(O=R6V8!+rB?~c(OY9|kv8Tl*{KpW&WfNnfEdybp}`f(o&43ZPI zd=pD1`x=Req+dckRrYDdaCMLJ#52lEhVm>>UJ%Pu_RZ^2P5~>Y9?IDo(^G2IFT6H$ ziET3#@EjEIbhJT_bZ!=vIRRS@?lQu914|QTdrw(}7 zo@o_8R^Id-&VlLrT7j}(hDi|q2RyreI8AE{HzYR%UoT|iyFu;?w5&(@0DYK|B?{q9 z@#C7BLM~j%jk_fph2i+}#4L&e;(OjOI4tz1R&wtY{`=6MTlCPM^7K41Drc)5TGCLo z1X2g1cHbO)=ojdB4uU)pc|bXBY^I(-K0UNFkdVS7s$#J^EKaCLsT3QF3uQeG)KRup z?nM5v8R}db_Hus9JqHv!blWvztg{q?1ag~45T!+8{)30Lqzcl-CC{lo*z?i3j9R1n zFgJw2qh*=uoLrfLmG40VG8G}n|L+7;)lfc~tG!=l;$CV-q;#_L+R=)6Ua1v+{8T_QZI4Duxaz1YNB!BCasdb`-v}de=elVNMo^tTOQ}{==bM!k@ulFl-&1I2 z4Y9gHCf84+I+8484Y z+#kQ#YjpdS%R~80_sJeEUy5>H+DPj62Y`}~7?S%^^ch_$o3iI9yAT6PnFECdmjX(- zzE%*dq0PTy{Aa0^#ee#Zu+Xu)=&4DqXHO*2zeq+O5l#{JW|*WIyS3uV@Zi!+dG86? zjG}i4l$ljjC;3$D*sQ%K?W+6?Kc-7%{%x&3dmHFZ7`4QrGq|Y+#aqyilF^8H%c}b| zF!xYB)_L+G@)7@44QTc@T&ABH*mQoSDH7S%N`@y}Mq+nnL-7Eh#kSVWhK1eCBxUw> z)Fj<@Ne`1$wbzASK83u2Q|3~njGPN16~?tM+LZHw&%mg|63i^BmlvL6T;9NOnUG82 zw$a$y(eMtLif@e$xJM!vay>?`&Dmz65RZS9>S4QoMST&d=!SLU+Dxg+57D}rUZPzMC^V8UC9!N2O-k#ie!LN*F79MX;#> zO0`#nmvIhJ&p8sUl9xX2jzlU^84QKsDWj9NeS>SRV*yXe7$vv45egs%;VZQA!fAvL z0ahq*5>gGJzjvWhOgu4Ea*|B5UTkanacoDWb~Bh?a*}Fb%?K^;#{A*Kkl{m|qK-z& zT#wIF+4Dc}Ij51?gqQd4X%nt8#cV>)Hiol&U{9PiaX9yGW6c=)t*do0#l*n!#Z0Z2 z=cC`o%zGH5^|DQu!+$)u9QlB4nd(@j+Dp}HuOMx#13fd#cZaAct2~|ZG#22DVRuY( z!KGJXX8HotB#;_jqq>W-DxYgQ!A+f!2#qI-rE!2cg$a9Y!tyashUWO(s3wR0tsEm-|MPHLiH=c1(GOPwfFCC{_i+yn%(8dIWm|EKmal15uL zjP}>0b^ge3&-6EQg&uotr2EYo6YG0u6|T5L$0*9Q8~3`FS(({~%pNNz zN$VOq-REJ1$r3psKl~HOgk7T?D{!(HB~(IiilXb5v+{*WDA{Xrnbdz38lV=HsoTS# zu0554pyvRTd6!9PSBZJ7ARbFw`X?umCbkoJnk%A6Zm>H9SHvN?ufvJj=!*Ovq+n)) zvQFKl6_pXnorLmx$$bk>Is0;08(?NF$I{+}(zL?l5b|3f!D<|v2kQCQpa$^Oc`&a> zO72?xEt1?D;TIZe&K@cE&n}|92RcH5-PI<};ChToJz5SVQj1rpJE>n5On3zQwJ2F( zf@6-}smocXpvB9z;uX*}ZM-XTh2#$O?|l@apkEq_pnksvAu@gV#jfw$RePCwRITGQ zR(EXLxhl5G{$yJry;60peTC$Cy+1CLF|}5)pw?=*yVh#F+vPX8stu46XF#}y)Yg!n zcF%!!0Uj>;8g8xz?;e7hc{z@mT9~5J;Axbk&IakV9H&LHMD$e$5ZRwg;v@59683^d z#;+EdS(o3xfI?AFS?X!?O+6~4(ABPBOYAaQ&#ieuc_w67o+6{rW#Tq_E- zrt5UI1Vd4RmuyAPj-af~@I!H5ql73fMgH|KSP>aph=Q7}G)Yxn#}ez=ix6bw!7fhH_e#Q z7)D(#J6%rpO%<~*ll$d?Ar3i|gL#^5#gt(8myyWID}Yu+6*F&ac|jSp<*hEpaQbz# z*fhQ3eO(+Y8?l@m>xVAh9Q6yp*@$mxcxI^gk(y<+;_=WA3nLfPdh+Y=C*{d#`&#K- z#Iq7oGovwhA*;r%AQOI?Bzf~(pcwbL)!N$N|Br&t-i)ILQ` zX^**4TKedTNF@787U-zj$~4E4k=3eWd4?a9x1tgZD`$as;$H0nTy)bh-fjhVsqsbo z)kN}h(2Fumvy}mp>8IJ3II|N4Wq|7@vxx$OY6}KiMA})Hh_x?%ODihz8bgPU^AVqd zBfj)F8;SwIA3_J=rIga9W7?BE?I;L|P(w6r7N*VSX&+)*1*Vm+A@xAMP9Lb3a1D$- z9=~ML>5Y;JJt*}^7Exu(S(Qt!k!U%~F=>BiJYsWatQP2iTWyw zw50JQs^pn^*>57cw@2oMab;u1;2%&w8P9Zc3r`8o?vZCoC(YsaX%4qkvZ>rRHkHMm zQ+YimLEZwK%8zfwye)pnRDJ~joY#UTZi30WJ_-4>z13%H=3IrA0ne5R*+LUe;kGeu zi-P=Jdig2b<0z-yPt!8JrE7kPZ|UFREk832vn>85bPPFX+H$58E=^?lSM<#PaF6_V zvHZ(f{^pZ>E?tXrBJUSAC;kr5(28Gh?;5mkhp&psCvFR!2N$9V@!7pFS-g@|JC|w z&j+zTH`ahXf^tgNg`GJEQ5%!oQeU+8=vV@*+pT1+fW4MX=2IHNrKQaPEf3;yZP#X) zJdJXKbJCUaciIedRw^<+r4gy43Bmc_bHv($@fI=sDG_Z35-sT%BbpD23jN_&RALx( zYE|{6u(Pp`xkxS=;^=fcN{xx5xq5O#cl6X!?8Hwm(u-hvF`_dWEbiixXyO&Tl<&LF zEQLbESOGYzS(q3bwV0Gx*1_k(ZP=~fcCc=}0>y>OI&dzK_DlHL&q*FnBFfYi)?ibT zK+&A+jAhXA6Sp+*)TOn9ojf5mfbS7-!=vE&Q>btheuY{&RDWRyIv|&DHhVqxVs~kI zY0tU5;%NL_e&s05*xdHB%0&~)keq59q4qK z;wG8p6Eafs0seM7n@nnZa7sHHvj>6ch2CQLnz9^> z^lQ9{&aQO%a%WdR`4VSWjy%-aRV-iN-Xag;8hVM@nisn080D!IK!X=SgEx2+0i_>T z|HHd$ndSttKG<@Y>1fxtlhO*d5>|Q?=Oi*)v4IqAm!CM{$0MV9Fr}hnt(-V-0ja}W zqnHc!Ay@lnMHLQKTsy@@qy31*)|&bV>O@rUwIn>Z&b4Z8V&{yBDJIOsmfT^WJv!0; zW+6+1+^87Cjjy~79?C3?A^)A~c?jS3;pR6Lftj1|jS}3vc;GBJsZy~~c~olfWHkm! zknO?XY>irynUyhr1dneZp8)H3!7wP7xlrL9nL3d3m zb#`ANUr^{hA3%eg-6NI5=!PEx?VK78<%ah|o322Wc;ZG>74Tky-ZJGgTuT#iHiSk4 z@9^0wcwc^xO!m(s$@l453DZ{k*!D@>F);T_hkHcn68^R;8UFmkQ6_8DYieO}@Q*5B z>ORcGq46BNmUABC&u6%Uf;SC~bB0Xmj&8P7;#GQLXe3b9`7Dla5=ND5#}UpmK$-6! zWP(ET1GrCUfBTtL9K0y5iln1GdPxXh=m?=pPV{WR2ho&oJDGP8`$pQb?iI(Qz=)3I zy5&4N@@Z?~bAh%~L$$y3EObt^&>N5TOv$?lR{*LIEPe0sp6QoTIw}WjDuyD6aCBsK zaLFd*(<{o;6Y|J=G!FXrDZYdUl)5&X(O1vr5rve&lD~K)42I}V*K&YztMjJ81({^B9MT^B{E`P z0YAZK`{`R8Flr+W6d70Yi^z8{iPiZTTZ+syq2x$qno60P#P(7MEk$QdldnK$^%9lo zA@&kA37e}q+$uF!vpZF`{Aq;8*Y%N#ZVC_kA!B-a--mA3xDT57~bv_w_^Q?s{r{yaj(M1dGWE zdRb^;JK=&_!|m759Y+Yl+(Z?y>U>WcVv^xHvq)pqTR5O?3QZa{LKhrH$MSgr!`R1a z^9;z+_J;u-nm;7gd@0&|RH~fNBeD=Z9R3mAC~blJg*-M1(4Ys#d{R-l=WD`mT()dv;Z^Qvp!aA)OYh0q8F~`v4(iI z_Wy%}Hjr=yf1&}tIEahpSn#pE$U~0BoyAQKz7&a9PJcNN=W$0zvqo0D&(von{#r3e z9cOMU7pVREz$B-aqgDG%zLaDZvR?JQ$(LYyHdg*m-4JtGZcJTEc_XZ6lAUd%@V5h}CHJwvJWmN#B#^Xz3G% z2d^EDE=xQ|&ZESF*8xPcwFd7y9Wx8#;zyA3w$@m@zvRIUZrl>Yt$xjFVnL!TOl&;p zfD21w!#Zp~b{gjd`WMRpg_~N@Yg2p$15N|w9-gLd_L}j`^?i8ex@Zb07s`QJqwWU- zt+VmRNTk*{R(Dolp}~y+!?QV>qfNWY)2Vo3Rj-63{jgbWL9#`R#hAp(Tm(qrf5zS) z#rJ<@Y^lT$yx=`?MQEmE-K?65G4MJ`Lfxl(objKd+UoJ(Ym-oGYXPNa1I;U&pXQaV z5&j3@f2~+++b($fWT(rf?0$-|Fx-)SiR9iRG9OA9&&6V5S9U-77rf?Y9i(KBmfUrO z(Tdx<9pOIgYycQV(#K_F75#A^9gh7edyKq4dz8E{J4fD=JzCxcw$qMmtK67BQ6^E(nM4^*`%C@}cEdu+y&3Spj@jibZW5Fx zXK_GKzM|s{b?z-n4W3F+HfHXTKatio!r~a&p%&p;GY=jp3)q@zR+EEJb+mdK7tQ67 z#eTK8PCc&HqAf9qpS>kniqTGMgLRj%Xs5NxWtzRkvxT3(H3&+o=4ghYd%ub#OW)f3 zB$3A^XDO`)DO_#SaM->biIKHtTDn9R z)xIY9&vZ^2&AvwRV7LdmMx`?UBwL$2+}l?z+Mp`_(6y-H!Qe=qq40!##A6sCy!*@B zH)D5b7(BQjebHp{{0x{^ioTyLI?GvnIjsY+-MJu1gmr06!b<>}gF8-wksQTZxXarY z$qR+yVPYT=4Co2{_8yuJ73!{$M^#5tz(#H;S8;_P8&yXo4>zy#_+diuy8xQGgIu#U zYsnhL$;I_Nxb9+oM*K#zRghEI)%s@=z)_;JxEA_#y@=Nd!3uvI8T!RI>-%PBG4gmF z+s%$fT4GINZ_XDGb*>kx2i#IumnfHdlS5DA^hir! zRt#N@2Lh^L;v73m4kCgke1@1RvyR<@^xS#2#Dk?QYR!| zA#xu_n^B)){A7#f@YC)r0Ptu{@QyT+!8I6=-X5Iw8L^gic+A1pY&4^1qA8fS7oiJA z>at_&3Dm}Q{U=;P8c-S`N$OWXsfdG<$X{rE0ro2lBL)6by{S*WEK#n5i>nvCcP5|I(@b=RhvKo|CsB(EOBpbh^v=8wzx<2!p zljwHUXs?6z(9wFBi-pu8>K%Yu3&sILX9Khl%PGe^w$+~9@-=jEM20V4)as~DieoZU&v&%POv%isF*!To~?EOUMeUZxW70_o&s-r+`y=!)!c?2 z{SJ&*_Zp;Sq4T;#r5mri0HbYBcB1lk_6$$$&P9eqd5gLy98^0pi&jgnkx-esODkR- zHmKFUyoh&N1l@=U&aQq+pUe|a|HK!6-?g~-*ZO9P-Wx>R5xJri@lw&~PQtqLMDH|Ftp+^hTlRvFhn&wE5|yBDhUlFlqL}>wM$tPMg}935du=!wp~!B% zd17A47bR8DBIilSgEg8!$2p+d*1)=OtQmPUD8G+Qs_+h0tK7Tg3rq3jz#p6^eN7+_$WsXK^)_c%y2XtfP(a<%xK%>>KA!pK_&=javKk<>M$5Fbu{iU7|gq8TB zB@s%BTD8vr9aJa4-wIVWm~vG;#g|gLo=*AfENSj|H*^uzhMsQEKasB=5BGu2S=61r zTSf0=>Ky6`+c9?8Z01YtYi_<&T|kU^khjo`o78w~BW_YZZD1>N07oCNnxVfEMIV6Z z$3=#ISY+sZIeHdHzyAW}jq8HqyoIP7n*rVP6TJFnBS+@ydS19gT3081yo9zjI;%<~ z_bekjq5Ul2I={C{o+ofJ?F=Wywm+=OM9{c#vwT$XYTYh}nuB%kAVt<%HAh9T_N{ z(28H<*E-Fwhu$Wq(Og{jbC8ZqW=&lU8DQ4uuEv^Iq2J=S@Hk3Y%~h0Bn0XXrP}@lp zYa zT-@{6p}N)8)lYiK-Cq#&GWtGnrZS`t1Ri$NQn3OSoV@AtNaR1`Vzq4GUj3XVtMo2D z59A7wdz;WZh%lG#?fX25Vjsr2erWeC67d|%@$iG$bJ*ptwWdMiY6}L5=W1uh7IhbE z;IMNykdP<_rK<+C=<5V|idI}-7_rsEvd;p2z^@!tkB;od`OJ@#tB%s308P(4t~p92 zcUlrklSuYB$%Cc|v`Ps59`#vVAK1+`c&q|%cp6Y{p^%vIz;2VN1y^GFlCz{Qr!d7P z)m{e^1uT4@=}SCIfusM-5uBoxno(0K)jqD`I#F6W?L4%_P!iyw8vF^Tm1>R}&0eVv zeK}8c)X+JDdWw|48u@W?Jy=%036A|Km%e1VKurRo2TWLG5YUPvc%c+z_DyE5%J} zagAoH&$QJ@OYvS&y1cJmwQo?rsQSU67S)N{)gr%kk-BHo@7@C%;pZRl{PT%HdNkIa zO|L)#!d?T|rZ*6aB_ON}r0k|O2uqB@1|jTaXa)s+G1wSr&!#tez&s8k^2Q}r7V{L} zO>8=A^h-BHV&U4J&1gMMB=!W_$i>NcftJ1)%otFcS`X|Ft!Bx6)rFwv0Ta0LLR8A+ zM0TtE& zSNwu(w|C*lPhNSSG3Hl(IXBZ(5vQ8*qow}XW@vmlcmpUh-)X!Y@!aJQGcEM<3xBNq zmY<@Z1-5TOH_+)gKDq$P52v8 zN~zOQGWZtEroa9Z=a1~zv;rRVeVMmp+osJp9|r306E`*C`yl=OvP}o@eX#zXy2<>{ zIDE0eE00J={mp zwe5wWaVOF4-t_hwZdl?%Q|7Wob_Op=oy8*kJgConf@`|+-^e`dAY$WQ=T$OZLToDZ z{>dJU=HHMQk^vSsm{{lFK*HQ;oqS1$<|AHgkP+{SK*B>h9$?%|?T@S6f#u(W%p*1# zh9W0sE!03ur^ipf=Yq)o+ zg1`GUWwrK{S;ZqqAb=8(MfomrU=^+1``#Qd`3TJF(Us4F_dXv^VEH= z;2FjBR~87E9`c zNmnOAYmVdWS?jW`21R}C?UH*LMm!fU)2>&GD?<0tUP;`-rml91qPniE*LP z(_-VgNYR}I1q9bEL*Fr`;J;7`>$8?hr-)&d=A6V$Gh|$$o8Zw~&>z%E*$gty^YAg? z0-=7$fKC0`7Ao_n&cq-)erq(p+KHdro@B3)JQE<9uBDuM6VV`U5Z#HhqMOS%RP|X71m00uZCg z*PCO&Sp&8OO`yhd>!@>Pn%Q1&m?8l|_I!kgVvH&B>i10-me)Jax z-@@VZID8j}Z|CqEIlP*~cXRk}Is9D?KfvL`IQ$h3@8a-29R4ha3-2-bArph&$KhrU z-@)P2ID8<7Z{+Z+ID9aNzs2E0ID8m~FXeCphhM_sPjUE9#~6G#hu_8FjT}CL!wWh5 z6Ar(g!^bi>mqz6nxvKz|c#3lgP=z%IaEDLSIiHwZ0Rt$fI1@@bdRksQ+6zBw5uAHa zh+d+y%qR+>2^d>uTZKNJ&|HiLFWP{NYap^j#|G{vNC$}?eBd>Z9bFhRGy^P_*|-~a zpXB+tovt`_E-(n}+ZkhUj>77_!^rydI>rluoT%q}D*6tj(geoS>tOAF`giyf9>>lc zQts^GB{2UkqyoIeJYWUfs47h^TZ0LzR%WUvU8lhWTWUlR(V*p$QSVs{udH$Ga|qPH z-y3oNjvA=^&2`!!xmVzsqi4*nLk3o)8GG|jAYS-gVw2Z$HaX}RlhpS5OnV)Wq@QlW zX+taV2<&g@$Q6voRDC>(YS2D3{XJhTqLDa#g!Zmk?UE-G$_qV%!ZB?LDAw9U@*yZ? zbi{xTdp9uGTVY6G{tqpO91aV6rC%Q6&W5PlBCS0(=G<@8jh+hJ5;bY&RH?|R{_J5$GP^mlQ~_l?hV`UjN2Uf ziCWY7<7x}e7tf{EXKc~^hEG=TNa$Y=qcpA0M^}U~>WbJE=Zcs>yiozRo4J>y*B{Zb zoe#1@(V#*h{L0yy`NXMMGxJ4^XW1Lh``@+ktB-gaGylsrZi@(d8&P@d(MGI=v>B$h z{42sP`@5WdkjC^FCfQeE%-yRz3BOf?i~)Z!CYbF`xp5{fQ(@vwn>^}{IloF;WKWFqX(`w#9HLpgG zteUbP2wBiq)I(YL{RpW+0l&53s6mG1%f1$w=lauU9FiRn2?%2zy#M}r0V{AC{m#Q> zr^##JGkHvG_0WlWSZrAGrw0Hu-sfnAl85@}Qw3*Swt+5y>BB90Fhzjhs$PLv>0HVx zG@kHQe97~WD6m8O3~?(i(u;tAl~^}-Cx!YSJ~s#d$9_SNdk^k_*&nJt%U6VSWF-#y z9Yn_1i#UCb^b7oQK%72D`b7s8mhgC-evxqa+{=|Y92Z6z!KEMkPfR0*+qw3Cz;%={ z#4p$WXMTZ*v{F_9V(2PlcQAedMgdD4&0CS?Z@+}<;lptq9DXPgQ(>9M@n5F|T|>(t z?}{9Uf9&U&k^@QC0KbvL|JE6&=K%b-9Pa6i({lhm zjKd%4jMH-f-iN~-opE{&zz>~d@SM&#JqPCvhhNqir{@5CBZnt-#_2f#e~ZI^iPv)g zzLdki`z21#0r*oK{`oI)dJe$v;_!d|5~t??yzrz>XHxCR6#uagcSpAL;ZDr$ELOlY z1#*G8hNGLr3;bi46*vQv9Dd|!N4r_lJf3vdd%AKP+zCnaeOg?QH$ZwQ7ykI>n8ncO zqj=B<#j=Uv1=zJ9!TY;~m6#UkAS zuv@-V%Qv$xqO!}fA%_et3(kkav^y=H-O8SF+@u2I(#_KsVfsu+58<6EVDp9wk5Hd1 zxch-i;=B$#pzAl_$Pv7Y}9p34_- zlGMZ{%;*w?m?)Tw{m#{}fpw}F%!Ra(b2ci!*LHz4;SpmWC2rW%ek^ zy~N14zlpc)&6rtvUbGN5`pPi%-B{|W6VWQ_jojnJtUR@<>U&e5AkkC~ydobJxe0Hm z6B4Z}5e4kjkcqA5Xq|tJHT>^-sfu+IT2~tpXRRqb(AhPbePs|Y#TuGeIN58t+Py^y z;`s)j$r!x(ZKgsNHGxJLst)z6VMVNl>}b2)F9~=;h!dj5a27(aEd3x08KIO(@`UDSp!@!{9IQhH1>JoQAOs?^{WUg-9`8ic<$ zdC4fOz3*Aftt3ej!L`_s;Evg4H4_WLJD5$LruL# z6@8OM8gHyYJwn?&^=bfgw%wtt@URnoZzcG2Cr$DSAZBo}%BJy-7-g4r>a$^%ZXVRg zIru%tIUkxb{CI8qUj3TF=HR|nSS~sHst?3S@x>~g6zeb+5o*QS2J+gH{}rw6%FgIG z;--GIMzA7r2+mP!bF9|s2T)_HU=%~|Yk`3g?R3?C6H;0Mo2Jfa>7&_dREuG;;wJz)kRNtiaAhVW(sS8nML{+m@T?Xl*$Ob7otOvP{387s>J-4 zAMMA`&dM>8yV(-;r2_n~`|(UgBey+Qp|tLLF^(>r4}jX@n{VKYW^yQQn1K5qI~H9} zqj^#;%NzVQmQ>3aNc85h+*tANMX@||ML$t5>cHkCgptsS>$C}(7^9O!D@IMy`AJ2P zG3g&9R*Ak7-q4X7-3j-+h$N^0t$tG*h@oN3e>D`E5$y9~T(j9!xH#6PIdMzcGv*X! zE5K}DzreC>i*+T~5l^W!)-034$+5K~N)7`{ipKCP=O}Mb0lFuzx{?~On>1L5~&)zbvLk_zJ)5~rJY}z@F({(GW3`gYy@6A8g1y2KJjz* zzz`n!+Tx>7N{aCx?&c@Q*k=pTnJ8rlZpm;iEYGAsx=~2XXie4%c0f zC)*kPS`OD;kUwyEI*02n$S*kD%;CBV@*@s!=aWEpLH?D)n>k!}LAp5H&*8cY@(&!o zn!|M$vUJ+W`aqc$)=v;^4{UIkISov&ps~C9X|WG+<*A&<8s5{vyaQwhtEDP7aczP zxEK$geO$ta&OR>N51oBnK0S2yaanoj%yD_?(3#`%+@Uka<-tQ|j?2tLXO7GDht3?A zQLH^|QxSD#pJ_;ztx59zLejq;WVmr6vI(E*HBzD2-a_41@K|VyauVVo?06NhIG=@m z6xH64u^X6~>Zqd|MjMbzUWgwI7~-lj(N1(>_($JOqH3pAF3V&!g;MZNZQ?_C|1sl3 zK0)V0F81_*T#P(Oej53Y`~>nI`47l<Zk#9#{BhN%WBioV3$dfY~iNlmt zk31T}GapC|ovWn%%tq(vX$IH1N&<)P!ZQJ#p)Aldh*;rIbruT3lJQUtWOu-{j3fes z71aa^j9hmyT4Gz*sq7A<l*D1v2&QD7QLRN}VFq+slZBpy?rDuWacgjs>-$AqBV*tAWS=8TbY|u$b@)9= zN(z7Gd)A;9Z*V?q5R??QyYIe)=?~h3wW_iKo3n{LDD)la$}pR9c!eU5Nw-gk}21-1&Gfh`kPvc$Uuqa~9R=DXd)gF+}A)vh;fVLVIONa;;V5 zau2`J$CkpfX#$NHF*^5Z{Ce=bW%y| zek|^7JpRF^n;oW`7;VXdU*psfF9 zsZLfBH!S5{ahfh`!Reshf?H8J&a%}M=V_+rSK{^9E^3H@jNVMhs-`Z)#qkcB7^n=s z{#+!o52{=mNN^11AyQ8Vp(?-$B~;Ehu~Q@#G?E zdP6!;(>sw3+S3Pk#m7qz;(?HvlKWZw1wCtW0{N12Rr`i)P`2=skc@n;2=LmkQ1`-n z6F;X1;Itd)0TjNE=mGS-cj*Dty>fa0ZEqPpfU@@zJ%FzF0zH7LSxgV0^U3r8D&HUI z0a|h&JwO|7rw3^946d)e&0UeN9$0Kb95Lxwm# z0^nD3_#N?j1i&xi@Vt0E0^mjtzcOBr0C;#mgP#|#M*w^~hj$BcdIZ2fLYy7}@cA767a>lM0Qj98{yc~4uGf5m!{jfBxn0LG*c}MdU9J}~ z7#(ld-K~8Y>?(xmuGWqp2}b++x|?u(^UiBku+1F;wkXI)vu24@D)ZtPI?QB z82*x(Jx88M$B-|2o`U_az;g&7yBE|5cuUM2b`i^6KcKF3O=KJhv)Tel6x5S}xSbjL zWlrK)Jotb=F{}DqNVIhmdi_5mQP6nJ>v3KrE({)QB0fD4#dWfURm}Ok_T60}KMo_D;YSlidd)u)M*B`Y z_m8iH!pA+fGW8V`YG82(J}@*~ZS9dKPO(!(H@gnrrrKMA8+PKfZ_#cu1ro-?qMQp> zmo|toKz6V6^u$Q!Ryou6M8umLDY3O;uzO%22D>Z6LK_ESO!VUs@05tM3lgSU1OX%a z-1rerwLSBwvQK57^GF#Ud}t#w*cMl<2{)SYb9exJupV`~mdx8ta^Kp7d$9SGTHJ!h z-_*-M8Ae+jX(KXbM|M#eaO)||P;9xz8U+`B*8>&z>w~{L1C_wHAnF-6S*?XO(oI%? zp1kCbEN=ht`+7#~2rL8LpmZy1-2a4Yg(8Ea0C!^mDV#bTtFW~$ug(?1zhT#XG9ca; zioba9Kf}{0XX5z}duz`-Z1{ztGXQUXHQ!&P8ov2T;Dv|Zr7tca%2R1^Bq6kaMbQ8W zKgE zM?;hvKSWnSJ1Cvq5^GGOXZq{QKWFPt;WE*YYK?KNH~w#0-)W9-y`1}B&2s@8@Yokn zO^yW{FxkSsSUw*=NN2LdA{KS6=Tbi{wZ9HFn2F+V8@GAP*iEfXjMu*F9gqWguSEA0)gt&t4Bx=kx?U?kRZ zuyA!7`>wXHV9=!)q4#x@fTtcuxPE8{O#LIaN;6DmLN8!|hnwS!2$bjiom{Ud*P5BU zThNET<&^TB=@9hI^ql}d!HYh^t9?%PQw~((nhNHB2&Oml&I-S0tW& znqp2@b+Uf3GhQm(bN%~FiM;Ni{1P{+_ZqC1&{-L5j?(>mVsot^ST*_vU1o#i{?v@~ zls<`92lKR!eG)H?K8Z({tpb6#H?8Y$&-aO) zW0RAjlzRcXTt1#5$%*vw$lx75C}u)WSRumPhjRtILT4O1AL;C#!_G|6g&ex>Ao z(1dJ>s+j~smJ3ZRFFUN4gz;#>Q%mryT~AnW3C04Uo5{0Vk;0QQ8iU_|f&tQ=-SQZ1 zrYU~Tv*}*DlrCl2q2-$Zxq>4r+j;1(oEeCVMr13AR^P1HVLB~|*4A`pyxqG|4=zr_ zMGfUbDUoue zqM=R0D71-6v0y23A)UuQ#=@HRQCL%4>J2Ov^fG?G4>TOwLw8)Wv;Wic=o`Jg+wul) z%b%>l@1Me}j>3QLjq(?c@`^RMk)f1jY{9QOwMuN?YSF&7 zN_7TM86BJ%m@~)0*qUlBR?Cv(o)`|Q2;+H0@9*1oJYGO@3uA(6lh(O+0`42lqhqX*BUa9r|p-ed3| zE%n?5|0cs}RN<0irv%_gIe0?C0nkK26mjEAJq0+#azH|?2#y_}@E`q-9Be|Sk4HDf zeI$RCCVwe?_y>YT`YRn&wD)yfR#{9%3l9?u)d^5U6yHw$ZYxbAkwGZ=%YIHbKrZJ?Sy4$0(;Qgf8*@2?g;ZIqqXWq9+m&faJd2<`vbQY3A%DHfbs}~#ab(lP(NLRPG+a2zmkDSZ(j3>fjp%3vN zX{=)lq}hUN+h2;24m@K8=9HW#0?9lWpIII|e z*LaKLw!Brn1-Q!1nz)A3_JrmSIHff-uB5}xLd z2YSABX^N#aCJwR6H43$sQ`WdyujCg;Gu?pw=$G(~59LL>gAzmtP3sGyi$7dI3{`qA z5SsV7_76&L{M3TYt=?rMvM+(R-?0#pkzD-}O|Ze+PrDCy;4*w$V(8vVFx@#6nZ8HI{Ds;WAJt@o;VqEn0pG{vd?sa&-WbBvK4H%S2skmlt9Vh1aFAjLQVpvVHB2 zW;wVVLv#RZ>0&--EuBkNn#WA2;+!4I-^HWD*YV_7%;+cq5!;=eial4Eo@?bB4t2f8 zwn@O*X~V5xcB}XVb36)8{PiUJ0gU~A15nU0CjQoLfk`<%WtkvPU4w3%ARU{_{sH$- zMEu%vdXC?;RCL+0BN=@0x>eKyHvRFB2#sGJ!Dk}ut%GykFEk7|`%GQPxtBguoUN?r z@o8V7R8mQwprqgyQ+i=@6*39_`PuzR!wt<>$Twq425XCa%-vP#e8-Rvb|=E|b^icY zs-ypPd_9f7h(-BCTgvg846k7vWvW`)HTsC+>r{G480XIAMq`P(N4ps$KB#k-b}iO2 zojbMP5GT%jJrFl*TSy$ewoKMmeFHV->T=;o`sIwFz>2WGn%jQ?t1f1xgZ*3m4JdK| z$X9p@6X?GN^w0VcXgZ3!V!}bAw)YR9w*K1d2htt2e}DS z+@#%!lbu6xt1Hyz8Q*+LoX2}ZqT3N_`xRuHyl9HB1V#|>4T)eWG+c^s>Ue0zVbV@-^45`xyGx%~jaky&$w6)&N1P5gDi1fQu1>`TWk3#wO~O~D zkII@D8I;(gj)m8pjH?msPG{MNEavn5W#e`0ijyTcS%nmznY=Vyjm$Woj=Hd&;4n1ICQPCh-eU z^bvMS+jRiR@9ob@eiX^zJneV;G0r=+wcKrf(QRL0#x_i>;5NL85LR;Nvg2g8@{Q4A zgpYFXtRPJ?;A=H`AA~+7G-1*$#&|nRy_@A=DOL=;n^oV=Ng#h8bu3@gq+U2C36|V* z3=Q=6en+lrIMVT*9_H7DP^6LT2|X8XnNNxgPkbs^qh0m3tF8`GH;I*47xuNocdF+> zbl>wBvV@cz!ohLUPwSfG`d(5m&rvIjCo7f3)RgdK*wd9GW2W+QrE(9 z&e?ZTuZ{OiPg7%TiW-v=pNQ*qHnf~?{PAqkpGqe}K!zTMOo3Ow>~;-80~#{=`U<<= z*QFq&_V*Jkv&UgH{^keZ{CUjzp=w+>G8~k4=IFOb9PD;X4zABhulQJU5c3F?75onk zCIkpF6chdiDTn_6MPO%OLKzoWm$R3ODcPaVu_cE^;ob702u}q#yexgJj;FQ-HYWA; z@QF!viWTQ&I^s7y#+@-B04+K%#-*|QU^%#~zsXdZ0}sh$iuKPZY>E}i=z z18_N3VH3%*sQTmDCwHmxb-rB^2Fv+9=!4JM*%6h6i2O5q6Q6Dh{qJ}F1} z>Wx-4H-3T?Af?*Iq9QyF$5V24P84PhJX{k!u!$$mhecfNVI~asTFH)*!;Y97U4-dp z?8!~3xkGP?f8Ge{tGh+KBXuaaM6th<3KMrTRf*RAUih|_gI5Efw-r(tg-wS;!BmGy zVCTK&OjN5GBVY?ZXrYEDMvCku8`V3lWXSdNmtHJ~;A(whpsB#o@?=~cI#pLY`a@ig z^@tX2bhJD%ghaK!Og4FQ17(X$9;tF-LW81*6M;0#)&wT72b?D!gsJCP@4KGn0Dsxp zCeIb3Qg!+}saSUB>S4gH&}GAqnxOBwb)|u9L~CNrD^vB3S@n!e%fR|F~@DwLB z)o*4{dhLA>0^Bn1D9qEqbXyY_dI_GJn=)?CQN{m*_c9%ecm5zEui!u)x2Ke`l|#i4 z#0ITH=Oy))b3olJbkQh*Zrfu*BfSi2We(bzNA+vx!$?^>Jte9;ZhL(dpX!69!2t6#fz5 zxu-22wwyYFi%)v&YF_+a6#b+%(JjU$Uq2_Njajdiv@ehA15fHuCtKB__o4yB172zx z#+dfJxGyssCBKY{i=-g>$B5akv=3Ny)rw!UhUiu89g z(ko7CAJTu7k$z)#dU-wCpONm$POnA!tr_XhWT$r`{i=-g>g@Dc@1gyt$8ROl53V_F z`;H@h+nUqjKW!!2pOJnN{gxp8R~hLyWTziO`Xd?X<4>Z``)Geg`h@KCc}Tx1BmLU! z^wmfol97HAqaH%~!PV*XvXkmxh4yEppTvKDq`#YyJ~2DJ1?j)aNWUpN-TndEpOHQ_ zJADSyZ_P-bot^$B(yv;5+V&N%M*B0;Pv#G#AN=67->*dawv6Y}xQEsem<5%lBm}xB^CQIyVR^`7-TBgu%#Xa?^vu)bULtI4|c~4Ab8#`vbQZjBmpUtb# zTKOS8A__uAiRNke;zRnPwl)>p;SzO1(SQmB?y%G zTwipr#1nc2B`VIY#K@VoYGpylY4_g6 zFo(0t^Pv3RBR0oayn1fI4UC-V3n*5ue>@+j0#2=D0$1W~rdNO2IFsj1D)W!jM6+i( z743Ol=?-kTgq=llT-2_tcg5S4h-So#nuk2l-)hfKRQop|a8xxE%JpO?n zTS)Df zHta!JpY7-Ds&KelpSYdz+^puRMYYjN3H{F}oNzm9HOB=j%>jK>_iFF+kxHrTb`dA3 zY^EG+Gl|2K*nv{LJDaU=ylg_TPrj*&$Y9@>OkDgmxWApNx?2?UIvAwX1~dP(Gw!}l z)z?~!Lml2u)qVx6z)E~ccCx#}v0Ywt8{QB-WM}m1rxe6L83uzOpTJ5h;!@yD$#E)* z`cU;>LPT&hdJ~Rga`2dm*UFO4u7I=CTI%a~@&(n|?r^rs!8d`oyFoGI0zcXACEDu* z@jq^UP!3&!HTTCY56Phm_{n;y9KzxkA4oQ=-4lXLifd)u^a6URGiJK9Tyb^~p{OO{ zYKi*4!K}Jg2DF^$BRSZ@GAOJs5161~x;o*?&bc!FQ9YWuGDUK-kNcpw@ySD?PYXVI z8=0^vY71Tbt9C-%_T4$ky;XkTJ| za~q#eC7vv4*tkA57H1G|s=S8lwyT2?=+0H3_ET^tNIyhEn5_Rb8r{k^_M-pB{)4!M zRnn#}^ENwM#7`G9>xh}PB|B7K7vIP2a(FxCMR22|d`!057u3CoG~w*Pd7~mpscA=u z5jnVpK8-#uDZZ7F8>FynJ$A6c`(>BP!53kHx>jS``*BOki<0VV*HojqdlJLz(>Z^7=0G4#HI;cSpcJi0|BBJh)q60lBFXDnMSu$CZ8U z(dl`8>+B>y*_nlKCs{&y*2&qhbNM@~yy$FPlX164J?7)<1|tu>vqxp{Bw-buDxFYV z9qWc8&B}wQ1If6e#szG#ii&6C9bb2jQGoD;w9+Kx`A7moO1!yT*p^Fl_=P(BIUOF> z;TP-hc?=hRK`;Lv*07l!eNK< znq#IryPB=bTm+~_)ifJh->z=9zFkLe`^X3zU2#^cwN= zQkxvaT`_hCAIhVr8>yX&uR}Y=X97s}s@CV1TIC=lhsgC&A9C4$rMTL)O}rdR?R)!H zv`<8F@zMKx_wsvxtoHBF$G+%VtqA_RmK0Z}9fW(vt$PFShVL%VsCDlb>x|Dnf$zjM zJ0A_iaW;cPw0~gFn3+)wY={otE>nG-QR^B*5Iyxv2%^m-72ywevm&vVGM*Q;?fQxC zHN}~lW&Vb@rZt>u~8(&@6+LT>F^CY{3ab@RnAJls>7{*`M(~qmdTAafQvR;v(VPNb z2Jk03cv%WO9N@h=_%{aFd!4e4dWW@5F{(9RuV`UTY8<25`%+(AO#B?3CGmi5N`0+W zr(;N81>VoE6vYfcG46JpdHC)!G2XWvW2PbDAzIm=K27+A6J6~kYp2rj`<5)@RFQP5Zv z^x#_pxi|C<9-kIt4~V4TGkVf>l*ISnb@&_|K2?X8>hQ~Tf5CU@@bBvI;fAAO7KJN$ z{ZCJNUswNs%2Znks(tkrk@Pz~=^<|0O0=y_PYUQs9>#ek>UvL4x?fM4r{nOl4mW%o z1ayAHSM@RxP?^*Y?}ZSW@@evuA0d>gFM;j#{I(BT_& z_>n&gxZ&Givku>-!wugC|Ip#h3>Ur)cIvQq1&nOkuyVlSI&6-B zT>@A_hutG!d}i13JpsE(;1jCE5t$u4G|bxgBQRdlap}A^wZ;yonbgwhXx9@w*nfMyDL(`7jpLy9dO;_GyKjF z3b?X0&}c4cOAMGRE)0=C^0{U%*IX5aNt$cbAor%Xysmv()U z@3a_sL9zy&WUq7j z*6idpUie24LSN}IT<~-D#PXRLHe-!V_1e{;NHDx;ZZ~{->Vc&A9N3>k9}b2(Symd! zBdXbnWPEJr1XTy8@9;3`zpgkn*aQj0k%PYxa`C_Y$|S-(h!hdnD*oQD*cvBoIbO(3 z>x_?pYTc~#u%OassqQySdPtk21c{d8>f>eJe@1RI!`~>Wr8B&(jy})k$Zg3KU|lSi z>B`j+T^GM0h6XmKqPHcLR>yWvA^ z@tq*gygvu90oS~7A+GF7CBODZQ|cnX9HgvSjnatXkv}pk zjL1wJiTTrViC7gCmyiZiTi<>eLvE&;hre#PwQ-wUCn=c=_AP*)1V zeTP>P1RrtBv^^&n-<23Qi7jLYh5Q$z!LKnM=0MK?c_Ew{CW}MUMrB`b83zs_ITc@o zitRA>muoMcI7P-^F^U%mQC)mB<<p?i7~wmj_>0{x_bB7`p4V zEuuc7>$u@-orIOP7x9JH9tRUD~!da-{t7sqP-5; z;SJJc5LyA?UI1%TMS(NczDlsfyP`WgVBw#GgANjw@ zlKiOYAmswI_#3ZWw1$%2X?p+9o&<&lN3=A??IceEJ-KplFpjYFkbPP}57B9d1HEQ> zVOI{;@vMOczp{z=LUFgw|CIT`)uA}squ$mOOJKziSaikr9%ath4SVq>Iq0JLSHet# zT-%_yTHtYgePFk&)GQ&DNO3kab7PpCp?UgK$>EY@vvZlCF-xi1q-#mQw52KYkX?uPpLJDzouX|hEYo5?UP{iH}Mi+ zBhxTql7y1VXEw^y9!`qbIhlFsFGqYl8BTR+72g6!ITsu7@@)9vZ-EmoT5sPea6kRg zKFfkzQ}u4r;V%F#`iobhxDSDgwiH(Wx2J>hTKM$os9wAOh39Q|SkIBnxg%;s5Zd z4{g6TNYbeeuJot$nqW%WbnadF)AfJqme+I2msQ%Ku< zc7qY*^+ae;zNfL22W5TjUm;Tmb6z3TL(o9ht_HZZN6Z)ATFCWROu7u$b|2B_5kIP2 z2RNn)?Lz@y>%vPj4wcvPEUg8P;Movle{a+ZlwN(>>dBC5IQGj@4O4FPj>CatB-PfK z45_9aCwv;ewg$eC1AV#jb1e8Z3$<Z{Z#8!;~HLIO2Q_ z+#-iQ1caxnMtZ7UX49sCf_EGY9FydQ=#a+FoJ-5WStazctU$ZC2i@i=T>E!atKxf} zIp^bPcdDv~@!Ele`wt@=%R!o|;KsJYM-EF-ER$mFw-pXhP|= zSlk7Xv%@usz^8fdO51jaYYs+S2lHKtaDF*u?-x4k-743&B({;F(i+%cXO&N0+aT9p zmsqw6krLD3v>mFfSGGV6>x$UIuI)l0F%k|SFdF@20vC|f{7ews?X`aY{Nv(6=k4}}$ ziQj_Hx&D}PH1O&1e*44ue0)1&ouWwDMrM_>E9&b?3)%DVxLDKKnx4 z{mb)=^7qP~tCXYILUDG*f7!>?*;LLnXGfX}_%b(5s#*hyI}9WO4ZuL!Hg~;$-iQ+e zJ=R2p(i)vU;)HTEK3ufoZ7NnG^`Z;SC_bfxXwlixX%>R{=bcRjG*U)N?UUC|OX{hG zBdD-VjH4VxQBZsHWatSbT~&&(KuPMca&Ku8373g%2yuMU-u zt;`HxqO=@oB}tI)Xq_V~yOhR*ucgLHbV^d$g-d)xk|qNfzu`sRyEJU%OW2;j0)<7d zroYrEbX}8DSBAIBLM1dV$!8AW1wMZ6i^x75*?G$rx~GDfp$;D_x7w*?&+AQZu4Eft zozPGrqOf62TYbceg`Z#Gu~b=u>s8HsOJ*d#2#rb_I^xLG)8y3C^wiT-{fW4!Gz3iL z;N?R}l-6G%SV@fn>(E9|!Tc}S>g0F1{_2wGjfee5AC?!ukXE@I>Vp|}(|f5Rola)?~NFZUSxxSLJHRpg)uo$9!L|V&{5Ln7= zWgi-_61n?<=VOJuW?Ql`#@$5Sh@62=vl8NtS;Hr5*PzFhZsjE$Bd9GKBiF6By@dQ_ z*UNPc{Tdy0f^WVUY%)d6VtbS({#=^RBG$aJi{)T3e00BrBC%U~9=##*!a)39F9&mx zDyrftz;!DaMdI&;#QN~OHMSoN&0@yVqO4)`Vk)BvA<6uwG><+~3%+TV7i=7w;+rR^ z&HtWn5PVzo9&}wtx2GP(DSaw)4B8{DVBU#NH+YGWlvY&nU*;X`lnQe5x=pYPmb%V- z^hN|SkXHrk*A;U^qEjR#3X&>+AKg6DXhU#tstwSa|9u-8>WnsAcOt6|b&Nt=ivOAG zMVqE`o2I7PH1*^*;gYB5V$XoX+&0n=&qtqKr8gytzY|jpNcF)BgHrhS9zPTOO)31J zIIiR0H2Q$@QAQuseOn)>byJP@or1p-)9y<5iVeMTAc^KoL!t52;lr@GEBck?SZvB)r%INe#t&SDq)5@W^MO2+N zXrq%`{YU%B3;#Zh3HVI8RRD9P7bs&*QdN*?x-L zVa&)Hq<6+qpMAMcu%weIJC`C5Z{-NJZWNXN zD)Ry+jxUCwza}%hBFS11X`f0j<(g(!qx?R(VE$3`tGuunH?}A(&}1gHWn(;B zX!Z;>Q9k6Bi`iUuv1el0-JS_T3Yq1gcYxStuBE=$S&8>l@{=jnD!_Y$(#sx~LvV60s3rPa zyAQYSU*fJWDvnE3C#!+lp>LSFJXv?Eb@(D|7E(@(yFQ8VU3mz(8n8i8QfZ2mON7gF zjTK_p%`um>WwQ6V#BpV#NvrM25ckUY0|`1$4&j=M_FM2mV2{~R2Z1X;W$O=xF*4ZS zJ4z1Dk#TjGvic8Y&KGlf*^mo8g!3ssIV2{w(`rj;UhYoIsT;pJlRlpwHToQ}b~EJi z>2>W>^`-mL9Ya&I99n*m5so1u0;?0F8x__rfF+|ZFSv4K3e(pPoe8FIJZ)e)N?`hq z&?*9qpUF@v0?Yy?1J3|+q$wp%kLW1>@FbL_GeG&F^HV7AKX@i6A5jgIy$ApEDBpPC z-=qBIc`1~yJ0p~ZDo4qfNB`$^DOw}$yBGbu1aady-}jLT0gErJP(Sz)q} zbaQWcptVpH7Xzc1BucCD3*?|1F?cy&AZ~u3p)fjKDu_hc=4ed}QVRm{LI)R23Lb9k zGjSgMGR#?wNkRW07QNl9w2tl;6*A?fG3CmOQk1hEI0MQlbsZ#z!qJ`dH{PcRDyj^O zFi;N8+Rqey@&6A+Z=gShpbQ+ z3|>L(>i-0<%+zrX%Arb{BD8Z4oun~i9te#>(#AvCEiB)c%+UV-RXbOomDc~e&!nAK zgj4$ezW+=+GZA0-^}p|$qa#u%&)Ih-DEk%~C?EU!KaX)x%43NLfFv@I^Sp&Tt1(7(2$HcsW~EK z5i@k=#^q4=@M@Jd?JLk(^w>GkNhiiIQH1In%N-c5mKu9(;c9cLFK~g#=nE?~bC^x6 zr7%vcAx~5ob*!c6>e=qR6mPwiI1}Dl5ip2yRYEr-iMOOW!N!T_jfUl?8rG|&o7*o1 z?aF`_3SC*utAV)X-?sEvPP(PUbwRbzWLi5KeDJrG^-Y2Pb=I3S+=S%taR@A)SBX+Uub8-J#*$8-1ANRUoEm;hTt5jd&nMbc;iAV1bk6o^B5d9Fb=9c;7&<~EKS|A4(lU6(bC{||W zXRP#$b0eeBfmcOuvM9VJK?Gn75|uhFy`P^6Eg$z8v^?5{nL`fkg@bs*z?t)oF5Mc( z@GuH!7Mj^(Vx-BzTEbzMXnTks@a4)FRyi-t6khVq@oS_-oUO_F`J%PGT8+8g*p&?r-a-FprmJ=3@L4 z{Z@7f%{Dlj$2<^dNiD|xfq;==V(Sw9mD(X4EZ1)mE5s3dewekx2>%UeSMX~3&*;ku zyqNxO$;LoW(qnm`C10-R>Z4UsYhtmXdP%CjUTREivuWlTQ>r{}D{0W~+YNJ36b}XM zVtx(_ZY#Hi?Pj538*D(DDzhVc5D)T#?ZinsPyE;JGvSH*9yfU6^Uuy)Q%$L+4+7UI zlK&_I&r?_VkJ3DG7d>cC&>xJ3`x6`j`*AsRHwM&w$fOJ8VCYzC>3YGV$1()gMmtvS z&H9$~+CrQW$#*o#Avk9h3Prgbs>VP|NiIt)Z@@{COVTDDGuS6)8YzU=DjMCUk_N-6 zyDcO3z#POL*b1lae>&U*ukL^HelqwXa#-av0XT*p?IM$2 zc?lO5#g?e*>MD&2)*9H~WQs`P5RP_4Z^rh!Aq)mX7_1S(AWvintU*a8&j9}#yv`sC zkMI*OHFB^DgQYvz;JI6XE~W8Lpvd>B8|ZnJ$>|L|WQdnw`p?Bohez$iF31Rs|4EKsIrwMpGwwMa zY!SZWG`SzRuywNF8~?oFP$IBhEmqgVxrzVvKT5cUZYKQRuHkE){-fi?v48*3336~6 z6Xh~FG`}z1nzQn8uG!sXyg$YKs80y_NWr?gT)#15AIP^?zMu?7=4&K&y%~;yVe5Os zPfxg);N^*!z)6?jO^MtoH%11A^BpU6HHpoGn0ZL7LbAjv%-PcOfB%UunOGzex@MD3 zmj|70`zHq0o{5o(ypNVOhY68rHHVuFrs~0otxSeuIjkKxo>@U)wxP?C@+_p&JAb;<8&jli* z=cclpIRnt4&*>f7rqd;{(SKcy_kW2GW5J;U`|D~v;~0CVj(eU};67g99z2#sK&r;u zs&X}n^?a$~a$F`t8dUfkFZA=hefk~K%f)56eI7u&b!e3i{a=P2(xFpy=z50s=+J38 z^v?`Eu0wCrq0ckaloZezI&{8=uaG?#8m1@wSS08J_s9H^RZqKL|7a>hZ94Qp9eNEz z?K;$>Lq{4F4A&DLGb+GpY+T}x3X+h$XtPPI(yC&WHsq(7)9BE^z^uoQx>Hy>pI3zjL2!9bnIkTBFTSVsT0&5O& z=KMh4NY534zJ8uDfi*o0a%6n}vy;9LbdDt1H(c4T91!CoYdi+l9On}3(dyPfPd|CV zZ%wd!(H|!7b?Q(qc03h3-ICpe+r@dMb2#yW?8HDP+)YmRuR-sbJR_MDfpL^^mHDKM zW@;HV!^-tJ(i!hFe`|H8Z-$La$f&B|Zkd#8)ZE(`fTN+)HM z1o8zZBR@7fGz(4XjadixoayEUT&aPRY!+6DQKot$L;7qwLfn$6;HnV4w; zYcSMlB72BsCHNJE2B+$m$&GVo*ZqQI+oTh^Om47Xy7?BFEC+W{QeO)(MaCex#*!_Y zvoI2Y(03gc^?_KZZ_6wK#&l^R382_OiN8C`qz_2V5He={s~7N9U-nn=0D#kUV1W*N z5I{|DuFNA@4&K8rqEmyn9TUqeH!_fU zUk*;>7pr)=nqO?<U*6`39z(Sdx)iN#FSCKQhbnq`tck<)zk^W;_UW4GiUQcFA>!0~=`Q zr&W9eJE|zPj#=~%ypKq|+y9YS$nXb^1@QcjpctLGZKK54`hOp0o%U)1m7JBT$imNMH-9KQz3|UmQXi_V#k38J~WkW+NbG5cr10cAOyh_$*TP|Yw6JU zGed)#MTD67r@$Vw_T&Lj$eto=`8K?toqE55-_J?CkL34rQ||@zz6yuL14kvV`JH@K zUrEFYuFieppbRh9B<|8pdEi-3n_Q|c3Ni1^5#)w~D5j)Mwq+Qk5%kXMhBS-AEts_>20kfZMv@T_{fRuN)ZN z6f+GAPm`#L;b~^ErW2lQL7(wrPI$64IxR=ps;|8@VOyadSw;v4(Q<||2e*-&uT4>zv&4=5t2-?)UaOZOU%?+C6Az?BoFBmSE$ zY^e`Yt$b%g|CsN#r=QiKj6j=r&&s7#Lt?SGn-SPMLUk8JDvAP~TA;-rt|%f|DN4pI zY^N<=DoW4OOV7MB@-z53xuZZWP$y&6($yLD6w84xx)pDSae9B(!8cS_S7c&Qpv4yG z>T$(=#|?E|Wa=in4QOm&Wt&$DLZ$w=7C}ErBL8M2fS;;p~(bN@l+O;h$V2`F)fzcq=%o$;>B4HTIHHS2$d0B)x81FX894#;TLj zlZKEi(F!wtV-7S~<+bIabSgOnXOV$DRw9$6 zwd1+Ts@=$QWnw^W`2;aPO=W7d`uXmLrWW{kRme43pD5It7g`I3!OdRMrYp% zrt{&7B9b;wLXX@*5XHGuy9X)G%?{^I&u}7LW2bN{*`Zu5AvV#Ml>9)>@w$noA(UnI zfR*%Z(&#AFwKHn{+j)>;o!#-hKQft8Lu9kk0ta|Us3&ll3f|3J9ife$b<|5+zo7KQ z3p_q;Gzd3p%JGc*l9#B?0y1R+Jei!K~i7^v=@YNfHGl85;Lkh+>VOSp%K>XymwU1WtKl zv>Raz*oP_&E7fU__uoVu(o-OU){#Uj!fm(;Tuv)cTH}q-hkJG24mR~X*Rs#mdrYRV^}NdY z#{{b)#5r!e%__t_p-m~Hhq5lZhjHE*?nwM?na#jXv;d03zrP;W?%ye$CzNW$Ju*nex3rfD1D} zSweuq%uk*pfF<*j*9dT+CgYQp1o*Tj!==zpR zv+rQ%e;lts^(|Ap?W*?$_<;CWty$XmnOSu%X|@)0R>G0VF!3{7{0za5#l13O4zyST zox8*4iOMF2Yx$gw2;$@3OqIdrn~uW`uAmaV1HDrdmOfNon#Bx5xY)#*1&22%Ki!`) zTD)Op1vGrsWmBR*<1d1w1}wt%qv|c-jJ0_7g{32kZ?Vc2gChKGxHmM1?x%+wX5;3N zN7pTyLqAGA%`l#vtHHboxhZAdRaCvU8^vBc-*OXGvbb*ARq!(x3?=2zx*^QYrOw52@B>^?@!B!2ma*@X#gj`zXt^BxY&Z`}ha1^O zU=73MU&%6E4h4~Sg`mn}Pl>t)pE!J!6Ap~TMu5XbuMeFAGAx$s^NeqUlj&P!7yOAj zTa{zl1kkSzEryw11+ly0M_h1t&M;LhwXOl>RL08@n{8L?Ky;;UuE8Fc@(KyN3{`7h zQ@zhYT-$S1-%`b%rC-~eXK8^PnkYeR z=gPsC3H36w9P9(Re1&Qr@_rY2y@l#*D_kJ^3Y6=p5OtPKtplPCMoA8y2hur%W1KdN zbFq@Ex(d}ns&l!cb+%b)h3A$9Z=3Yc7as_owjJ4}_()O&$B?9U(?nCKcpG@qS*jN1 z&hG^q%fY(}nE$2b`PU1;6aao)^S%ZoIuZGNG1)l zOth)PIeAGsc|kvLj;}@WZMM*uDyURC2wmTD$96(@yJMHU@DY&T+d$NN`Z<6b)t&N=)N8=-Bhg%!s7B~f{ugcBA+}^X4 zruKlhT?+WxO>*dbP{i39GYtytGsBOKdxPqE@lf>f$q}dV4p>u)uUW_Lm+MsXjW2$95t=8J5^VEpwXNjv}z5Z zXOY+5%D2j`W~mWwzmIA6V>Qav9_bg3BD4uHd!$^_%`oTc@-fcM(dp%6XF(8*?r^lq zPpuvb##-(0Zk}_8>fPMPP;jQVH&MT;*}M!iTqOgL3t6 zRNrc4-fygOeI3x0*D{9eP{2Ziv+6gt=BnRt9MtIJR%+I>$G9zgx1X4`Ju*1VAEK$> zmxM8v8U-!dQ?zhxCN@y)FA~ue z&x@xaf$H0!RJ}~f*kbyz3nDy?dx!2Ie2n-88j{rG<(b6uU|K5PlPOH!8Il&J&ktc? z8mWaqR9DOr`Q@ModBoLli00eyO7QyJzD@FTO@{n@u3=mg3FKau{V+b);qh^H4Q^da zC|FpsZBVOL9_L=#piW=aqqtXtrCl3T`}>M(vt!f4w?rR5O5a4Qez#ZI+W09+nw8QP zwPu<0p~baSaW^D#F}KhFDo}>0(~c`c)M-7+prorIdix2)-J@~wwKb5i(&$j#BpNo) zZX@j-ORUoo28%|T>&@9`N2IdB@o%P8Hc?etIjY4q}O81e2*T*bw(4`>{OoxlOoFI&+>Gt##TX2-MX1FNGp-1*T zl+l{oaCt8}%Rt{DGy4AP^Qot?lYSN>-{PNJWRk-hdZ>UrK!j7XuKwwImiAyE+R+2J zFDFiSFohQNWH<2L!RZFxTad|&>3Mu2$jB-N^X8|RA}D{obSg83E(2D-I040TiZF1!E2Gv$$|lvd8os$~BPs$7R>#&yzEO4wzL5mqe0G?{m0WLA znn>{J=55qY|ML~HTYQu>$86Zt-B=g%wT2}akMK(po+c@~sF>fPn3U*53vV_D8p*D1 zm)BNXSX2ahO!A_C5?4w z!(?EjAh0Lb-%EtaVw4jT z?#hxwzdQt5wpUZ9GVkP}J?^FI)#mwqq6t4ES!{7GLl}^8^OFL0hvDVQbMZS8L|(sA zmihAYO(hKuAKrP`$-izG*Xqp`s*?)$=fveti8XEq+0Ng`SZCo#BFB3%^{^uGG^YSE*8*&ToYDryw(V_b_Bm*3I&1kDlt01rMwuy7!}*ZWPLJBZ@cOLF}%mCe+M zRT^&{B!_;@f{mx#28HibCN97l8)cqqmgM^BxspDT3x}7FE0pEXz4S%W)$ZM)a(30_ zmt2dbErB&mO%acSW`2ir^PHjL+zr`c#z1zje&kSk9BbHOBdWtMQhjc;FeD71mC{F% z+(4(Lj9BTRd=XQ32>dUQ!fYKjL6H70JQKa3SO;Zr)Y3FZ+2_-|pG%B&M6SO^@vffl z6YLSp&tv|=81=QnSZP(*_{w4joasJ|Hup8le{SEM|5lsByz>7|pF2s1X|8%vto&5H zXee!hm9^>LWDH~Co%9eskdwtb6OL!|PR7jCj4{W@4|#(4V?Sd?NLh9d9>I19Q^-47 zS7wJ(Lz$CTDZSs`!AVlCcER&IYtEPPZA8Y@2~6FK9d!az*o`W4yu(G9{^}TZlo(U5 zP4OS89Oa)7_ZA=ZebUT7R)4 zBryDgHB%f0_xBpw3>FGpi?M)soBeQ8x%a!Nu{UCXftwg|{xT_F4qiy;1=}7?XEUd> z)roAlInwt{sugl*1#1N?9v8lh=WnOG7U(-I*Z!toifjMh*&t`Yv&PcE1^d`n;5ZT} zhyV`_s*OODVyD-#VRGm_`h7>D;$cpxHLY^}4N__qJ6dIdqp)C`XSILaP&pK#%!yUC zC2ff<1|Jc39KlUTo=<~_p_y8IkQd^7kIq$n@~@l3Dvm>FFm)uWNs~v8I{tu!;qwhp z$EV~1Ce}099eMDFhxBENvFT+BrKTN|pKmGI&{(U;Q)`}6>=w0%S9Lk4G98n!xKDw`x;mvk9*0e~!Vj_q! zq}_`kjTag|N`)d8M_ z;El`MO2)0cpp%-9gYKk-OfoCIfhPEqD;q*=V;05^A}GPw`7!)YXmUlFi!AZuWsm-wi(`zW<+t;Et->v8U4C849;uiqUShH3v}scg zp_!Ytujy+!RK<0+#!RM|WYT)~am|t8+1i!%61Om@h&3PX>yifT-96djFeTjH<2A^| zP&vIGuD2-yC4cUrt( zq)$XcQ)2$xg}l-WtkUAg-WGWwP1$_M;|KL{a!hxD3!Lr<5ud{KazCF+AA7=TaFz3?-M+ZW4VL0 zYT~xYZ5HO`2XJ(~m(rhti_%_FXD9Nm7ktpQmuyT7A?=;)9$!IZ`oNsvbeq|mJF(Q& zJ}>TYwd0g=wbjughX#m!wU{(W)AkCn`ExENy_?9^O&%Dqi>y~A=NlYdBdL4*5Dp_* zh*1yFQ=|gw1WwU)9m4kwu*2*NBGS?VIrxYb%clFn5*R|3>$gr)eEz7lPH1Z{V1=@Q z7*T3gy-Vn2g(s8ul$b$Zgspj5M0T>&@Cquy}?^Lt<0oE9S11s{2hivXuUuOk$(i0(JCw zzt(WBuni1N)wMEWollCYb|+Dl?BKK!j6;%<5oG#$ZzHo;)2tZCRQ?nwYh*X!I8k8D z3^7QiX~KocWZVS(7}v>!5m8^A)Q0TK?oRAeUk)SSAkgiAWEU&F^%Y6&#>3o5(tEW^ zmIU;er(HlLMsCcZ!3Oqf{LJDw@I+Dicz9KTIW@}U&8E+WyQNeU4z%C^@OpF`g&!0GwEpKr)EUo z6X7@BJdS&j$ey`^_y-FOJMRXq9^*ACDxa9t9A9R=zOpw(f?w~=N~uYw+_E<Dox56uE4c)>S^WuS(@4H{WACZ$ zKMi`jCY}yGc6@dUdW*~gy|)ge80%*6vyd6?u4sh>C%srxX}}UYnYBC-8yc>)JUYz^ zL{gkF`$s1++|R+yC*yhTY4N-+g=gXo<)F%PL}Am4j1azUik%^ja|i9Yk<>gXrutS& z&C16FCV{8>{f|~y6c%1WJAU{!R;b(6K}z8Z>M&(GDb&O1ugy@V+wDT)iDj`w!%5A+ z4Lt3u6ImlI+(oZ7yw+dzEGyj4lELe0kk>l>EGaCcHDihUc^jE>Dr2MA7e?>2YOiYI zH0({V{Vkg5a})_T$nDUS-$dx7jfu0!_8*vYq)l;?*mgIB+TQWs7X>LP0G z;I31!ngpyaJ$?%Oa=?e4$ntCLwBZz$tAG%|8313g;-kMK6eh}L6=%5dh=+F*5uqe&}IPFr4;_PsA%-gN>N*~jND2FeCc8>M>4quMy z>lnRDt;VH<5uxN0g=%iZRMwxYB+66Pk2EXJ+XWuL0ffWVMP%syMKXyqS6F?VPvFv; z4&OXVlf1J@{a=Kbi={Q4a`bbsz4d$r4Bsg~g9}+o(-?$&*cmN4OONe1ilC0|Ph3Na z0Bd+wi7F(!*yR0gC6)=in^kXDLaxQe8zuV7a!uac%9|Y9pZp5@S~abskJW~fb8`p@ z?7|$CzWe5~^Tjv)^hzgUuXe{vKVg1Q{@$mbR6&rg0482&YflWhsZuKf zEq5K+rTw#y_W~x}p!G}gc?D9MJiq4V)@n+h@L6vgT#B82Y> zYH-AQ7HK4)m;%d&v?(l+TFrW6Wp<2g`0iFZ#vpd9En+n%HsXw5o7O@V)gqW~K96=w z>N`YZh~6NnHC>5;Se+@e5D*8-CNhn*kD(cK$1m*=Ee%!C`v*`-IX(d)!j*~z<3R+6 zciML;WgT0d$rHx;$5VKncv`I)p?Zr{-zddbl*#vsw?L_}8ytV#sbysFJ;sQehRG@1 zZ+xCSp5@Pc9>;1cJmq{6bx46XPx#}$FX~(UKGqoyz8-On2z)9vewq_;b_6&qop4aQG$t87{t|+ee+NAyd#tjq&pX8|LXgu?g&a zjccMA<4o%!91%UIh3p#~mUb_T7haEvR&_7)%tp{&S3%SohRb%2^;UQ~oLsAMf*vu3 zLk)AsA^5VdtE5eFE~f$zL-p5+b(?B^Ua8t;kGP($#pQ$muXjkg5J(V ze3_(Olw`Sddth%d)&jTd1O|1#pQ6sx3{0kq@ND`))p!x%aio>0Q=I8r-!5XjISz^d zZIS+!k=(HJV6|L-RDLgbeZ$3-rpCBA&?%L)`Hx;fc3`xSm|(A5?>wmVj&Aba9^B}; zRjG+5a%a}kqf@PkQyBy>irGrV3{Drrg{)V0&HoZh2vUz)v$wzXr6t!?niMCOI=ad8 z9u-1gnKCNh==U9@4;#rka_uDzpkIq>4K2Y*+a9wgFVJK0$VyW>bimA7s@YO`Sd?M) zj3x!!c=2|LHJ@~xfvi{r>5QJYR)NHcr92<-`C_|DL#L=Xe)a?ep-6iB;XG&$O$6(k zGh#S#@x+g>A=h4PM0bP^d(T?g$*sg}BRXDM0 zJ|$b*oI8w)z9I#{SF7nOnqNmYn{fW0CWU6x9%|J}ruJWFrs=?qjFn91UZO&y1oEu6{IqdJw)c(oC2%ADjOw$vz?ehr@zVKDjMue(q#keW^Rca7MuP&)5b$886 z(3FQePgBnU`CCg4BgA4&ms-<7W4`cRj+jWSG4^tksl3|Jhx}bJlPQs>hoMRd&YgOk zMfAtz+{m5y&^BHu{T3@X)p9K&Z*@fml^iDR?wXmk{@zm0ca@eze`-4xUp%C;mm}sw zskd8c8ofzrbbR!PS@|eBQHtCwDUHE4@8)RLb-5_}g|mTk2M7D@ikOueQe-;HO6A}) z7O|zX5LYyvT|Cy?JT|@DLrUWqqSG!?1V}CKEp>Kz@?v>2Dxmz3Al2!2xr4v;kE8M~ zrgB68^2=aTeUh-%R!4G!4W5BzmwUg7<<8(Y?}2q5YF=Uh)NDTQh4sQ%u1U=^Sn;!Q zrmXmZe(_si5x;gFZqwhMLrr@v zH6zYRv|4@7a_& zVN?72%LdKx=EqDk%BR5Z_SaM#UU0-EKd}_NCOC~~*r?URYT}jV*I8RRn zc={6!)gk_}EA_ItwO{N$vd)wsDRfKn}JZaK()3;5+%$QnStU3#b zCq_2wAsaCWXB3YRQ*j|ULOO{fIG3}XR|XOHyEr~@9C%_B+y7idp<2mfbpR#YuE%hH z_8KgpwT2FR`m63%eD>rujD#ws&YNTGU~#C4kDYZu3%K(dUXMkk0bi?$J|+Z-4=V^B zXh{Zqn@yf|ut%wi%LFX(R&B`+KAMl+6z0EB8})aTf>p&(Gl8`aaLICqhei2&W6=)A_RX=30Y@Gq-S(wS zd+HJvwwR-?DA|!1SX(y1bM?3;?=_Xg{FU-r(y*xs>#2Zn6TO{BZ((;={2c;BsKFoPJE@zGSQ+k>nsI0+jq5!ER{|b(|1;GEv`i%9;)I@_v;G69vuH&gbyh z>}=pU-n$v|5+e#x;I?nw6ZlMu)^yNVut&Ymae(4AC=M}SRp$t{xe96Q#BoMRi9u$~ z4ERP$o*}BwrcSC--6MI%Dl1M-BZ?NA(+S1t1f@IUY&#_oBOblVAQ_uRGiy`LuxU7h zP#aHPNrb07UHVmI9+2(=e7xZ*aPgy;#&;l39dalIBo|~pDy%xMXojy;>b6UoO@%}} z?fXeC!-iPe(dZH6pUU&B655QHXe<4Vdx2B4TE`%&=I2+zsI;h@`ou3|!3p@1dj@(5 zjRgI}=dQ$uWC8H29K2Vr&gjQMgagLSyeq}%!$q}Np6RAYUfBT8;j)pQ17-a@Uq@FQ zMaA8iG)H=h{k{D>=PRL3z4@2xeLjlI@YqNeCcZ3Bw5iU*z&Mj9C(vL`93JB={6Fly z4SZcyl{b7^0<ADVqfJQqB)v^PprN5@C<-;)+Nxs5=zusg&OD=|qoX(~mVzy4)dC&q0HYNGK`VAl}EvKlZormak ztddP?sm{eY%-bkZ!FeKSf%0l8o+AK^k*<%h1oQViMxbdVxewlGfS$SL@xqCd?8om} z!LhxbZ+9;3Lswt-hL#0Kp2wBBl`UXTm^5p#NJ;wR-#X90O-+2qx4vH~GI!^mJ1!mV zT&0u(Gh~rJxp8hOvRvPlg!3wR^K>o`?_-SV(zqJ!0xRslK)p!G${bHyo_d!B24TY8||B8G_4oa195WDAVQjClb5I znp7i2T1G3Drk1Tj&tewPf@NG(#J3Rh8#@{6;1G)%qkKxKuXCbZED@UCgdfYJDIj`Zhp}Ei_ z)9{}C;-}dRz|E`lYVG6n<)P;)&gz=2B%;x6^C<1acXzv)5=(P<{QbXSzfYg>PEdLI z7CGN7vqx8>QLh=j5qZuVtNaGH&DMpusw_|IC-w*G zxNY9flXqTt;;iX~H;p=#J5Sts?&x*1Y0zFg{&9;)lmQW}{zU1xZ%tL!iSR{moSGji z!x#@}9x@$scJ3MYp1{=zSMYhzy5pL-Bc({?#OKBv2|aNG)PKIjl^pgGRgPas(MrpY zZ96Ht)sg2-xmv!H1l>aKSo=$3ZO3)PUiLblb}f>;R{y}gpshRucnmxaOp&YkKDFZ8 z<%TsHoFk8zkirwYANUkRhVSYz^W!CkzHM#daWywA%#A{jyj;CMQpwWiSH^pnV2U3v zQRh$m73j^x{oK|h|5J-LjXYOTxMH-0WzTyJkC&7MXMDy*U?R}ev(YOw2r3XHT{yd1zK>W6&<8QjcU?KG5ZrN^O zy0?sScng}~?ukJg69MIg5c6%6HIc*Su2K0TJE5i5``KL{WEDD@{HGHSFsVFNNOU zrm(iiy?9*<<+Nzq(Wd1Q-(}Q{|XkTk+7&69aD<89p?< zFqU+F#{e#7&WQz#@7BVJ2*R|~wpBhfUNLfH8ZXh2*?Ll3z}suPJ_zm@bFFIU z+qpS;zHy`MoS<$cl2f(w7#gsB9#Ir()q{{t+74iP+{LW*frhquOlMv>aaKjuj@P-h z50ogYZF8iyx*TWga?p1@IV-?;Rh7O(nT;Q)p}1(W(sXLB%ec9?osK=J^!#lL<(9{` zqdx{;SgrUG3Vs2>w_rPA+g$3!&v7Zd*r`cPe{8!-D{c1i8aS$W!)r5LR;2`1Wkoyf z`XY~&BT&~wDg)z#k15kq*;0x$xf}{Ff**!O`QB2b1taW!9ySLkVrl&cUavoS?7MI9 zzJ`f5<&h{wIM;11)7M-q8t(!U?i_F(ti~L@ZWRXqs)aR5l?VRaR3l{`4W+p>$mT#K z!2V3z9C}m+88@K6VFu=LRSBigmAdISs+|(Bh!(3z(?XRhjgR+p$QD>Dp)f4}RslP5jdd@ijd>nX+f zjWD+){&+Ts0WMOVUFw*zzeP#D>cIB?mO1J%m&s+zJQXt4W1)J~sK*lZSf(CVtH*Nn zXi|?BE-9{UUA4buEdq)UV|{(I34a?Wi_N3&*wH|5&lIkzf2RJ42ewmSqH1^P>5)B^ zqiZX$fR&ycozd|4(DP$AOw+*PMCl?RxNp018`3x0yo>P_X8C-2yaQ1l`pI`1E(6lf7`9nDx9heRXbqX zpz)5L&)A5%_YjmZ?jD_6s{CIrvR@v9oxHbyfhAm5C%W^QJ7!$-4isys8VnIwiaj)7 z?%NI5ZF`t9-LSx5XC};B-G_>eR(uSjLMJ#BN?>{kc8@zWA}2nk_4yZZ#!nRHjH+fu z&J72LrajxW=pS%zp15PhXft5-&x}_58P(%L z->{s%fTid2A`LGN{kY-9;`I7wu;H#QMjnSEVd8=MXD0q7;gdUcd$jF*W^kq!FLz(V zeK7nB{qQ#-=su{VZly#ljZstvxc|Fdo3$#NOTGcOsK7`Q=(&?^Tq+44r{$ z_~GOC?F!(3E`&5i45KZL!*a5-J}%1 zG-0c7)q_W=%(%K18@iuXl6VCSk5*lHF4BG5G{sGO3<$-a zicDVr#QwG!KOw|?*VlLgIJlYxswPuF7H+s(jyD8{dp$)SKZ-v;qCZNX0kxuub-G9d z`z0V4`vlx&>aNB9Ao%QWU51vOJ=SsZuGe6c(SNBfcjPj6hi%U#RB^S%xEqN+?+a62 z)XMi8A8j=}T3mALZE0MaC#|!Is?s+Tm3vZ(c z6Z_mTj9aNIcRo{`{zdrncpKG&MV()9gBC7S0~)dhm3N$g6UXodkJ^ddLE1wz`VwMl zFBXn={9=<)yhSJm;ovPcK88Q>bk*Pf5Rs}+D*dy}Csh!97*Yi|M->1NSX=CN^JHOl z;V5|jx0Hx}VZA_;341xh_@zrQo{6G=dSAs{ zquf3250|=*Y#*4`ShWKeAC?Z+KX&)*st2E-iY;gvd2MOo?2*@QDLxO)BE4^?_llN@ zU+!+@D8+vss~FST!gVSuHj;VI_HDrU{}`+sI9&DMg@mso;^O=H-4}ZJB80E>bnV`8 zcm*j{d}a0M`melBE6o1=6<@(5D!nqk^9^XFc=wg%DK*JzAEtHYywcO-(tSX29`!HzoWB=+Lz+c`hYr8hQ9E<$rS}eZITJjr}9= z?UA$CJIOJeHKvkH{KhRAAH9HwwEgo8y;pp!{bWFI1fAj!U|YARScwHhYqzPm$7v;c z9u2u0Qh3|JhQn1mu0WS;fny%XcjvKG$6G_kaVUzaU-$>O5{CcSjnw9K7Q#qZOYV zo%3gUQ@LUu&j+HU2Vu`~52YFF!WQ88-$7g3_6U940Akj)2Sl>%VCmt8gLh0XJxM+E zE*b(j-SWujmPaQl6T4S86c1H>s24@4_~PiCujoAPeLLrI1m~UCaiORh<9CBuZF_Y5 z1N?ks{QdMi_OOy$4kFpBZ^INi#%`D^7G6gaYy3^%ocE%_d*1+0<0?c--+B4TkzY@% z`ruoq`__(wymqWQk2mixe=EDLdHcvuj9D_Te-KCdnzfU5~4A#j| zV;{KKFz#M`vT3Pu9NTnD;f{S3*DT$)>Y8cXRZ3PK|C5V(h`sh}r5C_e_kO2utIj*Q z->9<(?0qd2i1&oVi&DJpD~zfgw<^JH^~tsacc0UAO`!r?*bTp|V*BKMXVvYCOk27y zGToRMrQD5)o%`D!;pOL^`)38XFlrLu_90>(tx3N1HzC*%{n&-pQ5M zbR8=G3>KtMkGAcpJw7(CWo+KX4aI|Z5JUgS*qqNJBye5RyK4Ux%20gK|}G`st-N- z8y+WPO`m5=3Y68|(|^<3SWQkvefG{{l*_UI{TsFlJ@&EJ)$_yj{2GgRKl%-CP`>;I z^SH`S7p>(?UfLmpJa(++_29Q@zHgQ48_juQO~z=6J6Tv%|HOkQnZ?F>_DgQMO|wqY zaxuE?b&@2WFCCO^%86eIea14srE>J5Lz}>z7B0~v`DM1vDm?|82&8vj-+7{Vbl-I2 zKE(9xZ8DC^u`RPH^-`iDocC#PP-SGZdB((XpWa!}ysz{!%v3auGzX=m1kJ4Nu~JS z%eoXlQal;-wAB4`hcLitzy6M6Pl9vEmHskJ{05DEXYyi_H6f3G6bp z>{*oSFG|H3ijO(=2?FodJdG!x!HGuUMlgr)mUihxem4=;tC|)SmNv~Nj(bQEjO~=T zrLZ&t1BSvos~$XFdf~3;un&AfSp~Kf9z#?rF7_tJZ$R|oUfCO&Cwnp~0ybsGmodH{ zjkL|Em>8+wGx4-<-EI;Gp#M6}Q?M)AtxUd-&*ozUZ)Fc?hlKmz-*#9%jxaGkq3y>` z-hE-!m-mV-;IyipYnZyjJK)UGw!>>1+Kvo0(kcqlxtcybZXYJFR{SVyj6-vjtyU|u z1V{E)>;~q$FD$h^3sanp0Jj~QcsmXJg>1%Md?sz1yPUsK9>?y*nt$@xMFiNbw0zJ=>#MXsbs={QW*wH;Z=wKOo<-mC5e=#m zRj{79I_^YY>8M3{K|qYEvM~a5iQ06I3<2st&llq83f9G9BZ>OIa!&nW)CO5ydrK$-d~0O#2}kziIARq=FJ$4Fju( zzp9oS3{w>OGwcoKS#SdtZ>D+pH2~Luow^b6p5d;$I8!YalbwIG6Byj$a76is51mla{)N8@Cu3@og<_n@oILZpA zA&)wawjV*N*WXMv+fT^~=M$b2t(9ig&KW#SkL;s(QnDX{3vWA&1E+lQ;CgRT9 zo+XLi?eR{41qC!LtSJEFP)-|vG1Aq)rla_r~KeNiBC z?AJU)m=BfevT=c{9iWCsmsLrZq48;segORYC#yWILE>B}KWOY}p2lal_1H0ZHPY|n z=X>uJ3hwR)xAD=1t~o>qH+_MGykbS-f$^$R=RBOham>XJDBmxfr}I^OImrdyfff*MV#{YfKbb98Y2XaF zSm{esdi3RkrKjM-d2H46lZfhH2ZQ?Obz>{fZg_O)O?=!yFMhjgAE&MzTR-EqQv0EA z?xFtqDz3dCN%_UUDE^~ft&}CscoTbOIr{OcPw$=m(2?1oyWe@}*O!*|)qf8j#-6JG z(fFGw%Ew7~t$(=mM*R=YdWX>#F)sXr3i?~(_Y%L;Xl#LZDsgA_2zzrptJJ1k092IV z5tkrm;~>GwiMmlvI?74!dN>Nb+;sBx!G1kGCrwd?pLRI$6a zAAxGP>(H+0Q$;(8Ez5^XKbZ8rf-OJCpE}z^vuA2F51aQ>7Tpp^&I)0=0JJ6SxHu1L4^pgh#;iKpBT1uh2XL~}! zuEIG`8yBicmbi3m?X-zXk{=3{cfYxn0B_p<+ESA99_3K+g~uKq*)#p_*%OCkzwW*z zM4MoH`qq=PM=wHPY-I%zyZiA<6z>?Vsb9JrRaY`;#eE$kt-Re*yK_(J;lhQb6JuXr zgzqQkd;*`YE1n?Q_v~P+F@DF#-Z=U0o3{|j9BJM}pNxrF#ANTpD>2$HO*}XTsm74> zUH8q!5dRmdaK#o{C$}&`z8}De5zvIM-r9uk6LVBDS};bZjXX4C8i_b9#$B)CYyM|j zKtA{%%6rc}Hi1NA3d`u13~>uw^{Es4NCf;#bo0S# zSd%BPWjAtu4HaSf%X?{oH*~N9L1UT@&fws59h`mFa}=!5LG#2zZp@Yw-!coc?&A0D z$eDiIt3HLhX|``&f^tykK71`bbk}1r_-0%!g-g#j&Z6eP7gc|1ScP&LYqoDLaUf9t zXMW-Zb$_n~acNom*vTW_KFF;Yzw6KyTmBaNK2=}YgVA=ux%y<=RbyS>Bl?O~ns^hX zt3NUGc*E0$*^mGD+U|Xz;{;e7BzJ$%xhRz5vRxas&mw|>Ir_k z7vE~m(P!80dL9-cV_kptRg<2dZ-uSoSlc(hP+Qvnph-Rb;-?{d4^aFY5)dB0XYiWa zL67lk;qCh2uXY&vVvPM~;eCHZ86!k$)MJ@?tbOUOR{FO7z&0BDe-HUq9f1>sw0+f!F4vc~Y>TuUs z<_ECO;wXFRVCiw}0iG_K(;CZ@Sa88Z05mn!KYUG7WOI=5+ zcKk5~?`}W(eQ$dbaerPqOi_-^JYISl!JoN0BH}yFZ9o}L)>$p)~A zVjp}*v5UE4`o=3GFJD?* z-f+C?13L_y!aut8PM$OMC;f4WlX*d5s6P>aQ_V>r=6io@U&ATL!*{nIdUE_cSOFcO zuRkdrX8^ta6vvS0{bw_OPeD}%fO~lsXxk{cb@?0;^weq}Lp3CLgA}y=CEC)}j^`&Z8Nt)?aYd|FmCZ18yrZi0lrrsA#%WBZDK{D1WdCrh{74kIY`MT~`34cVwUy|n> zfxjZ*Ps_7X;D03Hd*t~Ud2W~IDv38&o(Bc~h#o%z|GI<^$n$x5j?42|c^VS`sDuaP zd5bP*R6Q5!a_at&rzy`Gc~;2tB}q3=!p9~2ygcXXcGTsN=j-x)T%L0nu6Vcc`~K$} zP;@T4u*DcJ(mTsFSaGffCq)17Zv21b-yP4l8f$;vYGm(ibz#>^xI>=)-y09L8iilB zf_-uSJ#c?8J^qawEBU$nBMN?&z@HcRvQ}k$G*jRw1l}a^HQbn{;BkSUC*Vqf_l4rW zMc^%=d@mMwDum~9f#(GNW`QpkctPM72>d#M4+wm=z;6-ws!+bS3VbM(Z%W{61%9r; z3j*IR@CyaLOW->MK11MtEb#RqJj=hJ!V7n+XNACzNk4Uj%K34@vrFLT2>f1w|B=AY z7WiKXe0Qk*KQHi2Av_po_;*t%{#PV^hm>=Uzz+z#QsCzc{Aq#T+oHyguJ3cYe`Q?h z_L8V@T4zI=DE9o7l_Bcbuo zCGgq1gXM_}eA({cco-1))dIgr;2#qBk`VmU0{@ugTPg4_2;20C8|Tp3D~)C6tTb++-@J2I8Vl(+d*(`G6a99bx6=3s z{SMLZ)0HaC0eXJFQsq0%P;_*fy!*o^k_{c3)@`_czFEkcIV!C=-v=o4*=AHDteb_38bv2>WU>|^NM?G?o?P5%}e<+<)WvenciZw*QP$@R>|A3Y;Pv{erg!YXk8gu z)wX)g+I81nx4!-Q4IMXZ?A+9KlP&X% zA;X++U`UxmM$R7SPG*t?GZ9UuC=2yKO?vHuX%EmBrw}a^ozRzDJ{z-XP!y7B8piAN z*tGNcY#zhatf3ga`DmKnYiD(&>?jQ@r`VGwgi$k5Or>aq^it(=G?43Nb=q9t1T{@E z;}r767!T1pV*$X`byp_%&n&~&`_lE+dKy|rrkL`5>x;TWg8*`eq3_IZy{<%I0wsQGPeCYcV#o{rCE1d}aFeYW1uRmGk4i@bmOuvHsLJpSo5( zYp$F8?E?DtPWol&_YwM;f~!fMH~Dby+~B?6>wEt`z2DNI-Y=mtzr3-<7@+Vo^gGzz zV$8n2#rVbQ@@4CwZ>j6m`(M)Y%h!8&@Vu08zggZtdP9rxCHg%_zu6muc-CwTrt79~ zzc0=_O0%4PPJfaHsG3&stgQw#(IZ;>=nH+Y78%twH@2?tYJ)D>=*dT8dJy$wa^ zA%z?_d3PpDliG-7i}W2eqGd0x^CBXv^2*yx9NfHA_zbf$+;onrX}?f|M7Ee=BHm-0 z3S(UO43LC$u7GbkE4PUV7ER@;Q3mxQ?R_--v8&Z0NadIOHEpY|Hfe#Q^>WGr`|5w1 z$}LVMGq-mOI-x^IrYN3}5F#>&M!krIue$-+OFo zd0IH%SIiR2;jX9d3QH_bG_CsDXkTr#Z!+3%Fla;-^0e+JV^%sFFQ#nA0vlt*i|Jes zF%HH}=t|1`Cdx!Ok1T~;4%Dy^RbgFBJur(#;H=;{5g11lmP-Yws(mz~4J)C+;5ZzN z;hG3hl}I)>m{0chfyp+nT(+#iT%9Lwr8Ao-(6VWpt1+XvpO%>GGO;=^(VO}}R6sc> zrXw-0F&zqlb9S=De9Y!C8YArJy;wFAPb!|rG&l9xgqYG_zhM@or0y#WUc=MZ-b#x( z(zUm3jI3?FepBnpb?et{dbdfS)$2B0-`3e_uHLZGY&APtH*Q)N=~~~q(d_8j*s-Cr ztq#>s^x3JLVOi?Ip=Np#NhPjMpjIFR-roWvNE~XMcs(meT~)9gJDQL6Su`$O5KB8T z3vQ60hk(ySq15`z%t(10okpnU8YF(HF){_cqK#mYKUMx@$AC3m{^%iQ1SW|F^C}@Tjp7D|p)o0q|8pp%H)KO;+z-J7sZhLB@Uugt$^zY{ zPN0F_!vk5(gJ3#_h0+4lTrOU7Fd}$-YRzPh{`Tjixg44)luqEmgbNldFoeD`VWkq< zSYvq(@G4HcCIWhCNTK{e#47_R{k$rd$V~QTh~N-cYsaGCUVTl%D?u`mq$O_Uy6d|( zty|w|Pz%ujmod?7EDq&15Xdc)om8CaU?ck4A7T;_Fg4~4hn6clu0z~*z6dmfL6p6^ zP|hY$tMx7wbs*g5iiNm(c?Xuowjn&(F34f2XxY4rI+b})| zjK1=RIAxf)a(H;ytlpN0+a!TmifmiyXs#Ji!a%cn@vu>6UgHu(Nd=j7j(QA?!?x8b&YgLHxSgC1}2^H z+u>W=*1D=~V`l)br!=q!i1Pw*cP6ofo?^jHQS(mv9*}IbP=j$`KvIpSQjM}&h``J1 zKWjwt(R|XDV7anP%1Ys(e<1a=A|!|zz}RM9SDMHaI%WzT>vE#KHcQ+$i(Y3751P6< zT8TC&NF$J%W|)+l`d=Hwe9okg7CM^-pAtF|OL4zZGe?8a7CgK%n3MmlN;a+M?<<kuqjGunl(_REwZ*s zVVRAN3z~9?fXpfOSh9B5POWZlt*M%#OkfR@(Cq1WW!m0lkfy*v16fmJR^4f7p9pmx z&FRNet~g%b+io#D>dwWRrPB+`HD!98V3DJTgu9$Fj!7Iy8627qpc#m&gwU$AtSr-W zqbv&(#L19Qr3e{o?lP#bn)HLZt-@SS6MbJ1DkrPLSZPP2L(-cZah4B<$0s%6b;T)g zxPt*NL?~(HQfd77LQGYtOiX9IkKi|@OL>f{Mhdi>%e9s5Pg+NEtP{2i{m@309sC5C zWlsH%b07i8Z6oPIUqAcC#$jmrYxy9>V+wGoC8Fugt=Uo8f<) z&K<~F3Z%*E1ST$V$k|NHR(0^Pvw?rBva)BwIsx7sO55=yHL1er(jYL&W&UAp!Z*jH zZXkJ6F;-LKfe=s*&nCc8e|x}=6$?W4ZKCj4%cMo6J(Y0L1iXQ9v4N;dJ{h+|n?{Ny zQN)(Y1>G^BR>`@YokG01iFh!Qzw>b)##YBEa;ZetP^`3SZ)ic3=&HMPq8xW{U+(4Vv~@cVelu z1H^>LPGlf`C-c9mZ``d);fWI2R4Ut#mEIFxPdOJlh}b}qM)fr^i~v@XH<}~?Tycd* z)J@3ar$V;~5f+(gJ4&6Ow`oWg^qh&?i6{|XVnO<%Ta(n(*~FGdDuAd-4c0TG zjKZV%)J4S%Gmu&%Cfgv2U4TZ*F!q05*&5ZQjRhNeZlgj{`&tnSC+QaiUU7v{*N!jr zDHbypFd#NCK!0*M{GlH}lseMUVbmdBH0~G+TH{f?^%!*tW5H_Cc-5_@U^Y+B4IAmL z0LZ56=?%D6BYmP_8NK08qTvtlMt>5^uA(>mNi18AH~Nz|7Ho_b7+20%K&%x_9eRyA zM%``Etx;pawfI{XgQbm8_x@xKaEcr=T4Jbs^|rR5_M!In#_Ad>S-d+I&A}X{n`%{S zR@cy@Te?aISvTeahZUu$-ga4ABmHUTKkbbk4XNG+ysXrZriK!}Kx4JN=K3x(0;OIm zo9U(QbBa04Du);?FCLFeBGI%$4ZBD$6YjEcCPE&2IOI!cQE`VdSqto3FSFTzl&$H^ znW4JUTG&76s1sHzk*$@dlQK=1kU7}jm6nlqtxR4pvZ)Iy4+c1ID>jr8B8$^UcO#|-^D zbtB=QnopPrHZfD6sROi3yswyKdf&$eD9mTbX1eCQ6__*p9cQ6Y*GKbNWb6N^IsISV z?f(HYE!@ZYAIj8Q=Kx6-`vHnUv~sb&=IUf!Z>(?9=+OVFH*cGiV)1bGjsF>Awp@9B zx0*~@3pLK`k~G?KIr(h(#t4s@avhWmm-Teh$*6OT7H^+0oCp2sY$OS^x+dzR)%dNI zfR_bj+G+~20UtICD~iPncPHj-nPF;y-L(i^c*0l->LMkL5@XYk7e&O=P`D=-0E6>>UE>84>O_6WdFM@cAE8*XSQ#ZX5KWg`1sr5 z^y{@MfF_Tp%RKR}cX8&-+EU&m#nvnOc3A@UU>3G!sd?F^oCDmFnJn7GL{bcDl7b0} zkyw`fnW-2;^OP&EqPc08y0aBXwKf-7JnX}A8P@jxY#xdNZ_kWMISB^w$xBDe)#A&e z87FypA)lna&Gk8Iy}3MR$D^4-GNxA^FO6D~ikY~b7^c?uwdU|Ojr1kS-)UhTmN^q< zpRNrSU9X^2+GJTfLhPflMzPu%_E&l8e&k*}!@l$WQD-pgfU#|B8y}zDvJ&w@H(a@% z;tmHUA~LcBYDVb*O*?QB@R(`bbNe*NL^u2cFg3ZT@*u1>zZ;@Gb@R+|=V{{^o3 zbR4E`lGCcE(&f0mG%Ki3M~&*#tmBkOCJhv2KSL;ER=${l1p=Q&;K^ZUthgOZIm0X# zoQ~J@7w?P|N@tq6I~GnoAZ19#f^4Z#y={{Is9XbCSAjgr>_RUFz@W%zwe0 zLAu|u*Uc&Zoq@DG#lNXlyZ?n#Z>qxn2UK&?9J%6(P*6{r$!pDjs;a=t?+mpC>9TTs zI;1bqX#agGgQ@fSPf!}1$*?#@|Np*U|C{#fZ?&|A)j~#i{SCFt>DS@kPBjFIHmMA! z`giZ%R^$G?LBBAcF9Z7$g&zpP_LqTuyA1666n-)UJ6s0#&t+iGm4W@V3~Ztd?B``* zFP4G5OySo~hq73Zk zWndqt@I4{eXUf1nTL$)pGO#a~fqktEY)={3x5~f}KJZ=TS55yz9S(dy2m>A3`gkxc z!n;B+(3clOu#3yU7M6k4mVwokfgxP+L=XmA_thtZu#3vTE-eE?cuxohI`s5E24O49 zz}A<6-B<>O@be)U=-=4Y@^?a*QD6%Oic%U@in_1nMj^&E-hLZ(26Rf^!H!EOd z0O-EzN|pAVS2zClCssvZ>`2c`n~tx6ujr(6g(;L9Q}&)`(yguL%%)rdz6053|KpJ zTlFV1@oc|CVv1Aj5uaZI0~bm$V#JzeQ+6PRz*G!%HXYjAbexYb+X}*lG61n*j6Ue# zn#TB(5^jDQ)<`Ui{z@D^=iX?oR4+<4(6IPmCYlD&!#1Q!VcBN)s#K~yn#@EtZtBF? zE#_M4NxZS_49t@(*vMPSbhOvDU=_nSY7~xcbtbW!71gi`WH)&9pXUEBTK(hS*!2s~ zk8Z$Ko_pXLhWUH|zFDQCFb*cgn>loquSD*dh343jXgs=vxceotqp$?bKK?-LpcL_> z!$~qJ#}}fWyXs0S&t3uZgZ>Zd1h$)#SR?piID=^zy?aq&0|Qnf743DJ7qO|9_M&Au zwldKd3$AD(>Vg(|$#IBu(31YK)Tv)zO{slpFn9p%woadib~QB=(^n|xw$yEwJrJ{V zQUqmzmb<-I5Hv5^w5r{zH>GVC=@=wE7xSs+zCt0_xO8cMe}7#eo{#osGj$oeurzPS z>`Vc)jN&STBK`4ZN`bdaINAXIuu;@|cn-8G$yZr;>35;fBo%iKYnv^ZEJ(B- zm}=4qxYwwa!pc~uU{=K!UkuQP+BTa*rBXJ0y;-SjHs^qlHp&i4jr3z3J6aHY0Mx2{ z=yRcBw-Yx}+YBq+oHxHgC)FC)_o6%Rdy<)@#&(2@PCgjRFn0Uk8ul52xg>T6id-!^fJmhz5ed5*HYNZQY&3s59bd!O_<(kdIp5}#VuWH(#oSS2JEa&F^ zHL+aZS7|R`8H+IrCaLI*av;EPir>=bD-EkdL38k$!ecD13+Vubz*QuD4j>Ri?FNS; zxF=>MMhXt15W^cq{RDt!4t_ukYlEQ`x$cXaZvF;Hgg-PJw_%JaFJ;zb-&dC2DK~s? z?yJR%wqr~NU`;X9A91AQ_Ww%tE~Le<+BlpHyVwdllW-wnmldE@`kS~ZQXfMTd5ss# zbGbE@&#hB<*$R88@QN=Ux_srC$`_X<%L_G;7qEI#+1Tw=RP+d&OdHnw=rwPvliZ-0 zYJ|BU&59py&0!QfW8R^RGXv z-n;2NCGadg-!Ex*(DOqA|5JM2C+~kv&#z0IJ@h;z_@AQZFD1_F^t|VO^?v?|R%5{l z^}dXr?ec!B4?aZCKa}^o=^2-_pQQKCoKX1xkGy}GeqW{EcTcD?9HHln@_vGzvtL&4 zZ>Q&#^4>(xP4fO;dZy$(OV9VetlEDV@cUH0AEfs`qu&?l_htD3{vbUc{u`C{AiX~$ zc>aZ+FU$LkS6YoXy`tVPq~~{JJX}og3tmxpE~n>J66c-tJR~@;rS}=1RrS4v-v3qL z1N8pCB>pGqx#Y9z{qywREboufdraPcLhly~o?p@XCV|g*mFg+)i|D=nRrP)~J=^4c zEj>Hry_25reO2Mf)ALrT%boPTOXBSI#s4@x@A;gHe;>X7wZQ+5o(~9~2kH5kz@Mb& zNB>sA|C!#uCHRlh`>!OA6zg+v)k<*A$*8J&OV#r00mdfABRm zFED;SMDOiB|YbtA2P(G(i5J8lx<`|zz4M%PJ^b_G@y4$B%%)Sh$Nm4C5jm* zny@*bnQ}I*avEb)28xF-b=hiGS`vsl1|i0S(`l*Rbe6R%p29QL8&5*{mZCn0r+Tlt zvYa80l>!sP(Wu=rc8Xu4@vYIEO6>I6sg%-Pdq;dytS6vgeAtu#MK(PhrEuA-?4WU_ zbed(p*nK8MStXOPCQPP|-B%YKRt1E+3VumvQ*m}FCt2D9cyqQ=b8tKO)uZ$y@RijY zszuE!*|Sm_5!|mR8?|7sKRUhl*uBXNH*xZ+6YLC-x`w(#9&hte&^uPJ=+(iWrg?3Ko@!!3sXryZ+fSa!SD z3P_Q@-ZmC!(75XLM$Fi}yF;=~Tk&Vz;>%a_hYtF) zj-KtS8cFm4jx3Cr;=}4-YF)fq9ad=P2&aspqVZpayL}D+?cl#RD9|R=kO8|d{N2QV zZ)ikGhL9O!x7u%j$6fW0(&g=Rln?6mUNzL)8}FgN?9!K>v1}qij{$jZO*>aLTJcqg zyq5k%=(%d~IiwQBYH)(%t4uVy--Rrz&&!@kIc zzCd*Mb<^6Z)9UjMJO!w;V>loG@3SK|{@*?BT^}4pz9ZKwO?@(2O{XaTjSY25PeqFZ zh{!u7>?T>JxWLWo9+~87Qv1QCo?rTOc9|JD#q8bMsCQlva?f$|pG0u>-H>VI4WA?l z^E^S68`?(oPyjz63xvG*>=v3|+}%#JS!j=?v;5g@E>`%+?rn@*AKUgu*pPpyq2%li zFqu*NR%x3GXJI3=KuyJsai%BLjp{XK^?I{zK zl%Luh81M+C{X1>w zxh=wf2xb^ZDpwju>GxCm{fvGu(C=lrd+^!m>b^#~i(o3>(ek}nKbu%ryJDt}AGe(t zO+dA~m`#{bpZjRUb}BA$ln3c0;vaE|sddXsOuxhEC8qK$ zZ3HZZ4ZqeHUfr7bv7)(YYcy4~SIq2$8)JZM&?5N?pI-c(%7#0zdhArTpWRGEdGno} zd!~r%LJ{56$l8BLLu)D-Rre}MBdL#u>o^+wO;&3YaS9Gvf(k{HrQgo4nAytvQS4Vt z!%!wKDiy4wSYSVEi>yVa+IaANH)TKCIRy^vMQMMfNhb!!KfZ0Mh%wbiIBsTDr%8h` zno%MWE}ybiH8Fg}&D^{zw#;0`icxAc`Ji07@kek`NkXREd0oQ14X*8UOd1QlBn4-d zNc1GUPTy{`tGpiDtY?+{YWmNSR{1d<|A{eVgP* zX%@NP7hyATjcg|q!rS4bF{GHD`m=WGsWvg&R~z^vE-YtmhBn)aKB(PXN5aKC!yTQAt->Wc&V4m0d3nge0!a>nbj>?(}qpso+SEsGZAy#n~8DI2db|81NSGXQDaof zUR!x8Q-dn0eRopvTUV}Qv6iT8#&!P6+tKlO9(#6v+)mNSC1dQXvk2#!G-1+q8vcPL zHfp&!+S{AAd#Th`-YyjLnPB-83`J1>HH(xEYmi#wz{uvKgNz1*KdJ6T@ukmY#iy$N zj#BV_A-)^+ICU=z>}k+dUwZz)cb-tX$cFaz4cD7`GmcFh+Ss^<)=na$vPe=b9b84h zQPMdYqA-vMmdm}WN`D7MfN$qyrfB=F_%dBC56Dnis|U9%IWE3r0v*GjFbJYCIii7F zsLT>uCx!@`mF;7Hd6-p7Dv#9)mp>+@rs7fyvGf27CY2VW1iocaf(@RZOjE_?W}_nY z*h%(~DoH(u#=X&e51h%0chD>kqyjPdL>ofoOJ<@uVoGy)cE{~TqJhP``kQ;AanH&t z7Ig}t_67*0&~ez!xL*QNmskLk;Zs|*{BT`}?v) z7~mBcjS){K60n=oml3S%+`tLy8yc1~b`7|4*)m)cg+{b^Mug^=5-RZ-StLP@G8j>g z?M)z^{(Z%0YI5J`beiu$EZkQF^1d0ffh{ zE3FB)bD0!ZSDsc4ni*miksfr$3=(2A~_Pi%2h|vhKD59-d-B-ey`g4!0U`ap*f zN1RMpsVE7WA-<)+>tB`xA4j@+ft})YHcoFy#>tCm-^JFU`V(nz)M~1TES5r~aF-dL z2f}S*^a}65T(+1>=~$MYirxz6>&`Rc1A(UblxTchqKa*3S-`zI&gE}(5e?xm(f>-m zQVeH}OUa6v{wNd$wQl_=O@bu5l(q-s3%6W9@_F~dt!yk-%(J1==0qwREm*c%IP~0t zT8kHSe8dZ{LUIR#k`XvXvM>k~tV0RYTNF95lop%}{Vn7Z7_j_;l~yH@JD;fQvm}Zt zUPyg`{;fc=pJU;|Z9m>XN+FjL*}T4My%JwNJjw)=xX}PlhZ%>A%ipaY^)7~HTCJoa zFINvcQG99xqROW)qvkjyzORTRTNm?a$@09l{tR+X;j~;=B6+whmxpig%G*PIp_^Y4 zIp!cpAsXOHE1vA7F*0aJ^F9=yAy&%H^pe2s!{Y;MRBoDPys;WQ1sRVR0$RT?&dY&a zWrIh|bww8Or3SP#b1Ll;)$y&uK}`kWm#Y~qA6w&JXPAfPb=HfZbo44+9Z<;ZQ&IE3>UzM8yX3J7)+7H88{;AiaqQ&uMdR6i-<*${Y<9@vL>#AY z`s8{Y2jh(OR#8WCP&oYf9JbeFTv=Zf)oVH56{G5QM?3EN9%n3kQG=CDBuKu~vP}tSWxJ^fu zW&sqPqhd}m71>5RAPV@)>d69fCl#V|vTQGSYGRmzb41|8EWpqSEM4Z11w3f*Pi(*YoFEiX6PV8^wiV6 z_$NHNZ$4r}3ehIfd=0!)mbMSNiV78pI*)tKn|@4_HKq`g>cc1cT~GYh+t)eV?Hw+r z4<)n2Rv*!ZDrk1Ui}~$#@h>XRNleuK6?-9)90x zh=82R6WimYw7yuYfRlQ1h}gsCB|fxR1(b5^cPMX2F3`AYYke8G8!8r4^|JZ+c3q^m z?6}*HYB_M3MHca{yL_Xin07x8;AWZ67P5*RKI5_CrXVzGgD$+*c)AXKOHE!js~~w; zdS8zbq-ge##2@M>)>E=|zfTKSRv)M2bTDvsJ`)_5^A&J@aQ5*fS8_Ft6U*}QNemim zH_$`PQ9`g|v(~pH{24;=g?1reu65lZesp z_L$Ijub2`Kd3I%zd?~LsRbk2LZ9L8e^vVa2bclPq z0wxp`r{1mywoZD~S_X|nhHowl(ws?awm%{z(PbHrV@;mluQjC zr;*@Z@x}<#3CpJ!^w&v&6}!_XN?B~%D^8h3SXH0E%Anb99@tZ@L9PXp9{j$94y&dE z{F#ogb=}|)D3%@1;4VX@Ao8{=e7Fj1&mP=M2;rn2bESaOvHiJxv^O0M@C4LNnx)oX z5s%imSk|Mte1{~79Z4)`{zelY`S%2taTQaae)vo_QCAr_6gT6qTywxfHqTbL_! z#SFzpGakM`Z_-?H6`2wN7sKJ$=w`)M2m|4!QTs!F;aSB~gF>5#qYdX%3(hxdBDJgw z)v^Z`Tw;dMl)i)x#k=APa4<@m$>x3S6*V=G=eb*FX+2J)%;A-!7n%pIUL&ZC)M-T1 zr1g*@#d&RnS;Q8;uHb5_I1t_V5<;Ys{YKUv`tnv|(<)}vi%*y6c&R*Xz2U7-Q|s&X z_Ku*07SqKqgVse(!!PaWb5(tWgq!@0nMw${E(+>7^#&Y4>#-0YgQeFgCV4X#`V)tS zd><1kl^`kVEH>Z3_7ShCSg&Hd@1!?)eeK08K!E+Fbhn!-jkoFRc2*Eqvj+m7V>vc9 zVC~TU6eL34kYUD$S%)a@o0YgO3U|r&uU~$Hf02KESMo{|daJr`=WsG&UvUG>bD*s5 z7oVylBwGm%JxMIts&VI!;^dRKGzRFeCo){+X{A3O!Oc1@r znJd@N#xL1oDo%}*%kdR`Tzsk{6MR2fE`vUY?4L6l$ejXj4@K|@ppV|>a8$9I%xlXY zytI@jh9DCwMMR?zwDIt7D?tIN^h#QjBtcdvnQ?--H>9SSame#dtz^cgby69S8znlr z^uXUQEgD!;J6UIw8ua8&Z*64)=9N3+vxV@?BeeXLF&88gp4pQm7s)3;*93|>@Z4jq zo0i5y0uZrAo_;ul$FDhduNwAr%$)l6Otv3up<>E{>EX1YH^a$2t_|QQjdXTC1a4^3 z8s%A7DUPT|UlY%>SI&sRNloyKm^Z%Ane^GGw$^sKaoyoG5os81g*7BEGGgn?_?b+I zu@VTFhFSidIRW{O`1t6RZ_kOBDIq+PhWAkeu^Cb>s<<8r@}&$j^*~8#fi$VC6N4L6 zL3FMlUB0ZIoL#0U%5cG#F5??X%B-P$GBsL4?c?%${v-^HL+sMko>IrFqw3a}r03n5 ziUw(do1;kTt{IrloEcbl3jx1cB-U(=2HQ!02o&C()jB<)QhpI!eZsm7_T-mf%wf+> zZW{MhDPa1bX|KNXlr<1~pAkd%RxA_d;zf0Qb9ZD3u^;Iql|hfrC8qM6r3Qi$LtLau z#iC@3c}EQpU*4jzU`r-fZ&4>MiRfP|t!+N57J7Mzt~B|6qcs4Skn zZr0&NnyRKvkA)0kXIqO`HM~#5cb?ZWjDRAQEMS756tnL3f$TpI^ zfuDz@-G<(wbzYs45XFRwWJ)Ar_tQKJQQM%ksNs>-scl6iji>EsW%Z6I)70LaPZbi5 z-t2;I;}$n0y|P~M?ThkFq`VfXv5)9HR{Y65Y-0VQkYQO6K=8XSKD?-vE4%s-h^A7d zEN>^0=No0>+naRvIu+j(-5RA?kH&;ea6X>09g)2!ZCNsIt#ag0w%>#X6tWf0B8q(C;!WL}~ZTEVS^N261=!DV66wiz&s;|M1D zz+`csd3v>};rJ0{vI>>aswBd4SR|RdRqA0agNcaRARBZWWpFBdBmt;0ImFYk>Fi`I zD$i5ku#=3!SHlcVNnZ_}w6RgMNou>8K=aMp?ZN)6>O05D#*$Gs7sl~-9v5Kl{6=TI z*CysYN>Srid5h5RnIR${8b>6?X)>qwWLW@K3=(f%61F-n0?Al?`D}(5SsE`mTW=|X z;?W=lHVZy0PaYJIcCnGeEszvp7WwobgDCscQZ714?u)}+sfSa;mlE8c){!*KkGecU zflaW2>Lg{|7$7iwu!k!>X!gTI0mPcwsLs|K+dQEbne;>{0a3cX;23tnvWcox?nL|I zMV<`A89A|N&h`s*jEj9f867GjaTG4hWiiw_SZ(_0_@yJ@piD6c(#4dLdzyJoEdy`L ztkBL4Ix(`e+L8|mIjoDwCkJ@k=+S}HitWbE-pci@oxsdC@fOj@7~3JaeWN(_tjS-* zbY7qH!ZI|#;=LR>Nc50U73;IOE?}@|%=3A99B)`6;+nn0RMC_IL*8M1f>bW|1rxcrcb+>q`bTm*(CE}En#nr8zyy?<6ZTZL zmuApX(DZn*p>OekA6+oyLi#y4h-f^>}oA;aa;JpO**p`Guxy2+f6Tw z2`gKuPm_E8*KRev zd{kc;1z4b`l#0VW_C~m9?H|O>VV#RDWA_sWfQhbf@ZN$F`JiKj>#$GJ&5 z1ieCs&S@xhHlv`0#j}T3>l|yB++|hh*rNZj$TK6N0o#Wz@pM&U_yB}FU@SgehO%w6 zx#^h}3SAUqC^<{#O9REbzdkZGgL-N?y^-Wids>d{D7F=q(q2y7B(&;9L_*~_vRQu! zLYuH0t(XZ~rg&@x;2w8XIPOM%LUs?Edy>5t%&nstMF+jGYgBUdf876f4VWHAVe@&Gm?>bJI3MZUgQQdLrrcX+bWpjgABXZGR zMcgKt=>rdDr)*LhvW8%AL@)t6Wb@M9%H;$^c(kbC(Q5`<0uSVbG!E_nX0BVyB%86` z)12q&AL(pcVyXx%g*c*;Oy>1LPC??_p3G?nm#4sid89SLw~5#p8^BIBPTN~*hey$c zls%v~{gN?RT5ujjA3+d|tL4H|*&G5kQI}e*E;Tklj8~ddY^o|sNZpW=jeFHhiqfiF zbrysz&fZ{&CwD|6Xc+6%ao0tw;Qfr!q>5>^UC3Il0Yw7S;k0si$I$lp{7JDBlQBgd z(@jBm{0`2kUzs~$(nz&T%MohTC)s{K(Texb)MbyV*!^CQQ}>V#J@Jg4l=Z5r7uB9V zmq;N~>T6RSOs3CFbpUBCPvYXRs@8kR<}Dgrl_21nAt75x zRyf5!zTw=#+fV*!qdFco32^qoBhoZkX6=eJdv?{?~yi zyA9glIgQa`ES&6!L`4ym?8ND4ab=r$wnHnEw_l+l=c$&cL7_t62}KEUx?++nkhs!{ zC6e$7r}d8|=GKj?ucXo{J|Qqd5YLZ7c7D`~pW>9bM00+!t;9@3}M z6S;S~xZ5pJz3A{EQJ4|JuyZQ_?)@)%Hh8J~Xhx-EJP%O2fUG$-j;#g5O~f@*gGH2# z!Hk*6PKx82Y^$!ys=+W$RX7-P4q^a_hQWPjPxg>W53Bej@vqp4lO#c@k&(fBDXuy2 zQEo%iZjzg^2@_5E%EDCNthuGgMZcx178AywS|MfCJrsf=y?e&gUs<Imt%VyLeA&cc@SEE;Em%vISu8i@DLQhVum|kl8jBtLguUEW7HK3inVy1}> zJ(D%Bk6zC%OK7OE{y=sZT$ehWdH|{({c(usk-jZX}xTNfx*l z&kP%%4(1hJ(a6jqo)cN7==@dO0WkNiSPnf-JyzV4x(Q`AZ>i%Mv_9g=yK^{*%?A{< zGTo<;XJdNk=(X8RmN;HULl20|Ys+2rSz8LpPI5HM6sjg|H*?F!SWW)6_m{MQL%R5|574 zjU#X#dKe*5a1r8hCTTwR%_De}!r?-%m|-hNW?{NqcN(rVl&AaoJ$VGRAn3 zx5|D?tWMfjc2!Klr%L`?pvx33*;qw;c>5M>uJ5w6J(U|l#TTIj<08n@fEZCaPio0* zP3E(5Gy+MNH+bp@C1?2zG?CJ^lTb$KN@L;Q(qJpeBoi{>fRai*msQfo8u@NQsAM}( zx2Ez%xC?eipmDgV*2y;%EaUhUG`&R_eN5VB8+37S1QEBV*jVc=@>wJ~Sz#rZWwWgS zon$|h>H*fRFPp(~f~$1s9d_g%Pk_U0L{XG63wLdxz59y9p(sthIQI_CHt%=8@}X z1YLZ>t^|2e;_&=OFffkTOqa+v9HkaB%9cf)XQO_B){Z8%O0cfIWBt0wx=q2IdN)H~ z$xm1AK!G!=>n97)`iozNPG*zzoLz4g%bRanPdb8uLJGji8j*71fw*t}oo z?wbj_0j^Vs^#}&GL&MHLxMMxfof;2YlKeZ`K_7mMOU^_9 z*pyruXVVPIXZu-9OlJ75JuTo%`}tuaQ@aNxc~)9@47h4GM^3$m>!RTv4`|~q zN?w0)xt~%7d-f)J+rJz}_i_*R*#;$!o(pFb7jNKtvAtuOLSmAWOX#rEXJyQ!DtOvF zH2-_1WeUVURhgtDes;#SWwc0`z(%6QK7ie|p`Sg*@J# z^U@?YGMzzY7)s20<&l?KK|Y&nZ`8Bfeo?3VIJ9U!rUNHmPPVLV=5 zAJ~?r30hX1S!?haAZ2ccHs1uLvPvm7c&vM8V@!XGz>Qd{H_JAXGVTMQny^hKHhHIIjh{-K3V3Qf~96x zO}Gr*$5k^{H7C^6a}-Z1(?rcWuUeDvc?WnB%DNmoga5a^vw@SctoQ!4%L)r3A|isK z4!Gzd%(B3W3-PkAyyz~h?24G^GCMQ7J1{#l?##lHsHCfsQlg@wqGDoVp`lSxk&FJ_QQ3)8lvtj6e*gdfy6*eBXYK_&o%1};=Q+>d<<8vS`~Sb*-{0taH$s`W zqq^OOv>DHF8oU;B_BD%`p2(C$!b2+hC_q{j*407>VDX5}q-3Y{QdD{wvbc((%4Y?+ znnz>Z&Oo!C{GlCA@@~Mh+MM@r$!bE~U#p{STUGRg3*+p5DGP9sCkvUCM{a=&`Ve(i zcIw}}ZG`Unu0#=43&jHUFmD zH2%z5$6K$D9C0TZbZ1sZ1@xjpOIRzF(<5go?@t;<%+)ARmVnAhb1dV|GUyRR%gwpW zR&7l^>k|k?N_M}mqQi<2AG7?QlA=Z_1oTA)dift`WLjt=>m;51g6Pxo#H_R9g4e0C z=B^gnjYxMwJ09qR*v@y4M+`XcaYRNtf;xm~9EtndNnYmE5lT=dF{igX<8mxS(1({2?VvPaS#jjlFzg8F3jthBDADbtmRWn7JV>Q=8ZJcdr05p<^1 zj-{82cqjC8o@Dh%tc4nO|HEz2rzx;`pc>83QfHz!nzojINM~JIj6rjxvE*0NL6EIW zdKQ5v?)Yt4X%UlNZNuUPODdacON_2$Fim@goOVoOeWPx22o5mr;uecu7f#7hj%>A< zURYu44DuidRk9sPUTb_Jc5q?t30b*=8S$?qJIOgrwcrnq`ZtiO&T1pzf2?&wQLmeIxV;;CiYe zbwx}a^F(xYkWZh%x9-fb$CnpImo^28D^t{&t`CI+iy8w<$M-SfoQTDdZo*NXIQGmt zIZr8m?7Ih?bxpK22xTW!kRrYo0Hu^QRLg5$sF1UE0tL*A-nlP4r46Iz8ZP~a*OIw| zulN=gOTyjV!El6^p*a3G_tbdZDrafXG>kK@Gl|b&ORiz3G%Tv&Wgf`pvR^6Il379vzgU2fD5OLZIwkzEg3RGsBz%px&t2NmR=34m_pT8arD@ zBUz)IY4?m@c1`v141+Aua=kDO9vX94Px%{QIik@Q9cSX3Pg}h36R|a;J zbzhAp(ti)dNUQOX83mFxfpmxReP%yfCM!la5rUPH{kXhcnP; zImxQ!6rUkOKTMn$HPZM~4cv)yI@tO|G^lNh^2%IuK1F*{S`wD5Zrj;UJa_x(?B^VT zmu-uEk40-L9Co|^`p%lgvVVj}5ChJgHgazlH=8DM>ayo)Q+!%Y%6xS^)UjM0(sSpH6a|lSZ%ruNPV*e@MsfW@&e|RW zrnvi^d5wW9!3z&`+kk8GDJ<5>=i*43U7bMYj_~Gv?t0M3uiHF#Poii|(H_VX*bDC2 z`z?WQ_I{^gQFTH(D3tr$PoAX{$veoyV*YLAoEEaXd(bOs$SwSYp{=Dk00gybwUjS{Vh>?{K4AD|c2gng^|DEYRX2?XYMhH(O`f zI7|IE+bQ?h(9A_vfO_tKIffgoZ8s-qrC0T=|5Dv2;2oaFq`arou30^5Y!J>P74|7c zXn7Syas&^k$90X}qG1>Q;TCno_c! zr85$so8mqD6P#1m^u9}L!=t5*k0I`yRVHgyLV>a%?@$pchZOU9-oD%MygJIYjzpmR z11gbLl#;eNuS(3GWwyt5cz=NmdYVaktwRTX+XrcT*zFD70XK1-w)Yk0v>f?;?(ZFQ zKO(=AUHzC=r#>Lm+1$5Se%m{)rSH>$mj4hRrb|KDa3gv zz;m?iw3v^Fo8pmxvnbBhZV!$dot~NEJ{(9IxJ9XJ*Xm?yjUK);wul30UkG|4ZC%vE zlxw|Y3P|sC=1EvlN6LfJlZ^A3J&MyEPk+vhb#o9@>w5yZSt6ash-_fsuCcxM*YtvE zBWg;txcjoj#-!7pb529cIt)dxFX7iA8gv)>@j6!}*KHnet(vqCWi**vrP*b)C^uu; zQpQE~kWe&ek0^D~x&mp9h}$RC$i-Ar9a~G%tPv&CfRR9Q+9sj2?*J58u1^cmr5w)} zIz1l$Lp@EMKDWU+YXqU+9$FRSk?YP(JQ!+8)9Dy={HB~I>*g!xgjw@WESa^zH))pj zc4jg$w=IWo3-IWPK2uk&#FMq=)(F3h#&J_rCMeu;-wG!^;Av+nN0zz?W{iQpcg4A^ zH)|JZ-#pEuCqogh3_m)i9H05xhhQ*5wGsj}eQdk=0-h`#8Cisage>D5B9HXh!3R#- z9)|{me;4PHbfOO()MGPkKkIyfNG#2#2Dw#dEb&j;GV2(~(|7&va|X|^_&xX7@6NQ? z8YN%oMR|@B=okT$gB{)OY^%z7=CO%#w*VU0c4l3MaH=Z5g>K<=A@U?3-K_RESAfFLp{bPv^_@6@3;!=jfOsZ6kj@ zeXgS>HBnk}>6zYCm2~JS72yJ{`Al>2q})BEi_EaT_$;8$_H?E`b)^@iWui3pSt&=T z={}T16DcxRb<39Dc0OrPWb{%G)`dQR*(qnO?xt;{)+oGg*499G1{kQra|l<-9Q}U95QQ!-8P4%T$Hw z&U0stg>zV|8xpKj51ZO{HTtF^30Xhac~*+}sYL3eaSDG~ojAEhfH-2^Y?@cf-McRd zC8jUZ);s4z`T`!>rQ*oa9=o(7mq7a~xtiut%?ePi6P*Da?vUuin<)*NZI_~JHQxs_ zmrn!awK0^u<7>#>tcIk=@=MK`v3d)}Smz{k)-hI;tq#hm3|v>V^Z6BgNP}6GK>I@7 z@zRNUyRaE~q19))DUob#C5?2fo>{L-b0>65Y@1YooF&XcRo&SXi4c$V($qyCZI@&V zZ;0ekm^Fa~wY9YYM~*kFX+=@@CXBQmHyD5gGbS0G)T#-&L|v>uyazp z(aPb?omRQ9*PMv%InqGCOa4pS?XaxfN%QDL@ciuUZ)bn`(cQctgc@6EUIIUG)#XH)&5}h;|LVLdHF}kv?QEIs9CFi-T zf;d@7aY2QNmXA1k>8ypIIR{>JI>#^Q&WAnTX?F+H*LBfM9v9raL?LX>L(}6F(j9eL z5;ESZ*SwlxHzZWI_iw40Wd@YJ+Gl0`ygHFw%VSEh@LD5r&A<;}zoU$4%cf46NNu%x;%&5NFGW*n?rT|!WHHdJZ2kJNKKJNYn&nM>Ad;gc<=mifg`EGE zO2%Vh8C2COQtq7zGL4ukOcU>>Ozl%lN<=!J!s+vhri{sJe69dJh{@80P&nMxL9Op- z#D9PYm56M~lReh*B!JoavVtxXFk<#yNcv9NnD^d;}`O#-dmgX$Zh!QmBeOh%D;0SU@2CUrn_nB7&KZ-R?Ua2NgGT?1Y`o4 zZzpfVdsJU#+G8l5((bv|^oSaJ&e2XzyGGU`n&bF#`tU;dFmp~ZVc8pyNCtDs!0de` z+D>}Motbea#>qMvI5V1qd}VCTJPeNkaBmp(itMwYZI8}T9(r^t6Hn8iLNu=X9q#X| zW%pe$vW5n?!fR!>i20=*6r?F5jp*w&P7lQl0%-3TH}iR`;x99dPMMHwB-@iI?#~3> zYj>QnDB7kgogHUXYNA_5$Ov>O&2#45`RKIb%j(rQLjip32G8-Dqc0@iX7u_ZGvJ}~ zXx165)@l^$-I0)%UB&qmWgTa&tSlPiRn~oB(Ru_$$)fTd*LZ9vA zjNQBY#{7?XA~$FS&IC4V4fFbXt*5cEGFV;RkTc3+mg0&;yYoH|T*);U0XmC~^Fa3N z=8QIvdsBQpvU_fukB|(wD(4(gIL~(5{FY3`EH!Bg1BnM&-suLF z>@(G^g06%egvo@fLITYl1^H!-Y`gY+T{RQ)v&ns z*r}1uvP>t#&Ky_NnWl1I_IfuhCv%%$;pnPhSaNiq`I*LqLUhnobQLOpewMYfLv+Ow zE4}Uy=>1}em41aux-;aKS<(7NKt3CCnM}YcD9JGpG(x~GYJB{jx6hz!7iX^2yz=*HV?IZFH zjb`gRA)!utaI$ZBqN9|qsH3bi<%IbX-tfAZGggCtUEz$kQKM3i+qq+K+#59;72<0G zG`mVZHfO8R!sQ@ce;nlLpK3i%yqcHqWUp|hiK0+I&l5?t%|eQU0lM6!W63J7+A#8JO~nrr@dMd*4VA zCS4ZqsrX7=+Lg9i>)ylhxfkhologGehr2^acC^8i`=ZUwc+e~lWLt(FsrKAH>_}3# z$x$6lWt=l@MGtVZgPVZ^e8P{9Q)mwcH9M)Gb^Ptzd*cxAi$OW=Sy^Rcj)>lmmrf!y z+U(uq=EeZ;g;Z<-zXE@yLOhb~9UU@be2z`dd&d|N;u17WE7YV@VamHMxzn16bT=q~ zJmnt?b4kYM^wE4SN|8>P)1{^1vUt-yrB4nEB(a#;XP|eQrGxE!yaD-v4z1!<`vJ56 z+PS|pO{ZH^$jRFQSC3a|M_O*ll(9J829>s6maVN+Gr3Fjm&DR^&2VF;D-uh3lfEmc z`+U}etMzMZWBR1Wwc@n3dc-6e$?f6k!5gpRdFq4emY^A`bMlYWH~Mi-K=6>J z_W(SOtK8>42jTJHr?Yh@@j*|+Tb=CWJnyXIv+nH(oKI=kJ@!IIf;so=8>zZFd3UN- z;w}ax#kza!jC)DJY~5$#bd>4Uv_60zlHHxrRwv$gX5MUJCOfkGDow?*8Bxoca`GO`wjwf5aXzpBBkdOVGV7>&WsN>4> ziJ*a1Q(PUl+Yu6B5Ye*q~!$tXAYrr?Mj&c&(v!Y-N8SzND&s! zTUgm7uPwr#G~dK|JbyJdRaP~+7O~KTFRQ@on}%s@(XS*%?DkXtRhwt~oW!6Zs?u^!3ffedepVB8}#^Q@rht zGnMoL^(%0kx#KOyqg(MTpb+ zhS#S~ar4~NDJ^u!)YS560a;YvF*TBqc^I>IZfecK ztK_J^DmbA&l!&Febl14JvZ|i;u(>NGN=TzKCq~Ob+GubhNXOdK8Vx$2lg?nZnSAY(Nh>phLDHS!_E|pLRHf%#-EalHlkS+siB2BcrQ|38)fum9ARl}y%ur*Py|E?Iiw@#@?Ft(DJF?TEzVKJgj~ z)YR31w$faI4EIox;=G7n3|-!qo)}19rw>`2%ZZ@1BV@Vt1H|z}j$n$-x%HJN9?`9Q zcyNTK*Es+31>e-Fu91nzz~ZRM7L~draW3~Mu322!FkZ%1LXz|4+=z}=x?qUxXJ0#e z2i!d?x7WVv7ZhmFBcebZ)w`HoKJscpsMS65X8P8-)|r*a0Ots&ImO=~+iC zN|R72>F4vPUx(T5(wgF-)DU0QPJu=n%V>{;J_*E>wzEuM&~Uv%>sAGMHWK@WZS^ zMV`6ooPVdf((TeV;GdnevW-q{<6o#*%Itd{$k|ewa4DfHjT0_I63G-*=0OyNu?}7( zu|QVDIS(YsT4BLE<>S#%YtD9gxetpg1|rTCIW$X&_dQxtbPfQu*}1`%y@bGBDOXId zPDK$(f2Wnn-}2J&tRjvKZr2YD)phk()SbBRQ^{1AR`DI9evwzQ>lWS{+u140-aT2? zJ~xI=!a9*W>qfXvTlBzNUeO{#nv}?G8$zD<+j;71cL!dY_3$Afbo$t;v>u{E)s^Ok zsgu04-R8HcJnLJnXa6U0Wy>)|La_I;)w_frufwRM$rezjHHR0iKy!s zk`_-Y;Po9#YM1JcwunsatIc6tF!ckupzMRSVg6I44p~z&`Go9o^-unQ`lskGp<~JyRRtKG zw%F=pK@o0kw7De{7}utkU+d$vXfh=(yIDwOS0Xyg-8tdgZCn)%$76JU{4BME2dA9- zX)3E0P_Ur5!fWWaOr64&<(08SB)K{*BZ@RUM~t4Be$>1x7I^zmiDWpHau&pAod-gj z3nFM;l3z`mB1-*TXKp%sjLM9n(Q32ej6|bEM>HbElQX8q%`x<_<%Bw_8pgXePMGkY zvy(!w8p5K8hD?J=v|W>Cgi~&@&{vglL(mMeIw$kkoz~Wv%>1UJ5x$fFZd!mgchos) z#4Lv8R;w&U<}-L=ytdaJCS-@Zdh~gN$+mmj2qVxyG5Lwo!PdTIXLD^1^Rm)B>Hw5+0F`cKBIg}K?+u(Fs2}fl( zKjhUgG@ZqMqK95clw7_HX^y%e%ijzqo z6D5mSyVINn05sJaUn67JVH$)B@g{W>>Rl<_1th&*m65KN7WlH7Tu~BONMq*Cf)>lB zD5rj2>cK5g-WpCe({NB{jA!xVves61gd_BmbOICC8N55RGm2)sp39wAU0vdMe|ot( zA^&TE^69Ft_e+svv)-OQy^nXN`@Gw&YUoywaL6189$J;;)bHrxFRfEbOQ-s}!9+W~ zkfoi3%8w&co-H%|Vt>CHnduj2Nwg)p?DzGJP+Y0fp#`+7xzl-*Q{IV%y-s_Sw5?P@ z@%{f+a^z5%?i)`zVd57gj+XMi(w&_~kEvmL-|2k%3G1NvJyx0)d-!WCot$1iefkV? zW6qPZ(i8Fz&Es{*lqswtxg1TowjIxnxx(>iTPV!;^XNHJI}s+GkqvoGcRsCS8-moR zamEDg^Bl5TIHfYmYY zZ+Jg?UZD9~VDx!2e=zfDO7*w-JK#sW@&@tesv%XXZAg_PpKbq5LyZ1HU;Z)h4J@C> ze0G-og{M}jlTY<<&*yxwV&?h2ya{aSseSAJ=BdVg4zIA~zXkrPC7&HWrwpx9Lx;K? z{=2}IzaDJe(7xTj6Kt2o=Va;s9oS)u7iRHuPpeX6PV>0W^O*@&ahe-G(_B&hw1LIF z+@t?-ul*Z@9<)Q%*|S_?hCriHdA5P!TJBUIKef%kw3cc;lcIzxgAPzD7#;l_(wm zb6q|Itd99mHA(X_i?0UT$ove1O>X#o1#F+zKUvFfv%=@(QB`W>C`n&aRIdNmfc1=$ z^fT3mKLoaYl=zRv2xo(DTHw0xmtaRnN%%|pFDfjnbNQ^ZkUq{5PI;fgugT(fg6&{F zTG6~Ch5sgt{~YX{v&4RMH`smKE&okDyGk{jE%7^@pA@Mb7T*B2jrj;QL-S0NtN(jo z2bd35AJY1FTJooju2Q2%6Ca>vDsg|!rLO!Uuw|pgeY3RuE=ztR*w)dKerBuO@ckax z0nO)V{ktvsA?H-75$6!^&lT4+lmd~HzwmN75l@JIN0%AcpfcAX>cmzpq;PyaWr z_#xNpbb ze7IG9%mZ7-{B%{PBz+FI;{W=9+y1E+c~AJ>3cf|l>-ym$WqsZ!`^N}hq^NQ!PfhjwSg)>I$XHFDravV41NJ|4aBuk*cxkuWev^#!CEOsl3^Jr?{fUU1oE$1?!Ou=!u%vf z>rlx3uUY(Vux;Zcd|EUwu=2-G!HzILLxnXjvf`)Y0@P0z5IHi{0pVarwE?+`mnTy1I z*J=IRtoYjswww6~)v5I#wA^WX|NCGE zgOa~*P~yM$Ek3pc?bj0V-;G+n$!gzS4Hjp9in>XO|J8l2{8M0iOC)`*)4agqe+Mg^ zBB=L8%lJ@mri!YyK%D4XN7A58TP>Z*Nubm|R>(Tmatnl9nwny84 zs}lbYx5DoiV23A3_}-?Z{g|=p?<-4DewB**Zdc;IO_uxyu&t$%zSnE}cUk4vkH8L; zO8kC|pA@NGR{lR_GV;%43Ew-k{BX;E)nH2}i~sIquGC12Zw1@Q{A9I3iT}#1^64Ph zQ7!**euDI6<)88?C_kqN|AglDr^n%^sk?-a9c|hF0NBncl0P>pvETmu1neEH|89}@ z@TpS`KTX{ud~CqdKNo!2RN}+by-M1BwaSO*!SM~q{d3_ZRjT|F(Z7|S6scm%fA@p!xJ1f_$CboS zfo1<8u)~*#|3B%czZ~U5x!C`N%Jtt$u(iyGsBQcN@n_|)r@{7=OZt0K~OiH zzfWoTGRu9Vr^A2KiJzsO(tNlTziYv6oi6ETyXF;DE`I`S_jIxUY0W2E;qxP~Urm?% z|7p!jEuKFE@i#;K_ZgMz{>#B4GsOKnw0xN*|8cM_GerM0nwML=7wnB0;=X4!pK0-T z!3KXw_-B>WpZ2F3td2SQrApjaVaaE}Hhf6(=X08GveNI1V6S~h{P(=pUuLDhyJn(( zn<@JJ#^=6AjJY$u>v7m@&XM%&OrB zm45;JRc-&vTK=Hbe|-Bm_8$Q+tdQ^{UYHd`4HZUyuzE%1hVQiwAEmynSh&LGYrr?L z{xj99KJqVuy{7H|4nHZ*>z(iVzpxVRk4h;&zMI9#ECx$eO8NJ_EZz@hGuSTXBh_nJ zoYLQK!46kS`ux6<_KW=)T!s3#O6>muKSBDn+Anv3?O=Yk`WLN#o7KPh1DL9o_}#DN z=UeIbe6UjHgVYaIZu(pgwn_8XefWN`1DgNHhmWj*{u<(^oA~v_{~cgkYQ%j%<|l!? zBFlf@2Rm3J{{IO-DbB02+<#sz>YrNTXQ-cQ-eiprtpwY^e6)H~^CMRM^(NT+%+FCj z)4a@Tzs{eF_SIam|1BeL@lS#6oGaz)&sA>xeP^y)z8(RDc^9m30r4T~kjf38`C!WyNdEhc%GJLXY@_DC zen0*W*!!1C z`1|p(m!W-jnS}3Qeo~yb$*R9sfUUhu@G?oCf6~0y zYJUx{L;Y7L_8-xFla>A(!P@IY{?D2hSo!C1uw9z}#mHOj$3K7-)Qf&U|4#s`VLsfK zr@?yaC4Ic7_3yI!r#ry*)QkWB%1;6&X~}0H+FuK+l+}LmiEP;YDJa`}zN>%hA8PocKu9pXCF}{=7o$ za*6)|dAa%fC|JQ_aetwY|1JcpSSppSejSbVX>-ym_nYO>;Q6WA8!{e9iPAM60k z$$5j+U?2NWX+-_rNPMt5Mf{gH+#27g16$5~s2buU-vhQ;^Ha6_ek=X{39O(=;%BJl zHCF$p46Ii3({%hSwfwiN$FYZ14Js=!G?<^nxA6a6;=TvpJ4?pS3DmCm%l0R9E*5O-VjbBUzn|Y;_Ka_r^ zWwrnB2itk2`2Soj-($6Je+l+J^E1?WKJG7HTBYVM75xF9^z+10H-5+XxPLeJ3ri*a zkM)uNu_Hf7o$r%B-v&RrRKl-FyZ@loemVcDDmC#c;sbp1PX??9W?bIMzUB9`V7<)! z+jj#$T&0R&F3daASN=+{_79W&gVlKLzFk)R_Gz%)AC~gtBA@X26PUVM;&+0N|1Sos zV?Inx)cW^Z?W0v-Jy(l^XCz({}%&Wca6BOO!Fpd{QPOKoy<>C z7whmTv+Dl?U`Mq4G|ii=_RD40qW^v^@qy|R&Fif4;d!t<%nMby=F6?}rLeh54R01c zUGoM@{z|a+X7S$)pZLEWY;&`upAY46`_J=v32eWXpP5JFcS=Pp`v)wC{maGuvvl}m ztn^U{wsg7pf3|jCk(EBzfo)+vO3g9p%W8l1E_eIS6+Z6Y@9<%&lDRjBA9DCfs>&yQ z|H0w?Rkd(W`TFj1w|uDavAmwfli!<-9=IQV&veMse zV4Fiy{>?YxXQkhtfW5=~RJFixt9}Z$!2T8q|4V)BzYc68^Rv`tKKyH7`&-2Ry1d-- zb4nQHbC~$)s@_Mw6YRFI*uPNwZ@85|wu0?pex_Qad9PKz{tWCe^P#@w!-pa$pCaNu z%{}Gs?O4zW0Jo@n)h1m_vgX(#U%V&G%v8y*Qgb!Usn(>RAJ4RTIJ^=u;nWxd?K1Jv-r(m zn^s8pM>St=@o$42SRwYen((v2|H74MKdqGX*=GD_$%nu)E8Y0X4!>u>_N)~D$F%-- zOa67RgUtQMN6v_&{Sue>U8&{cR{FaJteg1=71umv@$F!{<6^&G`uiJLL5IX&Li;ac z$zKFk-XZQw3Rm40zYc6ehuELe_V2gy&&$M^pRTUce61xvEa8^loj&E$x!~mqNq_0Q z-1ft#!1g3We@5$HXX*bn*pY;k4_zjIS@rwKB*Hf-@xMy*{Z{$im^AILA!@bgSN10i z-kp^6(XHi&Tj_r**v_Qbzee*O%YAQv9Z7ofmnVJ}q)>vgbqt`q(1wExz_fAp0q>f%o1pH2y%k7jW) z9|7CgDe^aK{Tr(j{pX~};*dAaq+gJ9d!lKyYi_V2RFm*0a8&JZ81 zZqxP`Sm~n&yq=jb!+~#=4O7DOfRvul7Bv}`7SH}jK0C} z)757*KVtF8;PY>g^tnU3f4J4ZNP?}`{29$NR{Xs}>;{RyXLb6tKLc+>|M5o2AD`9s zm)Yxwz~CjM>BrmtDY^;u|4qbCQ=b!gWqyUodN&5Y~mann;H#dN7Sl74x{|;90QAvMaH1TJ-fAU97`W>ux`?zlo zc*95g*1r*K>qo_XU(UK6HSsyIJIQ{qC{i zIk4Vi@V|f++#>noMIZOg1zUEDg#TWhzD)k6&qu*F+#>1cYnt2T*K=UKw@CcHr1@s6 zeElO>L63z0*G>Mk(svnH6Z3Oaud(0Ke-GI99&z6{O!~Llr~APUG9RM8>EpliZ$?mv=jGOa_knF;ev;akms>vc64UbE()Mq${5R${)4n`az2cL8%D|W2MtrRLwwCX) z;{Q3Y-rL0euWDXkm4E$iuTrCLCw`{-j^@2q`B4wnbi26!yLq|eGdF{6zFp$yds=?0 z<^C7IUS)o=dQJ0fcKm@Ate5olea*|P{?!Dq`OME!KQQrY`7a5!e!Zmce-S>W$tqty z2lg8Ck!ru@+pYHHsE?t1{uuF5zU{}YV7osi@#Dvb-%+KC?~wTM%fBnYdhU?$eM7sy z#&X|ouvhPp^!H=qKYM*3*x)-w|4&T%wd$WaU`=;Q`2Ez#TkXT!z_#2e`rq_PzyAt$ zM9cq7%kQ`HN67|+&j#WJ>Mcosd2y?M8U|atLBi+fT0Uj*Ua&*V$EX7)e_6cr<8c4S ziJzx_p?SB(d%(7QT=f5|Nk5kVe*|`z`3Ut(<9^HkBR+xn`2_J()WJMzA9zDxG1zkE zgVo!4RKI!oqhLEU|CNvY@4(*I{MXFUf3@5{>#izQcNg(N>X1+PC&AX;CGqRpn*ew&xuz8SI+`FEq(|2rQ(1FUYN`2QWPe}|R-9t7LHQS#UCHQ#0BuXn+Q z-Ywz#Z<_D4Yw101{rV@7x5ZT}__}+<{eJoLTVMz7k@CZjUvMw#&wC|*{6)JjbGh3-3xln_ z*CRjBaO!A11Gbxae|6Ny|G&N0l4ew;68C5$rokG zw}EvtAENTOXNvZVH9qq2eXjfS^K;$*Eco90Bz^Q_d89u}{%x@LnV-%(PqOQ;ru&h8 z?-&1{r0wsu^4~_Vt<3$`AD#OE%Et#J{SVOg@3Qho6fDJjfGX7bGgkTaNw8fHi2ny_ z`Q4WMTVRJCkn}T1^NbZg!Oe*O&62)P)_k2+{@en#akIqVV9lGX@vF~+?PXr5PBGzU z@q=JTH%s|6MDrt7{V?jmDmC#ziQiK-FR=J>u+)PRzC$(NWBKn1u$>Qz`%csRpcVeV z22&47{u-uvuNA-NfnD^F$e(V)-)i5?2W!%NxCuY2e7X&6EAune8ODAq|GWgY{~<|V zBQ)P@x&NR((Bw((&}pQAM2XUXpd>wQ?AF0lk^mYELmV6ah!xoVrt>w$C^wR~_vqk)Oj^?jf@=t+D`7~IaEBclF z`8@c(EfW9dY5Dz@eBL7npGSxf(lc`iAItv9U^5>P_l+^(V}*b8kt(PCJJ!ekRSrKx zo$tdx4!->niQgh)zm>j!1a?r{KTh*EEcc)FDDwBCB7cGAZ(6()tmjd2--RZBSpA2m zzL(|4lLOv-0=zV7*#?s^-Hj{w`SICq=$2Kezsv4A$^TasS0W{ARGb zKPlle&G_Fce?9}&%Y3-H#Bj_1gP*8UrB4t)PnDbWVYx2^mU%+*&vfHItNryT*p4S8 z|ILu}owwgAAAbmTBrXmp*?Dc9?mAnr+-? z*?-=XDF2_7{5{9V{(7+GPfGk$`0$&+)-yjzRr>Jfz;-_=_E%~94_fK_PhbU~68+Vh zueb6~F<8Z?B>n03i^qT4z;-hqrfTzZ$G83itnew~{ncEpf4^0JT>@6|l(>JMkNd-5 z>zI#J^L6|kvfTd+*q)~({1)Wrjvoxzj{e_v;?DUjp7UX*gVE(k+I zr+?z%-QXX8#?AjqH4Mz4{OYHq|MnEv4(9z-JI7zcz%rDN^p)K34Y1dqk??61o=4os z{}Jr{XT<+)!Yd4?pW~iI`}A4SAGP%N)B0<{>Yo+;F|FUYkA7YQcHOg5KH2Wi*Y@8D zw&__ZA6I6%kJ<`913Suml!|BRC;O*;7VWRkihM_w{7{%A*gEE?s6>`L>3Q; zYv`a}$UF51*ikKS_%@3d?L_-(rg=W0&af$+Eu!<~^|CpO^e$?C-JC zM=jVg=4YtevgFs10o%&_9CdpZrwsbu=S}%^idrv@uGnmaf8iJ4zb}yd2*>^-m%8?M zfvx?5g#R5`@lX062HWukNuPIS+mGL`e!Jem<4M^VO%pcI^@SpUU9{>JZq`J^tkr@zSrN{rFYU|8$Ogp}GxhGxMS9 z(>d{1sGb4a^Hs_JpV8s>j@7?-9qb+Er#tCmlU2Tqcmd_l3wHh+TDZk3pQ^x`UZ_%b z{a3TdmA@Wr6Z7Hfv)X>weM8lE!Crqs{O8EmyYhbo`^O7*_`rP@AN69D8uOyaKQH># zR?B@CgUxwS-2XYvw^@7%*flRo{One_<0ombbuYU9pOf{<+h9jtl>AG)C`-O%Zx#PF z^4a~Ta`2gZN#5Dt?`hvQgSA+kGDVqHzO4mYzt?piou7Bm>c97by}|rchkHI>L;3SH z;{DXuq|ovBZ!%aNb6Fpl-G5sPwvqWTt>63k5!ivR+4&Fdx5kHty@dA5OD@lruL8UD zC5hiXKJIG)>wd|#KRfy&C_s!o1JN$LY|HQM`|DWCq_xJYA=YY*W z25$$;^t$$EyZ;fe?Z@EXCuZr-=Ka2b^79*g^B~yFZ@Bp@+yB+ytWpi%?3;fKY|}Sg z_htL<+hA`TgP-~`!tdq2`RtcX_z(5v4d9WN-T2Su54~*S$6tO2_}-WM=Dz_u`m&q9 zv%_!9KJ-ua+4;-+xdLqYKG%QQ{1&hc``q-OJ-+k}uzk#(^1;L30z0(NjbF-NMb`NL zfNxc)LEm!aDgXD_^F!{9BZ;KG^$)+&Di{x|V2Umgq2s@U-RNphm_UXODG%!NzmqL1 zQ>bX2OlN z^(t5o(<;~J1?i4G&rKKMu=%M(rYRHc&Zs83_TAhQZEmm*b#==XBJTaz=Kg2#gi_wYk7miC`80d)cvG0Qr3lz-! ze^2o81Gy4~;68=LF1I zj&vdlNfDh_+`M?vq9!$oZbev4?Wyd~%=SzsHDl7G)vH&RWFnoRwq&9t5zS2MjE3O_ zvbm+JEnSjoPt8{B8dcm>Qy-ihV2x9!j1T1Mv_C-!>p*;RFdPcEM}u^~@vL!Oxj=4t z%%)Sa!~%*gNVP@jfd7@#@LzDM3h^z_`cJS-tt=1nO;@3gNNcELa;c*Grj^_d8_+k# z1=K8jQ+$mSQu@kr^@%qt)Ml7^nDb$d{!ue~?d_9~V+Q!- zzx={{<^5M(SXEF}h<^py#P8qbg{A6P|Ayz~{`0=Ev7hxX|HS?|()c#ApY<>Q#Qqui ze4h~cANI-1?^keA{{e*q2c10llp&`MJ#EfsFEnze(+S+3)R>tXG*6TXcnXXlSfnl+q}GQe*M}TZoFyTM{mBR=hoY9U;nW??%eS4Pu#Wf?tAXtbl?3CY<}>ehqpZP z=wn+S|Kt}PjA_x$H}ef|qy-2J65e`U{CUwCov*IxR1?>D~r z^1g4q^6gi@^WE>g_Wd9H%l;p}{-Za3{F9%)`Lnlve&84X`pbiF|LWI=e)HSkz4QBj z`@`XX|Kp#I{P{2M9)0hxe|!Hw{{D}D+W(bR)it$q=gnVm>1B2G3l}w9zPPdJiX~Sr zz3Ri_|GxSE75?9Q5cP+T*`)uz3bQxM41L>Q#+ZXX&$4xd;tABrp?Io2q*~BES*gNk zUBy)-))vbszS%~_>9$$Lm%OPIUA%@C8C`+il}h1xx4eo^&E4;Kf4_IQ zLVfjjsFQzNp%(tueg4!Rj<4%@#@6@0!(0i!M76sg{kP-4|6gr}!_GXIn~qkf6)@A^ zuTVX3&(fpvH{0}o_xQ%V+xQpxyY;889cfRvi`Fqx1kN@rmHKF&s zzvtrj6qtocx)*9yEZLQ&J6q{GHoCKnE^MOvo9d$-$<8%+(jMwUUnrt}II2>;4fERB zmFghOu+f$3jp?7SPcea>CXNfVt$q-+vzuyFNJItrg&eieim`b&HY^B;Z zzEW){tyF6!hAt!2JEfN>v5BP9b|Ps8o$zd>bl-Q%5L+9>jtK-w){*SO$fY z@wnXX9BxN%BupJohnXjVaGb7{rVAidQ)h^8?hLeq!Yk8w?pi}n+}m2!6$y4lG!nR) zE||RfTI)$MJy}+4Jy~|W<)%c2`j*L7JY9B!>kV`Pqk(85g7VTlqnpp7d=sUQC-G^Z zn=JXxI>_lOv$J1Yobw3X+GL<5)@HeHJiB#Aqr{#@~?B6G1KFGVq z4%5yz?#S=sx8H}xng?h7HikZhmNCBvYqMIdZc&}8vqfDQie=^|I~$Q+;?YGs6r>s| zo8~K35>9rg>O~6|UC~se&L5+1GHsCi?9{P8o9il79A+=fvbmLNcP;WGOcTsIH8PJ; z677zvl9o^gHgzBY7hF=UA}}$S1Wdn6`c4Dv^rid}zl7sSzVkR0OGRl&ArMQ@rMq+& zt4gNm&gE!FD#@3o@-yeXP@L{!ULzOjMl(^`+us$B@RfUExx3XzG+U>>KnxdT@u>@Vv=;L}x^S>&uR=+QoIiq*+_wO(x@O{|yYIPP2rRTBu zJ06Dm!L#vqF3hR;eii!#V-sQyoh58Q~NWChXLVfEqL|JuZz1rzq)= z3N{p{ySy`$0LR6<0xfGYQF>WXD&@?Sigq`*MKjGb_KB*xHAHs|gLfq&$uJKaBEls` z&qu@{eGl^3K*~C@D)T{o`c5g=Xa1kQyKjAWY}`JQ8LRXRSIY3Nel`geR%@(n5)F<` z3a@FSVMBc*a*)P-OTtQ(1}?ZDFt(a&7|i>{JOmGv#E&}r^XCaFLulk6Bv z?#Ii)*)%v9m^CXvf0M1n&CS}PW)T_B`hB#pTt_U;_1M^KcZ4F5V_MChAl|53P*r`^ zy!r(T=LKu$2b*f@CkGoZt-CZhuWA0`AU(cv>Xbes;QxRAul}?z@8^8q)7DQN3iVUF ztY?SutgNM3uyfLR}Lbw7&l+hLxE*#pxH^Ie$NVcvo{WWD=Ge9w>eQ^R1!!j!^P z!PLPlfmsf-0wx1o+w#QQTU2d#EMr=tJJsA+LM!^2nitK`*M+D=@aB{}{HB+ylM%P+I)|Rl z?TW`6LYa2`=H>LPo+kjs6?hh>XCwuOcCzHX^rVsJ6`Nv^OOq4nn|hQ;6B-Vr6SB|I z?=hr^(ubQd7i-zBs zs<|~n%|V19H84`Kh?=3A`N?e6j5cXBu}W2_W@_ZBMT#3B>T>$q8R<%?7S-I9pxIq@ zp=u@t9U-*JI@{8!6u&!Kn!{b4%^jg`rDo!Hs<|2JVx8pf+48%Uu1crXW6jNJv~NPG zRC8tx+Q;e|)f|$(cM{*y>1bz0t%19v-88y)v*Ux!su}H`L{h0Q!Y}c3OINFUh5gc; zOt(s~DD@lF980z+^*j7chsB0#^O}?R8#U9f%M+jXFU&vO_Uw*ebzcn3=u2i-8t(j;%uIA;pu0|^w?_8D- zr4(VRGrvQ-Vs$>+eeBjX^o_2aS2yKr%hb*Jung()*8J}e=SsDWzOkZD(Kr03)UNzYQbv8hoWIHhlqyoyXkXRQ^Qx}aR_PQ{efm$D z%W4-dtgV|mr6dxktMSxuJUgE0NUsWaW<;VGzyGHh+y681`-;Ze#cl}x&-?r@y{D*Vs?obZ3Z#h(liD*AnSNu@ab z%S&cG^t<`#k3ad?gHPW3Nc#QvKKkfma{7G_q(7-Vn*O^-(+h5znf}OQa~~L+l$1D} zmodX82-C#`VN2Pmsd~Asf@JJ38m<*&Q4oeh>&}O|&Vz(x_+JVzY#lxuSi2Eo(lbA9 zq?a+vjMOhdNN2eCCz+un3vvJMF$$J`!vF98#>x*Ykl}ake33N>`x@;8`*)8p{+_XO z@0IU`XKNpU_1z4=3&b9HR^cB1*e4m{J(;cWk$ zSl;hgc|;qak&p<#!+PRdh4KEg<^O;G{_pwcP=9nC9IO_d&}`<6-Kug*6EZqAA?Ia5 z@IRfOyFSd%p$3$^%c$Kc0YDX@1_@Cm4-+-%DifCO__4h3v2 zwe&uCZInFaP>!p+Rlb-I5WO6eH0yZPG(0#Caxz?3w_m=ZH_i;i=?^&Jq|*3*!NZSY zKCDSi4*vcjXntFJFb{r%pJNJ^VJ_F(S56IwlBSjdRW=9z0x0Ux;lW#g%8V>=RVE|i zvPbo1g{(lkQks8eAOX@flKMC#1S?NNg0JH8=={WVLo9t+e7crY2{84?qR96?`Eq<; zroUr<*!&KvKz}VM8+zs0B4^;}tjHCDpF;m{0m@z)fL0~}1Y7v8$8gBZ0PY8Pm?hG% zWi!de@K0FYmd(*}eKrfy1J+KopDw=@OYuJ<3R^bML%i8AA(DNHMN6af&DQezTq2(t ztF>aaK(hBC1I&88ECek?(465WXa;iM;3;@_)g<3}7qo!QvlO8DqDN?0pw88|ic~Dm zW5X^k1R}d?Qtsq!fjkB3W}mG|ufzN>tQr4;Wa(quuFHgWLC8U|E}LC71(XMI>i>W^ z&m1gwTWKQxpf*#v;az%}CM~TQ`sCRy5A;1HXvW~nkgVNl^6XZQ1`;p{|J?y4{@3() z2VO=gU_+GiPI;j0RZa%uj|Mxq%>Jo>NW+oq~Xb8+pan)31m=d~YG^>Q;JHj#3qFNJNfNLKOJe3WB{4h>=r=WUn>@mqIacX}hhb{n$cB}O zn5!n40W*+b$z$VrH_XF80>U1He)fdBstv5l&`hY1=E_T4OIZeMhX zGyD9plKaodS}g;Br+IS?x!C}D5g>V)+ZP`$uZQ9Dr3}tYZGZ>q`Hzq}1=MdlRvFVU zNu|HO{DjN|M0oP4fN|^t3m%|swN?|X>jZ6L9lT_=OK#wHz{Q$zLNpw2yrf|zVrfY= z_?OC8H;?>6-8u5>%#({RQ>)cf%&4}zYKGo<7f=WK;k<5)e2BzMXb8>^H5H2pe}mH# zL?Q|WKLCPj?}XJ&O$+^j@Yvj>v@%Ge_Jyv7Bxh0(9u1+nz3HuP_vMK=U!BuL-sM`; zU_oz840n!dTdUgFl&523Z4Fw|aD1?DaD%W}4E#4>tHa?9*lO5M1^(39cEkU#;kA`P ziBp!+&}zjE8GahwnkLoHD~8)$91$byRdW$`b(M8H}0j6`E29MX@(Wt7dDfH5mYILHVr}x2oC0 zBMvNRAu%M${VNXM)qL);_DxmoZGhUbN-b`27Vj1mw^rPuDGi#vsbdve+$JbnP2ojl zK+{|&43cLKbqY{7Xm&rKo>8mh{wD$|E#;ooX4b+Exc85UD^Pzzdr2(Xjza z4|Y8WkG9oXQ4R7^&0fQ?zi03)TPr}RbcBAvpst!ZG?HG&ZlF%+I~0$ay;4(ZkiR27z zKN)7GtyOcZ4juXxDO%%+NN$rz(@PA$VzgC;o3ykwOvVhxMe;c3;XCJ{aFRUESfyIp z+Or`3izEK~j4A9Yt`p?*I6Kmc>-dbQpiz+AL!d>`#2TJh*=yd1`U4hJXQpzY+Jy&M zwVQ6luGQ&DG?Un{zey<#dI}B&O*5JZC6u@!G(Lirhm5DsUi!U+Ruj64%NSb6*(%8Q z9bShS+Xj>7rTzR9JY*Y>=PPk_N+*xb^t9OSY=1 zh^VER@GrGN-7#{H`t``YnWqb9OBBnG!mu&Y7mY?!LN0kMje z7oAC0TG1QyuV&YLns9)#dxibbD3T=rf-J<(dj)}-K_4=sk@gZ zh?X-0b)|?hAaodNg7v@H;)%%jX5N&n9Mk$@$vE}xZNUrX; zm?d{Y32I-cL%k{4H`%04HbXv|N|Q|}y34V#>ST*bt&TRsgT(UPC`#)J#ZI^2zcOF2 zO73})*i=Mj2Tj3N?!19o8FD~!WqMgI8j1mRhQ$>etaj&2Da{p>!+``W{~mbWgnvSZ z7(a^2Dy`V!DmELGIpuCLc@|C0=nN;87G_Sw_eEL0p}2SjW10-Fnh{jdHthm5N0Enp zbsrK^Y1Agu>w~Ba8+q2npJ(`Wc?WH`92-W<$owSgEifA@67mFHUEBBzm!G6VqDlv) zU5KUC0(%GZ;R;>ZRc~bxwg`p>gb4p1D$rCjr zDV!6A2QOgFKEM@wmi|sG{rJ5sJ^VqmuF5>Dt0h`j3$2H!T>yF}U@pPF?1RkkT!GI! z;F((}>DZ-p@Sfq1%752Et6Ce!BGkI$4ZbN6Kz6mZ2aAh9vo08Z0X(aLj#b{9BF?UH zazAI+9NARcciiOKzGHniiM7DSK{#7TVUs6-ekPCeIhynlT7Ea#8gt`p4XYqXWqxU$ z-}k@?9GudTRj#f+a)zrbQTg2WxVY(OX!-}nj<=MLy)#T$Y65C~@A@83*c5`K_2`ib zTjrG_Zb-+~=9OmXCC1IK(V7Cfxy8A_Bq(>%LxLbrf(LDIPu_TQM9a7MEXkQSBtJO~ zX7RR;RpLz0?k%;}1OaCfTW#84L<2@QGx_PPS|LlFX$gM-^})<<555g^8^&!}484@- zFqBryw>QHO=38LFgx@ID`4KKvKTCj8!~cx&^KDvcD-Jhsf$FM#CZnTG8=@Aqy1GQ^ zg^egX?l6O-@@&ROrPVvkdGb~{Ra*Kdcz2$hCnq{jJ|cOR!dodQ50gR3*>prFo~E>P zye0jqN_xe%dy*Xr*#khJrk2!(tn;hlJJjP<2TaD|HqF+GhL5dHb+m>h=x3oTkevCI z#ljrvv9evqVX+Jx(z*WDx!scJQ8N}I1>e0pgvq_5J( zyZp(Jq8y20*bUUDBhu1)QQA|VoD0N9m7sHh;W1^ObAfS; z(!$I?&DKI|6x1f@>WsUns}58dl~3ZT4E=`df32aUNK9sAdy~~#rbFyPo7LH!F1b(R zcy;%a+`rJnC5oxE(0e{4$tM6TcR0JjqWO~2MoVrK$7)B|RGRM{B(1BKK4vWX9ngLS zCG6}TBky;1kCMN4cIU_~kVD=H`Q=7uw^ja9Z64VUBkAnEQZa{y0R5qixO$3r3CbPi zNFvb6fDhlO<>36w@T*FTTGXU&F4e99MVlGBEjp_zC?Zxhh&1SaknYUxBPgcY$rdpm z$eLBus?=#kP2NH7M&&nZvp%xWMIeGms*dk2(K}mI_k<3@^2tX`d51SYlD$w4XJ0NK z$eyGG)aG!%d8JlwGNfJa?9P&No!!N9wzK;(N^UxW$s6fjZjrR5KaNl{Q`I);GU7acKH7UQ4cfqum6g$X(+HPxb=o~gzT9t3s ziaK{dzTuC_@t92HnuOd>7ht8@L~_J*N*=U#k$Vhg+6>OO;4Rr8s;XDcLTmQ6!7y+_ zo}exmT;7Ji`KCa=1!d^Q2q~885vI@HknEc_RK3Bhx_B)9_zV@N7F6iG*gex$io7g_cUKZa0JaMvfiPurLhhBn$%M!$>e?&->XL+^;rh7?DJP4jks>C+M2;= z5B9l1SD`gWlV)oUJFzH}5Y@8*FZlg5R9y(k)*M3K3-dl=YjN3HlQnxwCb4B{sb+|F zThzOKJHTp%^hg52Lrt(6)m=Re8lP!MCNou@Z$evU=UHqS9pNjqEsZ0n5-S@O60sm3 zwONyZtGA&$>ORK16VY7885}nX7l||q=_7iL0xWZF{QpeilG_QH|7+vc%#B;XinC=yE#0gkDRB*1J6UhYdneCq z<}15YPVKg6E+vRHYaBu zU35j}b7rMOT?k@}Oc3s{a`=Pu987BYm8P{~*nkT5F~%5k9>>m{0O4l=c`TJxOY0iN z?IfXr+vLp^v$G`kaGq@_{9-Y`!|dC_1Ll>YD;y!W0wfpe z$WnerhqhX+&bD|dFLGa3Z8Bu{;Km_oJ)p%H){4dil~w6{sVf8w*P4RRP0kePH^%_ikJ4f3_PwnWqbIvY_IO#>5eF7!Vm67COc za57Y%xwrV1%-Kl#SwQ+eOkrptg~1;T&y12@OU3b18?X*rvv#9NHETCo)G6kGm7)g% zRub=dD&a+JZK1oNQ_%C!U|c@iG8#h$l#-1h++{1r4yrcjM+5c4)|6>$kbFDQ2bXpa zh1r-Ze}}U4)GY+JI*Z%V-XO&ju{DIIGad$MP*u2$@_&ap<(?P>NpT2Z&X8O_J(pfyfWzX)4M z=N>0p;N8rWU*)j6Yvk5o^(ivk7CW=XDHG5eG*iUfkEvBKoj=woM*LI#BBL?<6?PB0 zaszfH?MI+o+z=(ubg|bPlaONCh3a5!s_9)ig*jgKUHvp0p#i!k3FF6VT$wtPu0 zvfU-bSW0oSZjmQewHinZ$EA8K*#9a~ScyrR1>RL{9EvLFxoVBhuG9c>;y{_f4x}H5pUEOgRdel`$b(K+F%g$QY)tGge zURPPHt^wz$YiV2tsw<|uZ&yK6O7deFH;Y-R8{k2nU0#W}N}D>NL`}uCfC;yHgiQ~Z zb91@lEv1i|I>ky39pqu2PWgO|JfXDjN|}cTKl>TCUAf)wGo7~*%dgsJMA1!^AWNA$ z9$H5=>g@=-VtjkEx)WVg7=J@Ka(#1i;p~|fvP>r>79epC)Nrl7a$g^aJI~Xj{r zcK{AwHm~Ed+5bJuBmIXwm+y;;f6DXW_wn{vwq~OpnWgg#xD8~{&Ql#N-oz67F63Tg z2-xDiMJ#db2IEk2-zK6JeVydK2_8NnP05BzqmbDkd5+S?5-3s@-}Dj_PLzQ?c20fI zM7VL>24r3OA)=>|f!xW}`0zmTkAO&3+7@M@Qa%u6Dh@x$RT%rhHxkclQM+OK4myM^ zNB&wHBz8lydA`MU=nE-o!99r2iTzr%878$k*bMAht#uVQ86>wP_Uf)TPb{(Rrp8Je zZM&*k&C*84?tTq9Lbf2V4c0}!&B?wFUp|JHoE&<50Uxg;ly?Op7S}S({{UJSwj!-_ zvM&J@qB!R|_))&|bS}6XnpRc?+<10rM$}O=uhdz*>k`S04zN!W7-7i~@(tJj?A{{3hhqSJEAX22!b?4!&xFDy^Wb;E62J;K z!$b4&ZQ%~oWse{Py|miRW}p))c4}468m&m3&^~BNMtsHF*nWHqPORJavdMUTugSP5 zZZiIPFX2}p{>Z&?doRdaG{vlL)=+aFob|Y+xF7D#XFhIOoanpFq*+ZK+>U3C^Wg0( z(6Z{eEe{$*))dnsqdEoYkIEoA4K|NP|9Y#M3=~mknAOKEnj=}Ak*p0uC$LdxHgS7E zt>`ZN0{w!sV3GiR%H1?)Tgpq2+Y~rY!YKPp&x2M28tjXopvkluirca2CK&Ve2FC4D zfyc!IBzKW0^a>=%vbW722F)H>2Qyu)(mR)Z12Z3?<$^1ml3CR9)C$ef93Ba6L4w}= z54MT5d>T`4n&byuKY!`g=!#dE_EGF$vpk^B&{!&cGSu@e}ZXLxAMJO+zi@EoSzd2CB29n zOrTCN{}f|;6L2ZMw;N`j4VSSHm#g$lP~0AdLQyZo<$=Q|kg>@2B=mTl?{`Pzb%G;X zphm^ab`(O=R6V8!+rB?~c(OY9|kv8Tl*{KpW&WfNnfEdybp}`f(o&43ZPI zd=pD1`x=Req+dckRrYDdaCMLJ#52lEhVm>>UJ%Pu_RZ^2P5~>Y9?IDo(^G2IFT6H$ ziET3#@EjEIbhJT_bZ!=vIRRS@?lQu914|QTdrw(}7 zo@o_8R^Id-&VlLrT7j}(hDi|q2RyreI8AE{HzYR%UoT|iyFu;?w5&(@0DYK|B?{q9 z@#C7BLM~j%jk_fph2i+}#4L&e;(OjOI4tz1R&wtY{`=6MTlCPM^7K41Drc)5TGCLo z1X2g1cHbO)=ojdB4uU)pc|bXBY^I(-K0UNFkdVS7s$#J^EKaCLsT3QF3uQeG)KRup z?nM5v8R}db_Hus9JqHv!blWvztg{q?1ag~45T!+8{)30Lqzcl-CC{lo*z?i3j9R1n zFgJw2qh*=uoLrfLmG40VG8G}n|L+7;)lfc~tG!=l;$CV-q;#_L+R=)6Ua1v+{8T_QZI4Duxaz1YNB!BCasdb`-v}de=elVNMo^tTOQ}{==bM!k@ulFl-&1I2 z4Y9gHCf84+I+8484Y z+#kQ#YjpdS%R~80_sJeEUy5>H+DPj62Y`}~7?S%^^ch_$o3iI9yAT6PnFECdmjX(- zzE%*dq0PTy{Aa0^#ee#Zu+Xu)=&4DqXHO*2zeq+O5l#{JW|*WIyS3uV@Zi!+dG86? zjG}i4l$ljjC;3$D*sQ%K?W+6?Kc-7%{%x&3dmHFZ7`4QrGq|Y+#aqyilF^8H%c}b| zF!xYB)_L+G@)7@44QTc@T&ABH*mQoSDH7S%N`@y}Mq+nnL-7Eh#kSVWhK1eCBxUw> z)Fj<@Ne`1$wbzASK83u2Q|3~njGPN16~?tM+LZHw&%mg|63i^BmlvL6T;9NOnUG82 zw$a$y(eMtLif@e$xJM!vay>?`&Dmz65RZS9>S4QoMST&d=!SLU+Dxg+57D}rUZPzMC^V8UC9!N2O-k#ie!LN*F79MX;#> zO0`#nmvIhJ&p8sUl9xX2jzlU^84QKsDWj9NeS>SRV*yXe7$vv45egs%;VZQA!fAvL z0ahq*5>gGJzjvWhOgu4Ea*|B5UTkanacoDWb~Bh?a*}Fb%?K^;#{A*Kkl{m|qK-z& zT#wIF+4Dc}Ij51?gqQd4X%nt8#cV>)Hiol&U{9PiaX9yGW6c=)t*do0#l*n!#Z0Z2 z=cC`o%zGH5^|DQu!+$)u9QlB4nd(@j+Dp}HuOMx#13fd#cZaAct2~|ZG#22DVRuY( z!KGJXX8HotB#;_jqq>W-DxYgQ!A+f!2#qI-rE!2cg$a9Y!tyashUWO(s3wR0tsEm-|MPHLiH=c1(GOPwfFCC{_i+yn%(8dIWm|EKmal15uL zjP}>0b^ge3&-6EQg&uotr2EYo6YG0u6|T5L$0*9Q8~3`FS(({~%pNNz zN$VOq-REJ1$r3psKl~HOgk7T?D{!(HB~(IiilXb5v+{*WDA{Xrnbdz38lV=HsoTS# zu0554pyvRTd6!9PSBZJ7ARbFw`X?umCbkoJnk%A6Zm>H9SHvN?ufvJj=!*Ovq+n)) zvQFKl6_pXnorLmx$$bk>Is0;08(?NF$I{+}(zL?l5b|3f!D<|v2kQCQpa$^Oc`&a> zO72?xEt1?D;TIZe&K@cE&n}|92RcH5-PI<};ChToJz5SVQj1rpJE>n5On3zQwJ2F( zf@6-}smocXpvB9z;uX*}ZM-XTh2#$O?|l@apkEq_pnksvAu@gV#jfw$RePCwRITGQ zR(EXLxhl5G{$yJry;60peTC$Cy+1CLF|}5)pw?=*yVh#F+vPX8stu46XF#}y)Yg!n zcF%!!0Uj>;8g8xz?;e7hc{z@mT9~5J;Axbk&IakV9H&LHMD$e$5ZRwg;v@59683^d z#;+EdS(o3xfI?AFS?X!?O+6~4(ABPBOYAaQ&#ieuc_w67o+6{rW#Tq_E- zrt5UI1Vd4RmuyAPj-af~@I!H5ql73fMgH|KSP>aph=Q7}G)Yxn#}ez=ix6bw!7fhH_e#Q z7)D(#J6%rpO%<~*ll$d?Ar3i|gL#^5#gt(8myyWID}Yu+6*F&ac|jSp<*hEpaQbz# z*fhQ3eO(+Y8?l@m>xVAh9Q6yp*@$mxcxI^gk(y<+;_=WA3nLfPdh+Y=C*{d#`&#K- z#Iq7oGovwhA*;r%AQOI?Bzf~(pcwbL)!N$N|Br&t-i)ILQ` zX^**4TKedTNF@787U-zj$~4E4k=3eWd4?a9x1tgZD`$as;$H0nTy)bh-fjhVsqsbo z)kN}h(2Fumvy}mp>8IJ3II|N4Wq|7@vxx$OY6}KiMA})Hh_x?%ODihz8bgPU^AVqd zBfj)F8;SwIA3_J=rIga9W7?BE?I;L|P(w6r7N*VSX&+)*1*Vm+A@xAMP9Lb3a1D$- z9=~ML>5Y;JJt*}^7Exu(S(Qt!k!U%~F=>BiJYsWatQP2iTWyw zw50JQs^pn^*>57cw@2oMab;u1;2%&w8P9Zc3r`8o?vZCoC(YsaX%4qkvZ>rRHkHMm zQ+YimLEZwK%8zfwye)pnRDJ~joY#UTZi30WJ_-4>z13%H=3IrA0ne5R*+LUe;kGeu zi-P=Jdig2b<0z-yPt!8JrE7kPZ|UFREk832vn>85bPPFX+H$58E=^?lSM<#PaF6_V zvHZ(f{^pZ>E?tXrBJUSAC;kr5(28Gh?;5mkhp&psCvFR!2N$9V@!7pFS-g@|JC|w z&j+zTH`ahXf^tgNg`GJEQ5%!oQeU+8=vV@*+pT1+fW4MX=2IHNrKQaPEf3;yZP#X) zJdJXKbJCUaciIedRw^<+r4gy43Bmc_bHv($@fI=sDG_Z35-sT%BbpD23jN_&RALx( zYE|{6u(Pp`xkxS=;^=fcN{xx5xq5O#cl6X!?8Hwm(u-hvF`_dWEbiixXyO&Tl<&LF zEQLbESOGYzS(q3bwV0Gx*1_k(ZP=~fcCc=}0>y>OI&dzK_DlHL&q*FnBFfYi)?ibT zK+&A+jAhXA6Sp+*)TOn9ojf5mfbS7-!=vE&Q>btheuY{&RDWRyIv|&DHhVqxVs~kI zY0tU5;%NL_e&s05*xdHB%0&~)keq59q4qK z;wG8p6Eafs0seM7n@nnZa7sHHvj>6ch2CQLnz9^> z^lQ9{&aQO%a%WdR`4VSWjy%-aRV-iN-Xag;8hVM@nisn080D!IK!X=SgEx2+0i_>T z|HHd$ndSttKG<@Y>1fxtlhO*d5>|Q?=Oi*)v4IqAm!CM{$0MV9Fr}hnt(-V-0ja}W zqnHc!Ay@lnMHLQKTsy@@qy31*)|&bV>O@rUwIn>Z&b4Z8V&{yBDJIOsmfT^WJv!0; zW+6+1+^87Cjjy~79?C3?A^)A~c?jS3;pR6Lftj1|jS}3vc;GBJsZy~~c~olfWHkm! zknO?XY>irynUyhr1dneZp8)H3!7wP7xlrL9nL3d3m zb#`ANUr^{hA3%eg-6NI5=!PEx?VK78<%ah|o322Wc;ZG>74Tky-ZJGgTuT#iHiSk4 z@9^0wcwc^xO!m(s$@l453DZ{k*!D@>F);T_hkHcn68^R;8UFmkQ6_8DYieO}@Q*5B z>ORcGq46BNmUABC&u6%Uf;SC~bB0Xmj&8P7;#GQLXe3b9`7Dla5=ND5#}UpmK$-6! zWP(ET1GrCUfBTtL9K0y5iln1GdPxXh=m?=pPV{WR2ho&oJDGP8`$pQb?iI(Qz=)3I zy5&4N@@Z?~bAh%~L$$y3EObt^&>N5TOv$?lR{*LIEPe0sp6QoTIw}WjDuyD6aCBsK zaLFd*(<{o;6Y|J=G!FXrDZYdUl)5&X(O1vr5rve&lD~K)42I}V*K&YztMjJ81({^B9MT^B{E`P z0YAZK`{`R8Flr+W6d70Yi^z8{iPiZTTZ+syq2x$qno60P#P(7MEk$QdldnK$^%9lo zA@&kA37e}q+$uF!vpZF`{Aq;8*Y%N#ZVC_kA!B-a--mA3xDT57~bv_w_^Q?s{r{yaj(M1dGWE zdRb^;JK=&_!|m759Y+Yl+(Z?y>U>WcVv^xHvq)pqTR5O?3QZa{LKhrH$MSgr!`R1a z^9;z+_J;u-nm;7gd@0&|RH~fNBeD=Z9R3mAC~blJg*-M1(4Ys#d{R-l=WD`mT()dv;Z^Qvp!aA)OYh0q8F~`v4(iI z_Wy%}Hjr=yf1&}tIEahpSn#pE$U~0BoyAQKz7&a9PJcNN=W$0zvqo0D&(von{#r3e z9cOMU7pVREz$B-aqgDG%zLaDZvR?JQ$(LYyHdg*m-4JtGZcJTEc_XZ6lAUd%@V5h}CHJwvJWmN#B#^Xz3G% z2d^EDE=xQ|&ZESF*8xPcwFd7y9Wx8#;zyA3w$@m@zvRIUZrl>Yt$xjFVnL!TOl&;p zfD21w!#Zp~b{gjd`WMRpg_~N@Yg2p$15N|w9-gLd_L}j`^?i8ex@Zb07s`QJqwWU- zt+VmRNTk*{R(Dolp}~y+!?QV>qfNWY)2Vo3Rj-63{jgbWL9#`R#hAp(Tm(qrf5zS) z#rJ<@Y^lT$yx=`?MQEmE-K?65G4MJ`Lfxl(objKd+UoJ(Ym-oGYXPNa1I;U&pXQaV z5&j3@f2~+++b($fWT(rf?0$-|Fx-)SiR9iRG9OA9&&6V5S9U-77rf?Y9i(KBmfUrO z(Tdx<9pOIgYycQV(#K_F75#A^9gh7edyKq4dz8E{J4fD=JzCxcw$qMmtK67BQ6^E(nM4^*`%C@}cEdu+y&3Spj@jibZW5Fx zXK_GKzM|s{b?z-n4W3F+HfHXTKatio!r~a&p%&p;GY=jp3)q@zR+EEJb+mdK7tQ67 z#eTK8PCc&HqAf9qpS>kniqTGMgLRj%Xs5NxWtzRkvxT3(H3&+o=4ghYd%ub#OW)f3 zB$3A^XDO`)DO_#SaM->biIKHtTDn9R z)xIY9&vZ^2&AvwRV7LdmMx`?UBwL$2+}l?z+Mp`_(6y-H!Qe=qq40!##A6sCy!*@B zH)D5b7(BQjebHp{{0x{^ioTyLI?GvnIjsY+-MJu1gmr06!b<>}gF8-wksQTZxXarY z$qR+yVPYT=4Co2{_8yuJ73!{$M^#5tz(#H;S8;_P8&yXo4>zy#_+diuy8xQGgIu#U zYsnhL$;I_Nxb9+oM*K#zRghEI)%s@=z)_;JxEA_#y@=Nd!3uvI8T!RI>-%PBG4gmF z+s%$fT4GINZ_XDGb*>kx2i#IumnfHdlS5DA^hir! zRt#N@2Lh^L;v73m4kCgke1@1RvyR<@^xS#2#Dk?QYR!| zA#xu_n^B)){A7#f@YC)r0Ptu{@QyT+!8I6=-X5Iw8L^gic+A1pY&4^1qA8fS7oiJA z>at_&3Dm}Q{U=;P8c-S`N$OWXsfdG<$X{rE0ro2lBL)6by{S*WEK#n5i>nvCcP5|I(@b=RhvKo|CsB(EOBpbh^v=8wzx<2!p zljwHUXs?6z(9wFBi-pu8>K%Yu3&sILX9Khl%PGe^w$+~9@-=jEM20V4)as~DieoZU&v&%POv%isF*!To~?EOUMeUZxW70_o&s-r+`y=!)!c?2 z{SJ&*_Zp;Sq4T;#r5mri0HbYBcB1lk_6$$$&P9eqd5gLy98^0pi&jgnkx-esODkR- zHmKFUyoh&N1l@=U&aQq+pUe|a|HK!6-?g~-*ZO9P-Wx>R5xJri@lw&~PQtqLMDH|Ftp+^hTlRvFhn&wE5|yBDhUlFlqL}>wM$tPMg}935du=!wp~!B% zd17A47bR8DBIilSgEg8!$2p+d*1)=OtQmPUD8G+Qs_+h0tK7Tg3rq3jz#p6^eN7+_$WsXK^)_c%y2XtfP(a<%xK%>>KA!pK_&=javKk<>M$5Fbu{iU7|gq8TB zB@s%BTD8vr9aJa4-wIVWm~vG;#g|gLo=*AfENSj|H*^uzhMsQEKasB=5BGu2S=61r zTSf0=>Ky6`+c9?8Z01YtYi_<&T|kU^khjo`o78w~BW_YZZD1>N07oCNnxVfEMIV6Z z$3=#ISY+sZIeHdHzyAW}jq8HqyoIP7n*rVP6TJFnBS+@ydS19gT3081yo9zjI;%<~ z_bekjq5Ul2I={C{o+ofJ?F=Wywm+=OM9{c#vwT$XYTYh}nuB%kAVt<%HAh9T_N{ z(28H<*E-Fwhu$Wq(Og{jbC8ZqW=&lU8DQ4uuEv^Iq2J=S@Hk3Y%~h0Bn0XXrP}@lp zYa zT-@{6p}N)8)lYiK-Cq#&GWtGnrZS`t1Ri$NQn3OSoV@AtNaR1`Vzq4GUj3XVtMo2D z59A7wdz;WZh%lG#?fX25Vjsr2erWeC67d|%@$iG$bJ*ptwWdMiY6}L5=W1uh7IhbE z;IMNykdP<_rK<+C=<5V|idI}-7_rsEvd;p2z^@!tkB;od`OJ@#tB%s308P(4t~p92 zcUlrklSuYB$%Cc|v`Ps59`#vVAK1+`c&q|%cp6Y{p^%vIz;2VN1y^GFlCz{Qr!d7P z)m{e^1uT4@=}SCIfusM-5uBoxno(0K)jqD`I#F6W?L4%_P!iyw8vF^Tm1>R}&0eVv zeK}8c)X+JDdWw|48u@W?Jy=%036A|Km%e1VKurRo2TWLG5YUPvc%c+z_DyE5%J} zagAoH&$QJ@OYvS&y1cJmwQo?rsQSU67S)N{)gr%kk-BHo@7@C%;pZRl{PT%HdNkIa zO|L)#!d?T|rZ*6aB_ON}r0k|O2uqB@1|jTaXa)s+G1wSr&!#tez&s8k^2Q}r7V{L} zO>8=A^h-BHV&U4J&1gMMB=!W_$i>NcftJ1)%otFcS`X|Ft!Bx6)rFwv0Ta0LLR8A+ zM0TtE& zSNwu(w|C*lPhNSSG3Hl(IXBZ(5vQ8*qow}XW@vmlcmpUh-)X!Y@!aJQGcEM<3xBNq zmY<@Z1-5TOH_+)gKDq$P52v8 zN~zOQGWZtEroa9Z=a1~zv;rRVeVMmp+osJp9|r306E`*C`yl=OvP}o@eX#zXy2<>{ zIDE0eE00J={mp zwe5wWaVOF4-t_hwZdl?%Q|7Wob_Op=oy8*kJgConf@`|+-^e`dAY$WQ=T$OZLToDZ z{>dJU=HHMQk^vSsm{{lFK*HQ;oqS1$<|AHgkP+{SK*B>h9$?%|?T@S6f#u(W%p*1# zh9W0sE!03ur^ipf=Yq)o+ zg1`GUWwrK{S;ZqqAb=8(MfomrU=^+1``#Qd`3TJF(Us4F_dXv^VEH= z;2FjBR~87E9`c zNmnOAYmVdWS?jW`21R}C?UH*LMm!fU)2>&GD?<0tUP;`-rml91qPniE*LP z(_-VgNYR}I1q9bEL*Fr`;J;7`>$8?hr-)&d=A6V$Gh|$$o8Zw~&>z%E*$gty^YAg? z0-=7$fKC0`7Ao_n&cq-)erq(p+KHdro@B3)JQE<9uBDuM6VV`U5Z#HhqMOS%RP|X71m00uZCg z*PCO&Sp&8OO`yhd>!@>Pn%Q1&m?8l|_I!kgVvH&B>i10-me)Jax z-@@VZID8j}Z|CqEIlP*~cXRk}Is9D?KfvL`IQ$h3@8a-29R4ha3-2-bArph&$KhrU z-@)P2ID8<7Z{+Z+ID9aNzs2E0ID8m~FXeCphhM_sPjUE9#~6G#hu_8FjT}CL!wWh5 z6Ar(g!^bi>mqz6nxvKz|c#3lgP=z%IaEDLSIiHwZ0Rt$fI1@@bdRksQ+6zBw5uAHa zh+d+y%qR+>2^d>uTZKNJ&|HiLFWP{NYap^j#|G{vNC$}?eBd>Z9bFhRGy^P_*|-~a zpXB+tovt`_E-(n}+ZkhUj>77_!^rydI>rluoT%q}D*6tj(geoS>tOAF`giyf9>>lc zQts^GB{2UkqyoIeJYWUfs47h^TZ0LzR%WUvU8lhWTWUlR(V*p$QSVs{udH$Ga|qPH z-y3oNjvA=^&2`!!xmVzsqi4*nLk3o)8GG|jAYS-gVw2Z$HaX}RlhpS5OnV)Wq@QlW zX+taV2<&g@$Q6voRDC>(YS2D3{XJhTqLDa#g!Zmk?UE-G$_qV%!ZB?LDAw9U@*yZ? zbi{xTdp9uGTVY6G{tqpO91aV6rC%Q6&W5PlBCS0(=G<@8jh+hJ5;bY&RH?|R{_J5$GP^mlQ~_l?hV`UjN2Uf ziCWY7<7x}e7tf{EXKc~^hEG=TNa$Y=qcpA0M^}U~>WbJE=Zcs>yiozRo4J>y*B{Zb zoe#1@(V#*h{L0yy`NXMMGxJ4^XW1Lh``@+ktB-gaGylsrZi@(d8&P@d(MGI=v>B$h z{42sP`@5WdkjC^FCfQeE%-yRz3BOf?i~)Z!CYbF`xp5{fQ(@vwn>^}{IloF;WKWFqX(`w#9HLpgG zteUbP2wBiq)I(YL{RpW+0l&53s6mG1%f1$w=lauU9FiRn2?%2zy#M}r0V{AC{m#Q> zr^##JGkHvG_0WlWSZrAGrw0Hu-sfnAl85@}Qw3*Swt+5y>BB90Fhzjhs$PLv>0HVx zG@kHQe97~WD6m8O3~?(i(u;tAl~^}-Cx!YSJ~s#d$9_SNdk^k_*&nJt%U6VSWF-#y z9Yn_1i#UCb^b7oQK%72D`b7s8mhgC-evxqa+{=|Y92Z6z!KEMkPfR0*+qw3Cz;%={ z#4p$WXMTZ*v{F_9V(2PlcQAedMgdD4&0CS?Z@+}<;lptq9DXPgQ(>9M@n5F|T|>(t z?}{9Uf9&U&k^@QC0KbvL|JE6&=K%b-9Pa6i({lhm zjKd%4jMH-f-iN~-opE{&zz>~d@SM&#JqPCvhhNqir{@5CBZnt-#_2f#e~ZI^iPv)g zzLdki`z21#0r*oK{`oI)dJe$v;_!d|5~t??yzrz>XHxCR6#uagcSpAL;ZDr$ELOlY z1#*G8hNGLr3;bi46*vQv9Dd|!N4r_lJf3vdd%AKP+zCnaeOg?QH$ZwQ7ykI>n8ncO zqj=B<#j=Uv1=zJ9!TY;~m6#UkAS zuv@-V%Qv$xqO!}fA%_et3(kkav^y=H-O8SF+@u2I(#_KsVfsu+58<6EVDp9wk5Hd1 zxch-i;=B$#pzAl_$Pv7Y}9p34_- zlGMZ{%;*w?m?)Tw{m#{}fpw}F%!Ra(b2ci!*LHz4;SpmWC2rW%ek^ zy~N14zlpc)&6rtvUbGN5`pPi%-B{|W6VWQ_jojnJtUR@<>U&e5AkkC~ydobJxe0Hm z6B4Z}5e4kjkcqA5Xq|tJHT>^-sfu+IT2~tpXRRqb(AhPbePs|Y#TuGeIN58t+Py^y z;`s)j$r!x(ZKgsNHGxJLst)z6VMVNl>}b2)F9~=;h!dj5a27(aEd3x08KIO(@`UDSp!@!{9IQhH1>JoQAOs?^{WUg-9`8ic<$ zdC4fOz3*Aftt3ej!L`_s;Evg4H4_WLJD5$LruL# z6@8OM8gHyYJwn?&^=bfgw%wtt@URnoZzcG2Cr$DSAZBo}%BJy-7-g4r>a$^%ZXVRg zIru%tIUkxb{CI8qUj3TF=HR|nSS~sHst?3S@x>~g6zeb+5o*QS2J+gH{}rw6%FgIG z;--GIMzA7r2+mP!bF9|s2T)_HU=%~|Yk`3g?R3?C6H;0Mo2Jfa>7&_dREuG;;wJz)kRNtiaAhVW(sS8nML{+m@T?Xl*$Ob7otOvP{387s>J-4 zAMMA`&dM>8yV(-;r2_n~`|(UgBey+Qp|tLLF^(>r4}jX@n{VKYW^yQQn1K5qI~H9} zqj^#;%NzVQmQ>3aNc85h+*tANMX@||ML$t5>cHkCgptsS>$C}(7^9O!D@IMy`AJ2P zG3g&9R*Ak7-q4X7-3j-+h$N^0t$tG*h@oN3e>D`E5$y9~T(j9!xH#6PIdMzcGv*X! zE5K}DzreC>i*+T~5l^W!)-034$+5K~N)7`{ipKCP=O}Mb0lFuzx{?~On>1L5~&)zbvLk_zJ)5~rJY}z@F({(GW3`gYy@6A8g1y2KJjz* zzz`n!+Tx>7N{aCx?&c@Q*k=pTnJ8rlZpm;iEYGAsx=~2XXie4%c0f zC)*kPS`OD;kUwyEI*02n$S*kD%;CBV@*@s!=aWEpLH?D)n>k!}LAp5H&*8cY@(&!o zn!|M$vUJ+W`aqc$)=v;^4{UIkISov&ps~C9X|WG+<*A&<8s5{vyaQwhtEDP7aczP zxEK$geO$ta&OR>N51oBnK0S2yaanoj%yD_?(3#`%+@Uka<-tQ|j?2tLXO7GDht3?A zQLH^|QxSD#pJ_;ztx59zLejq;WVmr6vI(E*HBzD2-a_41@K|VyauVVo?06NhIG=@m z6xH64u^X6~>Zqd|MjMbzUWgwI7~-lj(N1(>_($JOqH3pAF3V&!g;MZNZQ?_C|1sl3 zK0)V0F81_*T#P(Oej53Y`~>nI`47l<Zk#9#{BhN%WBioV3$dfY~iNlmt zk31T}GapC|ovWn%%tq(vX$IH1N&<)P!ZQJ#p)Aldh*;rIbruT3lJQUtWOu-{j3fes z71aa^j9hmyT4Gz*sq7A<l*D1v2&QD7QLRN}VFq+slZBpy?rDuWacgjs>-$AqBV*tAWS=8TbY|u$b@)9= zN(z7Gd)A;9Z*V?q5R??QyYIe)=?~h3wW_iKo3n{LDD)la$}pR9c!eU5Nw-gk}21-1&Gfh`kPvc$Uuqa~9R=DXd)gF+}A)vh;fVLVIONa;;V5 zau2`J$CkpfX#$NHF*^5Z{Ce=bW%y| zek|^7JpRF^n;oW`7;VXdU*psfF9 zsZLfBH!S5{ahfh`!Reshf?H8J&a%}M=V_+rSK{^9E^3H@jNVMhs-`Z)#qkcB7^n=s z{#+!o52{=mNN^11AyQ8Vp(?-$B~;Ehu~Q@#G?E zdP6!;(>sw3+S3Pk#m7qz;(?HvlKWZw1wCtW0{N12Rr`i)P`2=skc@n;2=LmkQ1`-n z6F;X1;Itd)0TjNE=mGS-cj*Dty>fa0ZEqPpfU@@zJ%FzF0zH7LSxgV0^U3r8D&HUI z0a|h&JwO|7rw3^946d)e&0UeN9$0Kb95Lxwm# z0^nD3_#N?j1i&xi@Vt0E0^mjtzcOBr0C;#mgP#|#M*w^~hj$BcdIZ2fLYy7}@cA767a>lM0Qj98{yc~4uGf5m!{jfBxn0LG*c}MdU9J}~ z7#(ld-K~8Y>?(xmuGWqp2}b++x|?u(^UiBku+1F;wkXI)vu24@D)ZtPI?QB z82*x(Jx88M$B-|2o`U_az;g&7yBE|5cuUM2b`i^6KcKF3O=KJhv)Tel6x5S}xSbjL zWlrK)Jotb=F{}DqNVIhmdi_5mQP6nJ>v3KrE({)QB0fD4#dWfURm}Ok_T60}KMo_D;YSlidd)u)M*B`Y z_m8iH!pA+fGW8V`YG82(J}@*~ZS9dKPO(!(H@gnrrrKMA8+PKfZ_#cu1ro-?qMQp> zmo|toKz6V6^u$Q!Ryou6M8umLDY3O;uzO%22D>Z6LK_ESO!VUs@05tM3lgSU1OX%a z-1rerwLSBwvQK57^GF#Ud}t#w*cMl<2{)SYb9exJupV`~mdx8ta^Kp7d$9SGTHJ!h z-_*-M8Ae+jX(KXbM|M#eaO)||P;9xz8U+`B*8>&z>w~{L1C_wHAnF-6S*?XO(oI%? zp1kCbEN=ht`+7#~2rL8LpmZy1-2a4Yg(8Ea0C!^mDV#bTtFW~$ug(?1zhT#XG9ca; zioba9Kf}{0XX5z}duz`-Z1{ztGXQUXHQ!&P8ov2T;Dv|Zr7tca%2R1^Bq6kaMbQ8W zKgE zM?;hvKSWnSJ1Cvq5^GGOXZq{QKWFPt;WE*YYK?KNH~w#0-)W9-y`1}B&2s@8@Yokn zO^yW{FxkSsSUw*=NN2LdA{KS6=Tbi{wZ9HFn2F+V8@GAP*iEfXjMu*F9gqWguSEA0)gt&t4Bx=kx?U?kRZ zuyA!7`>wXHV9=!)q4#x@fTtcuxPE8{O#LIaN;6DmLN8!|hnwS!2$bjiom{Ud*P5BU zThNET<&^TB=@9hI^ql}d!HYh^t9?%PQw~((nhNHB2&Oml&I-S0tW& znqp2@b+Uf3GhQm(bN%~FiM;Ni{1P{+_ZqC1&{-L5j?(>mVsot^ST*_vU1o#i{?v@~ zls<`92lKR!eG)H?K8Z({tpb6#H?8Y$&-aO) zW0RAjlzRcXTt1#5$%*vw$lx75C}u)WSRumPhjRtILT4O1AL;C#!_G|6g&ex>Ao z(1dJ>s+j~smJ3ZRFFUN4gz;#>Q%mryT~AnW3C04Uo5{0Vk;0QQ8iU_|f&tQ=-SQZ1 zrYU~Tv*}*DlrCl2q2-$Zxq>4r+j;1(oEeCVMr13AR^P1HVLB~|*4A`pyxqG|4=zr_ zMGfUbDUoue zqM=R0D71-6v0y23A)UuQ#=@HRQCL%4>J2Ov^fG?G4>TOwLw8)Wv;Wic=o`Jg+wul) z%b%>l@1Me}j>3QLjq(?c@`^RMk)f1jY{9QOwMuN?YSF&7 zN_7TM86BJ%m@~)0*qUlBR?Cv(o)`|Q2;+H0@9*1oJYGO@3uA(6lh(O+0`42lqhqX*BUa9r|p-ed3| zE%n?5|0cs}RN<0irv%_gIe0?C0nkK26mjEAJq0+#azH|?2#y_}@E`q-9Be|Sk4HDf zeI$RCCVwe?_y>YT`YRn&wD)yfR#{9%3l9?u)d^5U6yHw$ZYxbAkwGZ=%YIHbKrZJ?Sy4$0(;Qgf8*@2?g;ZIqqXWq9+m&faJd2<`vbQY3A%DHfbs}~#ab(lP(NLRPG+a2zmkDSZ(j3>fjp%3vN zX{=)lq}hUN+h2;24m@K8=9HW#0?9lWpIII|e z*LaKLw!Brn1-Q!1nz)A3_JrmSIHff-uB5}xLd z2YSABX^N#aCJwR6H43$sQ`WdyujCg;Gu?pw=$G(~59LL>gAzmtP3sGyi$7dI3{`qA z5SsV7_76&L{M3TYt=?rMvM+(R-?0#pkzD-}O|Ze+PrDCy;4*w$V(8vVFx@#6nZ8HI{Ds;WAJt@o;VqEn0pG{vd?sa&-WbBvK4H%S2skmlt9Vh1aFAjLQVpvVHB2 zW;wVVLv#RZ>0&--EuBkNn#WA2;+!4I-^HWD*YV_7%;+cq5!;=eial4Eo@?bB4t2f8 zwn@O*X~V5xcB}XVb36)8{PiUJ0gU~A15nU0CjQoLfk`<%WtkvPU4w3%ARU{_{sH$- zMEu%vdXC?;RCL+0BN=@0x>eKyHvRFB2#sGJ!Dk}ut%GykFEk7|`%GQPxtBguoUN?r z@o8V7R8mQwprqgyQ+i=@6*39_`PuzR!wt<>$Twq425XCa%-vP#e8-Rvb|=E|b^icY zs-ypPd_9f7h(-BCTgvg846k7vWvW`)HTsC+>r{G480XIAMq`P(N4ps$KB#k-b}iO2 zojbMP5GT%jJrFl*TSy$ewoKMmeFHV->T=;o`sIwFz>2WGn%jQ?t1f1xgZ*3m4JdK| z$X9p@6X?GN^w0VcXgZ3!V!}bAw)YR9w*K1d2htt2e}DS z+@#%!lbu6xt1Hyz8Q*+LoX2}ZqT3N_`xRuHyl9HB1V#|>4T)eWG+c^s>Ue0zVbV@-^45`xyGx%~jaky&$w6)&N1P5gDi1fQu1>`TWk3#wO~O~D zkII@D8I;(gj)m8pjH?msPG{MNEavn5W#e`0ijyTcS%nmznY=Vyjm$Woj=Hd&;4n1ICQPCh-eU z^bvMS+jRiR@9ob@eiX^zJneV;G0r=+wcKrf(QRL0#x_i>;5NL85LR;Nvg2g8@{Q4A zgpYFXtRPJ?;A=H`AA~+7G-1*$#&|nRy_@A=DOL=;n^oV=Ng#h8bu3@gq+U2C36|V* z3=Q=6en+lrIMVT*9_H7DP^6LT2|X8XnNNxgPkbs^qh0m3tF8`GH;I*47xuNocdF+> zbl>wBvV@cz!ohLUPwSfG`d(5m&rvIjCo7f3)RgdK*wd9GW2W+QrE(9 z&e?ZTuZ{OiPg7%TiW-v=pNQ*qHnf~?{PAqkpGqe}K!zTMOo3Ow>~;-80~#{=`U<<= z*QFq&_V*Jkv&UgH{^keZ{CUjzp=w+>G8~k4=IFOb9PD;X4zABhulQJU5c3F?75onk zCIkpF6chdiDTn_6MPO%OLKzoWm$R3ODcPaVu_cE^;ob702u}q#yexgJj;FQ-HYWA; z@QF!viWTQ&I^s7y#+@-B04+K%#-*|QU^%#~zsXdZ0}sh$iuKPZY>E}i=z z18_N3VH3%*sQTmDCwHmxb-rB^2Fv+9=!4JM*%6h6i2O5q6Q6Dh{qJ}F1} z>Wx-4H-3T?Af?*Iq9QyF$5V24P84PhJX{k!u!$$mhecfNVI~asTFH)*!;Y97U4-dp z?8!~3xkGP?f8Ge{tGh+KBXuaaM6th<3KMrTRf*RAUih|_gI5Efw-r(tg-wS;!BmGy zVCTK&OjN5GBVY?ZXrYEDMvCku8`V3lWXSdNmtHJ~;A(whpsB#o@?=~cI#pLY`a@ig z^@tX2bhJD%ghaK!Og4FQ17(X$9;tF-LW81*6M;0#)&wT72b?D!gsJCP@4KGn0Dsxp zCeIb3Qg!+}saSUB>S4gH&}GAqnxOBwb)|u9L~CNrD^vB3S@n!e%fR|F~@DwLB z)o*4{dhLA>0^Bn1D9qEqbXyY_dI_GJn=)?CQN{m*_c9%ecm5zEui!u)x2Ke`l|#i4 z#0ITH=Oy))b3olJbkQh*Zrfu*BfSi2We(bzNA+vx!$?^>Jte9;ZhL(dpX!69!2t6#fz5 zxu-22wwyYFi%)v&YF_+a6#b+%(JjU$Uq2_Njajdiv@ehA15fHuCtKB__o4yB172zx z#+dfJxGyssCBKY{i=-g>$B5akv=3Ny)rw!UhUiu89g z(ko7CAJTu7k$z)#dU-wCpONm$POnA!tr_XhWT$r`{i=-g>g@Dc@1gyt$8ROl53V_F z`;H@h+nUqjKW!!2pOJnN{gxp8R~hLyWTziO`Xd?X<4>Z``)Geg`h@KCc}Tx1BmLU! z^wmfol97HAqaH%~!PV*XvXkmxh4yEppTvKDq`#YyJ~2DJ1?j)aNWUpN-TndEpOHQ_ zJADSyZ_P-bot^$B(yv;5+V&N%M*B0;Pv#G#AN=67->*dawv6Y}xQEsem<5%lBm}xB^CQIyVR^`7-TBgu%#Xa?^vu)bULtI4|c~4Ab8#`vbQZjBmpUtb# zTKOS8A__uAiRNke;zRnPwl)>p;SzO1(SQmB?y%G zTwipr#1nc2B`VIY#K@VoYGpylY4_g6 zFo(0t^Pv3RBR0oayn1fI4UC-V3n*5ue>@+j0#2=D0$1W~rdNO2IFsj1D)W!jM6+i( z743Ol=?-kTgq=llT-2_tcg5S4h-So#nuk2l-)hfKRQop|a8xxE%JpO?n zTS)Df zHta!JpY7-Ds&KelpSYdz+^puRMYYjN3H{F}oNzm9HOB=j%>jK>_iFF+kxHrTb`dA3 zY^EG+Gl|2K*nv{LJDaU=ylg_TPrj*&$Y9@>OkDgmxWApNx?2?UIvAwX1~dP(Gw!}l z)z?~!Lml2u)qVx6z)E~ccCx#}v0Ywt8{QB-WM}m1rxe6L83uzOpTJ5h;!@yD$#E)* z`cU;>LPT&hdJ~Rga`2dm*UFO4u7I=CTI%a~@&(n|?r^rs!8d`oyFoGI0zcXACEDu* z@jq^UP!3&!HTTCY56Phm_{n;y9KzxkA4oQ=-4lXLifd)u^a6URGiJK9Tyb^~p{OO{ zYKi*4!K}Jg2DF^$BRSZ@GAOJs5161~x;o*?&bc!FQ9YWuGDUK-kNcpw@ySD?PYXVI z8=0^vY71Tbt9C-%_T4$ky;XkTJ| za~q#eC7vv4*tkA57H1G|s=S8lwyT2?=+0H3_ET^tNIyhEn5_Rb8r{k^_M-pB{)4!M zRnn#}^ENwM#7`G9>xh}PB|B7K7vIP2a(FxCMR22|d`!057u3CoG~w*Pd7~mpscA=u z5jnVpK8-#uDZZ7F8>FynJ$A6c`(>BP!53kHx>jS``*BOki<0VV*HojqdlJLz(>Z^7=0G4#HI;cSpcJi0|BBJh)q60lBFXDnMSu$CZ8U z(dl`8>+B>y*_nlKCs{&y*2&qhbNM@~yy$FPlX164J?7)<1|tu>vqxp{Bw-buDxFYV z9qWc8&B}wQ1If6e#szG#ii&6C9bb2jQGoD;w9+Kx`A7moO1!yT*p^Fl_=P(BIUOF> z;TP-hc?=hRK`;Lv*07l!eNK< znq#IryPB=bTm+~_)ifJh->z=9zFkLe`^X3zU2#^cwN= zQkxvaT`_hCAIhVr8>yX&uR}Y=X97s}s@CV1TIC=lhsgC&A9C4$rMTL)O}rdR?R)!H zv`<8F@zMKx_wsvxtoHBF$G+%VtqA_RmK0Z}9fW(vt$PFShVL%VsCDlb>x|Dnf$zjM zJ0A_iaW;cPw0~gFn3+)wY={otE>nG-QR^B*5Iyxv2%^m-72ywevm&vVGM*Q;?fQxC zHN}~lW&Vb@rZt>u~8(&@6+LT>F^CY{3ab@RnAJls>7{*`M(~qmdTAafQvR;v(VPNb z2Jk03cv%WO9N@h=_%{aFd!4e4dWW@5F{(9RuV`UTY8<25`%+(AO#B?3CGmi5N`0+W zr(;N81>VoE6vYfcG46JpdHC)!G2XWvW2PbDAzIm=K27+A6J6~kYp2rj`<5)@RFQP5Zv z^x#_pxi|C<9-kIt4~V4TGkVf>l*ISnb@&_|K2?X8>hQ~Tf5CU@@bBvI;fAAO7KJN$ z{ZCJNUswNs%2Znks(tkrk@Pz~=^<|0O0=y_PYUQs9>#ek>UvL4x?fM4r{nOl4mW%o z1ayAHSM@RxP?^*Y?}ZSW@@evuA0d>gFM;j#{I(BT_& z_>n&gxZ&Givku>-!wugC|Ip#h3>Ur)cIvQq1&nOkuyVlSI&6-B zT>@A_hutG!d}i13JpsE(;1jCE5t$u4G|bxgBQRdlap}A^wZ;yonbgwhXx9@w*nfMyDL(`7jpLy9dO;_GyKjF z3b?X0&}c4cOAMGRE)0=C^0{U%*IX5aNt$cbAor%Xysmv()U z@3a_sL9zy&WUq7j z*6idpUie24LSN}IT<~-D#PXRLHe-!V_1e{;NHDx;ZZ~{->Vc&A9N3>k9}b2(Symd! zBdXbnWPEJr1XTy8@9;3`zpgkn*aQj0k%PYxa`C_Y$|S-(h!hdnD*oQD*cvBoIbO(3 z>x_?pYTc~#u%OassqQySdPtk21c{d8>f>eJe@1RI!`~>Wr8B&(jy})k$Zg3KU|lSi z>B`j+T^GM0h6XmKqPHcLR>yWvA^ z@tq*gygvu90oS~7A+GF7CBODZQ|cnX9HgvSjnatXkv}pk zjL1wJiTTrViC7gCmyiZiTi<>eLvE&;hre#PwQ-wUCn=c=_AP*)1V zeTP>P1RrtBv^^&n-<23Qi7jLYh5Q$z!LKnM=0MK?c_Ew{CW}MUMrB`b83zs_ITc@o zitRA>muoMcI7P-^F^U%mQC)mB<<p?i7~wmj_>0{x_bB7`p4V zEuuc7>$u@-orIOP7x9JH9tRUD~!da-{t7sqP-5; z;SJJc5LyA?UI1%TMS(NczDlsfyP`WgVBw#GgANjw@ zlKiOYAmswI_#3ZWw1$%2X?p+9o&<&lN3=A??IceEJ-KplFpjYFkbPP}57B9d1HEQ> zVOI{;@vMOczp{z=LUFgw|CIT`)uA}squ$mOOJKziSaikr9%ath4SVq>Iq0JLSHet# zT-%_yTHtYgePFk&)GQ&DNO3kab7PpCp?UgK$>EY@vvZlCF-xi1q-#mQw52KYkX?uPpLJDzouX|hEYo5?UP{iH}Mi+ zBhxTql7y1VXEw^y9!`qbIhlFsFGqYl8BTR+72g6!ITsu7@@)9vZ-EmoT5sPea6kRg zKFfkzQ}u4r;V%F#`iobhxDSDgwiH(Wx2J>hTKM$os9wAOh39Q|SkIBnxg%;s5Zd z4{g6TNYbeeuJot$nqW%WbnadF)AfJqme+I2msQ%Ku< zc7qY*^+ae;zNfL22W5TjUm;Tmb6z3TL(o9ht_HZZN6Z)ATFCWROu7u$b|2B_5kIP2 z2RNn)?Lz@y>%vPj4wcvPEUg8P;Movle{a+ZlwN(>>dBC5IQGj@4O4FPj>CatB-PfK z45_9aCwv;ewg$eC1AV#jb1e8Z3$<Z{Z#8!;~HLIO2Q_ z+#-iQ1caxnMtZ7UX49sCf_EGY9FydQ=#a+FoJ-5WStazctU$ZC2i@i=T>E!atKxf} zIp^bPcdDv~@!Ele`wt@=%R!o|;KsJYM-EF-ER$mFw-pXhP|= zSlk7Xv%@usz^8fdO51jaYYs+S2lHKtaDF*u?-x4k-743&B({;F(i+%cXO&N0+aT9p zmsqw6krLD3v>mFfSGGV6>x$UIuI)l0F%k|SFdF@20vC|f{7ews?X`aY{Nv(6=k4}}$ ziQj_Hx&D}PH1O&1e*44ue0)1&ouWwDMrM_>E9&b?3)%DVxLDKKnx4 z{mb)=^7qP~tCXYILUDG*f7!>?*;LLnXGfX}_%b(5s#*hyI}9WO4ZuL!Hg~;$-iQ+e zJ=R2p(i)vU;)HTEK3ufoZ7NnG^`Z;SC_bfxXwlixX%>R{=bcRjG*U)N?UUC|OX{hG zBdD-VjH4VxQBZsHWatSbT~&&(KuPMca&Ku8373g%2yuMU-u zt;`HxqO=@oB}tI)Xq_V~yOhR*ucgLHbV^d$g-d)xk|qNfzu`sRyEJU%OW2;j0)<7d zroYrEbX}8DSBAIBLM1dV$!8AW1wMZ6i^x75*?G$rx~GDfp$;D_x7w*?&+AQZu4Eft zozPGrqOf62TYbceg`Z#Gu~b=u>s8HsOJ*d#2#rb_I^xLG)8y3C^wiT-{fW4!Gz3iL z;N?R}l-6G%SV@fn>(E9|!Tc}S>g0F1{_2wGjfee5AC?!ukXE@I>Vp|}(|f5Rola)?~NFZUSxxSLJHRpg)uo$9!L|V&{5Ln7= zWgi-_61n?<=VOJuW?Ql`#@$5Sh@62=vl8NtS;Hr5*PzFhZsjE$Bd9GKBiF6By@dQ_ z*UNPc{Tdy0f^WVUY%)d6VtbS({#=^RBG$aJi{)T3e00BrBC%U~9=##*!a)39F9&mx zDyrftz;!DaMdI&;#QN~OHMSoN&0@yVqO4)`Vk)BvA<6uwG><+~3%+TV7i=7w;+rR^ z&HtWn5PVzo9&}wtx2GP(DSaw)4B8{DVBU#NH+YGWlvY&nU*;X`lnQe5x=pYPmb%V- z^hN|SkXHrk*A;U^qEjR#3X&>+AKg6DXhU#tstwSa|9u-8>WnsAcOt6|b&Nt=ivOAG zMVqE`o2I7PH1*^*;gYB5V$XoX+&0n=&qtqKr8gytzY|jpNcF)BgHrhS9zPTOO)31J zIIiR0H2Q$@QAQuseOn)>byJP@or1p-)9y<5iVeMTAc^KoL!t52;lr@GEBck?SZvB)r%INe#t&SDq)5@W^MO2+N zXrq%`{YU%B3;#Zh3HVI8RRD9P7bs&*QdN*?x-L zVa&)Hq<6+qpMAMcu%weIJC`C5Z{-NJZWNXN zD)Ry+jxUCwza}%hBFS11X`f0j<(g(!qx?R(VE$3`tGuunH?}A(&}1gHWn(;B zX!Z;>Q9k6Bi`iUuv1el0-JS_T3Yq1gcYxStuBE=$S&8>l@{=jnD!_Y$(#sx~LvV60s3rPa zyAQYSU*fJWDvnE3C#!+lp>LSFJXv?Eb@(D|7E(@(yFQ8VU3mz(8n8i8QfZ2mON7gF zjTK_p%`um>WwQ6V#BpV#NvrM25ckUY0|`1$4&j=M_FM2mV2{~R2Z1X;W$O=xF*4ZS zJ4z1Dk#TjGvic8Y&KGlf*^mo8g!3ssIV2{w(`rj;UhYoIsT;pJlRlpwHToQ}b~EJi z>2>W>^`-mL9Ya&I99n*m5so1u0;?0F8x__rfF+|ZFSv4K3e(pPoe8FIJZ)e)N?`hq z&?*9qpUF@v0?Yy?1J3|+q$wp%kLW1>@FbL_GeG&F^HV7AKX@i6A5jgIy$ApEDBpPC z-=qBIc`1~yJ0p~ZDo4qfNB`$^DOw}$yBGbu1aady-}jLT0gErJP(Sz)q} zbaQWcptVpH7Xzc1BucCD3*?|1F?cy&AZ~u3p)fjKDu_hc=4ed}QVRm{LI)R23Lb9k zGjSgMGR#?wNkRW07QNl9w2tl;6*A?fG3CmOQk1hEI0MQlbsZ#z!qJ`dH{PcRDyj^O zFi;N8+Rqey@&6A+Z=gShpbQ+ z3|>L(>i-0<%+zrX%Arb{BD8Z4oun~i9te#>(#AvCEiB)c%+UV-RXbOomDc~e&!nAK zgj4$ezW+=+GZA0-^}p|$qa#u%&)Ih-DEk%~C?EU!KaX)x%43NLfFv@I^Sp&Tt1(7(2$HcsW~EK z5i@k=#^q4=@M@Jd?JLk(^w>GkNhiiIQH1In%N-c5mKu9(;c9cLFK~g#=nE?~bC^x6 zr7%vcAx~5ob*!c6>e=qR6mPwiI1}Dl5ip2yRYEr-iMOOW!N!T_jfUl?8rG|&o7*o1 z?aF`_3SC*utAV)X-?sEvPP(PUbwRbzWLi5KeDJrG^-Y2Pb=I3S+=S%taR@A)SBX+Uub8-J#*$8-1ANRUoEm;hTt5jd&nMbc;iAV1bk6o^B5d9Fb=9c;7&<~EKS|A4(lU6(bC{||W zXRP#$b0eeBfmcOuvM9VJK?Gn75|uhFy`P^6Eg$z8v^?5{nL`fkg@bs*z?t)oF5Mc( z@GuH!7Mj^(Vx-BzTEbzMXnTks@a4)FRyi-t6khVq@oS_-oUO_F`J%PGT8+8g*p&?r-a-FprmJ=3@L4 z{Z@7f%{Dlj$2<^dNiD|xfq;==V(Sw9mD(X4EZ1)mE5s3dewekx2>%UeSMX~3&*;ku zyqNxO$;LoW(qnm`C10-R>Z4UsYhtmXdP%CjUTREivuWlTQ>r{}D{0W~+YNJ36b}XM zVtx(_ZY#Hi?Pj538*D(DDzhVc5D)T#?ZinsPyE;JGvSH*9yfU6^Uuy)Q%$L+4+7UI zlK&_I&r?_VkJ3DG7d>cC&>xJ3`x6`j`*AsRHwM&w$fOJ8VCYzC>3YGV$1()gMmtvS z&H9$~+CrQW$#*o#Avk9h3Prgbs>VP|NiIt)Z@@{COVTDDGuS6)8YzU=DjMCUk_N-6 zyDcO3z#POL*b1lae>&U*ukL^HelqwXa#-av0XT*p?IM$2 zc?lO5#g?e*>MD&2)*9H~WQs`P5RP_4Z^rh!Aq)mX7_1S(AWvintU*a8&j9}#yv`sC zkMI*OHFB^DgQYvz;JI6XE~W8Lpvd>B8|ZnJ$>|L|WQdnw`p?Bohez$iF31Rs|4EKsIrwMpGwwMa zY!SZWG`SzRuywNF8~?oFP$IBhEmqgVxrzVvKT5cUZYKQRuHkE){-fi?v48*3336~6 z6Xh~FG`}z1nzQn8uG!sXyg$YKs80y_NWr?gT)#15AIP^?zMu?7=4&K&y%~;yVe5Os zPfxg);N^*!z)6?jO^MtoH%11A^BpU6HHpoGn0ZL7LbAjv%-PcOfB%UunOGzex@MD3 zmj|70`zHq0o{5o(ypNVOhY68rHHVuFrs~0otxSeuIjkKxo>@U)wxP?C@+_p&JAb;<8&jli* z=cclpIRnt4&*>f7rqd;{(SKcy_kW2GW5J;U`|D~v;~0CVj(eU};67g99z2#sK&r;u zs&X}n^?a$~a$F`t8dUfkFZA=hefk~K%f)56eI7u&b!e3i{a=P2(xFpy=z50s=+J38 z^v?`Eu0wCrq0ckaloZezI&{8=uaG?#8m1@wSS08J_s9H^RZqKL|7a>hZ94Qp9eNEz z?K;$>Lq{4F4A&DLGb+GpY+T}x3X+h$XtPPI(yC&WHsq(7)9BE^z^uoQx>Hy>pI3zjL2!9bnIkTBFTSVsT0&5O& z=KMh4NY534zJ8uDfi*o0a%6n}vy;9LbdDt1H(c4T91!CoYdi+l9On}3(dyPfPd|CV zZ%wd!(H|!7b?Q(qc03h3-ICpe+r@dMb2#yW?8HDP+)YmRuR-sbJR_MDfpL^^mHDKM zW@;HV!^-tJ(i!hFe`|H8Z-$La$f&B|Zkd#8)ZE(`fTN+)HM z1o8zZBR@7fGz(4XjadixoayEUT&aPRY!+6DQKot$L;7qwLfn$6;HnV4w; zYcSMlB72BsCHNJE2B+$m$&GVo*ZqQI+oTh^Om47Xy7?BFEC+W{QeO)(MaCex#*!_Y zvoI2Y(03gc^?_KZZ_6wK#&l^R382_OiN8C`qz_2V5He={s~7N9U-nn=0D#kUV1W*N z5I{|DuFNA@4&K8rqEmyn9TUqeH!_fU zUk*;>7pr)=nqO?<U*6`39z(Sdx)iN#FSCKQhbnq`tck<)zk^W;_UW4GiUQcFA>!0~=`Q zr&W9eJE|zPj#=~%ypKq|+y9YS$nXb^1@QcjpctLGZKK54`hOp0o%U)1m7JBT$imNMH-9KQz3|UmQXi_V#k38J~WkW+NbG5cr10cAOyh_$*TP|Yw6JU zGed)#MTD67r@$Vw_T&Lj$eto=`8K?toqE55-_J?CkL34rQ||@zz6yuL14kvV`JH@K zUrEFYuFieppbRh9B<|8pdEi-3n_Q|c3Ni1^5#)w~D5j)Mwq+Qk5%kXMhBS-AEts_>20kfZMv@T_{fRuN)ZN z6f+GAPm`#L;b~^ErW2lQL7(wrPI$64IxR=ps;|8@VOyadSw;v4(Q<||2e*-&uT4>zv&4=5t2-?)UaOZOU%?+C6Az?BoFBmSE$ zY^e`Yt$b%g|CsN#r=QiKj6j=r&&s7#Lt?SGn-SPMLUk8JDvAP~TA;-rt|%f|DN4pI zY^N<=DoW4OOV7MB@-z53xuZZWP$y&6($yLD6w84xx)pDSae9B(!8cS_S7c&Qpv4yG z>T$(=#|?E|Wa=in4QOm&Wt&$DLZ$w=7C}ErBL8M2fS;;p~(bN@l+O;h$V2`F)fzcq=%o$;>B4HTIHHS2$d0B)x81FX894#;TLj zlZKEi(F!wtV-7S~<+bIabSgOnXOV$DRw9$6 zwd1+Ts@=$QWnw^W`2;aPO=W7d`uXmLrWW{kRme43pD5It7g`I3!OdRMrYp% zrt{&7B9b;wLXX@*5XHGuy9X)G%?{^I&u}7LW2bN{*`Zu5AvV#Ml>9)>@w$noA(UnI zfR*%Z(&#AFwKHn{+j)>;o!#-hKQft8Lu9kk0ta|Us3&ll3f|3J9ife$b<|5+zo7KQ z3p_q;Gzd3p%JGc*l9#B?0y1R+Jei!K~i7^v=@YNfHGl85;Lkh+>VOSp%K>XymwU1WtKl zv>Raz*oP_&E7fU__uoVu(o-OU){#Uj!fm(;Tuv)cTH}q-hkJG24mR~X*Rs#mdrYRV^}NdY z#{{b)#5r!e%__t_p-m~Hhq5lZhjHE*?nwM?na#jXv;d03zrP;W?%ye$CzNW$Ju*nex3rfD1D} zSweuq%uk*pfF<*j*9dT+CgYQp1o*Tj!==zpR zv+rQ%e;lts^(|Ap?W*?$_<;CWty$XmnOSu%X|@)0R>G0VF!3{7{0za5#l13O4zyST zox8*4iOMF2Yx$gw2;$@3OqIdrn~uW`uAmaV1HDrdmOfNon#Bx5xY)#*1&22%Ki!`) zTD)Op1vGrsWmBR*<1d1w1}wt%qv|c-jJ0_7g{32kZ?Vc2gChKGxHmM1?x%+wX5;3N zN7pTyLqAGA%`l#vtHHboxhZAdRaCvU8^vBc-*OXGvbb*ARq!(x3?=2zx*^QYrOw52@B>^?@!B!2ma*@X#gj`zXt^BxY&Z`}ha1^O zU=73MU&%6E4h4~Sg`mn}Pl>t)pE!J!6Ap~TMu5XbuMeFAGAx$s^NeqUlj&P!7yOAj zTa{zl1kkSzEryw11+ly0M_h1t&M;LhwXOl>RL08@n{8L?Ky;;UuE8Fc@(KyN3{`7h zQ@zhYT-$S1-%`b%rC-~eXK8^PnkYeR z=gPsC3H36w9P9(Re1&Qr@_rY2y@l#*D_kJ^3Y6=p5OtPKtplPCMoA8y2hur%W1KdN zbFq@Ex(d}ns&l!cb+%b)h3A$9Z=3Yc7as_owjJ4}_()O&$B?9U(?nCKcpG@qS*jN1 z&hG^q%fY(}nE$2b`PU1;6aao)^S%ZoIuZGNG1)l zOth)PIeAGsc|kvLj;}@WZMM*uDyURC2wmTD$96(@yJMHU@DY&T+d$NN`Z<6b)t&N=)N8=-Bhg%!s7B~f{ugcBA+}^X4 zruKlhT?+WxO>*dbP{i39GYtytGsBOKdxPqE@lf>f$q}dV4p>u)uUW_Lm+MsXjW2$95t=8J5^VEpwXNjv}z5Z zXOY+5%D2j`W~mWwzmIA6V>Qav9_bg3BD4uHd!$^_%`oTc@-fcM(dp%6XF(8*?r^lq zPpuvb##-(0Zk}_8>fPMPP;jQVH&MT;*}M!iTqOgL3t6 zRNrc4-fygOeI3x0*D{9eP{2Ziv+6gt=BnRt9MtIJR%+I>$G9zgx1X4`Ju*1VAEK$> zmxM8v8U-!dQ?zhxCN@y)FA~ue z&x@xaf$H0!RJ}~f*kbyz3nDy?dx!2Ie2n-88j{rG<(b6uU|K5PlPOH!8Il&J&ktc? z8mWaqR9DOr`Q@ModBoLli00eyO7QyJzD@FTO@{n@u3=mg3FKau{V+b);qh^H4Q^da zC|FpsZBVOL9_L=#piW=aqqtXtrCl3T`}>M(vt!f4w?rR5O5a4Qez#ZI+W09+nw8QP zwPu<0p~baSaW^D#F}KhFDo}>0(~c`c)M-7+prorIdix2)-J@~wwKb5i(&$j#BpNo) zZX@j-ORUoo28%|T>&@9`N2IdB@o%P8Hc?etIjY4q}O81e2*T*bw(4`>{OoxlOoFI&+>Gt##TX2-MX1FNGp-1*T zl+l{oaCt8}%Rt{DGy4AP^Qot?lYSN>-{PNJWRk-hdZ>UrK!j7XuKwwImiAyE+R+2J zFDFiSFohQNWH<2L!RZFxTad|&>3Mu2$jB-N^X8|RA}D{obSg83E(2D-I040TiZF1!E2Gv$$|lvd8os$~BPs$7R>#&yzEO4wzL5mqe0G?{m0WLA znn>{J=55qY|ML~HTYQu>$86Zt-B=g%wT2}akMK(po+c@~sF>fPn3U*53vV_D8p*D1 zm)BNXSX2ahO!A_C5?4w z!(?EjAh0Lb-%EtaVw4jT z?#hxwzdQt5wpUZ9GVkP}J?^FI)#mwqq6t4ES!{7GLl}^8^OFL0hvDVQbMZS8L|(sA zmihAYO(hKuAKrP`$-izG*Xqp`s*?)$=fveti8XEq+0Ng`SZCo#BFB3%^{^uGG^YSE*8*&ToYDryw(V_b_Bm*3I&1kDlt01rMwuy7!}*ZWPLJBZ@cOLF}%mCe+M zRT^&{B!_;@f{mx#28HibCN97l8)cqqmgM^BxspDT3x}7FE0pEXz4S%W)$ZM)a(30_ zmt2dbErB&mO%acSW`2ir^PHjL+zr`c#z1zje&kSk9BbHOBdWtMQhjc;FeD71mC{F% z+(4(Lj9BTRd=XQ32>dUQ!fYKjL6H70JQKa3SO;Zr)Y3FZ+2_-|pG%B&M6SO^@vffl z6YLSp&tv|=81=QnSZP(*_{w4joasJ|Hup8le{SEM|5lsByz>7|pF2s1X|8%vto&5H zXee!hm9^>LWDH~Co%9eskdwtb6OL!|PR7jCj4{W@4|#(4V?Sd?NLh9d9>I19Q^-47 zS7wJ(Lz$CTDZSs`!AVlCcER&IYtEPPZA8Y@2~6FK9d!az*o`W4yu(G9{^}TZlo(U5 zP4OS89Oa)7_ZA=ZebUT7R)4 zBryDgHB%f0_xBpw3>FGpi?M)soBeQ8x%a!Nu{UCXftwg|{xT_F4qiy;1=}7?XEUd> z)roAlInwt{sugl*1#1N?9v8lh=WnOG7U(-I*Z!toifjMh*&t`Yv&PcE1^d`n;5ZT} zhyV`_s*OODVyD-#VRGm_`h7>D;$cpxHLY^}4N__qJ6dIdqp)C`XSILaP&pK#%!yUC zC2ff<1|Jc39KlUTo=<~_p_y8IkQd^7kIq$n@~@l3Dvm>FFm)uWNs~v8I{tu!;qwhp z$EV~1Ce}099eMDFhxBENvFT+BrKTN|pKmGI&{(U;Q)`}6>=w0%S9Lk4G98n!xKDw`x;mvk9*0e~!Vj_q! zq}_`kjTag|N`)d8M_ z;El`MO2)0cpp%-9gYKk-OfoCIfhPEqD;q*=V;05^A}GPw`7!)YXmUlFi!AZuWsm-wi(`zW<+t;Et->v8U4C849;uiqUShH3v}scg zp_!Ytujy+!RK<0+#!RM|WYT)~am|t8+1i!%61Om@h&3PX>yifT-96djFeTjH<2A^| zP&vIGuD2-yC4cUrt( zq)$XcQ)2$xg}l-WtkUAg-WGWwP1$_M;|KL{a!hxD3!Lr<5ud{KazCF+AA7=TaFz3?-M+ZW4VL0 zYT~xYZ5HO`2XJ(~m(rhti_%_FXD9Nm7ktpQmuyT7A?=;)9$!IZ`oNsvbeq|mJF(Q& zJ}>TYwd0g=wbjughX#m!wU{(W)AkCn`ExENy_?9^O&%Dqi>y~A=NlYdBdL4*5Dp_* zh*1yFQ=|gw1WwU)9m4kwu*2*NBGS?VIrxYb%clFn5*R|3>$gr)eEz7lPH1Z{V1=@Q z7*T3gy-Vn2g(s8ul$b$Zgspj5M0T>&@Cquy}?^Lt<0oE9S11s{2hivXuUuOk$(i0(JCw zzt(WBuni1N)wMEWollCYb|+Dl?BKK!j6;%<5oG#$ZzHo;)2tZCRQ?nwYh*X!I8k8D z3^7QiX~KocWZVS(7}v>!5m8^A)Q0TK?oRAeUk)SSAkgiAWEU&F^%Y6&#>3o5(tEW^ zmIU;er(HlLMsCcZ!3Oqf{LJDw@I+Dicz9KTIW@}U&8E+WyQNeU4z%C^@OpF`g&!0GwEpKr)EUo z6X7@BJdS&j$ey`^_y-FOJMRXq9^*ACDxa9t9A9R=zOpw(f?w~=N~uYw+_E<Dox56uE4c)>S^WuS(@4H{WACZ$ zKMi`jCY}yGc6@dUdW*~gy|)ge80%*6vyd6?u4sh>C%srxX}}UYnYBC-8yc>)JUYz^ zL{gkF`$s1++|R+yC*yhTY4N-+g=gXo<)F%PL}Am4j1azUik%^ja|i9Yk<>gXrutS& z&C16FCV{8>{f|~y6c%1WJAU{!R;b(6K}z8Z>M&(GDb&O1ugy@V+wDT)iDj`w!%5A+ z4Lt3u6ImlI+(oZ7yw+dzEGyj4lELe0kk>l>EGaCcHDihUc^jE>Dr2MA7e?>2YOiYI zH0({V{Vkg5a})_T$nDUS-$dx7jfu0!_8*vYq)l;?*mgIB+TQWs7X>LP0G z;I31!ngpyaJ$?%Oa=?e4$ntCLwBZz$tAG%|8313g;-kMK6eh}L6=%5dh=+F*5uqe&}IPFr4;_PsA%-gN>N*~jND2FeCc8>M>4quMy z>lnRDt;VH<5uxN0g=%iZRMwxYB+66Pk2EXJ+XWuL0ffWVMP%syMKXyqS6F?VPvFv; z4&OXVlf1J@{a=Kbi={Q4a`bbsz4d$r4Bsg~g9}+o(-?$&*cmN4OONe1ilC0|Ph3Na z0Bd+wi7F(!*yR0gC6)=in^kXDLaxQe8zuV7a!uac%9|Y9pZp5@S~abskJW~fb8`p@ z?7|$CzWe5~^Tjv)^hzgUuXe{vKVg1Q{@$mbR6&rg0482&YflWhsZuKf zEq5K+rTw#y_W~x}p!G}gc?D9MJiq4V)@n+h@L6vgT#B82Y> zYH-AQ7HK4)m;%d&v?(l+TFrW6Wp<2g`0iFZ#vpd9En+n%HsXw5o7O@V)gqW~K96=w z>N`YZh~6NnHC>5;Se+@e5D*8-CNhn*kD(cK$1m*=Ee%!C`v*`-IX(d)!j*~z<3R+6 zciML;WgT0d$rHx;$5VKncv`I)p?Zr{-zddbl*#vsw?L_}8ytV#sbysFJ;sQehRG@1 zZ+xCSp5@Pc9>;1cJmq{6bx46XPx#}$FX~(UKGqoyz8-On2z)9vewq_;b_6&qop4aQG$t87{t|+ee+NAyd#tjq&pX8|LXgu?g&a zjccMA<4o%!91%UIh3p#~mUb_T7haEvR&_7)%tp{&S3%SohRb%2^;UQ~oLsAMf*vu3 zLk)AsA^5VdtE5eFE~f$zL-p5+b(?B^Ua8t;kGP($#pQ$muXjkg5J(V ze3_(Olw`Sddth%d)&jTd1O|1#pQ6sx3{0kq@ND`))p!x%aio>0Q=I8r-!5XjISz^d zZIS+!k=(HJV6|L-RDLgbeZ$3-rpCBA&?%L)`Hx;fc3`xSm|(A5?>wmVj&Aba9^B}; zRjG+5a%a}kqf@PkQyBy>irGrV3{Drrg{)V0&HoZh2vUz)v$wzXr6t!?niMCOI=ad8 z9u-1gnKCNh==U9@4;#rka_uDzpkIq>4K2Y*+a9wgFVJK0$VyW>bimA7s@YO`Sd?M) zj3x!!c=2|LHJ@~xfvi{r>5QJYR)NHcr92<-`C_|DL#L=Xe)a?ep-6iB;XG&$O$6(k zGh#S#@x+g>A=h4PM0bP^d(T?g$*sg}BRXDM0 zJ|$b*oI8w)z9I#{SF7nOnqNmYn{fW0CWU6x9%|J}ruJWFrs=?qjFn91UZO&y1oEu6{IqdJw)c(oC2%ADjOw$vz?ehr@zVKDjMue(q#keW^Rca7MuP&)5b$886 z(3FQePgBnU`CCg4BgA4&ms-<7W4`cRj+jWSG4^tksl3|Jhx}bJlPQs>hoMRd&YgOk zMfAtz+{m5y&^BHu{T3@X)p9K&Z*@fml^iDR?wXmk{@zm0ca@eze`-4xUp%C;mm}sw zskd8c8ofzrbbR!PS@|eBQHtCwDUHE4@8)RLb-5_}g|mTk2M7D@ikOueQe-;HO6A}) z7O|zX5LYyvT|Cy?JT|@DLrUWqqSG!?1V}CKEp>Kz@?v>2Dxmz3Al2!2xr4v;kE8M~ zrgB68^2=aTeUh-%R!4G!4W5BzmwUg7<<8(Y?}2q5YF=Uh)NDTQh4sQ%u1U=^Sn;!Q zrmXmZe(_si5x;gFZqwhMLrr@v zH6zYRv|4@7a_& zVN?72%LdKx=EqDk%BR5Z_SaM#UU0-EKd}_NCOC~~*r?URYT}jV*I8RRn zc={6!)gk_}EA_ItwO{N$vd)wsDRfKn}JZaK()3;5+%$QnStU3#b zCq_2wAsaCWXB3YRQ*j|ULOO{fIG3}XR|XOHyEr~@9C%_B+y7idp<2mfbpR#YuE%hH z_8KgpwT2FR`m63%eD>rujD#ws&YNTGU~#C4kDYZu3%K(dUXMkk0bi?$J|+Z-4=V^B zXh{Zqn@yf|ut%wi%LFX(R&B`+KAMl+6z0EB8})aTf>p&(Gl8`aaLICqhei2&W6=)A_RX=30Y@Gq-S(wS zd+HJvwwR-?DA|!1SX(y1bM?3;?=_Xg{FU-r(y*xs>#2Zn6TO{BZ((;={2c;BsKFoPJE@zGSQ+k>nsI0+jq5!ER{|b(|1;GEv`i%9;)I@_v;G69vuH&gbyh z>}=pU-n$v|5+e#x;I?nw6ZlMu)^yNVut&Ymae(4AC=M}SRp$t{xe96Q#BoMRi9u$~ z4ERP$o*}BwrcSC--6MI%Dl1M-BZ?NA(+S1t1f@IUY&#_oBOblVAQ_uRGiy`LuxU7h zP#aHPNrb07UHVmI9+2(=e7xZ*aPgy;#&;l39dalIBo|~pDy%xMXojy;>b6UoO@%}} z?fXeC!-iPe(dZH6pUU&B655QHXe<4Vdx2B4TE`%&=I2+zsI;h@`ou3|!3p@1dj@(5 zjRgI}=dQ$uWC8H29K2Vr&gjQMgagLSyeq}%!$q}Np6RAYUfBT8;j)pQ17-a@Uq@FQ zMaA8iG)H=h{k{D>=PRL3z4@2xeLjlI@YqNeCcZ3Bw5iU*z&Mj9C(vL`93JB={6Fly z4SZcyl{b7^0<ADVqfJQqB)v^PprN5@C<-;)+Nxs5=zusg&OD=|qoX(~mVzy4)dC&q0HYNGK`VAl}EvKlZormak ztddP?sm{eY%-bkZ!FeKSf%0l8o+AK^k*<%h1oQViMxbdVxewlGfS$SL@xqCd?8om} z!LhxbZ+9;3Lswt-hL#0Kp2wBBl`UXTm^5p#NJ;wR-#X90O-+2qx4vH~GI!^mJ1!mV zT&0u(Gh~rJxp8hOvRvPlg!3wR^K>o`?_-SV(zqJ!0xRslK)p!G${bHyo_d!B24TY8||B8G_4oa195WDAVQjClb5I znp7i2T1G3Drk1Tj&tewPf@NG(#J3Rh8#@{6;1G)%qkKxKuXCbZED@UCgdfYJDIj`Zhp}Ei_ z)9{}C;-}dRz|E`lYVG6n<)P;)&gz=2B%;x6^C<1acXzv)5=(P<{QbXSzfYg>PEdLI z7CGN7vqx8>QLh=j5qZuVtNaGH&DMpusw_|IC-w*G zxNY9flXqTt;;iX~H;p=#J5Sts?&x*1Y0zFg{&9;)lmQW}{zU1xZ%tL!iSR{moSGji z!x#@}9x@$scJ3MYp1{=zSMYhzy5pL-Bc({?#OKBv2|aNG)PKIjl^pgGRgPas(MrpY zZ96Ht)sg2-xmv!H1l>aKSo=$3ZO3)PUiLblb}f>;R{y}gpshRucnmxaOp&YkKDFZ8 z<%TsHoFk8zkirwYANUkRhVSYz^W!CkzHM#daWywA%#A{jyj;CMQpwWiSH^pnV2U3v zQRh$m73j^x{oK|h|5J-LjXYOTxMH-0WzTyJkC&7MXMDy*U?R}ev(YOw2r3XHT{yd1zK>W6&<8QjcU?KG5ZrN^O zy0?sScng}~?ukJg69MIg5c6%6HIc*Su2K0TJE5i5``KL{WEDD@{HGHSFsVFNNOU zrm(iiy?9*<<+Nzq(Wd1Q-(}Q{|XkTk+7&69aD<89p?< zFqU+F#{e#7&WQz#@7BVJ2*R|~wpBhfUNLfH8ZXh2*?Ll3z}suPJ_zm@bFFIU z+qpS;zHy`MoS<$cl2f(w7#gsB9#Ir()q{{t+74iP+{LW*frhquOlMv>aaKjuj@P-h z50ogYZF8iyx*TWga?p1@IV-?;Rh7O(nT;Q)p}1(W(sXLB%ec9?osK=J^!#lL<(9{` zqdx{;SgrUG3Vs2>w_rPA+g$3!&v7Zd*r`cPe{8!-D{c1i8aS$W!)r5LR;2`1Wkoyf z`XY~&BT&~wDg)z#k15kq*;0x$xf}{Ff**!O`QB2b1taW!9ySLkVrl&cUavoS?7MI9 zzJ`f5<&h{wIM;11)7M-q8t(!U?i_F(ti~L@ZWRXqs)aR5l?VRaR3l{`4W+p>$mT#K z!2V3z9C}m+88@K6VFu=LRSBigmAdISs+|(Bh!(3z(?XRhjgR+p$QD>Dp)f4}RslP5jdd@ijd>nX+f zjWD+){&+Ts0WMOVUFw*zzeP#D>cIB?mO1J%m&s+zJQXt4W1)J~sK*lZSf(CVtH*Nn zXi|?BE-9{UUA4buEdq)UV|{(I34a?Wi_N3&*wH|5&lIkzf2RJ42ewmSqH1^P>5)B^ zqiZX$fR&ycozd|4(DP$AOw+*PMCl?RxNp018`3x0yo>P_X8C-2yaQ1l`pI`1E(6lf7`9nDx9heRXbqX zpz)5L&)A5%_YjmZ?jD_6s{CIrvR@v9oxHbyfhAm5C%W^QJ7!$-4isys8VnIwiaj)7 z?%NI5ZF`t9-LSx5XC};B-G_>eR(uSjLMJ#BN?>{kc8@zWA}2nk_4yZZ#!nRHjH+fu z&J72LrajxW=pS%zp15PhXft5-&x}_58P(%L z->{s%fTid2A`LGN{kY-9;`I7wu;H#QMjnSEVd8=MXD0q7;gdUcd$jF*W^kq!FLz(V zeK7nB{qQ#-=su{VZly#ljZstvxc|Fdo3$#NOTGcOsK7`Q=(&?^Tq+44r{$ z_~GOC?F!(3E`&5i45KZL!*a5-J}%1 zG-0c7)q_W=%(%K18@iuXl6VCSk5*lHF4BG5G{sGO3<$-a zicDVr#QwG!KOw|?*VlLgIJlYxswPuF7H+s(jyD8{dp$)SKZ-v;qCZNX0kxuub-G9d z`z0V4`vlx&>aNB9Ao%QWU51vOJ=SsZuGe6c(SNBfcjPj6hi%U#RB^S%xEqN+?+a62 z)XMi8A8j=}T3mALZE0MaC#|!Is?s+Tm3vZ(c z6Z_mTj9aNIcRo{`{zdrncpKG&MV()9gBC7S0~)dhm3N$g6UXodkJ^ddLE1wz`VwMl zFBXn={9=<)yhSJm;ovPcK88Q>bk*Pf5Rs}+D*dy}Csh!97*Yi|M->1NSX=CN^JHOl z;V5|jx0Hx}VZA_;341xh_@zrQo{6G=dSAs{ zquf3250|=*Y#*4`ShWKeAC?Z+KX&)*st2E-iY;gvd2MOo?2*@QDLxO)BE4^?_llN@ zU+!+@D8+vss~FST!gVSuHj;VI_HDrU{}`+sI9&DMg@mso;^O=H-4}ZJB80E>bnV`8 zcm*j{d}a0M`melBE6o1=6<@(5D!nqk^9^XFc=wg%DK*JzAEtHYywcO-(tSX29`!HzoWB=+Lz+c`hYr8hQ9E<$rS}eZITJjr}9= z?UA$CJIOJeHKvkH{KhRAAH9HwwEgo8y;pp!{bWFI1fAj!U|YARScwHhYqzPm$7v;c z9u2u0Qh3|JhQn1mu0WS;fny%XcjvKG$6G_kaVUzaU-$>O5{CcSjnw9K7Q#qZOYV zo%3gUQ@LUu&j+HU2Vu`~52YFF!WQ88-$7g3_6U940Akj)2Sl>%VCmt8gLh0XJxM+E zE*b(j-SWujmPaQl6T4S86c1H>s24@4_~PiCujoAPeLLrI1m~UCaiORh<9CBuZF_Y5 z1N?ks{QdMi_OOy$4kFpBZ^INi#%`D^7G6gaYy3^%ocE%_d*1+0<0?c--+B4TkzY@% z`ruoq`__(wymqWQk2mixe=EDLdHcvuj9D_Te-KCdnzfU5~4A#j| zV;{KKFz#M`vT3Pu9NTnD;f{S3*DT$)>Y8cXRZ3PK|C5V(h`sh}r5C_e_kO2utIj*Q z->9<(?0qd2i1&oVi&DJpD~zfgw<^JH^~tsacc0UAO`!r?*bTp|V*BKMXVvYCOk27y zGToRMrQD5)o%`D!;pOL^`)38XFlrLu_90>(tx3N1HzC*%{n&-pQ5M zbR8=G3>KtMkGAcpJw7(CWo+KX4aI|Z5JUgS*qqNJBye5RyK4Ux%20gK|}G`st-N- z8y+WPO`m5=3Y68|(|^<3SWQkvefG{{l*_UI{TsFlJ@&EJ)$_yj{2GgRKl%-CP`>;I z^SH`S7p>(?UfLmpJa(++_29Q@zHgQ48_juQO~z=6J6Tv%|HOkQnZ?F>_DgQMO|wqY zaxuE?b&@2WFCCO^%86eIea14srE>J5Lz}>z7B0~v`DM1vDm?|82&8vj-+7{Vbl-I2 zKE(9xZ8DC^u`RPH^-`iDocC#PP-SGZdB((XpWa!}ysz{!%v3auGzX=m1kJ4Nu~JS z%eoXlQal;-wAB4`hcLitzy6M6Pl9vEmHskJ{05DEXYyi_H6f3G6bp z>{*oSFG|H3ijO(=2?FodJdG!x!HGuUMlgr)mUihxem4=;tC|)SmNv~Nj(bQEjO~=T zrLZ&t1BSvos~$XFdf~3;un&AfSp~Kf9z#?rF7_tJZ$R|oUfCO&Cwnp~0ybsGmodH{ zjkL|Em>8+wGx4-<-EI;Gp#M6}Q?M)AtxUd-&*ozUZ)Fc?hlKmz-*#9%jxaGkq3y>` z-hE-!m-mV-;IyipYnZyjJK)UGw!>>1+Kvo0(kcqlxtcybZXYJFR{SVyj6-vjtyU|u z1V{E)>;~q$FD$h^3sanp0Jj~QcsmXJg>1%Md?sz1yPUsK9>?y*nt$@xMFiNbw0zJ=>#MXsbs={QW*wH;Z=wKOo<-mC5e=#m zRj{79I_^YY>8M3{K|qYEvM~a5iQ06I3<2st&llq83f9G9BZ>OIa!&nW)CO5ydrK$-d~0O#2}kziIARq=FJ$4Fju( zzp9oS3{w>OGwcoKS#SdtZ>D+pH2~Luow^b6p5d;$I8!YalbwIG6Byj$a76is51mla{)N8@Cu3@og<_n@oILZpA zA&)wawjV*N*WXMv+fT^~=M$b2t(9ig&KW#SkL;s(QnDX{3vWA&1E+lQ;CgRT9 zo+XLi?eR{41qC!LtSJEFP)-|vG1Aq)rla_r~KeNiBC z?AJU)m=BfevT=c{9iWCsmsLrZq48;segORYC#yWILE>B}KWOY}p2lal_1H0ZHPY|n z=X>uJ3hwR)xAD=1t~o>qH+_MGykbS-f$^$R=RBOham>XJDBmxfr}I^OImrdyfff*MV#{YfKbb98Y2XaF zSm{esdi3RkrKjM-d2H46lZfhH2ZQ?Obz>{fZg_O)O?=!yFMhjgAE&MzTR-EqQv0EA z?xFtqDz3dCN%_UUDE^~ft&}CscoTbOIr{OcPw$=m(2?1oyWe@}*O!*|)qf8j#-6JG z(fFGw%Ew7~t$(=mM*R=YdWX>#F)sXr3i?~(_Y%L;Xl#LZDsgA_2zzrptJJ1k092IV z5tkrm;~>GwiMmlvI?74!dN>Nb+;sBx!G1kGCrwd?pLRI$6a zAAxGP>(H+0Q$;(8Ez5^XKbZ8rf-OJCpE}z^vuA2F51aQ>7Tpp^&I)0=0JJ6SxHu1L4^pgh#;iKpBT1uh2XL~}! zuEIG`8yBicmbi3m?X-zXk{=3{cfYxn0B_p<+ESA99_3K+g~uKq*)#p_*%OCkzwW*z zM4MoH`qq=PM=wHPY-I%zyZiA<6z>?Vsb9JrRaY`;#eE$kt-Re*yK_(J;lhQb6JuXr zgzqQkd;*`YE1n?Q_v~P+F@DF#-Z=U0o3{|j9BJM}pNxrF#ANTpD>2$HO*}XTsm74> zUH8q!5dRmdaK#o{C$}&`z8}De5zvIM-r9uk6LVBDS};bZjXX4C8i_b9#$B)CYyM|j zKtA{%%6rc}Hi1NA3d`u13~>uw^{Es4NCf;#bo0S# zSd%BPWjAtu4HaSf%X?{oH*~N9L1UT@&fws59h`mFa}=!5LG#2zZp@Yw-!coc?&A0D z$eDiIt3HLhX|``&f^tykK71`bbk}1r_-0%!g-g#j&Z6eP7gc|1ScP&LYqoDLaUf9t zXMW-Zb$_n~acNom*vTW_KFF;Yzw6KyTmBaNK2=}YgVA=ux%y<=RbyS>Bl?O~ns^hX zt3NUGc*E0$*^mGD+U|Xz;{;e7BzJ$%xhRz5vRxas&mw|>Ir_k z7vE~m(P!80dL9-cV_kptRg<2dZ-uSoSlc(hP+Qvnph-Rb;-?{d4^aFY5)dB0XYiWa zL67lk;qCh2uXY&vVvPM~;eCHZ86!k$)MJ@?tbOUOR{FO7z&0BDe-HUq9f1>sw0+f!F4vc~Y>TuUs z<_ECO;wXFRVCiw}0iG_K(;CZ@Sa88Z05mn!KYUG7WOI=5+ zcKk5~?`}W(eQ$dbaerPqOi_-^JYISl!JoN0BH}yFZ9o}L)>$p)~A zVjp}*v5UE4`o=3GFJD?* z-f+C?13L_y!aut8PM$OMC;f4WlX*d5s6P>aQ_V>r=6io@U&ATL!*{nIdUE_cSOFcO zuRkdrX8^ta6vvS0{bw_OPeD}%fO~lsXxk{cb@?0;^weq}Lp3CLgA}y=CEC)}j^`&Z8Nt)?aYd|FmCZ18yrZi0lrrsA#%WBZDK{D1WdCrh{74kIY`MT~`34cVwUy|n> zfxjZ*Ps_7X;D03Hd*t~Ud2W~IDv38&o(Bc~h#o%z|GI<^$n$x5j?42|c^VS`sDuaP zd5bP*R6Q5!a_at&rzy`Gc~;2tB}q3=!p9~2ygcXXcGTsN=j-x)T%L0nu6Vcc`~K$} zP;@T4u*DcJ(mTsFSaGffCq)17Zv21b-yP4l8f$;vYGm(ibz#>^xI>=)-y09L8iilB zf_-uSJ#c?8J^qawEBU$nBMN?&z@HcRvQ}k$G*jRw1l}a^HQbn{;BkSUC*Vqf_l4rW zMc^%=d@mMwDum~9f#(GNW`QpkctPM72>d#M4+wm=z;6-ws!+bS3VbM(Z%W{61%9r; z3j*IR@CyaLOW->MK11MtEb#RqJj=hJ!V7n+XNACzNk4Uj%K34@vrFLT2>f1w|B=AY z7WiKXe0Qk*KQHi2Av_po_;*t%{#PV^hm>=Uzz+z#QsCzc{Aq#T+oHyguJ3cYe`Q?h z_L8V@T4zI=DE9o7l_Bcbuo zCGgq1gXM_}eA({cco-1))dIgr;2#qBk`VmU0{@ugTPg4_2;20C8|Tp3D~)C6tTb++-@J2I8Vl(+d*(`G6a99bx6=3s z{SMLZ)0HaC0eXJFQsq0%P;_*fy!*o^k_{c3)@`_czFEkcIV!C=-v=o4*=AHDteb_38bv2>WU>|^NM?G?o?P5%}e<+<)WvenciZw*QP$@R>|A3Y;Pv{erg!YXk8gu z)wX)g+I81nx4!-Q4IMXZ?A+9KlP&X% zA;X++U`UxmM$R7SPG*t?GZ9UuC=2yKO?vHuX%EmBrw}a^ozRzDJ{z-XP!y7B8piAN z*tGNcY#zhatf3ga`DmKnYiD(&>?jQ@r`VGwgi$k5Or>aq^it(=G?43Nb=q9t1T{@E z;}r767!T1pV*$X`byp_%&n&~&`_lE+dKy|rrkL`5>x;TWg8*`eq3_IZy{<%I0wsQGPeCYcV#o{rCE1d}aFeYW1uRmGk4i@bmOuvHsLJpSo5( zYp$F8?E?DtPWol&_YwM;f~!fMH~Dby+~B?6>wEt`z2DNI-Y=mtzr3-<7@+Vo^gGzz zV$8n2#rVbQ@@4CwZ>j6m`(M)Y%h!8&@Vu08zggZtdP9rxCHg%_zu6muc-CwTrt79~ zzc0=_O0%4PPJfaHsG3&stgQw#(IZ;>=nH+Y78%twH@2?tYJ)D>=*dT8dJy$wa^ zA%z?_d3PpDliG-7i}W2eqGd0x^CBXv^2*yx9NfHA_zbf$+;onrX}?f|M7Ee=BHm-0 z3S(UO43LC$u7GbkE4PUV7ER@;Q3mxQ?R_--v8&Z0NadIOHEpY|Hfe#Q^>WGr`|5w1 z$}LVMGq-mOI-x^IrYN3}5F#>&M!krIue$-+OFo zd0IH%SIiR2;jX9d3QH_bG_CsDXkTr#Z!+3%Fla;-^0e+JV^%sFFQ#nA0vlt*i|Jes zF%HH}=t|1`Cdx!Ok1T~;4%Dy^RbgFBJur(#;H=;{5g11lmP-Yws(mz~4J)C+;5ZzN z;hG3hl}I)>m{0chfyp+nT(+#iT%9Lwr8Ao-(6VWpt1+XvpO%>GGO;=^(VO}}R6sc> zrXw-0F&zqlb9S=De9Y!C8YArJy;wFAPb!|rG&l9xgqYG_zhM@or0y#WUc=MZ-b#x( z(zUm3jI3?FepBnpb?et{dbdfS)$2B0-`3e_uHLZGY&APtH*Q)N=~~~q(d_8j*s-Cr ztq#>s^x3JLVOi?Ip=Np#NhPjMpjIFR-roWvNE~XMcs(meT~)9gJDQL6Su`$O5KB8T z3vQ60hk(ySq15`z%t(10okpnU8YF(HF){_cqK#mYKUMx@$AC3m{^%iQ1SW|F^C}@Tjp7D|p)o0q|8pp%H)KO;+z-J7sZhLB@Uugt$^zY{ zPN0F_!vk5(gJ3#_h0+4lTrOU7Fd}$-YRzPh{`Tjixg44)luqEmgbNldFoeD`VWkq< zSYvq(@G4HcCIWhCNTK{e#47_R{k$rd$V~QTh~N-cYsaGCUVTl%D?u`mq$O_Uy6d|( zty|w|Pz%ujmod?7EDq&15Xdc)om8CaU?ck4A7T;_Fg4~4hn6clu0z~*z6dmfL6p6^ zP|hY$tMx7wbs*g5iiNm(c?Xuowjn&(F34f2XxY4rI+b})| zjK1=RIAxf)a(H;ytlpN0+a!TmifmiyXs#Ji!a%cn@vu>6UgHu(Nd=j7j(QA?!?x8b&YgLHxSgC1}2^H z+u>W=*1D=~V`l)br!=q!i1Pw*cP6ofo?^jHQS(mv9*}IbP=j$`KvIpSQjM}&h``J1 zKWjwt(R|XDV7anP%1Ys(e<1a=A|!|zz}RM9SDMHaI%WzT>vE#KHcQ+$i(Y3751P6< zT8TC&NF$J%W|)+l`d=Hwe9okg7CM^-pAtF|OL4zZGe?8a7CgK%n3MmlN;a+M?<<kuqjGunl(_REwZ*s zVVRAN3z~9?fXpfOSh9B5POWZlt*M%#OkfR@(Cq1WW!m0lkfy*v16fmJR^4f7p9pmx z&FRNet~g%b+io#D>dwWRrPB+`HD!98V3DJTgu9$Fj!7Iy8627qpc#m&gwU$AtSr-W zqbv&(#L19Qr3e{o?lP#bn)HLZt-@SS6MbJ1DkrPLSZPP2L(-cZah4B<$0s%6b;T)g zxPt*NL?~(HQfd77LQGYtOiX9IkKi|@OL>f{Mhdi>%e9s5Pg+NEtP{2i{m@309sC5C zWlsH%b07i8Z6oPIUqAcC#$jmrYxy9>V+wGoC8Fugt=Uo8f<) z&K<~F3Z%*E1ST$V$k|NHR(0^Pvw?rBva)BwIsx7sO55=yHL1er(jYL&W&UAp!Z*jH zZXkJ6F;-LKfe=s*&nCc8e|x}=6$?W4ZKCj4%cMo6J(Y0L1iXQ9v4N;dJ{h+|n?{Ny zQN)(Y1>G^BR>`@YokG01iFh!Qzw>b)##YBEa;ZetP^`3SZ)ic3=&HMPq8xW{U+(4Vv~@cVelu z1H^>LPGlf`C-c9mZ``d);fWI2R4Ut#mEIFxPdOJlh}b}qM)fr^i~v@XH<}~?Tycd* z)J@3ar$V;~5f+(gJ4&6Ow`oWg^qh&?i6{|XVnO<%Ta(n(*~FGdDuAd-4c0TG zjKZV%)J4S%Gmu&%Cfgv2U4TZ*F!q05*&5ZQjRhNeZlgj{`&tnSC+QaiUU7v{*N!jr zDHbypFd#NCK!0*M{GlH}lseMUVbmdBH0~G+TH{f?^%!*tW5H_Cc-5_@U^Y+B4IAmL z0LZ56=?%D6BYmP_8NK08qTvtlMt>5^uA(>mNi18AH~Nz|7Ho_b7+20%K&%x_9eRyA zM%``Etx;pawfI{XgQbm8_x@xKaEcr=T4Jbs^|rR5_M!In#_Ad>S-d+I&A}X{n`%{S zR@cy@Te?aISvTeahZUu$-ga4ABmHUTKkbbk4XNG+ysXrZriK!}Kx4JN=K3x(0;OIm zo9U(QbBa04Du);?FCLFeBGI%$4ZBD$6YjEcCPE&2IOI!cQE`VdSqto3FSFTzl&$H^ znW4JUTG&76s1sHzk*$@dlQK=1kU7}jm6nlqtxR4pvZ)Iy4+c1ID>jr8B8$^UcO#|-^D zbtB=QnopPrHZfD6sROi3yswyKdf&$eD9mTbX1eCQ6__*p9cQ6Y*GKbNWb6N^IsISV z?f(HYE!@ZYAIj8Q=Kx6-`vHnUv~sb&=IUf!Z>(?9=+OVFH*cGiV)1bGjsF>Awp@9B zx0*~@3pLK`k~G?KIr(h(#t4s@avhWmm-Teh$*6OT7H^+0oCp2sY$OS^x+dzR)%dNI zfR_bj+G+~20UtICD~iPncPHj-nPF;y-L(i^c*0l->LMkL5@XYk7e&O=P`D=-0E6>>UE>84>O_6WdFM@cAE8*XSQ#ZX5KWg`1sr5 z^y{@MfF_Tp%RKR}cX8&-+EU&m#nvnOc3A@UU>3G!sd?F^oCDmFnJn7GL{bcDl7b0} zkyw`fnW-2;^OP&EqPc08y0aBXwKf-7JnX}A8P@jxY#xdNZ_kWMISB^w$xBDe)#A&e z87FypA)lna&Gk8Iy}3MR$D^4-GNxA^FO6D~ikY~b7^c?uwdU|Ojr1kS-)UhTmN^q< zpRNrSU9X^2+GJTfLhPflMzPu%_E&l8e&k*}!@l$WQD-pgfU#|B8y}zDvJ&w@H(a@% z;tmHUA~LcBYDVb*O*?QB@R(`bbNe*NL^u2cFg3ZT@*u1>zZ;@Gb@R+|=V{{^o3 zbR4E`lGCcE(&f0mG%Ki3M~&*#tmBkOCJhv2KSL;ER=${l1p=Q&;K^ZUthgOZIm0X# zoQ~J@7w?P|N@tq6I~GnoAZ19#f^4Z#y={{Is9XbCSAjgr>_RUFz@W%zwe0 zLAu|u*Uc&Zoq@DG#lNXlyZ?n#Z>qxn2UK&?9J%6(P*6{r$!pDjs;a=t?+mpC>9TTs zI;1bqX#agGgQ@fSPf!}1$*?#@|Np*U|C{#fZ?&|A)j~#i{SCFt>DS@kPBjFIHmMA! z`giZ%R^$G?LBBAcF9Z7$g&zpP_LqTuyA1666n-)UJ6s0#&t+iGm4W@V3~Ztd?B``* zFP4G5OySo~hq73Zk zWndqt@I4{eXUf1nTL$)pGO#a~fqktEY)={3x5~f}KJZ=TS55yz9S(dy2m>A3`gkxc z!n;B+(3clOu#3yU7M6k4mVwokfgxP+L=XmA_thtZu#3vTE-eE?cuxohI`s5E24O49 zz}A<6-B<>O@be)U=-=4Y@^?a*QD6%Oic%U@in_1nMj^&E-hLZ(26Rf^!H!EOd z0O-EzN|pAVS2zClCssvZ>`2c`n~tx6ujr(6g(;L9Q}&)`(yguL%%)rdz6053|KpJ zTlFV1@oc|CVv1Aj5uaZI0~bm$V#JzeQ+6PRz*G!%HXYjAbexYb+X}*lG61n*j6Ue# zn#TB(5^jDQ)<`Ui{z@D^=iX?oR4+<4(6IPmCYlD&!#1Q!VcBN)s#K~yn#@EtZtBF? zE#_M4NxZS_49t@(*vMPSbhOvDU=_nSY7~xcbtbW!71gi`WH)&9pXUEBTK(hS*!2s~ zk8Z$Ko_pXLhWUH|zFDQCFb*cgn>loquSD*dh343jXgs=vxceotqp$?bKK?-LpcL_> z!$~qJ#}}fWyXs0S&t3uZgZ>Zd1h$)#SR?piID=^zy?aq&0|Qnf743DJ7qO|9_M&Au zwldKd3$AD(>Vg(|$#IBu(31YK)Tv)zO{slpFn9p%woadib~QB=(^n|xw$yEwJrJ{V zQUqmzmb<-I5Hv5^w5r{zH>GVC=@=wE7xSs+zCt0_xO8cMe}7#eo{#osGj$oeurzPS z>`Vc)jN&STBK`4ZN`bdaINAXIuu;@|cn-8G$yZr;>35;fBo%iKYnv^ZEJ(B- zm}=4qxYwwa!pc~uU{=K!UkuQP+BTa*rBXJ0y;-SjHs^qlHp&i4jr3z3J6aHY0Mx2{ z=yRcBw-Yx}+YBq+oHxHgC)FC)_o6%Rdy<)@#&(2@PCgjRFn0Uk8ul52xg>T6id-!^fJmhz5ed5*HYNZQY&3s59bd!O_<(kdIp5}#VuWH(#oSS2JEa&F^ zHL+aZS7|R`8H+IrCaLI*av;EPir>=bD-EkdL38k$!ecD13+Vubz*QuD4j>Ri?FNS; zxF=>MMhXt15W^cq{RDt!4t_ukYlEQ`x$cXaZvF;Hgg-PJw_%JaFJ;zb-&dC2DK~s? z?yJR%wqr~NU`;X9A91AQ_Ww%tE~Le<+BlpHyVwdllW-wnmldE@`kS~ZQXfMTd5ss# zbGbE@&#hB<*$R88@QN=Ux_srC$`_X<%L_G;7qEI#+1Tw=RP+d&OdHnw=rwPvliZ-0 zYJ|BU&59py&0!QfW8R^RGXv z-n;2NCGadg-!Ex*(DOqA|5JM2C+~kv&#z0IJ@h;z_@AQZFD1_F^t|VO^?v?|R%5{l z^}dXr?ec!B4?aZCKa}^o=^2-_pQQKCoKX1xkGy}GeqW{EcTcD?9HHln@_vGzvtL&4 zZ>Q&#^4>(xP4fO;dZy$(OV9VetlEDV@cUH0AEfs`qu&?l_htD3{vbUc{u`C{AiX~$ zc>aZ+FU$LkS6YoXy`tVPq~~{JJX}og3tmxpE~n>J66c-tJR~@;rS}=1RrS4v-v3qL z1N8pCB>pGqx#Y9z{qywREboufdraPcLhly~o?p@XCV|g*mFg+)i|D=nRrP)~J=^4c zEj>Hry_25reO2Mf)ALrT%boPTOXBSI#s4@x@A;gHe;>X7wZQ+5o(~9~2kH5kz@Mb& zNB>sA|C!#uCHRlh`>!OA6zg+v)k<*A$*8J&OV#r00mdfABRm zFED;SMDOiB|YbtA2P(G(i5J8lx<`|zz4M%PJ^b_G@y4$B%%)Sh$Nm4C5jm* zny@*bnQ}I*avEb)28xF-b=hiGS`vsl1|i0S(`l*Rbe6R%p29QL8&5*{mZCn0r+Tlt zvYa80l>!sP(Wu=rc8Xu4@vYIEO6>I6sg%-Pdq;dytS6vgeAtu#MK(PhrEuA-?4WU_ zbed(p*nK8MStXOPCQPP|-B%YKRt1E+3VumvQ*m}FCt2D9cyqQ=b8tKO)uZ$y@RijY zszuE!*|Sm_5!|mR8?|7sKRUhl*uBXNH*xZ+6YLC-x`w(#9&hte&^uPJ=+(iWrg?3Ko@!!3sXryZ+fSa!SD z3P_Q@-ZmC!(75XLM$Fi}yF;=~Tk&Vz;>%a_hYtF) zj-KtS8cFm4jx3Cr;=}4-YF)fq9ad=P2&aspqVZpayL}D+?cl#RD9|R=kO8|d{N2QV zZ)ikGhL9O!x7u%j$6fW0(&g=Rln?6mUNzL)8}FgN?9!K>v1}qij{$jZO*>aLTJcqg zyq5k%=(%d~IiwQBYH)(%t4uVy--Rrz&&!@kIc zzCd*Mb<^6Z)9UjMJO!w;V>loG@3SK|{@*?BT^}4pz9ZKwO?@(2O{XaTjSY25PeqFZ zh{!u7>?T>JxWLWo9+~87Qv1QCo?rTOc9|JD#q8bMsCQlva?f$|pG0u>-H>VI4WA?l z^E^S68`?(oPyjz63xvG*>=v3|+}%#JS!j=?v;5g@E>`%+?rn@*AKUgu*pPpyq2%li zFqu*NR%x3GXJI3=KuyJsai%BLjp{XK^?I{zK zl%Luh81M+C{X1>w zxh=wf2xb^ZDpwju>GxCm{fvGu(C=lrd+^!m>b^#~i(o3>(ek}nKbu%ryJDt}AGe(t zO+dA~m`#{bpZjRUb}BA$ln3c0;vaE|sddXsOuxhEC8qK$ zZ3HZZ4ZqeHUfr7bv7)(YYcy4~SIq2$8)JZM&?5N?pI-c(%7#0zdhArTpWRGEdGno} zd!~r%LJ{56$l8BLLu)D-Rre}MBdL#u>o^+wO;&3YaS9Gvf(k{HrQgo4nAytvQS4Vt z!%!wKDiy4wSYSVEi>yVa+IaANH)TKCIRy^vMQMMfNhb!!KfZ0Mh%wbiIBsTDr%8h` zno%MWE}ybiH8Fg}&D^{zw#;0`icxAc`Ji07@kek`NkXREd0oQ14X*8UOd1QlBn4-d zNc1GUPTy{`tGpiDtY?+{YWmNSR{1d<|A{eVgP* zX%@NP7hyATjcg|q!rS4bF{GHD`m=WGsWvg&R~z^vE-YtmhBn)aKB(PXN5aKC!yTQAt->Wc&V4m0d3nge0!a>nbj>?(}qpso+SEsGZAy#n~8DI2db|81NSGXQDaof zUR!x8Q-dn0eRopvTUV}Qv6iT8#&!P6+tKlO9(#6v+)mNSC1dQXvk2#!G-1+q8vcPL zHfp&!+S{AAd#Th`-YyjLnPB-83`J1>HH(xEYmi#wz{uvKgNz1*KdJ6T@ukmY#iy$N zj#BV_A-)^+ICU=z>}k+dUwZz)cb-tX$cFaz4cD7`GmcFh+Ss^<)=na$vPe=b9b84h zQPMdYqA-vMmdm}WN`D7MfN$qyrfB=F_%dBC56Dnis|U9%IWE3r0v*GjFbJYCIii7F zsLT>uCx!@`mF;7Hd6-p7Dv#9)mp>+@rs7fyvGf27CY2VW1iocaf(@RZOjE_?W}_nY z*h%(~DoH(u#=X&e51h%0chD>kqyjPdL>ofoOJ<@uVoGy)cE{~TqJhP``kQ;AanH&t z7Ig}t_67*0&~ez!xL*QNmskLk;Zs|*{BT`}?v) z7~mBcjS){K60n=oml3S%+`tLy8yc1~b`7|4*)m)cg+{b^Mug^=5-RZ-StLP@G8j>g z?M)z^{(Z%0YI5J`beiu$EZkQF^1d0ffh{ zE3FB)bD0!ZSDsc4ni*miksfr$3=(2A~_Pi%2h|vhKD59-d-B-ey`g4!0U`ap*f zN1RMpsVE7WA-<)+>tB`xA4j@+ft})YHcoFy#>tCm-^JFU`V(nz)M~1TES5r~aF-dL z2f}S*^a}65T(+1>=~$MYirxz6>&`Rc1A(UblxTchqKa*3S-`zI&gE}(5e?xm(f>-m zQVeH}OUa6v{wNd$wQl_=O@bu5l(q-s3%6W9@_F~dt!yk-%(J1==0qwREm*c%IP~0t zT8kHSe8dZ{LUIR#k`XvXvM>k~tV0RYTNF95lop%}{Vn7Z7_j_;l~yH@JD;fQvm}Zt zUPyg`{;fc=pJU;|Z9m>XN+FjL*}T4My%JwNJjw)=xX}PlhZ%>A%ipaY^)7~HTCJoa zFINvcQG99xqROW)qvkjyzORTRTNm?a$@09l{tR+X;j~;=B6+whmxpig%G*PIp_^Y4 zIp!cpAsXOHE1vA7F*0aJ^F9=yAy&%H^pe2s!{Y;MRBoDPys;WQ1sRVR0$RT?&dY&a zWrIh|bww8Or3SP#b1Ll;)$y&uK}`kWm#Y~qA6w&JXPAfPb=HfZbo44+9Z<;ZQ&IE3>UzM8yX3J7)+7H88{;AiaqQ&uMdR6i-<*${Y<9@vL>#AY z`s8{Y2jh(OR#8WCP&oYf9JbeFTv=Zf)oVH56{G5QM?3EN9%n3kQG=CDBuKu~vP}tSWxJ^fu zW&sqPqhd}m71>5RAPV@)>d69fCl#V|vTQGSYGRmzb41|8EWpqSEM4Z11w3f*Pi(*YoFEiX6PV8^wiV6 z_$NHNZ$4r}3ehIfd=0!)mbMSNiV78pI*)tKn|@4_HKq`g>cc1cT~GYh+t)eV?Hw+r z4<)n2Rv*!ZDrk1Ui}~$#@h>XRNleuK6?-9)90x zh=82R6WimYw7yuYfRlQ1h}gsCB|fxR1(b5^cPMX2F3`AYYke8G8!8r4^|JZ+c3q^m z?6}*HYB_M3MHca{yL_Xin07x8;AWZ67P5*RKI5_CrXVzGgD$+*c)AXKOHE!js~~w; zdS8zbq-ge##2@M>)>E=|zfTKSRv)M2bTDvsJ`)_5^A&J@aQ5*fS8_Ft6U*}QNemim zH_$`PQ9`g|v(~pH{24;=g?1reu65lZesp z_L$Ijub2`Kd3I%zd?~LsRbk2LZ9L8e^vVa2bclPq z0wxp`r{1mywoZD~S_X|nhHowl(ws?awm%{z(PbHrV@;mluQjC zr;*@Z@x}<#3CpJ!^w&v&6}!_XN?B~%D^8h3SXH0E%Anb99@tZ@L9PXp9{j$94y&dE z{F#ogb=}|)D3%@1;4VX@Ao8{=e7Fj1&mP=M2;rn2bESaOvHiJxv^O0M@C4LNnx)oX z5s%imSk|Mte1{~79Z4)`{zelY`S%2taTQaae)vo_QCAr_6gT6qTywxfHqTbL_! z#SFzpGakM`Z_-?H6`2wN7sKJ$=w`)M2m|4!QTs!F;aSB~gF>5#qYdX%3(hxdBDJgw z)v^Z`Tw;dMl)i)x#k=APa4<@m$>x3S6*V=G=eb*FX+2J)%;A-!7n%pIUL&ZC)M-T1 zr1g*@#d&RnS;Q8;uHb5_I1t_V5<;Ys{YKUv`tnv|(<)}vi%*y6c&R*Xz2U7-Q|s&X z_Ku*07SqKqgVse(!!PaWb5(tWgq!@0nMw${E(+>7^#&Y4>#-0YgQeFgCV4X#`V)tS zd><1kl^`kVEH>Z3_7ShCSg&Hd@1!?)eeK08K!E+Fbhn!-jkoFRc2*Eqvj+m7V>vc9 zVC~TU6eL34kYUD$S%)a@o0YgO3U|r&uU~$Hf02KESMo{|daJr`=WsG&UvUG>bD*s5 z7oVylBwGm%JxMIts&VI!;^dRKGzRFeCo){+X{A3O!Oc1@r znJd@N#xL1oDo%}*%kdR`Tzsk{6MR2fE`vUY?4L6l$ejXj4@K|@ppV|>a8$9I%xlXY zytI@jh9DCwMMR?zwDIt7D?tIN^h#QjBtcdvnQ?--H>9SSame#dtz^cgby69S8znlr z^uXUQEgD!;J6UIw8ua8&Z*64)=9N3+vxV@?BeeXLF&88gp4pQm7s)3;*93|>@Z4jq zo0i5y0uZrAo_;ul$FDhduNwAr%$)l6Otv3up<>E{>EX1YH^a$2t_|QQjdXTC1a4^3 z8s%A7DUPT|UlY%>SI&sRNloyKm^Z%Ane^GGw$^sKaoyoG5os81g*7BEGGgn?_?b+I zu@VTFhFSidIRW{O`1t6RZ_kOBDIq+PhWAkeu^Cb>s<<8r@}&$j^*~8#fi$VC6N4L6 zL3FMlUB0ZIoL#0U%5cG#F5??X%B-P$GBsL4?c?%${v-^HL+sMko>IrFqw3a}r03n5 ziUw(do1;kTt{IrloEcbl3jx1cB-U(=2HQ!02o&C()jB<)QhpI!eZsm7_T-mf%wf+> zZW{MhDPa1bX|KNXlr<1~pAkd%RxA_d;zf0Qb9ZD3u^;Iql|hfrC8qM6r3Qi$LtLau z#iC@3c}EQpU*4jzU`r-fZ&4>MiRfP|t!+N57J7Mzt~B|6qcs4Skn zZr0&NnyRKvkA)0kXIqO`HM~#5cb?ZWjDRAQEMS756tnL3f$TpI^ zfuDz@-G<(wbzYs45XFRwWJ)Ar_tQKJQQM%ksNs>-scl6iji>EsW%Z6I)70LaPZbi5 z-t2;I;}$n0y|P~M?ThkFq`VfXv5)9HR{Y65Y-0VQkYQO6K=8XSKD?-vE4%s-h^A7d zEN>^0=No0>+naRvIu+j(-5RA?kH&;ea6X>09g)2!ZCNsIt#ag0w%>#X6tWf0B8q(C;!WL}~ZTEVS^N261=!DV66wiz&s;|M1D zz+`csd3v>};rJ0{vI>>aswBd4SR|RdRqA0agNcaRARBZWWpFBdBmt;0ImFYk>Fi`I zD$i5ku#=3!SHlcVNnZ_}w6RgMNou>8K=aMp?ZN)6>O05D#*$Gs7sl~-9v5Kl{6=TI z*CysYN>Srid5h5RnIR${8b>6?X)>qwWLW@K3=(f%61F-n0?Al?`D}(5SsE`mTW=|X z;?W=lHVZy0PaYJIcCnGeEszvp7WwobgDCscQZ714?u)}+sfSa;mlE8c){!*KkGecU zflaW2>Lg{|7$7iwu!k!>X!gTI0mPcwsLs|K+dQEbne;>{0a3cX;23tnvWcox?nL|I zMV<`A89A|N&h`s*jEj9f867GjaTG4hWiiw_SZ(_0_@yJ@piD6c(#4dLdzyJoEdy`L ztkBL4Ix(`e+L8|mIjoDwCkJ@k=+S}HitWbE-pci@oxsdC@fOj@7~3JaeWN(_tjS-* zbY7qH!ZI|#;=LR>Nc50U73;IOE?}@|%=3A99B)`6;+nn0RMC_IL*8M1f>bW|1rxcrcb+>q`bTm*(CE}En#nr8zyy?<6ZTZL zmuApX(DZn*p>OekA6+oyLi#y4h-f^>}oA;aa;JpO**p`Guxy2+f6Tw z2`gKuPm_E8*KRev zd{kc;1z4b`l#0VW_C~m9?H|O>VV#RDWA_sWfQhbf@ZN$F`JiKj>#$GJ&5 z1ieCs&S@xhHlv`0#j}T3>l|yB++|hh*rNZj$TK6N0o#Wz@pM&U_yB}FU@SgehO%w6 zx#^h}3SAUqC^<{#O9REbzdkZGgL-N?y^-Wids>d{D7F=q(q2y7B(&;9L_*~_vRQu! zLYuH0t(XZ~rg&@x;2w8XIPOM%LUs?Edy>5t%&nstMF+jGYgBUdf876f4VWHAVe@&Gm?>bJI3MZUgQQdLrrcX+bWpjgABXZGR zMcgKt=>rdDr)*LhvW8%AL@)t6Wb@M9%H;$^c(kbC(Q5`<0uSVbG!E_nX0BVyB%86` z)12q&AL(pcVyXx%g*c*;Oy>1LPC??_p3G?nm#4sid89SLw~5#p8^BIBPTN~*hey$c zls%v~{gN?RT5ujjA3+d|tL4H|*&G5kQI}e*E;Tklj8~ddY^o|sNZpW=jeFHhiqfiF zbrysz&fZ{&CwD|6Xc+6%ao0tw;Qfr!q>5>^UC3Il0Yw7S;k0si$I$lp{7JDBlQBgd z(@jBm{0`2kUzs~$(nz&T%MohTC)s{K(Texb)MbyV*!^CQQ}>V#J@Jg4l=Z5r7uB9V zmq;N~>T6RSOs3CFbpUBCPvYXRs@8kR<}Dgrl_21nAt75x zRyf5!zTw=#+fV*!qdFco32^qoBhoZkX6=eJdv?{?~yi zyA9glIgQa`ES&6!L`4ym?8ND4ab=r$wnHnEw_l+l=c$&cL7_t62}KEUx?++nkhs!{ zC6e$7r}d8|=GKj?ucXo{J|Qqd5YLZ7c7D`~pW>9bM00+!t;9@3}M z6S;S~xZ5pJz3A{EQJ4|JuyZQ_?)@)%Hh8J~Xhx-EJP%O2fUG$-j;#g5O~f@*gGH2# z!Hk*6PKx82Y^$!ys=+W$RX7-P4q^a_hQWPjPxg>W53Bej@vqp4lO#c@k&(fBDXuy2 zQEo%iZjzg^2@_5E%EDCNthuGgMZcx178AywS|MfCJrsf=y?e&gUs<Imt%VyLeA&cc@SEE;Em%vISu8i@DLQhVum|kl8jBtLguUEW7HK3inVy1}> zJ(D%Bk6zC%OK7OE{y=sZT$ehWdH|{({c(usk-jZX}xTNfx*l z&kP%%4(1hJ(a6jqo)cN7==@dO0WkNiSPnf-JyzV4x(Q`AZ>i%Mv_9g=yK^{*%?A{< zGTo<;XJdNk=(X8RmN;HULl20|Ys+2rSz8LpPI5HM6sjg|H*?F!SWW)6_m{MQL%R5|574 zjU#X#dKe*5a1r8hCTTwR%_De}!r?-%m|-hNW?{NqcN(rVl&AaoJ$VGRAn3 zx5|D?tWMfjc2!Klr%L`?pvx33*;qw;c>5M>uJ5w6J(U|l#TTIj<08n@fEZCaPio0* zP3E(5Gy+MNH+bp@C1?2zG?CJ^lTb$KN@L;Q(qJpeBoi{>fRai*msQfo8u@NQsAM}( zx2Ez%xC?eipmDgV*2y;%EaUhUG`&R_eN5VB8+37S1QEBV*jVc=@>wJ~Sz#rZWwWgS zon$|h>H*fRFPp(~f~$1s9d_g%Pk_U0L{XG63wLdxz59y9p(sthIQI_CHt%=8@}X z1YLZ>t^|2e;_&=OFffkTOqa+v9HkaB%9cf)XQO_B){Z8%O0cfIWBt0wx=q2IdN)H~ z$xm1AK!G!=>n97)`iozNPG*zzoLz4g%bRanPdb8uLJGji8j*71fw*t}oo z?wbj_0j^Vs^#}&GL&MHLxMMxfof;2YlKeZ`K_7mMOU^_9 z*pyruXVVPIXZu-9OlJ75JuTo%`}tuaQ@aNxc~)9@47h4GM^3$m>!RTv4`|~q zN?w0)xt~%7d-f)J+rJz}_i_*R*#;$!o(pFb7jNKtvAtuOLSmAWOX#rEXJyQ!DtOvF zH2-_1WeUVURhgtDes;#SWwc0`z(%6QK7ie|p`Sg*@J# z^U@?YGMzzY7)s20<&l?KK|Y&nZ`8Bfeo?3VIJ9U!rUNHmPPVLV=5 zAJ~?r30hX1S!?haAZ2ccHs1uLvPvm7c&vM8V@!XGz>Qd{H_JAXGVTMQny^hKHhHIIjh{-K3V3Qf~96x zO}Gr*$5k^{H7C^6a}-Z1(?rcWuUeDvc?WnB%DNmoga5a^vw@SctoQ!4%L)r3A|isK z4!Gzd%(B3W3-PkAyyz~h?24G^GCMQ7J1{#l?##lHsHCfsQlg@wqGDoVp`lSxk&FJ_QQ3)8lvtj6e*gdfy6*eBXYK_&o%1};=Q+>d<<8vS`~Sb*-{0taH$s`W zqq^OOv>DHF8oU;B_BD%`p2(C$!b2+hC_q{j*407>VDX5}q-3Y{QdD{wvbc((%4Y?+ znnz>Z&Oo!C{GlCA@@~Mh+MM@r$!bE~U#p{STUGRg3*+p5DGP9sCkvUCM{a=&`Ve(i zcIw}}ZG`Unu0#=43&jHUFmD zH2%z5$6K$D9C0TZbZ1sZ1@xjpOIRzF(<5go?@t;<%+)ARmVnAhb1dV|GUyRR%gwpW zR&7l^>k|k?N_M}mqQi<2AG7?QlA=Z_1oTA)dift`WLjt=>m;51g6Pxo#H_R9g4e0C z=B^gnjYxMwJ09qR*v@y4M+`XcaYRNtf;xm~9EtndNnYmE5lT=dF{igX<8mxS(1({2?VvPaS#jjlFzg8F3jthBDADbtmRWn7JV>Q=8ZJcdr05p<^1 zj-{82cqjC8o@Dh%tc4nO|HEz2rzx;`pc>83QfHz!nzojINM~JIj6rjxvE*0NL6EIW zdKQ5v?)Yt4X%UlNZNuUPODdacON_2$Fim@goOVoOeWPx22o5mr;uecu7f#7hj%>A< zURYu44DuidRk9sPUTb_Jc5q?t30b*=8S$?qJIOgrwcrnq`ZtiO&T1pzf2?&wQLmeIxV;;CiYe zbwx}a^F(xYkWZh%x9-fb$CnpImo^28D^t{&t`CI+iy8w<$M-SfoQTDdZo*NXIQGmt zIZr8m?7Ih?bxpK22xTW!kRrYo0Hu^QRLg5$sF1UE0tL*A-nlP4r46Iz8ZP~a*OIw| zulN=gOTyjV!El6^p*a3G_tbdZDrafXG>kK@Gl|b&ORiz3G%Tv&Wgf`pvR^6Il379vzgU2fD5OLZIwkzEg3RGsBz%px&t2NmR=34m_pT8arD@ zBUz)IY4?m@c1`v141+Aua=kDO9vX94Px%{QIik@Q9cSX3Pg}h36R|a;J zbzhAp(ti)dNUQOX83mFxfpmxReP%yfCM!la5rUPH{kXhcnP; zImxQ!6rUkOKTMn$HPZM~4cv)yI@tO|G^lNh^2%IuK1F*{S`wD5Zrj;UJa_x(?B^VT zmu-uEk40-L9Co|^`p%lgvVVj}5ChJgHgazlH=8DM>ayo)Q+!%Y%6xS^)UjM0(sSpH6a|lSZ%ruNPV*e@MsfW@&e|RW zrnvi^d5wW9!3z&`+kk8GDJ<5>=i*43U7bMYj_~Gv?t0M3uiHF#Poii|(H_VX*bDC2 z`z?WQ_I{^gQFTH(D3tr$PoAX{$veoyV*YLAoEEaXd(bOs$SwSYp{=Dk00gybwUjS{Vh>?{K4AD|c2gng^|DEYRX2?XYMhH(O`f zI7|IE+bQ?h(9A_vfO_tKIffgoZ8s-qrC0T=|5Dv2;2oaFq`arou30^5Y!J>P74|7c zXn7Syas&^k$90X}qG1>Q;TCno_c! zr85$so8mqD6P#1m^u9}L!=t5*k0I`yRVHgyLV>a%?@$pchZOU9-oD%MygJIYjzpmR z11gbLl#;eNuS(3GWwyt5cz=NmdYVaktwRTX+XrcT*zFD70XK1-w)Yk0v>f?;?(ZFQ zKO(=AUHzC=r#>Lm+1$5Se%m{)rSH>$mj4hRrb|KDa3gv zz;m?iw3v^Fo8pmxvnbBhZV!$dot~NEJ{(9IxJ9XJ*Xm?yjUK);wul30UkG|4ZC%vE zlxw|Y3P|sC=1EvlN6LfJlZ^A3J&MyEPk+vhb#o9@>w5yZSt6ash-_fsuCcxM*YtvE zBWg;txcjoj#-!7pb529cIt)dxFX7iA8gv)>@j6!}*KHnet(vqCWi**vrP*b)C^uu; zQpQE~kWe&ek0^D~x&mp9h}$RC$i-Ar9a~G%tPv&CfRR9Q+9sj2?*J58u1^cmr5w)} zIz1l$Lp@EMKDWU+YXqU+9$FRSk?YP(JQ!+8)9Dy={HB~I>*g!xgjw@WESa^zH))pj zc4jg$w=IWo3-IWPK2uk&#FMq=)(F3h#&J_rCMeu;-wG!^;Av+nN0zz?W{iQpcg4A^ zH)|JZ-#pEuCqogh3_m)i9H05xhhQ*5wGsj}eQdk=0-h`#8Cisage>D5B9HXh!3R#- z9)|{me;4PHbfOO()MGPkKkIyfNG#2#2Dw#dEb&j;GV2(~(|7&va|X|^_&xX7@6NQ? z8YN%oMR|@B=okT$gB{)OY^%z7=CO%#w*VU0c4l3MaH=Z5g>K<=A@U?3-K_RESAfFLp{bPv^_@6@3;!=jfOsZ6kj@ zeXgS>HBnk}>6zYCm2~JS72yJ{`Al>2q})BEi_EaT_$;8$_H?E`b)^@iWui3pSt&=T z={}T16DcxRb<39Dc0OrPWb{%G)`dQR*(qnO?xt;{)+oGg*499G1{kQra|l<-9Q}U95QQ!-8P4%T$Hw z&U0stg>zV|8xpKj51ZO{HTtF^30Xhac~*+}sYL3eaSDG~ojAEhfH-2^Y?@cf-McRd zC8jUZ);s4z`T`!>rQ*oa9=o(7mq7a~xtiut%?ePi6P*Da?vUuin<)*NZI_~JHQxs_ zmrn!awK0^u<7>#>tcIk=@=MK`v3d)}Smz{k)-hI;tq#hm3|v>V^Z6BgNP}6GK>I@7 z@zRNUyRaE~q19))DUob#C5?2fo>{L-b0>65Y@1YooF&XcRo&SXi4c$V($qyCZI@&V zZ;0ekm^Fa~wY9YYM~*kFX+=@@CXBQmHyD5gGbS0G)T#-&L|v>uyazp z(aPb?omRQ9*PMv%InqGCOa4pS?XaxfN%QDL@ciuUZ)bn`(cQctgc@6EUIIUG)#XH)&5}h;|LVLdHF}kv?QEIs9CFi-T zf;d@7aY2QNmXA1k>8ypIIR{>JI>#^Q&WAnTX?F+H*LBfM9v9raL?LX>L(}6F(j9eL z5;ESZ*SwlxHzZWI_iw40Wd@YJ+Gl0`ygHFw%VSEh@LD5r&A<;}zoU$4%cf46NNu%x;%&5NFGW*n?rT|!WHHdJZ2kJNKKJNYn&nM>Ad;gc<=mifg`EGE zO2%Vh8C2COQtq7zGL4ukOcU>>Ozl%lN<=!J!s+vhri{sJe69dJh{@80P&nMxL9Op- z#D9PYm56M~lReh*B!JoavVtxXFk<#yNcv9NnD^d;}`O#-dmgX$Zh!QmBeOh%D;0SU@2CUrn_nB7&KZ-R?Ua2NgGT?1Y`o4 zZzpfVdsJU#+G8l5((bv|^oSaJ&e2XzyGGU`n&bF#`tU;dFmp~ZVc8pyNCtDs!0de` z+D>}Motbea#>qMvI5V1qd}VCTJPeNkaBmp(itMwYZI8}T9(r^t6Hn8iLNu=X9q#X| zW%pe$vW5n?!fR!>i20=*6r?F5jp*w&P7lQl0%-3TH}iR`;x99dPMMHwB-@iI?#~3> zYj>QnDB7kgogHUXYNA_5$Ov>O&2#45`RKIb%j(rQLjip32G8-Dqc0@iX7u_ZGvJ}~ zXx165)@l^$-I0)%UB&qmWgTa&tSlPiRn~oB(Ru_$$)fTd*LZ9vA zjNQBY#{7?XA~$FS&IC4V4fFbXt*5cEGFV;RkTc3+mg0&;yYoH|T*);U0XmC~^Fa3N z=8QIvdsBQpvU_fukB|(wD(4(gIL~(5{FY3`EH!Bg1BnM&-suLF z>@(G^g06%egvo@fLITYl1^H!-Y`gY+T{RQ)v&ns z*r}1uvP>t#&Ky_NnWl1I_IfuhCv%%$;pnPhSaNiq`I*LqLUhnobQLOpewMYfLv+Ow zE4}Uy=>1}em41aux-;aKS<(7NKt3CCnM}YcD9JGpG(x~GYJB{jx6hz!7iX^2yz=*HV?IZFH zjb`gRA)!utaI$ZBqN9|qsH3bi<%IbX-tfAZGggCtUEz$kQKM3i+qq+K+#59;72<0G zG`mVZHfO8R!sQ@ce;nlLpK3i%yqcHqWUp|hiK0+I&l5?t%|eQU0lM6!W63J7+A#8JO~nrr@dMd*4VA zCS4ZqsrX7=+Lg9i>)ylhxfkhologGehr2^acC^8i`=ZUwc+e~lWLt(FsrKAH>_}3# z$x$6lWt=l@MGtVZgPVZ^e8P{9Q)mwcH9M)Gb^Ptzd*cxAi$OW=Sy^Rcj)>lmmrf!y z+U(uq=EeZ;g;Z<-zXE@yLOhb~9UU@be2z`dd&d|N;u17WE7YV@VamHMxzn16bT=q~ zJmnt?b4kYM^wE4SN|8>P)1{^1vUt-yrB4nEB(a#;XP|eQrGxE!yaD-v4z1!<`vJ56 z+PS|pO{ZH^$jRFQSC3a|M_O*ll(9J829>s6maVN+Gr3Fjm&DR^&2VF;D-uh3lfEmc z`+U}etMzMZWBR1Wwc@n3dc-6e$?f6k!5gpRdFq4emY^A`bMlYWH~Mi-K=6>J z_W(SOtK8>42jTJHr?Yh@@j*|+Tb=CWJnyXIv+nH(oKI=kJ@!IIf;so=8>zZFd3UN- z;w}ax#kza!jC)DJY~5$#bd>4Uv_60zlHHxrRwv$gX5MUJCOfkGDow?*8Bxoca`GO`wjwf5aXzpBBkdOVGV7>&WsN>4> ziJ*a1Q(PUl+Yu6B5Ye*q~!$tXAYrr?Mj&c&(v!Y-N8SzND&s! zTUgm7uPwr#G~dK|JbyJdRaP~+7O~KTFRQ@on}%s@(XS*%?DkXtRhwt~oW!6Zs?u^!3ffedepVB8}#^Q@rht zGnMoL^(%0kx#KOyqg(MTpb+ zhS#S~ar4~NDJ^u!)YS560a;YvF*TBqc^I>IZfecK ztK_J^DmbA&l!&Febl14JvZ|i;u(>NGN=TzKCq~Ob+GubhNXOdK8Vx$2lg?nZnSAY(Nh>phLDHS!_E|pLRHf%#-EalHlkS+siB2BcrQ|38)fum9ARl}y%ur*Py|E?Iiw@#@?Ft(DJF?TEzVKJgj~ z)YR31w$faI4EIox;=G7n3|-!qo)}19rw>`2%ZZ@1BV@Vt1H|z}j$n$-x%HJN9?`9Q zcyNTK*Es+31>e-Fu91nzz~ZRM7L~draW3~Mu322!FkZ%1LXz|4+=z}=x?qUxXJ0#e z2i!d?x7WVv7ZhmFBcebZ)w`HoKJscpsMS65X8P8-)|r*a0Ots&ImO=~+iC zN|R72>F4vPUx(T5(wgF-)DU0QPJu=n%V>{;J_*E>wzEuM&~Uv%>sAGMHWK@WZS^ zMV`6ooPVdf((TeV;GdnevW-q{<6o#*%Itd{$k|ewa4DfHjT0_I63G-*=0OyNu?}7( zu|QVDIS(YsT4BLE<>S#%YtD9gxetpg1|rTCIW$X&_dQxtbPfQu*}1`%y@bGBDOXId zPDK$(f2Wnn-}2J&tRjvKZr2YD)phk()SbBRQ^{1AR`DI9evwzQ>lWS{+u140-aT2? zJ~xI=!a9*W>qfXvTlBzNUeO{#nv}?G8$zD<+j;71cL!dY_3$Afbo$t;v>u{E)s^Ok zsgu04-R8HcJnLJnXa6U0Wy>)|La_I;)w_frufwRM$rezjHHR0iKy!s zk`_-Y;Po9#YM1JcwunsatIc6tF!ckupzMRSVg6I44p~z&`Go9o^-unQ`lskGp<~JyRRtKG zw%F=pK@o0kw7De{7}utkU+d$vXfh=(yIDwOS0Xyg-8tdgZCn)%$76JU{4BME2dA9- zX)3E0P_Ur5!fWWaOr64&<(08SB)K{*BZ@RUM~t4Be$>1x7I^zmiDWpHau&pAod-gj z3nFM;l3z`mB1-*TXKp%sjLM9n(Q32ej6|bEM>HbElQX8q%`x<_<%Bw_8pgXePMGkY zvy(!w8p5K8hD?J=v|W>Cgi~&@&{vglL(mMeIw$kkoz~Wv%>1UJ5x$fFZd!mgchos) z#4Lv8R;w&U<}-L=ytdaJCS-@Zdh~gN$+mmj2qVxyG5Lwo!PdTIXLD^1^Rm)B>Hw5+0F`cKBIg}K?+u(Fs2}fl( zKjhUgG@ZqMqK95clw7_HX^y%e%ijzqo z6D5mSyVINn05sJaUn67JVH$)B@g{W>>Rl<_1th&*m65KN7WlH7Tu~BONMq*Cf)>lB zD5rj2>cK5g-WpCe({NB{jA!xVves61gd_BmbOICC8N55RGm2)sp39wAU0vdMe|ot( zA^&TE^69Ft_e+svv)-OQy^nXN`@Gw&YUoywaL6189$J;;)bHrxFRfEbOQ-s}!9+W~ zkfoi3%8w&co-H%|Vt>CHnduj2Nwg)p?DzGJP+Y0fp#`+7xzl-*Q{IV%y-s_Sw5?P@ z@%{f+a^z5%?i)`zVd57gj+XMi(w&_~kEvmL-|2k%3G1NvJyx0)d-!WCot$1iefkV? zW6qPZ(i8Fz&Es{*lqswtxg1TowjIxnxx(>iTPV!;^XNHJI}s+GkqvoGcRsCS8-moR zamEDg^Bl5TIHfYmYY zZ+Jg?UZD9~VDx!2e=zfDO7*w-JK#sW@&@tesv%XXZAg_PpKbq5LyZ1HU;Z)h4J@C> ze0G-og{M}jlTY<<&*yxwV&?h2ya{aSseSAJ=BdVg4zIA~zXkrPC7&HWrwpx9Lx;K? z{=2}IzaDJe(7xTj6Kt2o=Va;s9oS)u7iRHuPpeX6PV>0W^O*@&ahe-G(_B&hw1LIF z+@t?-ul*Z@9<)Q%*|S_?hCriHdA5P!TJBUIKef%kw3cc;lcIzxgAPzD7#;l_(wm zb6q|Itd99mHA(X_i?0UT$ove1O>X#o1#F+zKUvFfv%=@(QB`W>C`n&aRIdNmfc1=$ z^fT3mKLoaYl=zRv2xo(DTHw0xmtaRnN%%|pFDfjnbNQ^ZkUq{5PI;fgugT(fg6&{F zTG6~Ch5sgt{~YX{v&4RMH`smKE&okDyGk{jE%7^@pA@Mb7T*B2jrj;QL-S0NtN(jo z2bd35AJY1FTJooju2Q2%6Ca>vDsg|!rLO!Uuw|pgeY3RuE=ztR*w)dKerBuO@ckax z0nO)V{ktvsA?H-75$6!^&lT4+lmd~HzwmN75l@JIN0%AcpfcAX>cmzpq;PyaWr z_#xNpbb ze7IG9%mZ7-{B%{PBz+FI;{W=9+y1E+c~AJ>3cf|l>-ym$WqsZ!`^N}hq^NQ!PfhjwSg)>I$XHFDravV41NJ|4aBuk*cxkuWev^#!CEOsl3^Jr?{fUU1oE$1?!Ou=!u%vf z>rlx3uUY(Vux;Zcd|EUwu=2-G!HzILLxnXjvf`)Y0@P0z5IHi{0pVarwE?+`mnTy1I z*J=IRtoYjswww6~)v5I#wA^WX|NCGE zgOa~*P~yM$Ek3pc?bj0V-;G+n$!gzS4Hjp9in>XO|J8l2{8M0iOC)`*)4agqe+Mg^ zBB=L8%lJ@mri!YyK%D4XN7A58TP>Z*Nubm|R>(Tmatnl9nwny84 zs}lbYx5DoiV23A3_}-?Z{g|=p?<-4DewB**Zdc;IO_uxyu&t$%zSnE}cUk4vkH8L; zO8kC|pA@NGR{lR_GV;%43Ew-k{BX;E)nH2}i~sIquGC12Zw1@Q{A9I3iT}#1^64Ph zQ7!**euDI6<)88?C_kqN|AglDr^n%^sk?-a9c|hF0NBncl0P>pvETmu1neEH|89}@ z@TpS`KTX{ud~CqdKNo!2RN}+by-M1BwaSO*!SM~q{d3_ZRjT|F(Z7|S6scm%fA@p!xJ1f_$CboS zfo1<8u)~*#|3B%czZ~U5x!C`N%Jtt$u(iyGsBQcN@n_|)r@{7=OZt0K~OiH zzfWoTGRu9Vr^A2KiJzsO(tNlTziYv6oi6ETyXF;DE`I`S_jIxUY0W2E;qxP~Urm?% z|7p!jEuKFE@i#;K_ZgMz{>#B4GsOKnw0xN*|8cM_GerM0nwML=7wnB0;=X4!pK0-T z!3KXw_-B>WpZ2F3td2SQrApjaVaaE}Hhf6(=X08GveNI1V6S~h{P(=pUuLDhyJn(( zn<@JJ#^=6AjJY$u>v7m@&XM%&OrB zm45;JRc-&vTK=Hbe|-Bm_8$Q+tdQ^{UYHd`4HZUyuzE%1hVQiwAEmynSh&LGYrr?L z{xj99KJqVuy{7H|4nHZ*>z(iVzpxVRk4h;&zMI9#ECx$eO8NJ_EZz@hGuSTXBh_nJ zoYLQK!46kS`ux6<_KW=)T!s3#O6>muKSBDn+Anv3?O=Yk`WLN#o7KPh1DL9o_}#DN z=UeIbe6UjHgVYaIZu(pgwn_8XefWN`1DgNHhmWj*{u<(^oA~v_{~cgkYQ%j%<|l!? zBFlf@2Rm3J{{IO-DbB02+<#sz>YrNTXQ-cQ-eiprtpwY^e6)H~^CMRM^(NT+%+FCj z)4a@Tzs{eF_SIam|1BeL@lS#6oGaz)&sA>xeP^y)z8(RDc^9m30r4T~kjf38`C!WyNdEhc%GJLXY@_DC zen0*W*!!1C z`1|p(m!W-jnS}3Qeo~yb$*R9sfUUhu@G?oCf6~0y zYJUx{L;Y7L_8-xFla>A(!P@IY{?D2hSo!C1uw9z}#mHOj$3K7-)Qf&U|4#s`VLsfK zr@?yaC4Ic7_3yI!r#ry*)QkWB%1;6&X~}0H+FuK+l+}LmiEP;YDJa`}zN>%hA8PocKu9pXCF}{=7o$ za*6)|dAa%fC|JQ_aetwY|1JcpSSppSejSbVX>-ym_nYO>;Q6WA8!{e9iPAM60k z$$5j+U?2NWX+-_rNPMt5Mf{gH+#27g16$5~s2buU-vhQ;^Ha6_ek=X{39O(=;%BJl zHCF$p46Ii3({%hSwfwiN$FYZ14Js=!G?<^nxA6a6;=TvpJ4?pS3DmCm%l0R9E*5O-VjbBUzn|Y;_Ka_r^ zWwrnB2itk2`2Soj-($6Je+l+J^E1?WKJG7HTBYVM75xF9^z+10H-5+XxPLeJ3ri*a zkM)uNu_Hf7o$r%B-v&RrRKl-FyZ@loemVcDDmC#c;sbp1PX??9W?bIMzUB9`V7<)! z+jj#$T&0R&F3daASN=+{_79W&gVlKLzFk)R_Gz%)AC~gtBA@X26PUVM;&+0N|1Sos zV?Inx)cW^Z?W0v-Jy(l^XCz({}%&Wca6BOO!Fpd{QPOKoy<>C z7whmTv+Dl?U`Mq4G|ii=_RD40qW^v^@qy|R&Fif4;d!t<%nMby=F6?}rLeh54R01c zUGoM@{z|a+X7S$)pZLEWY;&`upAY46`_J=v32eWXpP5JFcS=Pp`v)wC{maGuvvl}m ztn^U{wsg7pf3|jCk(EBzfo)+vO3g9p%W8l1E_eIS6+Z6Y@9<%&lDRjBA9DCfs>&yQ z|H0w?Rkd(W`TFj1w|uDavAmwfli!<-9=IQV&veMse zV4Fiy{>?YxXQkhtfW5=~RJFixt9}Z$!2T8q|4V)BzYc68^Rv`tKKyH7`&-2Ry1d-- zb4nQHbC~$)s@_Mw6YRFI*uPNwZ@85|wu0?pex_Qad9PKz{tWCe^P#@w!-pa$pCaNu z%{}Gs?O4zW0Jo@n)h1m_vgX(#U%V&G%v8y*Qgb!Usn(>RAJ4RTIJ^=u;nWxd?K1Jv-r(m zn^s8pM>St=@o$42SRwYen((v2|H74MKdqGX*=GD_$%nu)E8Y0X4!>u>_N)~D$F%-- zOa67RgUtQMN6v_&{Sue>U8&{cR{FaJteg1=71umv@$F!{<6^&G`uiJLL5IX&Li;ac z$zKFk-XZQw3Rm40zYc6ehuELe_V2gy&&$M^pRTUce61xvEa8^loj&E$x!~mqNq_0Q z-1ft#!1g3We@5$HXX*bn*pY;k4_zjIS@rwKB*Hf-@xMy*{Z{$im^AILA!@bgSN10i z-kp^6(XHi&Tj_r**v_Qbzee*O%YAQv9Z7ofmnVJ}q)>vgbqt`q(1wExz_fAp0q>f%o1pH2y%k7jW) z9|7CgDe^aK{Tr(j{pX~};*dAaq+gJ9d!lKyYi_V2RFm*0a8&JZ81 zZqxP`Sm~n&yq=jb!+~#=4O7DOfRvul7Bv}`7SH}jK0C} z)757*KVtF8;PY>g^tnU3f4J4ZNP?}`{29$NR{Xs}>;{RyXLb6tKLc+>|M5o2AD`9s zm)Yxwz~CjM>BrmtDY^;u|4qbCQ=b!gWqyUodN&5Y~mann;H#dN7Sl74x{|;90QAvMaH1TJ-fAU97`W>ux`?zlo zc*95g*1r*K>qo_XU(UK6HSsyIJIQ{qC{i zIk4Vi@V|f++#>noMIZOg1zUEDg#TWhzD)k6&qu*F+#>1cYnt2T*K=UKw@CcHr1@s6 zeElO>L63z0*G>Mk(svnH6Z3Oaud(0Ke-GI99&z6{O!~Llr~APUG9RM8>EpliZ$?mv=jGOa_knF;ev;akms>vc64UbE()Mq${5R${)4n`az2cL8%D|W2MtrRLwwCX) z;{Q3Y-rL0euWDXkm4E$iuTrCLCw`{-j^@2q`B4wnbi26!yLq|eGdF{6zFp$yds=?0 z<^C7IUS)o=dQJ0fcKm@Ate5olea*|P{?!Dq`OME!KQQrY`7a5!e!Zmce-S>W$tqty z2lg8Ck!ru@+pYHHsE?t1{uuF5zU{}YV7osi@#Dvb-%+KC?~wTM%fBnYdhU?$eM7sy z#&X|ouvhPp^!H=qKYM*3*x)-w|4&T%wd$WaU`=;Q`2Ez#TkXT!z_#2e`rq_PzyAt$ zM9cq7%kQ`HN67|+&j#WJ>Mcosd2y?M8U|atLBi+fT0Uj*Ua&*V$EX7)e_6cr<8c4S ziJzx_p?SB(d%(7QT=f5|Nk5kVe*|`z`3Ut(<9^HkBR+xn`2_J()WJMzA9zDxG1zkE zgVo!4RKI!oqhLEU|CNvY@4(*I{MXFUf3@5{>#izQcNg(N>X1+PC&AX;CGqRpn*ew&xuz8SI+`FEq(|2rQ(1FUYN`2QWPe}|R-9t7LHQS#UCHQ#0BuXn+Q z-Ywz#Z<_D4Yw101{rV@7x5ZT}__}+<{eJoLTVMz7k@CZjUvMw#&wC|*{6)JjbGh3-3xln_ z*CRjBaO!A11Gbxae|6Ny|G&N0l4ew;68C5$rokG zw}EvtAENTOXNvZVH9qq2eXjfS^K;$*Eco90Bz^Q_d89u}{%x@LnV-%(PqOQ;ru&h8 z?-&1{r0wsu^4~_Vt<3$`AD#OE%Et#J{SVOg@3Qho6fDJjfGX7bGgkTaNw8fHi2ny_ z`Q4WMTVRJCkn}T1^NbZg!Oe*O&62)P)_k2+{@en#akIqVV9lGX@vF~+?PXr5PBGzU z@q=JTH%s|6MDrt7{V?jmDmC#ziQiK-FR=J>u+)PRzC$(NWBKn1u$>Qz`%csRpcVeV z22&47{u-uvuNA-NfnD^F$e(V)-)i5?2W!%NxCuY2e7X&6EAune8ODAq|GWgY{~<|V zBQ)P@x&NR((Bw((&}pQAM2XUXpd>wQ?AF0lk^mYELmV6ah!xoVrt>w$C^wR~_vqk)Oj^?jf@=t+D`7~IaEBclF z`8@c(EfW9dY5Dz@eBL7npGSxf(lc`iAItv9U^5>P_l+^(V}*b8kt(PCJJ!ekRSrKx zo$tdx4!->niQgh)zm>j!1a?r{KTh*EEcc)FDDwBCB7cGAZ(6()tmjd2--RZBSpA2m zzL(|4lLOv-0=zV7*#?s^-Hj{w`SICq=$2Kezsv4A$^TasS0W{ARGb zKPlle&G_Fce?9}&%Y3-H#Bj_1gP*8UrB4t)PnDbWVYx2^mU%+*&vfHItNryT*p4S8 z|ILu}owwgAAAbmTBrXmp*?Dc9?mAnr+-? z*?-=XDF2_7{5{9V{(7+GPfGk$`0$&+)-yjzRr>Jfz;-_=_E%~94_fK_PhbU~68+Vh zueb6~F<8Z?B>n03i^qT4z;-hqrfTzZ$G83itnew~{ncEpf4^0JT>@6|l(>JMkNd-5 z>zI#J^L6|kvfTd+*q)~({1)Wrjvoxzj{e_v;?DUjp7UX*gVE(k+I zr+?z%-QXX8#?AjqH4Mz4{OYHq|MnEv4(9z-JI7zcz%rDN^p)K34Y1dqk??61o=4os z{}Jr{XT<+)!Yd4?pW~iI`}A4SAGP%N)B0<{>Yo+;F|FUYkA7YQcHOg5KH2Wi*Y@8D zw&__ZA6I6%kJ<`913Suml!|BRC;O*;7VWRkihM_w{7{%A*gEE?s6>`L>3Q; zYv`a}$UF51*ikKS_%@3d?L_-(rg=W0&af$+Eu!<~^|CpO^e$?C-JC zM=jVg=4YtevgFs10o%&_9CdpZrwsbu=S}%^idrv@uGnmaf8iJ4zb}yd2*>^-m%8?M zfvx?5g#R5`@lX062HWukNuPIS+mGL`e!Jem<4M^VO%pcI^@SpUU9{>JZq`J^tkr@zSrN{rFYU|8$Ogp}GxhGxMS9 z(>d{1sGb4a^Hs_JpV8s>j@7?-9qb+Er#tCmlU2Tqcmd_l3wHh+TDZk3pQ^x`UZ_%b z{a3TdmA@Wr6Z7Hfv)X>weM8lE!Crqs{O8EmyYhbo`^O7*_`rP@AN69D8uOyaKQH># zR?B@CgUxwS-2XYvw^@7%*flRo{One_<0ombbuYU9pOf{<+h9jtl>AG)C`-O%Zx#PF z^4a~Ta`2gZN#5Dt?`hvQgSA+kGDVqHzO4mYzt?piou7Bm>c97by}|rchkHI>L;3SH z;{DXuq|ovBZ!%aNb6Fpl-G5sPwvqWTt>63k5!ivR+4&Fdx5kHty@dA5OD@lruL8UD zC5hiXKJIG)>wd|#KRfy&C_s!o1JN$LY|HQM`|DWCq_xJYA=YY*W z25$$;^t$$EyZ;fe?Z@EXCuZr-=Ka2b^79*g^B~yFZ@Bp@+yB+ytWpi%?3;fKY|}Sg z_htL<+hA`TgP-~`!tdq2`RtcX_z(5v4d9WN-T2Su54~*S$6tO2_}-WM=Dz_u`m&q9 zv%_!9KJ-ua+4;-+xdLqYKG%QQ{1&hc``q-OJ-+k}uzk#(^1;L30z0(NjbF-NMb`NL zfNxc)LEm!aDgXD_^F!{9BZ;KG^$)+&Di{x|V2Umgq2s@U-RNphm_UXODG%!NzmqL1 zQ>bX2OlN z^(t5o(<;~J1?i4G&rKKMu=%M(rYRHc&Zs83_TAhQZEmm*b#==XBJTaz=Kg2#gi_wYk7miC`80d)cvG0Qr3lz-! ze^2o81Gy4~;68=LF1I zj&vdlNfDh_+`M?vq9!$oZbev4?Wyd~%=SzsHDl7G)vH&RWFnoRwq&9t5zS2MjE3O_ zvbm+JEnSjoPt8{B8dcm>Qy-ihV2x9!j1T1Mv_C-!>p*;RFdPcEM}u^~@vL!Oxj=4t z%%)Sa!~%*gNVP@jfd7@#@LzDM3h^z_`cJS-tt=1nO;@3gNNcELa;c*Grj^_d8_+k# z1=K8jQ+$mSQu@kr^@%qt)Ml7^nDb$d{!ue~?d_9~V+Q!- zzx={{<^5M(SXEF}h<^py#P8qbg{A6P|Ayz~{`0=Ev7hxX|HS?|()c#ApY<>Q#Qqui ze4h~cANI-1?^keA{{e*q2c10llp&`MJ#EfsFEnze(+S+3)R>tXG*6TXcnXXlSfnl+q}GQe*M}TZoFyTM{mBR=hoY9U;nW??%eS4Pu#Wf?tAXtbl?3CY<}>ehqpZP z=wn+S|Kt}PjA_x$H}ef|qy-2J65e`U{CUwCov*IxR1?>D~r z^1g4q^6gi@^WE>g_Wd9H%l;p}{-Za3{F9%)`Lnlve&84X`pbiF|LWI=e)HSkz4QBj z`@`XX|Kp#I{P{2M9)0hxe|!Hw{{D}D+W(bR)it$q=gnVm>1B2G3l}w9zPPdJiX~Sr zz3Ri_|GxSE75?9Q5cP+T*`)uz3bQxM41L>Q#+ZXX&$4xd;tABrp?Io2q*~BES*gNk zUBy)-))vbszS%~_>9$$Lm%OPIUA%@C8C`+il}h1xx4eo^&E4;Kf4_IQ zLVfjjsFQzNp%(tueg4!Rj<4%@#@6@0!(0i!M76sg{kP-4|6gr}!_GXIn~qkf6)@A^ zuTVX3&(fpvH{0}o_xQ%V+xQpxyY;889cfRvi`Fqx1kN@rmHKF&s zzvtrj6qtocx)*9yEZLQ&J6q{GHoCKnE^MOvo9d$-$<8%+(jMwUUnrt}II2>;4fERB zmFghOu+f$3jp?7SPcea>CXNfVt$q-+vzuyFNJItrg&eieim`b&HY^B;Z zzEW){tyF6!hAt!2JEfN>v5BP9b|Ps8o$zd>bl-Q%5L+9>jtK-w){*SO$fY z@wnXX9BxN%BupJohnXjVaGb7{rVAidQ)h^8?hLeq!Yk8w?pi}n+}m2!6$y4lG!nR) zE||RfTI)$MJy}+4Jy~|W<)%c2`j*L7JY9B!>kV`Pqk(85g7VTlqnpp7d=sUQC-G^Z zn=JXxI>_lOv$J1Yobw3X+GL<5)@HeHJiB#Aqr{#@~?B6G1KFGVq z4%5yz?#S=sx8H}xng?h7HikZhmNCBvYqMIdZc&}8vqfDQie=^|I~$Q+;?YGs6r>s| zo8~K35>9rg>O~6|UC~se&L5+1GHsCi?9{P8o9il79A+=fvbmLNcP;WGOcTsIH8PJ; z677zvl9o^gHgzBY7hF=UA}}$S1Wdn6`c4Dv^rid}zl7sSzVkR0OGRl&ArMQ@rMq+& zt4gNm&gE!FD#@3o@-yeXP@L{!ULzOjMl(^`+us$B@RfUExx3XzG+U>>KnxdT@u>@Vv=;L}x^S>&uR=+QoIiq*+_wO(x@O{|yYIPP2rRTBu zJ06Dm!L#vqF3hR;eii!#V-sQyoh58Q~NWChXLVfEqL|JuZz1rzq)= z3N{p{ySy`$0LR6<0xfGYQF>WXD&@?Sigq`*MKjGb_KB*xHAHs|gLfq&$uJKaBEls` z&qu@{eGl^3K*~C@D)T{o`c5g=Xa1kQyKjAWY}`JQ8LRXRSIY3Nel`geR%@(n5)F<` z3a@FSVMBc*a*)P-OTtQ(1}?ZDFt(a&7|i>{JOmGv#E&}r^XCaFLulk6Bv z?#Ii)*)%v9m^CXvf0M1n&CS}PW)T_B`hB#pTt_U;_1M^KcZ4F5V_MChAl|53P*r`^ zy!r(T=LKu$2b*f@CkGoZt-CZhuWA0`AU(cv>Xbes;QxRAul}?z@8^8q)7DQN3iVUF ztY?SutgNM3uyfLR}Lbw7&l+hLxE*#pxH^Ie$NVcvo{WWD=Ge9w>eQ^R1!!j!^P z!PLPlfmsf-0wx1o+w#QQTU2d#EMr=tJJsA+LM!^2nitK`*M+D=@aB{}{HB+ylM%P+I)|Rl z?TW`6LYa2`=H>LPo+kjs6?hh>XCwuOcCzHX^rVsJ6`Nv^OOq4nn|hQ;6B-Vr6SB|I z?=hr^(ubQd7i-zBs zs<|~n%|V19H84`Kh?=3A`N?e6j5cXBu}W2_W@_ZBMT#3B>T>$q8R<%?7S-I9pxIq@ zp=u@t9U-*JI@{8!6u&!Kn!{b4%^jg`rDo!Hs<|2JVx8pf+48%Uu1crXW6jNJv~NPG zRC8tx+Q;e|)f|$(cM{*y>1bz0t%19v-88y)v*Ux!su}H`L{h0Q!Y}c3OINFUh5gc; zOt(s~DD@lF980z+^*j7chsB0#^O}?R8#U9f%M+jXFU&vO_Uw*ebzcn3=u2i-8t(j;%uIA;pu0|^w?_8D- zr4(VRGrvQ-Vs$>+eeBjX^o_2aS2yKr%hb*Jung()*8J}e=SsDWzOkZD(Kr03)UNzYQbv8hoWIHhlqyoyXkXRQ^Qx}aR_PQ{efm$D z%W4-dtgV|mr6dxktMSxuJUgE0NUsWaW<;VGzyGHh+y681`-;Ze#cl}x&-?r@y{D*Vs?obZ3Z#h(liD*AnSNu@ab z%S&cG^t<`#k3ad?gHPW3Nc#QvKKkfma{7G_q(7-Vn*O^-(+h5znf}OQa~~L+l$1D} zmodX82-C#`VN2Pmsd~Asf@JJ38m<*&Q4oeh>&}O|&Vz(x_+JVzY#lxuSi2Eo(lbA9 zq?a+vjMOhdNN2eCCz+un3vvJMF$$J`!vF98#>x*Ykl}ake33N>`x@;8`*)8p{+_XO z@0IU`XKNpU_1z4=3&b9HR^cB1*e4m{J(;cWk$ zSl;hgc|;qak&p<#!+PRdh4KEg<^O;G{_pwcP=9nC9IO_d&}`<6-Kug*6EZqAA?Ia5 z@IRfOyFSd%p$3$^%c$Kc0YDX@1_@Cm4-+-%DifCO__4h3v2 zwe&uCZInFaP>!p+Rlb-I5WO6eH0yZPG(0#Caxz?3w_m=ZH_i;i=?^&Jq|*3*!NZSY zKCDSi4*vcjXntFJFb{r%pJNJ^VJ_F(S56IwlBSjdRW=9z0x0Ux;lW#g%8V>=RVE|i zvPbo1g{(lkQks8eAOX@flKMC#1S?NNg0JH8=={WVLo9t+e7crY2{84?qR96?`Eq<; zroUr<*!&KvKz}VM8+zs0B4^;}tjHCDpF;m{0m@z)fL0~}1Y7v8$8gBZ0PY8Pm?hG% zWi!de@K0FYmd(*}eKrfy1J+KopDw=@OYuJ<3R^bML%i8AA(DNHMN6af&DQezTq2(t ztF>aaK(hBC1I&88ECek?(465WXa;iM;3;@_)g<3}7qo!QvlO8DqDN?0pw88|ic~Dm zW5X^k1R}d?Qtsq!fjkB3W}mG|ufzN>tQr4;Wa(quuFHgWLC8U|E}LC71(XMI>i>W^ z&m1gwTWKQxpf*#v;az%}CM~TQ`sCRy5A;1HXvW~nkgVNl^6XZQ1`;p{|J?y4{@3() z2VO=gU_+GiPI;j0RZa%uj|Mxq%>Jo>NW+oq~Xb8+pan)31m=d~YG^>Q;JHj#3qFNJNfNLKOJe3WB{4h>=r=WUn>@mqIacX}hhb{n$cB}O zn5!n40W*+b$z$VrH_XF80>U1He)fdBstv5l&`hY1=E_T4OIZeMhX zGyD9plKaodS}g;Br+IS?x!C}D5g>V)+ZP`$uZQ9Dr3}tYZGZ>q`Hzq}1=MdlRvFVU zNu|HO{DjN|M0oP4fN|^t3m%|swN?|X>jZ6L9lT_=OK#wHz{Q$zLNpw2yrf|zVrfY= z_?OC8H;?>6-8u5>%#({RQ>)cf%&4}zYKGo<7f=WK;k<5)e2BzMXb8>^H5H2pe}mH# zL?Q|WKLCPj?}XJ&O$+^j@Yvj>v@%Ge_Jyv7Bxh0(9u1+nz3HuP_vMK=U!BuL-sM`; zU_oz840n!dTdUgFl&523Z4Fw|aD1?DaD%W}4E#4>tHa?9*lO5M1^(39cEkU#;kA`P ziBp!+&}zjE8GahwnkLoHD~8)$91$byRdW$`b(M8H}0j6`E29MX@(Wt7dDfH5mYILHVr}x2oC0 zBMvNRAu%M${VNXM)qL);_DxmoZGhUbN-b`27Vj1mw^rPuDGi#vsbdve+$JbnP2ojl zK+{|&43cLKbqY{7Xm&rKo>8mh{wD$|E#;ooX4b+Exc85UD^Pzzdr2(Xjza z4|Y8WkG9oXQ4R7^&0fQ?zi03)TPr}RbcBAvpst!ZG?HG&ZlF%+I~0$ay;4(ZkiR27z zKN)7GtyOcZ4juXxDO%%+NN$rz(@PA$VzgC;o3ykwOvVhxMe;c3;XCJ{aFRUESfyIp z+Or`3izEK~j4A9Yt`p?*I6Kmc>-dbQpiz+AL!d>`#2TJh*=yd1`U4hJXQpzY+Jy&M zwVQ6luGQ&DG?Un{zey<#dI}B&O*5JZC6u@!G(Lirhm5DsUi!U+Ruj64%NSb6*(%8Q z9bShS+Xj>7rTzR9JY*Y>=PPk_N+*xb^t9OSY=1 zh^VER@GrGN-7#{H`t``YnWqb9OBBnG!mu&Y7mY?!LN0kMje z7oAC0TG1QyuV&YLns9)#dxibbD3T=rf-J<(dj)}-K_4=sk@gZ zh?X-0b)|?hAaodNg7v@H;)%%jX5N&n9Mk$@$vE}xZNUrX; zm?d{Y32I-cL%k{4H`%04HbXv|N|Q|}y34V#>ST*bt&TRsgT(UPC`#)J#ZI^2zcOF2 zO73})*i=Mj2Tj3N?!19o8FD~!WqMgI8j1mRhQ$>etaj&2Da{p>!+``W{~mbWgnvSZ z7(a^2Dy`V!DmELGIpuCLc@|C0=nN;87G_Sw_eEL0p}2SjW10-Fnh{jdHthm5N0Enp zbsrK^Y1Agu>w~Ba8+q2npJ(`Wc?WH`92-W<$owSgEifA@67mFHUEBBzm!G6VqDlv) zU5KUC0(%GZ;R;>ZRc~bxwg`p>gb4p1D$rCjr zDV!6A2QOgFKEM@wmi|sG{rJ5sJ^VqmuF5>Dt0h`j3$2H!T>yF}U@pPF?1RkkT!GI! z;F((}>DZ-p@Sfq1%752Et6Ce!BGkI$4ZbN6Kz6mZ2aAh9vo08Z0X(aLj#b{9BF?UH zazAI+9NARcciiOKzGHniiM7DSK{#7TVUs6-ekPCeIhynlT7Ea#8gt`p4XYqXWqxU$ z-}k@?9GudTRj#f+a)zrbQTg2WxVY(OX!-}nj<=MLy)#T$Y65C~@A@83*c5`K_2`ib zTjrG_Zb-+~=9OmXCC1IK(V7Cfxy8A_Bq(>%LxLbrf(LDIPu_TQM9a7MEXkQSBtJO~ zX7RR;RpLz0?k%;}1OaCfTW#84L<2@QGx_PPS|LlFX$gM-^})<<555g^8^&!}484@- zFqBryw>QHO=38LFgx@ID`4KKvKTCj8!~cx&^KDvcD-Jhsf$FM#CZnTG8=@Aqy1GQ^ zg^egX?l6O-@@&ROrPVvkdGb~{Ra*Kdcz2$hCnq{jJ|cOR!dodQ50gR3*>prFo~E>P zye0jqN_xe%dy*Xr*#khJrk2!(tn;hlJJjP<2TaD|HqF+GhL5dHb+m>h=x3oTkevCI z#ljrvv9evqVX+Jx(z*WDx!scJQ8N}I1>e0pgvq_5J( zyZp(Jq8y20*bUUDBhu1)QQA|VoD0N9m7sHh;W1^ObAfS; z(!$I?&DKI|6x1f@>WsUns}58dl~3ZT4E=`df32aUNK9sAdy~~#rbFyPo7LH!F1b(R zcy;%a+`rJnC5oxE(0e{4$tM6TcR0JjqWO~2MoVrK$7)B|RGRM{B(1BKK4vWX9ngLS zCG6}TBky;1kCMN4cIU_~kVD=H`Q=7uw^ja9Z64VUBkAnEQZa{y0R5qixO$3r3CbPi zNFvb6fDhlO<>36w@T*FTTGXU&F4e99MVlGBEjp_zC?Zxhh&1SaknYUxBPgcY$rdpm z$eLBus?=#kP2NH7M&&nZvp%xWMIeGms*dk2(K}mI_k<3@^2tX`d51SYlD$w4XJ0NK z$eyGG)aG!%d8JlwGNfJa?9P&No!!N9wzK;(N^UxW$s6fjZjrR5KaNl{Q`I);GU7acKH7UQ4cfqum6g$X(+HPxb=o~gzT9t3s ziaK{dzTuC_@t92HnuOd>7ht8@L~_J*N*=U#k$Vhg+6>OO;4Rr8s;XDcLTmQ6!7y+_ zo}exmT;7Ji`KCa=1!d^Q2q~885vI@HknEc_RK3Bhx_B)9_zV@N7F6iG*gex$io7g_cUKZa0JaMvfiPurLhhBn$%M!$>e?&->XL+^;rh7?DJP4jks>C+M2;= z5B9l1SD`gWlV)oUJFzH}5Y@8*FZlg5R9y(k)*M3K3-dl=YjN3HlQnxwCb4B{sb+|F zThzOKJHTp%^hg52Lrt(6)m=Re8lP!MCNou@Z$evU=UHqS9pNjqEsZ0n5-S@O60sm3 zwONyZtGA&$>ORK16VY7885}nX7l||q=_7iL0xWZF{QpeilG_QH|7+vc%#B;XinC=yE#0gkDRB*1J6UhYdneCq z<}15YPVKg6E+vRHYaBu zU35j}b7rMOT?k@}Oc3s{a`=Pu987BYm8P{~*nkT5F~%5k9>>m{0O4l=c`TJxOY0iN z?IfXr+vLp^v$G`kaGq@_{9-Y`!|dC_1Ll>YD;y!W0wfpe z$WnerhqhX+&bD|dFLGa3Z8Bu{;Km_oJ)p%H){4dil~w6{sVf8w*P4RRP0kePH^%_ikJ4f3_PwnWqbIvY_IO#>5eF7!Vm67COc za57Y%xwrV1%-Kl#SwQ+eOkrptg~1;T&y12@OU3b18?X*rvv#9NHETCo)G6kGm7)g% zRub=dD&a+JZK1oNQ_%C!U|c@iG8#h$l#-1h++{1r4yrcjM+5c4)|6>$kbFDQ2bXpa zh1r-Ze}}U4)GY+JI*Z%V-XO&ju{DIIGad$MP*u2$@_&ap<(?P>NpT2Z&X8O_J(pfyfWzX)4M z=N>0p;N8rWU*)j6Yvk5o^(ivk7CW=XDHG5eG*iUfkEvBKoj=woM*LI#BBL?<6?PB0 zaszfH?MI+o+z=(ubg|bPlaONCh3a5!s_9)ig*jgKUHvp0p#i!k3FF6VT$wtPu0 zvfU-bSW0oSZjmQewHinZ$EA8K*#9a~ScyrR1>RL{9EvLFxoVBhuG9c>;y{_f4x}H5pUEOgRdel`$b(K+F%g$QY)tGge zURPPHt^wz$YiV2tsw<|uZ&yK6O7deFH;Y-R8{k2nU0#W}N}D>NL`}uCfC;yHgiQ~Z zb91@lEv1i|I>ky39pqu2PWgO|JfXDjN|}cTKl>TCUAf)wGo7~*%dgsJMA1!^AWNA$ z9$H5=>g@=-VtjkEx)WVg7=J@Ka(#1i;p~|fvP>r>79epC)Nrl7a$g^aJI~Xj{r zcK{AwHm~Ed+5bJuBmIXwm+y;;f6DXW_wn{vwq~OpnWgg#xD8~{&Ql#N-oz67F63Tg z2-xDiMJ#db2IEk2-zK6JeVydK2_8NnP05BzqmbDkd5+S?5-3s@-}Dj_PLzQ?c20fI zM7VL>24r3OA)=>|f!xW}`0zmTkAO&3+7@M@Qa%u6Dh@x$RT%rhHxkclQM+OK4myM^ zNB&wHBz8lydA`MU=nE-o!99r2iTzr%878$k*bMAht#uVQ86>wP_Uf)TPb{(Rrp8Je zZM&*k&C*84?tTq9Lbf2V4c0}!&B?wFUp|JHoE&<50Uxg;ly?Op7S}S({{UJSwj!-_ zvM&J@qB!R|_))&|bS}6XnpRc?+<10rM$}O=uhdz*>k`S04zN!W7-7i~@(tJj?A{{3hhqSJEAX22!b?4!&xFDy^Wb;E62J;K z!$b4&ZQ%~oWse{Py|miRW}p))c4}468m&m3&^~BNMtsHF*nWHqPORJavdMUTugSP5 zZZiIPFX2}p{>Z&?doRdaG{vlL)=+aFob|Y+xF7D#XFhIOoanpFq*+ZK+>U3C^Wg0( z(6Z{eEe{$*))dnsqdEoYkIEoA4K|NP|9Y#M3=~mknAOKEnj=}Ak*p0uC$LdxHgS7E zt>`ZN0{w!sV3GiR%H1?)Tgpq2+Y~rY!YKPp&x2M28tjXopvkluirca2CK&Ve2FC4D zfyc!IBzKW0^a>=%vbW722F)H>2Qyu)(mR)Z12Z3?<$^1ml3CR9)C$ef93Ba6L4w}= z54MT5d>T`4n&byuKY!`g=!#dE_EGF$vpk^B&{!&cGSu@e}ZXLxAMJO+zi@EoSzd2CB29n zOrTCN{}f|;6L2ZMw;N`j4VSSHm#g$lP~0AdLQyZo<$=Q|kg>@2B=mTl?{`Pzb%G;X zphm^ab`(O=R6V8!+rB?~c(OY9|kv8Tl*{KpW&WfNnfEdybp}`f(o&43ZPI zd=pD1`x=Req+dckRrYDdaCMLJ#52lEhVm>>UJ%Pu_RZ^2P5~>Y9?IDo(^G2IFT6H$ ziET3#@EjEIbhJT_bZ!=vIRRS@?lQu914|QTdrw(}7 zo@o_8R^Id-&VlLrT7j}(hDi|q2RyreI8AE{HzYR%UoT|iyFu;?w5&(@0DYK|B?{q9 z@#C7BLM~j%jk_fph2i+}#4L&e;(OjOI4tz1R&wtY{`=6MTlCPM^7K41Drc)5TGCLo z1X2g1cHbO)=ojdB4uU)pc|bXBY^I(-K0UNFkdVS7s$#J^EKaCLsT3QF3uQeG)KRup z?nM5v8R}db_Hus9JqHv!blWvztg{q?1ag~45T!+8{)30Lqzcl-CC{lo*z?i3j9R1n zFgJw2qh*=uoLrfLmG40VG8G}n|L+7;)lfc~tG!=l;$CV-q;#_L+R=)6Ua1v+{8T_QZI4Duxaz1YNB!BCasdb`-v}de=elVNMo^tTOQ}{==bM!k@ulFl-&1I2 z4Y9gHCf84+I+8484Y z+#kQ#YjpdS%R~80_sJeEUy5>H+DPj62Y`}~7?S%^^ch_$o3iI9yAT6PnFECdmjX(- zzE%*dq0PTy{Aa0^#ee#Zu+Xu)=&4DqXHO*2zeq+O5l#{JW|*WIyS3uV@Zi!+dG86? zjG}i4l$ljjC;3$D*sQ%K?W+6?Kc-7%{%x&3dmHFZ7`4QrGq|Y+#aqyilF^8H%c}b| zF!xYB)_L+G@)7@44QTc@T&ABH*mQoSDH7S%N`@y}Mq+nnL-7Eh#kSVWhK1eCBxUw> z)Fj<@Ne`1$wbzASK83u2Q|3~njGPN16~?tM+LZHw&%mg|63i^BmlvL6T;9NOnUG82 zw$a$y(eMtLif@e$xJM!vay>?`&Dmz65RZS9>S4QoMST&d=!SLU+Dxg+57D}rUZPzMC^V8UC9!N2O-k#ie!LN*F79MX;#> zO0`#nmvIhJ&p8sUl9xX2jzlU^84QKsDWj9NeS>SRV*yXe7$vv45egs%;VZQA!fAvL z0ahq*5>gGJzjvWhOgu4Ea*|B5UTkanacoDWb~Bh?a*}Fb%?K^;#{A*Kkl{m|qK-z& zT#wIF+4Dc}Ij51?gqQd4X%nt8#cV>)Hiol&U{9PiaX9yGW6c=)t*do0#l*n!#Z0Z2 z=cC`o%zGH5^|DQu!+$)u9QlB4nd(@j+Dp}HuOMx#13fd#cZaAct2~|ZG#22DVRuY( z!KGJXX8HotB#;_jqq>W-DxYgQ!A+f!2#qI-rE!2cg$a9Y!tyashUWO(s3wR0tsEm-|MPHLiH=c1(GOPwfFCC{_i+yn%(8dIWm|EKmal15uL zjP}>0b^ge3&-6EQg&uotr2EYo6YG0u6|T5L$0*9Q8~3`FS(({~%pNNz zN$VOq-REJ1$r3psKl~HOgk7T?D{!(HB~(IiilXb5v+{*WDA{Xrnbdz38lV=HsoTS# zu0554pyvRTd6!9PSBZJ7ARbFw`X?umCbkoJnk%A6Zm>H9SHvN?ufvJj=!*Ovq+n)) zvQFKl6_pXnorLmx$$bk>Is0;08(?NF$I{+}(zL?l5b|3f!D<|v2kQCQpa$^Oc`&a> zO72?xEt1?D;TIZe&K@cE&n}|92RcH5-PI<};ChToJz5SVQj1rpJE>n5On3zQwJ2F( zf@6-}smocXpvB9z;uX*}ZM-XTh2#$O?|l@apkEq_pnksvAu@gV#jfw$RePCwRITGQ zR(EXLxhl5G{$yJry;60peTC$Cy+1CLF|}5)pw?=*yVh#F+vPX8stu46XF#}y)Yg!n zcF%!!0Uj>;8g8xz?;e7hc{z@mT9~5J;Axbk&IakV9H&LHMD$e$5ZRwg;v@59683^d z#;+EdS(o3xfI?AFS?X!?O+6~4(ABPBOYAaQ&#ieuc_w67o+6{rW#Tq_E- zrt5UI1Vd4RmuyAPj-af~@I!H5ql73fMgH|KSP>aph=Q7}G)Yxn#}ez=ix6bw!7fhH_e#Q z7)D(#J6%rpO%<~*ll$d?Ar3i|gL#^5#gt(8myyWID}Yu+6*F&ac|jSp<*hEpaQbz# z*fhQ3eO(+Y8?l@m>xVAh9Q6yp*@$mxcxI^gk(y<+;_=WA3nLfPdh+Y=C*{d#`&#K- z#Iq7oGovwhA*;r%AQOI?Bzf~(pcwbL)!N$N|Br&t-i)ILQ` zX^**4TKedTNF@787U-zj$~4E4k=3eWd4?a9x1tgZD`$as;$H0nTy)bh-fjhVsqsbo z)kN}h(2Fumvy}mp>8IJ3II|N4Wq|7@vxx$OY6}KiMA})Hh_x?%ODihz8bgPU^AVqd zBfj)F8;SwIA3_J=rIga9W7?BE?I;L|P(w6r7N*VSX&+)*1*Vm+A@xAMP9Lb3a1D$- z9=~ML>5Y;JJt*}^7Exu(S(Qt!k!U%~F=>BiJYsWatQP2iTWyw zw50JQs^pn^*>57cw@2oMab;u1;2%&w8P9Zc3r`8o?vZCoC(YsaX%4qkvZ>rRHkHMm zQ+YimLEZwK%8zfwye)pnRDJ~joY#UTZi30WJ_-4>z13%H=3IrA0ne5R*+LUe;kGeu zi-P=Jdig2b<0z-yPt!8JrE7kPZ|UFREk832vn>85bPPFX+H$58E=^?lSM<#PaF6_V zvHZ(f{^pZ>E?tXrBJUSAC;kr5(28Gh?;5mkhp&psCvFR!2N$9V@!7pFS-g@|JC|w z&j+zTH`ahXf^tgNg`GJEQ5%!oQeU+8=vV@*+pT1+fW4MX=2IHNrKQaPEf3;yZP#X) zJdJXKbJCUaciIedRw^<+r4gy43Bmc_bHv($@fI=sDG_Z35-sT%BbpD23jN_&RALx( zYE|{6u(Pp`xkxS=;^=fcN{xx5xq5O#cl6X!?8Hwm(u-hvF`_dWEbiixXyO&Tl<&LF zEQLbESOGYzS(q3bwV0Gx*1_k(ZP=~fcCc=}0>y>OI&dzK_DlHL&q*FnBFfYi)?ibT zK+&A+jAhXA6Sp+*)TOn9ojf5mfbS7-!=vE&Q>btheuY{&RDWRyIv|&DHhVqxVs~kI zY0tU5;%NL_e&s05*xdHB%0&~)keq59q4qK z;wG8p6Eafs0seM7n@nnZa7sHHvj>6ch2CQLnz9^> z^lQ9{&aQO%a%WdR`4VSWjy%-aRV-iN-Xag;8hVM@nisn080D!IK!X=SgEx2+0i_>T z|HHd$ndSttKG<@Y>1fxtlhO*d5>|Q?=Oi*)v4IqAm!CM{$0MV9Fr}hnt(-V-0ja}W zqnHc!Ay@lnMHLQKTsy@@qy31*)|&bV>O@rUwIn>Z&b4Z8V&{yBDJIOsmfT^WJv!0; zW+6+1+^87Cjjy~79?C3?A^)A~c?jS3;pR6Lftj1|jS}3vc;GBJsZy~~c~olfWHkm! zknO?XY>irynUyhr1dneZp8)H3!7wP7xlrL9nL3d3m zb#`ANUr^{hA3%eg-6NI5=!PEx?VK78<%ah|o322Wc;ZG>74Tky-ZJGgTuT#iHiSk4 z@9^0wcwc^xO!m(s$@l453DZ{k*!D@>F);T_hkHcn68^R;8UFmkQ6_8DYieO}@Q*5B z>ORcGq46BNmUABC&u6%Uf;SC~bB0Xmj&8P7;#GQLXe3b9`7Dla5=ND5#}UpmK$-6! zWP(ET1GrCUfBTtL9K0y5iln1GdPxXh=m?=pPV{WR2ho&oJDGP8`$pQb?iI(Qz=)3I zy5&4N@@Z?~bAh%~L$$y3EObt^&>N5TOv$?lR{*LIEPe0sp6QoTIw}WjDuyD6aCBsK zaLFd*(<{o;6Y|J=G!FXrDZYdUl)5&X(O1vr5rve&lD~K)42I}V*K&YztMjJ81({^B9MT^B{E`P z0YAZK`{`R8Flr+W6d70Yi^z8{iPiZTTZ+syq2x$qno60P#P(7MEk$QdldnK$^%9lo zA@&kA37e}q+$uF!vpZF`{Aq;8*Y%N#ZVC_kA!B-a--mA3xDT57~bv_w_^Q?s{r{yaj(M1dGWE zdRb^;JK=&_!|m759Y+Yl+(Z?y>U>WcVv^xHvq)pqTR5O?3QZa{LKhrH$MSgr!`R1a z^9;z+_J;u-nm;7gd@0&|RH~fNBeD=Z9R3mAC~blJg*-M1(4Ys#d{R-l=WD`mT()dv;Z^Qvp!aA)OYh0q8F~`v4(iI z_Wy%}Hjr=yf1&}tIEahpSn#pE$U~0BoyAQKz7&a9PJcNN=W$0zvqo0D&(von{#r3e z9cOMU7pVREz$B-aqgDG%zLaDZvR?JQ$(LYyHdg*m-4JtGZcJTEc_XZ6lAUd%@V5h}CHJwvJWmN#B#^Xz3G% z2d^EDE=xQ|&ZESF*8xPcwFd7y9Wx8#;zyA3w$@m@zvRIUZrl>Yt$xjFVnL!TOl&;p zfD21w!#Zp~b{gjd`WMRpg_~N@Yg2p$15N|w9-gLd_L}j`^?i8ex@Zb07s`QJqwWU- zt+VmRNTk*{R(Dolp}~y+!?QV>qfNWY)2Vo3Rj-63{jgbWL9#`R#hAp(Tm(qrf5zS) z#rJ<@Y^lT$yx=`?MQEmE-K?65G4MJ`Lfxl(objKd+UoJ(Ym-oGYXPNa1I;U&pXQaV z5&j3@f2~+++b($fWT(rf?0$-|Fx-)SiR9iRG9OA9&&6V5S9U-77rf?Y9i(KBmfUrO z(Tdx<9pOIgYycQV(#K_F75#A^9gh7edyKq4dz8E{J4fD=JzCxcw$qMmtK67BQ6^E(nM4^*`%C@}cEdu+y&3Spj@jibZW5Fx zXK_GKzM|s{b?z-n4W3F+HfHXTKatio!r~a&p%&p;GY=jp3)q@zR+EEJb+mdK7tQ67 z#eTK8PCc&HqAf9qpS>kniqTGMgLRj%Xs5NxWtzRkvxT3(H3&+o=4ghYd%ub#OW)f3 zB$3A^XDO`)DO_#SaM->biIKHtTDn9R z)xIY9&vZ^2&AvwRV7LdmMx`?UBwL$2+}l?z+Mp`_(6y-H!Qe=qq40!##A6sCy!*@B zH)D5b7(BQjebHp{{0x{^ioTyLI?GvnIjsY+-MJu1gmr06!b<>}gF8-wksQTZxXarY z$qR+yVPYT=4Co2{_8yuJ73!{$M^#5tz(#H;S8;_P8&yXo4>zy#_+diuy8xQGgIu#U zYsnhL$;I_Nxb9+oM*K#zRghEI)%s@=z)_;JxEA_#y@=Nd!3uvI8T!RI>-%PBG4gmF z+s%$fT4GINZ_XDGb*>kx2i#IumnfHdlS5DA^hir! zRt#N@2Lh^L;v73m4kCgke1@1RvyR<@^xS#2#Dk?QYR!| zA#xu_n^B)){A7#f@YC)r0Ptu{@QyT+!8I6=-X5Iw8L^gic+A1pY&4^1qA8fS7oiJA z>at_&3Dm}Q{U=;P8c-S`N$OWXsfdG<$X{rE0ro2lBL)6by{S*WEK#n5i>nvCcP5|I(@b=RhvKo|CsB(EOBpbh^v=8wzx<2!p zljwHUXs?6z(9wFBi-pu8>K%Yu3&sILX9Khl%PGe^w$+~9@-=jEM20V4)as~DieoZU&v&%POv%isF*!To~?EOUMeUZxW70_o&s-r+`y=!)!c?2 z{SJ&*_Zp;Sq4T;#r5mri0HbYBcB1lk_6$$$&P9eqd5gLy98^0pi&jgnkx-esODkR- zHmKFUyoh&N1l@=U&aQq+pUe|a|HK!6-?g~-*ZO9P-Wx>R5xJri@lw&~PQtqLMDH|Ftp+^hTlRvFhn&wE5|yBDhUlFlqL}>wM$tPMg}935du=!wp~!B% zd17A47bR8DBIilSgEg8!$2p+d*1)=OtQmPUD8G+Qs_+h0tK7Tg3rq3jz#p6^eN7+_$WsXK^)_c%y2XtfP(a<%xK%>>KA!pK_&=javKk<>M$5Fbu{iU7|gq8TB zB@s%BTD8vr9aJa4-wIVWm~vG;#g|gLo=*AfENSj|H*^uzhMsQEKasB=5BGu2S=61r zTSf0=>Ky6`+c9?8Z01YtYi_<&T|kU^khjo`o78w~BW_YZZD1>N07oCNnxVfEMIV6Z z$3=#ISY+sZIeHdHzyAW}jq8HqyoIP7n*rVP6TJFnBS+@ydS19gT3081yo9zjI;%<~ z_bekjq5Ul2I={C{o+ofJ?F=Wywm+=OM9{c#vwT$XYTYh}nuB%kAVt<%HAh9T_N{ z(28H<*E-Fwhu$Wq(Og{jbC8ZqW=&lU8DQ4uuEv^Iq2J=S@Hk3Y%~h0Bn0XXrP}@lp zYa zT-@{6p}N)8)lYiK-Cq#&GWtGnrZS`t1Ri$NQn3OSoV@AtNaR1`Vzq4GUj3XVtMo2D z59A7wdz;WZh%lG#?fX25Vjsr2erWeC67d|%@$iG$bJ*ptwWdMiY6}L5=W1uh7IhbE z;IMNykdP<_rK<+C=<5V|idI}-7_rsEvd;p2z^@!tkB;od`OJ@#tB%s308P(4t~p92 zcUlrklSuYB$%Cc|v`Ps59`#vVAK1+`c&q|%cp6Y{p^%vIz;2VN1y^GFlCz{Qr!d7P z)m{e^1uT4@=}SCIfusM-5uBoxno(0K)jqD`I#F6W?L4%_P!iyw8vF^Tm1>R}&0eVv zeK}8c)X+JDdWw|48u@W?Jy=%036A|Km%e1VKurRo2TWLG5YUPvc%c+z_DyE5%J} zagAoH&$QJ@OYvS&y1cJmwQo?rsQSU67S)N{)gr%kk-BHo@7@C%;pZRl{PT%HdNkIa zO|L)#!d?T|rZ*6aB_ON}r0k|O2uqB@1|jTaXa)s+G1wSr&!#tez&s8k^2Q}r7V{L} zO>8=A^h-BHV&U4J&1gMMB=!W_$i>NcftJ1)%otFcS`X|Ft!Bx6)rFwv0Ta0LLR8A+ zM0TtE& zSNwu(w|C*lPhNSSG3Hl(IXBZ(5vQ8*qow}XW@vmlcmpUh-)X!Y@!aJQGcEM<3xBNq zmY<@Z1-5TOH_+)gKDq$P52v8 zN~zOQGWZtEroa9Z=a1~zv;rRVeVMmp+osJp9|r306E`*C`yl=OvP}o@eX#zXy2<>{ zIDE0eE00J={mp zwe5wWaVOF4-t_hwZdl?%Q|7Wob_Op=oy8*kJgConf@`|+-^e`dAY$WQ=T$OZLToDZ z{>dJU=HHMQk^vSsm{{lFK*HQ;oqS1$<|AHgkP+{SK*B>h9$?%|?T@S6f#u(W%p*1# zh9W0sE!03ur^ipf=Yq)o+ zg1`GUWwrK{S;ZqqAb=8(MfomrU=^+1``#Qd`3TJF(Us4F_dXv^VEH= z;2FjBR~87E9`c zNmnOAYmVdWS?jW`21R}C?UH*LMm!fU)2>&GD?<0tUP;`-rml91qPniE*LP z(_-VgNYR}I1q9bEL*Fr`;J;7`>$8?hr-)&d=A6V$Gh|$$o8Zw~&>z%E*$gty^YAg? z0-=7$fKC0`7Ao_n&cq-)erq(p+KHdro@B3)JQE<9uBDuM6VV`U5Z#HhqMOS%RP|X71m00uZCg z*PCO&Sp&8OO`yhd>!@>Pn%Q1&m?8l|_I!kgVvH&B>i10-me)Jax z-@@VZID8j}Z|CqEIlP*~cXRk}Is9D?KfvL`IQ$h3@8a-29R4ha3-2-bArph&$KhrU z-@)P2ID8<7Z{+Z+ID9aNzs2E0ID8m~FXeCphhM_sPjUE9#~6G#hu_8FjT}CL!wWh5 z6Ar(g!^bi>mqz6nxvKz|c#3lgP=z%IaEDLSIiHwZ0Rt$fI1@@bdRksQ+6zBw5uAHa zh+d+y%qR+>2^d>uTZKNJ&|HiLFWP{NYap^j#|G{vNC$}?eBd>Z9bFhRGy^P_*|-~a zpXB+tovt`_E-(n}+ZkhUj>77_!^rydI>rluoT%q}D*6tj(geoS>tOAF`giyf9>>lc zQts^GB{2UkqyoIeJYWUfs47h^TZ0LzR%WUvU8lhWTWUlR(V*p$QSVs{udH$Ga|qPH z-y3oNjvA=^&2`!!xmVzsqi4*nLk3o)8GG|jAYS-gVw2Z$HaX}RlhpS5OnV)Wq@QlW zX+taV2<&g@$Q6voRDC>(YS2D3{XJhTqLDa#g!Zmk?UE-G$_qV%!ZB?LDAw9U@*yZ? zbi{xTdp9uGTVY6G{tqpO91aV6rC%Q6&W5PlBCS0(=G<@8jh+hJ5;bY&RH?|R{_J5$GP^mlQ~_l?hV`UjN2Uf ziCWY7<7x}e7tf{EXKc~^hEG=TNa$Y=qcpA0M^}U~>WbJE=Zcs>yiozRo4J>y*B{Zb zoe#1@(V#*h{L0yy`NXMMGxJ4^XW1Lh``@+ktB-gaGylsrZi@(d8&P@d(MGI=v>B$h z{42sP`@5WdkjC^FCfQeE%-yRz3BOf?i~)Z!CYbF`xp5{fQ(@vwn>^}{IloF;WKWFqX(`w#9HLpgG zteUbP2wBiq)I(YL{RpW+0l&53s6mG1%f1$w=lauU9FiRn2?%2zy#M}r0V{AC{m#Q> zr^##JGkHvG_0WlWSZrAGrw0Hu-sfnAl85@}Qw3*Swt+5y>BB90Fhzjhs$PLv>0HVx zG@kHQe97~WD6m8O3~?(i(u;tAl~^}-Cx!YSJ~s#d$9_SNdk^k_*&nJt%U6VSWF-#y z9Yn_1i#UCb^b7oQK%72D`b7s8mhgC-evxqa+{=|Y92Z6z!KEMkPfR0*+qw3Cz;%={ z#4p$WXMTZ*v{F_9V(2PlcQAedMgdD4&0CS?Z@+}<;lptq9DXPgQ(>9M@n5F|T|>(t z?}{9Uf9&U&k^@QC0KbvL|JE6&=K%b-9Pa6i({lhm zjKd%4jMH-f-iN~-opE{&zz>~d@SM&#JqPCvhhNqir{@5CBZnt-#_2f#e~ZI^iPv)g zzLdki`z21#0r*oK{`oI)dJe$v;_!d|5~t??yzrz>XHxCR6#uagcSpAL;ZDr$ELOlY z1#*G8hNGLr3;bi46*vQv9Dd|!N4r_lJf3vdd%AKP+zCnaeOg?QH$ZwQ7ykI>n8ncO zqj=B<#j=Uv1=zJ9!TY;~m6#UkAS zuv@-V%Qv$xqO!}fA%_et3(kkav^y=H-O8SF+@u2I(#_KsVfsu+58<6EVDp9wk5Hd1 zxch-i;=B$#pzAl_$Pv7Y}9p34_- zlGMZ{%;*w?m?)Tw{m#{}fpw}F%!Ra(b2ci!*LHz4;SpmWC2rW%ek^ zy~N14zlpc)&6rtvUbGN5`pPi%-B{|W6VWQ_jojnJtUR@<>U&e5AkkC~ydobJxe0Hm z6B4Z}5e4kjkcqA5Xq|tJHT>^-sfu+IT2~tpXRRqb(AhPbePs|Y#TuGeIN58t+Py^y z;`s)j$r!x(ZKgsNHGxJLst)z6VMVNl>}b2)F9~=;h!dj5a27(aEd3x08KIO(@`UDSp!@!{9IQhH1>JoQAOs?^{WUg-9`8ic<$ zdC4fOz3*Aftt3ej!L`_s;Evg4H4_WLJD5$LruL# z6@8OM8gHyYJwn?&^=bfgw%wtt@URnoZzcG2Cr$DSAZBo}%BJy-7-g4r>a$^%ZXVRg zIru%tIUkxb{CI8qUj3TF=HR|nSS~sHst?3S@x>~g6zeb+5o*QS2J+gH{}rw6%FgIG z;--GIMzA7r2+mP!bF9|s2T)_HU=%~|Yk`3g?R3?C6H;0Mo2Jfa>7&_dREuG;;wJz)kRNtiaAhVW(sS8nML{+m@T?Xl*$Ob7otOvP{387s>J-4 zAMMA`&dM>8yV(-;r2_n~`|(UgBey+Qp|tLLF^(>r4}jX@n{VKYW^yQQn1K5qI~H9} zqj^#;%NzVQmQ>3aNc85h+*tANMX@||ML$t5>cHkCgptsS>$C}(7^9O!D@IMy`AJ2P zG3g&9R*Ak7-q4X7-3j-+h$N^0t$tG*h@oN3e>D`E5$y9~T(j9!xH#6PIdMzcGv*X! zE5K}DzreC>i*+T~5l^W!)-034$+5K~N)7`{ipKCP=O}Mb0lFuzx{?~On>1L5~&)zbvLk_zJ)5~rJY}z@F({(GW3`gYy@6A8g1y2KJjz* zzz`n!+Tx>7N{aCx?&c@Q*k=pTnJ8rlZpm;iEYGAsx=~2XXie4%c0f zC)*kPS`OD;kUwyEI*02n$S*kD%;CBV@*@s!=aWEpLH?D)n>k!}LAp5H&*8cY@(&!o zn!|M$vUJ+W`aqc$)=v;^4{UIkISov&ps~C9X|WG+<*A&<8s5{vyaQwhtEDP7aczP zxEK$geO$ta&OR>N51oBnK0S2yaanoj%yD_?(3#`%+@Uka<-tQ|j?2tLXO7GDht3?A zQLH^|QxSD#pJ_;ztx59zLejq;WVmr6vI(E*HBzD2-a_41@K|VyauVVo?06NhIG=@m z6xH64u^X6~>Zqd|MjMbzUWgwI7~-lj(N1(>_($JOqH3pAF3V&!g;MZNZQ?_C|1sl3 zK0)V0F81_*T#P(Oej53Y`~>nI`47l<Zk#9#{BhN%WBioV3$dfY~iNlmt zk31T}GapC|ovWn%%tq(vX$IH1N&<)P!ZQJ#p)Aldh*;rIbruT3lJQUtWOu-{j3fes z71aa^j9hmyT4Gz*sq7A<l*D1v2&QD7QLRN}VFq+slZBpy?rDuWacgjs>-$AqBV*tAWS=8TbY|u$b@)9= zN(z7Gd)A;9Z*V?q5R??QyYIe)=?~h3wW_iKo3n{LDD)la$}pR9c!eU5Nw-gk}21-1&Gfh`kPvc$Uuqa~9R=DXd)gF+}A)vh;fVLVIONa;;V5 zau2`J$CkpfX#$NHF*^5Z{Ce=bW%y| zek|^7JpRF^n;oW`7;VXdU*psfF9 zsZLfBH!S5{ahfh`!Reshf?H8J&a%}M=V_+rSK{^9E^3H@jNVMhs-`Z)#qkcB7^n=s z{#+!o52{=mNN^11AyQ8Vp(?-$B~;Ehu~Q@#G?E zdP6!;(>sw3+S3Pk#m7qz;(?HvlKWZw1wCtW0{N12Rr`i)P`2=skc@n;2=LmkQ1`-n z6F;X1;Itd)0TjNE=mGS-cj*Dty>fa0ZEqPpfU@@zJ%FzF0zH7LSxgV0^U3r8D&HUI z0a|h&JwO|7rw3^946d)e&0UeN9$0Kb95Lxwm# z0^nD3_#N?j1i&xi@Vt0E0^mjtzcOBr0C;#mgP#|#M*w^~hj$BcdIZ2fLYy7}@cA767a>lM0Qj98{yc~4uGf5m!{jfBxn0LG*c}MdU9J}~ z7#(ld-K~8Y>?(xmuGWqp2}b++x|?u(^UiBku+1F;wkXI)vu24@D)ZtPI?QB z82*x(Jx88M$B-|2o`U_az;g&7yBE|5cuUM2b`i^6KcKF3O=KJhv)Tel6x5S}xSbjL zWlrK)Jotb=F{}DqNVIhmdi_5mQP6nJ>v3KrE({)QB0fD4#dWfURm}Ok_T60}KMo_D;YSlidd)u)M*B`Y z_m8iH!pA+fGW8V`YG82(J}@*~ZS9dKPO(!(H@gnrrrKMA8+PKfZ_#cu1ro-?qMQp> zmo|toKz6V6^u$Q!Ryou6M8umLDY3O;uzO%22D>Z6LK_ESO!VUs@05tM3lgSU1OX%a z-1rerwLSBwvQK57^GF#Ud}t#w*cMl<2{)SYb9exJupV`~mdx8ta^Kp7d$9SGTHJ!h z-_*-M8Ae+jX(KXbM|M#eaO)||P;9xz8U+`B*8>&z>w~{L1C_wHAnF-6S*?XO(oI%? zp1kCbEN=ht`+7#~2rL8LpmZy1-2a4Yg(8Ea0C!^mDV#bTtFW~$ug(?1zhT#XG9ca; zioba9Kf}{0XX5z}duz`-Z1{ztGXQUXHQ!&P8ov2T;Dv|Zr7tca%2R1^Bq6kaMbQ8W zKgE zM?;hvKSWnSJ1Cvq5^GGOXZq{QKWFPt;WE*YYK?KNH~w#0-)W9-y`1}B&2s@8@Yokn zO^yW{FxkSsSUw*=NN2LdA{KS6=Tbi{wZ9HFn2F+V8@GAP*iEfXjMu*F9gqWguSEA0)gt&t4Bx=kx?U?kRZ zuyA!7`>wXHV9=!)q4#x@fTtcuxPE8{O#LIaN;6DmLN8!|hnwS!2$bjiom{Ud*P5BU zThNET<&^TB=@9hI^ql}d!HYh^t9?%PQw~((nhNHB2&Oml&I-S0tW& znqp2@b+Uf3GhQm(bN%~FiM;Ni{1P{+_ZqC1&{-L5j?(>mVsot^ST*_vU1o#i{?v@~ zls<`92lKR!eG)H?K8Z({tpb6#H?8Y$&-aO) zW0RAjlzRcXTt1#5$%*vw$lx75C}u)WSRumPhjRtILT4O1AL;C#!_G|6g&ex>Ao z(1dJ>s+j~smJ3ZRFFUN4gz;#>Q%mryT~AnW3C04Uo5{0Vk;0QQ8iU_|f&tQ=-SQZ1 zrYU~Tv*}*DlrCl2q2-$Zxq>4r+j;1(oEeCVMr13AR^P1HVLB~|*4A`pyxqG|4=zr_ zMGfUbDUoue zqM=R0D71-6v0y23A)UuQ#=@HRQCL%4>J2Ov^fG?G4>TOwLw8)Wv;Wic=o`Jg+wul) z%b%>l@1Me}j>3QLjq(?c@`^RMk)f1jY{9QOwMuN?YSF&7 zN_7TM86BJ%m@~)0*qUlBR?Cv(o)`|Q2;+H0@9*1oJYGO@3uA(6lh(O+0`42lqhqX*BUa9r|p-ed3| zE%n?5|0cs}RN<0irv%_gIe0?C0nkK26mjEAJq0+#azH|?2#y_}@E`q-9Be|Sk4HDf zeI$RCCVwe?_y>YT`YRn&wD)yfR#{9%3l9?u)d^5U6yHw$ZYxbAkwGZ=%YIHbKrZJ?Sy4$0(;Qgf8*@2?g;ZIqqXWq9+m&faJd2<`vbQY3A%DHfbs}~#ab(lP(NLRPG+a2zmkDSZ(j3>fjp%3vN zX{=)lq}hUN+h2;24m@K8=9HW#0?9lWpIII|e z*LaKLw!Brn1-Q!1nz)A3_JrmSIHff-uB5}xLd z2YSABX^N#aCJwR6H43$sQ`WdyujCg;Gu?pw=$G(~59LL>gAzmtP3sGyi$7dI3{`qA z5SsV7_76&L{M3TYt=?rMvM+(R-?0#pkzD-}O|Ze+PrDCy;4*w$V(8vVFx@#6nZ8HI{Ds;WAJt@o;VqEn0pG{vd?sa&-WbBvK4H%S2skmlt9Vh1aFAjLQVpvVHB2 zW;wVVLv#RZ>0&--EuBkNn#WA2;+!4I-^HWD*YV_7%;+cq5!;=eial4Eo@?bB4t2f8 zwn@O*X~V5xcB}XVb36)8{PiUJ0gU~A15nU0CjQoLfk`<%WtkvPU4w3%ARU{_{sH$- zMEu%vdXC?;RCL+0BN=@0x>eKyHvRFB2#sGJ!Dk}ut%GykFEk7|`%GQPxtBguoUN?r z@o8V7R8mQwprqgyQ+i=@6*39_`PuzR!wt<>$Twq425XCa%-vP#e8-Rvb|=E|b^icY zs-ypPd_9f7h(-BCTgvg846k7vWvW`)HTsC+>r{G480XIAMq`P(N4ps$KB#k-b}iO2 zojbMP5GT%jJrFl*TSy$ewoKMmeFHV->T=;o`sIwFz>2WGn%jQ?t1f1xgZ*3m4JdK| z$X9p@6X?GN^w0VcXgZ3!V!}bAw)YR9w*K1d2htt2e}DS z+@#%!lbu6xt1Hyz8Q*+LoX2}ZqT3N_`xRuHyl9HB1V#|>4T)eWG+c^s>Ue0zVbV@-^45`xyGx%~jaky&$w6)&N1P5gDi1fQu1>`TWk3#wO~O~D zkII@D8I;(gj)m8pjH?msPG{MNEavn5W#e`0ijyTcS%nmznY=Vyjm$Woj=Hd&;4n1ICQPCh-eU z^bvMS+jRiR@9ob@eiX^zJneV;G0r=+wcKrf(QRL0#x_i>;5NL85LR;Nvg2g8@{Q4A zgpYFXtRPJ?;A=H`AA~+7G-1*$#&|nRy_@A=DOL=;n^oV=Ng#h8bu3@gq+U2C36|V* z3=Q=6en+lrIMVT*9_H7DP^6LT2|X8XnNNxgPkbs^qh0m3tF8`GH;I*47xuNocdF+> zbl>wBvV@cz!ohLUPwSfG`d(5m&rvIjCo7f3)RgdK*wd9GW2W+QrE(9 z&e?ZTuZ{OiPg7%TiW-v=pNQ*qHnf~?{PAqkpGqe}K!zTMOo3Ow>~;-80~#{=`U<<= z*QFq&_V*Jkv&UgH{^keZ{CUjzp=w+>G8~k4=IFOb9PD;X4zABhulQJU5c3F?75onk zCIkpF6chdiDTn_6MPO%OLKzoWm$R3ODcPaVu_cE^;ob702u}q#yexgJj;FQ-HYWA; z@QF!viWTQ&I^s7y#+@-B04+K%#-*|QU^%#~zsXdZ0}sh$iuKPZY>E}i=z z18_N3VH3%*sQTmDCwHmxb-rB^2Fv+9=!4JM*%6h6i2O5q6Q6Dh{qJ}F1} z>Wx-4H-3T?Af?*Iq9QyF$5V24P84PhJX{k!u!$$mhecfNVI~asTFH)*!;Y97U4-dp z?8!~3xkGP?f8Ge{tGh+KBXuaaM6th<3KMrTRf*RAUih|_gI5Efw-r(tg-wS;!BmGy zVCTK&OjN5GBVY?ZXrYEDMvCku8`V3lWXSdNmtHJ~;A(whpsB#o@?=~cI#pLY`a@ig z^@tX2bhJD%ghaK!Og4FQ17(X$9;tF-LW81*6M;0#)&wT72b?D!gsJCP@4KGn0Dsxp zCeIb3Qg!+}saSUB>S4gH&}GAqnxOBwb)|u9L~CNrD^vB3S@n!e%fR|F~@DwLB z)o*4{dhLA>0^Bn1D9qEqbXyY_dI_GJn=)?CQN{m*_c9%ecm5zEui!u)x2Ke`l|#i4 z#0ITH=Oy))b3olJbkQh*Zrfu*BfSi2We(bzNA+vx!$?^>Jte9;ZhL(dpX!69!2t6#fz5 zxu-22wwyYFi%)v&YF_+a6#b+%(JjU$Uq2_Njajdiv@ehA15fHuCtKB__o4yB172zx z#+dfJxGyssCBKY{i=-g>$B5akv=3Ny)rw!UhUiu89g z(ko7CAJTu7k$z)#dU-wCpONm$POnA!tr_XhWT$r`{i=-g>g@Dc@1gyt$8ROl53V_F z`;H@h+nUqjKW!!2pOJnN{gxp8R~hLyWTziO`Xd?X<4>Z``)Geg`h@KCc}Tx1BmLU! z^wmfol97HAqaH%~!PV*XvXkmxh4yEppTvKDq`#YyJ~2DJ1?j)aNWUpN-TndEpOHQ_ zJADSyZ_P-bot^$B(yv;5+V&N%M*B0;Pv#G#AN=67->*dawv6Y}xQEsem<5%lBm}xB^CQIyVR^`7-TBgu%#Xa?^vu)bULtI4|c~4Ab8#`vbQZjBmpUtb# zTKOS8A__uAiRNke;zRnPwl)>p;SzO1(SQmB?y%G zTwipr#1nc2B`VIY#K@VoYGpylY4_g6 zFo(0t^Pv3RBR0oayn1fI4UC-V3n*5ue>@+j0#2=D0$1W~rdNO2IFsj1D)W!jM6+i( z743Ol=?-kTgq=llT-2_tcg5S4h-So#nuk2l-)hfKRQop|a8xxE%JpO?n zTS)Df zHta!JpY7-Ds&KelpSYdz+^puRMYYjN3H{F}oNzm9HOB=j%>jK>_iFF+kxHrTb`dA3 zY^EG+Gl|2K*nv{LJDaU=ylg_TPrj*&$Y9@>OkDgmxWApNx?2?UIvAwX1~dP(Gw!}l z)z?~!Lml2u)qVx6z)E~ccCx#}v0Ywt8{QB-WM}m1rxe6L83uzOpTJ5h;!@yD$#E)* z`cU;>LPT&hdJ~Rga`2dm*UFO4u7I=CTI%a~@&(n|?r^rs!8d`oyFoGI0zcXACEDu* z@jq^UP!3&!HTTCY56Phm_{n;y9KzxkA4oQ=-4lXLifd)u^a6URGiJK9Tyb^~p{OO{ zYKi*4!K}Jg2DF^$BRSZ@GAOJs5161~x;o*?&bc!FQ9YWuGDUK-kNcpw@ySD?PYXVI z8=0^vY71Tbt9C-%_T4$ky;XkTJ| za~q#eC7vv4*tkA57H1G|s=S8lwyT2?=+0H3_ET^tNIyhEn5_Rb8r{k^_M-pB{)4!M zRnn#}^ENwM#7`G9>xh}PB|B7K7vIP2a(FxCMR22|d`!057u3CoG~w*Pd7~mpscA=u z5jnVpK8-#uDZZ7F8>FynJ$A6c`(>BP!53kHx>jS``*BOki<0VV*HojqdlJLz(>Z^7=0G4#HI;cSpcJi0|BBJh)q60lBFXDnMSu$CZ8U z(dl`8>+B>y*_nlKCs{&y*2&qhbNM@~yy$FPlX164J?7)<1|tu>vqxp{Bw-buDxFYV z9qWc8&B}wQ1If6e#szG#ii&6C9bb2jQGoD;w9+Kx`A7moO1!yT*p^Fl_=P(BIUOF> z;TP-hc?=hRK`;Lv*07l!eNK< znq#IryPB=bTm+~_)ifJh->z=9zFkLe`^X3zU2#^cwN= zQkxvaT`_hCAIhVr8>yX&uR}Y=X97s}s@CV1TIC=lhsgC&A9C4$rMTL)O}rdR?R)!H zv`<8F@zMKx_wsvxtoHBF$G+%VtqA_RmK0Z}9fW(vt$PFShVL%VsCDlb>x|Dnf$zjM zJ0A_iaW;cPw0~gFn3+)wY={otE>nG-QR^B*5Iyxv2%^m-72ywevm&vVGM*Q;?fQxC zHN}~lW&Vb@rZt>u~8(&@6+LT>F^CY{3ab@RnAJls>7{*`M(~qmdTAafQvR;v(VPNb z2Jk03cv%WO9N@h=_%{aFd!4e4dWW@5F{(9RuV`UTY8<25`%+(AO#B?3CGmi5N`0+W zr(;N81>VoE6vYfcG46JpdHC)!G2XWvW2PbDAzIm=K27+A6J6~kYp2rj`<5)@RFQP5Zv z^x#_pxi|C<9-kIt4~V4TGkVf>l*ISnb@&_|K2?X8>hQ~Tf5CU@@bBvI;fAAO7KJN$ z{ZCJNUswNs%2Znks(tkrk@Pz~=^<|0O0=y_PYUQs9>#ek>UvL4x?fM4r{nOl4mW%o z1ayAHSM@RxP?^*Y?}ZSW@@evuA0d>gFM;j#{I(BT_& z_>n&gxZ&Givku>-!wugC|Ip#h3>Ur)cIvQq1&nOkuyVlSI&6-B zT>@A_hutG!d}i13JpsE(;1jCE5t$u4G|bxgBQRdlap}A^wZ;yonbgwhXx9@w*nfMyDL(`7jpLy9dO;_GyKjF z3b?X0&}c4cOAMGRE)0=C^0{U%*IX5aNt$cbAor%Xysmv()U z@3a_sL9zy&WUq7j z*6idpUie24LSN}IT<~-D#PXRLHe-!V_1e{;NHDx;ZZ~{->Vc&A9N3>k9}b2(Symd! zBdXbnWPEJr1XTy8@9;3`zpgkn*aQj0k%PYxa`C_Y$|S-(h!hdnD*oQD*cvBoIbO(3 z>x_?pYTc~#u%OassqQySdPtk21c{d8>f>eJe@1RI!`~>Wr8B&(jy})k$Zg3KU|lSi z>B`j+T^GM0h6XmKqPHcLR>yWvA^ z@tq*gygvu90oS~7A+GF7CBODZQ|cnX9HgvSjnatXkv}pk zjL1wJiTTrViC7gCmyiZiTi<>eLvE&;hre#PwQ-wUCn=c=_AP*)1V zeTP>P1RrtBv^^&n-<23Qi7jLYh5Q$z!LKnM=0MK?c_Ew{CW}MUMrB`b83zs_ITc@o zitRA>muoMcI7P-^F^U%mQC)mB<<p?i7~wmj_>0{x_bB7`p4V zEuuc7>$u@-orIOP7x9JH9tRUD~!da-{t7sqP-5; z;SJJc5LyA?UI1%TMS(NczDlsfyP`WgVBw#GgANjw@ zlKiOYAmswI_#3ZWw1$%2X?p+9o&<&lN3=A??IceEJ-KplFpjYFkbPP}57B9d1HEQ> zVOI{;@vMOczp{z=LUFgw|CIT`)uA}squ$mOOJKziSaikr9%ath4SVq>Iq0JLSHet# zT-%_yTHtYgePFk&)GQ&DNO3kab7PpCp?UgK$>EY@vvZlCF-xi1q-#mQw52KYkX?uPpLJDzouX|hEYo5?UP{iH}Mi+ zBhxTql7y1VXEw^y9!`qbIhlFsFGqYl8BTR+72g6!ITsu7@@)9vZ-EmoT5sPea6kRg zKFfkzQ}u4r;V%F#`iobhxDSDgwiH(Wx2J>hTKM$os9wAOh39Q|SkIBnxg%;s5Zd z4{g6TNYbeeuJot$nqW%WbnadF)AfJqme+I2msQ%Ku< zc7qY*^+ae;zNfL22W5TjUm;Tmb6z3TL(o9ht_HZZN6Z)ATFCWROu7u$b|2B_5kIP2 z2RNn)?Lz@y>%vPj4wcvPEUg8P;Movle{a+ZlwN(>>dBC5IQGj@4O4FPj>CatB-PfK z45_9aCwv;ewg$eC1AV#jb1e8Z3$<Z{Z#8!;~HLIO2Q_ z+#-iQ1caxnMtZ7UX49sCf_EGY9FydQ=#a+FoJ-5WStazctU$ZC2i@i=T>E!atKxf} zIp^bPcdDv~@!Ele`wt@=%R!o|;KsJYM-EF-ER$mFw-pXhP|= zSlk7Xv%@usz^8fdO51jaYYs+S2lHKtaDF*u?-x4k-743&B({;F(i+%cXO&N0+aT9p zmsqw6krLD3v>mFfSGGV6>x$UIuI)l0F%k|SFdF@20vC|f{7ews?X`aY{Nv(6=k4}}$ ziQj_Hx&D}PH1O&1e*44ue0)1&ouWwDMrM_>E9&b?3)%DVxLDKKnx4 z{mb)=^7qP~tCXYILUDG*f7!>?*;LLnXGfX}_%b(5s#*hyI}9WO4ZuL!Hg~;$-iQ+e zJ=R2p(i)vU;)HTEK3ufoZ7NnG^`Z;SC_bfxXwlixX%>R{=bcRjG*U)N?UUC|OX{hG zBdD-VjH4VxQBZsHWatSbT~&&(KuPMca&Ku8373g%2yuMU-u zt;`HxqO=@oB}tI)Xq_V~yOhR*ucgLHbV^d$g-d)xk|qNfzu`sRyEJU%OW2;j0)<7d zroYrEbX}8DSBAIBLM1dV$!8AW1wMZ6i^x75*?G$rx~GDfp$;D_x7w*?&+AQZu4Eft zozPGrqOf62TYbceg`Z#Gu~b=u>s8HsOJ*d#2#rb_I^xLG)8y3C^wiT-{fW4!Gz3iL z;N?R}l-6G%SV@fn>(E9|!Tc}S>g0F1{_2wGjfee5AC?!ukXE@I>Vp|}(|f5Rola)?~NFZUSxxSLJHRpg)uo$9!L|V&{5Ln7= zWgi-_61n?<=VOJuW?Ql`#@$5Sh@62=vl8NtS;Hr5*PzFhZsjE$Bd9GKBiF6By@dQ_ z*UNPc{Tdy0f^WVUY%)d6VtbS({#=^RBG$aJi{)T3e00BrBC%U~9=##*!a)39F9&mx zDyrftz;!DaMdI&;#QN~OHMSoN&0@yVqO4)`Vk)BvA<6uwG><+~3%+TV7i=7w;+rR^ z&HtWn5PVzo9&}wtx2GP(DSaw)4B8{DVBU#NH+YGWlvY&nU*;X`lnQe5x=pYPmb%V- z^hN|SkXHrk*A;U^qEjR#3X&>+AKg6DXhU#tstwSa|9u-8>WnsAcOt6|b&Nt=ivOAG zMVqE`o2I7PH1*^*;gYB5V$XoX+&0n=&qtqKr8gytzY|jpNcF)BgHrhS9zPTOO)31J zIIiR0H2Q$@QAQuseOn)>byJP@or1p-)9y<5iVeMTAc^KoL!t52;lr@GEBck?SZvB)r%INe#t&SDq)5@W^MO2+N zXrq%`{YU%B3;#Zh3HVI8RRD9P7bs&*QdN*?x-L zVa&)Hq<6+qpMAMcu%weIJC`C5Z{-NJZWNXN zD)Ry+jxUCwza}%hBFS11X`f0j<(g(!qx?R(VE$3`tGuunH?}A(&}1gHWn(;B zX!Z;>Q9k6Bi`iUuv1el0-JS_T3Yq1gcYxStuBE=$S&8>l@{=jnD!_Y$(#sx~LvV60s3rPa zyAQYSU*fJWDvnE3C#!+lp>LSFJXv?Eb@(D|7E(@(yFQ8VU3mz(8n8i8QfZ2mON7gF zjTK_p%`um>WwQ6V#BpV#NvrM25ckUY0|`1$4&j=M_FM2mV2{~R2Z1X;W$O=xF*4ZS zJ4z1Dk#TjGvic8Y&KGlf*^mo8g!3ssIV2{w(`rj;UhYoIsT;pJlRlpwHToQ}b~EJi z>2>W>^`-mL9Ya&I99n*m5so1u0;?0F8x__rfF+|ZFSv4K3e(pPoe8FIJZ)e)N?`hq z&?*9qpUF@v0?Yy?1J3|+q$wp%kLW1>@FbL_GeG&F^HV7AKX@i6A5jgIy$ApEDBpPC z-=qBIc`1~yJ0p~ZDo4qfNB`$^DOw}$yBGbu1aady-}jLT0gErJP(Sz)q} zbaQWcptVpH7Xzc1BucCD3*?|1F?cy&AZ~u3p)fjKDu_hc=4ed}QVRm{LI)R23Lb9k zGjSgMGR#?wNkRW07QNl9w2tl;6*A?fG3CmOQk1hEI0MQlbsZ#z!qJ`dH{PcRDyj^O zFi;N8+Rqey@&6A+Z=gShpbQ+ z3|>L(>i-0<%+zrX%Arb{BD8Z4oun~i9te#>(#AvCEiB)c%+UV-RXbOomDc~e&!nAK zgj4$ezW+=+GZA0-^}p|$qa#u%&)Ih-DEk%~C?EU!KaX)x%43NLfFv@I^Sp&Tt1(7(2$HcsW~EK z5i@k=#^q4=@M@Jd?JLk(^w>GkNhiiIQH1In%N-c5mKu9(;c9cLFK~g#=nE?~bC^x6 zr7%vcAx~5ob*!c6>e=qR6mPwiI1}Dl5ip2yRYEr-iMOOW!N!T_jfUl?8rG|&o7*o1 z?aF`_3SC*utAV)X-?sEvPP(PUbwRbzWLi5KeDJrG^-Y2Pb=I3S+=S%taR@A)SBX+Uub8-J#*$8-1ANRUoEm;hTt5jd&nMbc;iAV1bk6o^B5d9Fb=9c;7&<~EKS|A4(lU6(bC{||W zXRP#$b0eeBfmcOuvM9VJK?Gn75|uhFy`P^6Eg$z8v^?5{nL`fkg@bs*z?t)oF5Mc( z@GuH!7Mj^(Vx-BzTEbzMXnTks@a4)FRyi-t6khVq@oS_-oUO_F`J%PGT8+8g*p&?r-a-FprmJ=3@L4 z{Z@7f%{Dlj$2<^dNiD|xfq;==V(Sw9mD(X4EZ1)mE5s3dewekx2>%UeSMX~3&*;ku zyqNxO$;LoW(qnm`C10-R>Z4UsYhtmXdP%CjUTREivuWlTQ>r{}D{0W~+YNJ36b}XM zVtx(_ZY#Hi?Pj538*D(DDzhVc5D)T#?ZinsPyE;JGvSH*9yfU6^Uuy)Q%$L+4+7UI zlK&_I&r?_VkJ3DG7d>cC&>xJ3`x6`j`*AsRHwM&w$fOJ8VCYzC>3YGV$1()gMmtvS z&H9$~+CrQW$#*o#Avk9h3Prgbs>VP|NiIt)Z@@{COVTDDGuS6)8YzU=DjMCUk_N-6 zyDcO3z#POL*b1lae>&U*ukL^HelqwXa#-av0XT*p?IM$2 zc?lO5#g?e*>MD&2)*9H~WQs`P5RP_4Z^rh!Aq)mX7_1S(AWvintU*a8&j9}#yv`sC zkMI*OHFB^DgQYvz;JI6XE~W8Lpvd>B8|ZnJ$>|L|WQdnw`p?Bohez$iF31Rs|4EKsIrwMpGwwMa zY!SZWG`SzRuywNF8~?oFP$IBhEmqgVxrzVvKT5cUZYKQRuHkE){-fi?v48*3336~6 z6Xh~FG`}z1nzQn8uG!sXyg$YKs80y_NWr?gT)#15AIP^?zMu?7=4&K&y%~;yVe5Os zPfxg);N^*!z)6?jO^MtoH%11A^BpU6HHpoGn0ZL7LbAjv%-PcOfB%UunOGzex@MD3 zmj|70`zHq0o{5o(ypNVOhY68rHHVuFrs~0otxSeuIjkKxo>@U)wxP?C@+_p&JAb;<8&jli* z=cclpIRnt4&*>f7rqd;{(SKcy_kW2GW5J;U`|D~v;~0CVj(eU};67g99z2#sK&r;u zs&X}n^?a$~a$F`t8dUfkFZA=hefk~K%f)56eI7u&b!e3i{a=P2(xFpy=z50s=+J38 z^v?`Eu0wCrq0ckaloZezI&{8=uaG?#8m1@wSS08J_s9H^RZqKL|7a>hZ94Qp9eNEz z?K;$>Lq{4F4A&DLGb+GpY+T}x3X+h$XtPPI(yC&WHsq(7)9BE^z^uoQx>Hy>pI3zjL2!9bnIkTBFTSVsT0&5O& z=KMh4NY534zJ8uDfi*o0a%6n}vy;9LbdDt1H(c4T91!CoYdi+l9On}3(dyPfPd|CV zZ%wd!(H|!7b?Q(qc03h3-ICpe+r@dMb2#yW?8HDP+)YmRuR-sbJR_MDfpL^^mHDKM zW@;HV!^-tJ(i!hFe`|H8Z-$La$f&B|Zkd#8)ZE(`fTN+)HM z1o8zZBR@7fGz(4XjadixoayEUT&aPRY!+6DQKot$L;7qwLfn$6;HnV4w; zYcSMlB72BsCHNJE2B+$m$&GVo*ZqQI+oTh^Om47Xy7?BFEC+W{QeO)(MaCex#*!_Y zvoI2Y(03gc^?_KZZ_6wK#&l^R382_OiN8C`qz_2V5He={s~7N9U-nn=0D#kUV1W*N z5I{|DuFNA@4&K8rqEmyn9TUqeH!_fU zUk*;>7pr)=nqO?<U*6`39z(Sdx)iN#FSCKQhbnq`tck<)zk^W;_UW4GiUQcFA>!0~=`Q zr&W9eJE|zPj#=~%ypKq|+y9YS$nXb^1@QcjpctLGZKK54`hOp0o%U)1m7JBT$imNMH-9KQz3|UmQXi_V#k38J~WkW+NbG5cr10cAOyh_$*TP|Yw6JU zGed)#MTD67r@$Vw_T&Lj$eto=`8K?toqE55-_J?CkL34rQ||@zz6yuL14kvV`JH@K zUrEFYuFieppbRh9B<|8pdEi-3n_Q|c3Ni1^5#)w~D5j)Mwq+Qk5%kXMhBS-AEts_>20kfZMv@T_{fRuN)ZN z6f+GAPm`#L;b~^ErW2lQL7(wrPI$64IxR=ps;|8@VOyadSw;v4(Q<||2e*-&uT4>zv&4=5t2-?)UaOZOU%?+C6Az?BoFBmSE$ zY^e`Yt$b%g|CsN#r=QiKj6j=r&&s7#Lt?SGn-SPMLUk8JDvAP~TA;-rt|%f|DN4pI zY^N<=DoW4OOV7MB@-z53xuZZWP$y&6($yLD6w84xx)pDSae9B(!8cS_S7c&Qpv4yG z>T$(=#|?E|Wa=in4QOm&Wt&$DLZ$w=7C}ErBL8M2fS;;p~(bN@l+O;h$V2`F)fzcq=%o$;>B4HTIHHS2$d0B)x81FX894#;TLj zlZKEi(F!wtV-7S~<+bIabSgOnXOV$DRw9$6 zwd1+Ts@=$QWnw^W`2;aPO=W7d`uXmLrWW{kRme43pD5It7g`I3!OdRMrYp% zrt{&7B9b;wLXX@*5XHGuy9X)G%?{^I&u}7LW2bN{*`Zu5AvV#Ml>9)>@w$noA(UnI zfR*%Z(&#AFwKHn{+j)>;o!#-hKQft8Lu9kk0ta|Us3&ll3f|3J9ife$b<|5+zo7KQ z3p_q;Gzd3p%JGc*l9#B?0y1R+Jei!K~i7^v=@YNfHGl85;Lkh+>VOSp%K>XymwU1WtKl zv>Raz*oP_&E7fU__uoVu(o-OU){#Uj!fm(;Tuv)cTH}q-hkJG24mR~X*Rs#mdrYRV^}NdY z#{{b)#5r!e%__t_p-m~Hhq5lZhjHE*?nwM?na#jXv;d03zrP;W?%ye$CzNW$Ju*nex3rfD1D} zSweuq%uk*pfF<*j*9dT+CgYQp1o*Tj!==zpR zv+rQ%e;lts^(|Ap?W*?$_<;CWty$XmnOSu%X|@)0R>G0VF!3{7{0za5#l13O4zyST zox8*4iOMF2Yx$gw2;$@3OqIdrn~uW`uAmaV1HDrdmOfNon#Bx5xY)#*1&22%Ki!`) zTD)Op1vGrsWmBR*<1d1w1}wt%qv|c-jJ0_7g{32kZ?Vc2gChKGxHmM1?x%+wX5;3N zN7pTyLqAGA%`l#vtHHboxhZAdRaCvU8^vBc-*OXGvbb*ARq!(x3?=2zx*^QYrOw52@B>^?@!B!2ma*@X#gj`zXt^BxY&Z`}ha1^O zU=73MU&%6E4h4~Sg`mn}Pl>t)pE!J!6Ap~TMu5XbuMeFAGAx$s^NeqUlj&P!7yOAj zTa{zl1kkSzEryw11+ly0M_h1t&M;LhwXOl>RL08@n{8L?Ky;;UuE8Fc@(KyN3{`7h zQ@zhYT-$S1-%`b%rC-~eXK8^PnkYeR z=gPsC3H36w9P9(Re1&Qr@_rY2y@l#*D_kJ^3Y6=p5OtPKtplPCMoA8y2hur%W1KdN zbFq@Ex(d}ns&l!cb+%b)h3A$9Z=3Yc7as_owjJ4}_()O&$B?9U(?nCKcpG@qS*jN1 z&hG^q%fY(}nE$2b`PU1;6aao)^S%ZoIuZGNG1)l zOth)PIeAGsc|kvLj;}@WZMM*uDyURC2wmTD$96(@yJMHU@DY&T+d$NN`Z<6b)t&N=)N8=-Bhg%!s7B~f{ugcBA+}^X4 zruKlhT?+WxO>*dbP{i39GYtytGsBOKdxPqE@lf>f$q}dV4p>u)uUW_Lm+MsXjW2$95t=8J5^VEpwXNjv}z5Z zXOY+5%D2j`W~mWwzmIA6V>Qav9_bg3BD4uHd!$^_%`oTc@-fcM(dp%6XF(8*?r^lq zPpuvb##-(0Zk}_8>fPMPP;jQVH&MT;*}M!iTqOgL3t6 zRNrc4-fygOeI3x0*D{9eP{2Ziv+6gt=BnRt9MtIJR%+I>$G9zgx1X4`Ju*1VAEK$> zmxM8v8U-!dQ?zhxCN@y)FA~ue z&x@xaf$H0!RJ}~f*kbyz3nDy?dx!2Ie2n-88j{rG<(b6uU|K5PlPOH!8Il&J&ktc? z8mWaqR9DOr`Q@ModBoLli00eyO7QyJzD@FTO@{n@u3=mg3FKau{V+b);qh^H4Q^da zC|FpsZBVOL9_L=#piW=aqqtXtrCl3T`}>M(vt!f4w?rR5O5a4Qez#ZI+W09+nw8QP zwPu<0p~baSaW^D#F}KhFDo}>0(~c`c)M-7+prorIdix2)-J@~wwKb5i(&$j#BpNo) zZX@j-ORUoo28%|T>&@9`N2IdB@o%P8Hc?etIjY4q}O81e2*T*bw(4`>{OoxlOoFI&+>Gt##TX2-MX1FNGp-1*T zl+l{oaCt8}%Rt{DGy4AP^Qot?lYSN>-{PNJWRk-hdZ>UrK!j7XuKwwImiAyE+R+2J zFDFiSFohQNWH<2L!RZFxTad|&>3Mu2$jB-N^X8|RA}D{obSg83E(2D-I040TiZF1!E2Gv$$|lvd8os$~BPs$7R>#&yzEO4wzL5mqe0G?{m0WLA znn>{J=55qY|ML~HTYQu>$86Zt-B=g%wT2}akMK(po+c@~sF>fPn3U*53vV_D8p*D1 zm)BNXSX2ahO!A_C5?4w z!(?EjAh0Lb-%EtaVw4jT z?#hxwzdQt5wpUZ9GVkP}J?^FI)#mwqq6t4ES!{7GLl}^8^OFL0hvDVQbMZS8L|(sA zmihAYO(hKuAKrP`$-izG*Xqp`s*?)$=fveti8XEq+0Ng`SZCo#BFB3%^{^uGG^YSE*8*&ToYDryw(V_b_Bm*3I&1kDlt01rMwuy7!}*ZWPLJBZ@cOLF}%mCe+M zRT^&{B!_;@f{mx#28HibCN97l8)cqqmgM^BxspDT3x}7FE0pEXz4S%W)$ZM)a(30_ zmt2dbErB&mO%acSW`2ir^PHjL+zr`c#z1zje&kSk9BbHOBdWtMQhjc;FeD71mC{F% z+(4(Lj9BTRd=XQ32>dUQ!fYKjL6H70JQKa3SO;Zr)Y3FZ+2_-|pG%B&M6SO^@vffl z6YLSp&tv|=81=QnSZP(*_{w4joasJ|Hup8le{SEM|5lsByz>7|pF2s1X|8%vto&5H zXee!hm9^>LWDH~Co%9eskdwtb6OL!|PR7jCj4{W@4|#(4V?Sd?NLh9d9>I19Q^-47 zS7wJ(Lz$CTDZSs`!AVlCcER&IYtEPPZA8Y@2~6FK9d!az*o`W4yu(G9{^}TZlo(U5 zP4OS89Oa)7_ZA=ZebUT7R)4 zBryDgHB%f0_xBpw3>FGpi?M)soBeQ8x%a!Nu{UCXftwg|{xT_F4qiy;1=}7?XEUd> z)roAlInwt{sugl*1#1N?9v8lh=WnOG7U(-I*Z!toifjMh*&t`Yv&PcE1^d`n;5ZT} zhyV`_s*OODVyD-#VRGm_`h7>D;$cpxHLY^}4N__qJ6dIdqp)C`XSILaP&pK#%!yUC zC2ff<1|Jc39KlUTo=<~_p_y8IkQd^7kIq$n@~@l3Dvm>FFm)uWNs~v8I{tu!;qwhp z$EV~1Ce}099eMDFhxBENvFT+BrKTN|pKmGI&{(U;Q)`}6>=w0%S9Lk4G98n!xKDw`x;mvk9*0e~!Vj_q! zq}_`kjTag|N`)d8M_ z;El`MO2)0cpp%-9gYKk-OfoCIfhPEqD;q*=V;05^A}GPw`7!)YXmUlFi!AZuWsm-wi(`zW<+t;Et->v8U4C849;uiqUShH3v}scg zp_!Ytujy+!RK<0+#!RM|WYT)~am|t8+1i!%61Om@h&3PX>yifT-96djFeTjH<2A^| zP&vIGuD2-yC4cUrt( zq)$XcQ)2$xg}l-WtkUAg-WGWwP1$_M;|KL{a!hxD3!Lr<5ud{KazCF+AA7=TaFz3?-M+ZW4VL0 zYT~xYZ5HO`2XJ(~m(rhti_%_FXD9Nm7ktpQmuyT7A?=;)9$!IZ`oNsvbeq|mJF(Q& zJ}>TYwd0g=wbjughX#m!wU{(W)AkCn`ExENy_?9^O&%Dqi>y~A=NlYdBdL4*5Dp_* zh*1yFQ=|gw1WwU)9m4kwu*2*NBGS?VIrxYb%clFn5*R|3>$gr)eEz7lPH1Z{V1=@Q z7*T3gy-Vn2g(s8ul$b$Zgspj5M0T>&@Cquy}?^Lt<0oE9S11s{2hivXuUuOk$(i0(JCw zzt(WBuni1N)wMEWollCYb|+Dl?BKK!j6;%<5oG#$ZzHo;)2tZCRQ?nwYh*X!I8k8D z3^7QiX~KocWZVS(7}v>!5m8^A)Q0TK?oRAeUk)SSAkgiAWEU&F^%Y6&#>3o5(tEW^ zmIU;er(HlLMsCcZ!3Oqf{LJDw@I+Dicz9KTIW@}U&8E+WyQNeU4z%C^@OpF`g&!0GwEpKr)EUo z6X7@BJdS&j$ey`^_y-FOJMRXq9^*ACDxa9t9A9R=zOpw(f?w~=N~uYw+_E<Dox56uE4c)>S^WuS(@4H{WACZ$ zKMi`jCY}yGc6@dUdW*~gy|)ge80%*6vyd6?u4sh>C%srxX}}UYnYBC-8yc>)JUYz^ zL{gkF`$s1++|R+yC*yhTY4N-+g=gXo<)F%PL}Am4j1azUik%^ja|i9Yk<>gXrutS& z&C16FCV{8>{f|~y6c%1WJAU{!R;b(6K}z8Z>M&(GDb&O1ugy@V+wDT)iDj`w!%5A+ z4Lt3u6ImlI+(oZ7yw+dzEGyj4lELe0kk>l>EGaCcHDihUc^jE>Dr2MA7e?>2YOiYI zH0({V{Vkg5a})_T$nDUS-$dx7jfu0!_8*vYq)l;?*mgIB+TQWs7X>LP0G z;I31!ngpyaJ$?%Oa=?e4$ntCLwBZz$tAG%|8313g;-kMK6eh}L6=%5dh=+F*5uqe&}IPFr4;_PsA%-gN>N*~jND2FeCc8>M>4quMy z>lnRDt;VH<5uxN0g=%iZRMwxYB+66Pk2EXJ+XWuL0ffWVMP%syMKXyqS6F?VPvFv; z4&OXVlf1J@{a=Kbi={Q4a`bbsz4d$r4Bsg~g9}+o(-?$&*cmN4OONe1ilC0|Ph3Na z0Bd+wi7F(!*yR0gC6)=in^kXDLaxQe8zuV7a!uac%9|Y9pZp5@S~abskJW~fb8`p@ z?7|$CzWe5~^Tjv)^hzgUuXe{vKVg1Q{@$mbR6&rg0482&YflWhsZuKf zEq5K+rTw#y_W~x}p!G}gc?D9MJiq4V)@n+h@L6vgT#B82Y> zYH-AQ7HK4)m;%d&v?(l+TFrW6Wp<2g`0iFZ#vpd9En+n%HsXw5o7O@V)gqW~K96=w z>N`YZh~6NnHC>5;Se+@e5D*8-CNhn*kD(cK$1m*=Ee%!C`v*`-IX(d)!j*~z<3R+6 zciML;WgT0d$rHx;$5VKncv`I)p?Zr{-zddbl*#vsw?L_}8ytV#sbysFJ;sQehRG@1 zZ+xCSp5@Pc9>;1cJmq{6bx46XPx#}$FX~(UKGqoyz8-On2z)9vewq_;b_6&qop4aQG$t87{t|+ee+NAyd#tjq&pX8|LXgu?g&a zjccMA<4o%!91%UIh3p#~mUb_T7haEvR&_7)%tp{&S3%SohRb%2^;UQ~oLsAMf*vu3 zLk)AsA^5VdtE5eFE~f$zL-p5+b(?B^Ua8t;kGP($#pQ$muXjkg5J(V ze3_(Olw`Sddth%d)&jTd1O|1#pQ6sx3{0kq@ND`))p!x%aio>0Q=I8r-!5XjISz^d zZIS+!k=(HJV6|L-RDLgbeZ$3-rpCBA&?%L)`Hx;fc3`xSm|(A5?>wmVj&Aba9^B}; zRjG+5a%a}kqf@PkQyBy>irGrV3{Drrg{)V0&HoZh2vUz)v$wzXr6t!?niMCOI=ad8 z9u-1gnKCNh==U9@4;#rka_uDzpkIq>4K2Y*+a9wgFVJK0$VyW>bimA7s@YO`Sd?M) zj3x!!c=2|LHJ@~xfvi{r>5QJYR)NHcr92<-`C_|DL#L=Xe)a?ep-6iB;XG&$O$6(k zGh#S#@x+g>A=h4PM0bP^d(T?g$*sg}BRXDM0 zJ|$b*oI8w)z9I#{SF7nOnqNmYn{fW0CWU6x9%|J}ruJWFrs=?qjFn91UZO&y1oEu6{IqdJw)c(oC2%ADjOw$vz?ehr@zVKDjMue(q#keW^Rca7MuP&)5b$886 z(3FQePgBnU`CCg4BgA4&ms-<7W4`cRj+jWSG4^tksl3|Jhx}bJlPQs>hoMRd&YgOk zMfAtz+{m5y&^BHu{T3@X)p9K&Z*@fml^iDR?wXmk{@zm0ca@eze`-4xUp%C;mm}sw zskd8c8ofzrbbR!PS@|eBQHtCwDUHE4@8)RLb-5_}g|mTk2M7D@ikOueQe-;HO6A}) z7O|zX5LYyvT|Cy?JT|@DLrUWqqSG!?1V}CKEp>Kz@?v>2Dxmz3Al2!2xr4v;kE8M~ zrgB68^2=aTeUh-%R!4G!4W5BzmwUg7<<8(Y?}2q5YF=Uh)NDTQh4sQ%u1U=^Sn;!Q zrmXmZe(_si5x;gFZqwhMLrr@v zH6zYRv|4@7a_& zVN?72%LdKx=EqDk%BR5Z_SaM#UU0-EKd}_NCOC~~*r?URYT}jV*I8RRn zc={6!)gk_}EA_ItwO{N$vd)wsDRfKn}JZaK()3;5+%$QnStU3#b zCq_2wAsaCWXB3YRQ*j|ULOO{fIG3}XR|XOHyEr~@9C%_B+y7idp<2mfbpR#YuE%hH z_8KgpwT2FR`m63%eD>rujD#ws&YNTGU~#C4kDYZu3%K(dUXMkk0bi?$J|+Z-4=V^B zXh{Zqn@yf|ut%wi%LFX(R&B`+KAMl+6z0EB8})aTf>p&(Gl8`aaLICqhei2&W6=)A_RX=30Y@Gq-S(wS zd+HJvwwR-?DA|!1SX(y1bM?3;?=_Xg{FU-r(y*xs>#2Zn6TO{BZ((;={2c;BsKFoPJE@zGSQ+k>nsI0+jq5!ER{|b(|1;GEv`i%9;)I@_v;G69vuH&gbyh z>}=pU-n$v|5+e#x;I?nw6ZlMu)^yNVut&Ymae(4AC=M}SRp$t{xe96Q#BoMRi9u$~ z4ERP$o*}BwrcSC--6MI%Dl1M-BZ?NA(+S1t1f@IUY&#_oBOblVAQ_uRGiy`LuxU7h zP#aHPNrb07UHVmI9+2(=e7xZ*aPgy;#&;l39dalIBo|~pDy%xMXojy;>b6UoO@%}} z?fXeC!-iPe(dZH6pUU&B655QHXe<4Vdx2B4TE`%&=I2+zsI;h@`ou3|!3p@1dj@(5 zjRgI}=dQ$uWC8H29K2Vr&gjQMgagLSyeq}%!$q}Np6RAYUfBT8;j)pQ17-a@Uq@FQ zMaA8iG)H=h{k{D>=PRL3z4@2xeLjlI@YqNeCcZ3Bw5iU*z&Mj9C(vL`93JB={6Fly z4SZcyl{b7^0<ADVqfJQqB)v^PprN5@C<-;)+Nxs5=zusg&OD=|qoX(~mVzy4)dC&q0HYNGK`VAl}EvKlZormak ztddP?sm{eY%-bkZ!FeKSf%0l8o+AK^k*<%h1oQViMxbdVxewlGfS$SL@xqCd?8om} z!LhxbZ+9;3Lswt-hL#0Kp2wBBl`UXTm^5p#NJ;wR-#X90O-+2qx4vH~GI!^mJ1!mV zT&0u(Gh~rJxp8hOvRvPlg!3wR^K>o`?_-SV(zqJ!0xRslK)p!G${bHyo_d!B24TY8||B8G_4oa195WDAVQjClb5I znp7i2T1G3Drk1Tj&tewPf@NG(#J3Rh8#@{6;1G)%qkKxKuXCbZED@UCgdfYJDIj`Zhp}Ei_ z)9{}C;-}dRz|E`lYVG6n<)P;)&gz=2B%;x6^C<1acXzv)5=(P<{QbXSzfYg>PEdLI z7CGN7vqx8>QLh=j5qZuVtNaGH&DMpusw_|IC-w*G zxNY9flXqTt;;iX~H;p=#J5Sts?&x*1Y0zFg{&9;)lmQW}{zU1xZ%tL!iSR{moSGji z!x#@}9x@$scJ3MYp1{=zSMYhzy5pL-Bc({?#OKBv2|aNG)PKIjl^pgGRgPas(MrpY zZ96Ht)sg2-xmv!H1l>aKSo=$3ZO3)PUiLblb}f>;R{y}gpshRucnmxaOp&YkKDFZ8 z<%TsHoFk8zkirwYANUkRhVSYz^W!CkzHM#daWywA%#A{jyj;CMQpwWiSH^pnV2U3v zQRh$m73j^x{oK|h|5J-LjXYOTxMH-0WzTyJkC&7MXMDy*U?R}ev(YOw2r3XHT{yd1zK>W6&<8QjcU?KG5ZrN^O zy0?sScng}~?ukJg69MIg5c6%6HIc*Su2K0TJE5i5``KL{WEDD@{HGHSFsVFNNOU zrm(iiy?9*<<+Nzq(Wd1Q-(}Q{|XkTk+7&69aD<89p?< zFqU+F#{e#7&WQz#@7BVJ2*R|~wpBhfUNLfH8ZXh2*?Ll3z}suPJ_zm@bFFIU z+qpS;zHy`MoS<$cl2f(w7#gsB9#Ir()q{{t+74iP+{LW*frhquOlMv>aaKjuj@P-h z50ogYZF8iyx*TWga?p1@IV-?;Rh7O(nT;Q)p}1(W(sXLB%ec9?osK=J^!#lL<(9{` zqdx{;SgrUG3Vs2>w_rPA+g$3!&v7Zd*r`cPe{8!-D{c1i8aS$W!)r5LR;2`1Wkoyf z`XY~&BT&~wDg)z#k15kq*;0x$xf}{Ff**!O`QB2b1taW!9ySLkVrl&cUavoS?7MI9 zzJ`f5<&h{wIM;11)7M-q8t(!U?i_F(ti~L@ZWRXqs)aR5l?VRaR3l{`4W+p>$mT#K z!2V3z9C}m+88@K6VFu=LRSBigmAdISs+|(Bh!(3z(?XRhjgR+p$QD>Dp)f4}RslP5jdd@ijd>nX+f zjWD+){&+Ts0WMOVUFw*zzeP#D>cIB?mO1J%m&s+zJQXt4W1)J~sK*lZSf(CVtH*Nn zXi|?BE-9{UUA4buEdq)UV|{(I34a?Wi_N3&*wH|5&lIkzf2RJ42ewmSqH1^P>5)B^ zqiZX$fR&ycozd|4(DP$AOw+*PMCl?RxNp018`3x0yo>P_X8C-2yaQ1l`pI`1E(6lf7`9nDx9heRXbqX zpz)5L&)A5%_YjmZ?jD_6s{CIrvR@v9oxHbyfhAm5C%W^QJ7!$-4isys8VnIwiaj)7 z?%NI5ZF`t9-LSx5XC};B-G_>eR(uSjLMJ#BN?>{kc8@zWA}2nk_4yZZ#!nRHjH+fu z&J72LrajxW=pS%zp15PhXft5-&x}_58P(%L z->{s%fTid2A`LGN{kY-9;`I7wu;H#QMjnSEVd8=MXD0q7;gdUcd$jF*W^kq!FLz(V zeK7nB{qQ#-=su{VZly#ljZstvxc|Fdo3$#NOTGcOsK7`Q=(&?^Tq+44r{$ z_~GOC?F!(3E`&5i45KZL!*a5-J}%1 zG-0c7)q_W=%(%K18@iuXl6VCSk5*lHF4BG5G{sGO3<$-a zicDVr#QwG!KOw|?*VlLgIJlYxswPuF7H+s(jyD8{dp$)SKZ-v;qCZNX0kxuub-G9d z`z0V4`vlx&>aNB9Ao%QWU51vOJ=SsZuGe6c(SNBfcjPj6hi%U#RB^S%xEqN+?+a62 z)XMi8A8j=}T3mALZE0MaC#|!Is?s+Tm3vZ(c z6Z_mTj9aNIcRo{`{zdrncpKG&MV()9gBC7S0~)dhm3N$g6UXodkJ^ddLE1wz`VwMl zFBXn={9=<)yhSJm;ovPcK88Q>bk*Pf5Rs}+D*dy}Csh!97*Yi|M->1NSX=CN^JHOl z;V5|jx0Hx}VZA_;341xh_@zrQo{6G=dSAs{ zquf3250|=*Y#*4`ShWKeAC?Z+KX&)*st2E-iY;gvd2MOo?2*@QDLxO)BE4^?_llN@ zU+!+@D8+vss~FST!gVSuHj;VI_HDrU{}`+sI9&DMg@mso;^O=H-4}ZJB80E>bnV`8 zcm*j{d}a0M`melBE6o1=6<@(5D!nqk^9^XFc=wg%DK*JzAEtHYywcO-(tSX29`!HzoWB=+Lz+c`hYr8hQ9E<$rS}eZITJjr}9= z?UA$CJIOJeHKvkH{KhRAAH9HwwEgo8y;pp!{bWFI1fAj!U|YARScwHhYqzPm$7v;c z9u2u0Qh3|JhQn1mu0WS;fny%XcjvKG$6G_kaVUzaU-$>O5{CcSjnw9K7Q#qZOYV zo%3gUQ@LUu&j+HU2Vu`~52YFF!WQ88-$7g3_6U940Akj)2Sl>%VCmt8gLh0XJxM+E zE*b(j-SWujmPaQl6T4S86c1H>s24@4_~PiCujoAPeLLrI1m~UCaiORh<9CBuZF_Y5 z1N?ks{QdMi_OOy$4kFpBZ^INi#%`D^7G6gaYy3^%ocE%_d*1+0<0?c--+B4TkzY@% z`ruoq`__(wymqWQk2mixe=EDLdHcvuj9D_Te-KCdnzfU5~4A#j| zV;{KKFz#M`vT3Pu9NTnD;f{S3*DT$)>Y8cXRZ3PK|C5V(h`sh}r5C_e_kO2utIj*Q z->9<(?0qd2i1&oVi&DJpD~zfgw<^JH^~tsacc0UAO`!r?*bTp|V*BKMXVvYCOk27y zGToRMrQD5)o%`D!;pOL^`)38XFlrLu_90>(tx3N1HzC*%{n&-pQ5M zbR8=G3>KtMkGAcpJw7(CWo+KX4aI|Z5JUgS*qqNJBye5RyK4Ux%20gK|}G`st-N- z8y+WPO`m5=3Y68|(|^<3SWQkvefG{{l*_UI{TsFlJ@&EJ)$_yj{2GgRKl%-CP`>;I z^SH`S7p>(?UfLmpJa(++_29Q@zHgQ48_juQO~z=6J6Tv%|HOkQnZ?F>_DgQMO|wqY zaxuE?b&@2WFCCO^%86eIea14srE>J5Lz}>z7B0~v`DM1vDm?|82&8vj-+7{Vbl-I2 zKE(9xZ8DC^u`RPH^-`iDocC#PP-SGZdB((XpWa!}ysz{!%v3auGzX=m1kJ4Nu~JS z%eoXlQal;-wAB4`hcLitzy6M6Pl9vEmHskJ{05DEXYyi_H6f3G6bp z>{*oSFG|H3ijO(=2?FodJdG!x!HGuUMlgr)mUihxem4=;tC|)SmNv~Nj(bQEjO~=T zrLZ&t1BSvos~$XFdf~3;un&AfSp~Kf9z#?rF7_tJZ$R|oUfCO&Cwnp~0ybsGmodH{ zjkL|Em>8+wGx4-<-EI;Gp#M6}Q?M)AtxUd-&*ozUZ)Fc?hlKmz-*#9%jxaGkq3y>` z-hE-!m-mV-;IyipYnZyjJK)UGw!>>1+Kvo0(kcqlxtcybZXYJFR{SVyj6-vjtyU|u z1V{E)>;~q$FD$h^3sanp0Jj~QcsmXJg>1%Md?sz1yPUsK9>?y*nt$@xMFiNbw0zJ=>#MXsbs={QW*wH;Z=wKOo<-mC5e=#m zRj{79I_^YY>8M3{K|qYEvM~a5iQ06I3<2st&llq83f9G9BZ>OIa!&nW)CO5ydrK$-d~0O#2}kziIARq=FJ$4Fju( zzp9oS3{w>OGwcoKS#SdtZ>D+pH2~Luow^b6p5d;$I8!YalbwIG6Byj$a76is51mla{)N8@Cu3@og<_n@oILZpA zA&)wawjV*N*WXMv+fT^~=M$b2t(9ig&KW#SkL;s(QnDX{3vWA&1E+lQ;CgRT9 zo+XLi?eR{41qC!LtSJEFP)-|vG1Aq)rla_r~KeNiBC z?AJU)m=BfevT=c{9iWCsmsLrZq48;segORYC#yWILE>B}KWOY}p2lal_1H0ZHPY|n z=X>uJ3hwR)xAD=1t~o>qH+_MGykbS-f$^$R=RBOham>XJDBmxfr}I^OImrdyfff*MV#{YfKbb98Y2XaF zSm{esdi3RkrKjM-d2H46lZfhH2ZQ?Obz>{fZg_O)O?=!yFMhjgAE&MzTR-EqQv0EA z?xFtqDz3dCN%_UUDE^~ft&}CscoTbOIr{OcPw$=m(2?1oyWe@}*O!*|)qf8j#-6JG z(fFGw%Ew7~t$(=mM*R=YdWX>#F)sXr3i?~(_Y%L;Xl#LZDsgA_2zzrptJJ1k092IV z5tkrm;~>GwiMmlvI?74!dN>Nb+;sBx!G1kGCrwd?pLRI$6a zAAxGP>(H+0Q$;(8Ez5^XKbZ8rf-OJCpE}z^vuA2F51aQ>7Tpp^&I)0=0JJ6SxHu1L4^pgh#;iKpBT1uh2XL~}! zuEIG`8yBicmbi3m?X-zXk{=3{cfYxn0B_p<+ESA99_3K+g~uKq*)#p_*%OCkzwW*z zM4MoH`qq=PM=wHPY-I%zyZiA<6z>?Vsb9JrRaY`;#eE$kt-Re*yK_(J;lhQb6JuXr zgzqQkd;*`YE1n?Q_v~P+F@DF#-Z=U0o3{|j9BJM}pNxrF#ANTpD>2$HO*}XTsm74> zUH8q!5dRmdaK#o{C$}&`z8}De5zvIM-r9uk6LVBDS};bZjXX4C8i_b9#$B)CYyM|j zKtA{%%6rc}Hi1NA3d`u13~>uw^{Es4NCf;#bo0S# zSd%BPWjAtu4HaSf%X?{oH*~N9L1UT@&fws59h`mFa}=!5LG#2zZp@Yw-!coc?&A0D z$eDiIt3HLhX|``&f^tykK71`bbk}1r_-0%!g-g#j&Z6eP7gc|1ScP&LYqoDLaUf9t zXMW-Zb$_n~acNom*vTW_KFF;Yzw6KyTmBaNK2=}YgVA=ux%y<=RbyS>Bl?O~ns^hX zt3NUGc*E0$*^mGD+U|Xz;{;e7BzJ$%xhRz5vRxas&mw|>Ir_k z7vE~m(P!80dL9-cV_kptRg<2dZ-uSoSlc(hP+Qvnph-Rb;-?{d4^aFY5)dB0XYiWa zL67lk;qCh2uXY&vVvPM~;eCHZ86!k$)MJ@?tbOUOR{FO7z&0BDe-HUq9f1>sw0+f!F4vc~Y>TuUs z<_ECO;wXFRVCiw}0iG_K(;CZ@Sa88Z05mn!KYUG7WOI=5+ zcKk5~?`}W(eQ$dbaerPqOi_-^JYISl!JoN0BH}yFZ9o}L)>$p)~A zVjp}*v5UE4`o=3GFJD?* z-f+C?13L_y!aut8PM$OMC;f4WlX*d5s6P>aQ_V>r=6io@U&ATL!*{nIdUE_cSOFcO zuRkdrX8^ta6vvS0{bw_OPeD}%fO~lsXxk{cb@?0;^weq}Lp3CLgA}y=CEC)}j^`&Z8Nt)?aYd|FmCZ18yrZi0lrrsA#%WBZDK{D1WdCrh{74kIY`MT~`34cVwUy|n> zfxjZ*Ps_7X;D03Hd*t~Ud2W~IDv38&o(Bc~h#o%z|GI<^$n$x5j?42|c^VS`sDuaP zd5bP*R6Q5!a_at&rzy`Gc~;2tB}q3=!p9~2ygcXXcGTsN=j-x)T%L0nu6Vcc`~K$} zP;@T4u*DcJ(mTsFSaGffCq)17Zv21b-yP4l8f$;vYGm(ibz#>^xI>=)-y09L8iilB zf_-uSJ#c?8J^qawEBU$nBMN?&z@HcRvQ}k$G*jRw1l}a^HQbn{;BkSUC*Vqf_l4rW zMc^%=d@mMwDum~9f#(GNW`QpkctPM72>d#M4+wm=z;6-ws!+bS3VbM(Z%W{61%9r; z3j*IR@CyaLOW->MK11MtEb#RqJj=hJ!V7n+XNACzNk4Uj%K34@vrFLT2>f1w|B=AY z7WiKXe0Qk*KQHi2Av_po_;*t%{#PV^hm>=Uzz+z#QsCzc{Aq#T+oHyguJ3cYe`Q?h z_L8V@T4zI=DE9o7l_Bcbuo zCGgq1gXM_}eA({cco-1))dIgr;2#qBk`VmU0{@ugTPg4_2;20C8|Tp3D~)C6tTb++-@J2I8Vl(+d*(`G6a99bx6=3s z{SMLZ)0HaC0eXJFQsq0%P;_*fy!*o^k_{c3)@`_czFEkcIV!C=-v=o4*=AHDteb_38bv2>WU>|^NM?G?o?P5%}e<+<)WvenciZw*QP$@R>|A3Y;Pv{erg!YXk8gu z)wX)g+I81nx4!-Q4IMXZ?A+9KlP&X% zA;X++U`UxmM$R7SPG*t?GZ9UuC=2yKO?vHuX%EmBrw}a^ozRzDJ{z-XP!y7B8piAN z*tGNcY#zhatf3ga`DmKnYiD(&>?jQ@r`VGwgi$k5Or>aq^it(=G?43Nb=q9t1T{@E z;}r767!T1pV*$X`byp_%&n&~&`_lE+dKy|rrkL`5>x;TWg8*`eq3_IZy{<%I0wsQGPeCYcV#o{rCE1d}aFeYW1uRmGk4i@bmOuvHsLJpSo5( zYp$F8?E?DtPWol&_YwM;f~!fMH~Dby+~B?6>wEt`z2DNI-Y=mtzr3-<7@+Vo^gGzz zV$8n2#rVbQ@@4CwZ>j6m`(M)Y%h!8&@Vu08zggZtdP9rxCHg%_zu6muc-CwTrt79~ zzc0=_O0%4PPJfaHsG3&stgQw#(IZ;>=nH+Y78%twH@2?tYJ)D>=*dT8dJy$wa^ zA%z?_d3PpDliG-7i}W2eqGd0x^CBXv^2*yx9NfHA_zbf$+;onrX}?f|M7Ee=BHm-0 z3S(UO43LC$u7GbkE4PUV7ER@;Q3mxQ?R_--v8&Z0NadIOHEpY|Hfe#Q^>WGr`|5w1 z$}LVMGq-mOI-x^IrYN3}5F#>&M!krIue$-+OFo zd0IH%SIiR2;jX9d3QH_bG_CsDXkTr#Z!+3%Fla;-^0e+JV^%sFFQ#nA0vlt*i|Jes zF%HH}=t|1`Cdx!Ok1T~;4%Dy^RbgFBJur(#;H=;{5g11lmP-Yws(mz~4J)C+;5ZzN z;hG3hl}I)>m{0chfyp+nT(+#iT%9Lwr8Ao-(6VWpt1+XvpO%>GGO;=^(VO}}R6sc> zrXw-0F&zqlb9S=De9Y!C8YArJy;wFAPb!|rG&l9xgqYG_zhM@or0y#WUc=MZ-b#x( z(zUm3jI3?FepBnpb?et{dbdfS)$2B0-`3e_uHLZGY&APtH*Q)N=~~~q(d_8j*s-Cr ztq#>s^x3JLVOi?Ip=Np#NhPjMpjIFR-roWvNE~XMcs(meT~)9gJDQL6Su`$O5KB8T z3vQ60hk(ySq15`z%t(10okpnU8YF(HF){_cqK#mYKUMx@$AC3m{^%iQ1SW|F^C}@Tjp7D|p)o0q|8pp%H)KO;+z-J7sZhLB@Uugt$^zY{ zPN0F_!vk5(gJ3#_h0+4lTrOU7Fd}$-YRzPh{`Tjixg44)luqEmgbNldFoeD`VWkq< zSYvq(@G4HcCIWhCNTK{e#47_R{k$rd$V~QTh~N-cYsaGCUVTl%D?u`mq$O_Uy6d|( zty|w|Pz%ujmod?7EDq&15Xdc)om8CaU?ck4A7T;_Fg4~4hn6clu0z~*z6dmfL6p6^ zP|hY$tMx7wbs*g5iiNm(c?Xuowjn&(F34f2XxY4rI+b})| zjK1=RIAxf)a(H;ytlpN0+a!TmifmiyXs#Ji!a%cn@vu>6UgHu(Nd=j7j(QA?!?x8b&YgLHxSgC1}2^H z+u>W=*1D=~V`l)br!=q!i1Pw*cP6ofo?^jHQS(mv9*}IbP=j$`KvIpSQjM}&h``J1 zKWjwt(R|XDV7anP%1Ys(e<1a=A|!|zz}RM9SDMHaI%WzT>vE#KHcQ+$i(Y3751P6< zT8TC&NF$J%W|)+l`d=Hwe9okg7CM^-pAtF|OL4zZGe?8a7CgK%n3MmlN;a+M?<<kuqjGunl(_REwZ*s zVVRAN3z~9?fXpfOSh9B5POWZlt*M%#OkfR@(Cq1WW!m0lkfy*v16fmJR^4f7p9pmx z&FRNet~g%b+io#D>dwWRrPB+`HD!98V3DJTgu9$Fj!7Iy8627qpc#m&gwU$AtSr-W zqbv&(#L19Qr3e{o?lP#bn)HLZt-@SS6MbJ1DkrPLSZPP2L(-cZah4B<$0s%6b;T)g zxPt*NL?~(HQfd77LQGYtOiX9IkKi|@OL>f{Mhdi>%e9s5Pg+NEtP{2i{m@309sC5C zWlsH%b07i8Z6oPIUqAcC#$jmrYxy9>V+wGoC8Fugt=Uo8f<) z&K<~F3Z%*E1ST$V$k|NHR(0^Pvw?rBva)BwIsx7sO55=yHL1er(jYL&W&UAp!Z*jH zZXkJ6F;-LKfe=s*&nCc8e|x}=6$?W4ZKCj4%cMo6J(Y0L1iXQ9v4N;dJ{h+|n?{Ny zQN)(Y1>G^BR>`@YokG01iFh!Qzw>b)##YBEa;ZetP^`3SZ)ic3=&HMPq8xW{U+(4Vv~@cVelu z1H^>LPGlf`C-c9mZ``d);fWI2R4Ut#mEIFxPdOJlh}b}qM)fr^i~v@XH<}~?Tycd* z)J@3ar$V;~5f+(gJ4&6Ow`oWg^qh&?i6{|XVnO<%Ta(n(*~FGdDuAd-4c0TG zjKZV%)J4S%Gmu&%Cfgv2U4TZ*F!q05*&5ZQjRhNeZlgj{`&tnSC+QaiUU7v{*N!jr zDHbypFd#NCK!0*M{GlH}lseMUVbmdBH0~G+TH{f?^%!*tW5H_Cc-5_@U^Y+B4IAmL z0LZ56=?%D6BYmP_8NK08qTvtlMt>5^uA(>mNi18AH~Nz|7Ho_b7+20%K&%x_9eRyA zM%``Etx;pawfI{XgQbm8_x@xKaEcr=T4Jbs^|rR5_M!In#_Ad>S-d+I&A}X{n`%{S zR@cy@Te?aISvTeahZUu$-ga4ABmHUTKkbbk4XNG+ysXrZriK!}Kx4JN=K3x(0;OIm zo9U(QbBa04Du);?FCLFeBGI%$4ZBD$6YjEcCPE&2IOI!cQE`VdSqto3FSFTzl&$H^ znW4JUTG&76s1sHzk*$@dlQK=1kU7}jm6nlqtxR4pvZ)Iy4+c1ID>jr8B8$^UcO#|-^D zbtB=QnopPrHZfD6sROi3yswyKdf&$eD9mTbX1eCQ6__*p9cQ6Y*GKbNWb6N^IsISV z?f(HYE!@ZYAIj8Q=Kx6-`vHnUv~sb&=IUf!Z>(?9=+OVFH*cGiV)1bGjsF>Awp@9B zx0*~@3pLK`k~G?KIr(h(#t4s@avhWmm-Teh$*6OT7H^+0oCp2sY$OS^x+dzR)%dNI zfR_bj+G+~20UtICD~iPncPHj-nPF;y-L(i^c*0l->LMkL5@XYk7e&O=P`D=-0E6>>UE>84>O_6WdFM@cAE8*XSQ#ZX5KWg`1sr5 z^y{@MfF_Tp%RKR}cX8&-+EU&m#nvnOc3A@UU>3G!sd?F^oCDmFnJn7GL{bcDl7b0} zkyw`fnW-2;^OP&EqPc08y0aBXwKf-7JnX}A8P@jxY#xdNZ_kWMISB^w$xBDe)#A&e z87FypA)lna&Gk8Iy}3MR$D^4-GNxA^FO6D~ikY~b7^c?uwdU|Ojr1kS-)UhTmN^q< zpRNrSU9X^2+GJTfLhPflMzPu%_E&l8e&k*}!@l$WQD-pgfU#|B8y}zDvJ&w@H(a@% z;tmHUA~LcBYDVb*O*?QB@R(`bbNe*NL^u2cFg3ZT@*u1>zZ;@Gb@R+|=V{{^o3 zbR4E`lGCcE(&f0mG%Ki3M~&*#tmBkOCJhv2KSL;ER=${l1p=Q&;K^ZUthgOZIm0X# zoQ~J@7w?P|N@tq6I~GnoAZ19#f^4Z#y={{Is9XbCSAjgr>_RUFz@W%zwe0 zLAu|u*Uc&Zoq@DG#lNXlyZ?n#Z>qxn2UK&?9J%6(P*6{r$!pDjs;a=t?+mpC>9TTs zI;1bqX#agGgQ@fSPf!}1$*?#@|Np*U|C{#fZ?&|A)j~#i{SCFt>DS@kPBjFIHmMA! z`giZ%R^$G?LBBAcF9Z7$g&zpP_LqTuyA1666n-)UJ6s0#&t+iGm4W@V3~Ztd?B``* zFP4G5OySo~hq73Zk zWndqt@I4{eXUf1nTL$)pGO#a~fqktEY)={3x5~f}KJZ=TS55yz9S(dy2m>A3`gkxc z!n;B+(3clOu#3yU7M6k4mVwokfgxP+L=XmA_thtZu#3vTE-eE?cuxohI`s5E24O49 zz}A<6-B<>O@be)U=-=4Y@^?a*QD6%Oic%U@in_1nMj^&E-hLZ(26Rf^!H!EOd z0O-EzN|pAVS2zClCssvZ>`2c`n~tx6ujr(6g(;L9Q}&)`(yguL%%)rdz6053|KpJ zTlFV1@oc|CVv1Aj5uaZI0~bm$V#JzeQ+6PRz*G!%HXYjAbexYb+X}*lG61n*j6Ue# zn#TB(5^jDQ)<`Ui{z@D^=iX?oR4+<4(6IPmCYlD&!#1Q!VcBN)s#K~yn#@EtZtBF? zE#_M4NxZS_49t@(*vMPSbhOvDU=_nSY7~xcbtbW!71gi`WH)&9pXUEBTK(hS*!2s~ zk8Z$Ko_pXLhWUH|zFDQCFb*cgn>loquSD*dh343jXgs=vxceotqp$?bKK?-LpcL_> z!$~qJ#}}fWyXs0S&t3uZgZ>Zd1h$)#SR?piID=^zy?aq&0|Qnf743DJ7qO|9_M&Au zwldKd3$AD(>Vg(|$#IBu(31YK)Tv)zO{slpFn9p%woadib~QB=(^n|xw$yEwJrJ{V zQUqmzmb<-I5Hv5^w5r{zH>GVC=@=wE7xSs+zCt0_xO8cMe}7#eo{#osGj$oeurzPS z>`Vc)jN&STBK`4ZN`bdaINAXIuu;@|cn-8G$yZr;>35;fBo%iKYnv^ZEJ(B- zm}=4qxYwwa!pc~uU{=K!UkuQP+BTa*rBXJ0y;-SjHs^qlHp&i4jr3z3J6aHY0Mx2{ z=yRcBw-Yx}+YBq+oHxHgC)FC)_o6%Rdy<)@#&(2@PCgjRFn0Uk8ul52xg>T6id-!^fJmhz5ed5*HYNZQY&3s59bd!O_<(kdIp5}#VuWH(#oSS2JEa&F^ zHL+aZS7|R`8H+IrCaLI*av;EPir>=bD-EkdL38k$!ecD13+Vubz*QuD4j>Ri?FNS; zxF=>MMhXt15W^cq{RDt!4t_ukYlEQ`x$cXaZvF;Hgg-PJw_%JaFJ;zb-&dC2DK~s? z?yJR%wqr~NU`;X9A91AQ_Ww%tE~Le<+BlpHyVwdllW-wnmldE@`kS~ZQXfMTd5ss# zbGbE@&#hB<*$R88@QN=Ux_srC$`_X<%L_G;7qEI#+1Tw=RP+d&OdHnw=rwPvliZ-0 zYJ|BU&59py&0!QfW8R^RGXv z-n;2NCGadg-!Ex*(DOqA|5JM2C+~kv&#z0IJ@h;z_@AQZFD1_F^t|VO^?v?|R%5{l z^}dXr?ec!B4?aZCKa}^o=^2-_pQQKCoKX1xkGy}GeqW{EcTcD?9HHln@_vGzvtL&4 zZ>Q&#^4>(xP4fO;dZy$(OV9VetlEDV@cUH0AEfs`qu&?l_htD3{vbUc{u`C{AiX~$ zc>aZ+FU$LkS6YoXy`tVPq~~{JJX}og3tmxpE~n>J66c-tJR~@;rS}=1RrS4v-v3qL z1N8pCB>pGqx#Y9z{qywREboufdraPcLhly~o?p@XCV|g*mFg+)i|D=nRrP)~J=^4c zEj>Hry_25reO2Mf)ALrT%boPTOXBSI#s4@x@A;gHe;>X7wZQ+5o(~9~2kH5kz@Mb& zNB>sA|C!#uCHRlh`>!OA6zg+v)k<*A$*8J&OV#r00mdfABRm zFED;SMDOiB|YbtA2P(G(i5J8lx<`|zz4M%PJ^b_G@y4$B%%)Sh$Nm4C5jm* zny@*bnQ}I*avEb)28xF-b=hiGS`vsl1|i0S(`l*Rbe6R%p29QL8&5*{mZCn0r+Tlt zvYa80l>!sP(Wu=rc8Xu4@vYIEO6>I6sg%-Pdq;dytS6vgeAtu#MK(PhrEuA-?4WU_ zbed(p*nK8MStXOPCQPP|-B%YKRt1E+3VumvQ*m}FCt2D9cyqQ=b8tKO)uZ$y@RijY zszuE!*|Sm_5!|mR8?|7sKRUhl*uBXNH*xZ+6YLC-x`w(#9&hte&^uPJ=+(iWrg?3Ko@!!3sXryZ+fSa!SD z3P_Q@-ZmC!(75XLM$Fi}yF;=~Tk&Vz;>%a_hYtF) zj-KtS8cFm4jx3Cr;=}4-YF)fq9ad=P2&aspqVZpayL}D+?cl#RD9|R=kO8|d{N2QV zZ)ikGhL9O!x7u%j$6fW0(&g=Rln?6mUNzL)8}FgN?9!K>v1}qij{$jZO*>aLTJcqg zyq5k%=(%d~IiwQBYH)(%t4uVy--Rrz&&!@kIc zzCd*Mb<^6Z)9UjMJO!w;V>loG@3SK|{@*?BT^}4pz9ZKwO?@(2O{XaTjSY25PeqFZ zh{!u7>?T>JxWLWo9+~87Qv1QCo?rTOc9|JD#q8bMsCQlva?f$|pG0u>-H>VI4WA?l z^E^S68`?(oPyjz63xvG*>=v3|+}%#JS!j=?v;5g@E>`%+?rn@*AKUgu*pPpyq2%li zFqu*NR%x3GXJI3=KuyJsai%BLjp{XK^?I{zK zl%Luh81M+C{X1>w zxh=wf2xb^ZDpwju>GxCm{fvGu(C=lrd+^!m>b^#~i(o3>(ek}nKbu%ryJDt}AGe(t zO+dA~m`#{bpZjRUb}BA$ln3c0;vaE|sddXsOuxhEC8qK$ zZ3HZZ4ZqeHUfr7bv7)(YYcy4~SIq2$8)JZM&?5N?pI-c(%7#0zdhArTpWRGEdGno} zd!~r%LJ{56$l8BLLu)D-Rre}MBdL#u>o^+wO;&3YaS9Gvf(k{HrQgo4nAytvQS4Vt z!%!wKDiy4wSYSVEi>yVa+IaANH)TKCIRy^vMQMMfNhb!!KfZ0Mh%wbiIBsTDr%8h` zno%MWE}ybiH8Fg}&D^{zw#;0`icxAc`Ji07@kek`NkXREd0oQ14X*8UOd1QlBn4-d zNc1GUPTy{`tGpiDtY?+{YWmNSR{1d<|A{eVgP* zX%@NP7hyATjcg|q!rS4bF{GHD`m=WGsWvg&R~z^vE-YtmhBn)aKB(PXN5aKC!yTQAt->Wc&V4m0d3nge0!a>nbj>?(}qpso+SEsGZAy#n~8DI2db|81NSGXQDaof zUR!x8Q-dn0eRopvTUV}Qv6iT8#&!P6+tKlO9(#6v+)mNSC1dQXvk2#!G-1+q8vcPL zHfp&!+S{AAd#Th`-YyjLnPB-83`J1>HH(xEYmi#wz{uvKgNz1*KdJ6T@ukmY#iy$N zj#BV_A-)^+ICU=z>}k+dUwZz)cb-tX$cFaz4cD7`GmcFh+Ss^<)=na$vPe=b9b84h zQPMdYqA-vMmdm}WN`D7MfN$qyrfB=F_%dBC56Dnis|U9%IWE3r0v*GjFbJYCIii7F zsLT>uCx!@`mF;7Hd6-p7Dv#9)mp>+@rs7fyvGf27CY2VW1iocaf(@RZOjE_?W}_nY z*h%(~DoH(u#=X&e51h%0chD>kqyjPdL>ofoOJ<@uVoGy)cE{~TqJhP``kQ;AanH&t z7Ig}t_67*0&~ez!xL*QNmskLk;Zs|*{BT`}?v) z7~mBcjS){K60n=oml3S%+`tLy8yc1~b`7|4*)m)cg+{b^Mug^=5-RZ-StLP@G8j>g z?M)z^{(Z%0YI5J`beiu$EZkQF^1d0ffh{ zE3FB)bD0!ZSDsc4ni*miksfr$3=(2A~_Pi%2h|vhKD59-d-B-ey`g4!0U`ap*f zN1RMpsVE7WA-<)+>tB`xA4j@+ft})YHcoFy#>tCm-^JFU`V(nz)M~1TES5r~aF-dL z2f}S*^a}65T(+1>=~$MYirxz6>&`Rc1A(UblxTchqKa*3S-`zI&gE}(5e?xm(f>-m zQVeH}OUa6v{wNd$wQl_=O@bu5l(q-s3%6W9@_F~dt!yk-%(J1==0qwREm*c%IP~0t zT8kHSe8dZ{LUIR#k`XvXvM>k~tV0RYTNF95lop%}{Vn7Z7_j_;l~yH@JD;fQvm}Zt zUPyg`{;fc=pJU;|Z9m>XN+FjL*}T4My%JwNJjw)=xX}PlhZ%>A%ipaY^)7~HTCJoa zFINvcQG99xqROW)qvkjyzORTRTNm?a$@09l{tR+X;j~;=B6+whmxpig%G*PIp_^Y4 zIp!cpAsXOHE1vA7F*0aJ^F9=yAy&%H^pe2s!{Y;MRBoDPys;WQ1sRVR0$RT?&dY&a zWrIh|bww8Or3SP#b1Ll;)$y&uK}`kWm#Y~qA6w&JXPAfPb=HfZbo44+9Z<;ZQ&IE3>UzM8yX3J7)+7H88{;AiaqQ&uMdR6i-<*${Y<9@vL>#AY z`s8{Y2jh(OR#8WCP&oYf9JbeFTv=Zf)oVH56{G5QM?3EN9%n3kQG=CDBuKu~vP}tSWxJ^fu zW&sqPqhd}m71>5RAPV@)>d69fCl#V|vTQGSYGRmzb41|8EWpqSEM4Z11w3f*Pi(*YoFEiX6PV8^wiV6 z_$NHNZ$4r}3ehIfd=0!)mbMSNiV78pI*)tKn|@4_HKq`g>cc1cT~GYh+t)eV?Hw+r z4<)n2Rv*!ZDrk1Ui}~$#@h>XRNleuK6?-9)90x zh=82R6WimYw7yuYfRlQ1h}gsCB|fxR1(b5^cPMX2F3`AYYke8G8!8r4^|JZ+c3q^m z?6}*HYB_M3MHca{yL_Xin07x8;AWZ67P5*RKI5_CrXVzGgD$+*c)AXKOHE!js~~w; zdS8zbq-ge##2@M>)>E=|zfTKSRv)M2bTDvsJ`)_5^A&J@aQ5*fS8_Ft6U*}QNemim zH_$`PQ9`g|v(~pH{24;=g?1reu65lZesp z_L$Ijub2`Kd3I%zd?~LsRbk2LZ9L8e^vVa2bclPq z0wxp`r{1mywoZD~S_X|nhHowl(ws?awm%{z(PbHrV@;mluQjC zr;*@Z@x}<#3CpJ!^w&v&6}!_XN?B~%D^8h3SXH0E%Anb99@tZ@L9PXp9{j$94y&dE z{F#ogb=}|)D3%@1;4VX@Ao8{=e7Fj1&mP=M2;rn2bESaOvHiJxv^O0M@C4LNnx)oX z5s%imSk|Mte1{~79Z4)`{zelY`S%2taTQaae)vo_QCAr_6gT6qTywxfHqTbL_! z#SFzpGakM`Z_-?H6`2wN7sKJ$=w`)M2m|4!QTs!F;aSB~gF>5#qYdX%3(hxdBDJgw z)v^Z`Tw;dMl)i)x#k=APa4<@m$>x3S6*V=G=eb*FX+2J)%;A-!7n%pIUL&ZC)M-T1 zr1g*@#d&RnS;Q8;uHb5_I1t_V5<;Ys{YKUv`tnv|(<)}vi%*y6c&R*Xz2U7-Q|s&X z_Ku*07SqKqgVse(!!PaWb5(tWgq!@0nMw${E(+>7^#&Y4>#-0YgQeFgCV4X#`V)tS zd><1kl^`kVEH>Z3_7ShCSg&Hd@1!?)eeK08K!E+Fbhn!-jkoFRc2*Eqvj+m7V>vc9 zVC~TU6eL34kYUD$S%)a@o0YgO3U|r&uU~$Hf02KESMo{|daJr`=WsG&UvUG>bD*s5 z7oVylBwGm%JxMIts&VI!;^dRKGzRFeCo){+X{A3O!Oc1@r znJd@N#xL1oDo%}*%kdR`Tzsk{6MR2fE`vUY?4L6l$ejXj4@K|@ppV|>a8$9I%xlXY zytI@jh9DCwMMR?zwDIt7D?tIN^h#QjBtcdvnQ?--H>9SSame#dtz^cgby69S8znlr z^uXUQEgD!;J6UIw8ua8&Z*64)=9N3+vxV@?BeeXLF&88gp4pQm7s)3;*93|>@Z4jq zo0i5y0uZrAo_;ul$FDhduNwAr%$)l6Otv3up<>E{>EX1YH^a$2t_|QQjdXTC1a4^3 z8s%A7DUPT|UlY%>SI&sRNloyKm^Z%Ane^GGw$^sKaoyoG5os81g*7BEGGgn?_?b+I zu@VTFhFSidIRW{O`1t6RZ_kOBDIq+PhWAkeu^Cb>s<<8r@}&$j^*~8#fi$VC6N4L6 zL3FMlUB0ZIoL#0U%5cG#F5??X%B-P$GBsL4?c?%${v-^HL+sMko>IrFqw3a}r03n5 ziUw(do1;kTt{IrloEcbl3jx1cB-U(=2HQ!02o&C()jB<)QhpI!eZsm7_T-mf%wf+> zZW{MhDPa1bX|KNXlr<1~pAkd%RxA_d;zf0Qb9ZD3u^;Iql|hfrC8qM6r3Qi$LtLau z#iC@3c}EQpU*4jzU`r-fZ&4>MiRfP|t!+N57J7Mzt~B|6qcs4Skn zZr0&NnyRKvkA)0kXIqO`HM~#5cb?ZWjDRAQEMS756tnL3f$TpI^ zfuDz@-G<(wbzYs45XFRwWJ)Ar_tQKJQQM%ksNs>-scl6iji>EsW%Z6I)70LaPZbi5 z-t2;I;}$n0y|P~M?ThkFq`VfXv5)9HR{Y65Y-0VQkYQO6K=8XSKD?-vE4%s-h^A7d zEN>^0=No0>+naRvIu+j(-5RA?kH&;ea6X>09g)2!ZCNsIt#ag0w%>#X6tWf0B8q(C;!WL}~ZTEVS^N261=!DV66wiz&s;|M1D zz+`csd3v>};rJ0{vI>>aswBd4SR|RdRqA0agNcaRARBZWWpFBdBmt;0ImFYk>Fi`I zD$i5ku#=3!SHlcVNnZ_}w6RgMNou>8K=aMp?ZN)6>O05D#*$Gs7sl~-9v5Kl{6=TI z*CysYN>Srid5h5RnIR${8b>6?X)>qwWLW@K3=(f%61F-n0?Al?`D}(5SsE`mTW=|X z;?W=lHVZy0PaYJIcCnGeEszvp7WwobgDCscQZ714?u)}+sfSa;mlE8c){!*KkGecU zflaW2>Lg{|7$7iwu!k!>X!gTI0mPcwsLs|K+dQEbne;>{0a3cX;23tnvWcox?nL|I zMV<`A89A|N&h`s*jEj9f867GjaTG4hWiiw_SZ(_0_@yJ@piD6c(#4dLdzyJoEdy`L ztkBL4Ix(`e+L8|mIjoDwCkJ@k=+S}HitWbE-pci@oxsdC@fOj@7~3JaeWN(_tjS-* zbY7qH!ZI|#;=LR>Nc50U73;IOE?}@|%=3A99B)`6;+nn0RMC_IL*8M1f>bW|1rxcrcb+>q`bTm*(CE}En#nr8zyy?<6ZTZL zmuApX(DZn*p>OekA6+oyLi#y4h-f^>}oA;aa;JpO**p`Guxy2+f6Tw z2`gKuPm_E8*KRev zd{kc;1z4b`l#0VW_C~m9?H|O>VV#RDWA_sWfQhbf@ZN$F`JiKj>#$GJ&5 z1ieCs&S@xhHlv`0#j}T3>l|yB++|hh*rNZj$TK6N0o#Wz@pM&U_yB}FU@SgehO%w6 zx#^h}3SAUqC^<{#O9REbzdkZGgL-N?y^-Wids>d{D7F=q(q2y7B(&;9L_*~_vRQu! zLYuH0t(XZ~rg&@x;2w8XIPOM%LUs?Edy>5t%&nstMF+jGYgBUdf876f4VWHAVe@&Gm?>bJI3MZUgQQdLrrcX+bWpjgABXZGR zMcgKt=>rdDr)*LhvW8%AL@)t6Wb@M9%H;$^c(kbC(Q5`<0uSVbG!E_nX0BVyB%86` z)12q&AL(pcVyXx%g*c*;Oy>1LPC??_p3G?nm#4sid89SLw~5#p8^BIBPTN~*hey$c zls%v~{gN?RT5ujjA3+d|tL4H|*&G5kQI}e*E;Tklj8~ddY^o|sNZpW=jeFHhiqfiF zbrysz&fZ{&CwD|6Xc+6%ao0tw;Qfr!q>5>^UC3Il0Yw7S;k0si$I$lp{7JDBlQBgd z(@jBm{0`2kUzs~$(nz&T%MohTC)s{K(Texb)MbyV*!^CQQ}>V#J@Jg4l=Z5r7uB9V zmq;N~>T6RSOs3CFbpUBCPvYXRs@8kR<}Dgrl_21nAt75x zRyf5!zTw=#+fV*!qdFco32^qoBhoZkX6=eJdv?{?~yi zyA9glIgQa`ES&6!L`4ym?8ND4ab=r$wnHnEw_l+l=c$&cL7_t62}KEUx?++nkhs!{ zC6e$7r}d8|=GKj?ucXo{J|Qqd5YLZ7c7D`~pW>9bM00+!t;9@3}M z6S;S~xZ5pJz3A{EQJ4|JuyZQ_?)@)%Hh8J~Xhx-EJP%O2fUG$-j;#g5O~f@*gGH2# z!Hk*6PKx82Y^$!ys=+W$RX7-P4q^a_hQWPjPxg>W53Bej@vqp4lO#c@k&(fBDXuy2 zQEo%iZjzg^2@_5E%EDCNthuGgMZcx178AywS|MfCJrsf=y?e&gUs<Imt%VyLeA&cc@SEE;Em%vISu8i@DLQhVum|kl8jBtLguUEW7HK3inVy1}> zJ(D%Bk6zC%OK7OE{y=sZT$ehWdH|{({c(usk-jZX}xTNfx*l z&kP%%4(1hJ(a6jqo)cN7==@dO0WkNiSPnf-JyzV4x(Q`AZ>i%Mv_9g=yK^{*%?A{< zGTo<;XJdNk=(X8RmN;HULl20|Ys+2rSz8LpPI5HM6sjg|H*?F!SWW)6_m{MQL%R5|574 zjU#X#dKe*5a1r8hCTTwR%_De}!r?-%m|-hNW?{NqcN(rVl&AaoJ$VGRAn3 zx5|D?tWMfjc2!Klr%L`?pvx33*;qw;c>5M>uJ5w6J(U|l#TTIj<08n@fEZCaPio0* zP3E(5Gy+MNH+bp@C1?2zG?CJ^lTb$KN@L;Q(qJpeBoi{>fRai*msQfo8u@NQsAM}( zx2Ez%xC?eipmDgV*2y;%EaUhUG`&R_eN5VB8+37S1QEBV*jVc=@>wJ~Sz#rZWwWgS zon$|h>H*fRFPp(~f~$1s9d_g%Pk_U0L{XG63wLdxz59y9p(sthIQI_CHt%=8@}X z1YLZ>t^|2e;_&=OFffkTOqa+v9HkaB%9cf)XQO_B){Z8%O0cfIWBt0wx=q2IdN)H~ z$xm1AK!G!=>n97)`iozNPG*zzoLz4g%bRanPdb8uLJGji8j*71fw*t}oo z?wbj_0j^Vs^#}&GL&MHLxMMxfof;2YlKeZ`K_7mMOU^_9 z*pyruXVVPIXZu-9OlJ75JuTo%`}tuaQ@aNxc~)9@47h4GM^3$m>!RTv4`|~q zN?w0)xt~%7d-f)J+rJz}_i_*R*#;$!o(pFb7jNKtvAtuOLSmAWOX#rEXJyQ!DtOvF zH2-_1WeUVURhgtDes;#SWwc0`z(%6QK7ie|p`Sg*@J# z^U@?YGMzzY7)s20<&l?KK|Y&nZ`8Bfeo?3VIJ9U!rUNHmPPVLV=5 zAJ~?r30hX1S!?haAZ2ccHs1uLvPvm7c&vM8V@!XGz>Qd{H_JAXGVTMQny^hKHhHIIjh{-K3V3Qf~96x zO}Gr*$5k^{H7C^6a}-Z1(?rcWuUeDvc?WnB%DNmoga5a^vw@SctoQ!4%L)r3A|isK z4!Gzd%(B3W3-PkAyyz~h?24G^GCMQ7J1{#l?##lHsHCfsQlg@wqGDoVp`lSxk&FJ_QQ3)8lvtj6e*gdfy6*eBXYK_&o%1};=Q+>d<<8vS`~Sb*-{0taH$s`W zqq^OOv>DHF8oU;B_BD%`p2(C$!b2+hC_q{j*407>VDX5}q-3Y{QdD{wvbc((%4Y?+ znnz>Z&Oo!C{GlCA@@~Mh+MM@r$!bE~U#p{STUGRg3*+p5DGP9sCkvUCM{a=&`Ve(i zcIw}}ZG`Unu0#=43&jHUFmD zH2%z5$6K$D9C0TZbZ1sZ1@xjpOIRzF(<5go?@t;<%+)ARmVnAhb1dV|GUyRR%gwpW zR&7l^>k|k?N_M}mqQi<2AG7?QlA=Z_1oTA)dift`WLjt=>m;51g6Pxo#H_R9g4e0C z=B^gnjYxMwJ09qR*v@y4M+`XcaYRNtf;xm~9EtndNnYmE5lT=dF{igX<8mxS(1({2?VvPaS#jjlFzg8F3jthBDADbtmRWn7JV>Q=8ZJcdr05p<^1 zj-{82cqjC8o@Dh%tc4nO|HEz2rzx;`pc>83QfHz!nzojINM~JIj6rjxvE*0NL6EIW zdKQ5v?)Yt4X%UlNZNuUPODdacON_2$Fim@goOVoOeWPx22o5mr;uecu7f#7hj%>A< zURYu44DuidRk9sPUTb_Jc5q?t30b*=8S$?qJIOgrwcrnq`ZtiO&T1pzf2?&wQLmeIxV;;CiYe zbwx}a^F(xYkWZh%x9-fb$CnpImo^28D^t{&t`CI+iy8w<$M-SfoQTDdZo*NXIQGmt zIZr8m?7Ih?bxpK22xTW!kRrYo0Hu^QRLg5$sF1UE0tL*A-nlP4r46Iz8ZP~a*OIw| zulN=gOTyjV!El6^p*a3G_tbdZDrafXG>kK@Gl|b&ORiz3G%Tv&Wgf`pvR^6Il379vzgU2fD5OLZIwkzEg3RGsBz%px&t2NmR=34m_pT8arD@ zBUz)IY4?m@c1`v141+Aua=kDO9vX94Px%{QIik@Q9cSX3Pg}h36R|a;J zbzhAp(ti)dNUQOX83mFxfpmxReP%yfCM!la5rUPH{kXhcnP; zImxQ!6rUkOKTMn$HPZM~4cv)yI@tO|G^lNh^2%IuK1F*{S`wD5Zrj;UJa_x(?B^VT zmu-uEk40-L9Co|^`p%lgvVVj}5ChJgHgazlH=8DM>ayo)Q+!%Y%6xS^)UjM0(sSpH6a|lSZ%ruNPV*e@MsfW@&e|RW zrnvi^d5wW9!3z&`+kk8GDJ<5>=i*43U7bMYj_~Gv?t0M3uiHF#Poii|(H_VX*bDC2 z`z?WQ_I{^gQFTH(D3tr$PoAX{$veoyV*YLAoEEaXd(bOs$SwSYp{=Dk00gybwUjS{Vh>?{K4AD|c2gng^|DEYRX2?XYMhH(O`f zI7|IE+bQ?h(9A_vfO_tKIffgoZ8s-qrC0T=|5Dv2;2oaFq`arou30^5Y!J>P74|7c zXn7Syas&^k$90X}qG1>Q;TCno_c! zr85$so8mqD6P#1m^u9}L!=t5*k0I`yRVHgyLV>a%?@$pchZOU9-oD%MygJIYjzpmR z11gbLl#;eNuS(3GWwyt5cz=NmdYVaktwRTX+XrcT*zFD70XK1-w)Yk0v>f?;?(ZFQ zKO(=AUHzC=r#>Lm+1$5Se%m{)rSH>$mj4hRrb|KDa3gv zz;m?iw3v^Fo8pmxvnbBhZV!$dot~NEJ{(9IxJ9XJ*Xm?yjUK);wul30UkG|4ZC%vE zlxw|Y3P|sC=1EvlN6LfJlZ^A3J&MyEPk+vhb#o9@>w5yZSt6ash-_fsuCcxM*YtvE zBWg;txcjoj#-!7pb529cIt)dxFX7iA8gv)>@j6!}*KHnet(vqCWi**vrP*b)C^uu; zQpQE~kWe&ek0^D~x&mp9h}$RC$i-Ar9a~G%tPv&CfRR9Q+9sj2?*J58u1^cmr5w)} zIz1l$Lp@EMKDWU+YXqU+9$FRSk?YP(JQ!+8)9Dy={HB~I>*g!xgjw@WESa^zH))pj zc4jg$w=IWo3-IWPK2uk&#FMq=)(F3h#&J_rCMeu;-wG!^;Av+nN0zz?W{iQpcg4A^ zH)|JZ-#pEuCqogh3_m)i9H05xhhQ*5wGsj}eQdk=0-h`#8Cisage>D5B9HXh!3R#- z9)|{me;4PHbfOO()MGPkKkIyfNG#2#2Dw#dEb&j;GV2(~(|7&va|X|^_&xX7@6NQ? z8YN%oMR|@B=okT$gB{)OY^%z7=CO%#w*VU0c4l3MaH=Z5g>K<=A@U?3-K_RESAfFLp{bPv^_@6@3;!=jfOsZ6kj@ zeXgS>HBnk}>6zYCm2~JS72yJ{`Al>2q})BEi_EaT_$;8$_H?E`b)^@iWui3pSt&=T z={}T16DcxRb<39Dc0OrPWb{%G)`dQR*(qnO?xt;{)+oGg*499G1{kQra|l<-9Q}U95QQ!-8P4%T$Hw z&U0stg>zV|8xpKj51ZO{HTtF^30Xhac~*+}sYL3eaSDG~ojAEhfH-2^Y?@cf-McRd zC8jUZ);s4z`T`!>rQ*oa9=o(7mq7a~xtiut%?ePi6P*Da?vUuin<)*NZI_~JHQxs_ zmrn!awK0^u<7>#>tcIk=@=MK`v3d)}Smz{k)-hI;tq#hm3|v>V^Z6BgNP}6GK>I@7 z@zRNUyRaE~q19))DUob#C5?2fo>{L-b0>65Y@1YooF&XcRo&SXi4c$V($qyCZI@&V zZ;0ekm^Fa~wY9YYM~*kFX+=@@CXBQmHyD5gGbS0G)T#-&L|v>uyazp z(aPb?omRQ9*PMv%InqGCOa4pS?XaxfN%QDL@ciuUZ)bn`(cQctgc@6EUIIUG)#XH)&5}h;|LVLdHF}kv?QEIs9CFi-T zf;d@7aY2QNmXA1k>8ypIIR{>JI>#^Q&WAnTX?F+H*LBfM9v9raL?LX>L(}6F(j9eL z5;ESZ*SwlxHzZWI_iw40Wd@YJ+Gl0`ygHFw%VSEh@LD5r&A<;}zoU$4%cf46NNu%x;%&5NFGW*n?rT|!WHHdJZ2kJNKKJNYn&nM>Ad;gc<=mifg`EGE zO2%Vh8C2COQtq7zGL4ukOcU>>Ozl%lN<=!J!s+vhri{sJe69dJh{@80P&nMxL9Op- z#D9PYm56M~lReh*B!JoavVtxXFk<#yNcv9NnD^d;}`O#-dmgX$Zh!QmBeOh%D;0SU@2CUrn_nB7&KZ-R?Ua2NgGT?1Y`o4 zZzpfVdsJU#+G8l5((bv|^oSaJ&e2XzyGGU`n&bF#`tU;dFmp~ZVc8pyNCtDs!0de` z+D>}Motbea#>qMvI5V1qd}VCTJPeNkaBmp(itMwYZI8}T9(r^t6Hn8iLNu=X9q#X| zW%pe$vW5n?!fR!>i20=*6r?F5jp*w&P7lQl0%-3TH}iR`;x99dPMMHwB-@iI?#~3> zYj>QnDB7kgogHUXYNA_5$Ov>O&2#45`RKIb%j(rQLjip32G8-Dqc0@iX7u_ZGvJ}~ zXx165)@l^$-I0)%UB&qmWgTa&tSlPiRn~oB(Ru_$$)fTd*LZ9vA zjNQBY#{7?XA~$FS&IC4V4fFbXt*5cEGFV;RkTc3+mg0&;yYoH|T*);U0XmC~^Fa3N z=8QIvdsBQpvU_fukB|(wD(4(gIL~(5{FY3`EH!Bg1BnM&-suLF z>@(G^g06%egvo@fLITYl1^H!-Y`gY+T{RQ)v&ns z*r}1uvP>t#&Ky_NnWl1I_IfuhCv%%$;pnPhSaNiq`I*LqLUhnobQLOpewMYfLv+Ow zE4}Uy=>1}em41aux-;aKS<(7NKt3CCnM}YcD9JGpG(x~GYJB{jx6hz!7iX^2yz=*HV?IZFH zjb`gRA)!utaI$ZBqN9|qsH3bi<%IbX-tfAZGggCtUEz$kQKM3i+qq+K+#59;72<0G zG`mVZHfO8R!sQ@ce;nlLpK3i%yqcHqWUp|hiK0+I&l5?t%|eQU0lM6!W63J7+A#8JO~nrr@dMd*4VA zCS4ZqsrX7=+Lg9i>)ylhxfkhologGehr2^acC^8i`=ZUwc+e~lWLt(FsrKAH>_}3# z$x$6lWt=l@MGtVZgPVZ^e8P{9Q)mwcH9M)Gb^Ptzd*cxAi$OW=Sy^Rcj)>lmmrf!y z+U(uq=EeZ;g;Z<-zXE@yLOhb~9UU@be2z`dd&d|N;u17WE7YV@VamHMxzn16bT=q~ zJmnt?b4kYM^wE4SN|8>P)1{^1vUt-yrB4nEB(a#;XP|eQrGxE!yaD-v4z1!<`vJ56 z+PS|pO{ZH^$jRFQSC3a|M_O*ll(9J829>s6maVN+Gr3Fjm&DR^&2VF;D-uh3lfEmc z`+U}etMzMZWBR1Wwc@n3dc-6e$?f6k!5gpRdFq4emY^A`bMlYWH~Mi-K=6>J z_W(SOtK8>42jTJHr?Yh@@j*|+Tb=CWJnyXIv+nH(oKI=kJ@!IIf;so=8>zZFd3UN- z;w}ax#kza!jC)DJY~5$#bd>4Uv_60zlHHxrRwv$gX5MUJCOfkGDow?*8Bxoca`GO`wjwf5aXzpBBkdOVGV7>&WsN>4> ziJ*a1Q(PUl+Yu6B5Ye*q~!$tXAYrr?Mj&c&(v!Y-N8SzND&s! zTUgm7uPwr#G~dK|JbyJdRaP~+7O~KTFRQ@on}%s@(XS*%?DkXtRhwt~oW!6Zs?u^!3ffedepVB8}#^Q@rht zGnMoL^(%0kx#KOyqg(MTpb+ zhS#S~ar4~NDJ^u!)YS560a;YvF*TBqc^I>IZfecK ztK_J^DmbA&l!&Febl14JvZ|i;u(>NGN=TzKCq~Ob+GubhNXOdK8Vx$2lg?nZnSAY(Nh>phLDHS!_E|pLRHf%#-EalHlkS+siB2BcrQ|38)fum9ARl}y%ur*Py|E?Iiw@#@?Ft(DJF?TEzVKJgj~ z)YR31w$faI4EIox;=G7n3|-!qo)}19rw>`2%ZZ@1BV@Vt1H|z}j$n$-x%HJN9?`9Q zcyNTK*Es+31>e-Fu91nzz~ZRM7L~draW3~Mu322!FkZ%1LXz|4+=z}=x?qUxXJ0#e z2i!d?x7WVv7ZhmFBcebZ)w`HoKJscpsMS65X8P8-)|r*a0Ots&ImO=~+iC zN|R72>F4vPUx(T5(wgF-)DU0QPJu=n%V>{;J_*E>wzEuM&~Uv%>sAGMHWK@WZS^ zMV`6ooPVdf((TeV;GdnevW-q{<6o#*%Itd{$k|ewa4DfHjT0_I63G-*=0OyNu?}7( zu|QVDIS(YsT4BLE<>S#%YtD9gxetpg1|rTCIW$X&_dQxtbPfQu*}1`%y@bGBDOXId zPDK$(f2Wnn-}2J&tRjvKZr2YD)phk()SbBRQ^{1AR`DI9evwzQ>lWS{+u140-aT2? zJ~xI=!a9*W>qfXvTlBzNUeO{#nv}?G8$zD<+j;71cL!dY_3$Afbo$t;v>u{E)s^Ok zsgu04-R8HcJnLJnXa6U0Wy>)|La_I;)w_frufwRM$rezjHHR0iKy!s zk`_-Y;Po9#YM1JcwunsatIc6tF!ckupzMRSVg6I44p~z&`Go9o^-unQ`lskGp<~JyRRtKG zw%F=pK@o0kw7De{7}utkU+d$vXfh=(yIDwOS0Xyg-8tdgZCn)%$76JU{4BME2dA9- zX)3E0P_Ur5!fWWaOr64&<(08SB)K{*BZ@RUM~t4Be$>1x7I^zmiDWpHau&pAod-gj z3nFM;l3z`mB1-*TXKp%sjLM9n(Q32ej6|bEM>HbElQX8q%`x<_<%Bw_8pgXePMGkY zvy(!w8p5K8hD?J=v|W>Cgi~&@&{vglL(mMeIw$kkoz~Wv%>1UJ5x$fFZd!mgchos) z#4Lv8R;w&U<}-L=ytdaJCS-@Zdh~gN$+mmj2qVxyG5Lwo!PdTIXLD^1^Rm)B>Hw5+0F`cKBIg}K?+u(Fs2}fl( zKjhUgG@ZqMqK95clw7_HX^y%e%ijzqo z6D5mSyVINn05sJaUn67JVH$)B@g{W>>Rl<_1th&*m65KN7WlH7Tu~BONMq*Cf)>lB zD5rj2>cK5g-WpCe({NB{jA!xVves61gd_BmbOICC8N55RGm2)sp39wAU0vdMe|ot( zA^&TE^69Ft_e+svv)-OQy^nXN`@Gw&YUoywaL6189$J;;)bHrxFRfEbOQ-s}!9+W~ zkfoi3%8w&co-H%|Vt>CHnduj2Nwg)p?DzGJP+Y0fp#`+7xzl-*Q{IV%y-s_Sw5?P@ z@%{f+a^z5%?i)`zVd57gj+XMi(w&_~kEvmL-|2k%3G1NvJyx0)d-!WCot$1iefkV? zW6qPZ(i8Fz&Es{*lqswtxg1TowjIxnxx(>iTPV!;^XNHJI}s+GkqvoGcRsCS8-moR zamEDg^Bl5TIHfYmYY zZ+Jg?UZD9~VDx!2e=zfDO7*w-JK#sW@&@tesv%XXZAg_PpKbq5LyZ1HU;Z)h4J@C> ze0G-og{M}jlTY<<&*yxwV&?h2ya{aSseSAJ=BdVg4zIA~zXkrPC7&HWrwpx9Lx;K? z{=2}IzaDJe(7xTj6Kt2o=Va;s9oS)u7iRHuPpeX6PV>0W^O*@&ahe-G(_B&hw1LIF z+@t?-ul*Z@9<)Q%*|S_?hCriHdA5P!TJBUIKef%kw3cc;lcIzxgAPzD7#;l_(wm zb6q|Itd99mHA(X_i?0UT$ove1O>X#o1#F+zKUvFfv%=@(QB`W>C`n&aRIdNmfc1=$ z^fT3mKLoaYl=zRv2xo(DTHw0xmtaRnN%%|pFDfjnbNQ^ZkUq{5PI;fgugT(fg6&{F zTG6~Ch5sgt{~YX{v&4RMH`smKE&okDyGk{jE%7^@pA@Mb7T*B2jrj;QL-S0NtN(jo z2bd35AJY1FTJooju2Q2%6Ca>vDsg|!rLO!Uuw|pgeY3RuE=ztR*w)dKerBuO@ckax z0nO)V{ktvsA?H-75$6!^&lT4+lmd~HzwmN75l@JIN0%AcpfcAX>cmzpq;PyaWr z_#xNpbb ze7IG9%mZ7-{B%{PBz+FI;{W=9+y1E+c~AJ>3cf|l>-ym$WqsZ!`^N}hq^NQ!PfhjwSg)>I$XHFDravV41NJ|4aBuk*cxkuWev^#!CEOsl3^Jr?{fUU1oE$1?!Ou=!u%vf z>rlx3uUY(Vux;Zcd|EUwu=2-G!HzILLxnXjvf`)Y0@P0z5IHi{0pVarwE?+`mnTy1I z*J=IRtoYjswww6~)v5I#wA^WX|NCGE zgOa~*P~yM$Ek3pc?bj0V-;G+n$!gzS4Hjp9in>XO|J8l2{8M0iOC)`*)4agqe+Mg^ zBB=L8%lJ@mri!YyK%D4XN7A58TP>Z*Nubm|R>(Tmatnl9nwny84 zs}lbYx5DoiV23A3_}-?Z{g|=p?<-4DewB**Zdc;IO_uxyu&t$%zSnE}cUk4vkH8L; zO8kC|pA@NGR{lR_GV;%43Ew-k{BX;E)nH2}i~sIquGC12Zw1@Q{A9I3iT}#1^64Ph zQ7!**euDI6<)88?C_kqN|AglDr^n%^sk?-a9c|hF0NBncl0P>pvETmu1neEH|89}@ z@TpS`KTX{ud~CqdKNo!2RN}+by-M1BwaSO*!SM~q{d3_ZRjT|F(Z7|S6scm%fA@p!xJ1f_$CboS zfo1<8u)~*#|3B%czZ~U5x!C`N%Jtt$u(iyGsBQcN@n_|)r@{7=OZt0K~OiH zzfWoTGRu9Vr^A2KiJzsO(tNlTziYv6oi6ETyXF;DE`I`S_jIxUY0W2E;qxP~Urm?% z|7p!jEuKFE@i#;K_ZgMz{>#B4GsOKnw0xN*|8cM_GerM0nwML=7wnB0;=X4!pK0-T z!3KXw_-B>WpZ2F3td2SQrApjaVaaE}Hhf6(=X08GveNI1V6S~h{P(=pUuLDhyJn(( zn<@JJ#^=6AjJY$u>v7m@&XM%&OrB zm45;JRc-&vTK=Hbe|-Bm_8$Q+tdQ^{UYHd`4HZUyuzE%1hVQiwAEmynSh&LGYrr?L z{xj99KJqVuy{7H|4nHZ*>z(iVzpxVRk4h;&zMI9#ECx$eO8NJ_EZz@hGuSTXBh_nJ zoYLQK!46kS`ux6<_KW=)T!s3#O6>muKSBDn+Anv3?O=Yk`WLN#o7KPh1DL9o_}#DN z=UeIbe6UjHgVYaIZu(pgwn_8XefWN`1DgNHhmWj*{u<(^oA~v_{~cgkYQ%j%<|l!? zBFlf@2Rm3J{{IO-DbB02+<#sz>YrNTXQ-cQ-eiprtpwY^e6)H~^CMRM^(NT+%+FCj z)4a@Tzs{eF_SIam|1BeL@lS#6oGaz)&sA>xeP^y)z8(RDc^9m30r4T~kjf38`C!WyNdEhc%GJLXY@_DC zen0*W*!!1C z`1|p(m!W-jnS}3Qeo~yb$*R9sfUUhu@G?oCf6~0y zYJUx{L;Y7L_8-xFla>A(!P@IY{?D2hSo!C1uw9z}#mHOj$3K7-)Qf&U|4#s`VLsfK zr@?yaC4Ic7_3yI!r#ry*)QkWB%1;6&X~}0H+FuK+l+}LmiEP;YDJa`}zN>%hA8PocKu9pXCF}{=7o$ za*6)|dAa%fC|JQ_aetwY|1JcpSSppSejSbVX>-ym_nYO>;Q6WA8!{e9iPAM60k z$$5j+U?2NWX+-_rNPMt5Mf{gH+#27g16$5~s2buU-vhQ;^Ha6_ek=X{39O(=;%BJl zHCF$p46Ii3({%hSwfwiN$FYZ14Js=!G?<^nxA6a6;=TvpJ4?pS3DmCm%l0R9E*5O-VjbBUzn|Y;_Ka_r^ zWwrnB2itk2`2Soj-($6Je+l+J^E1?WKJG7HTBYVM75xF9^z+10H-5+XxPLeJ3ri*a zkM)uNu_Hf7o$r%B-v&RrRKl-FyZ@loemVcDDmC#c;sbp1PX??9W?bIMzUB9`V7<)! z+jj#$T&0R&F3daASN=+{_79W&gVlKLzFk)R_Gz%)AC~gtBA@X26PUVM;&+0N|1Sos zV?Inx)cW^Z?W0v-Jy(l^XCz({}%&Wca6BOO!Fpd{QPOKoy<>C z7whmTv+Dl?U`Mq4G|ii=_RD40qW^v^@qy|R&Fif4;d!t<%nMby=F6?}rLeh54R01c zUGoM@{z|a+X7S$)pZLEWY;&`upAY46`_J=v32eWXpP5JFcS=Pp`v)wC{maGuvvl}m ztn^U{wsg7pf3|jCk(EBzfo)+vO3g9p%W8l1E_eIS6+Z6Y@9<%&lDRjBA9DCfs>&yQ z|H0w?Rkd(W`TFj1w|uDavAmwfli!<-9=IQV&veMse zV4Fiy{>?YxXQkhtfW5=~RJFixt9}Z$!2T8q|4V)BzYc68^Rv`tKKyH7`&-2Ry1d-- zb4nQHbC~$)s@_Mw6YRFI*uPNwZ@85|wu0?pex_Qad9PKz{tWCe^P#@w!-pa$pCaNu z%{}Gs?O4zW0Jo@n)h1m_vgX(#U%V&G%v8y*Qgb!Usn(>RAJ4RTIJ^=u;nWxd?K1Jv-r(m zn^s8pM>St=@o$42SRwYen((v2|H74MKdqGX*=GD_$%nu)E8Y0X4!>u>_N)~D$F%-- zOa67RgUtQMN6v_&{Sue>U8&{cR{FaJteg1=71umv@$F!{<6^&G`uiJLL5IX&Li;ac z$zKFk-XZQw3Rm40zYc6ehuELe_V2gy&&$M^pRTUce61xvEa8^loj&E$x!~mqNq_0Q z-1ft#!1g3We@5$HXX*bn*pY;k4_zjIS@rwKB*Hf-@xMy*{Z{$im^AILA!@bgSN10i z-kp^6(XHi&Tj_r**v_Qbzee*O%YAQv9Z7ofmnVJ}q)>vgbqt`q(1wExz_fAp0q>f%o1pH2y%k7jW) z9|7CgDe^aK{Tr(j{pX~};*dAaq+gJ9d!lKyYi_V2RFm*0a8&JZ81 zZqxP`Sm~n&yq=jb!+~#=4O7DOfRvul7Bv}`7SH}jK0C} z)757*KVtF8;PY>g^tnU3f4J4ZNP?}`{29$NR{Xs}>;{RyXLb6tKLc+>|M5o2AD`9s zm)Yxwz~CjM>BrmtDY^;u|4qbCQ=b!gWqyUodN&5Y~mann;H#dN7Sl74x{|;90QAvMaH1TJ-fAU97`W>ux`?zlo zc*95g*1r*K>qo_XU(UK6HSsyIJIQ{qC{i zIk4Vi@V|f++#>noMIZOg1zUEDg#TWhzD)k6&qu*F+#>1cYnt2T*K=UKw@CcHr1@s6 zeElO>L63z0*G>Mk(svnH6Z3Oaud(0Ke-GI99&z6{O!~Llr~APUG9RM8>EpliZ$?mv=jGOa_knF;ev;akms>vc64UbE()Mq${5R${)4n`az2cL8%D|W2MtrRLwwCX) z;{Q3Y-rL0euWDXkm4E$iuTrCLCw`{-j^@2q`B4wnbi26!yLq|eGdF{6zFp$yds=?0 z<^C7IUS)o=dQJ0fcKm@Ate5olea*|P{?!Dq`OME!KQQrY`7a5!e!Zmce-S>W$tqty z2lg8Ck!ru@+pYHHsE?t1{uuF5zU{}YV7osi@#Dvb-%+KC?~wTM%fBnYdhU?$eM7sy z#&X|ouvhPp^!H=qKYM*3*x)-w|4&T%wd$WaU`=;Q`2Ez#TkXT!z_#2e`rq_PzyAt$ zM9cq7%kQ`HN67|+&j#WJ>Mcosd2y?M8U|atLBi+fT0Uj*Ua&*V$EX7)e_6cr<8c4S ziJzx_p?SB(d%(7QT=f5|Nk5kVe*|`z`3Ut(<9^HkBR+xn`2_J()WJMzA9zDxG1zkE zgVo!4RKI!oqhLEU|CNvY@4(*I{MXFUf3@5{>#izQcNg(N>X1+PC&AX;CGqRpn*ew&xuz8SI+`FEq(|2rQ(1FUYN`2QWPe}|R-9t7LHQS#UCHQ#0BuXn+Q z-Ywz#Z<_D4Yw101{rV@7x5ZT}__}+<{eJoLTVMz7k@CZjUvMw#&wC|*{6)JjbGh3-3xln_ z*CRjBaO!A11Gbxae|6Ny|G&N0l4ew;68C5$rokG zw}EvtAENTOXNvZVH9qq2eXjfS^K;$*Eco90Bz^Q_d89u}{%x@LnV-%(PqOQ;ru&h8 z?-&1{r0wsu^4~_Vt<3$`AD#OE%Et#J{SVOg@3Qho6fDJjfGX7bGgkTaNw8fHi2ny_ z`Q4WMTVRJCkn}T1^NbZg!Oe*O&62)P)_k2+{@en#akIqVV9lGX@vF~+?PXr5PBGzU z@q=JTH%s|6MDrt7{V?jmDmC#ziQiK-FR=J>u+)PRzC$(NWBKn1u$>Qz`%csRpcVeV z22&47{u-uvuNA-NfnD^F$e(V)-)i5?2W!%NxCuY2e7X&6EAune8ODAq|GWgY{~<|V zBQ)P@x&NR((Bw((&}pQAM2XUXpd>wQ?AF0lk^mYELmV6ah!xoVrt>w$C^wR~_vqk)Oj^?jf@=t+D`7~IaEBclF z`8@c(EfW9dY5Dz@eBL7npGSxf(lc`iAItv9U^5>P_l+^(V}*b8kt(PCJJ!ekRSrKx zo$tdx4!->niQgh)zm>j!1a?r{KTh*EEcc)FDDwBCB7cGAZ(6()tmjd2--RZBSpA2m zzL(|4lLOv-0=zV7*#?s^-Hj{w`SICq=$2Kezsv4A$^TasS0W{ARGb zKPlle&G_Fce?9}&%Y3-H#Bj_1gP*8UrB4t)PnDbWVYx2^mU%+*&vfHItNryT*p4S8 z|ILu}owwgAAAbmTBrXmp*?Dc9?mAnr+-? z*?-=XDF2_7{5{9V{(7+GPfGk$`0$&+)-yjzRr>Jfz;-_=_E%~94_fK_PhbU~68+Vh zueb6~F<8Z?B>n03i^qT4z;-hqrfTzZ$G83itnew~{ncEpf4^0JT>@6|l(>JMkNd-5 z>zI#J^L6|kvfTd+*q)~({1)Wrjvoxzj{e_v;?DUjp7UX*gVE(k+I zr+?z%-QXX8#?AjqH4Mz4{OYHq|MnEv4(9z-JI7zcz%rDN^p)K34Y1dqk??61o=4os z{}Jr{XT<+)!Yd4?pW~iI`}A4SAGP%N)B0<{>Yo+;F|FUYkA7YQcHOg5KH2Wi*Y@8D zw&__ZA6I6%kJ<`913Suml!|BRC;O*;7VWRkihM_w{7{%A*gEE?s6>`L>3Q; zYv`a}$UF51*ikKS_%@3d?L_-(rg=W0&af$+Eu!<~^|CpO^e$?C-JC zM=jVg=4YtevgFs10o%&_9CdpZrwsbu=S}%^idrv@uGnmaf8iJ4zb}yd2*>^-m%8?M zfvx?5g#R5`@lX062HWukNuPIS+mGL`e!Jem<4M^VO%pcI^@SpUU9{>JZq`J^tkr@zSrN{rFYU|8$Ogp}GxhGxMS9 z(>d{1sGb4a^Hs_JpV8s>j@7?-9qb+Er#tCmlU2Tqcmd_l3wHh+TDZk3pQ^x`UZ_%b z{a3TdmA@Wr6Z7Hfv)X>weM8lE!Crqs{O8EmyYhbo`^O7*_`rP@AN69D8uOyaKQH># zR?B@CgUxwS-2XYvw^@7%*flRo{One_<0ombbuYU9pOf{<+h9jtl>AG)C`-O%Zx#PF z^4a~Ta`2gZN#5Dt?`hvQgSA+kGDVqHzO4mYzt?piou7Bm>c97by}|rchkHI>L;3SH z;{DXuq|ovBZ!%aNb6Fpl-G5sPwvqWTt>63k5!ivR+4&Fdx5kHty@dA5OD@lruL8UD zC5hiXKJIG)>wd|#KRfy&C_s!o1JN$LY|HQM`|DWCq_xJYA=YY*W z25$$;^t$$EyZ;fe?Z@EXCuZr-=Ka2b^79*g^B~yFZ@Bp@+yB+ytWpi%?3;fKY|}Sg z_htL<+hA`TgP-~`!tdq2`RtcX_z(5v4d9WN-T2Su54~*S$6tO2_}-WM=Dz_u`m&q9 zv%_!9KJ-ua+4;-+xdLqYKG%QQ{1&hc``q-OJ-+k}uzk#(^1;L30z0(NjbF-NMb`NL zfNxc)LEm!aDgXD_^F!{9BZ;KG^$)+&Di{x|V2Umgq2s@U-RNphm_UXODG%!NzmqL1 zQ>bX2OlN z^(t5o(<;~J1?i4G&rKKMu=%M(rYRHc&Zs83_TAhQZEmm*b#==XBJTaz=Kg2#gi_wYk7miC`80d)cvG0Qr3lz-! ze^2o81Gy4~;68=LF1I zj&vdlNfDh_+`M?vq9!$oZbev4?Wyd~%=SzsHDl7G)vH&RWFnoRwq&9t5zS2MjE3O_ zvbm+JEnSjoPt8{B8dcm>Qy-ihV2x9!j1T1Mv_C-!>p*;RFdPcEM}u^~@vL!Oxj=4t z%%)Sa!~%*gNVP@jfd7@#@LzDM3h^z_`cJS-tt=1nO;@3gNNcELa;c*Grj^_d8_+k# z1=K8jQ+$mSQu@kr^@%qt)Ml7^nDb$d{!ue~?d_9~V+Q!- zzx={{<^5M(SXEF}h<^py#P8qbg{A6P|Ayz~{`0=Ev7hxX|HS?|()c#ApY<>Q#Qqui ze4h~cANI-1?^keA{{e*q2c10llp&`MJ#EfsFEnze(+S+3)R>tXG*6TXcnXXlSfnl+q}GQe*M}TZoFyTM{mBR=hoY9U;nW??%eS4Pu#Wf?tAXtbl?3CY<}>ehqpZP z=wn+S|Kt}PjA_x$H}ef|qy-2J65e`U{CUwCov*IxR1?>D~r z^1g4q^6gi@^WE>g_Wd9H%l;p}{-Za3{F9%)`Lnlve&84X`pbiF|LWI=e)HSkz4QBj z`@`XX|Kp#I{P{2M9)0hxe|!Hw{{D}D+W(bR)it$q=gnVm>1B2G3l}w9zPPdJiX~Sr zz3Ri_|GxSE75?9Q5cP+T*`)uz3bQxM41L>Q#+ZXX&$4xd;tABrp?Io2q*~BES*gNk zUBy)-))vbszS%~_>9$$Lm%OPIUA%@C8C`+il}h1xx4eo^&E4;Kf4_IQ zLVfjjsFQzNp%(tueg4!Rj<4%@#@6@0!(0i!M76sg{kP-4|6gr}!_GXIn~qkf6)@A^ zuTVX3&(fpvH{0}o_xQ%V+xQpxyY;889cfRvi`Fqx1kN@rmHKF&s zzvtrj6qtocx)*9yEZLQ&J6q{GHoCKnE^MOvo9d$-$<8%+(jMwUUnrt}II2>;4fERB zmFghOu+f$3jp?7SPcea>CXNfVt$q-+vzuyFNJItrg&eieim`b&HY^B;Z zzEW){tyF6!hAt!2JEfN>v5BP9b|Ps8o$zd>bl-Q%5L+9>jtK-w){*SO$fY z@wnXX9BxN%BupJohnXjVaGb7{rVAidQ)h^8?hLeq!Yk8w?pi}n+}m2!6$y4lG!nR) zE||RfTI)$MJy}+4Jy~|W<)%c2`j*L7JY9B!>kV`Pqk(85g7VTlqnpp7d=sUQC-G^Z zn=JXxI>_lOv$J1Yobw3X+GL<5)@HeHJiB#Aqr{#@~?B6G1KFGVq z4%5yz?#S=sx8H}xng?h7HikZhmNCBvYqMIdZc&}8vqfDQie=^|I~$Q+;?YGs6r>s| zo8~K35>9rg>O~6|UC~se&L5+1GHsCi?9{P8o9il79A+=fvbmLNcP;WGOcTsIH8PJ; z677zvl9o^gHgzBY7hF=UA}}$S1Wdn6`c4Dv^rid}zl7sSzVkR0OGRl&ArMQ@rMq+& zt4gNm&gE!FD#@3o@-yeXP@L{!ULzOjMl(^`+us$B@RfUExx3XzG+U>>KnxdT@u>@Vv=;L}x^S>&uR=+QoIiq*+_wO(x@O{|yYIPP2rRTBu zJ06Dm!L#vqF3hR;eii!#V-sQyoh58Q~NWChXLVfEqL|JuZz1rzq)= z3N{p{ySy`$0LR6<0xfGYQF>WXD&@?Sigq`*MKjGb_KB*xHAHs|gLfq&$uJKaBEls` z&qu@{eGl^3K*~C@D)T{o`c5g=Xa1kQyKjAWY}`JQ8LRXRSIY3Nel`geR%@(n5)F<` z3a@FSVMBc*a*)P-OTtQ(1}?ZDFt(a&7|i>{JOmGv#E&}r^XCaFLulk6Bv z?#Ii)*)%v9m^CXvf0M1n&CS}PW)T_B`hB#pTt_U;_1M^KcZ4F5V_MChAl|53P*r`^ zy!r(T=LKu$2b*f@CkGoZt-CZhuWA0`AU(cv>Xbes;QxRAul}?z@8^8q)7DQN3iVUF ztY?SutgNM3uyfLR}Lbw7&l+hLxE*#pxH^Ie$NVcvo{WWD=Ge9w>eQ^R1!!j!^P z!PLPlfmsf-0wx1o+w#QQTU2d#EMr=tJJsA+LM!^2nitK`*M+D=@aB{}{HB+ylM%P+I)|Rl z?TW`6LYa2`=H>LPo+kjs6?hh>XCwuOcCzHX^rVsJ6`Nv^OOq4nn|hQ;6B-Vr6SB|I z?=hr^(ubQd7i-zBs zs<|~n%|V19H84`Kh?=3A`N?e6j5cXBu}W2_W@_ZBMT#3B>T>$q8R<%?7S-I9pxIq@ zp=u@t9U-*JI@{8!6u&!Kn!{b4%^jg`rDo!Hs<|2JVx8pf+48%Uu1crXW6jNJv~NPG zRC8tx+Q;e|)f|$(cM{*y>1bz0t%19v-88y)v*Ux!su}H`L{h0Q!Y}c3OINFUh5gc; zOt(s~DD@lF980z+^*j7chsB0#^O}?R8#U9f%M+jXFU&vO_Uw*ebzcn3=u2i-8t(j;%uIA;pu0|^w?_8D- zr4(VRGrvQ-Vs$>+eeBjX^o_2aS2yKr%hb*Jung()*8J}e=SsDWzOkZD(Kr03)UNzYQbv8hoWIHhlqyoyXkXRQ^Qx}aR_PQ{efm$D z%W4-dtgV|mr6dxktMSxuJUgE0NUsWaW<;VGzyGHh+y681`-;Ze#cl}x&-?r@y{ -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file include/algorithm + * This is a Standard C++ Library header. + */ + +#ifndef _GLIBCXX_ALGORITHM +#define _GLIBCXX_ALGORITHM 1 + +#pragma GCC system_header + +#include +#include + +#ifdef _GLIBCXX_PARALLEL +# include +#endif + +#endif /* _GLIBCXX_ALGORITHM */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/array b/mingw/lib/gcc/mingw32/4.4.0/include/c++/array new file mode 100644 index 00000000..70e77564 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/array @@ -0,0 +1,60 @@ +// -*- C++ -*- + +// Copyright (C) 2007, 2008, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file include/array + * This is a Standard C++ Library header. + */ + +#ifndef _GLIBCXX_ARRAY +#define _GLIBCXX_ARRAY 1 + +#pragma GCC system_header + +#ifndef __GXX_EXPERIMENTAL_CXX0X__ +# include +#else + +#if defined(_GLIBCXX_INCLUDE_AS_TR1) +# error C++0x header cannot be included from TR1 header +#endif + +#include + +#if defined(_GLIBCXX_INCLUDE_AS_CXX0X) +# include +#else +# define _GLIBCXX_INCLUDE_AS_CXX0X +# define _GLIBCXX_BEGIN_NAMESPACE_TR1 +# define _GLIBCXX_END_NAMESPACE_TR1 +# define _GLIBCXX_TR1 +# include +# undef _GLIBCXX_TR1 +# undef _GLIBCXX_END_NAMESPACE_TR1 +# undef _GLIBCXX_BEGIN_NAMESPACE_TR1 +# undef _GLIBCXX_INCLUDE_AS_CXX0X +#endif + +#endif // __GXX_EXPERIMENTAL_CXX0X__ + +#endif // _GLIBCXX_ARRAY diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/auto_ptr.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/auto_ptr.h new file mode 100644 index 00000000..4554d7a8 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/auto_ptr.h @@ -0,0 +1,292 @@ +// auto_ptr implementation -*- C++ -*- + +// Copyright (C) 2007, 2008, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file backward/auto_ptr.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_AUTO_PTR_H +#define _STL_AUTO_PTR_H 1 + +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /** + * A wrapper class to provide auto_ptr with reference semantics. + * For example, an auto_ptr can be assigned (or constructed from) + * the result of a function which returns an auto_ptr by value. + * + * All the auto_ptr_ref stuff should happen behind the scenes. + */ + template + struct auto_ptr_ref + { + _Tp1* _M_ptr; + + explicit + auto_ptr_ref(_Tp1* __p): _M_ptr(__p) { } + } _GLIBCXX_DEPRECATED_ATTR; + + + /** + * @brief A simple smart pointer providing strict ownership semantics. + * + * The Standard says: + * 
+   *  An @c auto_ptr owns the object it holds a pointer to.  Copying
+   *  an @c auto_ptr copies the pointer and transfers ownership to the
+   *  destination.  If more than one @c auto_ptr owns the same object
+   *  at the same time the behavior of the program is undefined.
+   *
+   *  The uses of @c auto_ptr include providing temporary
+   *  exception-safety for dynamically allocated memory, passing
+   *  ownership of dynamically allocated memory to a function, and
+   *  returning dynamically allocated memory from a function.  @c
+   *  auto_ptr does not meet the CopyConstructible and Assignable
+   *  requirements for Standard Library container elements and thus
+   *  instantiating a Standard Library container with an @c auto_ptr
+   *  results in undefined behavior.
+   *
+ * Quoted from [20.4.5]/3. + * + * Good examples of what can and cannot be done with auto_ptr can + * be found in the libstdc++ testsuite. + * + * _GLIBCXX_RESOLVE_LIB_DEFECTS + * 127. auto_ptr<> conversion issues + * These resolutions have all been incorporated. + */ + template + class auto_ptr + { + private: + _Tp* _M_ptr; + + public: + /// The pointed-to type. + typedef _Tp element_type; + + /** + * @brief An %auto_ptr is usually constructed from a raw pointer. + * @param p A pointer (defaults to NULL). + * + * This object now @e owns the object pointed to by @a p. + */ + explicit + auto_ptr(element_type* __p = 0) throw() : _M_ptr(__p) { } + + /** + * @brief An %auto_ptr can be constructed from another %auto_ptr. + * @param a Another %auto_ptr of the same type. + * + * This object now @e owns the object previously owned by @a a, + * which has given up ownership. + */ + auto_ptr(auto_ptr& __a) throw() : _M_ptr(__a.release()) { } + + /** + * @brief An %auto_ptr can be constructed from another %auto_ptr. + * @param a Another %auto_ptr of a different but related type. + * + * A pointer-to-Tp1 must be convertible to a + * pointer-to-Tp/element_type. + * + * This object now @e owns the object previously owned by @a a, + * which has given up ownership. + */ + template + auto_ptr(auto_ptr<_Tp1>& __a) throw() : _M_ptr(__a.release()) { } + + /** + * @brief %auto_ptr assignment operator. + * @param a Another %auto_ptr of the same type. + * + * This object now @e owns the object previously owned by @a a, + * which has given up ownership. The object that this one @e + * used to own and track has been deleted. + */ + auto_ptr& + operator=(auto_ptr& __a) throw() + { + reset(__a.release()); + return *this; + } + + /** + * @brief %auto_ptr assignment operator. + * @param a Another %auto_ptr of a different but related type. + * + * A pointer-to-Tp1 must be convertible to a pointer-to-Tp/element_type. + * + * This object now @e owns the object previously owned by @a a, + * which has given up ownership. The object that this one @e + * used to own and track has been deleted. + */ + template + auto_ptr& + operator=(auto_ptr<_Tp1>& __a) throw() + { + reset(__a.release()); + return *this; + } + + /** + * When the %auto_ptr goes out of scope, the object it owns is + * deleted. If it no longer owns anything (i.e., @c get() is + * @c NULL), then this has no effect. + * + * The C++ standard says there is supposed to be an empty throw + * specification here, but omitting it is standard conforming. Its + * presence can be detected only if _Tp::~_Tp() throws, but this is + * prohibited. [17.4.3.6]/2 + */ + ~auto_ptr() { delete _M_ptr; } + + /** + * @brief Smart pointer dereferencing. + * + * If this %auto_ptr no longer owns anything, then this + * operation will crash. (For a smart pointer, "no longer owns + * anything" is the same as being a null pointer, and you know + * what happens when you dereference one of those...) + */ + element_type& + operator*() const throw() + { + _GLIBCXX_DEBUG_ASSERT(_M_ptr != 0); + return *_M_ptr; + } + + /** + * @brief Smart pointer dereferencing. + * + * This returns the pointer itself, which the language then will + * automatically cause to be dereferenced. + */ + element_type* + operator->() const throw() + { + _GLIBCXX_DEBUG_ASSERT(_M_ptr != 0); + return _M_ptr; + } + + /** + * @brief Bypassing the smart pointer. + * @return The raw pointer being managed. + * + * You can get a copy of the pointer that this object owns, for + * situations such as passing to a function which only accepts + * a raw pointer. + * + * @note This %auto_ptr still owns the memory. + */ + element_type* + get() const throw() { return _M_ptr; } + + /** + * @brief Bypassing the smart pointer. + * @return The raw pointer being managed. + * + * You can get a copy of the pointer that this object owns, for + * situations such as passing to a function which only accepts + * a raw pointer. + * + * @note This %auto_ptr no longer owns the memory. When this object + * goes out of scope, nothing will happen. + */ + element_type* + release() throw() + { + element_type* __tmp = _M_ptr; + _M_ptr = 0; + return __tmp; + } + + /** + * @brief Forcibly deletes the managed object. + * @param p A pointer (defaults to NULL). + * + * This object now @e owns the object pointed to by @a p. The + * previous object has been deleted. + */ + void + reset(element_type* __p = 0) throw() + { + if (__p != _M_ptr) + { + delete _M_ptr; + _M_ptr = __p; + } + } + + /** + * @brief Automatic conversions + * + * These operations convert an %auto_ptr into and from an auto_ptr_ref + * automatically as needed. This allows constructs such as + * @code + * auto_ptr func_returning_auto_ptr(.....); + * ... + * auto_ptr ptr = func_returning_auto_ptr(.....); + * @endcode + */ + auto_ptr(auto_ptr_ref __ref) throw() + : _M_ptr(__ref._M_ptr) { } + + auto_ptr& + operator=(auto_ptr_ref __ref) throw() + { + if (__ref._M_ptr != this->get()) + { + delete _M_ptr; + _M_ptr = __ref._M_ptr; + } + return *this; + } + + template + operator auto_ptr_ref<_Tp1>() throw() + { return auto_ptr_ref<_Tp1>(this->release()); } + + template + operator auto_ptr<_Tp1>() throw() + { return auto_ptr<_Tp1>(this->release()); } + } _GLIBCXX_DEPRECATED_ATTR; + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 541. shared_ptr template assignment and void + template<> + class auto_ptr + { + public: + typedef void element_type; + } _GLIBCXX_DEPRECATED_ATTR; + +_GLIBCXX_END_NAMESPACE + +#endif /* _STL_AUTO_PTR_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/backward_warning.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/backward_warning.h new file mode 100644 index 00000000..53df521c --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/backward_warning.h @@ -0,0 +1,56 @@ +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +#ifndef _BACKWARD_BACKWARD_WARNING_H +#define _BACKWARD_BACKWARD_WARNING_H 1 + +#ifdef __DEPRECATED +#warning \ + This file includes at least one deprecated or antiquated header which \ + may be removed without further notice at a future date. Please use a \ + non-deprecated interface with equivalent functionality instead. For a \ + listing of replacement headers and interfaces, consult the file \ + backward_warning.h. To disable this warning use -Wno-deprecated. + +/* + A list of valid replacements is as follows: + + Use: Instead of: + , basic_stringbuf , strstreambuf + , basic_istringstream , istrstream + , basic_ostringstream , ostrstream + , basic_stringstream , strstream + , unordered_set , hash_set + , unordered_multiset , hash_multiset + , unordered_map , hash_map + , unordered_multimap , hash_multimap + , bind , binder1st + , bind , binder2nd + , bind , bind1st + , bind , bind2nd + , unique_ptr , auto_ptr +*/ + +#endif + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/binders.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/binders.h new file mode 100644 index 00000000..9b059cef --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/binders.h @@ -0,0 +1,168 @@ +// Functor implementations -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996-1998 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file backward/binders.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _GLIBCXX_BINDERS_H +#define _GLIBCXX_BINDERS_H 1 + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // 20.3.6 binders + /** @defgroup binders Binder Classes + * @ingroup functors + * + * Binders turn functions/functors with two arguments into functors with + * a single argument, storing an argument to be applied later. For + * example, a variable @c B of type @c binder1st is constructed from a + * functor @c f and an argument @c x. Later, B's @c operator() is called + * with a single argument @c y. The return value is the value of @c f(x,y). + * @c B can be "called" with various arguments (y1, y2, ...) and will in + * turn call @c f(x,y1), @c f(x,y2), ... + * + * The function @c bind1st is provided to save some typing. It takes the + * function and an argument as parameters, and returns an instance of + * @c binder1st. + * + * The type @c binder2nd and its creator function @c bind2nd do the same + * thing, but the stored argument is passed as the second parameter instead + * of the first, e.g., @c bind2nd(std::minus,1.3) will create a + * functor whose @c operator() accepts a floating-point number, subtracts + * 1.3 from it, and returns the result. (If @c bind1st had been used, + * the functor would perform "1.3 - x" instead. + * + * Creator-wrapper functions like @c bind1st are intended to be used in + * calling algorithms. Their return values will be temporary objects. + * (The goal is to not require you to type names like + * @c std::binder1st> for declaring a variable to hold the + * return value from @c bind1st(std::plus,5). + * + * These become more useful when combined with the composition functions. + * + * @{ + */ + /// One of the @link binders binder functors@endlink. + template + class binder1st + : public unary_function + { + protected: + _Operation op; + typename _Operation::first_argument_type value; + + public: + binder1st(const _Operation& __x, + const typename _Operation::first_argument_type& __y) + : op(__x), value(__y) { } + + typename _Operation::result_type + operator()(const typename _Operation::second_argument_type& __x) const + { return op(value, __x); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 109. Missing binders for non-const sequence elements + typename _Operation::result_type + operator()(typename _Operation::second_argument_type& __x) const + { return op(value, __x); } + } _GLIBCXX_DEPRECATED_ATTR; + + /// One of the @link binders binder functors@endlink. + template + inline binder1st<_Operation> + bind1st(const _Operation& __fn, const _Tp& __x) + { + typedef typename _Operation::first_argument_type _Arg1_type; + return binder1st<_Operation>(__fn, _Arg1_type(__x)); + } + + /// One of the @link binders binder functors@endlink. + template + class binder2nd + : public unary_function + { + protected: + _Operation op; + typename _Operation::second_argument_type value; + + public: + binder2nd(const _Operation& __x, + const typename _Operation::second_argument_type& __y) + : op(__x), value(__y) { } + + typename _Operation::result_type + operator()(const typename _Operation::first_argument_type& __x) const + { return op(__x, value); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 109. Missing binders for non-const sequence elements + typename _Operation::result_type + operator()(typename _Operation::first_argument_type& __x) const + { return op(__x, value); } + } _GLIBCXX_DEPRECATED_ATTR; + + /// One of the @link binders binder functors@endlink. + template + inline binder2nd<_Operation> + bind2nd(const _Operation& __fn, const _Tp& __x) + { + typedef typename _Operation::second_argument_type _Arg2_type; + return binder2nd<_Operation>(__fn, _Arg2_type(__x)); + } + /** @} */ + +_GLIBCXX_END_NAMESPACE + +#endif /* _GLIBCXX_BINDERS_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/hash_fun.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/hash_fun.h new file mode 100644 index 00000000..8cc7a422 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/hash_fun.h @@ -0,0 +1,167 @@ +// 'struct hash' from SGI -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * Copyright (c) 1996-1998 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + */ + +/** @file backward/hash_fun.h + * This file is a GNU extension to the Standard C++ Library (possibly + * containing extensions from the HP/SGI STL subset). + */ + +#ifndef _HASH_FUN_H +#define _HASH_FUN_H 1 + +#include + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + using std::size_t; + + template + struct hash { }; + + inline size_t + __stl_hash_string(const char* __s) + { + unsigned long __h = 0; + for ( ; *__s; ++__s) + __h = 5 * __h + *__s; + return size_t(__h); + } + + template<> + struct hash + { + size_t + operator()(const char* __s) const + { return __stl_hash_string(__s); } + }; + + template<> + struct hash + { + size_t + operator()(const char* __s) const + { return __stl_hash_string(__s); } + }; + + template<> + struct hash + { + size_t + operator()(char __x) const + { return __x; } + }; + + template<> + struct hash + { + size_t + operator()(unsigned char __x) const + { return __x; } + }; + + template<> + struct hash + { + size_t + operator()(unsigned char __x) const + { return __x; } + }; + + template<> + struct hash + { + size_t + operator()(short __x) const + { return __x; } + }; + + template<> + struct hash + { + size_t + operator()(unsigned short __x) const + { return __x; } + }; + + template<> + struct hash + { + size_t + operator()(int __x) const + { return __x; } + }; + + template<> + struct hash + { + size_t + operator()(unsigned int __x) const + { return __x; } + }; + + template<> + struct hash + { + size_t + operator()(long __x) const + { return __x; } + }; + + template<> + struct hash + { + size_t + operator()(unsigned long __x) const + { return __x; } + }; + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/hash_map b/mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/hash_map new file mode 100644 index 00000000..469429cc --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/hash_map @@ -0,0 +1,590 @@ +// Hashing map implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2004, 2005, 2006, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * Copyright (c) 1996 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + */ + +/** @file backward/hash_map + * This file is a GNU extension to the Standard C++ Library (possibly + * containing extensions from the HP/SGI STL subset). + */ + +#ifndef _HASH_MAP +#define _HASH_MAP 1 + +#include "backward_warning.h" +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + using std::equal_to; + using std::allocator; + using std::pair; + using std::_Select1st; + + /** + * This is an SGI extension. + * @ingroup SGIextensions + * @doctodo + */ + template, + class _EqualKey = equal_to<_Key>, class _Alloc = allocator<_Tp> > + class hash_map + { + private: + typedef hashtable,_Key, _HashFn, + _Select1st >, + _EqualKey, _Alloc> _Ht; + + _Ht _M_ht; + + public: + typedef typename _Ht::key_type key_type; + typedef _Tp data_type; + typedef _Tp mapped_type; + typedef typename _Ht::value_type value_type; + typedef typename _Ht::hasher hasher; + typedef typename _Ht::key_equal key_equal; + + typedef typename _Ht::size_type size_type; + typedef typename _Ht::difference_type difference_type; + typedef typename _Ht::pointer pointer; + typedef typename _Ht::const_pointer const_pointer; + typedef typename _Ht::reference reference; + typedef typename _Ht::const_reference const_reference; + + typedef typename _Ht::iterator iterator; + typedef typename _Ht::const_iterator const_iterator; + + typedef typename _Ht::allocator_type allocator_type; + + hasher + hash_funct() const + { return _M_ht.hash_funct(); } + + key_equal + key_eq() const + { return _M_ht.key_eq(); } + + allocator_type + get_allocator() const + { return _M_ht.get_allocator(); } + + hash_map() + : _M_ht(100, hasher(), key_equal(), allocator_type()) {} + + explicit + hash_map(size_type __n) + : _M_ht(__n, hasher(), key_equal(), allocator_type()) {} + + hash_map(size_type __n, const hasher& __hf) + : _M_ht(__n, __hf, key_equal(), allocator_type()) {} + + hash_map(size_type __n, const hasher& __hf, const key_equal& __eql, + const allocator_type& __a = allocator_type()) + : _M_ht(__n, __hf, __eql, __a) {} + + template + hash_map(_InputIterator __f, _InputIterator __l) + : _M_ht(100, hasher(), key_equal(), allocator_type()) + { _M_ht.insert_unique(__f, __l); } + + template + hash_map(_InputIterator __f, _InputIterator __l, size_type __n) + : _M_ht(__n, hasher(), key_equal(), allocator_type()) + { _M_ht.insert_unique(__f, __l); } + + template + hash_map(_InputIterator __f, _InputIterator __l, size_type __n, + const hasher& __hf) + : _M_ht(__n, __hf, key_equal(), allocator_type()) + { _M_ht.insert_unique(__f, __l); } + + template + hash_map(_InputIterator __f, _InputIterator __l, size_type __n, + const hasher& __hf, const key_equal& __eql, + const allocator_type& __a = allocator_type()) + : _M_ht(__n, __hf, __eql, __a) + { _M_ht.insert_unique(__f, __l); } + + size_type + size() const + { return _M_ht.size(); } + + size_type + max_size() const + { return _M_ht.max_size(); } + + bool + empty() const + { return _M_ht.empty(); } + + void + swap(hash_map& __hs) + { _M_ht.swap(__hs._M_ht); } + + template + friend bool + operator== (const hash_map<_K1, _T1, _HF, _EqK, _Al>&, + const hash_map<_K1, _T1, _HF, _EqK, _Al>&); + + iterator + begin() + { return _M_ht.begin(); } + + iterator + end() + { return _M_ht.end(); } + + const_iterator + begin() const + { return _M_ht.begin(); } + + const_iterator + end() const + { return _M_ht.end(); } + + pair + insert(const value_type& __obj) + { return _M_ht.insert_unique(__obj); } + + template + void + insert(_InputIterator __f, _InputIterator __l) + { _M_ht.insert_unique(__f, __l); } + + pair + insert_noresize(const value_type& __obj) + { return _M_ht.insert_unique_noresize(__obj); } + + iterator + find(const key_type& __key) + { return _M_ht.find(__key); } + + const_iterator + find(const key_type& __key) const + { return _M_ht.find(__key); } + + _Tp& + operator[](const key_type& __key) + { return _M_ht.find_or_insert(value_type(__key, _Tp())).second; } + + size_type + count(const key_type& __key) const + { return _M_ht.count(__key); } + + pair + equal_range(const key_type& __key) + { return _M_ht.equal_range(__key); } + + pair + equal_range(const key_type& __key) const + { return _M_ht.equal_range(__key); } + + size_type + erase(const key_type& __key) + {return _M_ht.erase(__key); } + + void + erase(iterator __it) + { _M_ht.erase(__it); } + + void + erase(iterator __f, iterator __l) + { _M_ht.erase(__f, __l); } + + void + clear() + { _M_ht.clear(); } + + void + resize(size_type __hint) + { _M_ht.resize(__hint); } + + size_type + bucket_count() const + { return _M_ht.bucket_count(); } + + size_type + max_bucket_count() const + { return _M_ht.max_bucket_count(); } + + size_type + elems_in_bucket(size_type __n) const + { return _M_ht.elems_in_bucket(__n); } + }; + + template + inline bool + operator==(const hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm1, + const hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm2) + { return __hm1._M_ht == __hm2._M_ht; } + + template + inline bool + operator!=(const hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm1, + const hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm2) + { return !(__hm1 == __hm2); } + + template + inline void + swap(hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm1, + hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm2) + { __hm1.swap(__hm2); } + + + /** + * This is an SGI extension. + * @ingroup SGIextensions + * @doctodo + */ + template, + class _EqualKey = equal_to<_Key>, + class _Alloc = allocator<_Tp> > + class hash_multimap + { + // concept requirements + __glibcxx_class_requires(_Key, _SGIAssignableConcept) + __glibcxx_class_requires(_Tp, _SGIAssignableConcept) + __glibcxx_class_requires3(_HashFn, size_t, _Key, _UnaryFunctionConcept) + __glibcxx_class_requires3(_EqualKey, _Key, _Key, _BinaryPredicateConcept) + + private: + typedef hashtable, _Key, _HashFn, + _Select1st >, _EqualKey, _Alloc> + _Ht; + + _Ht _M_ht; + + public: + typedef typename _Ht::key_type key_type; + typedef _Tp data_type; + typedef _Tp mapped_type; + typedef typename _Ht::value_type value_type; + typedef typename _Ht::hasher hasher; + typedef typename _Ht::key_equal key_equal; + + typedef typename _Ht::size_type size_type; + typedef typename _Ht::difference_type difference_type; + typedef typename _Ht::pointer pointer; + typedef typename _Ht::const_pointer const_pointer; + typedef typename _Ht::reference reference; + typedef typename _Ht::const_reference const_reference; + + typedef typename _Ht::iterator iterator; + typedef typename _Ht::const_iterator const_iterator; + + typedef typename _Ht::allocator_type allocator_type; + + hasher + hash_funct() const + { return _M_ht.hash_funct(); } + + key_equal + key_eq() const + { return _M_ht.key_eq(); } + + allocator_type + get_allocator() const + { return _M_ht.get_allocator(); } + + hash_multimap() + : _M_ht(100, hasher(), key_equal(), allocator_type()) {} + + explicit + hash_multimap(size_type __n) + : _M_ht(__n, hasher(), key_equal(), allocator_type()) {} + + hash_multimap(size_type __n, const hasher& __hf) + : _M_ht(__n, __hf, key_equal(), allocator_type()) {} + + hash_multimap(size_type __n, const hasher& __hf, const key_equal& __eql, + const allocator_type& __a = allocator_type()) + : _M_ht(__n, __hf, __eql, __a) {} + + template + hash_multimap(_InputIterator __f, _InputIterator __l) + : _M_ht(100, hasher(), key_equal(), allocator_type()) + { _M_ht.insert_equal(__f, __l); } + + template + hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n) + : _M_ht(__n, hasher(), key_equal(), allocator_type()) + { _M_ht.insert_equal(__f, __l); } + + template + hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n, + const hasher& __hf) + : _M_ht(__n, __hf, key_equal(), allocator_type()) + { _M_ht.insert_equal(__f, __l); } + + template + hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n, + const hasher& __hf, const key_equal& __eql, + const allocator_type& __a = allocator_type()) + : _M_ht(__n, __hf, __eql, __a) + { _M_ht.insert_equal(__f, __l); } + + size_type + size() const + { return _M_ht.size(); } + + size_type + max_size() const + { return _M_ht.max_size(); } + + bool + empty() const + { return _M_ht.empty(); } + + void + swap(hash_multimap& __hs) + { _M_ht.swap(__hs._M_ht); } + + template + friend bool + operator==(const hash_multimap<_K1, _T1, _HF, _EqK, _Al>&, + const hash_multimap<_K1, _T1, _HF, _EqK, _Al>&); + + iterator + begin() + { return _M_ht.begin(); } + + iterator + end() + { return _M_ht.end(); } + + const_iterator + begin() const + { return _M_ht.begin(); } + + const_iterator + end() const + { return _M_ht.end(); } + + iterator + insert(const value_type& __obj) + { return _M_ht.insert_equal(__obj); } + + template + void + insert(_InputIterator __f, _InputIterator __l) + { _M_ht.insert_equal(__f,__l); } + + iterator + insert_noresize(const value_type& __obj) + { return _M_ht.insert_equal_noresize(__obj); } + + iterator + find(const key_type& __key) + { return _M_ht.find(__key); } + + const_iterator + find(const key_type& __key) const + { return _M_ht.find(__key); } + + size_type + count(const key_type& __key) const + { return _M_ht.count(__key); } + + pair + equal_range(const key_type& __key) + { return _M_ht.equal_range(__key); } + + pair + equal_range(const key_type& __key) const + { return _M_ht.equal_range(__key); } + + size_type + erase(const key_type& __key) + { return _M_ht.erase(__key); } + + void + erase(iterator __it) + { _M_ht.erase(__it); } + + void + erase(iterator __f, iterator __l) + { _M_ht.erase(__f, __l); } + + void + clear() + { _M_ht.clear(); } + + void + resize(size_type __hint) + { _M_ht.resize(__hint); } + + size_type + bucket_count() const + { return _M_ht.bucket_count(); } + + size_type + max_bucket_count() const + { return _M_ht.max_bucket_count(); } + + size_type + elems_in_bucket(size_type __n) const + { return _M_ht.elems_in_bucket(__n); } + }; + + template + inline bool + operator==(const hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc>& __hm1, + const hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc>& __hm2) + { return __hm1._M_ht == __hm2._M_ht; } + + template + inline bool + operator!=(const hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc>& __hm1, + const hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc>& __hm2) + { return !(__hm1 == __hm2); } + + template + inline void + swap(hash_multimap<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm1, + hash_multimap<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm2) + { __hm1.swap(__hm2); } + +_GLIBCXX_END_NAMESPACE + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // Specialization of insert_iterator so that it will work for hash_map + // and hash_multimap. + template + class insert_iterator<__gnu_cxx::hash_map<_Key, _Tp, _HashFn, + _EqKey, _Alloc> > + { + protected: + typedef __gnu_cxx::hash_map<_Key, _Tp, _HashFn, _EqKey, _Alloc> + _Container; + _Container* container; + + public: + typedef _Container container_type; + typedef output_iterator_tag iterator_category; + typedef void value_type; + typedef void difference_type; + typedef void pointer; + typedef void reference; + + insert_iterator(_Container& __x) + : container(&__x) {} + + insert_iterator(_Container& __x, typename _Container::iterator) + : container(&__x) {} + + insert_iterator<_Container>& + operator=(const typename _Container::value_type& __value) + { + container->insert(__value); + return *this; + } + + insert_iterator<_Container>& + operator*() + { return *this; } + + insert_iterator<_Container>& + operator++() { return *this; } + + insert_iterator<_Container>& + operator++(int) + { return *this; } + }; + + template + class insert_iterator<__gnu_cxx::hash_multimap<_Key, _Tp, _HashFn, + _EqKey, _Alloc> > + { + protected: + typedef __gnu_cxx::hash_multimap<_Key, _Tp, _HashFn, _EqKey, _Alloc> + _Container; + _Container* container; + typename _Container::iterator iter; + + public: + typedef _Container container_type; + typedef output_iterator_tag iterator_category; + typedef void value_type; + typedef void difference_type; + typedef void pointer; + typedef void reference; + + insert_iterator(_Container& __x) + : container(&__x) {} + + insert_iterator(_Container& __x, typename _Container::iterator) + : container(&__x) {} + + insert_iterator<_Container>& + operator=(const typename _Container::value_type& __value) + { + container->insert(__value); + return *this; + } + + insert_iterator<_Container>& + operator*() + { return *this; } + + insert_iterator<_Container>& + operator++() + { return *this; } + + insert_iterator<_Container>& + operator++(int) + { return *this; } + }; + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/hash_set b/mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/hash_set new file mode 100644 index 00000000..32fa2205 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/hash_set @@ -0,0 +1,558 @@ +// Hashing set implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2004, 2005, 2006, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * Copyright (c) 1996 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + */ + +/** @file backward/hash_set + * This file is a GNU extension to the Standard C++ Library (possibly + * containing extensions from the HP/SGI STL subset). + */ + +#ifndef _HASH_SET +#define _HASH_SET 1 + +#include "backward_warning.h" +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + using std::equal_to; + using std::allocator; + using std::pair; + using std::_Identity; + + /** + * This is an SGI extension. + * @ingroup SGIextensions + * @doctodo + */ + template, + class _EqualKey = equal_to<_Value>, + class _Alloc = allocator<_Value> > + class hash_set + { + // concept requirements + __glibcxx_class_requires(_Value, _SGIAssignableConcept) + __glibcxx_class_requires3(_HashFcn, size_t, _Value, _UnaryFunctionConcept) + __glibcxx_class_requires3(_EqualKey, _Value, _Value, _BinaryPredicateConcept) + + private: + typedef hashtable<_Value, _Value, _HashFcn, _Identity<_Value>, + _EqualKey, _Alloc> _Ht; + _Ht _M_ht; + + public: + typedef typename _Ht::key_type key_type; + typedef typename _Ht::value_type value_type; + typedef typename _Ht::hasher hasher; + typedef typename _Ht::key_equal key_equal; + + typedef typename _Ht::size_type size_type; + typedef typename _Ht::difference_type difference_type; + typedef typename _Alloc::pointer pointer; + typedef typename _Alloc::const_pointer const_pointer; + typedef typename _Alloc::reference reference; + typedef typename _Alloc::const_reference const_reference; + + typedef typename _Ht::const_iterator iterator; + typedef typename _Ht::const_iterator const_iterator; + + typedef typename _Ht::allocator_type allocator_type; + + hasher + hash_funct() const + { return _M_ht.hash_funct(); } + + key_equal + key_eq() const + { return _M_ht.key_eq(); } + + allocator_type + get_allocator() const + { return _M_ht.get_allocator(); } + + hash_set() + : _M_ht(100, hasher(), key_equal(), allocator_type()) {} + + explicit + hash_set(size_type __n) + : _M_ht(__n, hasher(), key_equal(), allocator_type()) {} + + hash_set(size_type __n, const hasher& __hf) + : _M_ht(__n, __hf, key_equal(), allocator_type()) {} + + hash_set(size_type __n, const hasher& __hf, const key_equal& __eql, + const allocator_type& __a = allocator_type()) + : _M_ht(__n, __hf, __eql, __a) {} + + template + hash_set(_InputIterator __f, _InputIterator __l) + : _M_ht(100, hasher(), key_equal(), allocator_type()) + { _M_ht.insert_unique(__f, __l); } + + template + hash_set(_InputIterator __f, _InputIterator __l, size_type __n) + : _M_ht(__n, hasher(), key_equal(), allocator_type()) + { _M_ht.insert_unique(__f, __l); } + + template + hash_set(_InputIterator __f, _InputIterator __l, size_type __n, + const hasher& __hf) + : _M_ht(__n, __hf, key_equal(), allocator_type()) + { _M_ht.insert_unique(__f, __l); } + + template + hash_set(_InputIterator __f, _InputIterator __l, size_type __n, + const hasher& __hf, const key_equal& __eql, + const allocator_type& __a = allocator_type()) + : _M_ht(__n, __hf, __eql, __a) + { _M_ht.insert_unique(__f, __l); } + + size_type + size() const + { return _M_ht.size(); } + + size_type + max_size() const + { return _M_ht.max_size(); } + + bool + empty() const + { return _M_ht.empty(); } + + void + swap(hash_set& __hs) + { _M_ht.swap(__hs._M_ht); } + + template + friend bool + operator==(const hash_set<_Val, _HF, _EqK, _Al>&, + const hash_set<_Val, _HF, _EqK, _Al>&); + + iterator + begin() const + { return _M_ht.begin(); } + + iterator + end() const + { return _M_ht.end(); } + + pair + insert(const value_type& __obj) + { + pair __p = _M_ht.insert_unique(__obj); + return pair(__p.first, __p.second); + } + + template + void + insert(_InputIterator __f, _InputIterator __l) + { _M_ht.insert_unique(__f, __l); } + + pair + insert_noresize(const value_type& __obj) + { + pair __p + = _M_ht.insert_unique_noresize(__obj); + return pair(__p.first, __p.second); + } + + iterator + find(const key_type& __key) const + { return _M_ht.find(__key); } + + size_type + count(const key_type& __key) const + { return _M_ht.count(__key); } + + pair + equal_range(const key_type& __key) const + { return _M_ht.equal_range(__key); } + + size_type + erase(const key_type& __key) + {return _M_ht.erase(__key); } + + void + erase(iterator __it) + { _M_ht.erase(__it); } + + void + erase(iterator __f, iterator __l) + { _M_ht.erase(__f, __l); } + + void + clear() + { _M_ht.clear(); } + + void + resize(size_type __hint) + { _M_ht.resize(__hint); } + + size_type + bucket_count() const + { return _M_ht.bucket_count(); } + + size_type + max_bucket_count() const + { return _M_ht.max_bucket_count(); } + + size_type + elems_in_bucket(size_type __n) const + { return _M_ht.elems_in_bucket(__n); } + }; + + template + inline bool + operator==(const hash_set<_Value, _HashFcn, _EqualKey, _Alloc>& __hs1, + const hash_set<_Value, _HashFcn, _EqualKey, _Alloc>& __hs2) + { return __hs1._M_ht == __hs2._M_ht; } + + template + inline bool + operator!=(const hash_set<_Value, _HashFcn, _EqualKey, _Alloc>& __hs1, + const hash_set<_Value, _HashFcn, _EqualKey, _Alloc>& __hs2) + { return !(__hs1 == __hs2); } + + template + inline void + swap(hash_set<_Val, _HashFcn, _EqualKey, _Alloc>& __hs1, + hash_set<_Val, _HashFcn, _EqualKey, _Alloc>& __hs2) + { __hs1.swap(__hs2); } + + + /** + * This is an SGI extension. + * @ingroup SGIextensions + * @doctodo + */ + template, + class _EqualKey = equal_to<_Value>, + class _Alloc = allocator<_Value> > + class hash_multiset + { + // concept requirements + __glibcxx_class_requires(_Value, _SGIAssignableConcept) + __glibcxx_class_requires3(_HashFcn, size_t, _Value, _UnaryFunctionConcept) + __glibcxx_class_requires3(_EqualKey, _Value, _Value, _BinaryPredicateConcept) + + private: + typedef hashtable<_Value, _Value, _HashFcn, _Identity<_Value>, + _EqualKey, _Alloc> _Ht; + _Ht _M_ht; + + public: + typedef typename _Ht::key_type key_type; + typedef typename _Ht::value_type value_type; + typedef typename _Ht::hasher hasher; + typedef typename _Ht::key_equal key_equal; + + typedef typename _Ht::size_type size_type; + typedef typename _Ht::difference_type difference_type; + typedef typename _Alloc::pointer pointer; + typedef typename _Alloc::const_pointer const_pointer; + typedef typename _Alloc::reference reference; + typedef typename _Alloc::const_reference const_reference; + + typedef typename _Ht::const_iterator iterator; + typedef typename _Ht::const_iterator const_iterator; + + typedef typename _Ht::allocator_type allocator_type; + + hasher + hash_funct() const + { return _M_ht.hash_funct(); } + + key_equal + key_eq() const + { return _M_ht.key_eq(); } + + allocator_type + get_allocator() const + { return _M_ht.get_allocator(); } + + hash_multiset() + : _M_ht(100, hasher(), key_equal(), allocator_type()) {} + + explicit + hash_multiset(size_type __n) + : _M_ht(__n, hasher(), key_equal(), allocator_type()) {} + + hash_multiset(size_type __n, const hasher& __hf) + : _M_ht(__n, __hf, key_equal(), allocator_type()) {} + + hash_multiset(size_type __n, const hasher& __hf, const key_equal& __eql, + const allocator_type& __a = allocator_type()) + : _M_ht(__n, __hf, __eql, __a) {} + + template + hash_multiset(_InputIterator __f, _InputIterator __l) + : _M_ht(100, hasher(), key_equal(), allocator_type()) + { _M_ht.insert_equal(__f, __l); } + + template + hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n) + : _M_ht(__n, hasher(), key_equal(), allocator_type()) + { _M_ht.insert_equal(__f, __l); } + + template + hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n, + const hasher& __hf) + : _M_ht(__n, __hf, key_equal(), allocator_type()) + { _M_ht.insert_equal(__f, __l); } + + template + hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n, + const hasher& __hf, const key_equal& __eql, + const allocator_type& __a = allocator_type()) + : _M_ht(__n, __hf, __eql, __a) + { _M_ht.insert_equal(__f, __l); } + + size_type + size() const + { return _M_ht.size(); } + + size_type + max_size() const + { return _M_ht.max_size(); } + + bool + empty() const + { return _M_ht.empty(); } + + void + swap(hash_multiset& hs) + { _M_ht.swap(hs._M_ht); } + + template + friend bool + operator==(const hash_multiset<_Val, _HF, _EqK, _Al>&, + const hash_multiset<_Val, _HF, _EqK, _Al>&); + + iterator + begin() const + { return _M_ht.begin(); } + + iterator + end() const + { return _M_ht.end(); } + + iterator + insert(const value_type& __obj) + { return _M_ht.insert_equal(__obj); } + + template + void + insert(_InputIterator __f, _InputIterator __l) + { _M_ht.insert_equal(__f,__l); } + + iterator + insert_noresize(const value_type& __obj) + { return _M_ht.insert_equal_noresize(__obj); } + + iterator + find(const key_type& __key) const + { return _M_ht.find(__key); } + + size_type + count(const key_type& __key) const + { return _M_ht.count(__key); } + + pair + equal_range(const key_type& __key) const + { return _M_ht.equal_range(__key); } + + size_type + erase(const key_type& __key) + { return _M_ht.erase(__key); } + + void + erase(iterator __it) + { _M_ht.erase(__it); } + + void + erase(iterator __f, iterator __l) + { _M_ht.erase(__f, __l); } + + void + clear() + { _M_ht.clear(); } + + void + resize(size_type __hint) + { _M_ht.resize(__hint); } + + size_type + bucket_count() const + { return _M_ht.bucket_count(); } + + size_type + max_bucket_count() const + { return _M_ht.max_bucket_count(); } + + size_type + elems_in_bucket(size_type __n) const + { return _M_ht.elems_in_bucket(__n); } + }; + + template + inline bool + operator==(const hash_multiset<_Val, _HashFcn, _EqualKey, _Alloc>& __hs1, + const hash_multiset<_Val, _HashFcn, _EqualKey, _Alloc>& __hs2) + { return __hs1._M_ht == __hs2._M_ht; } + + template + inline bool + operator!=(const hash_multiset<_Val, _HashFcn, _EqualKey, _Alloc>& __hs1, + const hash_multiset<_Val, _HashFcn, _EqualKey, _Alloc>& __hs2) + { return !(__hs1 == __hs2); } + + template + inline void + swap(hash_multiset<_Val, _HashFcn, _EqualKey, _Alloc>& __hs1, + hash_multiset<_Val, _HashFcn, _EqualKey, _Alloc>& __hs2) + { __hs1.swap(__hs2); } + +_GLIBCXX_END_NAMESPACE + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // Specialization of insert_iterator so that it will work for hash_set + // and hash_multiset. + template + class insert_iterator<__gnu_cxx::hash_set<_Value, _HashFcn, + _EqualKey, _Alloc> > + { + protected: + typedef __gnu_cxx::hash_set<_Value, _HashFcn, _EqualKey, _Alloc> + _Container; + _Container* container; + + public: + typedef _Container container_type; + typedef output_iterator_tag iterator_category; + typedef void value_type; + typedef void difference_type; + typedef void pointer; + typedef void reference; + + insert_iterator(_Container& __x) + : container(&__x) {} + + insert_iterator(_Container& __x, typename _Container::iterator) + : container(&__x) {} + + insert_iterator<_Container>& + operator=(const typename _Container::value_type& __value) + { + container->insert(__value); + return *this; + } + + insert_iterator<_Container>& + operator*() + { return *this; } + + insert_iterator<_Container>& + operator++() + { return *this; } + + insert_iterator<_Container>& + operator++(int) + { return *this; } + }; + + template + class insert_iterator<__gnu_cxx::hash_multiset<_Value, _HashFcn, + _EqualKey, _Alloc> > + { + protected: + typedef __gnu_cxx::hash_multiset<_Value, _HashFcn, _EqualKey, _Alloc> + _Container; + _Container* container; + typename _Container::iterator iter; + + public: + typedef _Container container_type; + typedef output_iterator_tag iterator_category; + typedef void value_type; + typedef void difference_type; + typedef void pointer; + typedef void reference; + + insert_iterator(_Container& __x) + : container(&__x) {} + + insert_iterator(_Container& __x, typename _Container::iterator) + : container(&__x) {} + + insert_iterator<_Container>& + operator=(const typename _Container::value_type& __value) + { + container->insert(__value); + return *this; + } + + insert_iterator<_Container>& + operator*() + { return *this; } + + insert_iterator<_Container>& + operator++() + { return *this; } + + insert_iterator<_Container>& + operator++(int) { return *this; } + }; + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/hashtable.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/hashtable.h new file mode 100644 index 00000000..70edbd22 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/hashtable.h @@ -0,0 +1,1125 @@ +// Hashtable implementation used by containers -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + */ + +/** @file backward/hashtable.h + * This file is a GNU extension to the Standard C++ Library (possibly + * containing extensions from the HP/SGI STL subset). + */ + +#ifndef _HASHTABLE_H +#define _HASHTABLE_H 1 + +// Hashtable class, used to implement the hashed associative containers +// hash_set, hash_map, hash_multiset, and hash_multimap. + +#include +#include +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + using std::size_t; + using std::ptrdiff_t; + using std::forward_iterator_tag; + using std::input_iterator_tag; + using std::_Construct; + using std::_Destroy; + using std::distance; + using std::vector; + using std::pair; + using std::__iterator_category; + + template + struct _Hashtable_node + { + _Hashtable_node* _M_next; + _Val _M_val; + }; + + template > + class hashtable; + + template + struct _Hashtable_iterator; + + template + struct _Hashtable_const_iterator; + + template + struct _Hashtable_iterator + { + typedef hashtable<_Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc> + _Hashtable; + typedef _Hashtable_iterator<_Val, _Key, _HashFcn, + _ExtractKey, _EqualKey, _Alloc> + iterator; + typedef _Hashtable_const_iterator<_Val, _Key, _HashFcn, + _ExtractKey, _EqualKey, _Alloc> + const_iterator; + typedef _Hashtable_node<_Val> _Node; + typedef forward_iterator_tag iterator_category; + typedef _Val value_type; + typedef ptrdiff_t difference_type; + typedef size_t size_type; + typedef _Val& reference; + typedef _Val* pointer; + + _Node* _M_cur; + _Hashtable* _M_ht; + + _Hashtable_iterator(_Node* __n, _Hashtable* __tab) + : _M_cur(__n), _M_ht(__tab) { } + + _Hashtable_iterator() { } + + reference + operator*() const + { return _M_cur->_M_val; } + + pointer + operator->() const + { return &(operator*()); } + + iterator& + operator++(); + + iterator + operator++(int); + + bool + operator==(const iterator& __it) const + { return _M_cur == __it._M_cur; } + + bool + operator!=(const iterator& __it) const + { return _M_cur != __it._M_cur; } + }; + + template + struct _Hashtable_const_iterator + { + typedef hashtable<_Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc> + _Hashtable; + typedef _Hashtable_iterator<_Val,_Key,_HashFcn, + _ExtractKey,_EqualKey,_Alloc> + iterator; + typedef _Hashtable_const_iterator<_Val, _Key, _HashFcn, + _ExtractKey, _EqualKey, _Alloc> + const_iterator; + typedef _Hashtable_node<_Val> _Node; + + typedef forward_iterator_tag iterator_category; + typedef _Val value_type; + typedef ptrdiff_t difference_type; + typedef size_t size_type; + typedef const _Val& reference; + typedef const _Val* pointer; + + const _Node* _M_cur; + const _Hashtable* _M_ht; + + _Hashtable_const_iterator(const _Node* __n, const _Hashtable* __tab) + : _M_cur(__n), _M_ht(__tab) { } + + _Hashtable_const_iterator() { } + + _Hashtable_const_iterator(const iterator& __it) + : _M_cur(__it._M_cur), _M_ht(__it._M_ht) { } + + reference + operator*() const + { return _M_cur->_M_val; } + + pointer + operator->() const + { return &(operator*()); } + + const_iterator& + operator++(); + + const_iterator + operator++(int); + + bool + operator==(const const_iterator& __it) const + { return _M_cur == __it._M_cur; } + + bool + operator!=(const const_iterator& __it) const + { return _M_cur != __it._M_cur; } + }; + + // Note: assumes long is at least 32 bits. + enum { _S_num_primes = 28 }; + + static const unsigned long __stl_prime_list[_S_num_primes] = + { + 53ul, 97ul, 193ul, 389ul, 769ul, + 1543ul, 3079ul, 6151ul, 12289ul, 24593ul, + 49157ul, 98317ul, 196613ul, 393241ul, 786433ul, + 1572869ul, 3145739ul, 6291469ul, 12582917ul, 25165843ul, + 50331653ul, 100663319ul, 201326611ul, 402653189ul, 805306457ul, + 1610612741ul, 3221225473ul, 4294967291ul + }; + + inline unsigned long + __stl_next_prime(unsigned long __n) + { + const unsigned long* __first = __stl_prime_list; + const unsigned long* __last = __stl_prime_list + (int)_S_num_primes; + const unsigned long* pos = std::lower_bound(__first, __last, __n); + return pos == __last ? *(__last - 1) : *pos; + } + + // Forward declaration of operator==. + template + class hashtable; + + template + bool + operator==(const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht1, + const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht2); + + // Hashtables handle allocators a bit differently than other + // containers do. If we're using standard-conforming allocators, then + // a hashtable unconditionally has a member variable to hold its + // allocator, even if it so happens that all instances of the + // allocator type are identical. This is because, for hashtables, + // this extra storage is negligible. Additionally, a base class + // wouldn't serve any other purposes; it wouldn't, for example, + // simplify the exception-handling code. + template + class hashtable + { + public: + typedef _Key key_type; + typedef _Val value_type; + typedef _HashFcn hasher; + typedef _EqualKey key_equal; + + typedef size_t size_type; + typedef ptrdiff_t difference_type; + typedef value_type* pointer; + typedef const value_type* const_pointer; + typedef value_type& reference; + typedef const value_type& const_reference; + + hasher + hash_funct() const + { return _M_hash; } + + key_equal + key_eq() const + { return _M_equals; } + + private: + typedef _Hashtable_node<_Val> _Node; + + public: + typedef typename _Alloc::template rebind::other allocator_type; + allocator_type + get_allocator() const + { return _M_node_allocator; } + + private: + typedef typename _Alloc::template rebind<_Node>::other _Node_Alloc; + typedef typename _Alloc::template rebind<_Node*>::other _Nodeptr_Alloc; + typedef vector<_Node*, _Nodeptr_Alloc> _Vector_type; + + _Node_Alloc _M_node_allocator; + + _Node* + _M_get_node() + { return _M_node_allocator.allocate(1); } + + void + _M_put_node(_Node* __p) + { _M_node_allocator.deallocate(__p, 1); } + + private: + hasher _M_hash; + key_equal _M_equals; + _ExtractKey _M_get_key; + _Vector_type _M_buckets; + size_type _M_num_elements; + + public: + typedef _Hashtable_iterator<_Val, _Key, _HashFcn, _ExtractKey, + _EqualKey, _Alloc> + iterator; + typedef _Hashtable_const_iterator<_Val, _Key, _HashFcn, _ExtractKey, + _EqualKey, _Alloc> + const_iterator; + + friend struct + _Hashtable_iterator<_Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc>; + + friend struct + _Hashtable_const_iterator<_Val, _Key, _HashFcn, _ExtractKey, + _EqualKey, _Alloc>; + + public: + hashtable(size_type __n, const _HashFcn& __hf, + const _EqualKey& __eql, const _ExtractKey& __ext, + const allocator_type& __a = allocator_type()) + : _M_node_allocator(__a), _M_hash(__hf), _M_equals(__eql), + _M_get_key(__ext), _M_buckets(__a), _M_num_elements(0) + { _M_initialize_buckets(__n); } + + hashtable(size_type __n, const _HashFcn& __hf, + const _EqualKey& __eql, + const allocator_type& __a = allocator_type()) + : _M_node_allocator(__a), _M_hash(__hf), _M_equals(__eql), + _M_get_key(_ExtractKey()), _M_buckets(__a), _M_num_elements(0) + { _M_initialize_buckets(__n); } + + hashtable(const hashtable& __ht) + : _M_node_allocator(__ht.get_allocator()), _M_hash(__ht._M_hash), + _M_equals(__ht._M_equals), _M_get_key(__ht._M_get_key), + _M_buckets(__ht.get_allocator()), _M_num_elements(0) + { _M_copy_from(__ht); } + + hashtable& + operator= (const hashtable& __ht) + { + if (&__ht != this) + { + clear(); + _M_hash = __ht._M_hash; + _M_equals = __ht._M_equals; + _M_get_key = __ht._M_get_key; + _M_copy_from(__ht); + } + return *this; + } + + ~hashtable() + { clear(); } + + size_type + size() const + { return _M_num_elements; } + + size_type + max_size() const + { return size_type(-1); } + + bool + empty() const + { return size() == 0; } + + void + swap(hashtable& __ht) + { + std::swap(_M_hash, __ht._M_hash); + std::swap(_M_equals, __ht._M_equals); + std::swap(_M_get_key, __ht._M_get_key); + _M_buckets.swap(__ht._M_buckets); + std::swap(_M_num_elements, __ht._M_num_elements); + } + + iterator + begin() + { + for (size_type __n = 0; __n < _M_buckets.size(); ++__n) + if (_M_buckets[__n]) + return iterator(_M_buckets[__n], this); + return end(); + } + + iterator + end() + { return iterator(0, this); } + + const_iterator + begin() const + { + for (size_type __n = 0; __n < _M_buckets.size(); ++__n) + if (_M_buckets[__n]) + return const_iterator(_M_buckets[__n], this); + return end(); + } + + const_iterator + end() const + { return const_iterator(0, this); } + + template + friend bool + operator==(const hashtable<_Vl, _Ky, _HF, _Ex, _Eq, _Al>&, + const hashtable<_Vl, _Ky, _HF, _Ex, _Eq, _Al>&); + + public: + size_type + bucket_count() const + { return _M_buckets.size(); } + + size_type + max_bucket_count() const + { return __stl_prime_list[(int)_S_num_primes - 1]; } + + size_type + elems_in_bucket(size_type __bucket) const + { + size_type __result = 0; + for (_Node* __n = _M_buckets[__bucket]; __n; __n = __n->_M_next) + __result += 1; + return __result; + } + + pair + insert_unique(const value_type& __obj) + { + resize(_M_num_elements + 1); + return insert_unique_noresize(__obj); + } + + iterator + insert_equal(const value_type& __obj) + { + resize(_M_num_elements + 1); + return insert_equal_noresize(__obj); + } + + pair + insert_unique_noresize(const value_type& __obj); + + iterator + insert_equal_noresize(const value_type& __obj); + + template + void + insert_unique(_InputIterator __f, _InputIterator __l) + { insert_unique(__f, __l, __iterator_category(__f)); } + + template + void + insert_equal(_InputIterator __f, _InputIterator __l) + { insert_equal(__f, __l, __iterator_category(__f)); } + + template + void + insert_unique(_InputIterator __f, _InputIterator __l, + input_iterator_tag) + { + for ( ; __f != __l; ++__f) + insert_unique(*__f); + } + + template + void + insert_equal(_InputIterator __f, _InputIterator __l, + input_iterator_tag) + { + for ( ; __f != __l; ++__f) + insert_equal(*__f); + } + + template + void + insert_unique(_ForwardIterator __f, _ForwardIterator __l, + forward_iterator_tag) + { + size_type __n = distance(__f, __l); + resize(_M_num_elements + __n); + for ( ; __n > 0; --__n, ++__f) + insert_unique_noresize(*__f); + } + + template + void + insert_equal(_ForwardIterator __f, _ForwardIterator __l, + forward_iterator_tag) + { + size_type __n = distance(__f, __l); + resize(_M_num_elements + __n); + for ( ; __n > 0; --__n, ++__f) + insert_equal_noresize(*__f); + } + + reference + find_or_insert(const value_type& __obj); + + iterator + find(const key_type& __key) + { + size_type __n = _M_bkt_num_key(__key); + _Node* __first; + for (__first = _M_buckets[__n]; + __first && !_M_equals(_M_get_key(__first->_M_val), __key); + __first = __first->_M_next) + { } + return iterator(__first, this); + } + + const_iterator + find(const key_type& __key) const + { + size_type __n = _M_bkt_num_key(__key); + const _Node* __first; + for (__first = _M_buckets[__n]; + __first && !_M_equals(_M_get_key(__first->_M_val), __key); + __first = __first->_M_next) + { } + return const_iterator(__first, this); + } + + size_type + count(const key_type& __key) const + { + const size_type __n = _M_bkt_num_key(__key); + size_type __result = 0; + + for (const _Node* __cur = _M_buckets[__n]; __cur; + __cur = __cur->_M_next) + if (_M_equals(_M_get_key(__cur->_M_val), __key)) + ++__result; + return __result; + } + + pair + equal_range(const key_type& __key); + + pair + equal_range(const key_type& __key) const; + + size_type + erase(const key_type& __key); + + void + erase(const iterator& __it); + + void + erase(iterator __first, iterator __last); + + void + erase(const const_iterator& __it); + + void + erase(const_iterator __first, const_iterator __last); + + void + resize(size_type __num_elements_hint); + + void + clear(); + + private: + size_type + _M_next_size(size_type __n) const + { return __stl_next_prime(__n); } + + void + _M_initialize_buckets(size_type __n) + { + const size_type __n_buckets = _M_next_size(__n); + _M_buckets.reserve(__n_buckets); + _M_buckets.insert(_M_buckets.end(), __n_buckets, (_Node*) 0); + _M_num_elements = 0; + } + + size_type + _M_bkt_num_key(const key_type& __key) const + { return _M_bkt_num_key(__key, _M_buckets.size()); } + + size_type + _M_bkt_num(const value_type& __obj) const + { return _M_bkt_num_key(_M_get_key(__obj)); } + + size_type + _M_bkt_num_key(const key_type& __key, size_t __n) const + { return _M_hash(__key) % __n; } + + size_type + _M_bkt_num(const value_type& __obj, size_t __n) const + { return _M_bkt_num_key(_M_get_key(__obj), __n); } + + _Node* + _M_new_node(const value_type& __obj) + { + _Node* __n = _M_get_node(); + __n->_M_next = 0; + __try + { + this->get_allocator().construct(&__n->_M_val, __obj); + return __n; + } + __catch(...) + { + _M_put_node(__n); + __throw_exception_again; + } + } + + void + _M_delete_node(_Node* __n) + { + this->get_allocator().destroy(&__n->_M_val); + _M_put_node(__n); + } + + void + _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last); + + void + _M_erase_bucket(const size_type __n, _Node* __last); + + void + _M_copy_from(const hashtable& __ht); + }; + + template + _Hashtable_iterator<_Val, _Key, _HF, _ExK, _EqK, _All>& + _Hashtable_iterator<_Val, _Key, _HF, _ExK, _EqK, _All>:: + operator++() + { + const _Node* __old = _M_cur; + _M_cur = _M_cur->_M_next; + if (!_M_cur) + { + size_type __bucket = _M_ht->_M_bkt_num(__old->_M_val); + while (!_M_cur && ++__bucket < _M_ht->_M_buckets.size()) + _M_cur = _M_ht->_M_buckets[__bucket]; + } + return *this; + } + + template + inline _Hashtable_iterator<_Val, _Key, _HF, _ExK, _EqK, _All> + _Hashtable_iterator<_Val, _Key, _HF, _ExK, _EqK, _All>:: + operator++(int) + { + iterator __tmp = *this; + ++*this; + return __tmp; + } + + template + _Hashtable_const_iterator<_Val, _Key, _HF, _ExK, _EqK, _All>& + _Hashtable_const_iterator<_Val, _Key, _HF, _ExK, _EqK, _All>:: + operator++() + { + const _Node* __old = _M_cur; + _M_cur = _M_cur->_M_next; + if (!_M_cur) + { + size_type __bucket = _M_ht->_M_bkt_num(__old->_M_val); + while (!_M_cur && ++__bucket < _M_ht->_M_buckets.size()) + _M_cur = _M_ht->_M_buckets[__bucket]; + } + return *this; + } + + template + inline _Hashtable_const_iterator<_Val, _Key, _HF, _ExK, _EqK, _All> + _Hashtable_const_iterator<_Val, _Key, _HF, _ExK, _EqK, _All>:: + operator++(int) + { + const_iterator __tmp = *this; + ++*this; + return __tmp; + } + + template + bool + operator==(const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht1, + const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht2) + { + typedef typename hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>::_Node _Node; + + if (__ht1._M_buckets.size() != __ht2._M_buckets.size()) + return false; + + for (size_t __n = 0; __n < __ht1._M_buckets.size(); ++__n) + { + _Node* __cur1 = __ht1._M_buckets[__n]; + _Node* __cur2 = __ht2._M_buckets[__n]; + // Check same length of lists + for (; __cur1 && __cur2; + __cur1 = __cur1->_M_next, __cur2 = __cur2->_M_next) + { } + if (__cur1 || __cur2) + return false; + // Now check one's elements are in the other + for (__cur1 = __ht1._M_buckets[__n] ; __cur1; + __cur1 = __cur1->_M_next) + { + bool _found__cur1 = false; + for (__cur2 = __ht2._M_buckets[__n]; + __cur2; __cur2 = __cur2->_M_next) + { + if (__cur1->_M_val == __cur2->_M_val) + { + _found__cur1 = true; + break; + } + } + if (!_found__cur1) + return false; + } + } + return true; + } + + template + inline bool + operator!=(const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht1, + const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht2) + { return !(__ht1 == __ht2); } + + template + inline void + swap(hashtable<_Val, _Key, _HF, _Extract, _EqKey, _All>& __ht1, + hashtable<_Val, _Key, _HF, _Extract, _EqKey, _All>& __ht2) + { __ht1.swap(__ht2); } + + template + pair::iterator, bool> + hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>:: + insert_unique_noresize(const value_type& __obj) + { + const size_type __n = _M_bkt_num(__obj); + _Node* __first = _M_buckets[__n]; + + for (_Node* __cur = __first; __cur; __cur = __cur->_M_next) + if (_M_equals(_M_get_key(__cur->_M_val), _M_get_key(__obj))) + return pair(iterator(__cur, this), false); + + _Node* __tmp = _M_new_node(__obj); + __tmp->_M_next = __first; + _M_buckets[__n] = __tmp; + ++_M_num_elements; + return pair(iterator(__tmp, this), true); + } + + template + typename hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>::iterator + hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>:: + insert_equal_noresize(const value_type& __obj) + { + const size_type __n = _M_bkt_num(__obj); + _Node* __first = _M_buckets[__n]; + + for (_Node* __cur = __first; __cur; __cur = __cur->_M_next) + if (_M_equals(_M_get_key(__cur->_M_val), _M_get_key(__obj))) + { + _Node* __tmp = _M_new_node(__obj); + __tmp->_M_next = __cur->_M_next; + __cur->_M_next = __tmp; + ++_M_num_elements; + return iterator(__tmp, this); + } + + _Node* __tmp = _M_new_node(__obj); + __tmp->_M_next = __first; + _M_buckets[__n] = __tmp; + ++_M_num_elements; + return iterator(__tmp, this); + } + + template + typename hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>::reference + hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>:: + find_or_insert(const value_type& __obj) + { + resize(_M_num_elements + 1); + + size_type __n = _M_bkt_num(__obj); + _Node* __first = _M_buckets[__n]; + + for (_Node* __cur = __first; __cur; __cur = __cur->_M_next) + if (_M_equals(_M_get_key(__cur->_M_val), _M_get_key(__obj))) + return __cur->_M_val; + + _Node* __tmp = _M_new_node(__obj); + __tmp->_M_next = __first; + _M_buckets[__n] = __tmp; + ++_M_num_elements; + return __tmp->_M_val; + } + + template + pair::iterator, + typename hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>::iterator> + hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>:: + equal_range(const key_type& __key) + { + typedef pair _Pii; + const size_type __n = _M_bkt_num_key(__key); + + for (_Node* __first = _M_buckets[__n]; __first; + __first = __first->_M_next) + if (_M_equals(_M_get_key(__first->_M_val), __key)) + { + for (_Node* __cur = __first->_M_next; __cur; + __cur = __cur->_M_next) + if (!_M_equals(_M_get_key(__cur->_M_val), __key)) + return _Pii(iterator(__first, this), iterator(__cur, this)); + for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m) + if (_M_buckets[__m]) + return _Pii(iterator(__first, this), + iterator(_M_buckets[__m], this)); + return _Pii(iterator(__first, this), end()); + } + return _Pii(end(), end()); + } + + template + pair::const_iterator, + typename hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>::const_iterator> + hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>:: + equal_range(const key_type& __key) const + { + typedef pair _Pii; + const size_type __n = _M_bkt_num_key(__key); + + for (const _Node* __first = _M_buckets[__n]; __first; + __first = __first->_M_next) + { + if (_M_equals(_M_get_key(__first->_M_val), __key)) + { + for (const _Node* __cur = __first->_M_next; __cur; + __cur = __cur->_M_next) + if (!_M_equals(_M_get_key(__cur->_M_val), __key)) + return _Pii(const_iterator(__first, this), + const_iterator(__cur, this)); + for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m) + if (_M_buckets[__m]) + return _Pii(const_iterator(__first, this), + const_iterator(_M_buckets[__m], this)); + return _Pii(const_iterator(__first, this), end()); + } + } + return _Pii(end(), end()); + } + + template + typename hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>::size_type + hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>:: + erase(const key_type& __key) + { + const size_type __n = _M_bkt_num_key(__key); + _Node* __first = _M_buckets[__n]; + size_type __erased = 0; + + if (__first) + { + _Node* __cur = __first; + _Node* __next = __cur->_M_next; + while (__next) + { + if (_M_equals(_M_get_key(__next->_M_val), __key)) + { + __cur->_M_next = __next->_M_next; + _M_delete_node(__next); + __next = __cur->_M_next; + ++__erased; + --_M_num_elements; + } + else + { + __cur = __next; + __next = __cur->_M_next; + } + } + if (_M_equals(_M_get_key(__first->_M_val), __key)) + { + _M_buckets[__n] = __first->_M_next; + _M_delete_node(__first); + ++__erased; + --_M_num_elements; + } + } + return __erased; + } + + template + void hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>:: + erase(const iterator& __it) + { + _Node* __p = __it._M_cur; + if (__p) + { + const size_type __n = _M_bkt_num(__p->_M_val); + _Node* __cur = _M_buckets[__n]; + + if (__cur == __p) + { + _M_buckets[__n] = __cur->_M_next; + _M_delete_node(__cur); + --_M_num_elements; + } + else + { + _Node* __next = __cur->_M_next; + while (__next) + { + if (__next == __p) + { + __cur->_M_next = __next->_M_next; + _M_delete_node(__next); + --_M_num_elements; + break; + } + else + { + __cur = __next; + __next = __cur->_M_next; + } + } + } + } + } + + template + void + hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>:: + erase(iterator __first, iterator __last) + { + size_type __f_bucket = __first._M_cur ? _M_bkt_num(__first._M_cur->_M_val) + : _M_buckets.size(); + + size_type __l_bucket = __last._M_cur ? _M_bkt_num(__last._M_cur->_M_val) + : _M_buckets.size(); + + if (__first._M_cur == __last._M_cur) + return; + else if (__f_bucket == __l_bucket) + _M_erase_bucket(__f_bucket, __first._M_cur, __last._M_cur); + else + { + _M_erase_bucket(__f_bucket, __first._M_cur, 0); + for (size_type __n = __f_bucket + 1; __n < __l_bucket; ++__n) + _M_erase_bucket(__n, 0); + if (__l_bucket != _M_buckets.size()) + _M_erase_bucket(__l_bucket, __last._M_cur); + } + } + + template + inline void + hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>:: + erase(const_iterator __first, const_iterator __last) + { + erase(iterator(const_cast<_Node*>(__first._M_cur), + const_cast(__first._M_ht)), + iterator(const_cast<_Node*>(__last._M_cur), + const_cast(__last._M_ht))); + } + + template + inline void + hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>:: + erase(const const_iterator& __it) + { erase(iterator(const_cast<_Node*>(__it._M_cur), + const_cast(__it._M_ht))); } + + template + void + hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>:: + resize(size_type __num_elements_hint) + { + const size_type __old_n = _M_buckets.size(); + if (__num_elements_hint > __old_n) + { + const size_type __n = _M_next_size(__num_elements_hint); + if (__n > __old_n) + { + _Vector_type __tmp(__n, (_Node*)(0), _M_buckets.get_allocator()); + __try + { + for (size_type __bucket = 0; __bucket < __old_n; ++__bucket) + { + _Node* __first = _M_buckets[__bucket]; + while (__first) + { + size_type __new_bucket = _M_bkt_num(__first->_M_val, + __n); + _M_buckets[__bucket] = __first->_M_next; + __first->_M_next = __tmp[__new_bucket]; + __tmp[__new_bucket] = __first; + __first = _M_buckets[__bucket]; + } + } + _M_buckets.swap(__tmp); + } + __catch(...) + { + for (size_type __bucket = 0; __bucket < __tmp.size(); + ++__bucket) + { + while (__tmp[__bucket]) + { + _Node* __next = __tmp[__bucket]->_M_next; + _M_delete_node(__tmp[__bucket]); + __tmp[__bucket] = __next; + } + } + __throw_exception_again; + } + } + } + } + + template + void + hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>:: + _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last) + { + _Node* __cur = _M_buckets[__n]; + if (__cur == __first) + _M_erase_bucket(__n, __last); + else + { + _Node* __next; + for (__next = __cur->_M_next; + __next != __first; + __cur = __next, __next = __cur->_M_next) + ; + while (__next != __last) + { + __cur->_M_next = __next->_M_next; + _M_delete_node(__next); + __next = __cur->_M_next; + --_M_num_elements; + } + } + } + + template + void + hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>:: + _M_erase_bucket(const size_type __n, _Node* __last) + { + _Node* __cur = _M_buckets[__n]; + while (__cur != __last) + { + _Node* __next = __cur->_M_next; + _M_delete_node(__cur); + __cur = __next; + _M_buckets[__n] = __cur; + --_M_num_elements; + } + } + + template + void + hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>:: + clear() + { + for (size_type __i = 0; __i < _M_buckets.size(); ++__i) + { + _Node* __cur = _M_buckets[__i]; + while (__cur != 0) + { + _Node* __next = __cur->_M_next; + _M_delete_node(__cur); + __cur = __next; + } + _M_buckets[__i] = 0; + } + _M_num_elements = 0; + } + + template + void + hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>:: + _M_copy_from(const hashtable& __ht) + { + _M_buckets.clear(); + _M_buckets.reserve(__ht._M_buckets.size()); + _M_buckets.insert(_M_buckets.end(), __ht._M_buckets.size(), (_Node*) 0); + __try + { + for (size_type __i = 0; __i < __ht._M_buckets.size(); ++__i) { + const _Node* __cur = __ht._M_buckets[__i]; + if (__cur) + { + _Node* __local_copy = _M_new_node(__cur->_M_val); + _M_buckets[__i] = __local_copy; + + for (_Node* __next = __cur->_M_next; + __next; + __cur = __next, __next = __cur->_M_next) + { + __local_copy->_M_next = _M_new_node(__next->_M_val); + __local_copy = __local_copy->_M_next; + } + } + } + _M_num_elements = __ht._M_num_elements; + } + __catch(...) + { + clear(); + __throw_exception_again; + } + } + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/strstream b/mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/strstream new file mode 100644 index 00000000..a643e8b8 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/backward/strstream @@ -0,0 +1,176 @@ +// Backward-compat support -*- C++ -*- + +// Copyright (C) 2001, 2002, 2004, 2005, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * Copyright (c) 1998 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +// WARNING: The classes defined in this header are DEPRECATED. This +// header is defined in section D.7.1 of the C++ standard, and it +// MAY BE REMOVED in a future standard revision. One should use the +// header instead. + +#ifndef _GLIBCXX_STRSTREAM +#define _GLIBCXX_STRSTREAM + +#include "backward_warning.h" +#include +#include +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // Class strstreambuf, a streambuf class that manages an array of char. + // Note that this class is not a template. + class strstreambuf : public basic_streambuf > + { + public: + // Types. + typedef char_traits _Traits; + typedef basic_streambuf _Base; + + public: + // Constructor, destructor + explicit strstreambuf(streamsize __initial_capacity = 0); + strstreambuf(void* (*__alloc)(size_t), void (*__free)(void*)); + + strstreambuf(char* __get, streamsize __n, char* __put = 0); + strstreambuf(signed char* __get, streamsize __n, signed char* __put = 0); + strstreambuf(unsigned char* __get, streamsize __n, unsigned char* __put=0); + + strstreambuf(const char* __get, streamsize __n); + strstreambuf(const signed char* __get, streamsize __n); + strstreambuf(const unsigned char* __get, streamsize __n); + + virtual ~strstreambuf(); + + public: + void freeze(bool = true); + char* str(); + int pcount() const; + + protected: + virtual int_type overflow(int_type __c = _Traits::eof()); + virtual int_type pbackfail(int_type __c = _Traits::eof()); + virtual int_type underflow(); + virtual _Base* setbuf(char* __buf, streamsize __n); + virtual pos_type seekoff(off_type __off, ios_base::seekdir __dir, + ios_base::openmode __mode + = ios_base::in | ios_base::out); + virtual pos_type seekpos(pos_type __pos, ios_base::openmode __mode + = ios_base::in | ios_base::out); + + private: + strstreambuf& + operator=(const strstreambuf&); + + strstreambuf(const strstreambuf&); + + // Dynamic allocation, possibly using _M_alloc_fun and _M_free_fun. + char* _M_alloc(size_t); + void _M_free(char*); + + // Helper function used in constructors. + void _M_setup(char* __get, char* __put, streamsize __n); + + private: + // Data members. + void* (*_M_alloc_fun)(size_t); + void (*_M_free_fun)(void*); + + bool _M_dynamic : 1; + bool _M_frozen : 1; + bool _M_constant : 1; + }; + + // Class istrstream, an istream that manages a strstreambuf. + class istrstream : public basic_istream + { + public: + explicit istrstream(char*); + explicit istrstream(const char*); + istrstream(char* , streamsize); + istrstream(const char*, streamsize); + virtual ~istrstream(); + + strstreambuf* rdbuf() const; + char* str(); + + private: + strstreambuf _M_buf; + }; + + // Class ostrstream + class ostrstream : public basic_ostream + { + public: + ostrstream(); + ostrstream(char*, int, ios_base::openmode = ios_base::out); + virtual ~ostrstream(); + + strstreambuf* rdbuf() const; + void freeze(bool = true); + char* str(); + int pcount() const; + + private: + strstreambuf _M_buf; + }; + + // Class strstream + class strstream : public basic_iostream + { + public: + typedef char char_type; + typedef char_traits::int_type int_type; + typedef char_traits::pos_type pos_type; + typedef char_traits::off_type off_type; + + strstream(); + strstream(char*, int, ios_base::openmode = ios_base::in | ios_base::out); + virtual ~strstream(); + + strstreambuf* rdbuf() const; + void freeze(bool = true); + int pcount() const; + char* str(); + + private: + strstreambuf _M_buf; + }; + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/algorithmfwd.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/algorithmfwd.h new file mode 100644 index 00000000..e33a14c3 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/algorithmfwd.h @@ -0,0 +1,805 @@ +// declarations -*- C++ -*- + +// Copyright (C) 2007, 2008, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file bits/algorithmfwd.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _GLIBCXX_ALGORITHMFWD_H +#define _GLIBCXX_ALGORITHMFWD_H 1 + +#pragma GCC system_header + +#include +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /* + adjacent_find + all_of (C++0x) + any_of (C++0x) + binary_search + copy + copy_backward + copy_if (C++0x) + copy_n (C++0x) + count + count_if + equal + equal_range + fill + fill_n + find + find_end + find_first_of + find_if + find_if_not (C++0x) + for_each + generate + generate_n + includes + inplace_merge + is_heap (C++0x) + is_heap_until (C++0x) + is_partitioned (C++0x) + is_sorted (C++0x) + is_sorted_until (C++0x) + iter_swap + lexicographical_compare + lower_bound + make_heap + max + max_element + merge + min + min_element + minmax (C++0x) + minmax_element (C++0x) + mismatch + next_permutation + none_of (C++0x) + nth_element + partial_sort + partial_sort_copy + partition + partition_copy (C++0x) + partition_point (C++0x) + pop_heap + prev_permutation + push_heap + random_shuffle + remove + remove_copy + remove_copy_if + remove_if + replace + replace_copy + replace_copy_if + replace_if + reverse + reverse_copy + rotate + rotate_copy + search + search_n + set_difference + set_intersection + set_symmetric_difference + set_union + sort + sort_heap + stable_partition + stable_sort + swap + swap_ranges + transform + unique + unique_copy + upper_bound + */ + + /** + * @defgroup algorithms Algorithms + * + * Components for performing algorithmic operations. Includes + * non-modifying sequence, modifying (mutating) sequence, sorting, + * searching, merge, partition, heap, set, minima, maxima, and + * permutation operations. + */ + + /** + * @defgroup mutating_algorithms Mutating Algorithms + * @ingroup algorithms + */ + + /** + * @defgroup non_mutating_algorithms Non-Mutating Algorithms + * @ingroup algorithms + */ + + /** + * @defgroup sorting_algorithms Sorting Algorithms + * @ingroup algorithms + */ + + /** + * @defgroup set_algorithms Set Operation Algorithms + * @ingroup sorting_algorithms + * + * These algorithms are common set operations performed on sequences + * that are already sorted. The number of comparisons will be + * linear. + */ + + /** + * @defgroup binary_search_algorithms Binary Search Algorithms + * @ingroup sorting_algorithms + * + * These algorithms are variations of a classic binary search, and + * all assume that the sequence being searched is already sorted. + * + * The number of comparisons will be logarithmic (and as few as + * possible). The number of steps through the sequence will be + * logarithmic for random-access iterators (e.g., pointers), and + * linear otherwise. + * + * The LWG has passed Defect Report 270, which notes: The + * proposed resolution reinterprets binary search. Instead of + * thinking about searching for a value in a sorted range, we view + * that as an important special case of a more general algorithm: + * searching for the partition point in a partitioned range. We + * also add a guarantee that the old wording did not: we ensure that + * the upper bound is no earlier than the lower bound, that the pair + * returned by equal_range is a valid range, and that the first part + * of that pair is the lower bound. + * + * The actual effect of the first sentence is that a comparison + * functor passed by the user doesn't necessarily need to induce a + * strict weak ordering relation. Rather, it partitions the range. + */ + + // adjacent_find + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + bool + all_of(_IIter, _IIter, _Predicate); + + template + bool + any_of(_IIter, _IIter, _Predicate); +#endif + + template + bool + binary_search(_FIter, _FIter, const _Tp&); + + template + bool + binary_search(_FIter, _FIter, const _Tp&, _Compare); + + template + _OIter + copy(_IIter, _IIter, _OIter); + + template + _BIter2 + copy_backward(_BIter1, _BIter1, _BIter2); + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + _OIter + copy_if(_IIter, _IIter, _OIter, _Predicate); + + template + _OIter + copy_n(_IIter, _Size, _OIter); +#endif + + // count + // count_if + + template + pair<_FIter, _FIter> + equal_range(_FIter, _FIter, const _Tp&); + + template + pair<_FIter, _FIter> + equal_range(_FIter, _FIter, const _Tp&, _Compare); + + template + void + fill(_FIter, _FIter, const _Tp&); + +/* + XXX NB: return type different from ISO C++. + template + void + fill_n(_OIter, _Size, const _Tp&); +*/ + + template + _OIter + fill_n(_OIter, _Size, const _Tp&); + + // find + + template + _FIter1 + find_end(_FIter1, _FIter1, _FIter2, _FIter2); + + template + _FIter1 + find_end(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate); + + // find_first_of + // find_if + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + _IIter + find_if_not(_IIter, _IIter, _Predicate); +#endif + + // for_each + // generate + // generate_n + + template + bool + includes(_IIter1, _IIter1, _IIter2, _IIter2); + + template + bool + includes(_IIter1, _IIter1, _IIter2, _IIter2, _Compare); + + template + void + inplace_merge(_BIter, _BIter, _BIter); + + template + void + inplace_merge(_BIter, _BIter, _BIter, _Compare); + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + bool + is_heap(_RAIter, _RAIter); + + template + bool + is_heap(_RAIter, _RAIter, _Compare); + + template + _RAIter + is_heap_until(_RAIter, _RAIter); + + template + _RAIter + is_heap_until(_RAIter, _RAIter, _Compare); + + template + bool + is_partitioned(_IIter, _IIter, _Predicate); + + template + bool + is_sorted(_FIter, _FIter); + + template + bool + is_sorted(_FIter, _FIter, _Compare); + + template + _FIter + is_sorted_until(_FIter, _FIter); + + template + _FIter + is_sorted_until(_FIter, _FIter, _Compare); +#endif + + template + void + iter_swap(_FIter1, _FIter2); + + template + _FIter + lower_bound(_FIter, _FIter, const _Tp&); + + template + _FIter + lower_bound(_FIter, _FIter, const _Tp&, _Compare); + + template + void + make_heap(_RAIter, _RAIter); + + template + void + make_heap(_RAIter, _RAIter, _Compare); + + template + const _Tp& + max(const _Tp&, const _Tp&); + + template + const _Tp& + max(const _Tp&, const _Tp&, _Compare); + + // max_element + // merge + + template + const _Tp& + min(const _Tp&, const _Tp&); + + template + const _Tp& + min(const _Tp&, const _Tp&, _Compare); + + // min_element + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + pair + minmax(const _Tp&, const _Tp&); + + template + pair + minmax(const _Tp&, const _Tp&, _Compare); + + template + pair<_FIter, _FIter> + minmax_element(_FIter, _FIter); + + template + pair<_FIter, _FIter> + minmax_element(_FIter, _FIter, _Compare); + + template + _Tp + min(initializer_list<_Tp>); + + template + _Tp + min(initializer_list<_Tp>, _Compare); + + template + _Tp + max(initializer_list<_Tp>); + + template + _Tp + max(initializer_list<_Tp>, _Compare); + + template + pair<_Tp, _Tp> + minmax(initializer_list<_Tp>); + + template + pair<_Tp, _Tp> + minmax(initializer_list<_Tp>, _Compare); +#endif + + // mismatch + + template + bool + next_permutation(_BIter, _BIter); + + template + bool + next_permutation(_BIter, _BIter, _Compare); + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + bool + none_of(_IIter, _IIter, _Predicate); +#endif + + // nth_element + // partial_sort + + template + _RAIter + partial_sort_copy(_IIter, _IIter, _RAIter, _RAIter); + + template + _RAIter + partial_sort_copy(_IIter, _IIter, _RAIter, _RAIter, _Compare); + + // partition + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + pair<_OIter1, _OIter2> + partition_copy(_IIter, _IIter, _OIter1, _OIter2, _Predicate); + + template + _FIter + partition_point(_FIter, _FIter, _Predicate); +#endif + + template + void + pop_heap(_RAIter, _RAIter); + + template + void + pop_heap(_RAIter, _RAIter, _Compare); + + template + bool + prev_permutation(_BIter, _BIter); + + template + bool + prev_permutation(_BIter, _BIter, _Compare); + + template + void + push_heap(_RAIter, _RAIter); + + template + void + push_heap(_RAIter, _RAIter, _Compare); + + // random_shuffle + + template + _FIter + remove(_FIter, _FIter, const _Tp&); + + template + _FIter + remove_if(_FIter, _FIter, _Predicate); + + template + _OIter + remove_copy(_IIter, _IIter, _OIter, const _Tp&); + + template + _OIter + remove_copy_if(_IIter, _IIter, _OIter, _Predicate); + + // replace + + template + _OIter + replace_copy(_IIter, _IIter, _OIter, const _Tp&, const _Tp&); + + template + _OIter + replace_copy_if(_Iter, _Iter, _OIter, _Predicate, const _Tp&); + + // replace_if + + template + void + reverse(_BIter, _BIter); + + template + _OIter + reverse_copy(_BIter, _BIter, _OIter); + + template + void + rotate(_FIter, _FIter, _FIter); + + template + _OIter + rotate_copy(_FIter, _FIter, _FIter, _OIter); + + // search + // search_n + // set_difference + // set_intersection + // set_symmetric_difference + // set_union + + template + void + sort_heap(_RAIter, _RAIter); + + template + void + sort_heap(_RAIter, _RAIter, _Compare); + + template + _BIter + stable_partition(_BIter, _BIter, _Predicate); + + template + void + swap(_Tp&, _Tp&); + + template + void + swap(_Tp (&)[_Nm], _Tp (&)[_Nm]); + + template + _FIter2 + swap_ranges(_FIter1, _FIter1, _FIter2); + + // transform + + template + _FIter + unique(_FIter, _FIter); + + template + _FIter + unique(_FIter, _FIter, _BinaryPredicate); + + // unique_copy + + template + _FIter + upper_bound(_FIter, _FIter, const _Tp&); + + template + _FIter + upper_bound(_FIter, _FIter, const _Tp&, _Compare); + +_GLIBCXX_END_NAMESPACE + +_GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_P) + + template + _FIter + adjacent_find(_FIter, _FIter); + + template + _FIter + adjacent_find(_FIter, _FIter, _BinaryPredicate); + + template + typename iterator_traits<_IIter>::difference_type + count(_IIter, _IIter, const _Tp&); + + template + typename iterator_traits<_IIter>::difference_type + count_if(_IIter, _IIter, _Predicate); + + template + bool + equal(_IIter1, _IIter1, _IIter2); + + template + bool + equal(_IIter1, _IIter1, _IIter2, _BinaryPredicate); + + template + _IIter + find(_IIter, _IIter, const _Tp&); + + template + _FIter1 + find_first_of(_FIter1, _FIter1, _FIter2, _FIter2); + + template + _FIter1 + find_first_of(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate); + + template + _IIter + find_if(_IIter, _IIter, _Predicate); + + template + _Funct + for_each(_IIter, _IIter, _Funct); + + template + void + generate(_FIter, _FIter, _Generator); + +/* + XXX NB: return type different from ISO C++. + template + void + generate_n(_OIter, _Size, _Generator); +*/ + + template + _OIter + generate_n(_OIter, _Size, _Generator); + + template + bool + lexicographical_compare(_IIter1, _IIter1, _IIter2, _IIter2); + + template + bool + lexicographical_compare(_IIter1, _IIter1, _IIter2, _IIter2, _Compare); + + template + _FIter + max_element(_FIter, _FIter); + + template + _FIter + max_element(_FIter, _FIter, _Compare); + + template + _OIter + merge(_IIter1, _IIter1, _IIter2, _IIter2, _OIter); + + template + _OIter + merge(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare); + + template + _FIter + min_element(_FIter, _FIter); + + template + _FIter + min_element(_FIter, _FIter, _Compare); + + template + pair<_IIter1, _IIter2> + mismatch(_IIter1, _IIter1, _IIter2); + + template + pair<_IIter1, _IIter2> + mismatch(_IIter1, _IIter1, _IIter2, _BinaryPredicate); + + template + void + nth_element(_RAIter, _RAIter, _RAIter); + + template + void + nth_element(_RAIter, _RAIter, _RAIter, _Compare); + + template + void + partial_sort(_RAIter, _RAIter, _RAIter); + + template + void + partial_sort(_RAIter, _RAIter, _RAIter, _Compare); + + template + _BIter + partition(_BIter, _BIter, _Predicate); + + template + void + random_shuffle(_RAIter, _RAIter); + + template + void + random_shuffle(_RAIter, _RAIter, _Generator&); + + template + void + replace(_FIter, _FIter, const _Tp&, const _Tp&); + + template + void + replace_if(_FIter, _FIter, _Predicate, const _Tp&); + + template + _FIter1 + search(_FIter1, _FIter1, _FIter2, _FIter2); + + template + _FIter1 + search(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate); + + template + _FIter + search_n(_FIter, _FIter, _Size, const _Tp&); + + template + _FIter + search_n(_FIter, _FIter, _Size, const _Tp&, _BinaryPredicate); + + template + _OIter + set_difference(_IIter1, _IIter1, _IIter2, _IIter2, _OIter); + + template + _OIter + set_difference(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare); + + template + _OIter + set_intersection(_IIter1, _IIter1, _IIter2, _IIter2, _OIter); + + template + _OIter + set_intersection(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare); + + template + _OIter + set_symmetric_difference(_IIter1, _IIter1, _IIter2, _IIter2, _OIter); + + template + _OIter + set_symmetric_difference(_IIter1, _IIter1, _IIter2, _IIter2, + _OIter, _Compare); + + template + _OIter + set_union(_IIter1, _IIter1, _IIter2, _IIter2, _OIter); + + template + _OIter + set_union(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare); + + template + void + sort(_RAIter, _RAIter); + + template + void + sort(_RAIter, _RAIter, _Compare); + + template + void + stable_sort(_RAIter, _RAIter); + + template + void + stable_sort(_RAIter, _RAIter, _Compare); + + template + _OIter + transform(_IIter, _IIter, _OIter, _UnaryOperation); + + template + _OIter + transform(_IIter1, _IIter1, _IIter2, _OIter, _BinaryOperation); + + template + _OIter + unique_copy(_IIter, _IIter, _OIter); + + template + _OIter + unique_copy(_IIter, _IIter, _OIter, _BinaryPredicate); + +_GLIBCXX_END_NESTED_NAMESPACE + +#ifdef _GLIBCXX_NAMESPACE_ASSOCIATION_PARALLEL +# include +#endif + +#endif + diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/allocator.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/allocator.h new file mode 100644 index 00000000..334fee5d --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/allocator.h @@ -0,0 +1,181 @@ +// Allocators -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * Copyright (c) 1996-1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file allocator.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _ALLOCATOR_H +#define _ALLOCATOR_H 1 + +// Define the base class to std::allocator. +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /** + * @defgroup allocators Allocators + * @ingroup memory + * + * Classes encapsulating memory operations. + */ + + template + class allocator; + + /// allocator specialization. + template<> + class allocator + { + public: + typedef size_t size_type; + typedef ptrdiff_t difference_type; + typedef void* pointer; + typedef const void* const_pointer; + typedef void value_type; + + template + struct rebind + { typedef allocator<_Tp1> other; }; + }; + + /** + * @brief The "standard" allocator, as per [20.4]. + * @ingroup allocators + * + * Further details: + * http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt04ch11.html + */ + template + class allocator: public __glibcxx_base_allocator<_Tp> + { + public: + typedef size_t size_type; + typedef ptrdiff_t difference_type; + typedef _Tp* pointer; + typedef const _Tp* const_pointer; + typedef _Tp& reference; + typedef const _Tp& const_reference; + typedef _Tp value_type; + + template + struct rebind + { typedef allocator<_Tp1> other; }; + + allocator() throw() { } + + allocator(const allocator& __a) throw() + : __glibcxx_base_allocator<_Tp>(__a) { } + + template + allocator(const allocator<_Tp1>&) throw() { } + + ~allocator() throw() { } + + // Inherit everything else. + }; + + template + inline bool + operator==(const allocator<_T1>&, const allocator<_T2>&) + { return true; } + + template + inline bool + operator==(const allocator<_Tp>&, const allocator<_Tp>&) + { return true; } + + template + inline bool + operator!=(const allocator<_T1>&, const allocator<_T2>&) + { return false; } + + template + inline bool + operator!=(const allocator<_Tp>&, const allocator<_Tp>&) + { return false; } + + // Inhibit implicit instantiations for required instantiations, + // which are defined via explicit instantiations elsewhere. + // NB: This syntax is a GNU extension. +#if _GLIBCXX_EXTERN_TEMPLATE + extern template class allocator; + extern template class allocator; +#endif + + // Undefine. +#undef __glibcxx_base_allocator + + // To implement Option 3 of DR 431. + template + struct __alloc_swap + { static void _S_do_it(_Alloc&, _Alloc&) { } }; + + template + struct __alloc_swap<_Alloc, false> + { + static void + _S_do_it(_Alloc& __one, _Alloc& __two) + { + // Precondition: swappable allocators. + if (__one != __two) + swap(__one, __two); + } + }; + + // Optimize for stateless allocators. + template + struct __alloc_neq + { + static bool + _S_do_it(const _Alloc&, const _Alloc&) + { return false; } + }; + + template + struct __alloc_neq<_Alloc, false> + { + static bool + _S_do_it(const _Alloc& __one, const _Alloc& __two) + { return __one != __two; } + }; + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/atomic_0.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/atomic_0.h new file mode 100644 index 00000000..5d2631d7 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/atomic_0.h @@ -0,0 +1,463 @@ +// -*- C++ -*- header. + +// Copyright (C) 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file bits/atomic_0.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _GLIBCXX_ATOMIC_0_H +#define _GLIBCXX_ATOMIC_0_H 1 + +#pragma GCC system_header + +// _GLIBCXX_BEGIN_NAMESPACE(std) + + // 0 == __atomic0 == Never lock-free +namespace __atomic0 +{ + struct atomic_flag; + + // Implementation specific defines. +#define _ATOMIC_LOAD_(__a, __x) \ + ({ volatile __typeof__ _ATOMIC_MEMBER_* __p = &_ATOMIC_MEMBER_; \ + volatile __atomic_flag_base* __g = __atomic_flag_for_address(__p); \ + __atomic_flag_wait_explicit(__g, __x); \ + __typeof__ _ATOMIC_MEMBER_ __r = *__p; \ + atomic_flag_clear_explicit(__g, __x); \ + __r; }) + +#define _ATOMIC_STORE_(__a, __m, __x) \ + ({ volatile __typeof__ _ATOMIC_MEMBER_* __p = &_ATOMIC_MEMBER_; \ + __typeof__(__m) __v = (__m); \ + volatile __atomic_flag_base* __g = __atomic_flag_for_address(__p); \ + __atomic_flag_wait_explicit(__g, __x); \ + *__p = __v; \ + atomic_flag_clear_explicit(__g, __x); \ + __v; }) + +#define _ATOMIC_MODIFY_(__a, __o, __m, __x) \ + ({ volatile __typeof__ _ATOMIC_MEMBER_* __p = &_ATOMIC_MEMBER_; \ + __typeof__(__m) __v = (__m); \ + volatile __atomic_flag_base* __g = __atomic_flag_for_address(__p); \ + __atomic_flag_wait_explicit(__g, __x); \ + __typeof__ _ATOMIC_MEMBER_ __r = *__p; \ + *__p __o __v; \ + atomic_flag_clear_explicit(__g, __x); \ + __r; }) + +#define _ATOMIC_CMPEXCHNG_(__a, __e, __m, __x) \ + ({ volatile __typeof__ _ATOMIC_MEMBER_* __p = &_ATOMIC_MEMBER_; \ + __typeof__(__e) __q = (__e); \ + __typeof__(__m) __v = (__m); \ + bool __r; \ + volatile __atomic_flag_base* __g = __atomic_flag_for_address(__p); \ + __atomic_flag_wait_explicit(__g, __x); \ + __typeof__ _ATOMIC_MEMBER_ __t__ = *__p; \ + if (__t__ == *__q) { *__p = __v; __r = true; } \ + else { *__q = __t__; __r = false; } \ + atomic_flag_clear_explicit(__g, __x); \ + __r; }) + + /// atomic_flag + struct atomic_flag : private __atomic_flag_base + { + atomic_flag() = default; + ~atomic_flag() = default; + atomic_flag(const atomic_flag&) = delete; + atomic_flag& operator=(const atomic_flag&) = delete; + + atomic_flag(bool __i) { _M_i = __i; } // XXX deleted copy ctor != agg + + bool + test_and_set(memory_order __m = memory_order_seq_cst) volatile; + + void + clear(memory_order __m = memory_order_seq_cst) volatile; + }; + + /// 29.4.2, address types + struct atomic_address + { + private: + void* _M_i; + + public: + atomic_address() = default; + ~atomic_address() = default; + atomic_address(const atomic_address&) = delete; + atomic_address& operator=(const atomic_address&) = delete; + + atomic_address(void* __v) { _M_i = __v; } + + bool + is_lock_free() const volatile + { return false; } + + void + store(void* __v, memory_order __m = memory_order_seq_cst) volatile + { + __glibcxx_assert(__m == memory_order_acquire); + __glibcxx_assert(__m == memory_order_acq_rel); + __glibcxx_assert(__m == memory_order_consume); + _ATOMIC_STORE_(this, __v, __m); + } + + void* + load(memory_order __m = memory_order_seq_cst) const volatile + { + __glibcxx_assert(__m == memory_order_release); + __glibcxx_assert(__m == memory_order_acq_rel); + return _ATOMIC_LOAD_(this, __m); + } + + void* + exchange(void* __v, memory_order __m = memory_order_seq_cst) volatile + { return _ATOMIC_MODIFY_(this, =, __v, __m); } + + bool + compare_exchange_weak(void*& __v1, void* __v2, memory_order __m1, + memory_order __m2) volatile + { + __glibcxx_assert(__m2 == memory_order_release); + __glibcxx_assert(__m2 == memory_order_acq_rel); + __glibcxx_assert(__m2 <= __m1); + return _ATOMIC_CMPEXCHNG_(this, &__v1, __v2, __m1); + } + + bool + compare_exchange_weak(void*& __v1, void* __v2, + memory_order __m = memory_order_seq_cst) volatile + { + return compare_exchange_weak(__v1, __v2, __m, + __calculate_memory_order(__m)); + } + + bool + compare_exchange_strong(void*& __v1, void* __v2, memory_order __m1, + memory_order __m2) volatile + { + __glibcxx_assert(__m2 == memory_order_release); + __glibcxx_assert(__m2 == memory_order_acq_rel); + __glibcxx_assert(__m2 <= __m1); + return _ATOMIC_CMPEXCHNG_(this, &__v1, __v2, __m1); + } + + bool + compare_exchange_strong(void*& __v1, void* __v2, + memory_order __m = memory_order_seq_cst) volatile + { + return compare_exchange_strong(__v1, __v2, __m, + __calculate_memory_order(__m)); + } + + void* + fetch_add(ptrdiff_t __d, memory_order __m = memory_order_seq_cst) volatile + { + void* volatile* __p = &(_M_i); + volatile __atomic_flag_base* __g = __atomic_flag_for_address(__p); + __atomic_flag_wait_explicit(__g, __m); + void* __r = *__p; + *__p = (void*)((char*)(*__p) + __d); + atomic_flag_clear_explicit(__g, __m); + return __r; + } + + void* + fetch_sub(ptrdiff_t __d, memory_order __m = memory_order_seq_cst) volatile + { + void* volatile* __p = &(_M_i); + volatile __atomic_flag_base* __g = __atomic_flag_for_address(__p); + __atomic_flag_wait_explicit(__g, __m); + void* __r = *__p; + *__p = (void*)((char*)(*__p) - __d); + atomic_flag_clear_explicit(__g, __m); + return __r; + } + + operator void*() const volatile + { return load(); } + + void* + operator=(void* __v) // XXX volatile + { + store(__v); + return __v; + } + + void* + operator+=(ptrdiff_t __d) volatile + { return fetch_add(__d) + __d; } + + void* + operator-=(ptrdiff_t __d) volatile + { return fetch_sub(__d) - __d; } + }; + + + // 29.3.1 atomic integral types + // For each of the integral types, define atomic_[integral type] struct + // + // atomic_bool bool + // atomic_char char + // atomic_schar signed char + // atomic_uchar unsigned char + // atomic_short short + // atomic_ushort unsigned short + // atomic_int int + // atomic_uint unsigned int + // atomic_long long + // atomic_ulong unsigned long + // atomic_llong long long + // atomic_ullong unsigned long long + // atomic_char16_t char16_t + // atomic_char32_t char32_t + // atomic_wchar_t wchar_t + + // Base type. + // NB: Assuming _ITp is an integral scalar type that is 1, 2, 4, or 8 bytes, + // since that is what GCC built-in functions for atomic memory access work on. + template + struct __atomic_base + { + private: + typedef _ITp __integral_type; + + __integral_type _M_i; + + public: + __atomic_base() = default; + ~__atomic_base() = default; + __atomic_base(const __atomic_base&) = delete; + __atomic_base& operator=(const __atomic_base&) = delete; + + // Requires __integral_type convertible to _M_base._M_i. + __atomic_base(__integral_type __i) { _M_i = __i; } + + operator __integral_type() const volatile + { return load(); } + + __integral_type + operator=(__integral_type __i) // XXX volatile + { + store(__i); + return __i; + } + + __integral_type + operator++(int) volatile + { return fetch_add(1); } + + __integral_type + operator--(int) volatile + { return fetch_sub(1); } + + __integral_type + operator++() volatile + { return fetch_add(1) + 1; } + + __integral_type + operator--() volatile + { return fetch_sub(1) - 1; } + + __integral_type + operator+=(__integral_type __i) volatile + { return fetch_add(__i) + __i; } + + __integral_type + operator-=(__integral_type __i) volatile + { return fetch_sub(__i) - __i; } + + __integral_type + operator&=(__integral_type __i) volatile + { return fetch_and(__i) & __i; } + + __integral_type + operator|=(__integral_type __i) volatile + { return fetch_or(__i) | __i; } + + __integral_type + operator^=(__integral_type __i) volatile + { return fetch_xor(__i) ^ __i; } + + bool + is_lock_free() const volatile + { return false; } + + void + store(__integral_type __i, + memory_order __m = memory_order_seq_cst) volatile + { + __glibcxx_assert(__m == memory_order_acquire); + __glibcxx_assert(__m == memory_order_acq_rel); + __glibcxx_assert(__m == memory_order_consume); + _ATOMIC_STORE_(this, __i, __m); + } + + __integral_type + load(memory_order __m = memory_order_seq_cst) const volatile + { + __glibcxx_assert(__m == memory_order_release); + __glibcxx_assert(__m == memory_order_acq_rel); + return _ATOMIC_LOAD_(this, __m); + } + + __integral_type + exchange(__integral_type __i, + memory_order __m = memory_order_seq_cst) volatile + { return _ATOMIC_MODIFY_(this, =, __i, __m); } + + bool + compare_exchange_weak(__integral_type& __i1, __integral_type __i2, + memory_order __m1, memory_order __m2) volatile + { + __glibcxx_assert(__m2 == memory_order_release); + __glibcxx_assert(__m2 == memory_order_acq_rel); + __glibcxx_assert(__m2 <= __m1); + return _ATOMIC_CMPEXCHNG_(this, &__i1, __i2, __m1); + } + + bool + compare_exchange_weak(__integral_type& __i1, __integral_type __i2, + memory_order __m = memory_order_seq_cst) volatile + { + return compare_exchange_weak(__i1, __i2, __m, + __calculate_memory_order(__m)); + } + + bool + compare_exchange_strong(__integral_type& __i1, __integral_type __i2, + memory_order __m1, memory_order __m2) volatile + { + __glibcxx_assert(__m2 == memory_order_release); + __glibcxx_assert(__m2 == memory_order_acq_rel); + __glibcxx_assert(__m2 <= __m1); + return _ATOMIC_CMPEXCHNG_(this, &__i1, __i2, __m1); + } + + bool + compare_exchange_strong(__integral_type& __i1, __integral_type __i2, + memory_order __m = memory_order_seq_cst) volatile + { + return compare_exchange_strong(__i1, __i2, __m, + __calculate_memory_order(__m)); + } + + __integral_type + fetch_add(__integral_type __i, + memory_order __m = memory_order_seq_cst) volatile + { return _ATOMIC_MODIFY_(this, +=, __i, __m); } + + __integral_type + fetch_sub(__integral_type __i, + memory_order __m = memory_order_seq_cst) volatile + { return _ATOMIC_MODIFY_(this, -=, __i, __m); } + + __integral_type + fetch_and(__integral_type __i, + memory_order __m = memory_order_seq_cst) volatile + { return _ATOMIC_MODIFY_(this, &=, __i, __m); } + + __integral_type + fetch_or(__integral_type __i, + memory_order __m = memory_order_seq_cst) volatile + { return _ATOMIC_MODIFY_(this, |=, __i, __m); } + + __integral_type + fetch_xor(__integral_type __i, + memory_order __m = memory_order_seq_cst) volatile + { return _ATOMIC_MODIFY_(this, ^=, __i, __m); } + }; + + + /// atomic_bool + // NB: No operators or fetch-operations for this type. + struct atomic_bool + { + private: + __atomic_base _M_base; + + public: + atomic_bool() = default; + ~atomic_bool() = default; + atomic_bool(const atomic_bool&) = delete; + atomic_bool& operator=(const atomic_bool&) = delete; + + atomic_bool(bool __i) : _M_base(__i) { } + + bool + operator=(bool __i) // XXX volatile + { return _M_base.operator=(__i); } + + operator bool() const volatile + { return _M_base.load(); } + + bool + is_lock_free() const volatile + { return _M_base.is_lock_free(); } + + void + store(bool __i, memory_order __m = memory_order_seq_cst) volatile + { _M_base.store(__i, __m); } + + bool + load(memory_order __m = memory_order_seq_cst) const volatile + { return _M_base.load(__m); } + + bool + exchange(bool __i, memory_order __m = memory_order_seq_cst) volatile + { return _M_base.exchange(__i, __m); } + + bool + compare_exchange_weak(bool& __i1, bool __i2, memory_order __m1, + memory_order __m2) volatile + { return _M_base.compare_exchange_weak(__i1, __i2, __m1, __m2); } + + bool + compare_exchange_weak(bool& __i1, bool __i2, + memory_order __m = memory_order_seq_cst) volatile + { return _M_base.compare_exchange_weak(__i1, __i2, __m); } + + bool + compare_exchange_strong(bool& __i1, bool __i2, memory_order __m1, + memory_order __m2) volatile + { return _M_base.compare_exchange_strong(__i1, __i2, __m1, __m2); } + + + bool + compare_exchange_strong(bool& __i1, bool __i2, + memory_order __m = memory_order_seq_cst) volatile + { return _M_base.compare_exchange_strong(__i1, __i2, __m); } + }; + +#undef _ATOMIC_LOAD_ +#undef _ATOMIC_STORE_ +#undef _ATOMIC_MODIFY_ +#undef _ATOMIC_CMPEXCHNG_ +} // namespace __atomic0 + +// _GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/atomic_2.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/atomic_2.h new file mode 100644 index 00000000..c1727671 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/atomic_2.h @@ -0,0 +1,449 @@ +// -*- C++ -*- header. + +// Copyright (C) 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file bits/atomic_2.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _GLIBCXX_ATOMIC_2_H +#define _GLIBCXX_ATOMIC_2_H 1 + +#pragma GCC system_header + +// _GLIBCXX_BEGIN_NAMESPACE(std) + +// 2 == __atomic2 == Always lock-free +// Assumed: +// _GLIBCXX_ATOMIC_BUILTINS_1 +// _GLIBCXX_ATOMIC_BUILTINS_2 +// _GLIBCXX_ATOMIC_BUILTINS_4 +// _GLIBCXX_ATOMIC_BUILTINS_8 +namespace __atomic2 +{ + /// atomic_flag + struct atomic_flag : private __atomic_flag_base + { + atomic_flag() = default; + ~atomic_flag() = default; + atomic_flag(const atomic_flag&) = delete; + atomic_flag& operator=(const atomic_flag&) = delete; + + atomic_flag(bool __i) { _M_i = __i; } // XXX deleted copy ctor != agg + + bool + test_and_set(memory_order __m = memory_order_seq_cst) volatile + { + // Redundant synchronize if built-in for lock is a full barrier. + if (__m != memory_order_acquire && __m != memory_order_acq_rel) + __sync_synchronize(); + return __sync_lock_test_and_set(&_M_i, 1); + } + + void + clear(memory_order __m = memory_order_seq_cst) volatile + { + __sync_lock_release(&_M_i); + if (__m != memory_order_acquire && __m != memory_order_acq_rel) + __sync_synchronize(); + } + }; + + + /// 29.4.2, address types + struct atomic_address + { + private: + void* _M_i; + + public: + atomic_address() = default; + ~atomic_address() = default; + atomic_address(const atomic_address&) = delete; + atomic_address& operator=(const atomic_address&) = delete; + + atomic_address(void* __v) { _M_i = __v; } + + bool + is_lock_free() const volatile + { return true; } + + void + store(void* __v, memory_order __m = memory_order_seq_cst) volatile + { + __glibcxx_assert(__m == memory_order_acquire); + __glibcxx_assert(__m == memory_order_acq_rel); + __glibcxx_assert(__m == memory_order_consume); + + if (__m == memory_order_relaxed) + _M_i = __v; + else + { + // write_mem_barrier(); + _M_i = __v; + if (__m = memory_order_seq_cst) + __sync_synchronize(); + } + } + + void* + load(memory_order __m = memory_order_seq_cst) const volatile + { + __glibcxx_assert(__m == memory_order_release); + __glibcxx_assert(__m == memory_order_acq_rel); + + __sync_synchronize(); + void* __ret = _M_i; + __sync_synchronize(); + return __ret; + } + + void* + exchange(void* __v, memory_order __m = memory_order_seq_cst) volatile + { + // XXX built-in assumes memory_order_acquire. + return __sync_lock_test_and_set(&_M_i, __v); + } + + bool + compare_exchange_weak(void*& __v1, void* __v2, memory_order __m1, + memory_order __m2) volatile + { return compare_exchange_strong(__v1, __v2, __m1, __m2); } + + bool + compare_exchange_weak(void*& __v1, void* __v2, + memory_order __m = memory_order_seq_cst) volatile + { + return compare_exchange_weak(__v1, __v2, __m, + __calculate_memory_order(__m)); + } + + bool + compare_exchange_strong(void*& __v1, void* __v2, memory_order __m1, + memory_order __m2) volatile + { + __glibcxx_assert(__m2 == memory_order_release); + __glibcxx_assert(__m2 == memory_order_acq_rel); + __glibcxx_assert(__m2 <= __m1); + + void* __v1o = __v1; + void* __v1n = __sync_val_compare_and_swap(&_M_i, __v1o, __v2); + + // Assume extra stores (of same value) allowed in true case. + __v1 = __v1n; + return __v1o == __v1n; + } + + bool + compare_exchange_strong(void*& __v1, void* __v2, + memory_order __m = memory_order_seq_cst) volatile + { + return compare_exchange_strong(__v1, __v2, __m, + __calculate_memory_order(__m)); + } + + void* + fetch_add(ptrdiff_t __d, memory_order __m = memory_order_seq_cst) volatile + { return __sync_fetch_and_add(&_M_i, __d); } + + void* + fetch_sub(ptrdiff_t __d, memory_order __m = memory_order_seq_cst) volatile + { return __sync_fetch_and_sub(&_M_i, __d); } + + operator void*() const volatile + { return load(); } + + void* + operator=(void* __v) // XXX volatile + { + store(__v); + return __v; + } + + void* + operator+=(ptrdiff_t __d) volatile + { return __sync_add_and_fetch(&_M_i, __d); } + + void* + operator-=(ptrdiff_t __d) volatile + { return __sync_sub_and_fetch(&_M_i, __d); } + }; + + // 29.3.1 atomic integral types + // For each of the integral types, define atomic_[integral type] struct + // + // atomic_bool bool + // atomic_char char + // atomic_schar signed char + // atomic_uchar unsigned char + // atomic_short short + // atomic_ushort unsigned short + // atomic_int int + // atomic_uint unsigned int + // atomic_long long + // atomic_ulong unsigned long + // atomic_llong long long + // atomic_ullong unsigned long long + // atomic_char16_t char16_t + // atomic_char32_t char32_t + // atomic_wchar_t wchar_t + + // Base type. + // NB: Assuming _ITp is an integral scalar type that is 1, 2, 4, or 8 bytes, + // since that is what GCC built-in functions for atomic memory access work on. + template + struct __atomic_base + { + private: + typedef _ITp __integral_type; + + __integral_type _M_i; + + public: + __atomic_base() = default; + ~__atomic_base() = default; + __atomic_base(const __atomic_base&) = delete; + __atomic_base& operator=(const __atomic_base&) = delete; + + // Requires __integral_type convertible to _M_base._M_i. + __atomic_base(__integral_type __i) { _M_i = __i; } + + operator __integral_type() const volatile + { return load(); } + + __integral_type + operator=(__integral_type __i) // XXX volatile + { + store(__i); + return __i; + } + + __integral_type + operator++(int) volatile + { return fetch_add(1); } + + __integral_type + operator--(int) volatile + { return fetch_sub(1); } + + __integral_type + operator++() volatile + { return __sync_add_and_fetch(&_M_i, 1); } + + __integral_type + operator--() volatile + { return __sync_sub_and_fetch(&_M_i, 1); } + + __integral_type + operator+=(__integral_type __i) volatile + { return __sync_add_and_fetch(&_M_i, __i); } + + __integral_type + operator-=(__integral_type __i) volatile + { return __sync_sub_and_fetch(&_M_i, __i); } + + __integral_type + operator&=(__integral_type __i) volatile + { return __sync_and_and_fetch(&_M_i, __i); } + + __integral_type + operator|=(__integral_type __i) volatile + { return __sync_or_and_fetch(&_M_i, __i); } + + __integral_type + operator^=(__integral_type __i) volatile + { return __sync_xor_and_fetch(&_M_i, __i); } + + bool + is_lock_free() const volatile + { return true; } + + void + store(__integral_type __i, + memory_order __m = memory_order_seq_cst) volatile + { + __glibcxx_assert(__m == memory_order_acquire); + __glibcxx_assert(__m == memory_order_acq_rel); + __glibcxx_assert(__m == memory_order_consume); + + if (__m == memory_order_relaxed) + _M_i = __i; + else + { + // write_mem_barrier(); + _M_i = __i; + if (__m = memory_order_seq_cst) + __sync_synchronize(); + } + } + + __integral_type + load(memory_order __m = memory_order_seq_cst) const volatile + { + __glibcxx_assert(__m == memory_order_release); + __glibcxx_assert(__m == memory_order_acq_rel); + + __sync_synchronize(); + __integral_type __ret = _M_i; + __sync_synchronize(); + return __ret; + } + + __integral_type + exchange(__integral_type __i, + memory_order __m = memory_order_seq_cst) volatile + { + // XXX built-in assumes memory_order_acquire. + return __sync_lock_test_and_set(&_M_i, __i); + } + + bool + compare_exchange_weak(__integral_type& __i1, __integral_type __i2, + memory_order __m1, memory_order __m2) volatile + { return compare_exchange_strong(__i1, __i2, __m1, __m2); } + + bool + compare_exchange_weak(__integral_type& __i1, __integral_type __i2, + memory_order __m = memory_order_seq_cst) volatile + { + return compare_exchange_weak(__i1, __i2, __m, + __calculate_memory_order(__m)); + } + + bool + compare_exchange_strong(__integral_type& __i1, __integral_type __i2, + memory_order __m1, memory_order __m2) volatile + { + __glibcxx_assert(__m2 == memory_order_release); + __glibcxx_assert(__m2 == memory_order_acq_rel); + __glibcxx_assert(__m2 <= __m1); + + __integral_type __i1o = __i1; + __integral_type __i1n = __sync_val_compare_and_swap(&_M_i, __i1o, __i2); + + // Assume extra stores (of same value) allowed in true case. + __i1 = __i1n; + return __i1o == __i1n; + } + + bool + compare_exchange_strong(__integral_type& __i1, __integral_type __i2, + memory_order __m = memory_order_seq_cst) volatile + { + return compare_exchange_strong(__i1, __i2, __m, + __calculate_memory_order(__m)); + } + + __integral_type + fetch_add(__integral_type __i, + memory_order __m = memory_order_seq_cst) volatile + { return __sync_fetch_and_add(&_M_i, __i); } + + __integral_type + fetch_sub(__integral_type __i, + memory_order __m = memory_order_seq_cst) volatile + { return __sync_fetch_and_sub(&_M_i, __i); } + + __integral_type + fetch_and(__integral_type __i, + memory_order __m = memory_order_seq_cst) volatile + { return __sync_fetch_and_and(&_M_i, __i); } + + __integral_type + fetch_or(__integral_type __i, + memory_order __m = memory_order_seq_cst) volatile + { return __sync_fetch_and_or(&_M_i, __i); } + + __integral_type + fetch_xor(__integral_type __i, + memory_order __m = memory_order_seq_cst) volatile + { return __sync_fetch_and_xor(&_M_i, __i); } + }; + + + /// atomic_bool + // NB: No operators or fetch-operations for this type. + struct atomic_bool + { + private: + __atomic_base _M_base; + + public: + atomic_bool() = default; + ~atomic_bool() = default; + atomic_bool(const atomic_bool&) = delete; + atomic_bool& operator=(const atomic_bool&) = delete; + + atomic_bool(bool __i) : _M_base(__i) { } + + bool + operator=(bool __i) // XXX volatile + { return _M_base.operator=(__i); } + + operator bool() const volatile + { return _M_base.load(); } + + bool + is_lock_free() const volatile + { return _M_base.is_lock_free(); } + + void + store(bool __i, memory_order __m = memory_order_seq_cst) volatile + { _M_base.store(__i, __m); } + + bool + load(memory_order __m = memory_order_seq_cst) const volatile + { return _M_base.load(__m); } + + bool + exchange(bool __i, memory_order __m = memory_order_seq_cst) volatile + { return _M_base.exchange(__i, __m); } + + bool + compare_exchange_weak(bool& __i1, bool __i2, memory_order __m1, + memory_order __m2) volatile + { return _M_base.compare_exchange_weak(__i1, __i2, __m1, __m2); } + + bool + compare_exchange_weak(bool& __i1, bool __i2, + memory_order __m = memory_order_seq_cst) volatile + { return _M_base.compare_exchange_weak(__i1, __i2, __m); } + + bool + compare_exchange_strong(bool& __i1, bool __i2, memory_order __m1, + memory_order __m2) volatile + { return _M_base.compare_exchange_strong(__i1, __i2, __m1, __m2); } + + + bool + compare_exchange_strong(bool& __i1, bool __i2, + memory_order __m = memory_order_seq_cst) volatile + { return _M_base.compare_exchange_strong(__i1, __i2, __m); } + }; +} // namespace __atomic2 + +// _GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/atomicfwd_c.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/atomicfwd_c.h new file mode 100644 index 00000000..08418439 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/atomicfwd_c.h @@ -0,0 +1,174 @@ +// -*- C++ -*- header. + +// Copyright (C) 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file bits/atomicfwd_c.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// "C" only bits. + +#define _ATOMIC_MEMBER_ ((__a)->_M_i) + + // POD base classes for atomic intgral types. + struct __atomic_bool_base + { + bool _M_i; + }; + + struct __atomic_char_base + { + char _M_i; + }; + + struct __atomic_schar_base + { + signed char _M_i; + }; + + struct __atomic_uchar_base + { + unsigned char _M_i; + }; + + struct __atomic_short_base + { + short _M_i; + }; + + struct __atomic_ushort_base + { + unsigned short _M_i; + }; + + struct __atomic_int_base + { + int _M_i; + }; + + struct __atomic_uint_base + { + unsigned int _M_i; + }; + + struct __atomic_long_base + { + long _M_i; + }; + + struct __atomic_ulong_base + { + unsigned long _M_i; + }; + + struct __atomic_llong_base + { + long long _M_i; + }; + + struct __atomic_ullong_base + { + unsigned long long _M_i; + }; + + struct __atomic_wchar_t_base + { + wchar_t _M_i; + }; + + typedef struct __atomic_flag_base atomic_flag; + typedef struct __atomic_address_base atomic_address; + typedef struct __atomic_bool_base atomic_bool; + typedef struct __atomic_char_base atomic_char; + typedef struct __atomic_schar_base atomic_schar; + typedef struct __atomic_uchar_base atomic_uchar; + typedef struct __atomic_short_base atomic_short; + typedef struct __atomic_ushort_base atomic_ushort; + typedef struct __atomic_int_base atomic_int; + typedef struct __atomic_uint_base atomic_uint; + typedef struct __atomic_long_base atomic_long; + typedef struct __atomic_ulong_base atomic_ulong; + typedef struct __atomic_llong_base atomic_llong; + typedef struct __atomic_ullong_base atomic_ullong; + typedef struct __atomic_wchar_t_base atomic_wchar_t; + typedef struct __atomic_short_base atomic_char16_t; + typedef struct __atomic_int_base atomic_char32_t; + +#define atomic_is_lock_free(__a) \ + false + +#define atomic_load_explicit(__a, __x) \ + _ATOMIC_LOAD_(__a, __x) + +#define atomic_load(__a) \ + atomic_load_explicit(__a, memory_order_seq_cst) + +#define atomic_store_explicit(__a, __m, __x) \ + _ATOMIC_STORE_(__a, __m, __x) + +#define atomic_store(__a, __m) \ + atomic_store_explicit(__a, __m, memory_order_seq_cst) + +#define atomic_exchange_explicit(__a, __m, __x) \ + _ATOMIC_MODIFY_(__a, =, __m, __x) + +#define atomic_exchange(__a, __m) \ + atomic_exchange_explicit(__a, __m, memory_order_seq_cst) + +#define atomic_compare_exchange_explicit(__a, __e, __m, __x, __y) \ + _ATOMIC_CMPEXCHNG_(__a, __e, __m, __x) + +#define atomic_compare_exchange(__a, __e, __m) \ + _ATOMIC_CMPEXCHNG_(__a, __e, __m, memory_order_seq_cst) + +#define atomic_fetch_add_explicit(__a, __m, __x) \ + _ATOMIC_MODIFY_(__a, +=, __m, __x) + +#define atomic_fetch_add(__a, __m) \ + atomic_fetch_add_explicit(__a, __m, memory_order_seq_cst) + +#define atomic_fetch_sub_explicit(__a, __m, __x) \ + _ATOMIC_MODIFY_(__a, -=, __m, __x) + +#define atomic_fetch_sub(__a, __m) \ + atomic_fetch_sub_explicit(__a, __m, memory_order_seq_cst) + +#define atomic_fetch_and_explicit(__a, __m, __x) \ + _ATOMIC_MODIFY_(__a, &=, __m, __x) + +#define atomic_fetch_and(__a, __m) \ + atomic_fetch_and_explicit(__a, __m, memory_order_seq_cst) + +#define atomic_fetch_or_explicit(__a, __m, __x) \ + _ATOMIC_MODIFY_(__a, |=, __m, __x) + +#define atomic_fetch_or(__a, __m) \ + atomic_fetch_or_explicit(__a, __m, memory_order_seq_cst) + +#define atomic_fetch_xor_explicit(__a, __m, __x) \ + _ATOMIC_MODIFY_(__a, ^=, __m, __x) + +#define atomic_fetch_xor(__a, __m) \ + atomic_fetch_xor_explicit(__a, __m, memory_order_seq_cst) diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/atomicfwd_cxx.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/atomicfwd_cxx.h new file mode 100644 index 00000000..8b67635d --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/atomicfwd_cxx.h @@ -0,0 +1,109 @@ +// -*- C++ -*- header. + +// Copyright (C) 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file bits/atomicfwd_cxx.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// "C++" only bits. + +#define _ATOMIC_MEMBER_ _M_i + +_GLIBCXX_END_EXTERN_C + + namespace __atomic0 + { + template + struct __atomic_base; + + struct atomic_flag; + struct atomic_address; + struct atomic_bool; + } + + namespace __atomic2 + { + template + struct __atomic_base; + + struct atomic_flag; + struct atomic_address; + struct atomic_bool; + } + + namespace __atomic1 + { + using __atomic2::atomic_flag; + using __atomic2::atomic_bool; + using __atomic0::atomic_address; + using __atomic0::__atomic_base; + } + + /// atomic_char + typedef __atomic_base atomic_char; + + /// atomic_schar + typedef __atomic_base atomic_schar; + + /// atomic_uchar + typedef __atomic_base atomic_uchar; + + /// atomic_short + typedef __atomic_base atomic_short; + + /// atomic_ushort + typedef __atomic_base atomic_ushort; + + /// atomic_int + typedef __atomic_base atomic_int; + + /// atomic_uint + typedef __atomic_base atomic_uint; + + /// atomic_long + typedef __atomic_base atomic_long; + + /// atomic_ulong + typedef __atomic_base atomic_ulong; + + /// atomic_llong + typedef __atomic_base atomic_llong; + + /// atomic_ullong + typedef __atomic_base atomic_ullong; + + /// atomic_wchar_t + typedef __atomic_base atomic_wchar_t; + + /// atomic_char16_t + typedef __atomic_base atomic_char16_t; + + /// atomic_char32_t + typedef __atomic_base atomic_char32_t; + + template + struct atomic; +_GLIBCXX_BEGIN_EXTERN_C diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/basic_ios.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/basic_ios.h new file mode 100644 index 00000000..ee1b6465 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/basic_ios.h @@ -0,0 +1,474 @@ +// Iostreams base classes -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file basic_ios.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _BASIC_IOS_H +#define _BASIC_IOS_H 1 + +#pragma GCC system_header + +#include +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + template + inline const _Facet& + __check_facet(const _Facet* __f) + { + if (!__f) + __throw_bad_cast(); + return *__f; + } + + // 27.4.5 Template class basic_ios + /** + * @brief Virtual base class for all stream classes. + * @ingroup io + * + * Most of the member functions called dispatched on stream objects + * (e.g., @c std::cout.foo(bar);) are consolidated in this class. + */ + template + class basic_ios : public ios_base + { + public: + //@{ + /** + * These are standard types. They permit a standardized way of + * referring to names of (or names dependant on) the template + * parameters, which are specific to the implementation. + */ + typedef _CharT char_type; + typedef typename _Traits::int_type int_type; + typedef typename _Traits::pos_type pos_type; + typedef typename _Traits::off_type off_type; + typedef _Traits traits_type; + //@} + + //@{ + /** + * These are non-standard types. + */ + typedef ctype<_CharT> __ctype_type; + typedef num_put<_CharT, ostreambuf_iterator<_CharT, _Traits> > + __num_put_type; + typedef num_get<_CharT, istreambuf_iterator<_CharT, _Traits> > + __num_get_type; + //@} + + // Data members: + protected: + basic_ostream<_CharT, _Traits>* _M_tie; + mutable char_type _M_fill; + mutable bool _M_fill_init; + basic_streambuf<_CharT, _Traits>* _M_streambuf; + + // Cached use_facet, which is based on the current locale info. + const __ctype_type* _M_ctype; + // For ostream. + const __num_put_type* _M_num_put; + // For istream. + const __num_get_type* _M_num_get; + + public: + //@{ + /** + * @brief The quick-and-easy status check. + * + * This allows you to write constructs such as + * "if (!a_stream) ..." and "while (a_stream) ..." + */ + operator void*() const + { return this->fail() ? 0 : const_cast(this); } + + bool + operator!() const + { return this->fail(); } + //@} + + /** + * @brief Returns the error state of the stream buffer. + * @return A bit pattern (well, isn't everything?) + * + * See std::ios_base::iostate for the possible bit values. Most + * users will call one of the interpreting wrappers, e.g., good(). + */ + iostate + rdstate() const + { return _M_streambuf_state; } + + /** + * @brief [Re]sets the error state. + * @param state The new state flag(s) to set. + * + * See std::ios_base::iostate for the possible bit values. Most + * users will not need to pass an argument. + */ + void + clear(iostate __state = goodbit); + + /** + * @brief Sets additional flags in the error state. + * @param state The additional state flag(s) to set. + * + * See std::ios_base::iostate for the possible bit values. + */ + void + setstate(iostate __state) + { this->clear(this->rdstate() | __state); } + + // Flip the internal state on for the proper state bits, then re + // throws the propagated exception if bit also set in + // exceptions(). + void + _M_setstate(iostate __state) + { + // 27.6.1.2.1 Common requirements. + // Turn this on without causing an ios::failure to be thrown. + _M_streambuf_state |= __state; + if (this->exceptions() & __state) + __throw_exception_again; + } + + /** + * @brief Fast error checking. + * @return True if no error flags are set. + * + * A wrapper around rdstate. + */ + bool + good() const + { return this->rdstate() == 0; } + + /** + * @brief Fast error checking. + * @return True if the eofbit is set. + * + * Note that other iostate flags may also be set. + */ + bool + eof() const + { return (this->rdstate() & eofbit) != 0; } + + /** + * @brief Fast error checking. + * @return True if either the badbit or the failbit is set. + * + * Checking the badbit in fail() is historical practice. + * Note that other iostate flags may also be set. + */ + bool + fail() const + { return (this->rdstate() & (badbit | failbit)) != 0; } + + /** + * @brief Fast error checking. + * @return True if the badbit is set. + * + * Note that other iostate flags may also be set. + */ + bool + bad() const + { return (this->rdstate() & badbit) != 0; } + + /** + * @brief Throwing exceptions on errors. + * @return The current exceptions mask. + * + * This changes nothing in the stream. See the one-argument version + * of exceptions(iostate) for the meaning of the return value. + */ + iostate + exceptions() const + { return _M_exception; } + + /** + * @brief Throwing exceptions on errors. + * @param except The new exceptions mask. + * + * By default, error flags are set silently. You can set an + * exceptions mask for each stream; if a bit in the mask becomes set + * in the error flags, then an exception of type + * std::ios_base::failure is thrown. + * + * If the error flag is already set when the exceptions mask is + * added, the exception is immediately thrown. Try running the + * following under GCC 3.1 or later: + * @code + * #include + * #include + * #include + * + * int main() + * { + * std::set_terminate (__gnu_cxx::__verbose_terminate_handler); + * + * std::ifstream f ("/etc/motd"); + * + * std::cerr << "Setting badbit\n"; + * f.setstate (std::ios_base::badbit); + * + * std::cerr << "Setting exception mask\n"; + * f.exceptions (std::ios_base::badbit); + * } + * @endcode + */ + void + exceptions(iostate __except) + { + _M_exception = __except; + this->clear(_M_streambuf_state); + } + + // Constructor/destructor: + /** + * @brief Constructor performs initialization. + * + * The parameter is passed by derived streams. + */ + explicit + basic_ios(basic_streambuf<_CharT, _Traits>* __sb) + : ios_base(), _M_tie(0), _M_fill(), _M_fill_init(false), _M_streambuf(0), + _M_ctype(0), _M_num_put(0), _M_num_get(0) + { this->init(__sb); } + + /** + * @brief Empty. + * + * The destructor does nothing. More specifically, it does not + * destroy the streambuf held by rdbuf(). + */ + virtual + ~basic_ios() { } + + // Members: + /** + * @brief Fetches the current @e tied stream. + * @return A pointer to the tied stream, or NULL if the stream is + * not tied. + * + * A stream may be @e tied (or synchronized) to a second output + * stream. When this stream performs any I/O, the tied stream is + * first flushed. For example, @c std::cin is tied to @c std::cout. + */ + basic_ostream<_CharT, _Traits>* + tie() const + { return _M_tie; } + + /** + * @brief Ties this stream to an output stream. + * @param tiestr The output stream. + * @return The previously tied output stream, or NULL if the stream + * was not tied. + * + * This sets up a new tie; see tie() for more. + */ + basic_ostream<_CharT, _Traits>* + tie(basic_ostream<_CharT, _Traits>* __tiestr) + { + basic_ostream<_CharT, _Traits>* __old = _M_tie; + _M_tie = __tiestr; + return __old; + } + + /** + * @brief Accessing the underlying buffer. + * @return The current stream buffer. + * + * This does not change the state of the stream. + */ + basic_streambuf<_CharT, _Traits>* + rdbuf() const + { return _M_streambuf; } + + /** + * @brief Changing the underlying buffer. + * @param sb The new stream buffer. + * @return The previous stream buffer. + * + * Associates a new buffer with the current stream, and clears the + * error state. + * + * Due to historical accidents which the LWG refuses to correct, the + * I/O library suffers from a design error: this function is hidden + * in derived classes by overrides of the zero-argument @c rdbuf(), + * which is non-virtual for hysterical raisins. As a result, you + * must use explicit qualifications to access this function via any + * derived class. For example: + * + * @code + * std::fstream foo; // or some other derived type + * std::streambuf* p = .....; + * + * foo.ios::rdbuf(p); // ios == basic_ios + * @endcode + */ + basic_streambuf<_CharT, _Traits>* + rdbuf(basic_streambuf<_CharT, _Traits>* __sb); + + /** + * @brief Copies fields of __rhs into this. + * @param __rhs The source values for the copies. + * @return Reference to this object. + * + * All fields of __rhs are copied into this object except that rdbuf() + * and rdstate() remain unchanged. All values in the pword and iword + * arrays are copied. Before copying, each callback is invoked with + * erase_event. After copying, each (new) callback is invoked with + * copyfmt_event. The final step is to copy exceptions(). + */ + basic_ios& + copyfmt(const basic_ios& __rhs); + + /** + * @brief Retrieves the "empty" character. + * @return The current fill character. + * + * It defaults to a space (' ') in the current locale. + */ + char_type + fill() const + { + if (!_M_fill_init) + { + _M_fill = this->widen(' '); + _M_fill_init = true; + } + return _M_fill; + } + + /** + * @brief Sets a new "empty" character. + * @param ch The new character. + * @return The previous fill character. + * + * The fill character is used to fill out space when P+ characters + * have been requested (e.g., via setw), Q characters are actually + * used, and Qfill(); + _M_fill = __ch; + return __old; + } + + // Locales: + /** + * @brief Moves to a new locale. + * @param loc The new locale. + * @return The previous locale. + * + * Calls @c ios_base::imbue(loc), and if a stream buffer is associated + * with this stream, calls that buffer's @c pubimbue(loc). + * + * Additional l10n notes are at + * http://gcc.gnu.org/onlinedocs/libstdc++/manual/localization.html + */ + locale + imbue(const locale& __loc); + + /** + * @brief Squeezes characters. + * @param c The character to narrow. + * @param dfault The character to narrow. + * @return The narrowed character. + * + * Maps a character of @c char_type to a character of @c char, + * if possible. + * + * Returns the result of + * @code + * std::use_facet >(getloc()).narrow(c,dfault) + * @endcode + * + * Additional l10n notes are at + * http://gcc.gnu.org/onlinedocs/libstdc++/manual/localization.html + */ + char + narrow(char_type __c, char __dfault) const + { return __check_facet(_M_ctype).narrow(__c, __dfault); } + + /** + * @brief Widens characters. + * @param c The character to widen. + * @return The widened character. + * + * Maps a character of @c char to a character of @c char_type. + * + * Returns the result of + * @code + * std::use_facet >(getloc()).widen(c) + * @endcode + * + * Additional l10n notes are at + * http://gcc.gnu.org/onlinedocs/libstdc++/manual/localization.html + */ + char_type + widen(char __c) const + { return __check_facet(_M_ctype).widen(__c); } + + protected: + // 27.4.5.1 basic_ios constructors + /** + * @brief Empty. + * + * The default constructor does nothing and is not normally + * accessible to users. + */ + basic_ios() + : ios_base(), _M_tie(0), _M_fill(char_type()), _M_fill_init(false), + _M_streambuf(0), _M_ctype(0), _M_num_put(0), _M_num_get(0) + { } + + /** + * @brief All setup is performed here. + * + * This is called from the public constructor. It is not virtual and + * cannot be redefined. + */ + void + init(basic_streambuf<_CharT, _Traits>* __sb); + + void + _M_cache_locale(const locale& __loc); + }; + +_GLIBCXX_END_NAMESPACE + +#ifndef _GLIBCXX_EXPORT_TEMPLATE +#include +#endif + +#endif /* _BASIC_IOS_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/basic_ios.tcc b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/basic_ios.tcc new file mode 100644 index 00000000..a0dc67e5 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/basic_ios.tcc @@ -0,0 +1,187 @@ +// basic_ios member functions -*- C++ -*- + +// Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, +// 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file basic_ios.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _BASIC_IOS_TCC +#define _BASIC_IOS_TCC 1 + +#pragma GCC system_header + +_GLIBCXX_BEGIN_NAMESPACE(std) + + template + void + basic_ios<_CharT, _Traits>::clear(iostate __state) + { + if (this->rdbuf()) + _M_streambuf_state = __state; + else + _M_streambuf_state = __state | badbit; + if (this->exceptions() & this->rdstate()) + __throw_ios_failure(__N("basic_ios::clear")); + } + + template + basic_streambuf<_CharT, _Traits>* + basic_ios<_CharT, _Traits>::rdbuf(basic_streambuf<_CharT, _Traits>* __sb) + { + basic_streambuf<_CharT, _Traits>* __old = _M_streambuf; + _M_streambuf = __sb; + this->clear(); + return __old; + } + + template + basic_ios<_CharT, _Traits>& + basic_ios<_CharT, _Traits>::copyfmt(const basic_ios& __rhs) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 292. effects of a.copyfmt (a) + if (this != &__rhs) + { + // Per 27.1.1, do not call imbue, yet must trash all caches + // associated with imbue() + + // Alloc any new word array first, so if it fails we have "rollback". + _Words* __words = (__rhs._M_word_size <= _S_local_word_size) ? + _M_local_word : new _Words[__rhs._M_word_size]; + + // Bump refs before doing callbacks, for safety. + _Callback_list* __cb = __rhs._M_callbacks; + if (__cb) + __cb->_M_add_reference(); + _M_call_callbacks(erase_event); + if (_M_word != _M_local_word) + { + delete [] _M_word; + _M_word = 0; + } + _M_dispose_callbacks(); + + // NB: Don't want any added during above. + _M_callbacks = __cb; + for (int __i = 0; __i < __rhs._M_word_size; ++__i) + __words[__i] = __rhs._M_word[__i]; + _M_word = __words; + _M_word_size = __rhs._M_word_size; + + this->flags(__rhs.flags()); + this->width(__rhs.width()); + this->precision(__rhs.precision()); + this->tie(__rhs.tie()); + this->fill(__rhs.fill()); + _M_ios_locale = __rhs.getloc(); + _M_cache_locale(_M_ios_locale); + + _M_call_callbacks(copyfmt_event); + + // The next is required to be the last assignment. + this->exceptions(__rhs.exceptions()); + } + return *this; + } + + // Locales: + template + locale + basic_ios<_CharT, _Traits>::imbue(const locale& __loc) + { + locale __old(this->getloc()); + ios_base::imbue(__loc); + _M_cache_locale(__loc); + if (this->rdbuf() != 0) + this->rdbuf()->pubimbue(__loc); + return __old; + } + + template + void + basic_ios<_CharT, _Traits>::init(basic_streambuf<_CharT, _Traits>* __sb) + { + // NB: This may be called more than once on the same object. + ios_base::_M_init(); + + // Cache locale data and specific facets used by iostreams. + _M_cache_locale(_M_ios_locale); + + // NB: The 27.4.4.1 Postconditions Table specifies requirements + // after basic_ios::init() has been called. As part of this, + // fill() must return widen(' ') any time after init() has been + // called, which needs an imbued ctype facet of char_type to + // return without throwing an exception. Unfortunately, + // ctype is not necessarily a required facet, so + // streams with char_type != [char, wchar_t] will not have it by + // default. Because of this, the correct value for _M_fill is + // constructed on the first call of fill(). That way, + // unformatted input and output with non-required basic_ios + // instantiations is possible even without imbuing the expected + // ctype facet. + _M_fill = _CharT(); + _M_fill_init = false; + + _M_tie = 0; + _M_exception = goodbit; + _M_streambuf = __sb; + _M_streambuf_state = __sb ? goodbit : badbit; + } + + template + void + basic_ios<_CharT, _Traits>::_M_cache_locale(const locale& __loc) + { + if (__builtin_expect(has_facet<__ctype_type>(__loc), true)) + _M_ctype = &use_facet<__ctype_type>(__loc); + else + _M_ctype = 0; + + if (__builtin_expect(has_facet<__num_put_type>(__loc), true)) + _M_num_put = &use_facet<__num_put_type>(__loc); + else + _M_num_put = 0; + + if (__builtin_expect(has_facet<__num_get_type>(__loc), true)) + _M_num_get = &use_facet<__num_get_type>(__loc); + else + _M_num_get = 0; + } + + // Inhibit implicit instantiations for required instantiations, + // which are defined via explicit instantiations elsewhere. + // NB: This syntax is a GNU extension. +#if _GLIBCXX_EXTERN_TEMPLATE + extern template class basic_ios; + +#ifdef _GLIBCXX_USE_WCHAR_T + extern template class basic_ios; +#endif +#endif + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/basic_string.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/basic_string.h new file mode 100644 index 00000000..1e8300da --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/basic_string.h @@ -0,0 +1,2692 @@ +// Components for manipulating sequences of characters -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file basic_string.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 21 Strings library +// + +#ifndef _BASIC_STRING_H +#define _BASIC_STRING_H 1 + +#pragma GCC system_header + +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /** + * @class basic_string basic_string.h + * @brief Managing sequences of characters and character-like objects. + * + * @ingroup sequences + * + * Meets the requirements of a container, a + * reversible container, and a + * sequence. Of the + * optional sequence requirements, only + * @c push_back, @c at, and array access are supported. + * + * @doctodo + * + * + * Documentation? What's that? + * Nathan Myers . + * + * A string looks like this: + * + * @code + * [_Rep] + * _M_length + * [basic_string] _M_capacity + * _M_dataplus _M_refcount + * _M_p ----------------> unnamed array of char_type + * @endcode + * + * Where the _M_p points to the first character in the string, and + * you cast it to a pointer-to-_Rep and subtract 1 to get a + * pointer to the header. + * + * This approach has the enormous advantage that a string object + * requires only one allocation. All the ugliness is confined + * within a single pair of inline functions, which each compile to + * a single "add" instruction: _Rep::_M_data(), and + * string::_M_rep(); and the allocation function which gets a + * block of raw bytes and with room enough and constructs a _Rep + * object at the front. + * + * The reason you want _M_data pointing to the character array and + * not the _Rep is so that the debugger can see the string + * contents. (Probably we should add a non-inline member to get + * the _Rep for the debugger to use, so users can check the actual + * string length.) + * + * Note that the _Rep object is a POD so that you can have a + * static "empty string" _Rep object already "constructed" before + * static constructors have run. The reference-count encoding is + * chosen so that a 0 indicates one reference, so you never try to + * destroy the empty-string _Rep object. + * + * All but the last paragraph is considered pretty conventional + * for a C++ string implementation. + */ + // 21.3 Template class basic_string + template + class basic_string + { + typedef typename _Alloc::template rebind<_CharT>::other _CharT_alloc_type; + + // Types: + public: + typedef _Traits traits_type; + typedef typename _Traits::char_type value_type; + typedef _Alloc allocator_type; + typedef typename _CharT_alloc_type::size_type size_type; + typedef typename _CharT_alloc_type::difference_type difference_type; + typedef typename _CharT_alloc_type::reference reference; + typedef typename _CharT_alloc_type::const_reference const_reference; + typedef typename _CharT_alloc_type::pointer pointer; + typedef typename _CharT_alloc_type::const_pointer const_pointer; + typedef __gnu_cxx::__normal_iterator iterator; + typedef __gnu_cxx::__normal_iterator + const_iterator; + typedef std::reverse_iterator const_reverse_iterator; + typedef std::reverse_iterator reverse_iterator; + + private: + // _Rep: string representation + // Invariants: + // 1. String really contains _M_length + 1 characters: due to 21.3.4 + // must be kept null-terminated. + // 2. _M_capacity >= _M_length + // Allocated memory is always (_M_capacity + 1) * sizeof(_CharT). + // 3. _M_refcount has three states: + // -1: leaked, one reference, no ref-copies allowed, non-const. + // 0: one reference, non-const. + // n>0: n + 1 references, operations require a lock, const. + // 4. All fields==0 is an empty string, given the extra storage + // beyond-the-end for a null terminator; thus, the shared + // empty string representation needs no constructor. + + struct _Rep_base + { + size_type _M_length; + size_type _M_capacity; + _Atomic_word _M_refcount; + }; + + struct _Rep : _Rep_base + { + // Types: + typedef typename _Alloc::template rebind::other _Raw_bytes_alloc; + + // (Public) Data members: + + // The maximum number of individual char_type elements of an + // individual string is determined by _S_max_size. This is the + // value that will be returned by max_size(). (Whereas npos + // is the maximum number of bytes the allocator can allocate.) + // If one was to divvy up the theoretical largest size string, + // with a terminating character and m _CharT elements, it'd + // look like this: + // npos = sizeof(_Rep) + (m * sizeof(_CharT)) + sizeof(_CharT) + // Solving for m: + // m = ((npos - sizeof(_Rep))/sizeof(CharT)) - 1 + // In addition, this implementation quarters this amount. + static const size_type _S_max_size; + static const _CharT _S_terminal; + + // The following storage is init'd to 0 by the linker, resulting + // (carefully) in an empty string with one reference. + static size_type _S_empty_rep_storage[]; + + static _Rep& + _S_empty_rep() + { + // NB: Mild hack to avoid strict-aliasing warnings. Note that + // _S_empty_rep_storage is never modified and the punning should + // be reasonably safe in this case. + void* __p = reinterpret_cast(&_S_empty_rep_storage); + return *reinterpret_cast<_Rep*>(__p); + } + + bool + _M_is_leaked() const + { return this->_M_refcount < 0; } + + bool + _M_is_shared() const + { return this->_M_refcount > 0; } + + void + _M_set_leaked() + { this->_M_refcount = -1; } + + void + _M_set_sharable() + { this->_M_refcount = 0; } + + void + _M_set_length_and_sharable(size_type __n) + { + this->_M_set_sharable(); // One reference. + this->_M_length = __n; + traits_type::assign(this->_M_refdata()[__n], _S_terminal); + // grrr. (per 21.3.4) + // You cannot leave those LWG people alone for a second. + } + + _CharT* + _M_refdata() throw() + { return reinterpret_cast<_CharT*>(this + 1); } + + _CharT* + _M_grab(const _Alloc& __alloc1, const _Alloc& __alloc2) + { + return (!_M_is_leaked() && __alloc1 == __alloc2) + ? _M_refcopy() : _M_clone(__alloc1); + } + + // Create & Destroy + static _Rep* + _S_create(size_type, size_type, const _Alloc&); + + void + _M_dispose(const _Alloc& __a) + { +#ifndef _GLIBCXX_FULLY_DYNAMIC_STRING + if (__builtin_expect(this != &_S_empty_rep(), false)) +#endif + if (__gnu_cxx::__exchange_and_add_dispatch(&this->_M_refcount, + -1) <= 0) + _M_destroy(__a); + } // XXX MT + + void + _M_destroy(const _Alloc&) throw(); + + _CharT* + _M_refcopy() throw() + { +#ifndef _GLIBCXX_FULLY_DYNAMIC_STRING + if (__builtin_expect(this != &_S_empty_rep(), false)) +#endif + __gnu_cxx::__atomic_add_dispatch(&this->_M_refcount, 1); + return _M_refdata(); + } // XXX MT + + _CharT* + _M_clone(const _Alloc&, size_type __res = 0); + }; + + // Use empty-base optimization: http://www.cantrip.org/emptyopt.html + struct _Alloc_hider : _Alloc + { + _Alloc_hider(_CharT* __dat, const _Alloc& __a) + : _Alloc(__a), _M_p(__dat) { } + + _CharT* _M_p; // The actual data. + }; + + public: + // Data Members (public): + // NB: This is an unsigned type, and thus represents the maximum + // size that the allocator can hold. + /// Value returned by various member functions when they fail. + static const size_type npos = static_cast(-1); + + private: + // Data Members (private): + mutable _Alloc_hider _M_dataplus; + + _CharT* + _M_data() const + { return _M_dataplus._M_p; } + + _CharT* + _M_data(_CharT* __p) + { return (_M_dataplus._M_p = __p); } + + _Rep* + _M_rep() const + { return &((reinterpret_cast<_Rep*> (_M_data()))[-1]); } + + // For the internal use we have functions similar to `begin'/`end' + // but they do not call _M_leak. + iterator + _M_ibegin() const + { return iterator(_M_data()); } + + iterator + _M_iend() const + { return iterator(_M_data() + this->size()); } + + void + _M_leak() // for use in begin() & non-const op[] + { + if (!_M_rep()->_M_is_leaked()) + _M_leak_hard(); + } + + size_type + _M_check(size_type __pos, const char* __s) const + { + if (__pos > this->size()) + __throw_out_of_range(__N(__s)); + return __pos; + } + + void + _M_check_length(size_type __n1, size_type __n2, const char* __s) const + { + if (this->max_size() - (this->size() - __n1) < __n2) + __throw_length_error(__N(__s)); + } + + // NB: _M_limit doesn't check for a bad __pos value. + size_type + _M_limit(size_type __pos, size_type __off) const + { + const bool __testoff = __off < this->size() - __pos; + return __testoff ? __off : this->size() - __pos; + } + + // True if _Rep and source do not overlap. + bool + _M_disjunct(const _CharT* __s) const + { + return (less()(__s, _M_data()) + || less()(_M_data() + this->size(), __s)); + } + + // When __n = 1 way faster than the general multichar + // traits_type::copy/move/assign. + static void + _M_copy(_CharT* __d, const _CharT* __s, size_type __n) + { + if (__n == 1) + traits_type::assign(*__d, *__s); + else + traits_type::copy(__d, __s, __n); + } + + static void + _M_move(_CharT* __d, const _CharT* __s, size_type __n) + { + if (__n == 1) + traits_type::assign(*__d, *__s); + else + traits_type::move(__d, __s, __n); + } + + static void + _M_assign(_CharT* __d, size_type __n, _CharT __c) + { + if (__n == 1) + traits_type::assign(*__d, __c); + else + traits_type::assign(__d, __n, __c); + } + + // _S_copy_chars is a separate template to permit specialization + // to optimize for the common case of pointers as iterators. + template + static void + _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2) + { + for (; __k1 != __k2; ++__k1, ++__p) + traits_type::assign(*__p, *__k1); // These types are off. + } + + static void + _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2) + { _S_copy_chars(__p, __k1.base(), __k2.base()); } + + static void + _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2) + { _S_copy_chars(__p, __k1.base(), __k2.base()); } + + static void + _S_copy_chars(_CharT* __p, _CharT* __k1, _CharT* __k2) + { _M_copy(__p, __k1, __k2 - __k1); } + + static void + _S_copy_chars(_CharT* __p, const _CharT* __k1, const _CharT* __k2) + { _M_copy(__p, __k1, __k2 - __k1); } + + static int + _S_compare(size_type __n1, size_type __n2) + { + const difference_type __d = difference_type(__n1 - __n2); + + if (__d > __gnu_cxx::__numeric_traits::__max) + return __gnu_cxx::__numeric_traits::__max; + else if (__d < __gnu_cxx::__numeric_traits::__min) + return __gnu_cxx::__numeric_traits::__min; + else + return int(__d); + } + + void + _M_mutate(size_type __pos, size_type __len1, size_type __len2); + + void + _M_leak_hard(); + + static _Rep& + _S_empty_rep() + { return _Rep::_S_empty_rep(); } + + public: + // Construct/copy/destroy: + // NB: We overload ctors in some cases instead of using default + // arguments, per 17.4.4.4 para. 2 item 2. + + /** + * @brief Default constructor creates an empty string. + */ + inline + basic_string(); + + /** + * @brief Construct an empty string using allocator @a a. + */ + explicit + basic_string(const _Alloc& __a); + + // NB: per LWG issue 42, semantics different from IS: + /** + * @brief Construct string with copy of value of @a str. + * @param str Source string. + */ + basic_string(const basic_string& __str); + /** + * @brief Construct string as copy of a substring. + * @param str Source string. + * @param pos Index of first character to copy from. + * @param n Number of characters to copy (default remainder). + */ + basic_string(const basic_string& __str, size_type __pos, + size_type __n = npos); + /** + * @brief Construct string as copy of a substring. + * @param str Source string. + * @param pos Index of first character to copy from. + * @param n Number of characters to copy. + * @param a Allocator to use. + */ + basic_string(const basic_string& __str, size_type __pos, + size_type __n, const _Alloc& __a); + + /** + * @brief Construct string initialized by a character array. + * @param s Source character array. + * @param n Number of characters to copy. + * @param a Allocator to use (default is default allocator). + * + * NB: @a s must have at least @a n characters, '\\0' has no special + * meaning. + */ + basic_string(const _CharT* __s, size_type __n, + const _Alloc& __a = _Alloc()); + /** + * @brief Construct string as copy of a C string. + * @param s Source C string. + * @param a Allocator to use (default is default allocator). + */ + basic_string(const _CharT* __s, const _Alloc& __a = _Alloc()); + /** + * @brief Construct string as multiple characters. + * @param n Number of characters. + * @param c Character to use. + * @param a Allocator to use (default is default allocator). + */ + basic_string(size_type __n, _CharT __c, const _Alloc& __a = _Alloc()); + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Construct string from an initializer list. + * @param l std::initializer_list of characters. + * @param a Allocator to use (default is default allocator). + */ + basic_string(initializer_list<_CharT> __l, const _Alloc& __a = _Alloc()); +#endif // __GXX_EXPERIMENTAL_CXX0X__ + + /** + * @brief Construct string as copy of a range. + * @param beg Start of range. + * @param end End of range. + * @param a Allocator to use (default is default allocator). + */ + template + basic_string(_InputIterator __beg, _InputIterator __end, + const _Alloc& __a = _Alloc()); + + /** + * @brief Destroy the string instance. + */ + ~basic_string() + { _M_rep()->_M_dispose(this->get_allocator()); } + + /** + * @brief Assign the value of @a str to this string. + * @param str Source string. + */ + basic_string& + operator=(const basic_string& __str) + { return this->assign(__str); } + + /** + * @brief Copy contents of @a s into this string. + * @param s Source null-terminated string. + */ + basic_string& + operator=(const _CharT* __s) + { return this->assign(__s); } + + /** + * @brief Set value to string of length 1. + * @param c Source character. + * + * Assigning to a character makes this string length 1 and + * (*this)[0] == @a c. + */ + basic_string& + operator=(_CharT __c) + { + this->assign(1, __c); + return *this; + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Set value to string constructed from initializer list. + * @param l std::initializer_list. + */ + basic_string& + operator=(initializer_list<_CharT> __l) + { + this->assign (__l.begin(), __l.end()); + return *this; + } +#endif // __GXX_EXPERIMENTAL_CXX0X__ + + // Iterators: + /** + * Returns a read/write iterator that points to the first character in + * the %string. Unshares the string. + */ + iterator + begin() + { + _M_leak(); + return iterator(_M_data()); + } + + /** + * Returns a read-only (constant) iterator that points to the first + * character in the %string. + */ + const_iterator + begin() const + { return const_iterator(_M_data()); } + + /** + * Returns a read/write iterator that points one past the last + * character in the %string. Unshares the string. + */ + iterator + end() + { + _M_leak(); + return iterator(_M_data() + this->size()); + } + + /** + * Returns a read-only (constant) iterator that points one past the + * last character in the %string. + */ + const_iterator + end() const + { return const_iterator(_M_data() + this->size()); } + + /** + * Returns a read/write reverse iterator that points to the last + * character in the %string. Iteration is done in reverse element + * order. Unshares the string. + */ + reverse_iterator + rbegin() + { return reverse_iterator(this->end()); } + + /** + * Returns a read-only (constant) reverse iterator that points + * to the last character in the %string. Iteration is done in + * reverse element order. + */ + const_reverse_iterator + rbegin() const + { return const_reverse_iterator(this->end()); } + + /** + * Returns a read/write reverse iterator that points to one before the + * first character in the %string. Iteration is done in reverse + * element order. Unshares the string. + */ + reverse_iterator + rend() + { return reverse_iterator(this->begin()); } + + /** + * Returns a read-only (constant) reverse iterator that points + * to one before the first character in the %string. Iteration + * is done in reverse element order. + */ + const_reverse_iterator + rend() const + { return const_reverse_iterator(this->begin()); } + + public: + // Capacity: + /// Returns the number of characters in the string, not including any + /// null-termination. + size_type + size() const + { return _M_rep()->_M_length; } + + /// Returns the number of characters in the string, not including any + /// null-termination. + size_type + length() const + { return _M_rep()->_M_length; } + + /// Returns the size() of the largest possible %string. + size_type + max_size() const + { return _Rep::_S_max_size; } + + /** + * @brief Resizes the %string to the specified number of characters. + * @param n Number of characters the %string should contain. + * @param c Character to fill any new elements. + * + * This function will %resize the %string to the specified + * number of characters. If the number is smaller than the + * %string's current size the %string is truncated, otherwise + * the %string is extended and new elements are set to @a c. + */ + void + resize(size_type __n, _CharT __c); + + /** + * @brief Resizes the %string to the specified number of characters. + * @param n Number of characters the %string should contain. + * + * This function will resize the %string to the specified length. If + * the new size is smaller than the %string's current size the %string + * is truncated, otherwise the %string is extended and new characters + * are default-constructed. For basic types such as char, this means + * setting them to 0. + */ + void + resize(size_type __n) + { this->resize(__n, _CharT()); } + + /** + * Returns the total number of characters that the %string can hold + * before needing to allocate more memory. + */ + size_type + capacity() const + { return _M_rep()->_M_capacity; } + + /** + * @brief Attempt to preallocate enough memory for specified number of + * characters. + * @param res_arg Number of characters required. + * @throw std::length_error If @a res_arg exceeds @c max_size(). + * + * This function attempts to reserve enough memory for the + * %string to hold the specified number of characters. If the + * number requested is more than max_size(), length_error is + * thrown. + * + * The advantage of this function is that if optimal code is a + * necessity and the user can determine the string length that will be + * required, the user can reserve the memory in %advance, and thus + * prevent a possible reallocation of memory and copying of %string + * data. + */ + void + reserve(size_type __res_arg = 0); + + /** + * Erases the string, making it empty. + */ + void + clear() + { _M_mutate(0, this->size(), 0); } + + /** + * Returns true if the %string is empty. Equivalent to *this == "". + */ + bool + empty() const + { return this->size() == 0; } + + // Element access: + /** + * @brief Subscript access to the data contained in the %string. + * @param pos The index of the character to access. + * @return Read-only (constant) reference to the character. + * + * This operator allows for easy, array-style, data access. + * Note that data access with this operator is unchecked and + * out_of_range lookups are not defined. (For checked lookups + * see at().) + */ + const_reference + operator[] (size_type __pos) const + { + _GLIBCXX_DEBUG_ASSERT(__pos <= size()); + return _M_data()[__pos]; + } + + /** + * @brief Subscript access to the data contained in the %string. + * @param pos The index of the character to access. + * @return Read/write reference to the character. + * + * This operator allows for easy, array-style, data access. + * Note that data access with this operator is unchecked and + * out_of_range lookups are not defined. (For checked lookups + * see at().) Unshares the string. + */ + reference + operator[](size_type __pos) + { + // allow pos == size() as v3 extension: + _GLIBCXX_DEBUG_ASSERT(__pos <= size()); + // but be strict in pedantic mode: + _GLIBCXX_DEBUG_PEDASSERT(__pos < size()); + _M_leak(); + return _M_data()[__pos]; + } + + /** + * @brief Provides access to the data contained in the %string. + * @param n The index of the character to access. + * @return Read-only (const) reference to the character. + * @throw std::out_of_range If @a n is an invalid index. + * + * This function provides for safer data access. The parameter is + * first checked that it is in the range of the string. The function + * throws out_of_range if the check fails. + */ + const_reference + at(size_type __n) const + { + if (__n >= this->size()) + __throw_out_of_range(__N("basic_string::at")); + return _M_data()[__n]; + } + + /** + * @brief Provides access to the data contained in the %string. + * @param n The index of the character to access. + * @return Read/write reference to the character. + * @throw std::out_of_range If @a n is an invalid index. + * + * This function provides for safer data access. The parameter is + * first checked that it is in the range of the string. The function + * throws out_of_range if the check fails. Success results in + * unsharing the string. + */ + reference + at(size_type __n) + { + if (__n >= size()) + __throw_out_of_range(__N("basic_string::at")); + _M_leak(); + return _M_data()[__n]; + } + + // Modifiers: + /** + * @brief Append a string to this string. + * @param str The string to append. + * @return Reference to this string. + */ + basic_string& + operator+=(const basic_string& __str) + { return this->append(__str); } + + /** + * @brief Append a C string. + * @param s The C string to append. + * @return Reference to this string. + */ + basic_string& + operator+=(const _CharT* __s) + { return this->append(__s); } + + /** + * @brief Append a character. + * @param c The character to append. + * @return Reference to this string. + */ + basic_string& + operator+=(_CharT __c) + { + this->push_back(__c); + return *this; + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Append an initializer_list of characters. + * @param l The initializer_list of characters to be appended. + * @return Reference to this string. + */ + basic_string& + operator+=(initializer_list<_CharT> __l) + { return this->append(__l.begin(), __l.end()); } +#endif // __GXX_EXPERIMENTAL_CXX0X__ + + /** + * @brief Append a string to this string. + * @param str The string to append. + * @return Reference to this string. + */ + basic_string& + append(const basic_string& __str); + + /** + * @brief Append a substring. + * @param str The string to append. + * @param pos Index of the first character of str to append. + * @param n The number of characters to append. + * @return Reference to this string. + * @throw std::out_of_range if @a pos is not a valid index. + * + * This function appends @a n characters from @a str starting at @a pos + * to this string. If @a n is is larger than the number of available + * characters in @a str, the remainder of @a str is appended. + */ + basic_string& + append(const basic_string& __str, size_type __pos, size_type __n); + + /** + * @brief Append a C substring. + * @param s The C string to append. + * @param n The number of characters to append. + * @return Reference to this string. + */ + basic_string& + append(const _CharT* __s, size_type __n); + + /** + * @brief Append a C string. + * @param s The C string to append. + * @return Reference to this string. + */ + basic_string& + append(const _CharT* __s) + { + __glibcxx_requires_string(__s); + return this->append(__s, traits_type::length(__s)); + } + + /** + * @brief Append multiple characters. + * @param n The number of characters to append. + * @param c The character to use. + * @return Reference to this string. + * + * Appends n copies of c to this string. + */ + basic_string& + append(size_type __n, _CharT __c); + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Append an initializer_list of characters. + * @param l The initializer_list of characters to append. + * @return Reference to this string. + */ + basic_string& + append(initializer_list<_CharT> __l) + { return this->append(__l.begin(), __l.end()); } +#endif // __GXX_EXPERIMENTAL_CXX0X__ + + /** + * @brief Append a range of characters. + * @param first Iterator referencing the first character to append. + * @param last Iterator marking the end of the range. + * @return Reference to this string. + * + * Appends characters in the range [first,last) to this string. + */ + template + basic_string& + append(_InputIterator __first, _InputIterator __last) + { return this->replace(_M_iend(), _M_iend(), __first, __last); } + + /** + * @brief Append a single character. + * @param c Character to append. + */ + void + push_back(_CharT __c) + { + const size_type __len = 1 + this->size(); + if (__len > this->capacity() || _M_rep()->_M_is_shared()) + this->reserve(__len); + traits_type::assign(_M_data()[this->size()], __c); + _M_rep()->_M_set_length_and_sharable(__len); + } + + /** + * @brief Set value to contents of another string. + * @param str Source string to use. + * @return Reference to this string. + */ + basic_string& + assign(const basic_string& __str); + + /** + * @brief Set value to a substring of a string. + * @param str The string to use. + * @param pos Index of the first character of str. + * @param n Number of characters to use. + * @return Reference to this string. + * @throw std::out_of_range if @a pos is not a valid index. + * + * This function sets this string to the substring of @a str consisting + * of @a n characters at @a pos. If @a n is is larger than the number + * of available characters in @a str, the remainder of @a str is used. + */ + basic_string& + assign(const basic_string& __str, size_type __pos, size_type __n) + { return this->assign(__str._M_data() + + __str._M_check(__pos, "basic_string::assign"), + __str._M_limit(__pos, __n)); } + + /** + * @brief Set value to a C substring. + * @param s The C string to use. + * @param n Number of characters to use. + * @return Reference to this string. + * + * This function sets the value of this string to the first @a n + * characters of @a s. If @a n is is larger than the number of + * available characters in @a s, the remainder of @a s is used. + */ + basic_string& + assign(const _CharT* __s, size_type __n); + + /** + * @brief Set value to contents of a C string. + * @param s The C string to use. + * @return Reference to this string. + * + * This function sets the value of this string to the value of @a s. + * The data is copied, so there is no dependence on @a s once the + * function returns. + */ + basic_string& + assign(const _CharT* __s) + { + __glibcxx_requires_string(__s); + return this->assign(__s, traits_type::length(__s)); + } + + /** + * @brief Set value to multiple characters. + * @param n Length of the resulting string. + * @param c The character to use. + * @return Reference to this string. + * + * This function sets the value of this string to @a n copies of + * character @a c. + */ + basic_string& + assign(size_type __n, _CharT __c) + { return _M_replace_aux(size_type(0), this->size(), __n, __c); } + + /** + * @brief Set value to a range of characters. + * @param first Iterator referencing the first character to append. + * @param last Iterator marking the end of the range. + * @return Reference to this string. + * + * Sets value of string to characters in the range [first,last). + */ + template + basic_string& + assign(_InputIterator __first, _InputIterator __last) + { return this->replace(_M_ibegin(), _M_iend(), __first, __last); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Set value to an initializer_list of characters. + * @param l The initializer_list of characters to assign. + * @return Reference to this string. + */ + basic_string& + assign(initializer_list<_CharT> __l) + { return this->assign(__l.begin(), __l.end()); } +#endif // __GXX_EXPERIMENTAL_CXX0X__ + + /** + * @brief Insert multiple characters. + * @param p Iterator referencing location in string to insert at. + * @param n Number of characters to insert + * @param c The character to insert. + * @throw std::length_error If new length exceeds @c max_size(). + * + * Inserts @a n copies of character @a c starting at the position + * referenced by iterator @a p. If adding characters causes the length + * to exceed max_size(), length_error is thrown. The value of the + * string doesn't change if an error is thrown. + */ + void + insert(iterator __p, size_type __n, _CharT __c) + { this->replace(__p, __p, __n, __c); } + + /** + * @brief Insert a range of characters. + * @param p Iterator referencing location in string to insert at. + * @param beg Start of range. + * @param end End of range. + * @throw std::length_error If new length exceeds @c max_size(). + * + * Inserts characters in range [beg,end). If adding characters causes + * the length to exceed max_size(), length_error is thrown. The value + * of the string doesn't change if an error is thrown. + */ + template + void + insert(iterator __p, _InputIterator __beg, _InputIterator __end) + { this->replace(__p, __p, __beg, __end); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Insert an initializer_list of characters. + * @param p Iterator referencing location in string to insert at. + * @param l The initializer_list of characters to insert. + * @throw std::length_error If new length exceeds @c max_size(). + */ + void + insert(iterator __p, initializer_list<_CharT> __l) + { this->insert(__p, __l.begin(), __l.end()); } +#endif // __GXX_EXPERIMENTAL_CXX0X__ + + /** + * @brief Insert value of a string. + * @param pos1 Iterator referencing location in string to insert at. + * @param str The string to insert. + * @return Reference to this string. + * @throw std::length_error If new length exceeds @c max_size(). + * + * Inserts value of @a str starting at @a pos1. If adding characters + * causes the length to exceed max_size(), length_error is thrown. The + * value of the string doesn't change if an error is thrown. + */ + basic_string& + insert(size_type __pos1, const basic_string& __str) + { return this->insert(__pos1, __str, size_type(0), __str.size()); } + + /** + * @brief Insert a substring. + * @param pos1 Iterator referencing location in string to insert at. + * @param str The string to insert. + * @param pos2 Start of characters in str to insert. + * @param n Number of characters to insert. + * @return Reference to this string. + * @throw std::length_error If new length exceeds @c max_size(). + * @throw std::out_of_range If @a pos1 > size() or + * @a pos2 > @a str.size(). + * + * Starting at @a pos1, insert @a n character of @a str beginning with + * @a pos2. If adding characters causes the length to exceed + * max_size(), length_error is thrown. If @a pos1 is beyond the end of + * this string or @a pos2 is beyond the end of @a str, out_of_range is + * thrown. The value of the string doesn't change if an error is + * thrown. + */ + basic_string& + insert(size_type __pos1, const basic_string& __str, + size_type __pos2, size_type __n) + { return this->insert(__pos1, __str._M_data() + + __str._M_check(__pos2, "basic_string::insert"), + __str._M_limit(__pos2, __n)); } + + /** + * @brief Insert a C substring. + * @param pos Iterator referencing location in string to insert at. + * @param s The C string to insert. + * @param n The number of characters to insert. + * @return Reference to this string. + * @throw std::length_error If new length exceeds @c max_size(). + * @throw std::out_of_range If @a pos is beyond the end of this + * string. + * + * Inserts the first @a n characters of @a s starting at @a pos. If + * adding characters causes the length to exceed max_size(), + * length_error is thrown. If @a pos is beyond end(), out_of_range is + * thrown. The value of the string doesn't change if an error is + * thrown. + */ + basic_string& + insert(size_type __pos, const _CharT* __s, size_type __n); + + /** + * @brief Insert a C string. + * @param pos Iterator referencing location in string to insert at. + * @param s The C string to insert. + * @return Reference to this string. + * @throw std::length_error If new length exceeds @c max_size(). + * @throw std::out_of_range If @a pos is beyond the end of this + * string. + * + * Inserts the first @a n characters of @a s starting at @a pos. If + * adding characters causes the length to exceed max_size(), + * length_error is thrown. If @a pos is beyond end(), out_of_range is + * thrown. The value of the string doesn't change if an error is + * thrown. + */ + basic_string& + insert(size_type __pos, const _CharT* __s) + { + __glibcxx_requires_string(__s); + return this->insert(__pos, __s, traits_type::length(__s)); + } + + /** + * @brief Insert multiple characters. + * @param pos Index in string to insert at. + * @param n Number of characters to insert + * @param c The character to insert. + * @return Reference to this string. + * @throw std::length_error If new length exceeds @c max_size(). + * @throw std::out_of_range If @a pos is beyond the end of this + * string. + * + * Inserts @a n copies of character @a c starting at index @a pos. If + * adding characters causes the length to exceed max_size(), + * length_error is thrown. If @a pos > length(), out_of_range is + * thrown. The value of the string doesn't change if an error is + * thrown. + */ + basic_string& + insert(size_type __pos, size_type __n, _CharT __c) + { return _M_replace_aux(_M_check(__pos, "basic_string::insert"), + size_type(0), __n, __c); } + + /** + * @brief Insert one character. + * @param p Iterator referencing position in string to insert at. + * @param c The character to insert. + * @return Iterator referencing newly inserted char. + * @throw std::length_error If new length exceeds @c max_size(). + * + * Inserts character @a c at position referenced by @a p. If adding + * character causes the length to exceed max_size(), length_error is + * thrown. If @a p is beyond end of string, out_of_range is thrown. + * The value of the string doesn't change if an error is thrown. + */ + iterator + insert(iterator __p, _CharT __c) + { + _GLIBCXX_DEBUG_PEDASSERT(__p >= _M_ibegin() && __p <= _M_iend()); + const size_type __pos = __p - _M_ibegin(); + _M_replace_aux(__pos, size_type(0), size_type(1), __c); + _M_rep()->_M_set_leaked(); + return iterator(_M_data() + __pos); + } + + /** + * @brief Remove characters. + * @param pos Index of first character to remove (default 0). + * @param n Number of characters to remove (default remainder). + * @return Reference to this string. + * @throw std::out_of_range If @a pos is beyond the end of this + * string. + * + * Removes @a n characters from this string starting at @a pos. The + * length of the string is reduced by @a n. If there are < @a n + * characters to remove, the remainder of the string is truncated. If + * @a p is beyond end of string, out_of_range is thrown. The value of + * the string doesn't change if an error is thrown. + */ + basic_string& + erase(size_type __pos = 0, size_type __n = npos) + { + _M_mutate(_M_check(__pos, "basic_string::erase"), + _M_limit(__pos, __n), size_type(0)); + return *this; + } + + /** + * @brief Remove one character. + * @param position Iterator referencing the character to remove. + * @return iterator referencing same location after removal. + * + * Removes the character at @a position from this string. The value + * of the string doesn't change if an error is thrown. + */ + iterator + erase(iterator __position) + { + _GLIBCXX_DEBUG_PEDASSERT(__position >= _M_ibegin() + && __position < _M_iend()); + const size_type __pos = __position - _M_ibegin(); + _M_mutate(__pos, size_type(1), size_type(0)); + _M_rep()->_M_set_leaked(); + return iterator(_M_data() + __pos); + } + + /** + * @brief Remove a range of characters. + * @param first Iterator referencing the first character to remove. + * @param last Iterator referencing the end of the range. + * @return Iterator referencing location of first after removal. + * + * Removes the characters in the range [first,last) from this string. + * The value of the string doesn't change if an error is thrown. + */ + iterator + erase(iterator __first, iterator __last) + { + _GLIBCXX_DEBUG_PEDASSERT(__first >= _M_ibegin() && __first <= __last + && __last <= _M_iend()); + const size_type __pos = __first - _M_ibegin(); + _M_mutate(__pos, __last - __first, size_type(0)); + _M_rep()->_M_set_leaked(); + return iterator(_M_data() + __pos); + } + + /** + * @brief Replace characters with value from another string. + * @param pos Index of first character to replace. + * @param n Number of characters to be replaced. + * @param str String to insert. + * @return Reference to this string. + * @throw std::out_of_range If @a pos is beyond the end of this + * string. + * @throw std::length_error If new length exceeds @c max_size(). + * + * Removes the characters in the range [pos,pos+n) from this string. + * In place, the value of @a str is inserted. If @a pos is beyond end + * of string, out_of_range is thrown. If the length of the result + * exceeds max_size(), length_error is thrown. The value of the string + * doesn't change if an error is thrown. + */ + basic_string& + replace(size_type __pos, size_type __n, const basic_string& __str) + { return this->replace(__pos, __n, __str._M_data(), __str.size()); } + + /** + * @brief Replace characters with value from another string. + * @param pos1 Index of first character to replace. + * @param n1 Number of characters to be replaced. + * @param str String to insert. + * @param pos2 Index of first character of str to use. + * @param n2 Number of characters from str to use. + * @return Reference to this string. + * @throw std::out_of_range If @a pos1 > size() or @a pos2 > + * str.size(). + * @throw std::length_error If new length exceeds @c max_size(). + * + * Removes the characters in the range [pos1,pos1 + n) from this + * string. In place, the value of @a str is inserted. If @a pos is + * beyond end of string, out_of_range is thrown. If the length of the + * result exceeds max_size(), length_error is thrown. The value of the + * string doesn't change if an error is thrown. + */ + basic_string& + replace(size_type __pos1, size_type __n1, const basic_string& __str, + size_type __pos2, size_type __n2) + { return this->replace(__pos1, __n1, __str._M_data() + + __str._M_check(__pos2, "basic_string::replace"), + __str._M_limit(__pos2, __n2)); } + + /** + * @brief Replace characters with value of a C substring. + * @param pos Index of first character to replace. + * @param n1 Number of characters to be replaced. + * @param s C string to insert. + * @param n2 Number of characters from @a s to use. + * @return Reference to this string. + * @throw std::out_of_range If @a pos1 > size(). + * @throw std::length_error If new length exceeds @c max_size(). + * + * Removes the characters in the range [pos,pos + n1) from this string. + * In place, the first @a n2 characters of @a s are inserted, or all + * of @a s if @a n2 is too large. If @a pos is beyond end of string, + * out_of_range is thrown. If the length of result exceeds max_size(), + * length_error is thrown. The value of the string doesn't change if + * an error is thrown. + */ + basic_string& + replace(size_type __pos, size_type __n1, const _CharT* __s, + size_type __n2); + + /** + * @brief Replace characters with value of a C string. + * @param pos Index of first character to replace. + * @param n1 Number of characters to be replaced. + * @param s C string to insert. + * @return Reference to this string. + * @throw std::out_of_range If @a pos > size(). + * @throw std::length_error If new length exceeds @c max_size(). + * + * Removes the characters in the range [pos,pos + n1) from this string. + * In place, the first @a n characters of @a s are inserted. If @a + * pos is beyond end of string, out_of_range is thrown. If the length + * of result exceeds max_size(), length_error is thrown. The value of + * the string doesn't change if an error is thrown. + */ + basic_string& + replace(size_type __pos, size_type __n1, const _CharT* __s) + { + __glibcxx_requires_string(__s); + return this->replace(__pos, __n1, __s, traits_type::length(__s)); + } + + /** + * @brief Replace characters with multiple characters. + * @param pos Index of first character to replace. + * @param n1 Number of characters to be replaced. + * @param n2 Number of characters to insert. + * @param c Character to insert. + * @return Reference to this string. + * @throw std::out_of_range If @a pos > size(). + * @throw std::length_error If new length exceeds @c max_size(). + * + * Removes the characters in the range [pos,pos + n1) from this string. + * In place, @a n2 copies of @a c are inserted. If @a pos is beyond + * end of string, out_of_range is thrown. If the length of result + * exceeds max_size(), length_error is thrown. The value of the string + * doesn't change if an error is thrown. + */ + basic_string& + replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c) + { return _M_replace_aux(_M_check(__pos, "basic_string::replace"), + _M_limit(__pos, __n1), __n2, __c); } + + /** + * @brief Replace range of characters with string. + * @param i1 Iterator referencing start of range to replace. + * @param i2 Iterator referencing end of range to replace. + * @param str String value to insert. + * @return Reference to this string. + * @throw std::length_error If new length exceeds @c max_size(). + * + * Removes the characters in the range [i1,i2). In place, the value of + * @a str is inserted. If the length of result exceeds max_size(), + * length_error is thrown. The value of the string doesn't change if + * an error is thrown. + */ + basic_string& + replace(iterator __i1, iterator __i2, const basic_string& __str) + { return this->replace(__i1, __i2, __str._M_data(), __str.size()); } + + /** + * @brief Replace range of characters with C substring. + * @param i1 Iterator referencing start of range to replace. + * @param i2 Iterator referencing end of range to replace. + * @param s C string value to insert. + * @param n Number of characters from s to insert. + * @return Reference to this string. + * @throw std::length_error If new length exceeds @c max_size(). + * + * Removes the characters in the range [i1,i2). In place, the first @a + * n characters of @a s are inserted. If the length of result exceeds + * max_size(), length_error is thrown. The value of the string doesn't + * change if an error is thrown. + */ + basic_string& + replace(iterator __i1, iterator __i2, const _CharT* __s, size_type __n) + { + _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2 + && __i2 <= _M_iend()); + return this->replace(__i1 - _M_ibegin(), __i2 - __i1, __s, __n); + } + + /** + * @brief Replace range of characters with C string. + * @param i1 Iterator referencing start of range to replace. + * @param i2 Iterator referencing end of range to replace. + * @param s C string value to insert. + * @return Reference to this string. + * @throw std::length_error If new length exceeds @c max_size(). + * + * Removes the characters in the range [i1,i2). In place, the + * characters of @a s are inserted. If the length of result exceeds + * max_size(), length_error is thrown. The value of the string doesn't + * change if an error is thrown. + */ + basic_string& + replace(iterator __i1, iterator __i2, const _CharT* __s) + { + __glibcxx_requires_string(__s); + return this->replace(__i1, __i2, __s, traits_type::length(__s)); + } + + /** + * @brief Replace range of characters with multiple characters + * @param i1 Iterator referencing start of range to replace. + * @param i2 Iterator referencing end of range to replace. + * @param n Number of characters to insert. + * @param c Character to insert. + * @return Reference to this string. + * @throw std::length_error If new length exceeds @c max_size(). + * + * Removes the characters in the range [i1,i2). In place, @a n copies + * of @a c are inserted. If the length of result exceeds max_size(), + * length_error is thrown. The value of the string doesn't change if + * an error is thrown. + */ + basic_string& + replace(iterator __i1, iterator __i2, size_type __n, _CharT __c) + { + _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2 + && __i2 <= _M_iend()); + return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __c); + } + + /** + * @brief Replace range of characters with range. + * @param i1 Iterator referencing start of range to replace. + * @param i2 Iterator referencing end of range to replace. + * @param k1 Iterator referencing start of range to insert. + * @param k2 Iterator referencing end of range to insert. + * @return Reference to this string. + * @throw std::length_error If new length exceeds @c max_size(). + * + * Removes the characters in the range [i1,i2). In place, characters + * in the range [k1,k2) are inserted. If the length of result exceeds + * max_size(), length_error is thrown. The value of the string doesn't + * change if an error is thrown. + */ + template + basic_string& + replace(iterator __i1, iterator __i2, + _InputIterator __k1, _InputIterator __k2) + { + _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2 + && __i2 <= _M_iend()); + __glibcxx_requires_valid_range(__k1, __k2); + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + return _M_replace_dispatch(__i1, __i2, __k1, __k2, _Integral()); + } + + // Specializations for the common case of pointer and iterator: + // useful to avoid the overhead of temporary buffering in _M_replace. + basic_string& + replace(iterator __i1, iterator __i2, _CharT* __k1, _CharT* __k2) + { + _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2 + && __i2 <= _M_iend()); + __glibcxx_requires_valid_range(__k1, __k2); + return this->replace(__i1 - _M_ibegin(), __i2 - __i1, + __k1, __k2 - __k1); + } + + basic_string& + replace(iterator __i1, iterator __i2, + const _CharT* __k1, const _CharT* __k2) + { + _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2 + && __i2 <= _M_iend()); + __glibcxx_requires_valid_range(__k1, __k2); + return this->replace(__i1 - _M_ibegin(), __i2 - __i1, + __k1, __k2 - __k1); + } + + basic_string& + replace(iterator __i1, iterator __i2, iterator __k1, iterator __k2) + { + _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2 + && __i2 <= _M_iend()); + __glibcxx_requires_valid_range(__k1, __k2); + return this->replace(__i1 - _M_ibegin(), __i2 - __i1, + __k1.base(), __k2 - __k1); + } + + basic_string& + replace(iterator __i1, iterator __i2, + const_iterator __k1, const_iterator __k2) + { + _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2 + && __i2 <= _M_iend()); + __glibcxx_requires_valid_range(__k1, __k2); + return this->replace(__i1 - _M_ibegin(), __i2 - __i1, + __k1.base(), __k2 - __k1); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Replace range of characters with initializer_list. + * @param i1 Iterator referencing start of range to replace. + * @param i2 Iterator referencing end of range to replace. + * @param l The initializer_list of characters to insert. + * @return Reference to this string. + * @throw std::length_error If new length exceeds @c max_size(). + * + * Removes the characters in the range [i1,i2). In place, characters + * in the range [k1,k2) are inserted. If the length of result exceeds + * max_size(), length_error is thrown. The value of the string doesn't + * change if an error is thrown. + */ + basic_string& replace(iterator __i1, iterator __i2, + initializer_list<_CharT> __l) + { return this->replace(__i1, __i2, __l.begin(), __l.end()); } +#endif // __GXX_EXPERIMENTAL_CXX0X__ + + private: + template + basic_string& + _M_replace_dispatch(iterator __i1, iterator __i2, _Integer __n, + _Integer __val, __true_type) + { return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __val); } + + template + basic_string& + _M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1, + _InputIterator __k2, __false_type); + + basic_string& + _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2, + _CharT __c); + + basic_string& + _M_replace_safe(size_type __pos1, size_type __n1, const _CharT* __s, + size_type __n2); + + // _S_construct_aux is used to implement the 21.3.1 para 15 which + // requires special behaviour if _InIter is an integral type + template + static _CharT* + _S_construct_aux(_InIterator __beg, _InIterator __end, + const _Alloc& __a, __false_type) + { + typedef typename iterator_traits<_InIterator>::iterator_category _Tag; + return _S_construct(__beg, __end, __a, _Tag()); + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 438. Ambiguity in the "do the right thing" clause + template + static _CharT* + _S_construct_aux(_Integer __beg, _Integer __end, + const _Alloc& __a, __true_type) + { return _S_construct(static_cast(__beg), __end, __a); } + + template + static _CharT* + _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a) + { + typedef typename std::__is_integer<_InIterator>::__type _Integral; + return _S_construct_aux(__beg, __end, __a, _Integral()); + } + + // For Input Iterators, used in istreambuf_iterators, etc. + template + static _CharT* + _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a, + input_iterator_tag); + + // For forward_iterators up to random_access_iterators, used for + // string::iterator, _CharT*, etc. + template + static _CharT* + _S_construct(_FwdIterator __beg, _FwdIterator __end, const _Alloc& __a, + forward_iterator_tag); + + static _CharT* + _S_construct(size_type __req, _CharT __c, const _Alloc& __a); + + public: + + /** + * @brief Copy substring into C string. + * @param s C string to copy value into. + * @param n Number of characters to copy. + * @param pos Index of first character to copy. + * @return Number of characters actually copied + * @throw std::out_of_range If pos > size(). + * + * Copies up to @a n characters starting at @a pos into the C string @a + * s. If @a pos is greater than size(), out_of_range is thrown. + */ + size_type + copy(_CharT* __s, size_type __n, size_type __pos = 0) const; + + /** + * @brief Swap contents with another string. + * @param s String to swap with. + * + * Exchanges the contents of this string with that of @a s in constant + * time. + */ + void + swap(basic_string& __s); + + // String operations: + /** + * @brief Return const pointer to null-terminated contents. + * + * This is a handle to internal data. Do not modify or dire things may + * happen. + */ + const _CharT* + c_str() const + { return _M_data(); } + + /** + * @brief Return const pointer to contents. + * + * This is a handle to internal data. Do not modify or dire things may + * happen. + */ + const _CharT* + data() const + { return _M_data(); } + + /** + * @brief Return copy of allocator used to construct this string. + */ + allocator_type + get_allocator() const + { return _M_dataplus; } + + /** + * @brief Find position of a C substring. + * @param s C string to locate. + * @param pos Index of character to search from. + * @param n Number of characters from @a s to search for. + * @return Index of start of first occurrence. + * + * Starting from @a pos, searches forward for the first @a n characters + * in @a s within this string. If found, returns the index where it + * begins. If not found, returns npos. + */ + size_type + find(const _CharT* __s, size_type __pos, size_type __n) const; + + /** + * @brief Find position of a string. + * @param str String to locate. + * @param pos Index of character to search from (default 0). + * @return Index of start of first occurrence. + * + * Starting from @a pos, searches forward for value of @a str within + * this string. If found, returns the index where it begins. If not + * found, returns npos. + */ + size_type + find(const basic_string& __str, size_type __pos = 0) const + { return this->find(__str.data(), __pos, __str.size()); } + + /** + * @brief Find position of a C string. + * @param s C string to locate. + * @param pos Index of character to search from (default 0). + * @return Index of start of first occurrence. + * + * Starting from @a pos, searches forward for the value of @a s within + * this string. If found, returns the index where it begins. If not + * found, returns npos. + */ + size_type + find(const _CharT* __s, size_type __pos = 0) const + { + __glibcxx_requires_string(__s); + return this->find(__s, __pos, traits_type::length(__s)); + } + + /** + * @brief Find position of a character. + * @param c Character to locate. + * @param pos Index of character to search from (default 0). + * @return Index of first occurrence. + * + * Starting from @a pos, searches forward for @a c within this string. + * If found, returns the index where it was found. If not found, + * returns npos. + */ + size_type + find(_CharT __c, size_type __pos = 0) const; + + /** + * @brief Find last position of a string. + * @param str String to locate. + * @param pos Index of character to search back from (default end). + * @return Index of start of last occurrence. + * + * Starting from @a pos, searches backward for value of @a str within + * this string. If found, returns the index where it begins. If not + * found, returns npos. + */ + size_type + rfind(const basic_string& __str, size_type __pos = npos) const + { return this->rfind(__str.data(), __pos, __str.size()); } + + /** + * @brief Find last position of a C substring. + * @param s C string to locate. + * @param pos Index of character to search back from. + * @param n Number of characters from s to search for. + * @return Index of start of last occurrence. + * + * Starting from @a pos, searches backward for the first @a n + * characters in @a s within this string. If found, returns the index + * where it begins. If not found, returns npos. + */ + size_type + rfind(const _CharT* __s, size_type __pos, size_type __n) const; + + /** + * @brief Find last position of a C string. + * @param s C string to locate. + * @param pos Index of character to start search at (default end). + * @return Index of start of last occurrence. + * + * Starting from @a pos, searches backward for the value of @a s within + * this string. If found, returns the index where it begins. If not + * found, returns npos. + */ + size_type + rfind(const _CharT* __s, size_type __pos = npos) const + { + __glibcxx_requires_string(__s); + return this->rfind(__s, __pos, traits_type::length(__s)); + } + + /** + * @brief Find last position of a character. + * @param c Character to locate. + * @param pos Index of character to search back from (default end). + * @return Index of last occurrence. + * + * Starting from @a pos, searches backward for @a c within this string. + * If found, returns the index where it was found. If not found, + * returns npos. + */ + size_type + rfind(_CharT __c, size_type __pos = npos) const; + + /** + * @brief Find position of a character of string. + * @param str String containing characters to locate. + * @param pos Index of character to search from (default 0). + * @return Index of first occurrence. + * + * Starting from @a pos, searches forward for one of the characters of + * @a str within this string. If found, returns the index where it was + * found. If not found, returns npos. + */ + size_type + find_first_of(const basic_string& __str, size_type __pos = 0) const + { return this->find_first_of(__str.data(), __pos, __str.size()); } + + /** + * @brief Find position of a character of C substring. + * @param s String containing characters to locate. + * @param pos Index of character to search from. + * @param n Number of characters from s to search for. + * @return Index of first occurrence. + * + * Starting from @a pos, searches forward for one of the first @a n + * characters of @a s within this string. If found, returns the index + * where it was found. If not found, returns npos. + */ + size_type + find_first_of(const _CharT* __s, size_type __pos, size_type __n) const; + + /** + * @brief Find position of a character of C string. + * @param s String containing characters to locate. + * @param pos Index of character to search from (default 0). + * @return Index of first occurrence. + * + * Starting from @a pos, searches forward for one of the characters of + * @a s within this string. If found, returns the index where it was + * found. If not found, returns npos. + */ + size_type + find_first_of(const _CharT* __s, size_type __pos = 0) const + { + __glibcxx_requires_string(__s); + return this->find_first_of(__s, __pos, traits_type::length(__s)); + } + + /** + * @brief Find position of a character. + * @param c Character to locate. + * @param pos Index of character to search from (default 0). + * @return Index of first occurrence. + * + * Starting from @a pos, searches forward for the character @a c within + * this string. If found, returns the index where it was found. If + * not found, returns npos. + * + * Note: equivalent to find(c, pos). + */ + size_type + find_first_of(_CharT __c, size_type __pos = 0) const + { return this->find(__c, __pos); } + + /** + * @brief Find last position of a character of string. + * @param str String containing characters to locate. + * @param pos Index of character to search back from (default end). + * @return Index of last occurrence. + * + * Starting from @a pos, searches backward for one of the characters of + * @a str within this string. If found, returns the index where it was + * found. If not found, returns npos. + */ + size_type + find_last_of(const basic_string& __str, size_type __pos = npos) const + { return this->find_last_of(__str.data(), __pos, __str.size()); } + + /** + * @brief Find last position of a character of C substring. + * @param s C string containing characters to locate. + * @param pos Index of character to search back from. + * @param n Number of characters from s to search for. + * @return Index of last occurrence. + * + * Starting from @a pos, searches backward for one of the first @a n + * characters of @a s within this string. If found, returns the index + * where it was found. If not found, returns npos. + */ + size_type + find_last_of(const _CharT* __s, size_type __pos, size_type __n) const; + + /** + * @brief Find last position of a character of C string. + * @param s C string containing characters to locate. + * @param pos Index of character to search back from (default end). + * @return Index of last occurrence. + * + * Starting from @a pos, searches backward for one of the characters of + * @a s within this string. If found, returns the index where it was + * found. If not found, returns npos. + */ + size_type + find_last_of(const _CharT* __s, size_type __pos = npos) const + { + __glibcxx_requires_string(__s); + return this->find_last_of(__s, __pos, traits_type::length(__s)); + } + + /** + * @brief Find last position of a character. + * @param c Character to locate. + * @param pos Index of character to search back from (default end). + * @return Index of last occurrence. + * + * Starting from @a pos, searches backward for @a c within this string. + * If found, returns the index where it was found. If not found, + * returns npos. + * + * Note: equivalent to rfind(c, pos). + */ + size_type + find_last_of(_CharT __c, size_type __pos = npos) const + { return this->rfind(__c, __pos); } + + /** + * @brief Find position of a character not in string. + * @param str String containing characters to avoid. + * @param pos Index of character to search from (default 0). + * @return Index of first occurrence. + * + * Starting from @a pos, searches forward for a character not contained + * in @a str within this string. If found, returns the index where it + * was found. If not found, returns npos. + */ + size_type + find_first_not_of(const basic_string& __str, size_type __pos = 0) const + { return this->find_first_not_of(__str.data(), __pos, __str.size()); } + + /** + * @brief Find position of a character not in C substring. + * @param s C string containing characters to avoid. + * @param pos Index of character to search from. + * @param n Number of characters from s to consider. + * @return Index of first occurrence. + * + * Starting from @a pos, searches forward for a character not contained + * in the first @a n characters of @a s within this string. If found, + * returns the index where it was found. If not found, returns npos. + */ + size_type + find_first_not_of(const _CharT* __s, size_type __pos, + size_type __n) const; + + /** + * @brief Find position of a character not in C string. + * @param s C string containing characters to avoid. + * @param pos Index of character to search from (default 0). + * @return Index of first occurrence. + * + * Starting from @a pos, searches forward for a character not contained + * in @a s within this string. If found, returns the index where it + * was found. If not found, returns npos. + */ + size_type + find_first_not_of(const _CharT* __s, size_type __pos = 0) const + { + __glibcxx_requires_string(__s); + return this->find_first_not_of(__s, __pos, traits_type::length(__s)); + } + + /** + * @brief Find position of a different character. + * @param c Character to avoid. + * @param pos Index of character to search from (default 0). + * @return Index of first occurrence. + * + * Starting from @a pos, searches forward for a character other than @a c + * within this string. If found, returns the index where it was found. + * If not found, returns npos. + */ + size_type + find_first_not_of(_CharT __c, size_type __pos = 0) const; + + /** + * @brief Find last position of a character not in string. + * @param str String containing characters to avoid. + * @param pos Index of character to search back from (default end). + * @return Index of last occurrence. + * + * Starting from @a pos, searches backward for a character not + * contained in @a str within this string. If found, returns the index + * where it was found. If not found, returns npos. + */ + size_type + find_last_not_of(const basic_string& __str, size_type __pos = npos) const + { return this->find_last_not_of(__str.data(), __pos, __str.size()); } + + /** + * @brief Find last position of a character not in C substring. + * @param s C string containing characters to avoid. + * @param pos Index of character to search back from. + * @param n Number of characters from s to consider. + * @return Index of last occurrence. + * + * Starting from @a pos, searches backward for a character not + * contained in the first @a n characters of @a s within this string. + * If found, returns the index where it was found. If not found, + * returns npos. + */ + size_type + find_last_not_of(const _CharT* __s, size_type __pos, + size_type __n) const; + /** + * @brief Find last position of a character not in C string. + * @param s C string containing characters to avoid. + * @param pos Index of character to search back from (default end). + * @return Index of last occurrence. + * + * Starting from @a pos, searches backward for a character not + * contained in @a s within this string. If found, returns the index + * where it was found. If not found, returns npos. + */ + size_type + find_last_not_of(const _CharT* __s, size_type __pos = npos) const + { + __glibcxx_requires_string(__s); + return this->find_last_not_of(__s, __pos, traits_type::length(__s)); + } + + /** + * @brief Find last position of a different character. + * @param c Character to avoid. + * @param pos Index of character to search back from (default end). + * @return Index of last occurrence. + * + * Starting from @a pos, searches backward for a character other than + * @a c within this string. If found, returns the index where it was + * found. If not found, returns npos. + */ + size_type + find_last_not_of(_CharT __c, size_type __pos = npos) const; + + /** + * @brief Get a substring. + * @param pos Index of first character (default 0). + * @param n Number of characters in substring (default remainder). + * @return The new string. + * @throw std::out_of_range If pos > size(). + * + * Construct and return a new string using the @a n characters starting + * at @a pos. If the string is too short, use the remainder of the + * characters. If @a pos is beyond the end of the string, out_of_range + * is thrown. + */ + basic_string + substr(size_type __pos = 0, size_type __n = npos) const + { return basic_string(*this, + _M_check(__pos, "basic_string::substr"), __n); } + + /** + * @brief Compare to a string. + * @param str String to compare against. + * @return Integer < 0, 0, or > 0. + * + * Returns an integer < 0 if this string is ordered before @a str, 0 if + * their values are equivalent, or > 0 if this string is ordered after + * @a str. Determines the effective length rlen of the strings to + * compare as the smallest of size() and str.size(). The function + * then compares the two strings by calling traits::compare(data(), + * str.data(),rlen). If the result of the comparison is nonzero returns + * it, otherwise the shorter one is ordered first. + */ + int + compare(const basic_string& __str) const + { + const size_type __size = this->size(); + const size_type __osize = __str.size(); + const size_type __len = std::min(__size, __osize); + + int __r = traits_type::compare(_M_data(), __str.data(), __len); + if (!__r) + __r = _S_compare(__size, __osize); + return __r; + } + + /** + * @brief Compare substring to a string. + * @param pos Index of first character of substring. + * @param n Number of characters in substring. + * @param str String to compare against. + * @return Integer < 0, 0, or > 0. + * + * Form the substring of this string from the @a n characters starting + * at @a pos. Returns an integer < 0 if the substring is ordered + * before @a str, 0 if their values are equivalent, or > 0 if the + * substring is ordered after @a str. Determines the effective length + * rlen of the strings to compare as the smallest of the length of the + * substring and @a str.size(). The function then compares the two + * strings by calling traits::compare(substring.data(),str.data(),rlen). + * If the result of the comparison is nonzero returns it, otherwise the + * shorter one is ordered first. + */ + int + compare(size_type __pos, size_type __n, const basic_string& __str) const; + + /** + * @brief Compare substring to a substring. + * @param pos1 Index of first character of substring. + * @param n1 Number of characters in substring. + * @param str String to compare against. + * @param pos2 Index of first character of substring of str. + * @param n2 Number of characters in substring of str. + * @return Integer < 0, 0, or > 0. + * + * Form the substring of this string from the @a n1 characters starting + * at @a pos1. Form the substring of @a str from the @a n2 characters + * starting at @a pos2. Returns an integer < 0 if this substring is + * ordered before the substring of @a str, 0 if their values are + * equivalent, or > 0 if this substring is ordered after the substring + * of @a str. Determines the effective length rlen of the strings + * to compare as the smallest of the lengths of the substrings. The + * function then compares the two strings by calling + * traits::compare(substring.data(),str.substr(pos2,n2).data(),rlen). + * If the result of the comparison is nonzero returns it, otherwise the + * shorter one is ordered first. + */ + int + compare(size_type __pos1, size_type __n1, const basic_string& __str, + size_type __pos2, size_type __n2) const; + + /** + * @brief Compare to a C string. + * @param s C string to compare against. + * @return Integer < 0, 0, or > 0. + * + * Returns an integer < 0 if this string is ordered before @a s, 0 if + * their values are equivalent, or > 0 if this string is ordered after + * @a s. Determines the effective length rlen of the strings to + * compare as the smallest of size() and the length of a string + * constructed from @a s. The function then compares the two strings + * by calling traits::compare(data(),s,rlen). If the result of the + * comparison is nonzero returns it, otherwise the shorter one is + * ordered first. + */ + int + compare(const _CharT* __s) const; + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 5 String::compare specification questionable + /** + * @brief Compare substring to a C string. + * @param pos Index of first character of substring. + * @param n1 Number of characters in substring. + * @param s C string to compare against. + * @return Integer < 0, 0, or > 0. + * + * Form the substring of this string from the @a n1 characters starting + * at @a pos. Returns an integer < 0 if the substring is ordered + * before @a s, 0 if their values are equivalent, or > 0 if the + * substring is ordered after @a s. Determines the effective length + * rlen of the strings to compare as the smallest of the length of the + * substring and the length of a string constructed from @a s. The + * function then compares the two string by calling + * traits::compare(substring.data(),s,rlen). If the result of the + * comparison is nonzero returns it, otherwise the shorter one is + * ordered first. + */ + int + compare(size_type __pos, size_type __n1, const _CharT* __s) const; + + /** + * @brief Compare substring against a character array. + * @param pos1 Index of first character of substring. + * @param n1 Number of characters in substring. + * @param s character array to compare against. + * @param n2 Number of characters of s. + * @return Integer < 0, 0, or > 0. + * + * Form the substring of this string from the @a n1 characters starting + * at @a pos1. Form a string from the first @a n2 characters of @a s. + * Returns an integer < 0 if this substring is ordered before the string + * from @a s, 0 if their values are equivalent, or > 0 if this substring + * is ordered after the string from @a s. Determines the effective + * length rlen of the strings to compare as the smallest of the length + * of the substring and @a n2. The function then compares the two + * strings by calling traits::compare(substring.data(),s,rlen). If the + * result of the comparison is nonzero returns it, otherwise the shorter + * one is ordered first. + * + * NB: s must have at least n2 characters, '\\0' has no special + * meaning. + */ + int + compare(size_type __pos, size_type __n1, const _CharT* __s, + size_type __n2) const; + }; + + template + inline basic_string<_CharT, _Traits, _Alloc>:: + basic_string() +#ifndef _GLIBCXX_FULLY_DYNAMIC_STRING + : _M_dataplus(_S_empty_rep()._M_refdata(), _Alloc()) { } +#else + : _M_dataplus(_S_construct(size_type(), _CharT(), _Alloc()), _Alloc()) { } +#endif + + // operator+ + /** + * @brief Concatenate two strings. + * @param lhs First string. + * @param rhs Last string. + * @return New string with value of @a lhs followed by @a rhs. + */ + template + basic_string<_CharT, _Traits, _Alloc> + operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { + basic_string<_CharT, _Traits, _Alloc> __str(__lhs); + __str.append(__rhs); + return __str; + } + + /** + * @brief Concatenate C string and string. + * @param lhs First string. + * @param rhs Last string. + * @return New string with value of @a lhs followed by @a rhs. + */ + template + basic_string<_CharT,_Traits,_Alloc> + operator+(const _CharT* __lhs, + const basic_string<_CharT,_Traits,_Alloc>& __rhs); + + /** + * @brief Concatenate character and string. + * @param lhs First string. + * @param rhs Last string. + * @return New string with @a lhs followed by @a rhs. + */ + template + basic_string<_CharT,_Traits,_Alloc> + operator+(_CharT __lhs, const basic_string<_CharT,_Traits,_Alloc>& __rhs); + + /** + * @brief Concatenate string and C string. + * @param lhs First string. + * @param rhs Last string. + * @return New string with @a lhs followed by @a rhs. + */ + template + inline basic_string<_CharT, _Traits, _Alloc> + operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const _CharT* __rhs) + { + basic_string<_CharT, _Traits, _Alloc> __str(__lhs); + __str.append(__rhs); + return __str; + } + + /** + * @brief Concatenate string and character. + * @param lhs First string. + * @param rhs Last string. + * @return New string with @a lhs followed by @a rhs. + */ + template + inline basic_string<_CharT, _Traits, _Alloc> + operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs, _CharT __rhs) + { + typedef basic_string<_CharT, _Traits, _Alloc> __string_type; + typedef typename __string_type::size_type __size_type; + __string_type __str(__lhs); + __str.append(__size_type(1), __rhs); + return __str; + } + + // operator == + /** + * @brief Test equivalence of two strings. + * @param lhs First string. + * @param rhs Second string. + * @return True if @a lhs.compare(@a rhs) == 0. False otherwise. + */ + template + inline bool + operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { return __lhs.compare(__rhs) == 0; } + + template + inline + typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, bool>::__type + operator==(const basic_string<_CharT>& __lhs, + const basic_string<_CharT>& __rhs) + { return (__lhs.size() == __rhs.size() + && !std::char_traits<_CharT>::compare(__lhs.data(), __rhs.data(), + __lhs.size())); } + + /** + * @brief Test equivalence of C string and string. + * @param lhs C string. + * @param rhs String. + * @return True if @a rhs.compare(@a lhs) == 0. False otherwise. + */ + template + inline bool + operator==(const _CharT* __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { return __rhs.compare(__lhs) == 0; } + + /** + * @brief Test equivalence of string and C string. + * @param lhs String. + * @param rhs C string. + * @return True if @a lhs.compare(@a rhs) == 0. False otherwise. + */ + template + inline bool + operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const _CharT* __rhs) + { return __lhs.compare(__rhs) == 0; } + + // operator != + /** + * @brief Test difference of two strings. + * @param lhs First string. + * @param rhs Second string. + * @return True if @a lhs.compare(@a rhs) != 0. False otherwise. + */ + template + inline bool + operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { return !(__lhs == __rhs); } + + /** + * @brief Test difference of C string and string. + * @param lhs C string. + * @param rhs String. + * @return True if @a rhs.compare(@a lhs) != 0. False otherwise. + */ + template + inline bool + operator!=(const _CharT* __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { return !(__lhs == __rhs); } + + /** + * @brief Test difference of string and C string. + * @param lhs String. + * @param rhs C string. + * @return True if @a lhs.compare(@a rhs) != 0. False otherwise. + */ + template + inline bool + operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const _CharT* __rhs) + { return !(__lhs == __rhs); } + + // operator < + /** + * @brief Test if string precedes string. + * @param lhs First string. + * @param rhs Second string. + * @return True if @a lhs precedes @a rhs. False otherwise. + */ + template + inline bool + operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { return __lhs.compare(__rhs) < 0; } + + /** + * @brief Test if string precedes C string. + * @param lhs String. + * @param rhs C string. + * @return True if @a lhs precedes @a rhs. False otherwise. + */ + template + inline bool + operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const _CharT* __rhs) + { return __lhs.compare(__rhs) < 0; } + + /** + * @brief Test if C string precedes string. + * @param lhs C string. + * @param rhs String. + * @return True if @a lhs precedes @a rhs. False otherwise. + */ + template + inline bool + operator<(const _CharT* __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { return __rhs.compare(__lhs) > 0; } + + // operator > + /** + * @brief Test if string follows string. + * @param lhs First string. + * @param rhs Second string. + * @return True if @a lhs follows @a rhs. False otherwise. + */ + template + inline bool + operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { return __lhs.compare(__rhs) > 0; } + + /** + * @brief Test if string follows C string. + * @param lhs String. + * @param rhs C string. + * @return True if @a lhs follows @a rhs. False otherwise. + */ + template + inline bool + operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const _CharT* __rhs) + { return __lhs.compare(__rhs) > 0; } + + /** + * @brief Test if C string follows string. + * @param lhs C string. + * @param rhs String. + * @return True if @a lhs follows @a rhs. False otherwise. + */ + template + inline bool + operator>(const _CharT* __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { return __rhs.compare(__lhs) < 0; } + + // operator <= + /** + * @brief Test if string doesn't follow string. + * @param lhs First string. + * @param rhs Second string. + * @return True if @a lhs doesn't follow @a rhs. False otherwise. + */ + template + inline bool + operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { return __lhs.compare(__rhs) <= 0; } + + /** + * @brief Test if string doesn't follow C string. + * @param lhs String. + * @param rhs C string. + * @return True if @a lhs doesn't follow @a rhs. False otherwise. + */ + template + inline bool + operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const _CharT* __rhs) + { return __lhs.compare(__rhs) <= 0; } + + /** + * @brief Test if C string doesn't follow string. + * @param lhs C string. + * @param rhs String. + * @return True if @a lhs doesn't follow @a rhs. False otherwise. + */ + template + inline bool + operator<=(const _CharT* __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { return __rhs.compare(__lhs) >= 0; } + + // operator >= + /** + * @brief Test if string doesn't precede string. + * @param lhs First string. + * @param rhs Second string. + * @return True if @a lhs doesn't precede @a rhs. False otherwise. + */ + template + inline bool + operator>=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { return __lhs.compare(__rhs) >= 0; } + + /** + * @brief Test if string doesn't precede C string. + * @param lhs String. + * @param rhs C string. + * @return True if @a lhs doesn't precede @a rhs. False otherwise. + */ + template + inline bool + operator>=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, + const _CharT* __rhs) + { return __lhs.compare(__rhs) >= 0; } + + /** + * @brief Test if C string doesn't precede string. + * @param lhs C string. + * @param rhs String. + * @return True if @a lhs doesn't precede @a rhs. False otherwise. + */ + template + inline bool + operator>=(const _CharT* __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { return __rhs.compare(__lhs) <= 0; } + + /** + * @brief Swap contents of two strings. + * @param lhs First string. + * @param rhs Second string. + * + * Exchanges the contents of @a lhs and @a rhs in constant time. + */ + template + inline void + swap(basic_string<_CharT, _Traits, _Alloc>& __lhs, + basic_string<_CharT, _Traits, _Alloc>& __rhs) + { __lhs.swap(__rhs); } + + /** + * @brief Read stream into a string. + * @param is Input stream. + * @param str Buffer to store into. + * @return Reference to the input stream. + * + * Stores characters from @a is into @a str until whitespace is found, the + * end of the stream is encountered, or str.max_size() is reached. If + * is.width() is non-zero, that is the limit on the number of characters + * stored into @a str. Any previous contents of @a str are erased. + */ + template + basic_istream<_CharT, _Traits>& + operator>>(basic_istream<_CharT, _Traits>& __is, + basic_string<_CharT, _Traits, _Alloc>& __str); + + template<> + basic_istream& + operator>>(basic_istream& __is, basic_string& __str); + + /** + * @brief Write string to a stream. + * @param os Output stream. + * @param str String to write out. + * @return Reference to the output stream. + * + * Output characters of @a str into os following the same rules as for + * writing a C string. + */ + template + inline basic_ostream<_CharT, _Traits>& + operator<<(basic_ostream<_CharT, _Traits>& __os, + const basic_string<_CharT, _Traits, _Alloc>& __str) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 586. string inserter not a formatted function + return __ostream_insert(__os, __str.data(), __str.size()); + } + + /** + * @brief Read a line from stream into a string. + * @param is Input stream. + * @param str Buffer to store into. + * @param delim Character marking end of line. + * @return Reference to the input stream. + * + * Stores characters from @a is into @a str until @a delim is found, the + * end of the stream is encountered, or str.max_size() is reached. If + * is.width() is non-zero, that is the limit on the number of characters + * stored into @a str. Any previous contents of @a str are erased. If @a + * delim was encountered, it is extracted but not stored into @a str. + */ + template + basic_istream<_CharT, _Traits>& + getline(basic_istream<_CharT, _Traits>& __is, + basic_string<_CharT, _Traits, _Alloc>& __str, _CharT __delim); + + /** + * @brief Read a line from stream into a string. + * @param is Input stream. + * @param str Buffer to store into. + * @return Reference to the input stream. + * + * Stores characters from is into @a str until '\n' is found, the end of + * the stream is encountered, or str.max_size() is reached. If is.width() + * is non-zero, that is the limit on the number of characters stored into + * @a str. Any previous contents of @a str are erased. If end of line was + * encountered, it is extracted but not stored into @a str. + */ + template + inline basic_istream<_CharT, _Traits>& + getline(basic_istream<_CharT, _Traits>& __is, + basic_string<_CharT, _Traits, _Alloc>& __str) + { return getline(__is, __str, __is.widen('\n')); } + + template<> + basic_istream& + getline(basic_istream& __in, basic_string& __str, + char __delim); + +#ifdef _GLIBCXX_USE_WCHAR_T + template<> + basic_istream& + getline(basic_istream& __in, basic_string& __str, + wchar_t __delim); +#endif + +_GLIBCXX_END_NAMESPACE + +#if (defined(__GXX_EXPERIMENTAL_CXX0X__) && defined(_GLIBCXX_USE_C99) \ + && !defined(_GLIBCXX_HAVE_BROKEN_VSWPRINTF)) + +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // 21.4 Numeric Conversions [string.conversions]. + inline int + stoi(const string& __str, size_t* __idx = 0, int __base = 10) + { return __gnu_cxx::__stoa(&std::strtol, "stoi", __str.c_str(), + __idx, __base); } + + inline long + stol(const string& __str, size_t* __idx = 0, int __base = 10) + { return __gnu_cxx::__stoa(&std::strtol, "stol", __str.c_str(), + __idx, __base); } + + inline unsigned long + stoul(const string& __str, size_t* __idx = 0, int __base = 10) + { return __gnu_cxx::__stoa(&std::strtoul, "stoul", __str.c_str(), + __idx, __base); } + + inline long long + stoll(const string& __str, size_t* __idx = 0, int __base = 10) + { return __gnu_cxx::__stoa(&std::strtoll, "stoll", __str.c_str(), + __idx, __base); } + + inline unsigned long long + stoull(const string& __str, size_t* __idx = 0, int __base = 10) + { return __gnu_cxx::__stoa(&std::strtoull, "stoull", __str.c_str(), + __idx, __base); } + + // NB: strtof vs strtod. + inline float + stof(const string& __str, size_t* __idx = 0) + { return __gnu_cxx::__stoa(&std::strtof, "stof", __str.c_str(), __idx); } + + inline double + stod(const string& __str, size_t* __idx = 0) + { return __gnu_cxx::__stoa(&std::strtod, "stod", __str.c_str(), __idx); } + + inline long double + stold(const string& __str, size_t* __idx = 0) + { return __gnu_cxx::__stoa(&std::strtold, "stold", __str.c_str(), __idx); } + + // NB: (v)snprintf vs sprintf. + inline string + to_string(long long __val) + { return __gnu_cxx::__to_xstring(&std::vsnprintf, + 4 * sizeof(long long), + "%lld", __val); } + + inline string + to_string(unsigned long long __val) + { return __gnu_cxx::__to_xstring(&std::vsnprintf, + 4 * sizeof(unsigned long long), + "%llu", __val); } + + inline string + to_string(long double __val) + { + const int __n = + __gnu_cxx::__numeric_traits::__max_exponent10 + 20; + return __gnu_cxx::__to_xstring(&std::vsnprintf, __n, + "%Lf", __val); + } + +#ifdef _GLIBCXX_USE_WCHAR_T + inline int + stoi(const wstring& __str, size_t* __idx = 0, int __base = 10) + { return __gnu_cxx::__stoa(&std::wcstol, "stoi", __str.c_str(), + __idx, __base); } + + inline long + stol(const wstring& __str, size_t* __idx = 0, int __base = 10) + { return __gnu_cxx::__stoa(&std::wcstol, "stol", __str.c_str(), + __idx, __base); } + + inline unsigned long + stoul(const wstring& __str, size_t* __idx = 0, int __base = 10) + { return __gnu_cxx::__stoa(&std::wcstoul, "stoul", __str.c_str(), + __idx, __base); } + + inline long long + stoll(const wstring& __str, size_t* __idx = 0, int __base = 10) + { return __gnu_cxx::__stoa(&std::wcstoll, "stoll", __str.c_str(), + __idx, __base); } + + inline unsigned long long + stoull(const wstring& __str, size_t* __idx = 0, int __base = 10) + { return __gnu_cxx::__stoa(&std::wcstoull, "stoull", __str.c_str(), + __idx, __base); } + + // NB: wcstof vs wcstod. + inline float + stof(const wstring& __str, size_t* __idx = 0) + { return __gnu_cxx::__stoa(&std::wcstof, "stof", __str.c_str(), __idx); } + + inline double + stod(const wstring& __str, size_t* __idx = 0) + { return __gnu_cxx::__stoa(&std::wcstod, "stod", __str.c_str(), __idx); } + + inline long double + stold(const wstring& __str, size_t* __idx = 0) + { return __gnu_cxx::__stoa(&std::wcstold, "stold", __str.c_str(), __idx); } + + inline wstring + to_wstring(long long __val) + { return __gnu_cxx::__to_xstring(&std::vswprintf, + 4 * sizeof(long long), + L"%lld", __val); } + + inline wstring + to_wstring(unsigned long long __val) + { return __gnu_cxx::__to_xstring(&std::vswprintf, + 4 * sizeof(unsigned long long), + L"%llu", __val); } + + inline wstring + to_wstring(long double __val) + { + const int __n = + __gnu_cxx::__numeric_traits::__max_exponent10 + 20; + return __gnu_cxx::__to_xstring(&std::vswprintf, __n, + L"%Lf", __val); + } +#endif + +_GLIBCXX_END_NAMESPACE + +#endif + +#endif /* _BASIC_STRING_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/basic_string.tcc b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/basic_string.tcc new file mode 100644 index 00000000..a5553c61 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/basic_string.tcc @@ -0,0 +1,1144 @@ +// Components for manipulating sequences of characters -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file basic_string.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 21 Strings library +// + +// Written by Jason Merrill based upon the specification by Takanori Adachi +// in ANSI X3J16/94-0013R2. Rewritten by Nathan Myers to ISO-14882. + +#ifndef _BASIC_STRING_TCC +#define _BASIC_STRING_TCC 1 + +#pragma GCC system_header + +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + template + const typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>:: + _Rep::_S_max_size = (((npos - sizeof(_Rep_base))/sizeof(_CharT)) - 1) / 4; + + template + const _CharT + basic_string<_CharT, _Traits, _Alloc>:: + _Rep::_S_terminal = _CharT(); + + template + const typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>::npos; + + // Linker sets _S_empty_rep_storage to all 0s (one reference, empty string) + // at static init time (before static ctors are run). + template + typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>::_Rep::_S_empty_rep_storage[ + (sizeof(_Rep_base) + sizeof(_CharT) + sizeof(size_type) - 1) / + sizeof(size_type)]; + + // NB: This is the special case for Input Iterators, used in + // istreambuf_iterators, etc. + // Input Iterators have a cost structure very different from + // pointers, calling for a different coding style. + template + template + _CharT* + basic_string<_CharT, _Traits, _Alloc>:: + _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a, + input_iterator_tag) + { +#ifndef _GLIBCXX_FULLY_DYNAMIC_STRING + if (__beg == __end && __a == _Alloc()) + return _S_empty_rep()._M_refdata(); +#endif + // Avoid reallocation for common case. + _CharT __buf[128]; + size_type __len = 0; + while (__beg != __end && __len < sizeof(__buf) / sizeof(_CharT)) + { + __buf[__len++] = *__beg; + ++__beg; + } + _Rep* __r = _Rep::_S_create(__len, size_type(0), __a); + _M_copy(__r->_M_refdata(), __buf, __len); + __try + { + while (__beg != __end) + { + if (__len == __r->_M_capacity) + { + // Allocate more space. + _Rep* __another = _Rep::_S_create(__len + 1, __len, __a); + _M_copy(__another->_M_refdata(), __r->_M_refdata(), __len); + __r->_M_destroy(__a); + __r = __another; + } + __r->_M_refdata()[__len++] = *__beg; + ++__beg; + } + } + __catch(...) + { + __r->_M_destroy(__a); + __throw_exception_again; + } + __r->_M_set_length_and_sharable(__len); + return __r->_M_refdata(); + } + + template + template + _CharT* + basic_string<_CharT, _Traits, _Alloc>:: + _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a, + forward_iterator_tag) + { +#ifndef _GLIBCXX_FULLY_DYNAMIC_STRING + if (__beg == __end && __a == _Alloc()) + return _S_empty_rep()._M_refdata(); +#endif + // NB: Not required, but considered best practice. + if (__builtin_expect(__gnu_cxx::__is_null_pointer(__beg) + && __beg != __end, 0)) + __throw_logic_error(__N("basic_string::_S_construct NULL not valid")); + + const size_type __dnew = static_cast(std::distance(__beg, + __end)); + // Check for out_of_range and length_error exceptions. + _Rep* __r = _Rep::_S_create(__dnew, size_type(0), __a); + __try + { _S_copy_chars(__r->_M_refdata(), __beg, __end); } + __catch(...) + { + __r->_M_destroy(__a); + __throw_exception_again; + } + __r->_M_set_length_and_sharable(__dnew); + return __r->_M_refdata(); + } + + template + _CharT* + basic_string<_CharT, _Traits, _Alloc>:: + _S_construct(size_type __n, _CharT __c, const _Alloc& __a) + { +#ifndef _GLIBCXX_FULLY_DYNAMIC_STRING + if (__n == 0 && __a == _Alloc()) + return _S_empty_rep()._M_refdata(); +#endif + // Check for out_of_range and length_error exceptions. + _Rep* __r = _Rep::_S_create(__n, size_type(0), __a); + if (__n) + _M_assign(__r->_M_refdata(), __n, __c); + + __r->_M_set_length_and_sharable(__n); + return __r->_M_refdata(); + } + + template + basic_string<_CharT, _Traits, _Alloc>:: + basic_string(const basic_string& __str) + : _M_dataplus(__str._M_rep()->_M_grab(_Alloc(__str.get_allocator()), + __str.get_allocator()), + __str.get_allocator()) + { } + + template + basic_string<_CharT, _Traits, _Alloc>:: + basic_string(const _Alloc& __a) + : _M_dataplus(_S_construct(size_type(), _CharT(), __a), __a) + { } + + template + basic_string<_CharT, _Traits, _Alloc>:: + basic_string(const basic_string& __str, size_type __pos, size_type __n) + : _M_dataplus(_S_construct(__str._M_data() + + __str._M_check(__pos, + "basic_string::basic_string"), + __str._M_data() + __str._M_limit(__pos, __n) + + __pos, _Alloc()), _Alloc()) + { } + + template + basic_string<_CharT, _Traits, _Alloc>:: + basic_string(const basic_string& __str, size_type __pos, + size_type __n, const _Alloc& __a) + : _M_dataplus(_S_construct(__str._M_data() + + __str._M_check(__pos, + "basic_string::basic_string"), + __str._M_data() + __str._M_limit(__pos, __n) + + __pos, __a), __a) + { } + + // TBD: DPG annotate + template + basic_string<_CharT, _Traits, _Alloc>:: + basic_string(const _CharT* __s, size_type __n, const _Alloc& __a) + : _M_dataplus(_S_construct(__s, __s + __n, __a), __a) + { } + + // TBD: DPG annotate + template + basic_string<_CharT, _Traits, _Alloc>:: + basic_string(const _CharT* __s, const _Alloc& __a) + : _M_dataplus(_S_construct(__s, __s ? __s + traits_type::length(__s) : + __s + npos, __a), __a) + { } + + template + basic_string<_CharT, _Traits, _Alloc>:: + basic_string(size_type __n, _CharT __c, const _Alloc& __a) + : _M_dataplus(_S_construct(__n, __c, __a), __a) + { } + + // TBD: DPG annotate + template + template + basic_string<_CharT, _Traits, _Alloc>:: + basic_string(_InputIterator __beg, _InputIterator __end, const _Alloc& __a) + : _M_dataplus(_S_construct(__beg, __end, __a), __a) + { } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + basic_string<_CharT, _Traits, _Alloc>:: + basic_string(initializer_list<_CharT> __l, const _Alloc& __a) + : _M_dataplus(_S_construct(__l.begin(), __l.end(), __a), __a) + { } +#endif + + template + basic_string<_CharT, _Traits, _Alloc>& + basic_string<_CharT, _Traits, _Alloc>:: + assign(const basic_string& __str) + { + if (_M_rep() != __str._M_rep()) + { + // XXX MT + const allocator_type __a = this->get_allocator(); + _CharT* __tmp = __str._M_rep()->_M_grab(__a, __str.get_allocator()); + _M_rep()->_M_dispose(__a); + _M_data(__tmp); + } + return *this; + } + + template + basic_string<_CharT, _Traits, _Alloc>& + basic_string<_CharT, _Traits, _Alloc>:: + assign(const _CharT* __s, size_type __n) + { + __glibcxx_requires_string_len(__s, __n); + _M_check_length(this->size(), __n, "basic_string::assign"); + if (_M_disjunct(__s) || _M_rep()->_M_is_shared()) + return _M_replace_safe(size_type(0), this->size(), __s, __n); + else + { + // Work in-place. + const size_type __pos = __s - _M_data(); + if (__pos >= __n) + _M_copy(_M_data(), __s, __n); + else if (__pos) + _M_move(_M_data(), __s, __n); + _M_rep()->_M_set_length_and_sharable(__n); + return *this; + } + } + + template + basic_string<_CharT, _Traits, _Alloc>& + basic_string<_CharT, _Traits, _Alloc>:: + append(size_type __n, _CharT __c) + { + if (__n) + { + _M_check_length(size_type(0), __n, "basic_string::append"); + const size_type __len = __n + this->size(); + if (__len > this->capacity() || _M_rep()->_M_is_shared()) + this->reserve(__len); + _M_assign(_M_data() + this->size(), __n, __c); + _M_rep()->_M_set_length_and_sharable(__len); + } + return *this; + } + + template + basic_string<_CharT, _Traits, _Alloc>& + basic_string<_CharT, _Traits, _Alloc>:: + append(const _CharT* __s, size_type __n) + { + __glibcxx_requires_string_len(__s, __n); + if (__n) + { + _M_check_length(size_type(0), __n, "basic_string::append"); + const size_type __len = __n + this->size(); + if (__len > this->capacity() || _M_rep()->_M_is_shared()) + { + if (_M_disjunct(__s)) + this->reserve(__len); + else + { + const size_type __off = __s - _M_data(); + this->reserve(__len); + __s = _M_data() + __off; + } + } + _M_copy(_M_data() + this->size(), __s, __n); + _M_rep()->_M_set_length_and_sharable(__len); + } + return *this; + } + + template + basic_string<_CharT, _Traits, _Alloc>& + basic_string<_CharT, _Traits, _Alloc>:: + append(const basic_string& __str) + { + const size_type __size = __str.size(); + if (__size) + { + const size_type __len = __size + this->size(); + if (__len > this->capacity() || _M_rep()->_M_is_shared()) + this->reserve(__len); + _M_copy(_M_data() + this->size(), __str._M_data(), __size); + _M_rep()->_M_set_length_and_sharable(__len); + } + return *this; + } + + template + basic_string<_CharT, _Traits, _Alloc>& + basic_string<_CharT, _Traits, _Alloc>:: + append(const basic_string& __str, size_type __pos, size_type __n) + { + __str._M_check(__pos, "basic_string::append"); + __n = __str._M_limit(__pos, __n); + if (__n) + { + const size_type __len = __n + this->size(); + if (__len > this->capacity() || _M_rep()->_M_is_shared()) + this->reserve(__len); + _M_copy(_M_data() + this->size(), __str._M_data() + __pos, __n); + _M_rep()->_M_set_length_and_sharable(__len); + } + return *this; + } + + template + basic_string<_CharT, _Traits, _Alloc>& + basic_string<_CharT, _Traits, _Alloc>:: + insert(size_type __pos, const _CharT* __s, size_type __n) + { + __glibcxx_requires_string_len(__s, __n); + _M_check(__pos, "basic_string::insert"); + _M_check_length(size_type(0), __n, "basic_string::insert"); + if (_M_disjunct(__s) || _M_rep()->_M_is_shared()) + return _M_replace_safe(__pos, size_type(0), __s, __n); + else + { + // Work in-place. + const size_type __off = __s - _M_data(); + _M_mutate(__pos, 0, __n); + __s = _M_data() + __off; + _CharT* __p = _M_data() + __pos; + if (__s + __n <= __p) + _M_copy(__p, __s, __n); + else if (__s >= __p) + _M_copy(__p, __s + __n, __n); + else + { + const size_type __nleft = __p - __s; + _M_copy(__p, __s, __nleft); + _M_copy(__p + __nleft, __p + __n, __n - __nleft); + } + return *this; + } + } + + template + basic_string<_CharT, _Traits, _Alloc>& + basic_string<_CharT, _Traits, _Alloc>:: + replace(size_type __pos, size_type __n1, const _CharT* __s, + size_type __n2) + { + __glibcxx_requires_string_len(__s, __n2); + _M_check(__pos, "basic_string::replace"); + __n1 = _M_limit(__pos, __n1); + _M_check_length(__n1, __n2, "basic_string::replace"); + bool __left; + if (_M_disjunct(__s) || _M_rep()->_M_is_shared()) + return _M_replace_safe(__pos, __n1, __s, __n2); + else if ((__left = __s + __n2 <= _M_data() + __pos) + || _M_data() + __pos + __n1 <= __s) + { + // Work in-place: non-overlapping case. + size_type __off = __s - _M_data(); + __left ? __off : (__off += __n2 - __n1); + _M_mutate(__pos, __n1, __n2); + _M_copy(_M_data() + __pos, _M_data() + __off, __n2); + return *this; + } + else + { + // Todo: overlapping case. + const basic_string __tmp(__s, __n2); + return _M_replace_safe(__pos, __n1, __tmp._M_data(), __n2); + } + } + + template + void + basic_string<_CharT, _Traits, _Alloc>::_Rep:: + _M_destroy(const _Alloc& __a) throw () + { + const size_type __size = sizeof(_Rep_base) + + (this->_M_capacity + 1) * sizeof(_CharT); + _Raw_bytes_alloc(__a).deallocate(reinterpret_cast(this), __size); + } + + template + void + basic_string<_CharT, _Traits, _Alloc>:: + _M_leak_hard() + { +#ifndef _GLIBCXX_FULLY_DYNAMIC_STRING + if (_M_rep() == &_S_empty_rep()) + return; +#endif + if (_M_rep()->_M_is_shared()) + _M_mutate(0, 0, 0); + _M_rep()->_M_set_leaked(); + } + + template + void + basic_string<_CharT, _Traits, _Alloc>:: + _M_mutate(size_type __pos, size_type __len1, size_type __len2) + { + const size_type __old_size = this->size(); + const size_type __new_size = __old_size + __len2 - __len1; + const size_type __how_much = __old_size - __pos - __len1; + + if (__new_size > this->capacity() || _M_rep()->_M_is_shared()) + { + // Must reallocate. + const allocator_type __a = get_allocator(); + _Rep* __r = _Rep::_S_create(__new_size, this->capacity(), __a); + + if (__pos) + _M_copy(__r->_M_refdata(), _M_data(), __pos); + if (__how_much) + _M_copy(__r->_M_refdata() + __pos + __len2, + _M_data() + __pos + __len1, __how_much); + + _M_rep()->_M_dispose(__a); + _M_data(__r->_M_refdata()); + } + else if (__how_much && __len1 != __len2) + { + // Work in-place. + _M_move(_M_data() + __pos + __len2, + _M_data() + __pos + __len1, __how_much); + } + _M_rep()->_M_set_length_and_sharable(__new_size); + } + + template + void + basic_string<_CharT, _Traits, _Alloc>:: + reserve(size_type __res) + { + if (__res != this->capacity() || _M_rep()->_M_is_shared()) + { + // Make sure we don't shrink below the current size + if (__res < this->size()) + __res = this->size(); + const allocator_type __a = get_allocator(); + _CharT* __tmp = _M_rep()->_M_clone(__a, __res - this->size()); + _M_rep()->_M_dispose(__a); + _M_data(__tmp); + } + } + + template + void + basic_string<_CharT, _Traits, _Alloc>:: + swap(basic_string& __s) + { + if (_M_rep()->_M_is_leaked()) + _M_rep()->_M_set_sharable(); + if (__s._M_rep()->_M_is_leaked()) + __s._M_rep()->_M_set_sharable(); + if (this->get_allocator() == __s.get_allocator()) + { + _CharT* __tmp = _M_data(); + _M_data(__s._M_data()); + __s._M_data(__tmp); + } + // The code below can usually be optimized away. + else + { + const basic_string __tmp1(_M_ibegin(), _M_iend(), + __s.get_allocator()); + const basic_string __tmp2(__s._M_ibegin(), __s._M_iend(), + this->get_allocator()); + *this = __tmp2; + __s = __tmp1; + } + } + + template + typename basic_string<_CharT, _Traits, _Alloc>::_Rep* + basic_string<_CharT, _Traits, _Alloc>::_Rep:: + _S_create(size_type __capacity, size_type __old_capacity, + const _Alloc& __alloc) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 83. String::npos vs. string::max_size() + if (__capacity > _S_max_size) + __throw_length_error(__N("basic_string::_S_create")); + + // The standard places no restriction on allocating more memory + // than is strictly needed within this layer at the moment or as + // requested by an explicit application call to reserve(). + + // Many malloc implementations perform quite poorly when an + // application attempts to allocate memory in a stepwise fashion + // growing each allocation size by only 1 char. Additionally, + // it makes little sense to allocate less linear memory than the + // natural blocking size of the malloc implementation. + // Unfortunately, we would need a somewhat low-level calculation + // with tuned parameters to get this perfect for any particular + // malloc implementation. Fortunately, generalizations about + // common features seen among implementations seems to suffice. + + // __pagesize need not match the actual VM page size for good + // results in practice, thus we pick a common value on the low + // side. __malloc_header_size is an estimate of the amount of + // overhead per memory allocation (in practice seen N * sizeof + // (void*) where N is 0, 2 or 4). According to folklore, + // picking this value on the high side is better than + // low-balling it (especially when this algorithm is used with + // malloc implementations that allocate memory blocks rounded up + // to a size which is a power of 2). + const size_type __pagesize = 4096; + const size_type __malloc_header_size = 4 * sizeof(void*); + + // The below implements an exponential growth policy, necessary to + // meet amortized linear time requirements of the library: see + // http://gcc.gnu.org/ml/libstdc++/2001-07/msg00085.html. + // It's active for allocations requiring an amount of memory above + // system pagesize. This is consistent with the requirements of the + // standard: http://gcc.gnu.org/ml/libstdc++/2001-07/msg00130.html + if (__capacity > __old_capacity && __capacity < 2 * __old_capacity) + __capacity = 2 * __old_capacity; + + // NB: Need an array of char_type[__capacity], plus a terminating + // null char_type() element, plus enough for the _Rep data structure. + // Whew. Seemingly so needy, yet so elemental. + size_type __size = (__capacity + 1) * sizeof(_CharT) + sizeof(_Rep); + + const size_type __adj_size = __size + __malloc_header_size; + if (__adj_size > __pagesize && __capacity > __old_capacity) + { + const size_type __extra = __pagesize - __adj_size % __pagesize; + __capacity += __extra / sizeof(_CharT); + // Never allocate a string bigger than _S_max_size. + if (__capacity > _S_max_size) + __capacity = _S_max_size; + __size = (__capacity + 1) * sizeof(_CharT) + sizeof(_Rep); + } + + // NB: Might throw, but no worries about a leak, mate: _Rep() + // does not throw. + void* __place = _Raw_bytes_alloc(__alloc).allocate(__size); + _Rep *__p = new (__place) _Rep; + __p->_M_capacity = __capacity; + // ABI compatibility - 3.4.x set in _S_create both + // _M_refcount and _M_length. All callers of _S_create + // in basic_string.tcc then set just _M_length. + // In 4.0.x and later both _M_refcount and _M_length + // are initialized in the callers, unfortunately we can + // have 3.4.x compiled code with _S_create callers inlined + // calling 4.0.x+ _S_create. + __p->_M_set_sharable(); + return __p; + } + + template + _CharT* + basic_string<_CharT, _Traits, _Alloc>::_Rep:: + _M_clone(const _Alloc& __alloc, size_type __res) + { + // Requested capacity of the clone. + const size_type __requested_cap = this->_M_length + __res; + _Rep* __r = _Rep::_S_create(__requested_cap, this->_M_capacity, + __alloc); + if (this->_M_length) + _M_copy(__r->_M_refdata(), _M_refdata(), this->_M_length); + + __r->_M_set_length_and_sharable(this->_M_length); + return __r->_M_refdata(); + } + + template + void + basic_string<_CharT, _Traits, _Alloc>:: + resize(size_type __n, _CharT __c) + { + const size_type __size = this->size(); + _M_check_length(__size, __n, "basic_string::resize"); + if (__size < __n) + this->append(__n - __size, __c); + else if (__n < __size) + this->erase(__n); + // else nothing (in particular, avoid calling _M_mutate() unnecessarily.) + } + + template + template + basic_string<_CharT, _Traits, _Alloc>& + basic_string<_CharT, _Traits, _Alloc>:: + _M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1, + _InputIterator __k2, __false_type) + { + const basic_string __s(__k1, __k2); + const size_type __n1 = __i2 - __i1; + _M_check_length(__n1, __s.size(), "basic_string::_M_replace_dispatch"); + return _M_replace_safe(__i1 - _M_ibegin(), __n1, __s._M_data(), + __s.size()); + } + + template + basic_string<_CharT, _Traits, _Alloc>& + basic_string<_CharT, _Traits, _Alloc>:: + _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2, + _CharT __c) + { + _M_check_length(__n1, __n2, "basic_string::_M_replace_aux"); + _M_mutate(__pos1, __n1, __n2); + if (__n2) + _M_assign(_M_data() + __pos1, __n2, __c); + return *this; + } + + template + basic_string<_CharT, _Traits, _Alloc>& + basic_string<_CharT, _Traits, _Alloc>:: + _M_replace_safe(size_type __pos1, size_type __n1, const _CharT* __s, + size_type __n2) + { + _M_mutate(__pos1, __n1, __n2); + if (__n2) + _M_copy(_M_data() + __pos1, __s, __n2); + return *this; + } + + template + basic_string<_CharT, _Traits, _Alloc> + operator+(const _CharT* __lhs, + const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { + __glibcxx_requires_string(__lhs); + typedef basic_string<_CharT, _Traits, _Alloc> __string_type; + typedef typename __string_type::size_type __size_type; + const __size_type __len = _Traits::length(__lhs); + __string_type __str; + __str.reserve(__len + __rhs.size()); + __str.append(__lhs, __len); + __str.append(__rhs); + return __str; + } + + template + basic_string<_CharT, _Traits, _Alloc> + operator+(_CharT __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) + { + typedef basic_string<_CharT, _Traits, _Alloc> __string_type; + typedef typename __string_type::size_type __size_type; + __string_type __str; + const __size_type __len = __rhs.size(); + __str.reserve(__len + 1); + __str.append(__size_type(1), __lhs); + __str.append(__rhs); + return __str; + } + + template + typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>:: + copy(_CharT* __s, size_type __n, size_type __pos) const + { + _M_check(__pos, "basic_string::copy"); + __n = _M_limit(__pos, __n); + __glibcxx_requires_string_len(__s, __n); + if (__n) + _M_copy(__s, _M_data() + __pos, __n); + // 21.3.5.7 par 3: do not append null. (good.) + return __n; + } + + template + typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>:: + find(const _CharT* __s, size_type __pos, size_type __n) const + { + __glibcxx_requires_string_len(__s, __n); + const size_type __size = this->size(); + const _CharT* __data = _M_data(); + + if (__n == 0) + return __pos <= __size ? __pos : npos; + + if (__n <= __size) + { + for (; __pos <= __size - __n; ++__pos) + if (traits_type::eq(__data[__pos], __s[0]) + && traits_type::compare(__data + __pos + 1, + __s + 1, __n - 1) == 0) + return __pos; + } + return npos; + } + + template + typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>:: + find(_CharT __c, size_type __pos) const + { + size_type __ret = npos; + const size_type __size = this->size(); + if (__pos < __size) + { + const _CharT* __data = _M_data(); + const size_type __n = __size - __pos; + const _CharT* __p = traits_type::find(__data + __pos, __n, __c); + if (__p) + __ret = __p - __data; + } + return __ret; + } + + template + typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>:: + rfind(const _CharT* __s, size_type __pos, size_type __n) const + { + __glibcxx_requires_string_len(__s, __n); + const size_type __size = this->size(); + if (__n <= __size) + { + __pos = std::min(size_type(__size - __n), __pos); + const _CharT* __data = _M_data(); + do + { + if (traits_type::compare(__data + __pos, __s, __n) == 0) + return __pos; + } + while (__pos-- > 0); + } + return npos; + } + + template + typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>:: + rfind(_CharT __c, size_type __pos) const + { + size_type __size = this->size(); + if (__size) + { + if (--__size > __pos) + __size = __pos; + for (++__size; __size-- > 0; ) + if (traits_type::eq(_M_data()[__size], __c)) + return __size; + } + return npos; + } + + template + typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>:: + find_first_of(const _CharT* __s, size_type __pos, size_type __n) const + { + __glibcxx_requires_string_len(__s, __n); + for (; __n && __pos < this->size(); ++__pos) + { + const _CharT* __p = traits_type::find(__s, __n, _M_data()[__pos]); + if (__p) + return __pos; + } + return npos; + } + + template + typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>:: + find_last_of(const _CharT* __s, size_type __pos, size_type __n) const + { + __glibcxx_requires_string_len(__s, __n); + size_type __size = this->size(); + if (__size && __n) + { + if (--__size > __pos) + __size = __pos; + do + { + if (traits_type::find(__s, __n, _M_data()[__size])) + return __size; + } + while (__size-- != 0); + } + return npos; + } + + template + typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>:: + find_first_not_of(const _CharT* __s, size_type __pos, size_type __n) const + { + __glibcxx_requires_string_len(__s, __n); + for (; __pos < this->size(); ++__pos) + if (!traits_type::find(__s, __n, _M_data()[__pos])) + return __pos; + return npos; + } + + template + typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>:: + find_first_not_of(_CharT __c, size_type __pos) const + { + for (; __pos < this->size(); ++__pos) + if (!traits_type::eq(_M_data()[__pos], __c)) + return __pos; + return npos; + } + + template + typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>:: + find_last_not_of(const _CharT* __s, size_type __pos, size_type __n) const + { + __glibcxx_requires_string_len(__s, __n); + size_type __size = this->size(); + if (__size) + { + if (--__size > __pos) + __size = __pos; + do + { + if (!traits_type::find(__s, __n, _M_data()[__size])) + return __size; + } + while (__size--); + } + return npos; + } + + template + typename basic_string<_CharT, _Traits, _Alloc>::size_type + basic_string<_CharT, _Traits, _Alloc>:: + find_last_not_of(_CharT __c, size_type __pos) const + { + size_type __size = this->size(); + if (__size) + { + if (--__size > __pos) + __size = __pos; + do + { + if (!traits_type::eq(_M_data()[__size], __c)) + return __size; + } + while (__size--); + } + return npos; + } + + template + int + basic_string<_CharT, _Traits, _Alloc>:: + compare(size_type __pos, size_type __n, const basic_string& __str) const + { + _M_check(__pos, "basic_string::compare"); + __n = _M_limit(__pos, __n); + const size_type __osize = __str.size(); + const size_type __len = std::min(__n, __osize); + int __r = traits_type::compare(_M_data() + __pos, __str.data(), __len); + if (!__r) + __r = _S_compare(__n, __osize); + return __r; + } + + template + int + basic_string<_CharT, _Traits, _Alloc>:: + compare(size_type __pos1, size_type __n1, const basic_string& __str, + size_type __pos2, size_type __n2) const + { + _M_check(__pos1, "basic_string::compare"); + __str._M_check(__pos2, "basic_string::compare"); + __n1 = _M_limit(__pos1, __n1); + __n2 = __str._M_limit(__pos2, __n2); + const size_type __len = std::min(__n1, __n2); + int __r = traits_type::compare(_M_data() + __pos1, + __str.data() + __pos2, __len); + if (!__r) + __r = _S_compare(__n1, __n2); + return __r; + } + + template + int + basic_string<_CharT, _Traits, _Alloc>:: + compare(const _CharT* __s) const + { + __glibcxx_requires_string(__s); + const size_type __size = this->size(); + const size_type __osize = traits_type::length(__s); + const size_type __len = std::min(__size, __osize); + int __r = traits_type::compare(_M_data(), __s, __len); + if (!__r) + __r = _S_compare(__size, __osize); + return __r; + } + + template + int + basic_string <_CharT, _Traits, _Alloc>:: + compare(size_type __pos, size_type __n1, const _CharT* __s) const + { + __glibcxx_requires_string(__s); + _M_check(__pos, "basic_string::compare"); + __n1 = _M_limit(__pos, __n1); + const size_type __osize = traits_type::length(__s); + const size_type __len = std::min(__n1, __osize); + int __r = traits_type::compare(_M_data() + __pos, __s, __len); + if (!__r) + __r = _S_compare(__n1, __osize); + return __r; + } + + template + int + basic_string <_CharT, _Traits, _Alloc>:: + compare(size_type __pos, size_type __n1, const _CharT* __s, + size_type __n2) const + { + __glibcxx_requires_string_len(__s, __n2); + _M_check(__pos, "basic_string::compare"); + __n1 = _M_limit(__pos, __n1); + const size_type __len = std::min(__n1, __n2); + int __r = traits_type::compare(_M_data() + __pos, __s, __len); + if (!__r) + __r = _S_compare(__n1, __n2); + return __r; + } + + // 21.3.7.9 basic_string::getline and operators + template + basic_istream<_CharT, _Traits>& + operator>>(basic_istream<_CharT, _Traits>& __in, + basic_string<_CharT, _Traits, _Alloc>& __str) + { + typedef basic_istream<_CharT, _Traits> __istream_type; + typedef basic_string<_CharT, _Traits, _Alloc> __string_type; + typedef typename __istream_type::ios_base __ios_base; + typedef typename __istream_type::int_type __int_type; + typedef typename __string_type::size_type __size_type; + typedef ctype<_CharT> __ctype_type; + typedef typename __ctype_type::ctype_base __ctype_base; + + __size_type __extracted = 0; + typename __ios_base::iostate __err = __ios_base::goodbit; + typename __istream_type::sentry __cerb(__in, false); + if (__cerb) + { + __try + { + // Avoid reallocation for common case. + __str.erase(); + _CharT __buf[128]; + __size_type __len = 0; + const streamsize __w = __in.width(); + const __size_type __n = __w > 0 ? static_cast<__size_type>(__w) + : __str.max_size(); + const __ctype_type& __ct = use_facet<__ctype_type>(__in.getloc()); + const __int_type __eof = _Traits::eof(); + __int_type __c = __in.rdbuf()->sgetc(); + + while (__extracted < __n + && !_Traits::eq_int_type(__c, __eof) + && !__ct.is(__ctype_base::space, + _Traits::to_char_type(__c))) + { + if (__len == sizeof(__buf) / sizeof(_CharT)) + { + __str.append(__buf, sizeof(__buf) / sizeof(_CharT)); + __len = 0; + } + __buf[__len++] = _Traits::to_char_type(__c); + ++__extracted; + __c = __in.rdbuf()->snextc(); + } + __str.append(__buf, __len); + + if (_Traits::eq_int_type(__c, __eof)) + __err |= __ios_base::eofbit; + __in.width(0); + } + __catch(__cxxabiv1::__forced_unwind&) + { + __in._M_setstate(__ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 91. Description of operator>> and getline() for string<> + // might cause endless loop + __in._M_setstate(__ios_base::badbit); + } + } + // 211. operator>>(istream&, string&) doesn't set failbit + if (!__extracted) + __err |= __ios_base::failbit; + if (__err) + __in.setstate(__err); + return __in; + } + + template + basic_istream<_CharT, _Traits>& + getline(basic_istream<_CharT, _Traits>& __in, + basic_string<_CharT, _Traits, _Alloc>& __str, _CharT __delim) + { + typedef basic_istream<_CharT, _Traits> __istream_type; + typedef basic_string<_CharT, _Traits, _Alloc> __string_type; + typedef typename __istream_type::ios_base __ios_base; + typedef typename __istream_type::int_type __int_type; + typedef typename __string_type::size_type __size_type; + + __size_type __extracted = 0; + const __size_type __n = __str.max_size(); + typename __ios_base::iostate __err = __ios_base::goodbit; + typename __istream_type::sentry __cerb(__in, true); + if (__cerb) + { + __try + { + __str.erase(); + const __int_type __idelim = _Traits::to_int_type(__delim); + const __int_type __eof = _Traits::eof(); + __int_type __c = __in.rdbuf()->sgetc(); + + while (__extracted < __n + && !_Traits::eq_int_type(__c, __eof) + && !_Traits::eq_int_type(__c, __idelim)) + { + __str += _Traits::to_char_type(__c); + ++__extracted; + __c = __in.rdbuf()->snextc(); + } + + if (_Traits::eq_int_type(__c, __eof)) + __err |= __ios_base::eofbit; + else if (_Traits::eq_int_type(__c, __idelim)) + { + ++__extracted; + __in.rdbuf()->sbumpc(); + } + else + __err |= __ios_base::failbit; + } + __catch(__cxxabiv1::__forced_unwind&) + { + __in._M_setstate(__ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 91. Description of operator>> and getline() for string<> + // might cause endless loop + __in._M_setstate(__ios_base::badbit); + } + } + if (!__extracted) + __err |= __ios_base::failbit; + if (__err) + __in.setstate(__err); + return __in; + } + + // Inhibit implicit instantiations for required instantiations, + // which are defined via explicit instantiations elsewhere. + // NB: This syntax is a GNU extension. +#if _GLIBCXX_EXTERN_TEMPLATE > 0 + extern template class basic_string; + extern template + basic_istream& + operator>>(basic_istream&, string&); + extern template + basic_ostream& + operator<<(basic_ostream&, const string&); + extern template + basic_istream& + getline(basic_istream&, string&, char); + extern template + basic_istream& + getline(basic_istream&, string&); + +#ifdef _GLIBCXX_USE_WCHAR_T + extern template class basic_string; + extern template + basic_istream& + operator>>(basic_istream&, wstring&); + extern template + basic_ostream& + operator<<(basic_ostream&, const wstring&); + extern template + basic_istream& + getline(basic_istream&, wstring&, wchar_t); + extern template + basic_istream& + getline(basic_istream&, wstring&); +#endif +#endif + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/boost_concept_check.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/boost_concept_check.h new file mode 100644 index 00000000..054fcf27 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/boost_concept_check.h @@ -0,0 +1,787 @@ +// -*- C++ -*- + +// Copyright (C) 2004, 2005, 2006, 2007, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +// (C) Copyright Jeremy Siek 2000. Permission to copy, use, modify, +// sell and distribute this software is granted provided this +// copyright notice appears in all copies. This software is provided +// "as is" without express or implied warranty, and with no claim as +// to its suitability for any purpose. +// + +/** @file boost_concept_check.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// GCC Note: based on version 1.12.0 of the Boost library. + +#ifndef _BOOST_CONCEPT_CHECK_H +#define _BOOST_CONCEPT_CHECK_H 1 + +#pragma GCC system_header + +#include // for ptrdiff_t, used next +#include // for traits and tags + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + +#define _IsUnused __attribute__ ((__unused__)) + +// When the C-C code is in use, we would like this function to do as little +// as possible at runtime, use as few resources as possible, and hopefully +// be elided out of existence... hmmm. +template +inline void __function_requires() +{ + void (_Concept::*__x)() _IsUnused = &_Concept::__constraints; +} + +// No definition: if this is referenced, there's a problem with +// the instantiating type not being one of the required integer types. +// Unfortunately, this results in a link-time error, not a compile-time error. +void __error_type_must_be_an_integer_type(); +void __error_type_must_be_an_unsigned_integer_type(); +void __error_type_must_be_a_signed_integer_type(); + +// ??? Should the "concept_checking*" structs begin with more than _ ? +#define _GLIBCXX_CLASS_REQUIRES(_type_var, _ns, _concept) \ + typedef void (_ns::_concept <_type_var>::* _func##_type_var##_concept)(); \ + template <_func##_type_var##_concept _Tp1> \ + struct _concept_checking##_type_var##_concept { }; \ + typedef _concept_checking##_type_var##_concept< \ + &_ns::_concept <_type_var>::__constraints> \ + _concept_checking_typedef##_type_var##_concept + +#define _GLIBCXX_CLASS_REQUIRES2(_type_var1, _type_var2, _ns, _concept) \ + typedef void (_ns::_concept <_type_var1,_type_var2>::* _func##_type_var1##_type_var2##_concept)(); \ + template <_func##_type_var1##_type_var2##_concept _Tp1> \ + struct _concept_checking##_type_var1##_type_var2##_concept { }; \ + typedef _concept_checking##_type_var1##_type_var2##_concept< \ + &_ns::_concept <_type_var1,_type_var2>::__constraints> \ + _concept_checking_typedef##_type_var1##_type_var2##_concept + +#define _GLIBCXX_CLASS_REQUIRES3(_type_var1, _type_var2, _type_var3, _ns, _concept) \ + typedef void (_ns::_concept <_type_var1,_type_var2,_type_var3>::* _func##_type_var1##_type_var2##_type_var3##_concept)(); \ + template <_func##_type_var1##_type_var2##_type_var3##_concept _Tp1> \ + struct _concept_checking##_type_var1##_type_var2##_type_var3##_concept { }; \ + typedef _concept_checking##_type_var1##_type_var2##_type_var3##_concept< \ + &_ns::_concept <_type_var1,_type_var2,_type_var3>::__constraints> \ + _concept_checking_typedef##_type_var1##_type_var2##_type_var3##_concept + +#define _GLIBCXX_CLASS_REQUIRES4(_type_var1, _type_var2, _type_var3, _type_var4, _ns, _concept) \ + typedef void (_ns::_concept <_type_var1,_type_var2,_type_var3,_type_var4>::* _func##_type_var1##_type_var2##_type_var3##_type_var4##_concept)(); \ + template <_func##_type_var1##_type_var2##_type_var3##_type_var4##_concept _Tp1> \ + struct _concept_checking##_type_var1##_type_var2##_type_var3##_type_var4##_concept { }; \ + typedef _concept_checking##_type_var1##_type_var2##_type_var3##_type_var4##_concept< \ + &_ns::_concept <_type_var1,_type_var2,_type_var3,_type_var4>::__constraints> \ + _concept_checking_typedef##_type_var1##_type_var2##_type_var3##_type_var4##_concept + + +template +struct _Aux_require_same { }; + +template +struct _Aux_require_same<_Tp,_Tp> { typedef _Tp _Type; }; + + template + struct _SameTypeConcept + { + void __constraints() { + typedef typename _Aux_require_same<_Tp1, _Tp2>::_Type _Required; + } + }; + + template + struct _IntegerConcept { + void __constraints() { + __error_type_must_be_an_integer_type(); + } + }; + template <> struct _IntegerConcept { void __constraints() {} }; + template <> struct _IntegerConcept { void __constraints(){} }; + template <> struct _IntegerConcept { void __constraints() {} }; + template <> struct _IntegerConcept { void __constraints() {} }; + template <> struct _IntegerConcept { void __constraints() {} }; + template <> struct _IntegerConcept { void __constraints() {} }; + template <> struct _IntegerConcept { void __constraints() {} }; + template <> struct _IntegerConcept + { void __constraints() {} }; + + template + struct _SignedIntegerConcept { + void __constraints() { + __error_type_must_be_a_signed_integer_type(); + } + }; + template <> struct _SignedIntegerConcept { void __constraints() {} }; + template <> struct _SignedIntegerConcept { void __constraints() {} }; + template <> struct _SignedIntegerConcept { void __constraints() {} }; + template <> struct _SignedIntegerConcept { void __constraints(){}}; + + template + struct _UnsignedIntegerConcept { + void __constraints() { + __error_type_must_be_an_unsigned_integer_type(); + } + }; + template <> struct _UnsignedIntegerConcept + { void __constraints() {} }; + template <> struct _UnsignedIntegerConcept + { void __constraints() {} }; + template <> struct _UnsignedIntegerConcept + { void __constraints() {} }; + template <> struct _UnsignedIntegerConcept + { void __constraints() {} }; + + //=========================================================================== + // Basic Concepts + + template + struct _DefaultConstructibleConcept + { + void __constraints() { + _Tp __a _IsUnused; // require default constructor + } + }; + + template + struct _AssignableConcept + { + void __constraints() { + __a = __a; // require assignment operator + __const_constraints(__a); + } + void __const_constraints(const _Tp& __b) { + __a = __b; // const required for argument to assignment + } + _Tp __a; + // possibly should be "Tp* a;" and then dereference "a" in constraint + // functions? present way would require a default ctor, i think... + }; + + template + struct _CopyConstructibleConcept + { + void __constraints() { + _Tp __a(__b); // require copy constructor + _Tp* __ptr _IsUnused = &__a; // require address of operator + __const_constraints(__a); + } + void __const_constraints(const _Tp& __a) { + _Tp __c _IsUnused(__a); // require const copy constructor + const _Tp* __ptr _IsUnused = &__a; // require const address of operator + } + _Tp __b; + }; + + // The SGI STL version of Assignable requires copy constructor and operator= + template + struct _SGIAssignableConcept + { + void __constraints() { + _Tp __b _IsUnused(__a); + __a = __a; // require assignment operator + __const_constraints(__a); + } + void __const_constraints(const _Tp& __b) { + _Tp __c _IsUnused(__b); + __a = __b; // const required for argument to assignment + } + _Tp __a; + }; + + template + struct _ConvertibleConcept + { + void __constraints() { + _To __y _IsUnused = __x; + } + _From __x; + }; + + // The C++ standard requirements for many concepts talk about return + // types that must be "convertible to bool". The problem with this + // requirement is that it leaves the door open for evil proxies that + // define things like operator|| with strange return types. Two + // possible solutions are: + // 1) require the return type to be exactly bool + // 2) stay with convertible to bool, and also + // specify stuff about all the logical operators. + // For now we just test for convertible to bool. + template + void __aux_require_boolean_expr(const _Tp& __t) { + bool __x _IsUnused = __t; + } + +// FIXME + template + struct _EqualityComparableConcept + { + void __constraints() { + __aux_require_boolean_expr(__a == __b); + } + _Tp __a, __b; + }; + + template + struct _LessThanComparableConcept + { + void __constraints() { + __aux_require_boolean_expr(__a < __b); + } + _Tp __a, __b; + }; + + // This is equivalent to SGI STL's LessThanComparable. + template + struct _ComparableConcept + { + void __constraints() { + __aux_require_boolean_expr(__a < __b); + __aux_require_boolean_expr(__a > __b); + __aux_require_boolean_expr(__a <= __b); + __aux_require_boolean_expr(__a >= __b); + } + _Tp __a, __b; + }; + +#define _GLIBCXX_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(_OP,_NAME) \ + template \ + struct _NAME { \ + void __constraints() { (void)__constraints_(); } \ + bool __constraints_() { \ + return __a _OP __b; \ + } \ + _First __a; \ + _Second __b; \ + } + +#define _GLIBCXX_DEFINE_BINARY_OPERATOR_CONSTRAINT(_OP,_NAME) \ + template \ + struct _NAME { \ + void __constraints() { (void)__constraints_(); } \ + _Ret __constraints_() { \ + return __a _OP __b; \ + } \ + _First __a; \ + _Second __b; \ + } + + _GLIBCXX_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(==, _EqualOpConcept); + _GLIBCXX_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(!=, _NotEqualOpConcept); + _GLIBCXX_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(<, _LessThanOpConcept); + _GLIBCXX_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(<=, _LessEqualOpConcept); + _GLIBCXX_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(>, _GreaterThanOpConcept); + _GLIBCXX_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT(>=, _GreaterEqualOpConcept); + + _GLIBCXX_DEFINE_BINARY_OPERATOR_CONSTRAINT(+, _PlusOpConcept); + _GLIBCXX_DEFINE_BINARY_OPERATOR_CONSTRAINT(*, _TimesOpConcept); + _GLIBCXX_DEFINE_BINARY_OPERATOR_CONSTRAINT(/, _DivideOpConcept); + _GLIBCXX_DEFINE_BINARY_OPERATOR_CONSTRAINT(-, _SubtractOpConcept); + _GLIBCXX_DEFINE_BINARY_OPERATOR_CONSTRAINT(%, _ModOpConcept); + +#undef _GLIBCXX_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT +#undef _GLIBCXX_DEFINE_BINARY_OPERATOR_CONSTRAINT + + //=========================================================================== + // Function Object Concepts + + template + struct _GeneratorConcept + { + void __constraints() { + const _Return& __r _IsUnused = __f();// require operator() member function + } + _Func __f; + }; + + + template + struct _GeneratorConcept<_Func,void> + { + void __constraints() { + __f(); // require operator() member function + } + _Func __f; + }; + + template + struct _UnaryFunctionConcept + { + void __constraints() { + __r = __f(__arg); // require operator() + } + _Func __f; + _Arg __arg; + _Return __r; + }; + + template + struct _UnaryFunctionConcept<_Func, void, _Arg> { + void __constraints() { + __f(__arg); // require operator() + } + _Func __f; + _Arg __arg; + }; + + template + struct _BinaryFunctionConcept + { + void __constraints() { + __r = __f(__first, __second); // require operator() + } + _Func __f; + _First __first; + _Second __second; + _Return __r; + }; + + template + struct _BinaryFunctionConcept<_Func, void, _First, _Second> + { + void __constraints() { + __f(__first, __second); // require operator() + } + _Func __f; + _First __first; + _Second __second; + }; + + template + struct _UnaryPredicateConcept + { + void __constraints() { + __aux_require_boolean_expr(__f(__arg)); // require op() returning bool + } + _Func __f; + _Arg __arg; + }; + + template + struct _BinaryPredicateConcept + { + void __constraints() { + __aux_require_boolean_expr(__f(__a, __b)); // require op() returning bool + } + _Func __f; + _First __a; + _Second __b; + }; + + // use this when functor is used inside a container class like std::set + template + struct _Const_BinaryPredicateConcept { + void __constraints() { + __const_constraints(__f); + } + void __const_constraints(const _Func& __fun) { + __function_requires<_BinaryPredicateConcept<_Func, _First, _Second> >(); + // operator() must be a const member function + __aux_require_boolean_expr(__fun(__a, __b)); + } + _Func __f; + _First __a; + _Second __b; + }; + + //=========================================================================== + // Iterator Concepts + + template + struct _TrivialIteratorConcept + { + void __constraints() { +// __function_requires< _DefaultConstructibleConcept<_Tp> >(); + __function_requires< _AssignableConcept<_Tp> >(); + __function_requires< _EqualityComparableConcept<_Tp> >(); +// typedef typename std::iterator_traits<_Tp>::value_type _V; + (void)*__i; // require dereference operator + } + _Tp __i; + }; + + template + struct _Mutable_TrivialIteratorConcept + { + void __constraints() { + __function_requires< _TrivialIteratorConcept<_Tp> >(); + *__i = *__j; // require dereference and assignment + } + _Tp __i, __j; + }; + + template + struct _InputIteratorConcept + { + void __constraints() { + __function_requires< _TrivialIteratorConcept<_Tp> >(); + // require iterator_traits typedef's + typedef typename std::iterator_traits<_Tp>::difference_type _Diff; +// __function_requires< _SignedIntegerConcept<_Diff> >(); + typedef typename std::iterator_traits<_Tp>::reference _Ref; + typedef typename std::iterator_traits<_Tp>::pointer _Pt; + typedef typename std::iterator_traits<_Tp>::iterator_category _Cat; + __function_requires< _ConvertibleConcept< + typename std::iterator_traits<_Tp>::iterator_category, + std::input_iterator_tag> >(); + ++__i; // require preincrement operator + __i++; // require postincrement operator + } + _Tp __i; + }; + + template + struct _OutputIteratorConcept + { + void __constraints() { + __function_requires< _AssignableConcept<_Tp> >(); + ++__i; // require preincrement operator + __i++; // require postincrement operator + *__i++ = __t; // require postincrement and assignment + } + _Tp __i; + _ValueT __t; + }; + + template + struct _ForwardIteratorConcept + { + void __constraints() { + __function_requires< _InputIteratorConcept<_Tp> >(); + __function_requires< _DefaultConstructibleConcept<_Tp> >(); + __function_requires< _ConvertibleConcept< + typename std::iterator_traits<_Tp>::iterator_category, + std::forward_iterator_tag> >(); + typedef typename std::iterator_traits<_Tp>::reference _Ref; + _Ref __r _IsUnused = *__i; + } + _Tp __i; + }; + + template + struct _Mutable_ForwardIteratorConcept + { + void __constraints() { + __function_requires< _ForwardIteratorConcept<_Tp> >(); + *__i++ = *__i; // require postincrement and assignment + } + _Tp __i; + }; + + template + struct _BidirectionalIteratorConcept + { + void __constraints() { + __function_requires< _ForwardIteratorConcept<_Tp> >(); + __function_requires< _ConvertibleConcept< + typename std::iterator_traits<_Tp>::iterator_category, + std::bidirectional_iterator_tag> >(); + --__i; // require predecrement operator + __i--; // require postdecrement operator + } + _Tp __i; + }; + + template + struct _Mutable_BidirectionalIteratorConcept + { + void __constraints() { + __function_requires< _BidirectionalIteratorConcept<_Tp> >(); + __function_requires< _Mutable_ForwardIteratorConcept<_Tp> >(); + *__i-- = *__i; // require postdecrement and assignment + } + _Tp __i; + }; + + + template + struct _RandomAccessIteratorConcept + { + void __constraints() { + __function_requires< _BidirectionalIteratorConcept<_Tp> >(); + __function_requires< _ComparableConcept<_Tp> >(); + __function_requires< _ConvertibleConcept< + typename std::iterator_traits<_Tp>::iterator_category, + std::random_access_iterator_tag> >(); + // ??? We don't use _Ref, are we just checking for "referenceability"? + typedef typename std::iterator_traits<_Tp>::reference _Ref; + + __i += __n; // require assignment addition operator + __i = __i + __n; __i = __n + __i; // require addition with difference type + __i -= __n; // require assignment subtraction op + __i = __i - __n; // require subtraction with + // difference type + __n = __i - __j; // require difference operator + (void)__i[__n]; // require element access operator + } + _Tp __a, __b; + _Tp __i, __j; + typename std::iterator_traits<_Tp>::difference_type __n; + }; + + template + struct _Mutable_RandomAccessIteratorConcept + { + void __constraints() { + __function_requires< _RandomAccessIteratorConcept<_Tp> >(); + __function_requires< _Mutable_BidirectionalIteratorConcept<_Tp> >(); + __i[__n] = *__i; // require element access and assignment + } + _Tp __i; + typename std::iterator_traits<_Tp>::difference_type __n; + }; + + //=========================================================================== + // Container Concepts + + template + struct _ContainerConcept + { + typedef typename _Container::value_type _Value_type; + typedef typename _Container::difference_type _Difference_type; + typedef typename _Container::size_type _Size_type; + typedef typename _Container::const_reference _Const_reference; + typedef typename _Container::const_pointer _Const_pointer; + typedef typename _Container::const_iterator _Const_iterator; + + void __constraints() { + __function_requires< _InputIteratorConcept<_Const_iterator> >(); + __function_requires< _AssignableConcept<_Container> >(); + const _Container __c; + __i = __c.begin(); + __i = __c.end(); + __n = __c.size(); + __n = __c.max_size(); + __b = __c.empty(); + } + bool __b; + _Const_iterator __i; + _Size_type __n; + }; + + template + struct _Mutable_ContainerConcept + { + typedef typename _Container::value_type _Value_type; + typedef typename _Container::reference _Reference; + typedef typename _Container::iterator _Iterator; + typedef typename _Container::pointer _Pointer; + + void __constraints() { + __function_requires< _ContainerConcept<_Container> >(); + __function_requires< _AssignableConcept<_Value_type> >(); + __function_requires< _InputIteratorConcept<_Iterator> >(); + + __i = __c.begin(); + __i = __c.end(); + __c.swap(__c2); + } + _Iterator __i; + _Container __c, __c2; + }; + + template + struct _ForwardContainerConcept + { + void __constraints() { + __function_requires< _ContainerConcept<_ForwardContainer> >(); + typedef typename _ForwardContainer::const_iterator _Const_iterator; + __function_requires< _ForwardIteratorConcept<_Const_iterator> >(); + } + }; + + template + struct _Mutable_ForwardContainerConcept + { + void __constraints() { + __function_requires< _ForwardContainerConcept<_ForwardContainer> >(); + __function_requires< _Mutable_ContainerConcept<_ForwardContainer> >(); + typedef typename _ForwardContainer::iterator _Iterator; + __function_requires< _Mutable_ForwardIteratorConcept<_Iterator> >(); + } + }; + + template + struct _ReversibleContainerConcept + { + typedef typename _ReversibleContainer::const_iterator _Const_iterator; + typedef typename _ReversibleContainer::const_reverse_iterator + _Const_reverse_iterator; + + void __constraints() { + __function_requires< _ForwardContainerConcept<_ReversibleContainer> >(); + __function_requires< _BidirectionalIteratorConcept<_Const_iterator> >(); + __function_requires< + _BidirectionalIteratorConcept<_Const_reverse_iterator> >(); + + const _ReversibleContainer __c; + _Const_reverse_iterator __i = __c.rbegin(); + __i = __c.rend(); + } + }; + + template + struct _Mutable_ReversibleContainerConcept + { + typedef typename _ReversibleContainer::iterator _Iterator; + typedef typename _ReversibleContainer::reverse_iterator _Reverse_iterator; + + void __constraints() { + __function_requires<_ReversibleContainerConcept<_ReversibleContainer> >(); + __function_requires< + _Mutable_ForwardContainerConcept<_ReversibleContainer> >(); + __function_requires<_Mutable_BidirectionalIteratorConcept<_Iterator> >(); + __function_requires< + _Mutable_BidirectionalIteratorConcept<_Reverse_iterator> >(); + + _Reverse_iterator __i = __c.rbegin(); + __i = __c.rend(); + } + _ReversibleContainer __c; + }; + + template + struct _RandomAccessContainerConcept + { + typedef typename _RandomAccessContainer::size_type _Size_type; + typedef typename _RandomAccessContainer::const_reference _Const_reference; + typedef typename _RandomAccessContainer::const_iterator _Const_iterator; + typedef typename _RandomAccessContainer::const_reverse_iterator + _Const_reverse_iterator; + + void __constraints() { + __function_requires< + _ReversibleContainerConcept<_RandomAccessContainer> >(); + __function_requires< _RandomAccessIteratorConcept<_Const_iterator> >(); + __function_requires< + _RandomAccessIteratorConcept<_Const_reverse_iterator> >(); + + const _RandomAccessContainer __c; + _Const_reference __r _IsUnused = __c[__n]; + } + _Size_type __n; + }; + + template + struct _Mutable_RandomAccessContainerConcept + { + typedef typename _RandomAccessContainer::size_type _Size_type; + typedef typename _RandomAccessContainer::reference _Reference; + typedef typename _RandomAccessContainer::iterator _Iterator; + typedef typename _RandomAccessContainer::reverse_iterator _Reverse_iterator; + + void __constraints() { + __function_requires< + _RandomAccessContainerConcept<_RandomAccessContainer> >(); + __function_requires< + _Mutable_ReversibleContainerConcept<_RandomAccessContainer> >(); + __function_requires< _Mutable_RandomAccessIteratorConcept<_Iterator> >(); + __function_requires< + _Mutable_RandomAccessIteratorConcept<_Reverse_iterator> >(); + + _Reference __r _IsUnused = __c[__i]; + } + _Size_type __i; + _RandomAccessContainer __c; + }; + + // A Sequence is inherently mutable + template + struct _SequenceConcept + { + typedef typename _Sequence::reference _Reference; + typedef typename _Sequence::const_reference _Const_reference; + + void __constraints() { + // Matt Austern's book puts DefaultConstructible here, the C++ + // standard places it in Container + // function_requires< DefaultConstructible >(); + __function_requires< _Mutable_ForwardContainerConcept<_Sequence> >(); + __function_requires< _DefaultConstructibleConcept<_Sequence> >(); + + _Sequence + __c _IsUnused(__n, __t), + __c2 _IsUnused(__first, __last); + + __c.insert(__p, __t); + __c.insert(__p, __n, __t); + __c.insert(__p, __first, __last); + + __c.erase(__p); + __c.erase(__p, __q); + + _Reference __r _IsUnused = __c.front(); + + __const_constraints(__c); + } + void __const_constraints(const _Sequence& __c) { + _Const_reference __r _IsUnused = __c.front(); + } + typename _Sequence::value_type __t; + typename _Sequence::size_type __n; + typename _Sequence::value_type *__first, *__last; + typename _Sequence::iterator __p, __q; + }; + + template + struct _FrontInsertionSequenceConcept + { + void __constraints() { + __function_requires< _SequenceConcept<_FrontInsertionSequence> >(); + + __c.push_front(__t); + __c.pop_front(); + } + _FrontInsertionSequence __c; + typename _FrontInsertionSequence::value_type __t; + }; + + template + struct _BackInsertionSequenceConcept + { + typedef typename _BackInsertionSequence::reference _Reference; + typedef typename _BackInsertionSequence::const_reference _Const_reference; + + void __constraints() { + __function_requires< _SequenceConcept<_BackInsertionSequence> >(); + + __c.push_back(__t); + __c.pop_back(); + _Reference __r _IsUnused = __c.back(); + } + void __const_constraints(const _BackInsertionSequence& __c) { + _Const_reference __r _IsUnused = __c.back(); + }; + _BackInsertionSequence __c; + typename _BackInsertionSequence::value_type __t; + }; + +_GLIBCXX_END_NAMESPACE + +#undef _IsUnused + +#endif // _GLIBCXX_BOOST_CONCEPT_CHECK + + diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/char_traits.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/char_traits.h new file mode 100644 index 00000000..5e52c753 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/char_traits.h @@ -0,0 +1,575 @@ +// Character Traits for use by standard string and iostream -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file char_traits.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 21 Strings library +// + +#ifndef _CHAR_TRAITS_H +#define _CHAR_TRAITS_H 1 + +#pragma GCC system_header + +#include // std::copy, std::fill_n +#include // For streampos +#include // For WEOF, wmemmove, wmemset, etc. + +#ifndef _GLIBCXX_STDIO_MACROS +# include // For EOF +# define _CHAR_TRAITS_EOF EOF +#else +# define _CHAR_TRAITS_EOF (-1) +#endif + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + /** + * @brief Mapping from character type to associated types. + * + * @note This is an implementation class for the generic version + * of char_traits. It defines int_type, off_type, pos_type, and + * state_type. By default these are unsigned long, streamoff, + * streampos, and mbstate_t. Users who need a different set of + * types, but who don't need to change the definitions of any function + * defined in char_traits, can specialize __gnu_cxx::_Char_types + * while leaving __gnu_cxx::char_traits alone. */ + template + struct _Char_types + { + typedef unsigned long int_type; + typedef std::streampos pos_type; + typedef std::streamoff off_type; + typedef std::mbstate_t state_type; + }; + + + /** + * @brief Base class used to implement std::char_traits. + * + * @note For any given actual character type, this definition is + * probably wrong. (Most of the member functions are likely to be + * right, but the int_type and state_type typedefs, and the eof() + * member function, are likely to be wrong.) The reason this class + * exists is so users can specialize it. Classes in namespace std + * may not be specialized for fundamental types, but classes in + * namespace __gnu_cxx may be. + * + * See http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt05ch13s03.html + * for advice on how to make use of this class for "unusual" character + * types. Also, check out include/ext/pod_char_traits.h. + */ + template + struct char_traits + { + typedef _CharT char_type; + typedef typename _Char_types<_CharT>::int_type int_type; + typedef typename _Char_types<_CharT>::pos_type pos_type; + typedef typename _Char_types<_CharT>::off_type off_type; + typedef typename _Char_types<_CharT>::state_type state_type; + + static void + assign(char_type& __c1, const char_type& __c2) + { __c1 = __c2; } + + static bool + eq(const char_type& __c1, const char_type& __c2) + { return __c1 == __c2; } + + static bool + lt(const char_type& __c1, const char_type& __c2) + { return __c1 < __c2; } + + static int + compare(const char_type* __s1, const char_type* __s2, std::size_t __n); + + static std::size_t + length(const char_type* __s); + + static const char_type* + find(const char_type* __s, std::size_t __n, const char_type& __a); + + static char_type* + move(char_type* __s1, const char_type* __s2, std::size_t __n); + + static char_type* + copy(char_type* __s1, const char_type* __s2, std::size_t __n); + + static char_type* + assign(char_type* __s, std::size_t __n, char_type __a); + + static char_type + to_char_type(const int_type& __c) + { return static_cast(__c); } + + static int_type + to_int_type(const char_type& __c) + { return static_cast(__c); } + + static bool + eq_int_type(const int_type& __c1, const int_type& __c2) + { return __c1 == __c2; } + + static int_type + eof() + { return static_cast(_CHAR_TRAITS_EOF); } + + static int_type + not_eof(const int_type& __c) + { return !eq_int_type(__c, eof()) ? __c : to_int_type(char_type()); } + }; + + template + int + char_traits<_CharT>:: + compare(const char_type* __s1, const char_type* __s2, std::size_t __n) + { + for (std::size_t __i = 0; __i < __n; ++__i) + if (lt(__s1[__i], __s2[__i])) + return -1; + else if (lt(__s2[__i], __s1[__i])) + return 1; + return 0; + } + + template + std::size_t + char_traits<_CharT>:: + length(const char_type* __p) + { + std::size_t __i = 0; + while (!eq(__p[__i], char_type())) + ++__i; + return __i; + } + + template + const typename char_traits<_CharT>::char_type* + char_traits<_CharT>:: + find(const char_type* __s, std::size_t __n, const char_type& __a) + { + for (std::size_t __i = 0; __i < __n; ++__i) + if (eq(__s[__i], __a)) + return __s + __i; + return 0; + } + + template + typename char_traits<_CharT>::char_type* + char_traits<_CharT>:: + move(char_type* __s1, const char_type* __s2, std::size_t __n) + { + return static_cast<_CharT*>(__builtin_memmove(__s1, __s2, + __n * sizeof(char_type))); + } + + template + typename char_traits<_CharT>::char_type* + char_traits<_CharT>:: + copy(char_type* __s1, const char_type* __s2, std::size_t __n) + { + // NB: Inline std::copy so no recursive dependencies. + std::copy(__s2, __s2 + __n, __s1); + return __s1; + } + + template + typename char_traits<_CharT>::char_type* + char_traits<_CharT>:: + assign(char_type* __s, std::size_t __n, char_type __a) + { + // NB: Inline std::fill_n so no recursive dependencies. + std::fill_n(__s, __n, __a); + return __s; + } + +_GLIBCXX_END_NAMESPACE + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // 21.1 + /** + * @brief Basis for explicit traits specializations. + * + * @note For any given actual character type, this definition is + * probably wrong. Since this is just a thin wrapper around + * __gnu_cxx::char_traits, it is possible to achieve a more + * appropriate definition by specializing __gnu_cxx::char_traits. + * + * See http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt05ch13s03.html + * for advice on how to make use of this class for "unusual" character + * types. Also, check out include/ext/pod_char_traits.h. + */ + template + struct char_traits : public __gnu_cxx::char_traits<_CharT> + { }; + + + /// 21.1.3.1 char_traits specializations + template<> + struct char_traits + { + typedef char char_type; + typedef int int_type; + typedef streampos pos_type; + typedef streamoff off_type; + typedef mbstate_t state_type; + + static void + assign(char_type& __c1, const char_type& __c2) + { __c1 = __c2; } + + static bool + eq(const char_type& __c1, const char_type& __c2) + { return __c1 == __c2; } + + static bool + lt(const char_type& __c1, const char_type& __c2) + { return __c1 < __c2; } + + static int + compare(const char_type* __s1, const char_type* __s2, size_t __n) + { return __builtin_memcmp(__s1, __s2, __n); } + + static size_t + length(const char_type* __s) + { return __builtin_strlen(__s); } + + static const char_type* + find(const char_type* __s, size_t __n, const char_type& __a) + { return static_cast(__builtin_memchr(__s, __a, __n)); } + + static char_type* + move(char_type* __s1, const char_type* __s2, size_t __n) + { return static_cast(__builtin_memmove(__s1, __s2, __n)); } + + static char_type* + copy(char_type* __s1, const char_type* __s2, size_t __n) + { return static_cast(__builtin_memcpy(__s1, __s2, __n)); } + + static char_type* + assign(char_type* __s, size_t __n, char_type __a) + { return static_cast(__builtin_memset(__s, __a, __n)); } + + static char_type + to_char_type(const int_type& __c) + { return static_cast(__c); } + + // To keep both the byte 0xff and the eof symbol 0xffffffff + // from ending up as 0xffffffff. + static int_type + to_int_type(const char_type& __c) + { return static_cast(static_cast(__c)); } + + static bool + eq_int_type(const int_type& __c1, const int_type& __c2) + { return __c1 == __c2; } + + static int_type + eof() + { return static_cast(_CHAR_TRAITS_EOF); } + + static int_type + not_eof(const int_type& __c) + { return (__c == eof()) ? 0 : __c; } + }; + + +#ifdef _GLIBCXX_USE_WCHAR_T + /// 21.1.3.2 char_traits specializations + template<> + struct char_traits + { + typedef wchar_t char_type; + typedef wint_t int_type; + typedef streamoff off_type; + typedef wstreampos pos_type; + typedef mbstate_t state_type; + + static void + assign(char_type& __c1, const char_type& __c2) + { __c1 = __c2; } + + static bool + eq(const char_type& __c1, const char_type& __c2) + { return __c1 == __c2; } + + static bool + lt(const char_type& __c1, const char_type& __c2) + { return __c1 < __c2; } + + static int + compare(const char_type* __s1, const char_type* __s2, size_t __n) + { return wmemcmp(__s1, __s2, __n); } + + static size_t + length(const char_type* __s) + { return wcslen(__s); } + + static const char_type* + find(const char_type* __s, size_t __n, const char_type& __a) + { return wmemchr(__s, __a, __n); } + + static char_type* + move(char_type* __s1, const char_type* __s2, size_t __n) + { return wmemmove(__s1, __s2, __n); } + + static char_type* + copy(char_type* __s1, const char_type* __s2, size_t __n) + { return wmemcpy(__s1, __s2, __n); } + + static char_type* + assign(char_type* __s, size_t __n, char_type __a) + { return wmemset(__s, __a, __n); } + + static char_type + to_char_type(const int_type& __c) + { return char_type(__c); } + + static int_type + to_int_type(const char_type& __c) + { return int_type(__c); } + + static bool + eq_int_type(const int_type& __c1, const int_type& __c2) + { return __c1 == __c2; } + + static int_type + eof() + { return static_cast(WEOF); } + + static int_type + not_eof(const int_type& __c) + { return eq_int_type(__c, eof()) ? 0 : __c; } + }; +#endif //_GLIBCXX_USE_WCHAR_T + +_GLIBCXX_END_NAMESPACE + +#if (defined(__GXX_EXPERIMENTAL_CXX0X__) \ + && defined(_GLIBCXX_USE_C99_STDINT_TR1)) + +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + template<> + struct char_traits + { + typedef char16_t char_type; + typedef uint_least16_t int_type; + typedef streamoff off_type; + typedef u16streampos pos_type; + typedef mbstate_t state_type; + + static void + assign(char_type& __c1, const char_type& __c2) + { __c1 = __c2; } + + static bool + eq(const char_type& __c1, const char_type& __c2) + { return __c1 == __c2; } + + static bool + lt(const char_type& __c1, const char_type& __c2) + { return __c1 < __c2; } + + static int + compare(const char_type* __s1, const char_type* __s2, size_t __n) + { + for (size_t __i = 0; __i < __n; ++__i) + if (lt(__s1[__i], __s2[__i])) + return -1; + else if (lt(__s2[__i], __s1[__i])) + return 1; + return 0; + } + + static size_t + length(const char_type* __s) + { + size_t __i = 0; + while (!eq(__s[__i], char_type())) + ++__i; + return __i; + } + + static const char_type* + find(const char_type* __s, size_t __n, const char_type& __a) + { + for (size_t __i = 0; __i < __n; ++__i) + if (eq(__s[__i], __a)) + return __s + __i; + return 0; + } + + static char_type* + move(char_type* __s1, const char_type* __s2, size_t __n) + { + return (static_cast + (__builtin_memmove(__s1, __s2, __n * sizeof(char_type)))); + } + + static char_type* + copy(char_type* __s1, const char_type* __s2, size_t __n) + { + return (static_cast + (__builtin_memcpy(__s1, __s2, __n * sizeof(char_type)))); + } + + static char_type* + assign(char_type* __s, size_t __n, char_type __a) + { + for (size_t __i = 0; __i < __n; ++__i) + assign(__s[__i], __a); + return __s; + } + + static char_type + to_char_type(const int_type& __c) + { return char_type(__c); } + + static int_type + to_int_type(const char_type& __c) + { return int_type(__c); } + + static bool + eq_int_type(const int_type& __c1, const int_type& __c2) + { return __c1 == __c2; } + + static int_type + eof() + { return static_cast(-1); } + + static int_type + not_eof(const int_type& __c) + { return eq_int_type(__c, eof()) ? 0 : __c; } + }; + + template<> + struct char_traits + { + typedef char32_t char_type; + typedef uint_least32_t int_type; + typedef streamoff off_type; + typedef u32streampos pos_type; + typedef mbstate_t state_type; + + static void + assign(char_type& __c1, const char_type& __c2) + { __c1 = __c2; } + + static bool + eq(const char_type& __c1, const char_type& __c2) + { return __c1 == __c2; } + + static bool + lt(const char_type& __c1, const char_type& __c2) + { return __c1 < __c2; } + + static int + compare(const char_type* __s1, const char_type* __s2, size_t __n) + { + for (size_t __i = 0; __i < __n; ++__i) + if (lt(__s1[__i], __s2[__i])) + return -1; + else if (lt(__s2[__i], __s1[__i])) + return 1; + return 0; + } + + static size_t + length(const char_type* __s) + { + size_t __i = 0; + while (!eq(__s[__i], char_type())) + ++__i; + return __i; + } + + static const char_type* + find(const char_type* __s, size_t __n, const char_type& __a) + { + for (size_t __i = 0; __i < __n; ++__i) + if (eq(__s[__i], __a)) + return __s + __i; + return 0; + } + + static char_type* + move(char_type* __s1, const char_type* __s2, size_t __n) + { + return (static_cast + (__builtin_memmove(__s1, __s2, __n * sizeof(char_type)))); + } + + static char_type* + copy(char_type* __s1, const char_type* __s2, size_t __n) + { + return (static_cast + (__builtin_memcpy(__s1, __s2, __n * sizeof(char_type)))); + } + + static char_type* + assign(char_type* __s, size_t __n, char_type __a) + { + for (size_t __i = 0; __i < __n; ++__i) + assign(__s[__i], __a); + return __s; + } + + static char_type + to_char_type(const int_type& __c) + { return char_type(__c); } + + static int_type + to_int_type(const char_type& __c) + { return int_type(__c); } + + static bool + eq_int_type(const int_type& __c1, const int_type& __c2) + { return __c1 == __c2; } + + static int_type + eof() + { return static_cast(-1); } + + static int_type + not_eof(const int_type& __c) + { return eq_int_type(__c, eof()) ? 0 : __c; } + }; + +_GLIBCXX_END_NAMESPACE + +#endif + +#undef _CHAR_TRAITS_EOF + +#endif // _CHAR_TRAITS_H diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/cmath.tcc b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/cmath.tcc new file mode 100644 index 00000000..9f4c853a --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/cmath.tcc @@ -0,0 +1,55 @@ +// -*- C++ -*- C math library. + +// Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +// This file was written by Gabriel Dos Reis + +/** @file cmath.tcc + * This is a Standard C++ Library file. + */ + +#ifndef _GLIBCXX_CMATH_TCC +#define _GLIBCXX_CMATH_TCC 1 + +_GLIBCXX_BEGIN_NAMESPACE(std) + + template + inline _Tp + __cmath_power(_Tp __x, unsigned int __n) + { + _Tp __y = __n % 2 ? __x : _Tp(1); + + while (__n >>= 1) + { + __x = __x * __x; + if (__n % 2) + __y = __y * __x; + } + + return __y; + } + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/codecvt.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/codecvt.h new file mode 100644 index 00000000..2dbb4986 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/codecvt.h @@ -0,0 +1,497 @@ +// Locale support (codecvt) -*- C++ -*- + +// Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, +// 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file bits/codecvt.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 22.2.1.5 Template class codecvt +// + +// Written by Benjamin Kosnik + +#ifndef _CODECVT_H +#define _CODECVT_H 1 + +#pragma GCC system_header + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /// Empty base class for codecvt facet [22.2.1.5]. + class codecvt_base + { + public: + enum result + { + ok, + partial, + error, + noconv + }; + }; + + /** + * @brief Common base for codecvt functions. + * + * This template class provides implementations of the public functions + * that forward to the protected virtual functions. + * + * This template also provides abstract stubs for the protected virtual + * functions. + */ + template + class __codecvt_abstract_base + : public locale::facet, public codecvt_base + { + public: + // Types: + typedef codecvt_base::result result; + typedef _InternT intern_type; + typedef _ExternT extern_type; + typedef _StateT state_type; + + // 22.2.1.5.1 codecvt members + /** + * @brief Convert from internal to external character set. + * + * Converts input string of intern_type to output string of + * extern_type. This is analogous to wcsrtombs. It does this by + * calling codecvt::do_out. + * + * The source and destination character sets are determined by the + * facet's locale, internal and external types. + * + * The characters in [from,from_end) are converted and written to + * [to,to_end). from_next and to_next are set to point to the + * character following the last successfully converted character, + * respectively. If the result needed no conversion, from_next and + * to_next are not affected. + * + * The @a state argument should be initialized if the input is at the + * beginning and carried from a previous call if continuing + * conversion. There are no guarantees about how @a state is used. + * + * The result returned is a member of codecvt_base::result. If + * all the input is converted, returns codecvt_base::ok. If no + * conversion is necessary, returns codecvt_base::noconv. If + * the input ends early or there is insufficient space in the + * output, returns codecvt_base::partial. Otherwise the + * conversion failed and codecvt_base::error is returned. + * + * @param state Persistent conversion state data. + * @param from Start of input. + * @param from_end End of input. + * @param from_next Returns start of unconverted data. + * @param to Start of output buffer. + * @param to_end End of output buffer. + * @param to_next Returns start of unused output area. + * @return codecvt_base::result. + */ + result + out(state_type& __state, const intern_type* __from, + const intern_type* __from_end, const intern_type*& __from_next, + extern_type* __to, extern_type* __to_end, + extern_type*& __to_next) const + { + return this->do_out(__state, __from, __from_end, __from_next, + __to, __to_end, __to_next); + } + + /** + * @brief Reset conversion state. + * + * Writes characters to output that would restore @a state to initial + * conditions. The idea is that if a partial conversion occurs, then + * the converting the characters written by this function would leave + * the state in initial conditions, rather than partial conversion + * state. It does this by calling codecvt::do_unshift(). + * + * For example, if 4 external characters always converted to 1 internal + * character, and input to in() had 6 external characters with state + * saved, this function would write two characters to the output and + * set the state to initialized conditions. + * + * The source and destination character sets are determined by the + * facet's locale, internal and external types. + * + * The result returned is a member of codecvt_base::result. If the + * state could be reset and data written, returns codecvt_base::ok. If + * no conversion is necessary, returns codecvt_base::noconv. If the + * output has insufficient space, returns codecvt_base::partial. + * Otherwise the reset failed and codecvt_base::error is returned. + * + * @param state Persistent conversion state data. + * @param to Start of output buffer. + * @param to_end End of output buffer. + * @param to_next Returns start of unused output area. + * @return codecvt_base::result. + */ + result + unshift(state_type& __state, extern_type* __to, extern_type* __to_end, + extern_type*& __to_next) const + { return this->do_unshift(__state, __to,__to_end,__to_next); } + + /** + * @brief Convert from external to internal character set. + * + * Converts input string of extern_type to output string of + * intern_type. This is analogous to mbsrtowcs. It does this by + * calling codecvt::do_in. + * + * The source and destination character sets are determined by the + * facet's locale, internal and external types. + * + * The characters in [from,from_end) are converted and written to + * [to,to_end). from_next and to_next are set to point to the + * character following the last successfully converted character, + * respectively. If the result needed no conversion, from_next and + * to_next are not affected. + * + * The @a state argument should be initialized if the input is at the + * beginning and carried from a previous call if continuing + * conversion. There are no guarantees about how @a state is used. + * + * The result returned is a member of codecvt_base::result. If + * all the input is converted, returns codecvt_base::ok. If no + * conversion is necessary, returns codecvt_base::noconv. If + * the input ends early or there is insufficient space in the + * output, returns codecvt_base::partial. Otherwise the + * conversion failed and codecvt_base::error is returned. + * + * @param state Persistent conversion state data. + * @param from Start of input. + * @param from_end End of input. + * @param from_next Returns start of unconverted data. + * @param to Start of output buffer. + * @param to_end End of output buffer. + * @param to_next Returns start of unused output area. + * @return codecvt_base::result. + */ + result + in(state_type& __state, const extern_type* __from, + const extern_type* __from_end, const extern_type*& __from_next, + intern_type* __to, intern_type* __to_end, + intern_type*& __to_next) const + { + return this->do_in(__state, __from, __from_end, __from_next, + __to, __to_end, __to_next); + } + + int + encoding() const throw() + { return this->do_encoding(); } + + bool + always_noconv() const throw() + { return this->do_always_noconv(); } + + int + length(state_type& __state, const extern_type* __from, + const extern_type* __end, size_t __max) const + { return this->do_length(__state, __from, __end, __max); } + + int + max_length() const throw() + { return this->do_max_length(); } + + protected: + explicit + __codecvt_abstract_base(size_t __refs = 0) : locale::facet(__refs) { } + + virtual + ~__codecvt_abstract_base() { } + + /** + * @brief Convert from internal to external character set. + * + * Converts input string of intern_type to output string of + * extern_type. This function is a hook for derived classes to change + * the value returned. @see out for more information. + */ + virtual result + do_out(state_type& __state, const intern_type* __from, + const intern_type* __from_end, const intern_type*& __from_next, + extern_type* __to, extern_type* __to_end, + extern_type*& __to_next) const = 0; + + virtual result + do_unshift(state_type& __state, extern_type* __to, + extern_type* __to_end, extern_type*& __to_next) const = 0; + + virtual result + do_in(state_type& __state, const extern_type* __from, + const extern_type* __from_end, const extern_type*& __from_next, + intern_type* __to, intern_type* __to_end, + intern_type*& __to_next) const = 0; + + virtual int + do_encoding() const throw() = 0; + + virtual bool + do_always_noconv() const throw() = 0; + + virtual int + do_length(state_type&, const extern_type* __from, + const extern_type* __end, size_t __max) const = 0; + + virtual int + do_max_length() const throw() = 0; + }; + + /// @brief class codecvt [22.2.1.5]. + /// NB: Generic, mostly useless implementation. + template + class codecvt + : public __codecvt_abstract_base<_InternT, _ExternT, _StateT> + { + public: + // Types: + typedef codecvt_base::result result; + typedef _InternT intern_type; + typedef _ExternT extern_type; + typedef _StateT state_type; + + protected: + __c_locale _M_c_locale_codecvt; + + public: + static locale::id id; + + explicit + codecvt(size_t __refs = 0) + : __codecvt_abstract_base<_InternT, _ExternT, _StateT> (__refs) { } + + explicit + codecvt(__c_locale __cloc, size_t __refs = 0); + + protected: + virtual + ~codecvt() { } + + virtual result + do_out(state_type& __state, const intern_type* __from, + const intern_type* __from_end, const intern_type*& __from_next, + extern_type* __to, extern_type* __to_end, + extern_type*& __to_next) const; + + virtual result + do_unshift(state_type& __state, extern_type* __to, + extern_type* __to_end, extern_type*& __to_next) const; + + virtual result + do_in(state_type& __state, const extern_type* __from, + const extern_type* __from_end, const extern_type*& __from_next, + intern_type* __to, intern_type* __to_end, + intern_type*& __to_next) const; + + virtual int + do_encoding() const throw(); + + virtual bool + do_always_noconv() const throw(); + + virtual int + do_length(state_type&, const extern_type* __from, + const extern_type* __end, size_t __max) const; + + virtual int + do_max_length() const throw(); + }; + + template + locale::id codecvt<_InternT, _ExternT, _StateT>::id; + + /// class codecvt specialization. + template<> + class codecvt + : public __codecvt_abstract_base + { + public: + // Types: + typedef char intern_type; + typedef char extern_type; + typedef mbstate_t state_type; + + protected: + __c_locale _M_c_locale_codecvt; + + public: + static locale::id id; + + explicit + codecvt(size_t __refs = 0); + + explicit + codecvt(__c_locale __cloc, size_t __refs = 0); + + protected: + virtual + ~codecvt(); + + virtual result + do_out(state_type& __state, const intern_type* __from, + const intern_type* __from_end, const intern_type*& __from_next, + extern_type* __to, extern_type* __to_end, + extern_type*& __to_next) const; + + virtual result + do_unshift(state_type& __state, extern_type* __to, + extern_type* __to_end, extern_type*& __to_next) const; + + virtual result + do_in(state_type& __state, const extern_type* __from, + const extern_type* __from_end, const extern_type*& __from_next, + intern_type* __to, intern_type* __to_end, + intern_type*& __to_next) const; + + virtual int + do_encoding() const throw(); + + virtual bool + do_always_noconv() const throw(); + + virtual int + do_length(state_type&, const extern_type* __from, + const extern_type* __end, size_t __max) const; + + virtual int + do_max_length() const throw(); + }; + +#ifdef _GLIBCXX_USE_WCHAR_T + /// class codecvt specialization. + template<> + class codecvt + : public __codecvt_abstract_base + { + public: + // Types: + typedef wchar_t intern_type; + typedef char extern_type; + typedef mbstate_t state_type; + + protected: + __c_locale _M_c_locale_codecvt; + + public: + static locale::id id; + + explicit + codecvt(size_t __refs = 0); + + explicit + codecvt(__c_locale __cloc, size_t __refs = 0); + + protected: + virtual + ~codecvt(); + + virtual result + do_out(state_type& __state, const intern_type* __from, + const intern_type* __from_end, const intern_type*& __from_next, + extern_type* __to, extern_type* __to_end, + extern_type*& __to_next) const; + + virtual result + do_unshift(state_type& __state, + extern_type* __to, extern_type* __to_end, + extern_type*& __to_next) const; + + virtual result + do_in(state_type& __state, + const extern_type* __from, const extern_type* __from_end, + const extern_type*& __from_next, + intern_type* __to, intern_type* __to_end, + intern_type*& __to_next) const; + + virtual + int do_encoding() const throw(); + + virtual + bool do_always_noconv() const throw(); + + virtual + int do_length(state_type&, const extern_type* __from, + const extern_type* __end, size_t __max) const; + + virtual int + do_max_length() const throw(); + }; +#endif //_GLIBCXX_USE_WCHAR_T + + /// class codecvt_byname [22.2.1.6]. + template + class codecvt_byname : public codecvt<_InternT, _ExternT, _StateT> + { + public: + explicit + codecvt_byname(const char* __s, size_t __refs = 0) + : codecvt<_InternT, _ExternT, _StateT>(__refs) + { + if (__builtin_strcmp(__s, "C") != 0 + && __builtin_strcmp(__s, "POSIX") != 0) + { + this->_S_destroy_c_locale(this->_M_c_locale_codecvt); + this->_S_create_c_locale(this->_M_c_locale_codecvt, __s); + } + } + + protected: + virtual + ~codecvt_byname() { } + }; + + // Inhibit implicit instantiations for required instantiations, + // which are defined via explicit instantiations elsewhere. + // NB: This syntax is a GNU extension. +#if _GLIBCXX_EXTERN_TEMPLATE + extern template class codecvt_byname; + + extern template + const codecvt& + use_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + +#ifdef _GLIBCXX_USE_WCHAR_T + extern template class codecvt_byname; + + extern template + const codecvt& + use_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); +#endif +#endif + +_GLIBCXX_END_NAMESPACE + +#endif // _CODECVT_H diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/concept_check.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/concept_check.h new file mode 100644 index 00000000..6d45e268 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/concept_check.h @@ -0,0 +1,80 @@ +// Concept-checking control -*- C++ -*- + +// Copyright (C) 2001, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file concept_check.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _CONCEPT_CHECK_H +#define _CONCEPT_CHECK_H 1 + +#pragma GCC system_header + +#include + +// All places in libstdc++-v3 where these are used, or /might/ be used, or +// don't need to be used, or perhaps /should/ be used, are commented with +// "concept requirements" (and maybe some more text). So grep like crazy +// if you're looking for additional places to use these. + +// Concept-checking code is off by default unless users turn it on via +// configure options or editing c++config.h. + +#ifndef _GLIBCXX_CONCEPT_CHECKS + +#define __glibcxx_function_requires(...) +#define __glibcxx_class_requires(_a,_b) +#define __glibcxx_class_requires2(_a,_b,_c) +#define __glibcxx_class_requires3(_a,_b,_c,_d) +#define __glibcxx_class_requires4(_a,_b,_c,_d,_e) + +#else // the checks are on + +#include + +// Note that the obvious and elegant approach of +// +//#define glibcxx_function_requires(C) boost::function_requires< boost::C >() +// +// won't work due to concept templates with more than one parameter, e.g., +// BinaryPredicateConcept. The preprocessor tries to split things up on +// the commas in the template argument list. We can't use an inner pair of +// parenthesis to hide the commas, because "boost::(Temp)" isn't +// a valid instantiation pattern. Thus, we steal a feature from C99. + +#define __glibcxx_function_requires(...) \ + __gnu_cxx::__function_requires< __gnu_cxx::__VA_ARGS__ >(); +#define __glibcxx_class_requires(_a,_C) \ + _GLIBCXX_CLASS_REQUIRES(_a, __gnu_cxx, _C); +#define __glibcxx_class_requires2(_a,_b,_C) \ + _GLIBCXX_CLASS_REQUIRES2(_a, _b, __gnu_cxx, _C); +#define __glibcxx_class_requires3(_a,_b,_c,_C) \ + _GLIBCXX_CLASS_REQUIRES3(_a, _b, _c, __gnu_cxx, _C); +#define __glibcxx_class_requires4(_a,_b,_c,_d,_C) \ + _GLIBCXX_CLASS_REQUIRES4(_a, _b, _c, _d, __gnu_cxx, _C); + +#endif // enable/disable + +#endif // _GLIBCXX_CONCEPT_CHECK diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/cpp_type_traits.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/cpp_type_traits.h new file mode 100644 index 00000000..afb0049b --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/cpp_type_traits.h @@ -0,0 +1,419 @@ +// The -*- C++ -*- type traits classes for internal use in libstdc++ + +// Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file cpp_type_traits.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// Written by Gabriel Dos Reis + +#ifndef _CPP_TYPE_TRAITS_H +#define _CPP_TYPE_TRAITS_H 1 + +#pragma GCC system_header + +#include + +// +// This file provides some compile-time information about various types. +// These representations were designed, on purpose, to be constant-expressions +// and not types as found in . In particular, they +// can be used in control structures and the optimizer hopefully will do +// the obvious thing. +// +// Why integral expressions, and not functions nor types? +// Firstly, these compile-time entities are used as template-arguments +// so function return values won't work: We need compile-time entities. +// We're left with types and constant integral expressions. +// Secondly, from the point of view of ease of use, type-based compile-time +// information is -not- *that* convenient. On has to write lots of +// overloaded functions and to hope that the compiler will select the right +// one. As a net effect, the overall structure isn't very clear at first +// glance. +// Thirdly, partial ordering and overload resolution (of function templates) +// is highly costly in terms of compiler-resource. It is a Good Thing to +// keep these resource consumption as least as possible. +// +// See valarray_array.h for a case use. +// +// -- Gaby (dosreis@cmla.ens-cachan.fr) 2000-03-06. +// +// Update 2005: types are also provided and has been +// removed. +// + +// Forward declaration hack, should really include this from somewhere. +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + template + class __normal_iterator; + +_GLIBCXX_END_NAMESPACE + +_GLIBCXX_BEGIN_NAMESPACE(std) + + struct __true_type { }; + struct __false_type { }; + + template + struct __truth_type + { typedef __false_type __type; }; + + template<> + struct __truth_type + { typedef __true_type __type; }; + + // N.B. The conversions to bool are needed due to the issue + // explained in c++/19404. + template + struct __traitor + { + enum { __value = bool(_Sp::__value) || bool(_Tp::__value) }; + typedef typename __truth_type<__value>::__type __type; + }; + + // Compare for equality of types. + template + struct __are_same + { + enum { __value = 0 }; + typedef __false_type __type; + }; + + template + struct __are_same<_Tp, _Tp> + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + // Holds if the template-argument is a void type. + template + struct __is_void + { + enum { __value = 0 }; + typedef __false_type __type; + }; + + template<> + struct __is_void + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + // + // Integer types + // + template + struct __is_integer + { + enum { __value = 0 }; + typedef __false_type __type; + }; + + // Thirteen specializations (yes there are eleven standard integer + // types; 'long long' and 'unsigned long long' are supported as + // extensions) + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; + +# ifdef _GLIBCXX_USE_WCHAR_T + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; +# endif + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; +#endif + + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_integer + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + // + // Floating point types + // + template + struct __is_floating + { + enum { __value = 0 }; + typedef __false_type __type; + }; + + // three specializations (float, double and 'long double') + template<> + struct __is_floating + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_floating + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_floating + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + // + // Pointer types + // + template + struct __is_pointer + { + enum { __value = 0 }; + typedef __false_type __type; + }; + + template + struct __is_pointer<_Tp*> + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + // + // Normal iterator type + // + template + struct __is_normal_iterator + { + enum { __value = 0 }; + typedef __false_type __type; + }; + + template + struct __is_normal_iterator< __gnu_cxx::__normal_iterator<_Iterator, + _Container> > + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + // + // An arithmetic type is an integer type or a floating point type + // + template + struct __is_arithmetic + : public __traitor<__is_integer<_Tp>, __is_floating<_Tp> > + { }; + + // + // A fundamental type is `void' or and arithmetic type + // + template + struct __is_fundamental + : public __traitor<__is_void<_Tp>, __is_arithmetic<_Tp> > + { }; + + // + // A scalar type is an arithmetic type or a pointer type + // + template + struct __is_scalar + : public __traitor<__is_arithmetic<_Tp>, __is_pointer<_Tp> > + { }; + + // + // For use in std::copy and std::find overloads for streambuf iterators. + // + template + struct __is_char + { + enum { __value = 0 }; + typedef __false_type __type; + }; + + template<> + struct __is_char + { + enum { __value = 1 }; + typedef __true_type __type; + }; + +#ifdef _GLIBCXX_USE_WCHAR_T + template<> + struct __is_char + { + enum { __value = 1 }; + typedef __true_type __type; + }; +#endif + + template + struct __is_byte + { + enum { __value = 0 }; + typedef __false_type __type; + }; + + template<> + struct __is_byte + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_byte + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + template<> + struct __is_byte + { + enum { __value = 1 }; + typedef __true_type __type; + }; + + // + // Move iterator type + // + template + struct __is_move_iterator + { + enum { __value = 0 }; + typedef __false_type __type; + }; + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + class move_iterator; + + template + struct __is_move_iterator< move_iterator<_Iterator> > + { + enum { __value = 1 }; + typedef __true_type __type; + }; +#endif + +_GLIBCXX_END_NAMESPACE + +#endif //_CPP_TYPE_TRAITS_H diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/deque.tcc b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/deque.tcc new file mode 100644 index 00000000..aac0d590 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/deque.tcc @@ -0,0 +1,863 @@ +// Deque implementation (out of line) -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file deque.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _DEQUE_TCC +#define _DEQUE_TCC 1 + +_GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D) + + template + deque<_Tp, _Alloc>& + deque<_Tp, _Alloc>:: + operator=(const deque& __x) + { + const size_type __len = size(); + if (&__x != this) + { + if (__len >= __x.size()) + _M_erase_at_end(std::copy(__x.begin(), __x.end(), + this->_M_impl._M_start)); + else + { + const_iterator __mid = __x.begin() + difference_type(__len); + std::copy(__x.begin(), __mid, this->_M_impl._M_start); + insert(this->_M_impl._M_finish, __mid, __x.end()); + } + } + return *this; + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + template + void + deque<_Tp, _Alloc>:: + emplace_front(_Args&&... __args) + { + if (this->_M_impl._M_start._M_cur != this->_M_impl._M_start._M_first) + { + this->_M_impl.construct(this->_M_impl._M_start._M_cur - 1, + std::forward<_Args>(__args)...); + --this->_M_impl._M_start._M_cur; + } + else + _M_push_front_aux(std::forward<_Args>(__args)...); + } + + template + template + void + deque<_Tp, _Alloc>:: + emplace_back(_Args&&... __args) + { + if (this->_M_impl._M_finish._M_cur + != this->_M_impl._M_finish._M_last - 1) + { + this->_M_impl.construct(this->_M_impl._M_finish._M_cur, + std::forward<_Args>(__args)...); + ++this->_M_impl._M_finish._M_cur; + } + else + _M_push_back_aux(std::forward<_Args>(__args)...); + } +#endif + + template + typename deque<_Tp, _Alloc>::iterator + deque<_Tp, _Alloc>:: + insert(iterator __position, const value_type& __x) + { + if (__position._M_cur == this->_M_impl._M_start._M_cur) + { + push_front(__x); + return this->_M_impl._M_start; + } + else if (__position._M_cur == this->_M_impl._M_finish._M_cur) + { + push_back(__x); + iterator __tmp = this->_M_impl._M_finish; + --__tmp; + return __tmp; + } + else + return _M_insert_aux(__position, __x); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + template + typename deque<_Tp, _Alloc>::iterator + deque<_Tp, _Alloc>:: + emplace(iterator __position, _Args&&... __args) + { + if (__position._M_cur == this->_M_impl._M_start._M_cur) + { + push_front(std::forward<_Args>(__args)...); + return this->_M_impl._M_start; + } + else if (__position._M_cur == this->_M_impl._M_finish._M_cur) + { + push_back(std::forward<_Args>(__args)...); + iterator __tmp = this->_M_impl._M_finish; + --__tmp; + return __tmp; + } + else + return _M_insert_aux(__position, std::forward<_Args>(__args)...); + } +#endif + + template + typename deque<_Tp, _Alloc>::iterator + deque<_Tp, _Alloc>:: + erase(iterator __position) + { + iterator __next = __position; + ++__next; + const difference_type __index = __position - begin(); + if (static_cast(__index) < (size() >> 1)) + { + if (__position != begin()) + _GLIBCXX_MOVE_BACKWARD3(begin(), __position, __next); + pop_front(); + } + else + { + if (__next != end()) + _GLIBCXX_MOVE3(__next, end(), __position); + pop_back(); + } + return begin() + __index; + } + + template + typename deque<_Tp, _Alloc>::iterator + deque<_Tp, _Alloc>:: + erase(iterator __first, iterator __last) + { + if (__first == begin() && __last == end()) + { + clear(); + return end(); + } + else + { + const difference_type __n = __last - __first; + const difference_type __elems_before = __first - begin(); + if (static_cast(__elems_before) <= (size() - __n) / 2) + { + if (__first != begin()) + _GLIBCXX_MOVE_BACKWARD3(begin(), __first, __last); + _M_erase_at_begin(begin() + __n); + } + else + { + if (__last != end()) + _GLIBCXX_MOVE3(__last, end(), __first); + _M_erase_at_end(end() - __n); + } + return begin() + __elems_before; + } + } + + template + template + void + deque<_Tp, _Alloc>:: + _M_assign_aux(_InputIterator __first, _InputIterator __last, + std::input_iterator_tag) + { + iterator __cur = begin(); + for (; __first != __last && __cur != end(); ++__cur, ++__first) + *__cur = *__first; + if (__first == __last) + _M_erase_at_end(__cur); + else + insert(end(), __first, __last); + } + + template + void + deque<_Tp, _Alloc>:: + _M_fill_insert(iterator __pos, size_type __n, const value_type& __x) + { + if (__pos._M_cur == this->_M_impl._M_start._M_cur) + { + iterator __new_start = _M_reserve_elements_at_front(__n); + __try + { + std::__uninitialized_fill_a(__new_start, this->_M_impl._M_start, + __x, _M_get_Tp_allocator()); + this->_M_impl._M_start = __new_start; + } + __catch(...) + { + _M_destroy_nodes(__new_start._M_node, + this->_M_impl._M_start._M_node); + __throw_exception_again; + } + } + else if (__pos._M_cur == this->_M_impl._M_finish._M_cur) + { + iterator __new_finish = _M_reserve_elements_at_back(__n); + __try + { + std::__uninitialized_fill_a(this->_M_impl._M_finish, + __new_finish, __x, + _M_get_Tp_allocator()); + this->_M_impl._M_finish = __new_finish; + } + __catch(...) + { + _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1, + __new_finish._M_node + 1); + __throw_exception_again; + } + } + else + _M_insert_aux(__pos, __n, __x); + } + + template + void + deque<_Tp, _Alloc>:: + _M_fill_initialize(const value_type& __value) + { + _Map_pointer __cur; + __try + { + for (__cur = this->_M_impl._M_start._M_node; + __cur < this->_M_impl._M_finish._M_node; + ++__cur) + std::__uninitialized_fill_a(*__cur, *__cur + _S_buffer_size(), + __value, _M_get_Tp_allocator()); + std::__uninitialized_fill_a(this->_M_impl._M_finish._M_first, + this->_M_impl._M_finish._M_cur, + __value, _M_get_Tp_allocator()); + } + __catch(...) + { + std::_Destroy(this->_M_impl._M_start, iterator(*__cur, __cur), + _M_get_Tp_allocator()); + __throw_exception_again; + } + } + + template + template + void + deque<_Tp, _Alloc>:: + _M_range_initialize(_InputIterator __first, _InputIterator __last, + std::input_iterator_tag) + { + this->_M_initialize_map(0); + __try + { + for (; __first != __last; ++__first) + push_back(*__first); + } + __catch(...) + { + clear(); + __throw_exception_again; + } + } + + template + template + void + deque<_Tp, _Alloc>:: + _M_range_initialize(_ForwardIterator __first, _ForwardIterator __last, + std::forward_iterator_tag) + { + const size_type __n = std::distance(__first, __last); + this->_M_initialize_map(__n); + + _Map_pointer __cur_node; + __try + { + for (__cur_node = this->_M_impl._M_start._M_node; + __cur_node < this->_M_impl._M_finish._M_node; + ++__cur_node) + { + _ForwardIterator __mid = __first; + std::advance(__mid, _S_buffer_size()); + std::__uninitialized_copy_a(__first, __mid, *__cur_node, + _M_get_Tp_allocator()); + __first = __mid; + } + std::__uninitialized_copy_a(__first, __last, + this->_M_impl._M_finish._M_first, + _M_get_Tp_allocator()); + } + __catch(...) + { + std::_Destroy(this->_M_impl._M_start, + iterator(*__cur_node, __cur_node), + _M_get_Tp_allocator()); + __throw_exception_again; + } + } + + // Called only if _M_impl._M_finish._M_cur == _M_impl._M_finish._M_last - 1. + template +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + void + deque<_Tp, _Alloc>:: + _M_push_back_aux(_Args&&... __args) +#else + void + deque<_Tp, _Alloc>:: + _M_push_back_aux(const value_type& __t) +#endif + { + _M_reserve_map_at_back(); + *(this->_M_impl._M_finish._M_node + 1) = this->_M_allocate_node(); + __try + { +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + this->_M_impl.construct(this->_M_impl._M_finish._M_cur, + std::forward<_Args>(__args)...); +#else + this->_M_impl.construct(this->_M_impl._M_finish._M_cur, __t); +#endif + this->_M_impl._M_finish._M_set_node(this->_M_impl._M_finish._M_node + + 1); + this->_M_impl._M_finish._M_cur = this->_M_impl._M_finish._M_first; + } + __catch(...) + { + _M_deallocate_node(*(this->_M_impl._M_finish._M_node + 1)); + __throw_exception_again; + } + } + + // Called only if _M_impl._M_start._M_cur == _M_impl._M_start._M_first. + template +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + void + deque<_Tp, _Alloc>:: + _M_push_front_aux(_Args&&... __args) +#else + void + deque<_Tp, _Alloc>:: + _M_push_front_aux(const value_type& __t) +#endif + { + _M_reserve_map_at_front(); + *(this->_M_impl._M_start._M_node - 1) = this->_M_allocate_node(); + __try + { + this->_M_impl._M_start._M_set_node(this->_M_impl._M_start._M_node + - 1); + this->_M_impl._M_start._M_cur = this->_M_impl._M_start._M_last - 1; +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + this->_M_impl.construct(this->_M_impl._M_start._M_cur, + std::forward<_Args>(__args)...); +#else + this->_M_impl.construct(this->_M_impl._M_start._M_cur, __t); +#endif + } + __catch(...) + { + ++this->_M_impl._M_start; + _M_deallocate_node(*(this->_M_impl._M_start._M_node - 1)); + __throw_exception_again; + } + } + + // Called only if _M_impl._M_finish._M_cur == _M_impl._M_finish._M_first. + template + void deque<_Tp, _Alloc>:: + _M_pop_back_aux() + { + _M_deallocate_node(this->_M_impl._M_finish._M_first); + this->_M_impl._M_finish._M_set_node(this->_M_impl._M_finish._M_node - 1); + this->_M_impl._M_finish._M_cur = this->_M_impl._M_finish._M_last - 1; + this->_M_impl.destroy(this->_M_impl._M_finish._M_cur); + } + + // Called only if _M_impl._M_start._M_cur == _M_impl._M_start._M_last - 1. + // Note that if the deque has at least one element (a precondition for this + // member function), and if + // _M_impl._M_start._M_cur == _M_impl._M_start._M_last, + // then the deque must have at least two nodes. + template + void deque<_Tp, _Alloc>:: + _M_pop_front_aux() + { + this->_M_impl.destroy(this->_M_impl._M_start._M_cur); + _M_deallocate_node(this->_M_impl._M_start._M_first); + this->_M_impl._M_start._M_set_node(this->_M_impl._M_start._M_node + 1); + this->_M_impl._M_start._M_cur = this->_M_impl._M_start._M_first; + } + + template + template + void + deque<_Tp, _Alloc>:: + _M_range_insert_aux(iterator __pos, + _InputIterator __first, _InputIterator __last, + std::input_iterator_tag) + { std::copy(__first, __last, std::inserter(*this, __pos)); } + + template + template + void + deque<_Tp, _Alloc>:: + _M_range_insert_aux(iterator __pos, + _ForwardIterator __first, _ForwardIterator __last, + std::forward_iterator_tag) + { + const size_type __n = std::distance(__first, __last); + if (__pos._M_cur == this->_M_impl._M_start._M_cur) + { + iterator __new_start = _M_reserve_elements_at_front(__n); + __try + { + std::__uninitialized_copy_a(__first, __last, __new_start, + _M_get_Tp_allocator()); + this->_M_impl._M_start = __new_start; + } + __catch(...) + { + _M_destroy_nodes(__new_start._M_node, + this->_M_impl._M_start._M_node); + __throw_exception_again; + } + } + else if (__pos._M_cur == this->_M_impl._M_finish._M_cur) + { + iterator __new_finish = _M_reserve_elements_at_back(__n); + __try + { + std::__uninitialized_copy_a(__first, __last, + this->_M_impl._M_finish, + _M_get_Tp_allocator()); + this->_M_impl._M_finish = __new_finish; + } + __catch(...) + { + _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1, + __new_finish._M_node + 1); + __throw_exception_again; + } + } + else + _M_insert_aux(__pos, __first, __last, __n); + } + + template +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + typename deque<_Tp, _Alloc>::iterator + deque<_Tp, _Alloc>:: + _M_insert_aux(iterator __pos, _Args&&... __args) + { + value_type __x_copy(std::forward<_Args>(__args)...); // XXX copy +#else + typename deque<_Tp, _Alloc>::iterator + deque<_Tp, _Alloc>:: + _M_insert_aux(iterator __pos, const value_type& __x) + { + value_type __x_copy = __x; // XXX copy +#endif + difference_type __index = __pos - this->_M_impl._M_start; + if (static_cast(__index) < size() / 2) + { + push_front(_GLIBCXX_MOVE(front())); + iterator __front1 = this->_M_impl._M_start; + ++__front1; + iterator __front2 = __front1; + ++__front2; + __pos = this->_M_impl._M_start + __index; + iterator __pos1 = __pos; + ++__pos1; + _GLIBCXX_MOVE3(__front2, __pos1, __front1); + } + else + { + push_back(_GLIBCXX_MOVE(back())); + iterator __back1 = this->_M_impl._M_finish; + --__back1; + iterator __back2 = __back1; + --__back2; + __pos = this->_M_impl._M_start + __index; + _GLIBCXX_MOVE_BACKWARD3(__pos, __back2, __back1); + } + *__pos = _GLIBCXX_MOVE(__x_copy); + return __pos; + } + + template + void + deque<_Tp, _Alloc>:: + _M_insert_aux(iterator __pos, size_type __n, const value_type& __x) + { + const difference_type __elems_before = __pos - this->_M_impl._M_start; + const size_type __length = this->size(); + value_type __x_copy = __x; + if (__elems_before < difference_type(__length / 2)) + { + iterator __new_start = _M_reserve_elements_at_front(__n); + iterator __old_start = this->_M_impl._M_start; + __pos = this->_M_impl._M_start + __elems_before; + __try + { + if (__elems_before >= difference_type(__n)) + { + iterator __start_n = (this->_M_impl._M_start + + difference_type(__n)); + std::__uninitialized_move_a(this->_M_impl._M_start, + __start_n, __new_start, + _M_get_Tp_allocator()); + this->_M_impl._M_start = __new_start; + _GLIBCXX_MOVE3(__start_n, __pos, __old_start); + std::fill(__pos - difference_type(__n), __pos, __x_copy); + } + else + { + std::__uninitialized_move_fill(this->_M_impl._M_start, + __pos, __new_start, + this->_M_impl._M_start, + __x_copy, + _M_get_Tp_allocator()); + this->_M_impl._M_start = __new_start; + std::fill(__old_start, __pos, __x_copy); + } + } + __catch(...) + { + _M_destroy_nodes(__new_start._M_node, + this->_M_impl._M_start._M_node); + __throw_exception_again; + } + } + else + { + iterator __new_finish = _M_reserve_elements_at_back(__n); + iterator __old_finish = this->_M_impl._M_finish; + const difference_type __elems_after = + difference_type(__length) - __elems_before; + __pos = this->_M_impl._M_finish - __elems_after; + __try + { + if (__elems_after > difference_type(__n)) + { + iterator __finish_n = (this->_M_impl._M_finish + - difference_type(__n)); + std::__uninitialized_move_a(__finish_n, + this->_M_impl._M_finish, + this->_M_impl._M_finish, + _M_get_Tp_allocator()); + this->_M_impl._M_finish = __new_finish; + _GLIBCXX_MOVE_BACKWARD3(__pos, __finish_n, __old_finish); + std::fill(__pos, __pos + difference_type(__n), __x_copy); + } + else + { + std::__uninitialized_fill_move(this->_M_impl._M_finish, + __pos + difference_type(__n), + __x_copy, __pos, + this->_M_impl._M_finish, + _M_get_Tp_allocator()); + this->_M_impl._M_finish = __new_finish; + std::fill(__pos, __old_finish, __x_copy); + } + } + __catch(...) + { + _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1, + __new_finish._M_node + 1); + __throw_exception_again; + } + } + } + + template + template + void + deque<_Tp, _Alloc>:: + _M_insert_aux(iterator __pos, + _ForwardIterator __first, _ForwardIterator __last, + size_type __n) + { + const difference_type __elemsbefore = __pos - this->_M_impl._M_start; + const size_type __length = size(); + if (static_cast(__elemsbefore) < __length / 2) + { + iterator __new_start = _M_reserve_elements_at_front(__n); + iterator __old_start = this->_M_impl._M_start; + __pos = this->_M_impl._M_start + __elemsbefore; + __try + { + if (__elemsbefore >= difference_type(__n)) + { + iterator __start_n = (this->_M_impl._M_start + + difference_type(__n)); + std::__uninitialized_move_a(this->_M_impl._M_start, + __start_n, __new_start, + _M_get_Tp_allocator()); + this->_M_impl._M_start = __new_start; + _GLIBCXX_MOVE3(__start_n, __pos, __old_start); + std::copy(__first, __last, __pos - difference_type(__n)); + } + else + { + _ForwardIterator __mid = __first; + std::advance(__mid, difference_type(__n) - __elemsbefore); + std::__uninitialized_move_copy(this->_M_impl._M_start, + __pos, __first, __mid, + __new_start, + _M_get_Tp_allocator()); + this->_M_impl._M_start = __new_start; + std::copy(__mid, __last, __old_start); + } + } + __catch(...) + { + _M_destroy_nodes(__new_start._M_node, + this->_M_impl._M_start._M_node); + __throw_exception_again; + } + } + else + { + iterator __new_finish = _M_reserve_elements_at_back(__n); + iterator __old_finish = this->_M_impl._M_finish; + const difference_type __elemsafter = + difference_type(__length) - __elemsbefore; + __pos = this->_M_impl._M_finish - __elemsafter; + __try + { + if (__elemsafter > difference_type(__n)) + { + iterator __finish_n = (this->_M_impl._M_finish + - difference_type(__n)); + std::__uninitialized_move_a(__finish_n, + this->_M_impl._M_finish, + this->_M_impl._M_finish, + _M_get_Tp_allocator()); + this->_M_impl._M_finish = __new_finish; + _GLIBCXX_MOVE_BACKWARD3(__pos, __finish_n, __old_finish); + std::copy(__first, __last, __pos); + } + else + { + _ForwardIterator __mid = __first; + std::advance(__mid, __elemsafter); + std::__uninitialized_copy_move(__mid, __last, __pos, + this->_M_impl._M_finish, + this->_M_impl._M_finish, + _M_get_Tp_allocator()); + this->_M_impl._M_finish = __new_finish; + std::copy(__first, __mid, __pos); + } + } + __catch(...) + { + _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1, + __new_finish._M_node + 1); + __throw_exception_again; + } + } + } + + template + void + deque<_Tp, _Alloc>:: + _M_destroy_data_aux(iterator __first, iterator __last) + { + for (_Map_pointer __node = __first._M_node + 1; + __node < __last._M_node; ++__node) + std::_Destroy(*__node, *__node + _S_buffer_size(), + _M_get_Tp_allocator()); + + if (__first._M_node != __last._M_node) + { + std::_Destroy(__first._M_cur, __first._M_last, + _M_get_Tp_allocator()); + std::_Destroy(__last._M_first, __last._M_cur, + _M_get_Tp_allocator()); + } + else + std::_Destroy(__first._M_cur, __last._M_cur, + _M_get_Tp_allocator()); + } + + template + void + deque<_Tp, _Alloc>:: + _M_new_elements_at_front(size_type __new_elems) + { + if (this->max_size() - this->size() < __new_elems) + __throw_length_error(__N("deque::_M_new_elements_at_front")); + + const size_type __new_nodes = ((__new_elems + _S_buffer_size() - 1) + / _S_buffer_size()); + _M_reserve_map_at_front(__new_nodes); + size_type __i; + __try + { + for (__i = 1; __i <= __new_nodes; ++__i) + *(this->_M_impl._M_start._M_node - __i) = this->_M_allocate_node(); + } + __catch(...) + { + for (size_type __j = 1; __j < __i; ++__j) + _M_deallocate_node(*(this->_M_impl._M_start._M_node - __j)); + __throw_exception_again; + } + } + + template + void + deque<_Tp, _Alloc>:: + _M_new_elements_at_back(size_type __new_elems) + { + if (this->max_size() - this->size() < __new_elems) + __throw_length_error(__N("deque::_M_new_elements_at_back")); + + const size_type __new_nodes = ((__new_elems + _S_buffer_size() - 1) + / _S_buffer_size()); + _M_reserve_map_at_back(__new_nodes); + size_type __i; + __try + { + for (__i = 1; __i <= __new_nodes; ++__i) + *(this->_M_impl._M_finish._M_node + __i) = this->_M_allocate_node(); + } + __catch(...) + { + for (size_type __j = 1; __j < __i; ++__j) + _M_deallocate_node(*(this->_M_impl._M_finish._M_node + __j)); + __throw_exception_again; + } + } + + template + void + deque<_Tp, _Alloc>:: + _M_reallocate_map(size_type __nodes_to_add, bool __add_at_front) + { + const size_type __old_num_nodes + = this->_M_impl._M_finish._M_node - this->_M_impl._M_start._M_node + 1; + const size_type __new_num_nodes = __old_num_nodes + __nodes_to_add; + + _Map_pointer __new_nstart; + if (this->_M_impl._M_map_size > 2 * __new_num_nodes) + { + __new_nstart = this->_M_impl._M_map + (this->_M_impl._M_map_size + - __new_num_nodes) / 2 + + (__add_at_front ? __nodes_to_add : 0); + if (__new_nstart < this->_M_impl._M_start._M_node) + std::copy(this->_M_impl._M_start._M_node, + this->_M_impl._M_finish._M_node + 1, + __new_nstart); + else + std::copy_backward(this->_M_impl._M_start._M_node, + this->_M_impl._M_finish._M_node + 1, + __new_nstart + __old_num_nodes); + } + else + { + size_type __new_map_size = this->_M_impl._M_map_size + + std::max(this->_M_impl._M_map_size, + __nodes_to_add) + 2; + + _Map_pointer __new_map = this->_M_allocate_map(__new_map_size); + __new_nstart = __new_map + (__new_map_size - __new_num_nodes) / 2 + + (__add_at_front ? __nodes_to_add : 0); + std::copy(this->_M_impl._M_start._M_node, + this->_M_impl._M_finish._M_node + 1, + __new_nstart); + _M_deallocate_map(this->_M_impl._M_map, this->_M_impl._M_map_size); + + this->_M_impl._M_map = __new_map; + this->_M_impl._M_map_size = __new_map_size; + } + + this->_M_impl._M_start._M_set_node(__new_nstart); + this->_M_impl._M_finish._M_set_node(__new_nstart + __old_num_nodes - 1); + } + + // Overload for deque::iterators, exploiting the "segmented-iterator + // optimization". NB: leave const_iterators alone! + template + void + fill(const _Deque_iterator<_Tp, _Tp&, _Tp*>& __first, + const _Deque_iterator<_Tp, _Tp&, _Tp*>& __last, const _Tp& __value) + { + typedef typename _Deque_iterator<_Tp, _Tp&, _Tp*>::_Self _Self; + + for (typename _Self::_Map_pointer __node = __first._M_node + 1; + __node < __last._M_node; ++__node) + std::fill(*__node, *__node + _Self::_S_buffer_size(), __value); + + if (__first._M_node != __last._M_node) + { + std::fill(__first._M_cur, __first._M_last, __value); + std::fill(__last._M_first, __last._M_cur, __value); + } + else + std::fill(__first._M_cur, __last._M_cur, __value); + } + +_GLIBCXX_END_NESTED_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/forward_list.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/forward_list.h new file mode 100644 index 00000000..d49eb4a0 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/forward_list.h @@ -0,0 +1,1306 @@ +// -*- C++ -*- + +// Copyright (C) 2008, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file forward_list.h + * This is a Standard C++ Library header. + */ + +#ifndef _FORWARD_LIST_H +#define _FORWARD_LIST_H 1 + +#pragma GCC system_header + +#ifndef __GXX_EXPERIMENTAL_CXX0X__ +# include +#else + +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + using __gnu_cxx::__static_pointer_cast; + using __gnu_cxx::__const_pointer_cast; + + /** + * @brief A helper basic node class for %forward_list. + * This is just a linked list with nothing inside it. + * There are purely list shuffling utility methods here. + */ + template + struct _Fwd_list_node_base + { + // The type allocated by _Alloc cannot be this type, so we rebind + typedef typename _Alloc::template rebind<_Fwd_list_node_base<_Alloc> > + ::other::pointer _Pointer; + typedef typename _Alloc::template rebind<_Fwd_list_node_base<_Alloc> > + ::other::const_pointer _Const_pointer; + + _Pointer _M_next; + + _Fwd_list_node_base() : _M_next(0) { } + + static void + swap(_Fwd_list_node_base& __x, _Fwd_list_node_base& __y) + { std::swap(__x._M_next, __y._M_next); } + + void + _M_transfer_after(_Pointer __bbegin); + + void + _M_transfer_after(_Pointer __bbegin, _Pointer __bend); + + void + _M_reverse_after(); + }; + + /** + * @brief A helper node class for %forward_list. + * This is just a linked list with a data value in each node. + * There is a sorting utility method. + */ + template + struct _Fwd_list_node : public _Fwd_list_node_base<_Alloc> + { + typedef typename _Alloc::template rebind<_Fwd_list_node<_Tp, _Alloc> > + ::other::pointer _Pointer; + + template + _Fwd_list_node(_Args&&... __args) + : _Fwd_list_node_base<_Alloc>(), + _M_value(std::forward<_Args>(__args)...) { } + + template + void + _M_sort_after(_Comp __comp); + + _Tp _M_value; + }; + + /** + * @brief A forward_list::iterator. + * + * All the functions are op overloads. + */ + template + struct _Fwd_list_iterator + { + typedef _Fwd_list_iterator<_Tp, _Alloc> _Self; + typedef _Fwd_list_node<_Tp, _Alloc> _Node; + typedef _Fwd_list_node_base<_Alloc> _Node_base; + + typedef _Tp value_type; + typedef typename _Alloc::pointer pointer; + typedef typename _Alloc::reference reference; + typedef typename _Alloc::difference_type difference_type; + typedef std::forward_iterator_tag iterator_category; + + _Fwd_list_iterator() : _M_node() { } + + explicit + _Fwd_list_iterator(typename _Node_base::_Pointer __n) + : _M_node(__n) { } + + reference + operator*() const + { return __static_pointer_cast<_Node*>(_M_node)->_M_value; } + + pointer + operator->() const + { return &__static_pointer_cast<_Node*>(_M_node)->_M_value; } + + _Self& + operator++() + { + _M_node = _M_node->_M_next; + return *this; + } + + _Self + operator++(int) + { + _Self __tmp(*this); + _M_node = _M_node->_M_next; + return __tmp; + } + + bool + operator==(const _Self& __x) const + { return _M_node == __x._M_node; } + + bool + operator!=(const _Self& __x) const + { return _M_node != __x._M_node; } + + _Self + _M_next() const + { + if (_M_node) + return _Fwd_list_iterator(_M_node->_M_next); + else + return _Fwd_list_iterator(0); + } + + typename _Node_base::_Pointer _M_node; + }; + + /** + * @brief A forward_list::const_iterator. + * + * All the functions are op overloads. + */ + template + struct _Fwd_list_const_iterator + { + typedef _Fwd_list_const_iterator<_Tp, _Alloc> _Self; + typedef const _Fwd_list_node<_Tp, _Alloc> _Node; + typedef const _Fwd_list_node_base<_Alloc> _Node_base; + typedef _Fwd_list_iterator<_Tp, _Alloc> iterator; + + typedef _Tp value_type; + typedef typename _Alloc::const_pointer pointer; + typedef typename _Alloc::const_reference reference; + typedef typename _Alloc::difference_type difference_type; + typedef std::forward_iterator_tag iterator_category; + + _Fwd_list_const_iterator() : _M_node() { } + + explicit + _Fwd_list_const_iterator(typename _Node_base::_Const_pointer __n) + : _M_node(__n) { } + + _Fwd_list_const_iterator(const iterator& __iter) + : _M_node(__iter._M_node) { } + + reference + operator*() const + { return __static_pointer_cast<_Node*>(_M_node)->_M_value; } + + pointer + operator->() const + { return &__static_pointer_cast<_Node*>(_M_node)->_M_value; } + + _Self& + operator++() + { + _M_node = _M_node->_M_next; + return *this; + } + + _Self + operator++(int) + { + _Self __tmp(*this); + _M_node = _M_node->_M_next; + return __tmp; + } + + bool + operator==(const _Self& __x) const + { return _M_node == __x._M_node; } + + bool + operator!=(const _Self& __x) const + { return _M_node != __x._M_node; } + + _Self + _M_next() const + { + if (this->_M_node) + return _Fwd_list_const_iterator(_M_node->_M_next); + else + return _Fwd_list_const_iterator(0); + } + + typename _Node_base::_Const_pointer _M_node; + }; + + /** + * @brief Forward list iterator equality comparison. + */ + template + inline bool + operator==(const _Fwd_list_iterator<_Tp, _Alloc>& __x, + const _Fwd_list_const_iterator<_Tp, _Alloc>& __y) + { return __x._M_node == __y._M_node; } + + /** + * @brief Forward list iterator inequality comparison. + */ + template + inline bool + operator!=(const _Fwd_list_iterator<_Tp, _Alloc>& __x, + const _Fwd_list_const_iterator<_Tp, _Alloc>& __y) + { return __x._M_node != __y._M_node; } + + /** + * @brief Base class for %forward_list. + */ + template + struct _Fwd_list_base + { + protected: + typedef typename _Alloc::template rebind<_Tp>::other _Tp_alloc_type; + + typedef typename _Alloc::template + rebind<_Fwd_list_node<_Tp, _Tp_alloc_type>>::other _Node_alloc_type; + + struct _Fwd_list_impl + : public _Node_alloc_type + { + _Fwd_list_node_base<_Tp_alloc_type> _M_head; + + _Fwd_list_impl() + : _Node_alloc_type(), _M_head() + { } + + _Fwd_list_impl(const _Node_alloc_type& __a) + : _Node_alloc_type(__a), _M_head() + { } + }; + + _Fwd_list_impl _M_impl; + + public: + typedef _Fwd_list_iterator<_Tp, _Tp_alloc_type> iterator; + typedef _Fwd_list_const_iterator<_Tp, _Tp_alloc_type> const_iterator; + + typedef _Fwd_list_node<_Tp, _Tp_alloc_type> _Node; + typedef _Fwd_list_node_base<_Tp_alloc_type> _Node_base; + + _Node_alloc_type& + _M_get_Node_allocator() + { return *static_cast<_Node_alloc_type*>(&this->_M_impl); } + + const _Node_alloc_type& + _M_get_Node_allocator() const + { return *static_cast(&this->_M_impl); } + + _Fwd_list_base() + : _M_impl() + { this->_M_impl._M_head._M_next = 0; } + + _Fwd_list_base(const _Alloc& __a) + : _M_impl(__a) + { this->_M_impl._M_head._M_next = 0; } + + _Fwd_list_base(const _Fwd_list_base& __lst, const _Alloc& __a); + + _Fwd_list_base(_Fwd_list_base&& __lst, const _Alloc& __a) + : _M_impl(__a) + { _Node_base::swap(this->_M_impl._M_head, + __lst._M_impl._M_head); } + + _Fwd_list_base(_Fwd_list_base&& __lst) + : _M_impl(__lst._M_get_Node_allocator()) + { _Node_base::swap(this->_M_impl._M_head, + __lst._M_impl._M_head); } + + ~_Fwd_list_base() + { _M_erase_after(&_M_impl._M_head, 0); } + + protected: + + typename _Node::_Pointer + _M_get_node() + { return _M_get_Node_allocator().allocate(1); } + + template + typename _Node::_Pointer + _M_create_node(_Args&&... __args) + { + typename _Node::_Pointer __node = this->_M_get_node(); + __try + { + _M_get_Node_allocator().construct(__node, + std::forward<_Args>(__args)...); + __node->_M_next = 0; + } + __catch(...) + { + this->_M_put_node(__node); + __throw_exception_again; + } + return __node; + } + + template + typename _Node_base::_Pointer + _M_insert_after(const_iterator __pos, _Args&&... __args); + + void + _M_put_node(typename _Node::_Pointer __p) + { _M_get_Node_allocator().deallocate(__p, 1); } + + typename _Node_base::_Pointer + _M_erase_after(typename _Node_base::_Pointer __pos); + + typename _Node_base::_Pointer + _M_erase_after(typename _Node_base::_Pointer __pos, + typename _Node_base::_Pointer __last); + }; + + /** + * @brief A standard container with linear time access to elements, + * and fixed time insertion/deletion at any point in the sequence. + * + * @ingroup sequences + * + * Meets the requirements of a container, a + * sequence, including the + * optional sequence requirements with the + * %exception of @c at and @c operator[]. + * + * This is a @e singly @e linked %list. Traversal up the + * %list requires linear time, but adding and removing elements (or + * @e nodes) is done in constant time, regardless of where the + * change takes place. Unlike std::vector and std::deque, + * random-access iterators are not provided, so subscripting ( @c + * [] ) access is not allowed. For algorithms which only need + * sequential access, this lack makes no difference. + * + * Also unlike the other standard containers, std::forward_list provides + * specialized algorithms %unique to linked lists, such as + * splicing, sorting, and in-place reversal. + * + * A couple points on memory allocation for forward_list: + * + * First, we never actually allocate a Tp, we allocate + * Fwd_list_node's and trust [20.1.5]/4 to DTRT. This is to ensure + * that after elements from %forward_list are spliced into + * %forward_list, destroying the memory of the second %list is a + * valid operation, i.e., Alloc1 giveth and Alloc2 taketh away. + */ + template > + class forward_list : private _Fwd_list_base<_Tp, _Alloc> + { + private: + typedef _Fwd_list_base<_Tp, _Alloc> _Base; + typedef typename _Base::_Node _Node; + typedef typename _Base::_Node_base _Node_base; + typedef typename _Base::_Tp_alloc_type _Tp_alloc_type; + + public: + // types: + typedef _Tp value_type; + typedef typename _Tp_alloc_type::pointer pointer; + typedef typename _Tp_alloc_type::const_pointer const_pointer; + typedef typename _Tp_alloc_type::reference reference; + typedef typename _Tp_alloc_type::const_reference const_reference; + + typedef typename _Base::iterator iterator; + typedef typename _Base::const_iterator const_iterator; + typedef std::size_t size_type; + typedef std::ptrdiff_t difference_type; + typedef _Alloc allocator_type; + + // 23.2.3.1 construct/copy/destroy: + + /** + * @brief Creates a %forward_list with no elements. + * @param al An allocator object. + */ + explicit + forward_list(const _Alloc& __al = _Alloc()) + : _Base(__al) + { } + + /** + * @brief Copy constructor with allocator argument. + * @param list Input list to copy. + * @param al An allocator object. + */ + forward_list(const forward_list& __list, const _Alloc& __al) + : _Base(__list, __al) + { } + + /** + * @brief Move constructor with allocator argument. + * @param list Input list to move. + * @param al An allocator object. + */ + forward_list(forward_list&& __list, const _Alloc& __al) + : _Base(std::forward<_Base>(__list), __al) + { } + + /** + * @brief Creates a %forward_list with copies of the default element + * type. + * @param n The number of elements to initially create. + * + * This constructor fills the %forward_list with @a n copies of + * the default value. + */ + explicit + forward_list(size_type __n) + : _Base() + { _M_fill_initialize(__n, value_type()); } + + /** + * @brief Creates a %forward_list with copies of an exemplar element. + * @param n The number of elements to initially create. + * @param value An element to copy. + * @param al An allocator object. + * + * This constructor fills the %forward_list with @a n copies of @a + * value. + */ + forward_list(size_type __n, const _Tp& __value, + const _Alloc& __al = _Alloc()) + : _Base(__al) + { _M_fill_initialize(__n, __value); } + + /** + * @brief Builds a %forward_list from a range. + * @param first An input iterator. + * @param last An input iterator. + * @param al An allocator object. + * + * Create a %forward_list consisting of copies of the elements from + * [@a first,@a last). This is linear in N (where N is + * distance(@a first,@a last)). + */ + template + forward_list(_InputIterator __first, _InputIterator __last, + const _Alloc& __al = _Alloc()) + : _Base(__al) + { + // Check whether it's an integral type. If so, it's not an iterator. + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + _M_initialize_dispatch(__first, __last, _Integral()); + } + + /** + * @brief The %forward_list copy constructor. + * @param list A %forward_list of identical element and allocator + * types. + * + * The newly-created %forward_list uses a copy of the allocation + * object used by @a list. + */ + forward_list(const forward_list& __list) + : _Base(__list.get_allocator()) + { _M_initialize_dispatch(__list.begin(), __list.end(), __false_type()); } + + /** + * @brief The %forward_list move constructor. + * @param list A %forward_list of identical element and allocator + * types. + * + * The newly-created %forward_list contains the exact contents of @a + * forward_list. The contents of @a list are a valid, but unspecified + * %forward_list. + */ + forward_list(forward_list&& __list) + : _Base(std::forward<_Base>(__list)) { } + + /** + * @brief Builds a %forward_list from an initializer_list + * @param il An initializer_list of value_type. + * @param al An allocator object. + * + * Create a %forward_list consisting of copies of the elements + * in the initializer_list @a il. This is linear in il.size(). + */ + forward_list(std::initializer_list<_Tp> __il, + const _Alloc& __al = _Alloc()) + : _Base(__al) + { _M_initialize_dispatch(__il.begin(), __il.end(), __false_type()); } + + /** + * @brief The forward_list dtor. + */ + ~forward_list() + { _M_erase_after(&this->_M_impl._M_head, 0); } + + /** + * @brief The %forward_list assignment operator. + * @param list A %forward_list of identical element and allocator + * types. + * + * All the elements of @a list are copied, but unlike the copy + * constructor, the allocator object is not copied. + */ + forward_list& + operator=(const forward_list& __list); + + /** + * @brief The %forward_list move assignment operator. + * @param list A %forward_list of identical element and allocator + * types. + * + * The contents of @a list are moved into this %forward_list + * (without copying). @a list is a valid, but unspecified + * %forward_list + */ + forward_list& + operator=(forward_list&& __list) + { + if (&__list != this) + { + this->clear(); + this->swap(__list); + } + return *this; + } + + /** + * @brief The %forward_list initializer list assignment operator. + * @param il An initializer_list of value_type. + * + * Replace the contents of the %forward_list with copies of the + * elements in the initializer_list @a il. This is linear in + * il.size(). + */ + forward_list& + operator=(std::initializer_list<_Tp> __il) + { + assign(__il); + return *this; + } + + /** + * @brief Assigns a range to a %forward_list. + * @param first An input iterator. + * @param last An input iterator. + * + * This function fills a %forward_list with copies of the elements + * in the range [@a first,@a last). + * + * Note that the assignment completely changes the %forward_list and + * that the resulting %forward_list's size is the same as the number + * of elements assigned. Old data may be lost. + */ + template + void + assign(_InputIterator __first, _InputIterator __last) + { + clear(); + insert_after(cbefore_begin(), __first, __last); + } + + /** + * @brief Assigns a given value to a %forward_list. + * @param n Number of elements to be assigned. + * @param val Value to be assigned. + * + * This function fills a %forward_list with @a n copies of the given + * value. Note that the assignment completely changes the + * %forward_list and that the resulting %forward_list's size is the + * same as the number of elements assigned. Old data may be lost. + */ + void + assign(size_type __n, const _Tp& __val) + { + clear(); + insert_after(cbefore_begin(), __n, __val); + } + + /** + * @brief Assigns an initializer_list to a %forward_list. + * @param il An initializer_list of value_type. + * + * Replace the contents of the %forward_list with copies of the + * elements in the initializer_list @a il. This is linear in + * il.size(). + */ + void + assign(std::initializer_list<_Tp> __il) + { + clear(); + insert_after(cbefore_begin(), __il); + } + + /// Get a copy of the memory allocation object. + allocator_type + get_allocator() const + { return this->_M_get_Node_allocator(); } + + // 23.2.3.2 iterators: + + /** + * Returns a read/write iterator that points before the first element + * in the %forward_list. Iteration is done in ordinary element order. + */ + iterator + before_begin() + { return iterator(&this->_M_impl._M_head); } + + /** + * Returns a read-only (constant) iterator that points before the + * first element in the %forward_list. Iteration is done in ordinary + * element order. + */ + const_iterator + before_begin() const + { return const_iterator(&this->_M_impl._M_head); } + + /** + * Returns a read/write iterator that points to the first element + * in the %forward_list. Iteration is done in ordinary element order. + */ + iterator + begin() + { return iterator(this->_M_impl._M_head._M_next); } + + /** + * Returns a read-only (constant) iterator that points to the first + * element in the %forward_list. Iteration is done in ordinary + * element order. + */ + const_iterator + begin() const + { return const_iterator(this->_M_impl._M_head._M_next); } + + /** + * Returns a read/write iterator that points one past the last + * element in the %forward_list. Iteration is done in ordinary + * element order. + */ + iterator + end() + { return iterator(0); } + + /** + * Returns a read-only iterator that points one past the last + * element in the %forward_list. Iteration is done in ordinary + * element order. + */ + const_iterator + end() const + { return const_iterator(0); } + + /** + * Returns a read-only (constant) iterator that points to the + * first element in the %forward_list. Iteration is done in ordinary + * element order. + */ + const_iterator + cbegin() const + { return const_iterator(this->_M_impl._M_head._M_next); } + + /** + * Returns a read-only (constant) iterator that points before the + * first element in the %forward_list. Iteration is done in ordinary + * element order. + */ + const_iterator + cbefore_begin() const + { return const_iterator(&this->_M_impl._M_head); } + + /** + * Returns a read-only (constant) iterator that points one past + * the last element in the %forward_list. Iteration is done in + * ordinary element order. + */ + const_iterator + cend() const + { return const_iterator(0); } + + /** + * Returns true if the %forward_list is empty. (Thus begin() would + * equal end().) + */ + bool + empty() const + { return this->_M_impl._M_head._M_next == 0; } + + /** + * Returns the largest possible size of %forward_list. + */ + size_type + max_size() const + { return this->_M_get_Node_allocator().max_size(); } + + // 23.2.3.3 element access: + + /** + * Returns a read/write reference to the data at the first + * element of the %forward_list. + */ + reference + front() + { + _Node* __front = + __static_pointer_cast<_Node*>(this->_M_impl._M_head._M_next); + return __front->_M_value; + } + + /** + * Returns a read-only (constant) reference to the data at the first + * element of the %forward_list. + */ + const_reference + front() const + { + _Node* __front = + __static_pointer_cast<_Node*>(this->_M_impl._M_head._M_next); + return __front->_M_value; + } + + // 23.2.3.4 modifiers: + + /** + * @brief Constructs object in %forward_list at the front of the + * list. + * @param args Arguments. + * + * This function will insert an object of type Tp constructed + * with Tp(std::forward(args)...) at the front of the list + * Due to the nature of a %forward_list this operation can + * be done in constant time, and does not invalidate iterators + * and references. + */ + template + void + emplace_front(_Args&&... __args) + { this->_M_insert_after(cbefore_begin(), + std::forward<_Args>(__args)...); } + + /** + * @brief Add data to the front of the %forward_list. + * @param val Data to be added. + * + * This is a typical stack operation. The function creates an + * element at the front of the %forward_list and assigns the given + * data to it. Due to the nature of a %forward_list this operation + * can be done in constant time, and does not invalidate iterators + * and references. + */ + void + push_front(const _Tp& __val) + { this->_M_insert_after(cbefore_begin(), __val); } + + /** + * + */ + void + push_front(_Tp&& __val) + { this->_M_insert_after(cbefore_begin(), std::move(__val)); } + + /** + * @brief Removes first element. + * + * This is a typical stack operation. It shrinks the %forward_list + * by one. Due to the nature of a %forward_list this operation can + * be done in constant time, and only invalidates iterators/references + * to the element being removed. + * + * Note that no data is returned, and if the first element's data + * is needed, it should be retrieved before pop_front() is + * called. + */ + void + pop_front() + { this->_M_erase_after(&this->_M_impl._M_head); } + + /** + * @brief Constructs object in %forward_list after the specified + * iterator. + * @param pos A const_iterator into the %forward_list. + * @param args Arguments. + * @return An iterator that points to the inserted data. + * + * This function will insert an object of type T constructed + * with T(std::forward(args)...) after the specified + * location. Due to the nature of a %forward_list this operation can + * be done in constant time, and does not invalidate iterators + * and references. + */ + template + iterator + emplace_after(const_iterator __pos, _Args&&... __args) + { return iterator(this->_M_insert_after(__pos, + std::forward<_Args>(__args)...)); } + + /** + * @brief Inserts given value into %forward_list after specified + * iterator. + * @param pos An iterator into the %forward_list. + * @param val Data to be inserted. + * @return An iterator that points to the inserted data. + * + * This function will insert a copy of the given value after + * the specified location. Due to the nature of a %forward_list this + * operation can be done in constant time, and does not + * invalidate iterators and references. + */ + iterator + insert_after(const_iterator __pos, const _Tp& __val) + { return iterator(this->_M_insert_after(__pos, __val)); } + + /** + * + */ + iterator + insert_after(const_iterator __pos, _Tp&& __val) + { return iterator(this->_M_insert_after(__pos, std::move(__val))); } + + /** + * @brief Inserts a number of copies of given data into the + * %forward_list. + * @param pos An iterator into the %forward_list. + * @param n Number of elements to be inserted. + * @param val Data to be inserted. + * + * This function will insert a specified number of copies of the + * given data after the location specified by @a pos. + * + * This operation is linear in the number of elements inserted and + * does not invalidate iterators and references. + */ + void + insert_after(const_iterator __pos, size_type __n, const _Tp& __val) + { + forward_list __tmp(__n, __val, this->get_allocator()); + this->splice_after(__pos, std::move(__tmp)); + } + + /** + * @brief Inserts a range into the %forward_list. + * @param position An iterator into the %forward_list. + * @param first An input iterator. + * @param last An input iterator. + * + * This function will insert copies of the data in the range [@a + * first,@a last) into the %forward_list after the location specified + * by @a pos. + * + * This operation is linear in the number of elements inserted and + * does not invalidate iterators and references. + */ + template + void + insert_after(const_iterator __pos, + _InputIterator __first, _InputIterator __last) + { + forward_list __tmp(__first, __last, this->get_allocator()); + this->splice_after(__pos, std::move(__tmp)); + } + + /** + * @brief Inserts the contents of an initializer_list into + * %forward_list after the specified iterator. + * @param pos An iterator into the %forward_list. + * @param il An initializer_list of value_type. + * + * This function will insert copies of the data in the + * initializer_list @a il into the %forward_list before the location + * specified by @a pos. + * + * This operation is linear in the number of elements inserted and + * does not invalidate iterators and references. + */ + void + insert_after(const_iterator __pos, std::initializer_list<_Tp> __il) + { + forward_list __tmp(__il, this->get_allocator()); + this->splice_after(__pos, std::move(__tmp)); + } + + /** + * @brief Removes the element pointed to by the iterator following + * @c pos. + * @param pos Iterator pointing to element to be erased. + * @return An iterator pointing to the next element (or end()). + * + * This function will erase the element at the given position and + * thus shorten the %forward_list by one. + * + * Due to the nature of a %forward_list this operation can be done + * in constant time, and only invalidates iterators/references to + * the element being removed. The user is also cautioned that + * this function only erases the element, and that if the element + * is itself a pointer, the pointed-to memory is not touched in + * any way. Managing the pointer is the user's responsibility. + */ + iterator + erase_after(const_iterator __pos) + { + _Node_base* __tmp = __const_pointer_cast<_Node_base*>(__pos._M_node); + if (__tmp) + return iterator(this->_M_erase_after(__tmp)); + else + return end(); + } + + /** + * @brief Remove a range of elements. + * @param pos Iterator pointing before the first element to be + * erased. + * @param last Iterator pointing to one past the last element to be + * erased. + * @return An iterator pointing to the element pointed to by @a last + * prior to erasing (or end()). + * + * This function will erase the elements in the range @a + * (pos,last) and shorten the %forward_list accordingly. + * + * This operation is linear time in the size of the range and only + * invalidates iterators/references to the element being removed. + * The user is also cautioned that this function only erases the + * elements, and that if the elements themselves are pointers, the + * pointed-to memory is not touched in any way. Managing the pointer + * is the user's responsibility. + */ + iterator + erase_after(const_iterator __pos, iterator __last) + { + _Node_base* __tmp = __const_pointer_cast<_Node_base*>(__pos._M_node); + return iterator(this->_M_erase_after(__tmp, &*__last._M_node)); + } + + /** + * @brief Swaps data with another %forward_list. + * @param list A %forward_list of the same element and allocator + * types. + * + * This exchanges the elements between two lists in constant + * time. Note that the global std::swap() function is + * specialized such that std::swap(l1,l2) will feed to this + * function. + */ + void + swap(forward_list&& __list) + { _Node_base::swap(this->_M_impl._M_head, __list._M_impl._M_head); } + + /** + * @brief Resizes the %forward_list to the specified number of + * elements. + * @param sz Number of elements the %forward_list should contain. + * + * This function will %resize the %forward_list to the specified + * number of elements. If the number is smaller than the + * %forward_list's current size the %forward_list is truncated, + * otherwise the %forward_list is extended and new elements are + * populated with given data. + */ + void + resize(size_type __sz) + { resize(__sz, _Tp()); } + + /** + * @brief Resizes the %forward_list to the specified number of + * elements. + * @param sz Number of elements the %forward_list should contain. + * @param val Data with which new elements should be populated. + * + * This function will %resize the %forward_list to the specified + * number of elements. If the number is smaller than the + * %forward_list's current size the %forward_list is truncated, + * otherwise the %forward_list is extended and new elements are + * populated with given data. + */ + void + resize(size_type __sz, value_type __val); + + /** + * @brief Erases all the elements. + * + * Note that this function only erases + * the elements, and that if the elements themselves are + * pointers, the pointed-to memory is not touched in any way. + * Managing the pointer is the user's responsibility. + */ + void + clear() + { this->_M_erase_after(&this->_M_impl._M_head, 0); } + + // 23.2.3.5 forward_list operations: + + /** + * @brief Insert contents of another %forward_list. + * @param pos Iterator referencing the element to insert after. + * @param list Source list. + * + * The elements of @a list are inserted in constant time after + * the element referenced by @a pos. @a list becomes an empty + * list. + * + * Requires this != @a x. + */ + void + splice_after(const_iterator __pos, forward_list&& __list); + + /** + * @brief Insert element from another %forward_list. + * @param pos Iterator referencing the element to insert after. + * @param list Source list. + * @param it Iterator referencing the element before the element + * to move. + * + * Removes the element in list @a list referenced by @a i and + * inserts it into the current list after @a pos. + */ + void + splice_after(const_iterator __pos, forward_list&& __list, + const_iterator __it) + { this->splice_after(__pos, __list, __it, __it._M_next()); } + + /** + * @brief Insert range from another %forward_list. + * @param pos Iterator referencing the element to insert after. + * @param list Source list. + * @param before Iterator referencing before the start of range + * in list. + * @param last Iterator referencing the end of range in list. + * + * Removes elements in the range (before,last) and inserts them + * after @a pos in constant time. + * + * Undefined if @a pos is in (before,last). + */ + void + splice_after(const_iterator __pos, forward_list&& __list, + const_iterator __before, const_iterator __last); + + /** + * @brief Remove all elements equal to value. + * @param val The value to remove. + * + * Removes every element in the list equal to @a value. + * Remaining elements stay in list order. Note that this + * function only erases the elements, and that if the elements + * themselves are pointers, the pointed-to memory is not + * touched in any way. Managing the pointer is the user's + * responsibility. + */ + void + remove(const _Tp& __val); + + /** + * @brief Remove all elements satisfying a predicate. + * @param pred Unary predicate function or object. + * + * Removes every element in the list for which the predicate + * returns true. Remaining elements stay in list order. Note + * that this function only erases the elements, and that if the + * elements themselves are pointers, the pointed-to memory is + * not touched in any way. Managing the pointer is the user's + * responsibility. + */ + template + void + remove_if(_Pred __pred); + + /** + * @brief Remove consecutive duplicate elements. + * + * For each consecutive set of elements with the same value, + * remove all but the first one. Remaining elements stay in + * list order. Note that this function only erases the + * elements, and that if the elements themselves are pointers, + * the pointed-to memory is not touched in any way. Managing + * the pointer is the user's responsibility. + */ + void + unique() + { this->unique(std::equal_to<_Tp>()); } + + /** + * @brief Remove consecutive elements satisfying a predicate. + * @param binary_pred Binary predicate function or object. + * + * For each consecutive set of elements [first,last) that + * satisfy predicate(first,i) where i is an iterator in + * [first,last), remove all but the first one. Remaining + * elements stay in list order. Note that this function only + * erases the elements, and that if the elements themselves are + * pointers, the pointed-to memory is not touched in any way. + * Managing the pointer is the user's responsibility. + */ + template + void + unique(_BinPred __binary_pred); + + /** + * @brief Merge sorted lists. + * @param list Sorted list to merge. + * + * Assumes that both @a list and this list are sorted according to + * operator<(). Merges elements of @a list into this list in + * sorted order, leaving @a list empty when complete. Elements in + * this list precede elements in @a list that are equal. + */ + void + merge(forward_list&& __list) + { this->merge(__list, std::less<_Tp>()); } + + /** + * @brief Merge sorted lists according to comparison function. + * @param list Sorted list to merge. + * @param comp Comparison function defining sort order. + * + * Assumes that both @a list and this list are sorted according to + * comp. Merges elements of @a list into this list + * in sorted order, leaving @a list empty when complete. Elements + * in this list precede elements in @a list that are equivalent + * according to comp(). + */ + template + void + merge(forward_list&& __list, _Comp __comp); + + /** + * @brief Sort the elements of the list. + * + * Sorts the elements of this list in NlogN time. Equivalent + * elements remain in list order. + */ + void + sort() + { + _Node* __tmp = __static_pointer_cast<_Node*>(&this->_M_impl._M_head); + __tmp->_M_sort_after(std::less<_Tp>()); + } + + /** + * @brief Sort the forward_list using a comparison function. + * + * Sorts the elements of this list in NlogN time. Equivalent + * elements remain in list order. + */ + template + void + sort(_Comp __comp) + { + _Node* __tmp = __static_pointer_cast<_Node*>(&this->_M_impl._M_head); + __tmp->_M_sort_after(__comp); + } + + /** + * @brief Reverse the elements in list. + * + * Reverse the order of elements in the list in linear time. + */ + void + reverse() + { this->_M_impl._M_head._M_reverse_after(); } + + private: + template + void + _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) + { _M_fill_initialize(static_cast(__n), __x); } + + // Called by the range constructor to implement [23.1.1]/9 + template + void + _M_initialize_dispatch(_InputIterator __first, _InputIterator __last, + __false_type); + + // Called by forward_list(n,v,a), and the range constructor when it + // turns out to be the same thing. + void + _M_fill_initialize(size_type __n, const value_type& __value); + }; + + /** + * @brief Forward list equality comparison. + * @param lx A %forward_list + * @param ly A %forward_list of the same type as @a lx. + * @return True iff the size and elements of the forward lists are equal. + * + * This is an equivalence relation. It is linear in the size of the + * forward lists. Deques are considered equivalent if corresponding + * elements compare equal. + */ + template + bool + operator==(const forward_list<_Tp, _Alloc>& __lx, + const forward_list<_Tp, _Alloc>& __ly); + + /** + * @brief Forward list ordering relation. + * @param lx A %forward_list. + * @param ly A %forward_list of the same type as @a lx. + * @return True iff @a lx is lexicographically less than @a ly. + * + * This is a total ordering relation. It is linear in the size of the + * forward lists. The elements must be comparable with @c <. + * + * See std::lexicographical_compare() for how the determination is made. + */ + template + inline bool + operator<(const forward_list<_Tp, _Alloc>& __lx, + const forward_list<_Tp, _Alloc>& __ly) + { return std::lexicographical_compare(__lx.cbegin(), __lx.cend(), + __ly.cbegin(), __ly.cend()); } + + /// Based on operator== + template + inline bool + operator!=(const forward_list<_Tp, _Alloc>& __lx, + const forward_list<_Tp, _Alloc>& __ly) + { return !(__lx == __ly); } + + /// Based on operator< + template + inline bool + operator>(const forward_list<_Tp, _Alloc>& __lx, + const forward_list<_Tp, _Alloc>& __ly) + { return (__ly < __lx); } + + /// Based on operator< + template + inline bool + operator>=(const forward_list<_Tp, _Alloc>& __lx, + const forward_list<_Tp, _Alloc>& __ly) + { return !(__lx < __ly); } + + /// Based on operator< + template + inline bool + operator<=(const forward_list<_Tp, _Alloc>& __lx, + const forward_list<_Tp, _Alloc>& __ly) + { return !(__ly < __lx); } + + /// See std::forward_list::swap(). + template + inline void + swap(forward_list<_Tp, _Alloc>& __lx, + forward_list<_Tp, _Alloc>& __ly) + { __lx.swap(__ly); } + + /// See std::forward_list::swap(). + template + inline void + swap(forward_list<_Tp, _Alloc>&& __lx, + forward_list<_Tp, _Alloc>& __ly) + { __lx.swap(__ly); } + + /// See std::forward_list::swap(). + template + inline void + swap(forward_list<_Tp, _Alloc>& __lx, + forward_list<_Tp, _Alloc>&& __ly) + { __lx.swap(__ly); } + +_GLIBCXX_END_NAMESPACE // namespace std + +#endif // __GXX_EXPERIMENTAL_CXX0X__ + +#endif // _FORWARD_LIST_H diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/forward_list.tcc b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/forward_list.tcc new file mode 100644 index 00000000..8458e7e5 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/forward_list.tcc @@ -0,0 +1,478 @@ +// -*- C++ -*- + +// Copyright (C) 2008, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file forward_list.tcc + * This is a Standard C++ Library header. + */ + +#ifndef _FORWARD_LIST_TCC +#define _FORWARD_LIST_TCC 1 + +_GLIBCXX_BEGIN_NAMESPACE(std) + + template + void + _Fwd_list_node_base<_Alloc>:: + _M_transfer_after(_Pointer __bbegin) + { + _Pointer __bend = __bbegin; + while (__bend && __bend->_M_next) + __bend = __bend->_M_next; + _M_transfer_after(__bbegin, __bend); + } + + template + void + _Fwd_list_node_base<_Alloc>:: + _M_transfer_after(_Pointer __bbegin, _Pointer __bend) + { + _Pointer __keep = __bbegin->_M_next; + if (__bend) + { + __bbegin->_M_next = __bend->_M_next; + __bend->_M_next = _M_next; + } + else + __bbegin->_M_next = 0; + _M_next = __keep; + } + + template + void + _Fwd_list_node_base<_Alloc>:: + _M_reverse_after() + { + _Pointer __tail = _M_next; + if (!__tail) + return; + while (_Pointer __temp = __tail->_M_next) + { + _Pointer __keep = _M_next; + _M_next = __temp; + __tail->_M_next = __temp->_M_next; + _M_next->_M_next = __keep; + } + } + + /** + * @brief Sort the singly linked list starting after this node. + * This node is assumed to be an empty head node (of type + * _Fwd_list_node_base). + */ + template + template + void + _Fwd_list_node<_Tp, _Alloc>:: + _M_sort_after(_Comp __comp) + { + // If `next' is 0, return immediately. + _Pointer __list = __static_pointer_cast<_Pointer>(this->_M_next); + if (!__list) + return; + + unsigned long __insize = 1; + + while (1) + { + _Pointer __p = __list; + __list = 0; + _Pointer __tail = 0; + + // Count number of merges we do in this pass. + unsigned long __nmerges = 0; + + while (__p) + { + ++__nmerges; + // There exists a merge to be done. + // Step `insize' places along from p. + _Pointer __q = __p; + unsigned long __psize = 0; + for (unsigned long __i = 0; __i < __insize; ++__i) + { + ++__psize; + __q = __static_pointer_cast<_Pointer>(__q->_M_next); + if (!__q) + break; + } + + // If q hasn't fallen off end, we have two lists to merge. + unsigned long __qsize = __insize; + + // Now we have two lists; merge them. + while (__psize > 0 || (__qsize > 0 && __q)) + { + // Decide whether next node of merge comes from p or q. + _Pointer __e; + if (__psize == 0) + { + // p is empty; e must come from q. + __e = __q; + __q = __static_pointer_cast<_Pointer>(__q->_M_next); + --__qsize; + } + else if (__qsize == 0 || !__q) + { + // q is empty; e must come from p. + __e = __p; + __p = __static_pointer_cast<_Pointer>(__p->_M_next); + --__psize; + } + else if (__comp(__p->_M_value, __q->_M_value)) + { + // First node of p is lower; e must come from p. + __e = __p; + __p = __static_pointer_cast<_Pointer>(__p->_M_next); + --__psize; + } + else + { + // First node of q is lower; e must come from q. + __e = __q; + __q = __static_pointer_cast<_Pointer>(__q->_M_next); + --__qsize; + } + + // Add the next node to the merged list. + if (__tail) + __tail->_M_next = __e; + else + __list = __e; + __tail = __e; + } + + // Now p has stepped `insize' places along, and q has too. + __p = __q; + } + __tail->_M_next = 0; + + // If we have done only one merge, we're finished. + // Allow for nmerges == 0, the empty list case. + if (__nmerges <= 1) + { + this->_M_next = __list; + return; + } + + // Otherwise repeat, merging lists twice the size. + __insize *= 2; + } + } + + template + _Fwd_list_base<_Tp, _Alloc>:: + _Fwd_list_base(const _Fwd_list_base& __lst, const _Alloc& __a) + : _M_impl(__a) + { + this->_M_impl._M_head._M_next = 0; + typename _Node_base::_Pointer __to = &this->_M_impl._M_head; + typename _Node::_Pointer __curr + = __static_pointer_cast + (__lst._M_impl._M_head._M_next); + while (__curr) + { + __to->_M_next = _M_create_node(__curr->_M_value); + __to = __to->_M_next; + __curr = __static_pointer_cast + (__curr->_M_next); + } + } + + template + template + typename _Fwd_list_base<_Tp, _Alloc>::_Node_base::_Pointer + _Fwd_list_base<_Tp, _Alloc>:: + _M_insert_after(const_iterator __pos, _Args&&... __args) + { + typename _Node_base::_Pointer __to + = __const_pointer_cast + (__pos._M_node); + typename _Node::_Pointer __thing + = __static_pointer_cast( + _M_create_node(std::forward<_Args>(__args)...) ); + __thing->_M_next = __to->_M_next; + __to->_M_next = __thing; + return __static_pointer_cast + (__to->_M_next); + } + + template + typename _Fwd_list_base<_Tp, _Alloc>::_Node_base::_Pointer + _Fwd_list_base<_Tp, _Alloc>:: + _M_erase_after(typename _Node_base::_Pointer __pos) + { + typename _Node::_Pointer __curr + = __static_pointer_cast(__pos->_M_next); + if (__curr) + { + typename _Node_base::_Pointer __next = __curr->_M_next; + __pos->_M_next = __next; + _M_get_Node_allocator().destroy(__curr); + _M_put_node(__curr); + } + return __pos; + } + + template + typename _Fwd_list_base<_Tp, _Alloc>::_Node_base::_Pointer + _Fwd_list_base<_Tp, _Alloc>:: + _M_erase_after(typename _Node_base::_Pointer __pos, + typename _Node_base::_Pointer __last) + { + typename _Node::_Pointer __curr + = __static_pointer_cast(__pos->_M_next); + while (__curr) + { + typename _Node::_Pointer __temp = __curr; + __curr = __static_pointer_cast + (__curr->_M_next); + _M_get_Node_allocator().destroy(__temp); + _M_put_node(__temp); + __pos->_M_next = __curr; + if (__temp == __last) + break; + } + return __pos; + } + + // Called by the range constructor to implement [23.1.1]/9 + template + template + void + forward_list<_Tp, _Alloc>:: + _M_initialize_dispatch(_InputIterator __first, _InputIterator __last, + __false_type) + { + typename _Node_base::_Pointer __to = &this->_M_impl._M_head; + for (; __first != __last; ++__first) + { + __to->_M_next = this->_M_create_node(*__first); + __to = __to->_M_next; + } + } + + // Called by forward_list(n,v,a), and the range constructor + // when it turns out to be the same thing. + template + void + forward_list<_Tp, _Alloc>:: + _M_fill_initialize(size_type __n, const value_type& __value) + { + typename _Node_base::_Pointer __to = &this->_M_impl._M_head; + for (; __n > 0; --__n) + { + __to->_M_next = this->_M_create_node(__value); + __to = __to->_M_next; + } + } + + template + forward_list<_Tp, _Alloc>& + forward_list<_Tp, _Alloc>:: + operator=(const forward_list& __list) + { + if (&__list != this) + { + iterator __prev1 = before_begin(); + iterator __curr1 = begin(); + iterator __last1 = end(); + const_iterator __first2 = __list.cbegin(); + const_iterator __last2 = __list.cend(); + while (__curr1 != __last1 && __first2 != __last2) + { + *__curr1 = *__first2; + ++__prev1; + ++__curr1; + ++__first2; + } + if (__first2 == __last2) + erase_after(__prev1, __last1); + else + insert_after(__prev1, __first2, __last2); + } + return *this; + } + + template + void + forward_list<_Tp, _Alloc>:: + resize(size_type __sz, value_type __val) + { + iterator __k = before_begin(); + + size_type __len = 0; + while (__k._M_next() != end() && __len < __sz) + { + ++__k; + ++__len; + } + if (__len == __sz) + erase_after(__k, end()); + else + insert_after(__k, __sz - __len, __val); + } + + template + void + forward_list<_Tp, _Alloc>:: + splice_after(const_iterator __pos, forward_list&& __list) + { + if (!__list.empty() && &__list != this) + { + typename _Node_base::_Pointer __tmp + = __const_pointer_cast + (__pos._M_node); + const_iterator __before = __list.cbefore_begin(); + __tmp->_M_transfer_after(__const_pointer_cast + + (__before._M_node)); + } + } + + template + void + forward_list<_Tp, _Alloc>:: + splice_after(const_iterator __pos, forward_list&& __list, + const_iterator __before, const_iterator __last) + { + typename _Node_base::_Pointer __tmp + = __const_pointer_cast(__pos._M_node); + __tmp->_M_transfer_after(__const_pointer_cast + + (__before._M_node), + __const_pointer_cast + + (__last._M_node)); + } + + template + void + forward_list<_Tp, _Alloc>:: + remove(const _Tp& __val) + { + typename _Node::_Pointer __curr + = __static_pointer_cast + (&this->_M_impl._M_head); + while (typename _Node::_Pointer __temp = + __static_pointer_cast(__curr->_M_next)) + { + if (__temp->_M_value == __val) + this->_M_erase_after(__curr); + else + __curr = __static_pointer_cast + (__curr->_M_next); + } + } + + template + template + void + forward_list<_Tp, _Alloc>:: + remove_if(_Pred __pred) + { + typename _Node::_Pointer __curr + = __static_pointer_cast + (&this->_M_impl._M_head); + while (typename _Node::_Pointer __temp = + __static_pointer_cast(__curr->_M_next)) + { + if (__pred(__temp->_M_value)) + this->_M_erase_after(__curr); + else + __curr = __static_pointer_cast + (__curr->_M_next); + } + } + + template + template + void + forward_list<_Tp, _Alloc>:: + unique(_BinPred __binary_pred) + { + iterator __first = begin(); + iterator __last = end(); + if (__first == __last) + return; + iterator __next = __first; + while (++__next != __last) + { + if (__binary_pred(*__first, *__next)) + erase_after(__first); + else + __first = __next; + __next = __first; + } + } + + template + template + void + forward_list<_Tp, _Alloc>:: + merge(forward_list&& __list, _Comp __comp) + { + typename _Node_base::_Pointer __node = &this->_M_impl._M_head; + while (__node->_M_next && __list._M_impl._M_head._M_next) + { + if (__comp(__static_pointer_cast + (__list._M_impl._M_head._M_next)->_M_value, + __static_pointer_cast + (__node->_M_next)->_M_value)) + __node->_M_transfer_after(&__list._M_impl._M_head, + __list._M_impl._M_head._M_next); + __node = __node->_M_next; + } + if (__list._M_impl._M_head._M_next) + { + __node->_M_next = __list._M_impl._M_head._M_next; + __list._M_impl._M_head._M_next = 0; + } + } + + template + bool + operator==(const forward_list<_Tp, _Alloc>& __lx, + const forward_list<_Tp, _Alloc>& __ly) + { + // We don't have size() so we need to walk through both lists + // making sure both iterators are valid. + auto __ix = __lx.cbegin(); + auto __iy = __ly.cbegin(); + while (__ix != __lx.cend() && __iy != __ly.cend()) + { + if (*__ix != *__iy) + return false; + ++__ix; + ++__iy; + } + if (__ix == __lx.cend() && __iy == __ly.cend()) + return true; + else + return false; + } + +_GLIBCXX_END_NAMESPACE // namespace std + +#endif /* _FORWARD_LIST_TCC */ + diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/fstream.tcc b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/fstream.tcc new file mode 100644 index 00000000..c5f7f8c5 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/fstream.tcc @@ -0,0 +1,926 @@ +// File based streams -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, +// 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file fstream.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 27.8 File-based streams +// + +#ifndef _FSTREAM_TCC +#define _FSTREAM_TCC 1 + +#pragma GCC system_header + +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + template + void + basic_filebuf<_CharT, _Traits>:: + _M_allocate_internal_buffer() + { + // Allocate internal buffer only if one doesn't already exist + // (either allocated or provided by the user via setbuf). + if (!_M_buf_allocated && !_M_buf) + { + _M_buf = new char_type[_M_buf_size]; + _M_buf_allocated = true; + } + } + + template + void + basic_filebuf<_CharT, _Traits>:: + _M_destroy_internal_buffer() throw() + { + if (_M_buf_allocated) + { + delete [] _M_buf; + _M_buf = NULL; + _M_buf_allocated = false; + } + delete [] _M_ext_buf; + _M_ext_buf = NULL; + _M_ext_buf_size = 0; + _M_ext_next = NULL; + _M_ext_end = NULL; + } + + template + basic_filebuf<_CharT, _Traits>:: + basic_filebuf() : __streambuf_type(), _M_lock(), _M_file(&_M_lock), + _M_mode(ios_base::openmode(0)), _M_state_beg(), _M_state_cur(), + _M_state_last(), _M_buf(NULL), _M_buf_size(BUFSIZ), + _M_buf_allocated(false), _M_reading(false), _M_writing(false), _M_pback(), + _M_pback_cur_save(0), _M_pback_end_save(0), _M_pback_init(false), + _M_codecvt(0), _M_ext_buf(0), _M_ext_buf_size(0), _M_ext_next(0), + _M_ext_end(0) + { + if (has_facet<__codecvt_type>(this->_M_buf_locale)) + _M_codecvt = &use_facet<__codecvt_type>(this->_M_buf_locale); + } + + template + typename basic_filebuf<_CharT, _Traits>::__filebuf_type* + basic_filebuf<_CharT, _Traits>:: + open(const char* __s, ios_base::openmode __mode) + { + __filebuf_type *__ret = NULL; + if (!this->is_open()) + { + _M_file.open(__s, __mode); + if (this->is_open()) + { + _M_allocate_internal_buffer(); + _M_mode = __mode; + + // Setup initial buffer to 'uncommitted' mode. + _M_reading = false; + _M_writing = false; + _M_set_buffer(-1); + + // Reset to initial state. + _M_state_last = _M_state_cur = _M_state_beg; + + // 27.8.1.3,4 + if ((__mode & ios_base::ate) + && this->seekoff(0, ios_base::end, __mode) + == pos_type(off_type(-1))) + this->close(); + else + __ret = this; + } + } + return __ret; + } + + template + typename basic_filebuf<_CharT, _Traits>::__filebuf_type* + basic_filebuf<_CharT, _Traits>:: + close() + { + if (!this->is_open()) + return NULL; + + bool __testfail = false; + { + // NB: Do this here so that re-opened filebufs will be cool... + struct __close_sentry + { + basic_filebuf *__fb; + __close_sentry (basic_filebuf *__fbi): __fb(__fbi) { } + ~__close_sentry () + { + __fb->_M_mode = ios_base::openmode(0); + __fb->_M_pback_init = false; + __fb->_M_destroy_internal_buffer(); + __fb->_M_reading = false; + __fb->_M_writing = false; + __fb->_M_set_buffer(-1); + __fb->_M_state_last = __fb->_M_state_cur = __fb->_M_state_beg; + } + } __cs (this); + + __try + { + if (!_M_terminate_output()) + __testfail = true; + } + __catch(__cxxabiv1::__forced_unwind&) + { + _M_file.close(); + __throw_exception_again; + } + __catch(...) + { __testfail = true; } + } + + if (!_M_file.close()) + __testfail = true; + + if (__testfail) + return NULL; + else + return this; + } + + template + streamsize + basic_filebuf<_CharT, _Traits>:: + showmanyc() + { + streamsize __ret = -1; + const bool __testin = _M_mode & ios_base::in; + if (__testin && this->is_open()) + { + // For a stateful encoding (-1) the pending sequence might be just + // shift and unshift prefixes with no actual character. + __ret = this->egptr() - this->gptr(); + +#if _GLIBCXX_HAVE_DOS_BASED_FILESYSTEM + // About this workaround, see libstdc++/20806. + const bool __testbinary = _M_mode & ios_base::binary; + if (__check_facet(_M_codecvt).encoding() >= 0 + && __testbinary) +#else + if (__check_facet(_M_codecvt).encoding() >= 0) +#endif + __ret += _M_file.showmanyc() / _M_codecvt->max_length(); + } + return __ret; + } + + template + typename basic_filebuf<_CharT, _Traits>::int_type + basic_filebuf<_CharT, _Traits>:: + underflow() + { + int_type __ret = traits_type::eof(); + const bool __testin = _M_mode & ios_base::in; + if (__testin && !_M_writing) + { + // Check for pback madness, and if so switch back to the + // normal buffers and jet outta here before expensive + // fileops happen... + _M_destroy_pback(); + + if (this->gptr() < this->egptr()) + return traits_type::to_int_type(*this->gptr()); + + // Get and convert input sequence. + const size_t __buflen = _M_buf_size > 1 ? _M_buf_size - 1 : 1; + + // Will be set to true if ::read() returns 0 indicating EOF. + bool __got_eof = false; + // Number of internal characters produced. + streamsize __ilen = 0; + codecvt_base::result __r = codecvt_base::ok; + if (__check_facet(_M_codecvt).always_noconv()) + { + __ilen = _M_file.xsgetn(reinterpret_cast(this->eback()), + __buflen); + if (__ilen == 0) + __got_eof = true; + } + else + { + // Worst-case number of external bytes. + // XXX Not done encoding() == -1. + const int __enc = _M_codecvt->encoding(); + streamsize __blen; // Minimum buffer size. + streamsize __rlen; // Number of chars to read. + if (__enc > 0) + __blen = __rlen = __buflen * __enc; + else + { + __blen = __buflen + _M_codecvt->max_length() - 1; + __rlen = __buflen; + } + const streamsize __remainder = _M_ext_end - _M_ext_next; + __rlen = __rlen > __remainder ? __rlen - __remainder : 0; + + // An imbue in 'read' mode implies first converting the external + // chars already present. + if (_M_reading && this->egptr() == this->eback() && __remainder) + __rlen = 0; + + // Allocate buffer if necessary and move unconverted + // bytes to front. + if (_M_ext_buf_size < __blen) + { + char* __buf = new char[__blen]; + if (__remainder) + __builtin_memcpy(__buf, _M_ext_next, __remainder); + + delete [] _M_ext_buf; + _M_ext_buf = __buf; + _M_ext_buf_size = __blen; + } + else if (__remainder) + __builtin_memmove(_M_ext_buf, _M_ext_next, __remainder); + + _M_ext_next = _M_ext_buf; + _M_ext_end = _M_ext_buf + __remainder; + _M_state_last = _M_state_cur; + + do + { + if (__rlen > 0) + { + // Sanity check! + // This may fail if the return value of + // codecvt::max_length() is bogus. + if (_M_ext_end - _M_ext_buf + __rlen > _M_ext_buf_size) + { + __throw_ios_failure(__N("basic_filebuf::underflow " + "codecvt::max_length() " + "is not valid")); + } + streamsize __elen = _M_file.xsgetn(_M_ext_end, __rlen); + if (__elen == 0) + __got_eof = true; + else if (__elen == -1) + break; + _M_ext_end += __elen; + } + + char_type* __iend = this->eback(); + if (_M_ext_next < _M_ext_end) + __r = _M_codecvt->in(_M_state_cur, _M_ext_next, + _M_ext_end, _M_ext_next, + this->eback(), + this->eback() + __buflen, __iend); + if (__r == codecvt_base::noconv) + { + size_t __avail = _M_ext_end - _M_ext_buf; + __ilen = std::min(__avail, __buflen); + traits_type::copy(this->eback(), + reinterpret_cast + (_M_ext_buf), __ilen); + _M_ext_next = _M_ext_buf + __ilen; + } + else + __ilen = __iend - this->eback(); + + // _M_codecvt->in may return error while __ilen > 0: this is + // ok, and actually occurs in case of mixed encodings (e.g., + // XML files). + if (__r == codecvt_base::error) + break; + + __rlen = 1; + } + while (__ilen == 0 && !__got_eof); + } + + if (__ilen > 0) + { + _M_set_buffer(__ilen); + _M_reading = true; + __ret = traits_type::to_int_type(*this->gptr()); + } + else if (__got_eof) + { + // If the actual end of file is reached, set 'uncommitted' + // mode, thus allowing an immediate write without an + // intervening seek. + _M_set_buffer(-1); + _M_reading = false; + // However, reaching it while looping on partial means that + // the file has got an incomplete character. + if (__r == codecvt_base::partial) + __throw_ios_failure(__N("basic_filebuf::underflow " + "incomplete character in file")); + } + else if (__r == codecvt_base::error) + __throw_ios_failure(__N("basic_filebuf::underflow " + "invalid byte sequence in file")); + else + __throw_ios_failure(__N("basic_filebuf::underflow " + "error reading the file")); + } + return __ret; + } + + template + typename basic_filebuf<_CharT, _Traits>::int_type + basic_filebuf<_CharT, _Traits>:: + pbackfail(int_type __i) + { + int_type __ret = traits_type::eof(); + const bool __testin = _M_mode & ios_base::in; + if (__testin && !_M_writing) + { + // Remember whether the pback buffer is active, otherwise below + // we may try to store in it a second char (libstdc++/9761). + const bool __testpb = _M_pback_init; + const bool __testeof = traits_type::eq_int_type(__i, __ret); + int_type __tmp; + if (this->eback() < this->gptr()) + { + this->gbump(-1); + __tmp = traits_type::to_int_type(*this->gptr()); + } + else if (this->seekoff(-1, ios_base::cur) != pos_type(off_type(-1))) + { + __tmp = this->underflow(); + if (traits_type::eq_int_type(__tmp, __ret)) + return __ret; + } + else + { + // At the beginning of the buffer, need to make a + // putback position available. But the seek may fail + // (f.i., at the beginning of a file, see + // libstdc++/9439) and in that case we return + // traits_type::eof(). + return __ret; + } + + // Try to put back __i into input sequence in one of three ways. + // Order these tests done in is unspecified by the standard. + if (!__testeof && traits_type::eq_int_type(__i, __tmp)) + __ret = __i; + else if (__testeof) + __ret = traits_type::not_eof(__i); + else if (!__testpb) + { + _M_create_pback(); + _M_reading = true; + *this->gptr() = traits_type::to_char_type(__i); + __ret = __i; + } + } + return __ret; + } + + template + typename basic_filebuf<_CharT, _Traits>::int_type + basic_filebuf<_CharT, _Traits>:: + overflow(int_type __c) + { + int_type __ret = traits_type::eof(); + const bool __testeof = traits_type::eq_int_type(__c, __ret); + const bool __testout = _M_mode & ios_base::out; + if (__testout && !_M_reading) + { + if (this->pbase() < this->pptr()) + { + // If appropriate, append the overflow char. + if (!__testeof) + { + *this->pptr() = traits_type::to_char_type(__c); + this->pbump(1); + } + + // Convert pending sequence to external representation, + // and output. + if (_M_convert_to_external(this->pbase(), + this->pptr() - this->pbase())) + { + _M_set_buffer(0); + __ret = traits_type::not_eof(__c); + } + } + else if (_M_buf_size > 1) + { + // Overflow in 'uncommitted' mode: set _M_writing, set + // the buffer to the initial 'write' mode, and put __c + // into the buffer. + _M_set_buffer(0); + _M_writing = true; + if (!__testeof) + { + *this->pptr() = traits_type::to_char_type(__c); + this->pbump(1); + } + __ret = traits_type::not_eof(__c); + } + else + { + // Unbuffered. + char_type __conv = traits_type::to_char_type(__c); + if (__testeof || _M_convert_to_external(&__conv, 1)) + { + _M_writing = true; + __ret = traits_type::not_eof(__c); + } + } + } + return __ret; + } + + template + bool + basic_filebuf<_CharT, _Traits>:: + _M_convert_to_external(_CharT* __ibuf, streamsize __ilen) + { + // Sizes of external and pending output. + streamsize __elen; + streamsize __plen; + if (__check_facet(_M_codecvt).always_noconv()) + { + __elen = _M_file.xsputn(reinterpret_cast(__ibuf), __ilen); + __plen = __ilen; + } + else + { + // Worst-case number of external bytes needed. + // XXX Not done encoding() == -1. + streamsize __blen = __ilen * _M_codecvt->max_length(); + char* __buf = static_cast(__builtin_alloca(__blen)); + + char* __bend; + const char_type* __iend; + codecvt_base::result __r; + __r = _M_codecvt->out(_M_state_cur, __ibuf, __ibuf + __ilen, + __iend, __buf, __buf + __blen, __bend); + + if (__r == codecvt_base::ok || __r == codecvt_base::partial) + __blen = __bend - __buf; + else if (__r == codecvt_base::noconv) + { + // Same as the always_noconv case above. + __buf = reinterpret_cast(__ibuf); + __blen = __ilen; + } + else + __throw_ios_failure(__N("basic_filebuf::_M_convert_to_external " + "conversion error")); + + __elen = _M_file.xsputn(__buf, __blen); + __plen = __blen; + + // Try once more for partial conversions. + if (__r == codecvt_base::partial && __elen == __plen) + { + const char_type* __iresume = __iend; + streamsize __rlen = this->pptr() - __iend; + __r = _M_codecvt->out(_M_state_cur, __iresume, + __iresume + __rlen, __iend, __buf, + __buf + __blen, __bend); + if (__r != codecvt_base::error) + { + __rlen = __bend - __buf; + __elen = _M_file.xsputn(__buf, __rlen); + __plen = __rlen; + } + else + __throw_ios_failure(__N("basic_filebuf::_M_convert_to_external " + "conversion error")); + } + } + return __elen == __plen; + } + + template + streamsize + basic_filebuf<_CharT, _Traits>:: + xsgetn(_CharT* __s, streamsize __n) + { + // Clear out pback buffer before going on to the real deal... + streamsize __ret = 0; + if (_M_pback_init) + { + if (__n > 0 && this->gptr() == this->eback()) + { + *__s++ = *this->gptr(); + this->gbump(1); + __ret = 1; + --__n; + } + _M_destroy_pback(); + } + + // Optimization in the always_noconv() case, to be generalized in the + // future: when __n > __buflen we read directly instead of using the + // buffer repeatedly. + const bool __testin = _M_mode & ios_base::in; + const streamsize __buflen = _M_buf_size > 1 ? _M_buf_size - 1 : 1; + + if (__n > __buflen && __check_facet(_M_codecvt).always_noconv() + && __testin && !_M_writing) + { + // First, copy the chars already present in the buffer. + const streamsize __avail = this->egptr() - this->gptr(); + if (__avail != 0) + { + if (__avail == 1) + *__s = *this->gptr(); + else + traits_type::copy(__s, this->gptr(), __avail); + __s += __avail; + this->gbump(__avail); + __ret += __avail; + __n -= __avail; + } + + // Need to loop in case of short reads (relatively common + // with pipes). + streamsize __len; + for (;;) + { + __len = _M_file.xsgetn(reinterpret_cast(__s), + __n); + if (__len == -1) + __throw_ios_failure(__N("basic_filebuf::xsgetn " + "error reading the file")); + if (__len == 0) + break; + + __n -= __len; + __ret += __len; + if (__n == 0) + break; + + __s += __len; + } + + if (__n == 0) + { + _M_set_buffer(0); + _M_reading = true; + } + else if (__len == 0) + { + // If end of file is reached, set 'uncommitted' + // mode, thus allowing an immediate write without + // an intervening seek. + _M_set_buffer(-1); + _M_reading = false; + } + } + else + __ret += __streambuf_type::xsgetn(__s, __n); + + return __ret; + } + + template + streamsize + basic_filebuf<_CharT, _Traits>:: + xsputn(const _CharT* __s, streamsize __n) + { + // Optimization in the always_noconv() case, to be generalized in the + // future: when __n is sufficiently large we write directly instead of + // using the buffer. + streamsize __ret = 0; + const bool __testout = _M_mode & ios_base::out; + if (__check_facet(_M_codecvt).always_noconv() + && __testout && !_M_reading) + { + // Measurement would reveal the best choice. + const streamsize __chunk = 1ul << 10; + streamsize __bufavail = this->epptr() - this->pptr(); + + // Don't mistake 'uncommitted' mode buffered with unbuffered. + if (!_M_writing && _M_buf_size > 1) + __bufavail = _M_buf_size - 1; + + const streamsize __limit = std::min(__chunk, __bufavail); + if (__n >= __limit) + { + const streamsize __buffill = this->pptr() - this->pbase(); + const char* __buf = reinterpret_cast(this->pbase()); + __ret = _M_file.xsputn_2(__buf, __buffill, + reinterpret_cast(__s), + __n); + if (__ret == __buffill + __n) + { + _M_set_buffer(0); + _M_writing = true; + } + if (__ret > __buffill) + __ret -= __buffill; + else + __ret = 0; + } + else + __ret = __streambuf_type::xsputn(__s, __n); + } + else + __ret = __streambuf_type::xsputn(__s, __n); + return __ret; + } + + template + typename basic_filebuf<_CharT, _Traits>::__streambuf_type* + basic_filebuf<_CharT, _Traits>:: + setbuf(char_type* __s, streamsize __n) + { + if (!this->is_open()) + { + if (__s == 0 && __n == 0) + _M_buf_size = 1; + else if (__s && __n > 0) + { + // This is implementation-defined behavior, and assumes that + // an external char_type array of length __n exists and has + // been pre-allocated. If this is not the case, things will + // quickly blow up. When __n > 1, __n - 1 positions will be + // used for the get area, __n - 1 for the put area and 1 + // position to host the overflow char of a full put area. + // When __n == 1, 1 position will be used for the get area + // and 0 for the put area, as in the unbuffered case above. + _M_buf = __s; + _M_buf_size = __n; + } + } + return this; + } + + + // According to 27.8.1.4 p11 - 13, seekoff should ignore the last + // argument (of type openmode). + template + typename basic_filebuf<_CharT, _Traits>::pos_type + basic_filebuf<_CharT, _Traits>:: + seekoff(off_type __off, ios_base::seekdir __way, ios_base::openmode) + { + int __width = 0; + if (_M_codecvt) + __width = _M_codecvt->encoding(); + if (__width < 0) + __width = 0; + + pos_type __ret = pos_type(off_type(-1)); + const bool __testfail = __off != 0 && __width <= 0; + if (this->is_open() && !__testfail) + { + // Ditch any pback buffers to avoid confusion. + _M_destroy_pback(); + + // Correct state at destination. Note that this is the correct + // state for the current position during output, because + // codecvt::unshift() returns the state to the initial state. + // This is also the correct state at the end of the file because + // an unshift sequence should have been written at the end. + __state_type __state = _M_state_beg; + off_type __computed_off = __off * __width; + if (_M_reading && __way == ios_base::cur) + { + if (_M_codecvt->always_noconv()) + __computed_off += this->gptr() - this->egptr(); + else + { + // Calculate offset from _M_ext_buf that corresponds + // to gptr(). Note: uses _M_state_last, which + // corresponds to eback(). + const int __gptr_off = + _M_codecvt->length(_M_state_last, _M_ext_buf, _M_ext_next, + this->gptr() - this->eback()); + __computed_off += _M_ext_buf + __gptr_off - _M_ext_end; + + // _M_state_last is modified by codecvt::length() so + // it now corresponds to gptr(). + __state = _M_state_last; + } + } + __ret = _M_seek(__computed_off, __way, __state); + } + return __ret; + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 171. Strange seekpos() semantics due to joint position + // According to the resolution of DR 171, seekpos should ignore the last + // argument (of type openmode). + template + typename basic_filebuf<_CharT, _Traits>::pos_type + basic_filebuf<_CharT, _Traits>:: + seekpos(pos_type __pos, ios_base::openmode) + { + pos_type __ret = pos_type(off_type(-1)); + if (this->is_open()) + { + // Ditch any pback buffers to avoid confusion. + _M_destroy_pback(); + __ret = _M_seek(off_type(__pos), ios_base::beg, __pos.state()); + } + return __ret; + } + + template + typename basic_filebuf<_CharT, _Traits>::pos_type + basic_filebuf<_CharT, _Traits>:: + _M_seek(off_type __off, ios_base::seekdir __way, __state_type __state) + { + pos_type __ret = pos_type(off_type(-1)); + if (_M_terminate_output()) + { + // Returns pos_type(off_type(-1)) in case of failure. + __ret = pos_type(_M_file.seekoff(__off, __way)); + if (__ret != pos_type(off_type(-1))) + { + _M_reading = false; + _M_writing = false; + _M_ext_next = _M_ext_end = _M_ext_buf; + _M_set_buffer(-1); + _M_state_cur = __state; + __ret.state(_M_state_cur); + } + } + return __ret; + } + + template + bool + basic_filebuf<_CharT, _Traits>:: + _M_terminate_output() + { + // Part one: update the output sequence. + bool __testvalid = true; + if (this->pbase() < this->pptr()) + { + const int_type __tmp = this->overflow(); + if (traits_type::eq_int_type(__tmp, traits_type::eof())) + __testvalid = false; + } + + // Part two: output unshift sequence. + if (_M_writing && !__check_facet(_M_codecvt).always_noconv() + && __testvalid) + { + // Note: this value is arbitrary, since there is no way to + // get the length of the unshift sequence from codecvt, + // without calling unshift. + const size_t __blen = 128; + char __buf[__blen]; + codecvt_base::result __r; + streamsize __ilen = 0; + + do + { + char* __next; + __r = _M_codecvt->unshift(_M_state_cur, __buf, + __buf + __blen, __next); + if (__r == codecvt_base::error) + __testvalid = false; + else if (__r == codecvt_base::ok || + __r == codecvt_base::partial) + { + __ilen = __next - __buf; + if (__ilen > 0) + { + const streamsize __elen = _M_file.xsputn(__buf, __ilen); + if (__elen != __ilen) + __testvalid = false; + } + } + } + while (__r == codecvt_base::partial && __ilen > 0 && __testvalid); + + if (__testvalid) + { + // This second call to overflow() is required by the standard, + // but it's not clear why it's needed, since the output buffer + // should be empty by this point (it should have been emptied + // in the first call to overflow()). + const int_type __tmp = this->overflow(); + if (traits_type::eq_int_type(__tmp, traits_type::eof())) + __testvalid = false; + } + } + return __testvalid; + } + + template + int + basic_filebuf<_CharT, _Traits>:: + sync() + { + // Make sure that the internal buffer resyncs its idea of + // the file position with the external file. + int __ret = 0; + if (this->pbase() < this->pptr()) + { + const int_type __tmp = this->overflow(); + if (traits_type::eq_int_type(__tmp, traits_type::eof())) + __ret = -1; + } + return __ret; + } + + template + void + basic_filebuf<_CharT, _Traits>:: + imbue(const locale& __loc) + { + bool __testvalid = true; + + const __codecvt_type* _M_codecvt_tmp = 0; + if (__builtin_expect(has_facet<__codecvt_type>(__loc), true)) + _M_codecvt_tmp = &use_facet<__codecvt_type>(__loc); + + if (this->is_open()) + { + // encoding() == -1 is ok only at the beginning. + if ((_M_reading || _M_writing) + && __check_facet(_M_codecvt).encoding() == -1) + __testvalid = false; + else + { + if (_M_reading) + { + if (__check_facet(_M_codecvt).always_noconv()) + { + if (_M_codecvt_tmp + && !__check_facet(_M_codecvt_tmp).always_noconv()) + __testvalid = this->seekoff(0, ios_base::cur, _M_mode) + != pos_type(off_type(-1)); + } + else + { + // External position corresponding to gptr(). + _M_ext_next = _M_ext_buf + + _M_codecvt->length(_M_state_last, _M_ext_buf, _M_ext_next, + this->gptr() - this->eback()); + const streamsize __remainder = _M_ext_end - _M_ext_next; + if (__remainder) + __builtin_memmove(_M_ext_buf, _M_ext_next, __remainder); + + _M_ext_next = _M_ext_buf; + _M_ext_end = _M_ext_buf + __remainder; + _M_set_buffer(-1); + _M_state_last = _M_state_cur = _M_state_beg; + } + } + else if (_M_writing && (__testvalid = _M_terminate_output())) + _M_set_buffer(-1); + } + } + + if (__testvalid) + _M_codecvt = _M_codecvt_tmp; + else + _M_codecvt = 0; + } + + // Inhibit implicit instantiations for required instantiations, + // which are defined via explicit instantiations elsewhere. + // NB: This syntax is a GNU extension. +#if _GLIBCXX_EXTERN_TEMPLATE + extern template class basic_filebuf; + extern template class basic_ifstream; + extern template class basic_ofstream; + extern template class basic_fstream; + +#ifdef _GLIBCXX_USE_WCHAR_T + extern template class basic_filebuf; + extern template class basic_ifstream; + extern template class basic_ofstream; + extern template class basic_fstream; +#endif +#endif + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/functexcept.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/functexcept.h new file mode 100644 index 00000000..9315d340 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/functexcept.h @@ -0,0 +1,93 @@ +// Function-Based Exception Support -*- C++ -*- + +// Copyright (C) 2001, 2004, 2005, 2008, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file functexcept.h + * This header provides support for -fno-exceptions. + */ + +// +// ISO C++ 14882: 19.1 Exception classes +// + +#ifndef _FUNCTEXCEPT_H +#define _FUNCTEXCEPT_H 1 + +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // Helper for exception objects in + void + __throw_bad_exception(void) __attribute__((__noreturn__)); + + // Helper for exception objects in + void + __throw_bad_alloc(void) __attribute__((__noreturn__)); + + // Helper for exception objects in + void + __throw_bad_cast(void) __attribute__((__noreturn__)); + + void + __throw_bad_typeid(void) __attribute__((__noreturn__)); + + // Helpers for exception objects in + void + __throw_logic_error(const char*) __attribute__((__noreturn__)); + + void + __throw_domain_error(const char*) __attribute__((__noreturn__)); + + void + __throw_invalid_argument(const char*) __attribute__((__noreturn__)); + + void + __throw_length_error(const char*) __attribute__((__noreturn__)); + + void + __throw_out_of_range(const char*) __attribute__((__noreturn__)); + + void + __throw_runtime_error(const char*) __attribute__((__noreturn__)); + + void + __throw_range_error(const char*) __attribute__((__noreturn__)); + + void + __throw_overflow_error(const char*) __attribute__((__noreturn__)); + + void + __throw_underflow_error(const char*) __attribute__((__noreturn__)); + + // Helpers for exception objects in + void + __throw_ios_failure(const char*) __attribute__((__noreturn__)); + + void + __throw_system_error(int) __attribute__((__noreturn__)); + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/functional_hash.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/functional_hash.h new file mode 100644 index 00000000..892fcfa6 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/functional_hash.h @@ -0,0 +1,68 @@ +// functional_hash.h header -*- C++ -*- + +// Copyright (C) 2007, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file bits/functional_hash.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _FUNCTIONAL_HASH_H +#define _FUNCTIONAL_HASH_H 1 + +#pragma GCC system_header + +#ifndef __GXX_EXPERIMENTAL_CXX0X__ +# include +#endif + +#if defined(_GLIBCXX_INCLUDE_AS_TR1) +# error C++0x header cannot be included from TR1 header +#endif + +#if defined(_GLIBCXX_INCLUDE_AS_CXX0X) +# include +#else +# define _GLIBCXX_INCLUDE_AS_CXX0X +# define _GLIBCXX_BEGIN_NAMESPACE_TR1 +# define _GLIBCXX_END_NAMESPACE_TR1 +# define _GLIBCXX_TR1 +# include +# undef _GLIBCXX_TR1 +# undef _GLIBCXX_END_NAMESPACE_TR1 +# undef _GLIBCXX_BEGIN_NAMESPACE_TR1 +# undef _GLIBCXX_INCLUDE_AS_CXX0X +#endif + + +namespace std +{ + struct error_code; + + template<> + size_t + hash::operator()(error_code) const; +} + +#endif // _FUNCTIONAL_HASH_H + diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/gslice.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/gslice.h new file mode 100644 index 00000000..29ba46ac --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/gslice.h @@ -0,0 +1,182 @@ +// The template and inlines for the -*- C++ -*- gslice class. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2004, 2005, 2006, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file gslice.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// Written by Gabriel Dos Reis + +#ifndef _GSLICE_H +#define _GSLICE_H 1 + +#pragma GCC system_header + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /** + * @addtogroup numeric_arrays + * @{ + */ + + /** + * @brief Class defining multi-dimensional subset of an array. + * + * The slice class represents a multi-dimensional subset of an array, + * specified by three parameter sets: start offset, size array, and stride + * array. The start offset is the index of the first element of the array + * that is part of the subset. The size and stride array describe each + * dimension of the slice. Size is the number of elements in that + * dimension, and stride is the distance in the array between successive + * elements in that dimension. Each dimension's size and stride is taken + * to begin at an array element described by the previous dimension. The + * size array and stride array must be the same size. + * + * For example, if you have offset==3, stride[0]==11, size[1]==3, + * stride[1]==3, then slice[0,0]==array[3], slice[0,1]==array[6], + * slice[0,2]==array[9], slice[1,0]==array[14], slice[1,1]==array[17], + * slice[1,2]==array[20]. + */ + class gslice + { + public: + /// Construct an empty slice. + gslice(); + + /** + * @brief Construct a slice. + * + * Constructs a slice with as many dimensions as the length of the @a l + * and @a s arrays. + * + * @param o Offset in array of first element. + * @param l Array of dimension lengths. + * @param s Array of dimension strides between array elements. + */ + gslice(size_t, const valarray&, const valarray&); + + // XXX: the IS says the copy-ctor and copy-assignment operators are + // synthesized by the compiler but they are just unsuitable + // for a ref-counted semantic + /// Copy constructor. + gslice(const gslice&); + + /// Destructor. + ~gslice(); + + // XXX: See the note above. + /// Assignment operator. + gslice& operator=(const gslice&); + + /// Return array offset of first slice element. + size_t start() const; + + /// Return array of sizes of slice dimensions. + valarray size() const; + + /// Return array of array strides for each dimension. + valarray stride() const; + + private: + struct _Indexer + { + size_t _M_count; + size_t _M_start; + valarray _M_size; + valarray _M_stride; + valarray _M_index; // Linear array of referenced indices + + _Indexer() + : _M_count(1), _M_start(0), _M_size(), _M_stride(), _M_index() {} + + _Indexer(size_t, const valarray&, + const valarray&); + + void + _M_increment_use() + { ++_M_count; } + + size_t + _M_decrement_use() + { return --_M_count; } + }; + + _Indexer* _M_index; + + template friend class valarray; + }; + + inline size_t + gslice::start() const + { return _M_index ? _M_index->_M_start : 0; } + + inline valarray + gslice::size() const + { return _M_index ? _M_index->_M_size : valarray(); } + + inline valarray + gslice::stride() const + { return _M_index ? _M_index->_M_stride : valarray(); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 543. valarray slice default constructor + inline + gslice::gslice() + : _M_index(new gslice::_Indexer()) {} + + inline + gslice::gslice(size_t __o, const valarray& __l, + const valarray& __s) + : _M_index(new gslice::_Indexer(__o, __l, __s)) {} + + inline + gslice::gslice(const gslice& __g) + : _M_index(__g._M_index) + { if (_M_index) _M_index->_M_increment_use(); } + + inline + gslice::~gslice() + { + if (_M_index && _M_index->_M_decrement_use() == 0) + delete _M_index; + } + + inline gslice& + gslice::operator=(const gslice& __g) + { + if (__g._M_index) + __g._M_index->_M_increment_use(); + if (_M_index && _M_index->_M_decrement_use() == 0) + delete _M_index; + _M_index = __g._M_index; + return *this; + } + + // @} group numeric_arrays + +_GLIBCXX_END_NAMESPACE + +#endif /* _GSLICE_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/gslice_array.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/gslice_array.h new file mode 100644 index 00000000..745a5a83 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/gslice_array.h @@ -0,0 +1,216 @@ +// The template and inlines for the -*- C++ -*- gslice_array class. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2004, 2005, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file gslice_array.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// Written by Gabriel Dos Reis + +#ifndef _GSLICE_ARRAY_H +#define _GSLICE_ARRAY_H 1 + +#pragma GCC system_header + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /** + * @addtogroup numeric_arrays + * @{ + */ + + /** + * @brief Reference to multi-dimensional subset of an array. + * + * A gslice_array is a reference to the actual elements of an array + * specified by a gslice. The way to get a gslice_array is to call + * operator[](gslice) on a valarray. The returned gslice_array then + * permits carrying operations out on the referenced subset of elements in + * the original valarray. For example, operator+=(valarray) will add + * values to the subset of elements in the underlying valarray this + * gslice_array refers to. + * + * @param Tp Element type. + */ + template + class gslice_array + { + public: + typedef _Tp value_type; + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 253. valarray helper functions are almost entirely useless + + /// Copy constructor. Both slices refer to the same underlying array. + gslice_array(const gslice_array&); + + /// Assignment operator. Assigns slice elements to corresponding + /// elements of @a a. + gslice_array& operator=(const gslice_array&); + + /// Assign slice elements to corresponding elements of @a v. + void operator=(const valarray<_Tp>&) const; + /// Multiply slice elements by corresponding elements of @a v. + void operator*=(const valarray<_Tp>&) const; + /// Divide slice elements by corresponding elements of @a v. + void operator/=(const valarray<_Tp>&) const; + /// Modulo slice elements by corresponding elements of @a v. + void operator%=(const valarray<_Tp>&) const; + /// Add corresponding elements of @a v to slice elements. + void operator+=(const valarray<_Tp>&) const; + /// Subtract corresponding elements of @a v from slice elements. + void operator-=(const valarray<_Tp>&) const; + /// Logical xor slice elements with corresponding elements of @a v. + void operator^=(const valarray<_Tp>&) const; + /// Logical and slice elements with corresponding elements of @a v. + void operator&=(const valarray<_Tp>&) const; + /// Logical or slice elements with corresponding elements of @a v. + void operator|=(const valarray<_Tp>&) const; + /// Left shift slice elements by corresponding elements of @a v. + void operator<<=(const valarray<_Tp>&) const; + /// Right shift slice elements by corresponding elements of @a v. + void operator>>=(const valarray<_Tp>&) const; + /// Assign all slice elements to @a t. + void operator=(const _Tp&) const; + + template + void operator=(const _Expr<_Dom, _Tp>&) const; + template + void operator*=(const _Expr<_Dom, _Tp>&) const; + template + void operator/=(const _Expr<_Dom, _Tp>&) const; + template + void operator%=(const _Expr<_Dom, _Tp>&) const; + template + void operator+=(const _Expr<_Dom, _Tp>&) const; + template + void operator-=(const _Expr<_Dom, _Tp>&) const; + template + void operator^=(const _Expr<_Dom, _Tp>&) const; + template + void operator&=(const _Expr<_Dom, _Tp>&) const; + template + void operator|=(const _Expr<_Dom, _Tp>&) const; + template + void operator<<=(const _Expr<_Dom, _Tp>&) const; + template + void operator>>=(const _Expr<_Dom, _Tp>&) const; + + private: + _Array<_Tp> _M_array; + const valarray& _M_index; + + friend class valarray<_Tp>; + + gslice_array(_Array<_Tp>, const valarray&); + + // not implemented + gslice_array(); + }; + + template + inline + gslice_array<_Tp>::gslice_array(_Array<_Tp> __a, + const valarray& __i) + : _M_array(__a), _M_index(__i) {} + + template + inline + gslice_array<_Tp>::gslice_array(const gslice_array<_Tp>& __a) + : _M_array(__a._M_array), _M_index(__a._M_index) {} + + template + inline gslice_array<_Tp>& + gslice_array<_Tp>::operator=(const gslice_array<_Tp>& __a) + { + std::__valarray_copy(_Array<_Tp>(__a._M_array), + _Array(__a._M_index), _M_index.size(), + _M_array, _Array(_M_index)); + return *this; + } + + template + inline void + gslice_array<_Tp>::operator=(const _Tp& __t) const + { + std::__valarray_fill(_M_array, _Array(_M_index), + _M_index.size(), __t); + } + + template + inline void + gslice_array<_Tp>::operator=(const valarray<_Tp>& __v) const + { + std::__valarray_copy(_Array<_Tp>(__v), __v.size(), + _M_array, _Array(_M_index)); + } + + template + template + inline void + gslice_array<_Tp>::operator=(const _Expr<_Dom, _Tp>& __e) const + { + std::__valarray_copy (__e, _M_index.size(), _M_array, + _Array(_M_index)); + } + +#undef _DEFINE_VALARRAY_OPERATOR +#define _DEFINE_VALARRAY_OPERATOR(_Op, _Name) \ + template \ + inline void \ + gslice_array<_Tp>::operator _Op##=(const valarray<_Tp>& __v) const \ + { \ + _Array_augmented_##_Name(_M_array, _Array(_M_index), \ + _Array<_Tp>(__v), __v.size()); \ + } \ + \ + template \ + template \ + inline void \ + gslice_array<_Tp>::operator _Op##= (const _Expr<_Dom, _Tp>& __e) const\ + { \ + _Array_augmented_##_Name(_M_array, _Array(_M_index), __e,\ + _M_index.size()); \ + } + +_DEFINE_VALARRAY_OPERATOR(*, __multiplies) +_DEFINE_VALARRAY_OPERATOR(/, __divides) +_DEFINE_VALARRAY_OPERATOR(%, __modulus) +_DEFINE_VALARRAY_OPERATOR(+, __plus) +_DEFINE_VALARRAY_OPERATOR(-, __minus) +_DEFINE_VALARRAY_OPERATOR(^, __bitwise_xor) +_DEFINE_VALARRAY_OPERATOR(&, __bitwise_and) +_DEFINE_VALARRAY_OPERATOR(|, __bitwise_or) +_DEFINE_VALARRAY_OPERATOR(<<, __shift_left) +_DEFINE_VALARRAY_OPERATOR(>>, __shift_right) + +#undef _DEFINE_VALARRAY_OPERATOR + + // @} group numeric_arrays + +_GLIBCXX_END_NAMESPACE + +#endif /* _GSLICE_ARRAY_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/hashtable.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/hashtable.h new file mode 100644 index 00000000..cdfa8af3 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/hashtable.h @@ -0,0 +1,58 @@ +// hashtable.h header -*- C++ -*- + +// Copyright (C) 2007, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file bits/hashtable.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _HASHTABLE_H +#define _HASHTABLE_H 1 + +#pragma GCC system_header + +#ifndef __GXX_EXPERIMENTAL_CXX0X__ +# include +#endif + +#if defined(_GLIBCXX_INCLUDE_AS_TR1) +# error C++0x header cannot be included from TR1 header +#endif + +#if defined(_GLIBCXX_INCLUDE_AS_CXX0X) +# include +#else +# define _GLIBCXX_INCLUDE_AS_CXX0X +# define _GLIBCXX_BEGIN_NAMESPACE_TR1 +# define _GLIBCXX_END_NAMESPACE_TR1 +# define _GLIBCXX_TR1 +# include +# undef _GLIBCXX_TR1 +# undef _GLIBCXX_END_NAMESPACE_TR1 +# undef _GLIBCXX_END_NAMESPACE_TR1 +# undef _GLIBCXX_INCLUDE_AS_CXX0X +#endif + +#endif // _HASHTABLE_H + diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/indirect_array.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/indirect_array.h new file mode 100644 index 00000000..4920394b --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/indirect_array.h @@ -0,0 +1,210 @@ +// The template and inlines for the -*- C++ -*- indirect_array class. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2004, 2005, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file indirect_array.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// Written by Gabriel Dos Reis + +#ifndef _INDIRECT_ARRAY_H +#define _INDIRECT_ARRAY_H 1 + +#pragma GCC system_header + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /** + * @addtogroup numeric_arrays + * @{ + */ + + /** + * @brief Reference to arbitrary subset of an array. + * + * An indirect_array is a reference to the actual elements of an array + * specified by an ordered array of indices. The way to get an + * indirect_array is to call operator[](valarray) on a valarray. + * The returned indirect_array then permits carrying operations out on the + * referenced subset of elements in the original valarray. + * + * For example, if an indirect_array is obtained using the array (4,2,0) as + * an argument, and then assigned to an array containing (1,2,3), then the + * underlying array will have array[0]==3, array[2]==2, and array[4]==1. + * + * @param Tp Element type. + */ + template + class indirect_array + { + public: + typedef _Tp value_type; + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 253. valarray helper functions are almost entirely useless + + /// Copy constructor. Both slices refer to the same underlying array. + indirect_array(const indirect_array&); + + /// Assignment operator. Assigns elements to corresponding elements + /// of @a a. + indirect_array& operator=(const indirect_array&); + + /// Assign slice elements to corresponding elements of @a v. + void operator=(const valarray<_Tp>&) const; + /// Multiply slice elements by corresponding elements of @a v. + void operator*=(const valarray<_Tp>&) const; + /// Divide slice elements by corresponding elements of @a v. + void operator/=(const valarray<_Tp>&) const; + /// Modulo slice elements by corresponding elements of @a v. + void operator%=(const valarray<_Tp>&) const; + /// Add corresponding elements of @a v to slice elements. + void operator+=(const valarray<_Tp>&) const; + /// Subtract corresponding elements of @a v from slice elements. + void operator-=(const valarray<_Tp>&) const; + /// Logical xor slice elements with corresponding elements of @a v. + void operator^=(const valarray<_Tp>&) const; + /// Logical and slice elements with corresponding elements of @a v. + void operator&=(const valarray<_Tp>&) const; + /// Logical or slice elements with corresponding elements of @a v. + void operator|=(const valarray<_Tp>&) const; + /// Left shift slice elements by corresponding elements of @a v. + void operator<<=(const valarray<_Tp>&) const; + /// Right shift slice elements by corresponding elements of @a v. + void operator>>=(const valarray<_Tp>&) const; + /// Assign all slice elements to @a t. + void operator= (const _Tp&) const; + // ~indirect_array(); + + template + void operator=(const _Expr<_Dom, _Tp>&) const; + template + void operator*=(const _Expr<_Dom, _Tp>&) const; + template + void operator/=(const _Expr<_Dom, _Tp>&) const; + template + void operator%=(const _Expr<_Dom, _Tp>&) const; + template + void operator+=(const _Expr<_Dom, _Tp>&) const; + template + void operator-=(const _Expr<_Dom, _Tp>&) const; + template + void operator^=(const _Expr<_Dom, _Tp>&) const; + template + void operator&=(const _Expr<_Dom, _Tp>&) const; + template + void operator|=(const _Expr<_Dom, _Tp>&) const; + template + void operator<<=(const _Expr<_Dom, _Tp>&) const; + template + void operator>>=(const _Expr<_Dom, _Tp>&) const; + + private: + /// Copy constructor. Both slices refer to the same underlying array. + indirect_array(_Array<_Tp>, size_t, _Array); + + friend class valarray<_Tp>; + friend class gslice_array<_Tp>; + + const size_t _M_sz; + const _Array _M_index; + const _Array<_Tp> _M_array; + + // not implemented + indirect_array(); + }; + + template + inline + indirect_array<_Tp>::indirect_array(const indirect_array<_Tp>& __a) + : _M_sz(__a._M_sz), _M_index(__a._M_index), _M_array(__a._M_array) {} + + template + inline + indirect_array<_Tp>::indirect_array(_Array<_Tp> __a, size_t __s, + _Array __i) + : _M_sz(__s), _M_index(__i), _M_array(__a) {} + + template + inline indirect_array<_Tp>& + indirect_array<_Tp>::operator=(const indirect_array<_Tp>& __a) + { + std::__valarray_copy(__a._M_array, _M_sz, __a._M_index, _M_array, + _M_index); + return *this; + } + + template + inline void + indirect_array<_Tp>::operator=(const _Tp& __t) const + { std::__valarray_fill(_M_array, _M_index, _M_sz, __t); } + + template + inline void + indirect_array<_Tp>::operator=(const valarray<_Tp>& __v) const + { std::__valarray_copy(_Array<_Tp>(__v), _M_sz, _M_array, _M_index); } + + template + template + inline void + indirect_array<_Tp>::operator=(const _Expr<_Dom, _Tp>& __e) const + { std::__valarray_copy(__e, _M_sz, _M_array, _M_index); } + +#undef _DEFINE_VALARRAY_OPERATOR +#define _DEFINE_VALARRAY_OPERATOR(_Op, _Name) \ + template \ + inline void \ + indirect_array<_Tp>::operator _Op##=(const valarray<_Tp>& __v) const\ + { \ + _Array_augmented_##_Name(_M_array, _M_index, _Array<_Tp>(__v), _M_sz); \ + } \ + \ + template \ + template \ + inline void \ + indirect_array<_Tp>::operator _Op##=(const _Expr<_Dom,_Tp>& __e) const\ + { \ + _Array_augmented_##_Name(_M_array, _M_index, __e, _M_sz); \ + } + +_DEFINE_VALARRAY_OPERATOR(*, __multiplies) +_DEFINE_VALARRAY_OPERATOR(/, __divides) +_DEFINE_VALARRAY_OPERATOR(%, __modulus) +_DEFINE_VALARRAY_OPERATOR(+, __plus) +_DEFINE_VALARRAY_OPERATOR(-, __minus) +_DEFINE_VALARRAY_OPERATOR(^, __bitwise_xor) +_DEFINE_VALARRAY_OPERATOR(&, __bitwise_and) +_DEFINE_VALARRAY_OPERATOR(|, __bitwise_or) +_DEFINE_VALARRAY_OPERATOR(<<, __shift_left) +_DEFINE_VALARRAY_OPERATOR(>>, __shift_right) + +#undef _DEFINE_VALARRAY_OPERATOR + + // @} group numeric_arrays + +_GLIBCXX_END_NAMESPACE + +#endif /* _INDIRECT_ARRAY_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/ios_base.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/ios_base.h new file mode 100644 index 00000000..8dde1003 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/ios_base.h @@ -0,0 +1,982 @@ +// Iostreams base classes -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file ios_base.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 27.4 Iostreams base classes +// + +#ifndef _IOS_BASE_H +#define _IOS_BASE_H 1 + +#pragma GCC system_header + +#include +#include +#include + +#ifndef _GLIBCXX_STDIO_MACROS +# include // For SEEK_CUR, SEEK_END +# define _IOS_BASE_SEEK_CUR SEEK_CUR +# define _IOS_BASE_SEEK_END SEEK_END +#else +# define _IOS_BASE_SEEK_CUR 1 +# define _IOS_BASE_SEEK_END 2 +#endif + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // The following definitions of bitmask types are enums, not ints, + // as permitted (but not required) in the standard, in order to provide + // better type safety in iostream calls. A side effect is that + // expressions involving them are no longer compile-time constants. + enum _Ios_Fmtflags + { + _S_boolalpha = 1L << 0, + _S_dec = 1L << 1, + _S_fixed = 1L << 2, + _S_hex = 1L << 3, + _S_internal = 1L << 4, + _S_left = 1L << 5, + _S_oct = 1L << 6, + _S_right = 1L << 7, + _S_scientific = 1L << 8, + _S_showbase = 1L << 9, + _S_showpoint = 1L << 10, + _S_showpos = 1L << 11, + _S_skipws = 1L << 12, + _S_unitbuf = 1L << 13, + _S_uppercase = 1L << 14, + _S_adjustfield = _S_left | _S_right | _S_internal, + _S_basefield = _S_dec | _S_oct | _S_hex, + _S_floatfield = _S_scientific | _S_fixed, + _S_ios_fmtflags_end = 1L << 16 + }; + + inline _Ios_Fmtflags + operator&(_Ios_Fmtflags __a, _Ios_Fmtflags __b) + { return _Ios_Fmtflags(static_cast(__a) & static_cast(__b)); } + + inline _Ios_Fmtflags + operator|(_Ios_Fmtflags __a, _Ios_Fmtflags __b) + { return _Ios_Fmtflags(static_cast(__a) | static_cast(__b)); } + + inline _Ios_Fmtflags + operator^(_Ios_Fmtflags __a, _Ios_Fmtflags __b) + { return _Ios_Fmtflags(static_cast(__a) ^ static_cast(__b)); } + + inline _Ios_Fmtflags& + operator|=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b) + { return __a = __a | __b; } + + inline _Ios_Fmtflags& + operator&=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b) + { return __a = __a & __b; } + + inline _Ios_Fmtflags& + operator^=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b) + { return __a = __a ^ __b; } + + inline _Ios_Fmtflags + operator~(_Ios_Fmtflags __a) + { return _Ios_Fmtflags(~static_cast(__a)); } + + + enum _Ios_Openmode + { + _S_app = 1L << 0, + _S_ate = 1L << 1, + _S_bin = 1L << 2, + _S_in = 1L << 3, + _S_out = 1L << 4, + _S_trunc = 1L << 5, + _S_ios_openmode_end = 1L << 16 + }; + + inline _Ios_Openmode + operator&(_Ios_Openmode __a, _Ios_Openmode __b) + { return _Ios_Openmode(static_cast(__a) & static_cast(__b)); } + + inline _Ios_Openmode + operator|(_Ios_Openmode __a, _Ios_Openmode __b) + { return _Ios_Openmode(static_cast(__a) | static_cast(__b)); } + + inline _Ios_Openmode + operator^(_Ios_Openmode __a, _Ios_Openmode __b) + { return _Ios_Openmode(static_cast(__a) ^ static_cast(__b)); } + + inline _Ios_Openmode& + operator|=(_Ios_Openmode& __a, _Ios_Openmode __b) + { return __a = __a | __b; } + + inline _Ios_Openmode& + operator&=(_Ios_Openmode& __a, _Ios_Openmode __b) + { return __a = __a & __b; } + + inline _Ios_Openmode& + operator^=(_Ios_Openmode& __a, _Ios_Openmode __b) + { return __a = __a ^ __b; } + + inline _Ios_Openmode + operator~(_Ios_Openmode __a) + { return _Ios_Openmode(~static_cast(__a)); } + + + enum _Ios_Iostate + { + _S_goodbit = 0, + _S_badbit = 1L << 0, + _S_eofbit = 1L << 1, + _S_failbit = 1L << 2, + _S_ios_iostate_end = 1L << 16 + }; + + inline _Ios_Iostate + operator&(_Ios_Iostate __a, _Ios_Iostate __b) + { return _Ios_Iostate(static_cast(__a) & static_cast(__b)); } + + inline _Ios_Iostate + operator|(_Ios_Iostate __a, _Ios_Iostate __b) + { return _Ios_Iostate(static_cast(__a) | static_cast(__b)); } + + inline _Ios_Iostate + operator^(_Ios_Iostate __a, _Ios_Iostate __b) + { return _Ios_Iostate(static_cast(__a) ^ static_cast(__b)); } + + inline _Ios_Iostate& + operator|=(_Ios_Iostate& __a, _Ios_Iostate __b) + { return __a = __a | __b; } + + inline _Ios_Iostate& + operator&=(_Ios_Iostate& __a, _Ios_Iostate __b) + { return __a = __a & __b; } + + inline _Ios_Iostate& + operator^=(_Ios_Iostate& __a, _Ios_Iostate __b) + { return __a = __a ^ __b; } + + inline _Ios_Iostate + operator~(_Ios_Iostate __a) + { return _Ios_Iostate(~static_cast(__a)); } + + enum _Ios_Seekdir + { + _S_beg = 0, + _S_cur = _IOS_BASE_SEEK_CUR, + _S_end = _IOS_BASE_SEEK_END, + _S_ios_seekdir_end = 1L << 16 + }; + + // 27.4.2 Class ios_base + /** + * @brief The base of the I/O class hierarchy. + * @ingroup io + * + * This class defines everything that can be defined about I/O that does + * not depend on the type of characters being input or output. Most + * people will only see @c ios_base when they need to specify the full + * name of the various I/O flags (e.g., the openmodes). + */ + class ios_base + { + public: + + /** + * @brief These are thrown to indicate problems with io. + * @ingroup exceptions + * + * 27.4.2.1.1 Class ios_base::failure + */ + class failure : public exception + { + public: + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 48. Use of non-existent exception constructor + explicit + failure(const string& __str) throw(); + + // This declaration is not useless: + // http://gcc.gnu.org/onlinedocs/gcc-4.3.2/gcc/Vague-Linkage.html + virtual + ~failure() throw(); + + virtual const char* + what() const throw(); + + private: + string _M_msg; + }; + + // 27.4.2.1.2 Type ios_base::fmtflags + /** + * @brief This is a bitmask type. + * + * @c "_Ios_Fmtflags" is implementation-defined, but it is valid to + * perform bitwise operations on these values and expect the Right + * Thing to happen. Defined objects of type fmtflags are: + * - boolalpha + * - dec + * - fixed + * - hex + * - internal + * - left + * - oct + * - right + * - scientific + * - showbase + * - showpoint + * - showpos + * - skipws + * - unitbuf + * - uppercase + * - adjustfield + * - basefield + * - floatfield + */ + typedef _Ios_Fmtflags fmtflags; + + /// Insert/extract @c bool in alphabetic rather than numeric format. + static const fmtflags boolalpha = _S_boolalpha; + + /// Converts integer input or generates integer output in decimal base. + static const fmtflags dec = _S_dec; + + /// Generate floating-point output in fixed-point notation. + static const fmtflags fixed = _S_fixed; + + /// Converts integer input or generates integer output in hexadecimal base. + static const fmtflags hex = _S_hex; + + /// Adds fill characters at a designated internal point in certain + /// generated output, or identical to @c right if no such point is + /// designated. + static const fmtflags internal = _S_internal; + + /// Adds fill characters on the right (final positions) of certain + /// generated output. (I.e., the thing you print is flush left.) + static const fmtflags left = _S_left; + + /// Converts integer input or generates integer output in octal base. + static const fmtflags oct = _S_oct; + + /// Adds fill characters on the left (initial positions) of certain + /// generated output. (I.e., the thing you print is flush right.) + static const fmtflags right = _S_right; + + /// Generates floating-point output in scientific notation. + static const fmtflags scientific = _S_scientific; + + /// Generates a prefix indicating the numeric base of generated integer + /// output. + static const fmtflags showbase = _S_showbase; + + /// Generates a decimal-point character unconditionally in generated + /// floating-point output. + static const fmtflags showpoint = _S_showpoint; + + /// Generates a + sign in non-negative generated numeric output. + static const fmtflags showpos = _S_showpos; + + /// Skips leading white space before certain input operations. + static const fmtflags skipws = _S_skipws; + + /// Flushes output after each output operation. + static const fmtflags unitbuf = _S_unitbuf; + + /// Replaces certain lowercase letters with their uppercase equivalents + /// in generated output. + static const fmtflags uppercase = _S_uppercase; + + /// A mask of left|right|internal. Useful for the 2-arg form of @c setf. + static const fmtflags adjustfield = _S_adjustfield; + + /// A mask of dec|oct|hex. Useful for the 2-arg form of @c setf. + static const fmtflags basefield = _S_basefield; + + /// A mask of scientific|fixed. Useful for the 2-arg form of @c setf. + static const fmtflags floatfield = _S_floatfield; + + // 27.4.2.1.3 Type ios_base::iostate + /** + * @brief This is a bitmask type. + * + * @c "_Ios_Iostate" is implementation-defined, but it is valid to + * perform bitwise operations on these values and expect the Right + * Thing to happen. Defined objects of type iostate are: + * - badbit + * - eofbit + * - failbit + * - goodbit + */ + typedef _Ios_Iostate iostate; + + /// Indicates a loss of integrity in an input or output sequence (such + /// as an irrecoverable read error from a file). + static const iostate badbit = _S_badbit; + + /// Indicates that an input operation reached the end of an input sequence. + static const iostate eofbit = _S_eofbit; + + /// Indicates that an input operation failed to read the expected + /// characters, or that an output operation failed to generate the + /// desired characters. + static const iostate failbit = _S_failbit; + + /// Indicates all is well. + static const iostate goodbit = _S_goodbit; + + // 27.4.2.1.4 Type ios_base::openmode + /** + * @brief This is a bitmask type. + * + * @c "_Ios_Openmode" is implementation-defined, but it is valid to + * perform bitwise operations on these values and expect the Right + * Thing to happen. Defined objects of type openmode are: + * - app + * - ate + * - binary + * - in + * - out + * - trunc + */ + typedef _Ios_Openmode openmode; + + /// Seek to end before each write. + static const openmode app = _S_app; + + /// Open and seek to end immediately after opening. + static const openmode ate = _S_ate; + + /// Perform input and output in binary mode (as opposed to text mode). + /// This is probably not what you think it is; see + /// http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt11ch27s02.html + static const openmode binary = _S_bin; + + /// Open for input. Default for @c ifstream and fstream. + static const openmode in = _S_in; + + /// Open for output. Default for @c ofstream and fstream. + static const openmode out = _S_out; + + /// Open for input. Default for @c ofstream. + static const openmode trunc = _S_trunc; + + // 27.4.2.1.5 Type ios_base::seekdir + /** + * @brief This is an enumerated type. + * + * @c "_Ios_Seekdir" is implementation-defined. Defined values + * of type seekdir are: + * - beg + * - cur, equivalent to @c SEEK_CUR in the C standard library. + * - end, equivalent to @c SEEK_END in the C standard library. + */ + typedef _Ios_Seekdir seekdir; + + /// Request a seek relative to the beginning of the stream. + static const seekdir beg = _S_beg; + + /// Request a seek relative to the current position within the sequence. + static const seekdir cur = _S_cur; + + /// Request a seek relative to the current end of the sequence. + static const seekdir end = _S_end; + + // Annex D.6 + typedef int io_state; + typedef int open_mode; + typedef int seek_dir; + + typedef std::streampos streampos; + typedef std::streamoff streamoff; + + // Callbacks; + /** + * @brief The set of events that may be passed to an event callback. + * + * erase_event is used during ~ios() and copyfmt(). imbue_event is used + * during imbue(). copyfmt_event is used during copyfmt(). + */ + enum event + { + erase_event, + imbue_event, + copyfmt_event + }; + + /** + * @brief The type of an event callback function. + * @param event One of the members of the event enum. + * @param ios_base Reference to the ios_base object. + * @param int The integer provided when the callback was registered. + * + * Event callbacks are user defined functions that get called during + * several ios_base and basic_ios functions, specifically imbue(), + * copyfmt(), and ~ios(). + */ + typedef void (*event_callback) (event, ios_base&, int); + + /** + * @brief Add the callback __fn with parameter __index. + * @param __fn The function to add. + * @param __index The integer to pass to the function when invoked. + * + * Registers a function as an event callback with an integer parameter to + * be passed to the function when invoked. Multiple copies of the + * function are allowed. If there are multiple callbacks, they are + * invoked in the order they were registered. + */ + void + register_callback(event_callback __fn, int __index); + + protected: + //@{ + /** + * ios_base data members (doc me) + */ + streamsize _M_precision; + streamsize _M_width; + fmtflags _M_flags; + iostate _M_exception; + iostate _M_streambuf_state; + //@} + + // 27.4.2.6 Members for callbacks + // 27.4.2.6 ios_base callbacks + struct _Callback_list + { + // Data Members + _Callback_list* _M_next; + ios_base::event_callback _M_fn; + int _M_index; + _Atomic_word _M_refcount; // 0 means one reference. + + _Callback_list(ios_base::event_callback __fn, int __index, + _Callback_list* __cb) + : _M_next(__cb), _M_fn(__fn), _M_index(__index), _M_refcount(0) { } + + void + _M_add_reference() { __gnu_cxx::__atomic_add_dispatch(&_M_refcount, 1); } + + // 0 => OK to delete. + int + _M_remove_reference() + { return __gnu_cxx::__exchange_and_add_dispatch(&_M_refcount, -1); } + }; + + _Callback_list* _M_callbacks; + + void + _M_call_callbacks(event __ev) throw(); + + void + _M_dispose_callbacks(void); + + // 27.4.2.5 Members for iword/pword storage + struct _Words + { + void* _M_pword; + long _M_iword; + _Words() : _M_pword(0), _M_iword(0) { } + }; + + // Only for failed iword/pword calls. + _Words _M_word_zero; + + // Guaranteed storage. + // The first 5 iword and pword slots are reserved for internal use. + enum { _S_local_word_size = 8 }; + _Words _M_local_word[_S_local_word_size]; + + // Allocated storage. + int _M_word_size; + _Words* _M_word; + + _Words& + _M_grow_words(int __index, bool __iword); + + // Members for locale and locale caching. + locale _M_ios_locale; + + void + _M_init(); + + public: + + // 27.4.2.1.6 Class ios_base::Init + // Used to initialize standard streams. In theory, g++ could use + // -finit-priority to order this stuff correctly without going + // through these machinations. + class Init + { + friend class ios_base; + public: + Init(); + ~Init(); + + private: + static _Atomic_word _S_refcount; + static bool _S_synced_with_stdio; + }; + + // [27.4.2.2] fmtflags state functions + /** + * @brief Access to format flags. + * @return The format control flags for both input and output. + */ + fmtflags + flags() const + { return _M_flags; } + + /** + * @brief Setting new format flags all at once. + * @param fmtfl The new flags to set. + * @return The previous format control flags. + * + * This function overwrites all the format flags with @a fmtfl. + */ + fmtflags + flags(fmtflags __fmtfl) + { + fmtflags __old = _M_flags; + _M_flags = __fmtfl; + return __old; + } + + /** + * @brief Setting new format flags. + * @param fmtfl Additional flags to set. + * @return The previous format control flags. + * + * This function sets additional flags in format control. Flags that + * were previously set remain set. + */ + fmtflags + setf(fmtflags __fmtfl) + { + fmtflags __old = _M_flags; + _M_flags |= __fmtfl; + return __old; + } + + /** + * @brief Setting new format flags. + * @param fmtfl Additional flags to set. + * @param mask The flags mask for @a fmtfl. + * @return The previous format control flags. + * + * This function clears @a mask in the format flags, then sets + * @a fmtfl @c & @a mask. An example mask is @c ios_base::adjustfield. + */ + fmtflags + setf(fmtflags __fmtfl, fmtflags __mask) + { + fmtflags __old = _M_flags; + _M_flags &= ~__mask; + _M_flags |= (__fmtfl & __mask); + return __old; + } + + /** + * @brief Clearing format flags. + * @param mask The flags to unset. + * + * This function clears @a mask in the format flags. + */ + void + unsetf(fmtflags __mask) + { _M_flags &= ~__mask; } + + /** + * @brief Flags access. + * @return The precision to generate on certain output operations. + * + * Be careful if you try to give a definition of "precision" here; see + * DR 189. + */ + streamsize + precision() const + { return _M_precision; } + + /** + * @brief Changing flags. + * @param prec The new precision value. + * @return The previous value of precision(). + */ + streamsize + precision(streamsize __prec) + { + streamsize __old = _M_precision; + _M_precision = __prec; + return __old; + } + + /** + * @brief Flags access. + * @return The minimum field width to generate on output operations. + * + * "Minimum field width" refers to the number of characters. + */ + streamsize + width() const + { return _M_width; } + + /** + * @brief Changing flags. + * @param wide The new width value. + * @return The previous value of width(). + */ + streamsize + width(streamsize __wide) + { + streamsize __old = _M_width; + _M_width = __wide; + return __old; + } + + // [27.4.2.4] ios_base static members + /** + * @brief Interaction with the standard C I/O objects. + * @param sync Whether to synchronize or not. + * @return True if the standard streams were previously synchronized. + * + * The synchronization referred to is @e only that between the standard + * C facilities (e.g., stdout) and the standard C++ objects (e.g., + * cout). User-declared streams are unaffected. See + * http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt11ch28s02.html + */ + static bool + sync_with_stdio(bool __sync = true); + + // [27.4.2.3] ios_base locale functions + /** + * @brief Setting a new locale. + * @param loc The new locale. + * @return The previous locale. + * + * Sets the new locale for this stream, and then invokes each callback + * with imbue_event. + */ + locale + imbue(const locale& __loc); + + /** + * @brief Locale access + * @return A copy of the current locale. + * + * If @c imbue(loc) has previously been called, then this function + * returns @c loc. Otherwise, it returns a copy of @c std::locale(), + * the global C++ locale. + */ + locale + getloc() const + { return _M_ios_locale; } + + /** + * @brief Locale access + * @return A reference to the current locale. + * + * Like getloc above, but returns a reference instead of + * generating a copy. + */ + const locale& + _M_getloc() const + { return _M_ios_locale; } + + // [27.4.2.5] ios_base storage functions + /** + * @brief Access to unique indices. + * @return An integer different from all previous calls. + * + * This function returns a unique integer every time it is called. It + * can be used for any purpose, but is primarily intended to be a unique + * index for the iword and pword functions. The expectation is that an + * application calls xalloc in order to obtain an index in the iword and + * pword arrays that can be used without fear of conflict. + * + * The implementation maintains a static variable that is incremented and + * returned on each invocation. xalloc is guaranteed to return an index + * that is safe to use in the iword and pword arrays. + */ + static int + xalloc() throw(); + + /** + * @brief Access to integer array. + * @param __ix Index into the array. + * @return A reference to an integer associated with the index. + * + * The iword function provides access to an array of integers that can be + * used for any purpose. The array grows as required to hold the + * supplied index. All integers in the array are initialized to 0. + * + * The implementation reserves several indices. You should use xalloc to + * obtain an index that is safe to use. Also note that since the array + * can grow dynamically, it is not safe to hold onto the reference. + */ + long& + iword(int __ix) + { + _Words& __word = (__ix < _M_word_size) + ? _M_word[__ix] : _M_grow_words(__ix, true); + return __word._M_iword; + } + + /** + * @brief Access to void pointer array. + * @param __ix Index into the array. + * @return A reference to a void* associated with the index. + * + * The pword function provides access to an array of pointers that can be + * used for any purpose. The array grows as required to hold the + * supplied index. All pointers in the array are initialized to 0. + * + * The implementation reserves several indices. You should use xalloc to + * obtain an index that is safe to use. Also note that since the array + * can grow dynamically, it is not safe to hold onto the reference. + */ + void*& + pword(int __ix) + { + _Words& __word = (__ix < _M_word_size) + ? _M_word[__ix] : _M_grow_words(__ix, false); + return __word._M_pword; + } + + // Destructor + /** + * Invokes each callback with erase_event. Destroys local storage. + * + * Note that the ios_base object for the standard streams never gets + * destroyed. As a result, any callbacks registered with the standard + * streams will not get invoked with erase_event (unless copyfmt is + * used). + */ + virtual ~ios_base(); + + protected: + ios_base(); + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 50. Copy constructor and assignment operator of ios_base + private: + ios_base(const ios_base&); + + ios_base& + operator=(const ios_base&); + }; + + // [27.4.5.1] fmtflags manipulators + /// Calls base.setf(ios_base::boolalpha). + inline ios_base& + boolalpha(ios_base& __base) + { + __base.setf(ios_base::boolalpha); + return __base; + } + + /// Calls base.unsetf(ios_base::boolalpha). + inline ios_base& + noboolalpha(ios_base& __base) + { + __base.unsetf(ios_base::boolalpha); + return __base; + } + + /// Calls base.setf(ios_base::showbase). + inline ios_base& + showbase(ios_base& __base) + { + __base.setf(ios_base::showbase); + return __base; + } + + /// Calls base.unsetf(ios_base::showbase). + inline ios_base& + noshowbase(ios_base& __base) + { + __base.unsetf(ios_base::showbase); + return __base; + } + + /// Calls base.setf(ios_base::showpoint). + inline ios_base& + showpoint(ios_base& __base) + { + __base.setf(ios_base::showpoint); + return __base; + } + + /// Calls base.unsetf(ios_base::showpoint). + inline ios_base& + noshowpoint(ios_base& __base) + { + __base.unsetf(ios_base::showpoint); + return __base; + } + + /// Calls base.setf(ios_base::showpos). + inline ios_base& + showpos(ios_base& __base) + { + __base.setf(ios_base::showpos); + return __base; + } + + /// Calls base.unsetf(ios_base::showpos). + inline ios_base& + noshowpos(ios_base& __base) + { + __base.unsetf(ios_base::showpos); + return __base; + } + + /// Calls base.setf(ios_base::skipws). + inline ios_base& + skipws(ios_base& __base) + { + __base.setf(ios_base::skipws); + return __base; + } + + /// Calls base.unsetf(ios_base::skipws). + inline ios_base& + noskipws(ios_base& __base) + { + __base.unsetf(ios_base::skipws); + return __base; + } + + /// Calls base.setf(ios_base::uppercase). + inline ios_base& + uppercase(ios_base& __base) + { + __base.setf(ios_base::uppercase); + return __base; + } + + /// Calls base.unsetf(ios_base::uppercase). + inline ios_base& + nouppercase(ios_base& __base) + { + __base.unsetf(ios_base::uppercase); + return __base; + } + + /// Calls base.setf(ios_base::unitbuf). + inline ios_base& + unitbuf(ios_base& __base) + { + __base.setf(ios_base::unitbuf); + return __base; + } + + /// Calls base.unsetf(ios_base::unitbuf). + inline ios_base& + nounitbuf(ios_base& __base) + { + __base.unsetf(ios_base::unitbuf); + return __base; + } + + // [27.4.5.2] adjustfield manipulators + /// Calls base.setf(ios_base::internal, ios_base::adjustfield). + inline ios_base& + internal(ios_base& __base) + { + __base.setf(ios_base::internal, ios_base::adjustfield); + return __base; + } + + /// Calls base.setf(ios_base::left, ios_base::adjustfield). + inline ios_base& + left(ios_base& __base) + { + __base.setf(ios_base::left, ios_base::adjustfield); + return __base; + } + + /// Calls base.setf(ios_base::right, ios_base::adjustfield). + inline ios_base& + right(ios_base& __base) + { + __base.setf(ios_base::right, ios_base::adjustfield); + return __base; + } + + // [27.4.5.3] basefield manipulators + /// Calls base.setf(ios_base::dec, ios_base::basefield). + inline ios_base& + dec(ios_base& __base) + { + __base.setf(ios_base::dec, ios_base::basefield); + return __base; + } + + /// Calls base.setf(ios_base::hex, ios_base::basefield). + inline ios_base& + hex(ios_base& __base) + { + __base.setf(ios_base::hex, ios_base::basefield); + return __base; + } + + /// Calls base.setf(ios_base::oct, ios_base::basefield). + inline ios_base& + oct(ios_base& __base) + { + __base.setf(ios_base::oct, ios_base::basefield); + return __base; + } + + // [27.4.5.4] floatfield manipulators + /// Calls base.setf(ios_base::fixed, ios_base::floatfield). + inline ios_base& + fixed(ios_base& __base) + { + __base.setf(ios_base::fixed, ios_base::floatfield); + return __base; + } + + /// Calls base.setf(ios_base::scientific, ios_base::floatfield). + inline ios_base& + scientific(ios_base& __base) + { + __base.setf(ios_base::scientific, ios_base::floatfield); + return __base; + } + +_GLIBCXX_END_NAMESPACE + +#undef _IOS_BASE_SEEK_CUR +#undef _IOS_BASE_SEEK_END + +#endif /* _IOS_BASE_H */ + diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/istream.tcc b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/istream.tcc new file mode 100644 index 00000000..5d60791e --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/istream.tcc @@ -0,0 +1,1022 @@ +// istream classes -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file istream.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 27.6.1 Input streams +// + +#ifndef _ISTREAM_TCC +#define _ISTREAM_TCC 1 + +#pragma GCC system_header + +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + template + basic_istream<_CharT, _Traits>::sentry:: + sentry(basic_istream<_CharT, _Traits>& __in, bool __noskip) : _M_ok(false) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + if (__in.good()) + { + if (__in.tie()) + __in.tie()->flush(); + if (!__noskip && bool(__in.flags() & ios_base::skipws)) + { + const __int_type __eof = traits_type::eof(); + __streambuf_type* __sb = __in.rdbuf(); + __int_type __c = __sb->sgetc(); + + const __ctype_type& __ct = __check_facet(__in._M_ctype); + while (!traits_type::eq_int_type(__c, __eof) + && __ct.is(ctype_base::space, + traits_type::to_char_type(__c))) + __c = __sb->snextc(); + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 195. Should basic_istream::sentry's constructor ever + // set eofbit? + if (traits_type::eq_int_type(__c, __eof)) + __err |= ios_base::eofbit; + } + } + + if (__in.good() && __err == ios_base::goodbit) + _M_ok = true; + else + { + __err |= ios_base::failbit; + __in.setstate(__err); + } + } + + template + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + _M_extract(_ValueT& __v) + { + sentry __cerb(*this, false); + if (__cerb) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + __try + { + const __num_get_type& __ng = __check_facet(this->_M_num_get); + __ng.get(*this, 0, *this, __err, __v); + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + } + return *this; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + operator>>(short& __n) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 118. basic_istream uses nonexistent num_get member functions. + long __l; + _M_extract(__l); + if (!this->fail()) + { + if (__gnu_cxx::__numeric_traits::__min <= __l + && __l <= __gnu_cxx::__numeric_traits::__max) + __n = short(__l); + else + this->setstate(ios_base::failbit); + } + return *this; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + operator>>(int& __n) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 118. basic_istream uses nonexistent num_get member functions. + long __l; + _M_extract(__l); + if (!this->fail()) + { + if (__gnu_cxx::__numeric_traits::__min <= __l + && __l <= __gnu_cxx::__numeric_traits::__max) + __n = int(__l); + else + this->setstate(ios_base::failbit); + } + return *this; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + operator>>(__streambuf_type* __sbout) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + sentry __cerb(*this, false); + if (__cerb && __sbout) + { + __try + { + bool __ineof; + if (!__copy_streambufs_eof(this->rdbuf(), __sbout, __ineof)) + __err |= ios_base::failbit; + if (__ineof) + __err |= ios_base::eofbit; + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::failbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::failbit); } + } + else if (!__sbout) + __err |= ios_base::failbit; + if (__err) + this->setstate(__err); + return *this; + } + + template + typename basic_istream<_CharT, _Traits>::int_type + basic_istream<_CharT, _Traits>:: + get(void) + { + const int_type __eof = traits_type::eof(); + int_type __c = __eof; + _M_gcount = 0; + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + sentry __cerb(*this, true); + if (__cerb) + { + __try + { + __c = this->rdbuf()->sbumpc(); + // 27.6.1.1 paragraph 3 + if (!traits_type::eq_int_type(__c, __eof)) + _M_gcount = 1; + else + __err |= ios_base::eofbit; + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::badbit); } + } + if (!_M_gcount) + __err |= ios_base::failbit; + if (__err) + this->setstate(__err); + return __c; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + get(char_type& __c) + { + _M_gcount = 0; + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + sentry __cerb(*this, true); + if (__cerb) + { + __try + { + const int_type __cb = this->rdbuf()->sbumpc(); + // 27.6.1.1 paragraph 3 + if (!traits_type::eq_int_type(__cb, traits_type::eof())) + { + _M_gcount = 1; + __c = traits_type::to_char_type(__cb); + } + else + __err |= ios_base::eofbit; + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::badbit); } + } + if (!_M_gcount) + __err |= ios_base::failbit; + if (__err) + this->setstate(__err); + return *this; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + get(char_type* __s, streamsize __n, char_type __delim) + { + _M_gcount = 0; + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + sentry __cerb(*this, true); + if (__cerb) + { + __try + { + const int_type __idelim = traits_type::to_int_type(__delim); + const int_type __eof = traits_type::eof(); + __streambuf_type* __sb = this->rdbuf(); + int_type __c = __sb->sgetc(); + + while (_M_gcount + 1 < __n + && !traits_type::eq_int_type(__c, __eof) + && !traits_type::eq_int_type(__c, __idelim)) + { + *__s++ = traits_type::to_char_type(__c); + ++_M_gcount; + __c = __sb->snextc(); + } + if (traits_type::eq_int_type(__c, __eof)) + __err |= ios_base::eofbit; + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::badbit); } + } + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 243. get and getline when sentry reports failure. + if (__n > 0) + *__s = char_type(); + if (!_M_gcount) + __err |= ios_base::failbit; + if (__err) + this->setstate(__err); + return *this; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + get(__streambuf_type& __sb, char_type __delim) + { + _M_gcount = 0; + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + sentry __cerb(*this, true); + if (__cerb) + { + __try + { + const int_type __idelim = traits_type::to_int_type(__delim); + const int_type __eof = traits_type::eof(); + __streambuf_type* __this_sb = this->rdbuf(); + int_type __c = __this_sb->sgetc(); + char_type __c2 = traits_type::to_char_type(__c); + + while (!traits_type::eq_int_type(__c, __eof) + && !traits_type::eq_int_type(__c, __idelim) + && !traits_type::eq_int_type(__sb.sputc(__c2), __eof)) + { + ++_M_gcount; + __c = __this_sb->snextc(); + __c2 = traits_type::to_char_type(__c); + } + if (traits_type::eq_int_type(__c, __eof)) + __err |= ios_base::eofbit; + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::badbit); } + } + if (!_M_gcount) + __err |= ios_base::failbit; + if (__err) + this->setstate(__err); + return *this; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + getline(char_type* __s, streamsize __n, char_type __delim) + { + _M_gcount = 0; + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + sentry __cerb(*this, true); + if (__cerb) + { + __try + { + const int_type __idelim = traits_type::to_int_type(__delim); + const int_type __eof = traits_type::eof(); + __streambuf_type* __sb = this->rdbuf(); + int_type __c = __sb->sgetc(); + + while (_M_gcount + 1 < __n + && !traits_type::eq_int_type(__c, __eof) + && !traits_type::eq_int_type(__c, __idelim)) + { + *__s++ = traits_type::to_char_type(__c); + __c = __sb->snextc(); + ++_M_gcount; + } + if (traits_type::eq_int_type(__c, __eof)) + __err |= ios_base::eofbit; + else + { + if (traits_type::eq_int_type(__c, __idelim)) + { + __sb->sbumpc(); + ++_M_gcount; + } + else + __err |= ios_base::failbit; + } + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::badbit); } + } + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 243. get and getline when sentry reports failure. + if (__n > 0) + *__s = char_type(); + if (!_M_gcount) + __err |= ios_base::failbit; + if (__err) + this->setstate(__err); + return *this; + } + + // We provide three overloads, since the first two are much simpler + // than the general case. Also, the latter two can thus adopt the + // same "batchy" strategy used by getline above. + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + ignore(void) + { + _M_gcount = 0; + sentry __cerb(*this, true); + if (__cerb) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + __try + { + const int_type __eof = traits_type::eof(); + __streambuf_type* __sb = this->rdbuf(); + + if (traits_type::eq_int_type(__sb->sbumpc(), __eof)) + __err |= ios_base::eofbit; + else + _M_gcount = 1; + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + } + return *this; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + ignore(streamsize __n) + { + _M_gcount = 0; + sentry __cerb(*this, true); + if (__cerb && __n > 0) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + __try + { + const int_type __eof = traits_type::eof(); + __streambuf_type* __sb = this->rdbuf(); + int_type __c = __sb->sgetc(); + + // N.B. On LFS-enabled platforms streamsize is still 32 bits + // wide: if we want to implement the standard mandated behavior + // for n == max() (see 27.6.1.3/24) we are at risk of signed + // integer overflow: thus these contortions. Also note that, + // by definition, when more than 2G chars are actually ignored, + // _M_gcount (the return value of gcount, that is) cannot be + // really correct, being unavoidably too small. + bool __large_ignore = false; + while (true) + { + while (_M_gcount < __n + && !traits_type::eq_int_type(__c, __eof)) + { + ++_M_gcount; + __c = __sb->snextc(); + } + if (__n == __gnu_cxx::__numeric_traits::__max + && !traits_type::eq_int_type(__c, __eof)) + { + _M_gcount = + __gnu_cxx::__numeric_traits::__min; + __large_ignore = true; + } + else + break; + } + + if (__large_ignore) + _M_gcount = __gnu_cxx::__numeric_traits::__max; + + if (traits_type::eq_int_type(__c, __eof)) + __err |= ios_base::eofbit; + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + } + return *this; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + ignore(streamsize __n, int_type __delim) + { + _M_gcount = 0; + sentry __cerb(*this, true); + if (__cerb && __n > 0) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + __try + { + const int_type __eof = traits_type::eof(); + __streambuf_type* __sb = this->rdbuf(); + int_type __c = __sb->sgetc(); + + // See comment above. + bool __large_ignore = false; + while (true) + { + while (_M_gcount < __n + && !traits_type::eq_int_type(__c, __eof) + && !traits_type::eq_int_type(__c, __delim)) + { + ++_M_gcount; + __c = __sb->snextc(); + } + if (__n == __gnu_cxx::__numeric_traits::__max + && !traits_type::eq_int_type(__c, __eof) + && !traits_type::eq_int_type(__c, __delim)) + { + _M_gcount = + __gnu_cxx::__numeric_traits::__min; + __large_ignore = true; + } + else + break; + } + + if (__large_ignore) + _M_gcount = __gnu_cxx::__numeric_traits::__max; + + if (traits_type::eq_int_type(__c, __eof)) + __err |= ios_base::eofbit; + else if (traits_type::eq_int_type(__c, __delim)) + { + if (_M_gcount + < __gnu_cxx::__numeric_traits::__max) + ++_M_gcount; + __sb->sbumpc(); + } + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + } + return *this; + } + + template + typename basic_istream<_CharT, _Traits>::int_type + basic_istream<_CharT, _Traits>:: + peek(void) + { + int_type __c = traits_type::eof(); + _M_gcount = 0; + sentry __cerb(*this, true); + if (__cerb) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + __try + { + __c = this->rdbuf()->sgetc(); + if (traits_type::eq_int_type(__c, traits_type::eof())) + __err |= ios_base::eofbit; + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + } + return __c; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + read(char_type* __s, streamsize __n) + { + _M_gcount = 0; + sentry __cerb(*this, true); + if (__cerb) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + __try + { + _M_gcount = this->rdbuf()->sgetn(__s, __n); + if (_M_gcount != __n) + __err |= (ios_base::eofbit | ios_base::failbit); + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + } + return *this; + } + + template + streamsize + basic_istream<_CharT, _Traits>:: + readsome(char_type* __s, streamsize __n) + { + _M_gcount = 0; + sentry __cerb(*this, true); + if (__cerb) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + __try + { + // Cannot compare int_type with streamsize generically. + const streamsize __num = this->rdbuf()->in_avail(); + if (__num > 0) + _M_gcount = this->rdbuf()->sgetn(__s, std::min(__num, __n)); + else if (__num == -1) + __err |= ios_base::eofbit; + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + } + return _M_gcount; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + putback(char_type __c) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 60. What is a formatted input function? + _M_gcount = 0; + sentry __cerb(*this, true); + if (__cerb) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + __try + { + const int_type __eof = traits_type::eof(); + __streambuf_type* __sb = this->rdbuf(); + if (!__sb + || traits_type::eq_int_type(__sb->sputbackc(__c), __eof)) + __err |= ios_base::badbit; + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + } + return *this; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + unget(void) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 60. What is a formatted input function? + _M_gcount = 0; + sentry __cerb(*this, true); + if (__cerb) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + __try + { + const int_type __eof = traits_type::eof(); + __streambuf_type* __sb = this->rdbuf(); + if (!__sb + || traits_type::eq_int_type(__sb->sungetc(), __eof)) + __err |= ios_base::badbit; + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + } + return *this; + } + + template + int + basic_istream<_CharT, _Traits>:: + sync(void) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR60. Do not change _M_gcount. + int __ret = -1; + sentry __cerb(*this, true); + if (__cerb) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + __try + { + __streambuf_type* __sb = this->rdbuf(); + if (__sb) + { + if (__sb->pubsync() == -1) + __err |= ios_base::badbit; + else + __ret = 0; + } + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + } + return __ret; + } + + template + typename basic_istream<_CharT, _Traits>::pos_type + basic_istream<_CharT, _Traits>:: + tellg(void) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR60. Do not change _M_gcount. + pos_type __ret = pos_type(-1); + __try + { + if (!this->fail()) + __ret = this->rdbuf()->pubseekoff(0, ios_base::cur, + ios_base::in); + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::badbit); } + return __ret; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + seekg(pos_type __pos) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR60. Do not change _M_gcount. + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + __try + { + if (!this->fail()) + { + // 136. seekp, seekg setting wrong streams? + const pos_type __p = this->rdbuf()->pubseekpos(__pos, + ios_base::in); + + // 129. Need error indication from seekp() and seekg() + if (__p == pos_type(off_type(-1))) + __err |= ios_base::failbit; + } + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + return *this; + } + + template + basic_istream<_CharT, _Traits>& + basic_istream<_CharT, _Traits>:: + seekg(off_type __off, ios_base::seekdir __dir) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR60. Do not change _M_gcount. + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + __try + { + if (!this->fail()) + { + // 136. seekp, seekg setting wrong streams? + const pos_type __p = this->rdbuf()->pubseekoff(__off, __dir, + ios_base::in); + + // 129. Need error indication from seekp() and seekg() + if (__p == pos_type(off_type(-1))) + __err |= ios_base::failbit; + } + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + return *this; + } + + // 27.6.1.2.3 Character extraction templates + template + basic_istream<_CharT, _Traits>& + operator>>(basic_istream<_CharT, _Traits>& __in, _CharT& __c) + { + typedef basic_istream<_CharT, _Traits> __istream_type; + typedef typename __istream_type::int_type __int_type; + + typename __istream_type::sentry __cerb(__in, false); + if (__cerb) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + __try + { + const __int_type __cb = __in.rdbuf()->sbumpc(); + if (!_Traits::eq_int_type(__cb, _Traits::eof())) + __c = _Traits::to_char_type(__cb); + else + __err |= (ios_base::eofbit | ios_base::failbit); + } + __catch(__cxxabiv1::__forced_unwind&) + { + __in._M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { __in._M_setstate(ios_base::badbit); } + if (__err) + __in.setstate(__err); + } + return __in; + } + + template + basic_istream<_CharT, _Traits>& + operator>>(basic_istream<_CharT, _Traits>& __in, _CharT* __s) + { + typedef basic_istream<_CharT, _Traits> __istream_type; + typedef basic_streambuf<_CharT, _Traits> __streambuf_type; + typedef typename _Traits::int_type int_type; + typedef _CharT char_type; + typedef ctype<_CharT> __ctype_type; + + streamsize __extracted = 0; + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + typename __istream_type::sentry __cerb(__in, false); + if (__cerb) + { + __try + { + // Figure out how many characters to extract. + streamsize __num = __in.width(); + if (__num <= 0) + __num = __gnu_cxx::__numeric_traits::__max; + + const __ctype_type& __ct = use_facet<__ctype_type>(__in.getloc()); + + const int_type __eof = _Traits::eof(); + __streambuf_type* __sb = __in.rdbuf(); + int_type __c = __sb->sgetc(); + + while (__extracted < __num - 1 + && !_Traits::eq_int_type(__c, __eof) + && !__ct.is(ctype_base::space, + _Traits::to_char_type(__c))) + { + *__s++ = _Traits::to_char_type(__c); + ++__extracted; + __c = __sb->snextc(); + } + if (_Traits::eq_int_type(__c, __eof)) + __err |= ios_base::eofbit; + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 68. Extractors for char* should store null at end + *__s = char_type(); + __in.width(0); + } + __catch(__cxxabiv1::__forced_unwind&) + { + __in._M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { __in._M_setstate(ios_base::badbit); } + } + if (!__extracted) + __err |= ios_base::failbit; + if (__err) + __in.setstate(__err); + return __in; + } + + // 27.6.1.4 Standard basic_istream manipulators + template + basic_istream<_CharT, _Traits>& + ws(basic_istream<_CharT, _Traits>& __in) + { + typedef basic_istream<_CharT, _Traits> __istream_type; + typedef basic_streambuf<_CharT, _Traits> __streambuf_type; + typedef typename __istream_type::int_type __int_type; + typedef ctype<_CharT> __ctype_type; + + const __ctype_type& __ct = use_facet<__ctype_type>(__in.getloc()); + const __int_type __eof = _Traits::eof(); + __streambuf_type* __sb = __in.rdbuf(); + __int_type __c = __sb->sgetc(); + + while (!_Traits::eq_int_type(__c, __eof) + && __ct.is(ctype_base::space, _Traits::to_char_type(__c))) + __c = __sb->snextc(); + + if (_Traits::eq_int_type(__c, __eof)) + __in.setstate(ios_base::eofbit); + return __in; + } + + // Inhibit implicit instantiations for required instantiations, + // which are defined via explicit instantiations elsewhere. + // NB: This syntax is a GNU extension. +#if _GLIBCXX_EXTERN_TEMPLATE + extern template class basic_istream; + extern template istream& ws(istream&); + extern template istream& operator>>(istream&, char&); + extern template istream& operator>>(istream&, char*); + extern template istream& operator>>(istream&, unsigned char&); + extern template istream& operator>>(istream&, signed char&); + extern template istream& operator>>(istream&, unsigned char*); + extern template istream& operator>>(istream&, signed char*); + + extern template istream& istream::_M_extract(unsigned short&); + extern template istream& istream::_M_extract(unsigned int&); + extern template istream& istream::_M_extract(long&); + extern template istream& istream::_M_extract(unsigned long&); + extern template istream& istream::_M_extract(bool&); +#ifdef _GLIBCXX_USE_LONG_LONG + extern template istream& istream::_M_extract(long long&); + extern template istream& istream::_M_extract(unsigned long long&); +#endif + extern template istream& istream::_M_extract(float&); + extern template istream& istream::_M_extract(double&); + extern template istream& istream::_M_extract(long double&); + extern template istream& istream::_M_extract(void*&); + + extern template class basic_iostream; + +#ifdef _GLIBCXX_USE_WCHAR_T + extern template class basic_istream; + extern template wistream& ws(wistream&); + extern template wistream& operator>>(wistream&, wchar_t&); + extern template wistream& operator>>(wistream&, wchar_t*); + + extern template wistream& wistream::_M_extract(unsigned short&); + extern template wistream& wistream::_M_extract(unsigned int&); + extern template wistream& wistream::_M_extract(long&); + extern template wistream& wistream::_M_extract(unsigned long&); + extern template wistream& wistream::_M_extract(bool&); +#ifdef _GLIBCXX_USE_LONG_LONG + extern template wistream& wistream::_M_extract(long long&); + extern template wistream& wistream::_M_extract(unsigned long long&); +#endif + extern template wistream& wistream::_M_extract(float&); + extern template wistream& wistream::_M_extract(double&); + extern template wistream& wistream::_M_extract(long double&); + extern template wistream& wistream::_M_extract(void*&); + + extern template class basic_iostream; +#endif +#endif + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/list.tcc b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/list.tcc new file mode 100644 index 00000000..899b4181 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/list.tcc @@ -0,0 +1,416 @@ +// List implementation (out of line) -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file list.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _LIST_TCC +#define _LIST_TCC 1 + +_GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D) + + template + void + _List_base<_Tp, _Alloc>:: + _M_clear() + { + typedef _List_node<_Tp> _Node; + _Node* __cur = static_cast<_Node*>(this->_M_impl._M_node._M_next); + while (__cur != &this->_M_impl._M_node) + { + _Node* __tmp = __cur; + __cur = static_cast<_Node*>(__cur->_M_next); +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + _M_get_Node_allocator().destroy(__tmp); +#else + _M_get_Tp_allocator().destroy(&__tmp->_M_data); +#endif + _M_put_node(__tmp); + } + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + template + typename list<_Tp, _Alloc>::iterator + list<_Tp, _Alloc>:: + emplace(iterator __position, _Args&&... __args) + { + _Node* __tmp = _M_create_node(std::forward<_Args>(__args)...); + __tmp->hook(__position._M_node); + return iterator(__tmp); + } +#endif + + template + typename list<_Tp, _Alloc>::iterator + list<_Tp, _Alloc>:: + insert(iterator __position, const value_type& __x) + { + _Node* __tmp = _M_create_node(__x); + __tmp->hook(__position._M_node); + return iterator(__tmp); + } + + template + typename list<_Tp, _Alloc>::iterator + list<_Tp, _Alloc>:: + erase(iterator __position) + { + iterator __ret = iterator(__position._M_node->_M_next); + _M_erase(__position); + return __ret; + } + + template + void + list<_Tp, _Alloc>:: + resize(size_type __new_size, value_type __x) + { + iterator __i = begin(); + size_type __len = 0; + for (; __i != end() && __len < __new_size; ++__i, ++__len) + ; + if (__len == __new_size) + erase(__i, end()); + else // __i == end() + insert(end(), __new_size - __len, __x); + } + + template + list<_Tp, _Alloc>& + list<_Tp, _Alloc>:: + operator=(const list& __x) + { + if (this != &__x) + { + iterator __first1 = begin(); + iterator __last1 = end(); + const_iterator __first2 = __x.begin(); + const_iterator __last2 = __x.end(); + for (; __first1 != __last1 && __first2 != __last2; + ++__first1, ++__first2) + *__first1 = *__first2; + if (__first2 == __last2) + erase(__first1, __last1); + else + insert(__last1, __first2, __last2); + } + return *this; + } + + template + void + list<_Tp, _Alloc>:: + _M_fill_assign(size_type __n, const value_type& __val) + { + iterator __i = begin(); + for (; __i != end() && __n > 0; ++__i, --__n) + *__i = __val; + if (__n > 0) + insert(end(), __n, __val); + else + erase(__i, end()); + } + + template + template + void + list<_Tp, _Alloc>:: + _M_assign_dispatch(_InputIterator __first2, _InputIterator __last2, + __false_type) + { + iterator __first1 = begin(); + iterator __last1 = end(); + for (; __first1 != __last1 && __first2 != __last2; + ++__first1, ++__first2) + *__first1 = *__first2; + if (__first2 == __last2) + erase(__first1, __last1); + else + insert(__last1, __first2, __last2); + } + + template + void + list<_Tp, _Alloc>:: + remove(const value_type& __value) + { + iterator __first = begin(); + iterator __last = end(); + iterator __extra = __last; + while (__first != __last) + { + iterator __next = __first; + ++__next; + if (*__first == __value) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 526. Is it undefined if a function in the standard changes + // in parameters? + if (&*__first != &__value) + _M_erase(__first); + else + __extra = __first; + } + __first = __next; + } + if (__extra != __last) + _M_erase(__extra); + } + + template + void + list<_Tp, _Alloc>:: + unique() + { + iterator __first = begin(); + iterator __last = end(); + if (__first == __last) + return; + iterator __next = __first; + while (++__next != __last) + { + if (*__first == *__next) + _M_erase(__next); + else + __first = __next; + __next = __first; + } + } + + template + void + list<_Tp, _Alloc>:: +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + merge(list&& __x) +#else + merge(list& __x) +#endif + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 300. list::merge() specification incomplete + if (this != &__x) + { + _M_check_equal_allocators(__x); + + iterator __first1 = begin(); + iterator __last1 = end(); + iterator __first2 = __x.begin(); + iterator __last2 = __x.end(); + while (__first1 != __last1 && __first2 != __last2) + if (*__first2 < *__first1) + { + iterator __next = __first2; + _M_transfer(__first1, __first2, ++__next); + __first2 = __next; + } + else + ++__first1; + if (__first2 != __last2) + _M_transfer(__last1, __first2, __last2); + } + } + + template + template + void + list<_Tp, _Alloc>:: +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + merge(list&& __x, _StrictWeakOrdering __comp) +#else + merge(list& __x, _StrictWeakOrdering __comp) +#endif + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 300. list::merge() specification incomplete + if (this != &__x) + { + _M_check_equal_allocators(__x); + + iterator __first1 = begin(); + iterator __last1 = end(); + iterator __first2 = __x.begin(); + iterator __last2 = __x.end(); + while (__first1 != __last1 && __first2 != __last2) + if (__comp(*__first2, *__first1)) + { + iterator __next = __first2; + _M_transfer(__first1, __first2, ++__next); + __first2 = __next; + } + else + ++__first1; + if (__first2 != __last2) + _M_transfer(__last1, __first2, __last2); + } + } + + template + void + list<_Tp, _Alloc>:: + sort() + { + // Do nothing if the list has length 0 or 1. + if (this->_M_impl._M_node._M_next != &this->_M_impl._M_node + && this->_M_impl._M_node._M_next->_M_next != &this->_M_impl._M_node) + { + list __carry; + list __tmp[64]; + list * __fill = &__tmp[0]; + list * __counter; + + do + { + __carry.splice(__carry.begin(), *this, begin()); + + for(__counter = &__tmp[0]; + __counter != __fill && !__counter->empty(); + ++__counter) + { + __counter->merge(__carry); + __carry.swap(*__counter); + } + __carry.swap(*__counter); + if (__counter == __fill) + ++__fill; + } + while ( !empty() ); + + for (__counter = &__tmp[1]; __counter != __fill; ++__counter) + __counter->merge(*(__counter - 1)); + swap( *(__fill - 1) ); + } + } + + template + template + void + list<_Tp, _Alloc>:: + remove_if(_Predicate __pred) + { + iterator __first = begin(); + iterator __last = end(); + while (__first != __last) + { + iterator __next = __first; + ++__next; + if (__pred(*__first)) + _M_erase(__first); + __first = __next; + } + } + + template + template + void + list<_Tp, _Alloc>:: + unique(_BinaryPredicate __binary_pred) + { + iterator __first = begin(); + iterator __last = end(); + if (__first == __last) + return; + iterator __next = __first; + while (++__next != __last) + { + if (__binary_pred(*__first, *__next)) + _M_erase(__next); + else + __first = __next; + __next = __first; + } + } + + template + template + void + list<_Tp, _Alloc>:: + sort(_StrictWeakOrdering __comp) + { + // Do nothing if the list has length 0 or 1. + if (this->_M_impl._M_node._M_next != &this->_M_impl._M_node + && this->_M_impl._M_node._M_next->_M_next != &this->_M_impl._M_node) + { + list __carry; + list __tmp[64]; + list * __fill = &__tmp[0]; + list * __counter; + + do + { + __carry.splice(__carry.begin(), *this, begin()); + + for(__counter = &__tmp[0]; + __counter != __fill && !__counter->empty(); + ++__counter) + { + __counter->merge(__carry, __comp); + __carry.swap(*__counter); + } + __carry.swap(*__counter); + if (__counter == __fill) + ++__fill; + } + while ( !empty() ); + + for (__counter = &__tmp[1]; __counter != __fill; ++__counter) + __counter->merge(*(__counter - 1), __comp); + swap(*(__fill - 1)); + } + } + +_GLIBCXX_END_NESTED_NAMESPACE + +#endif /* _LIST_TCC */ + diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/locale_classes.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/locale_classes.h new file mode 100644 index 00000000..4a646937 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/locale_classes.h @@ -0,0 +1,812 @@ +// Locale support -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file locale_classes.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 22.1 Locales +// + +#ifndef _LOCALE_CLASSES_H +#define _LOCALE_CLASSES_H 1 + +#pragma GCC system_header + +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // 22.1.1 Class locale + /** + * @brief Container class for localization functionality. + * + * The locale class is first a class wrapper for C library locales. It is + * also an extensible container for user-defined localization. A locale is + * a collection of facets that implement various localization features such + * as money, time, and number printing. + * + * Constructing C++ locales does not change the C library locale. + * + * This library supports efficient construction and copying of locales + * through a reference counting implementation of the locale class. + */ + class locale + { + public: + // Types: + /// Definition of locale::category. + typedef int category; + + // Forward decls and friends: + class facet; + class id; + class _Impl; + + friend class facet; + friend class _Impl; + + template + friend bool + has_facet(const locale&) throw(); + + template + friend const _Facet& + use_facet(const locale&); + + template + friend struct __use_cache; + + //@{ + /** + * @brief Category values. + * + * The standard category values are none, ctype, numeric, collate, time, + * monetary, and messages. They form a bitmask that supports union and + * intersection. The category all is the union of these values. + * + * NB: Order must match _S_facet_categories definition in locale.cc + */ + static const category none = 0; + static const category ctype = 1L << 0; + static const category numeric = 1L << 1; + static const category collate = 1L << 2; + static const category time = 1L << 3; + static const category monetary = 1L << 4; + static const category messages = 1L << 5; + static const category all = (ctype | numeric | collate | + time | monetary | messages); + //@} + + // Construct/copy/destroy: + + /** + * @brief Default constructor. + * + * Constructs a copy of the global locale. If no locale has been + * explicitly set, this is the "C" locale. + */ + locale() throw(); + + /** + * @brief Copy constructor. + * + * Constructs a copy of @a other. + * + * @param other The locale to copy. + */ + locale(const locale& __other) throw(); + + /** + * @brief Named locale constructor. + * + * Constructs a copy of the named C library locale. + * + * @param s Name of the locale to construct. + * @throw std::runtime_error if s is null or an undefined locale. + */ + explicit + locale(const char* __s); + + /** + * @brief Construct locale with facets from another locale. + * + * Constructs a copy of the locale @a base. The facets specified by @a + * cat are replaced with those from the locale named by @a s. If base is + * named, this locale instance will also be named. + * + * @param base The locale to copy. + * @param s Name of the locale to use facets from. + * @param cat Set of categories defining the facets to use from s. + * @throw std::runtime_error if s is null or an undefined locale. + */ + locale(const locale& __base, const char* __s, category __cat); + + /** + * @brief Construct locale with facets from another locale. + * + * Constructs a copy of the locale @a base. The facets specified by @a + * cat are replaced with those from the locale @a add. If @a base and @a + * add are named, this locale instance will also be named. + * + * @param base The locale to copy. + * @param add The locale to use facets from. + * @param cat Set of categories defining the facets to use from add. + */ + locale(const locale& __base, const locale& __add, category __cat); + + /** + * @brief Construct locale with another facet. + * + * Constructs a copy of the locale @a other. The facet @f is added to + * @other, replacing an existing facet of type Facet if there is one. If + * @f is null, this locale is a copy of @a other. + * + * @param other The locale to copy. + * @param f The facet to add in. + */ + template + locale(const locale& __other, _Facet* __f); + + /// Locale destructor. + ~locale() throw(); + + /** + * @brief Assignment operator. + * + * Set this locale to be a copy of @a other. + * + * @param other The locale to copy. + * @return A reference to this locale. + */ + const locale& + operator=(const locale& __other) throw(); + + /** + * @brief Construct locale with another facet. + * + * Constructs and returns a new copy of this locale. Adds or replaces an + * existing facet of type Facet from the locale @a other into the new + * locale. + * + * @param Facet The facet type to copy from other + * @param other The locale to copy from. + * @return Newly constructed locale. + * @throw std::runtime_error if other has no facet of type Facet. + */ + template + locale + combine(const locale& __other) const; + + // Locale operations: + /** + * @brief Return locale name. + * @return Locale name or "*" if unnamed. + */ + string + name() const; + + /** + * @brief Locale equality. + * + * @param other The locale to compare against. + * @return True if other and this refer to the same locale instance, are + * copies, or have the same name. False otherwise. + */ + bool + operator==(const locale& __other) const throw (); + + /** + * @brief Locale inequality. + * + * @param other The locale to compare against. + * @return ! (*this == other) + */ + bool + operator!=(const locale& __other) const throw () + { return !(this->operator==(__other)); } + + /** + * @brief Compare two strings according to collate. + * + * Template operator to compare two strings using the compare function of + * the collate facet in this locale. One use is to provide the locale to + * the sort function. For example, a vector v of strings could be sorted + * according to locale loc by doing: + * @code + * std::sort(v.begin(), v.end(), loc); + * @endcode + * + * @param s1 First string to compare. + * @param s2 Second string to compare. + * @return True if collate facet compares s1 < s2, else false. + */ + template + bool + operator()(const basic_string<_Char, _Traits, _Alloc>& __s1, + const basic_string<_Char, _Traits, _Alloc>& __s2) const; + + // Global locale objects: + /** + * @brief Set global locale + * + * This function sets the global locale to the argument and returns a + * copy of the previous global locale. If the argument has a name, it + * will also call std::setlocale(LC_ALL, loc.name()). + * + * @param locale The new locale to make global. + * @return Copy of the old global locale. + */ + static locale + global(const locale&); + + /** + * @brief Return reference to the "C" locale. + */ + static const locale& + classic(); + + private: + // The (shared) implementation + _Impl* _M_impl; + + // The "C" reference locale + static _Impl* _S_classic; + + // Current global locale + static _Impl* _S_global; + + // Names of underlying locale categories. + // NB: locale::global() has to know how to modify all the + // underlying categories, not just the ones required by the C++ + // standard. + static const char* const* const _S_categories; + + // Number of standard categories. For C++, these categories are + // collate, ctype, monetary, numeric, time, and messages. These + // directly correspond to ISO C99 macros LC_COLLATE, LC_CTYPE, + // LC_MONETARY, LC_NUMERIC, and LC_TIME. In addition, POSIX (IEEE + // 1003.1-2001) specifies LC_MESSAGES. + // In addition to the standard categories, the underlying + // operating system is allowed to define extra LC_* + // macros. For GNU systems, the following are also valid: + // LC_PAPER, LC_NAME, LC_ADDRESS, LC_TELEPHONE, LC_MEASUREMENT, + // and LC_IDENTIFICATION. + enum { _S_categories_size = 6 + _GLIBCXX_NUM_CATEGORIES }; + +#ifdef __GTHREADS + static __gthread_once_t _S_once; +#endif + + explicit + locale(_Impl*) throw(); + + static void + _S_initialize(); + + static void + _S_initialize_once(); + + static category + _S_normalize_category(category); + + void + _M_coalesce(const locale& __base, const locale& __add, category __cat); + }; + + + // 22.1.1.1.2 Class locale::facet + /** + * @brief Localization functionality base class. + * + * The facet class is the base class for a localization feature, such as + * money, time, and number printing. It provides common support for facets + * and reference management. + * + * Facets may not be copied or assigned. + */ + class locale::facet + { + private: + friend class locale; + friend class locale::_Impl; + + mutable _Atomic_word _M_refcount; + + // Contains data from the underlying "C" library for the classic locale. + static __c_locale _S_c_locale; + + // String literal for the name of the classic locale. + static const char _S_c_name[2]; + +#ifdef __GTHREADS + static __gthread_once_t _S_once; +#endif + + static void + _S_initialize_once(); + + protected: + /** + * @brief Facet constructor. + * + * This is the constructor provided by the standard. If refs is 0, the + * facet is destroyed when the last referencing locale is destroyed. + * Otherwise the facet will never be destroyed. + * + * @param refs The initial value for reference count. + */ + explicit + facet(size_t __refs = 0) throw() : _M_refcount(__refs ? 1 : 0) + { } + + /// Facet destructor. + virtual + ~facet(); + + static void + _S_create_c_locale(__c_locale& __cloc, const char* __s, + __c_locale __old = 0); + + static __c_locale + _S_clone_c_locale(__c_locale& __cloc); + + static void + _S_destroy_c_locale(__c_locale& __cloc); + + // Returns data from the underlying "C" library data for the + // classic locale. + static __c_locale + _S_get_c_locale(); + + static const char* + _S_get_c_name(); + + private: + void + _M_add_reference() const throw() + { __gnu_cxx::__atomic_add_dispatch(&_M_refcount, 1); } + + void + _M_remove_reference() const throw() + { + if (__gnu_cxx::__exchange_and_add_dispatch(&_M_refcount, -1) == 1) + { + __try + { delete this; } + __catch(...) + { } + } + } + + facet(const facet&); // Not defined. + + facet& + operator=(const facet&); // Not defined. + }; + + + // 22.1.1.1.3 Class locale::id + /** + * @brief Facet ID class. + * + * The ID class provides facets with an index used to identify them. + * Every facet class must define a public static member locale::id, or be + * derived from a facet that provides this member, otherwise the facet + * cannot be used in a locale. The locale::id ensures that each class + * type gets a unique identifier. + */ + class locale::id + { + private: + friend class locale; + friend class locale::_Impl; + + template + friend const _Facet& + use_facet(const locale&); + + template + friend bool + has_facet(const locale&) throw (); + + // NB: There is no accessor for _M_index because it may be used + // before the constructor is run; the effect of calling a member + // function (even an inline) would be undefined. + mutable size_t _M_index; + + // Last id number assigned. + static _Atomic_word _S_refcount; + + void + operator=(const id&); // Not defined. + + id(const id&); // Not defined. + + public: + // NB: This class is always a static data member, and thus can be + // counted on to be zero-initialized. + /// Constructor. + id() { } + + size_t + _M_id() const; + }; + + + // Implementation object for locale. + class locale::_Impl + { + public: + // Friends. + friend class locale; + friend class locale::facet; + + template + friend bool + has_facet(const locale&) throw(); + + template + friend const _Facet& + use_facet(const locale&); + + template + friend struct __use_cache; + + private: + // Data Members. + _Atomic_word _M_refcount; + const facet** _M_facets; + size_t _M_facets_size; + const facet** _M_caches; + char** _M_names; + static const locale::id* const _S_id_ctype[]; + static const locale::id* const _S_id_numeric[]; + static const locale::id* const _S_id_collate[]; + static const locale::id* const _S_id_time[]; + static const locale::id* const _S_id_monetary[]; + static const locale::id* const _S_id_messages[]; + static const locale::id* const* const _S_facet_categories[]; + + void + _M_add_reference() throw() + { __gnu_cxx::__atomic_add_dispatch(&_M_refcount, 1); } + + void + _M_remove_reference() throw() + { + if (__gnu_cxx::__exchange_and_add_dispatch(&_M_refcount, -1) == 1) + { + __try + { delete this; } + __catch(...) + { } + } + } + + _Impl(const _Impl&, size_t); + _Impl(const char*, size_t); + _Impl(size_t) throw(); + + ~_Impl() throw(); + + _Impl(const _Impl&); // Not defined. + + void + operator=(const _Impl&); // Not defined. + + bool + _M_check_same_name() + { + bool __ret = true; + if (_M_names[1]) + // We must actually compare all the _M_names: can be all equal! + for (size_t __i = 0; __ret && __i < _S_categories_size - 1; ++__i) + __ret = __builtin_strcmp(_M_names[__i], _M_names[__i + 1]) == 0; + return __ret; + } + + void + _M_replace_categories(const _Impl*, category); + + void + _M_replace_category(const _Impl*, const locale::id* const*); + + void + _M_replace_facet(const _Impl*, const locale::id*); + + void + _M_install_facet(const locale::id*, const facet*); + + template + void + _M_init_facet(_Facet* __facet) + { _M_install_facet(&_Facet::id, __facet); } + + void + _M_install_cache(const facet*, size_t); + }; + + + /** + * @brief Test for the presence of a facet. + * + * has_facet tests the locale argument for the presence of the facet type + * provided as the template parameter. Facets derived from the facet + * parameter will also return true. + * + * @param Facet The facet type to test the presence of. + * @param locale The locale to test. + * @return true if locale contains a facet of type Facet, else false. + */ + template + bool + has_facet(const locale& __loc) throw(); + + /** + * @brief Return a facet. + * + * use_facet looks for and returns a reference to a facet of type Facet + * where Facet is the template parameter. If has_facet(locale) is true, + * there is a suitable facet to return. It throws std::bad_cast if the + * locale doesn't contain a facet of type Facet. + * + * @param Facet The facet type to access. + * @param locale The locale to use. + * @return Reference to facet of type Facet. + * @throw std::bad_cast if locale doesn't contain a facet of type Facet. + */ + template + const _Facet& + use_facet(const locale& __loc); + + + /** + * @brief Facet for localized string comparison. + * + * This facet encapsulates the code to compare strings in a localized + * manner. + * + * The collate template uses protected virtual functions to provide + * the actual results. The public accessors forward the call to + * the virtual functions. These virtual functions are hooks for + * developers to implement the behavior they require from the + * collate facet. + */ + template + class collate : public locale::facet + { + public: + // Types: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef basic_string<_CharT> string_type; + //@} + + protected: + // Underlying "C" library locale information saved from + // initialization, needed by collate_byname as well. + __c_locale _M_c_locale_collate; + + public: + /// Numpunct facet id. + static locale::id id; + + /** + * @brief Constructor performs initialization. + * + * This is the constructor provided by the standard. + * + * @param refs Passed to the base facet class. + */ + explicit + collate(size_t __refs = 0) + : facet(__refs), _M_c_locale_collate(_S_get_c_locale()) + { } + + /** + * @brief Internal constructor. Not for general use. + * + * This is a constructor for use by the library itself to set up new + * locales. + * + * @param cloc The "C" locale. + * @param refs Passed to the base facet class. + */ + explicit + collate(__c_locale __cloc, size_t __refs = 0) + : facet(__refs), _M_c_locale_collate(_S_clone_c_locale(__cloc)) + { } + + /** + * @brief Compare two strings. + * + * This function compares two strings and returns the result by calling + * collate::do_compare(). + * + * @param lo1 Start of string 1. + * @param hi1 End of string 1. + * @param lo2 Start of string 2. + * @param hi2 End of string 2. + * @return 1 if string1 > string2, -1 if string1 < string2, else 0. + */ + int + compare(const _CharT* __lo1, const _CharT* __hi1, + const _CharT* __lo2, const _CharT* __hi2) const + { return this->do_compare(__lo1, __hi1, __lo2, __hi2); } + + /** + * @brief Transform string to comparable form. + * + * This function is a wrapper for strxfrm functionality. It takes the + * input string and returns a modified string that can be directly + * compared to other transformed strings. In the "C" locale, this + * function just returns a copy of the input string. In some other + * locales, it may replace two chars with one, change a char for + * another, etc. It does so by returning collate::do_transform(). + * + * @param lo Start of string. + * @param hi End of string. + * @return Transformed string_type. + */ + string_type + transform(const _CharT* __lo, const _CharT* __hi) const + { return this->do_transform(__lo, __hi); } + + /** + * @brief Return hash of a string. + * + * This function computes and returns a hash on the input string. It + * does so by returning collate::do_hash(). + * + * @param lo Start of string. + * @param hi End of string. + * @return Hash value. + */ + long + hash(const _CharT* __lo, const _CharT* __hi) const + { return this->do_hash(__lo, __hi); } + + // Used to abstract out _CharT bits in virtual member functions, below. + int + _M_compare(const _CharT*, const _CharT*) const; + + size_t + _M_transform(_CharT*, const _CharT*, size_t) const; + + protected: + /// Destructor. + virtual + ~collate() + { _S_destroy_c_locale(_M_c_locale_collate); } + + /** + * @brief Compare two strings. + * + * This function is a hook for derived classes to change the value + * returned. @see compare(). + * + * @param lo1 Start of string 1. + * @param hi1 End of string 1. + * @param lo2 Start of string 2. + * @param hi2 End of string 2. + * @return 1 if string1 > string2, -1 if string1 < string2, else 0. + */ + virtual int + do_compare(const _CharT* __lo1, const _CharT* __hi1, + const _CharT* __lo2, const _CharT* __hi2) const; + + /** + * @brief Transform string to comparable form. + * + * This function is a hook for derived classes to change the value + * returned. + * + * @param lo1 Start of string 1. + * @param hi1 End of string 1. + * @param lo2 Start of string 2. + * @param hi2 End of string 2. + * @return 1 if string1 > string2, -1 if string1 < string2, else 0. + */ + virtual string_type + do_transform(const _CharT* __lo, const _CharT* __hi) const; + + /** + * @brief Return hash of a string. + * + * This function computes and returns a hash on the input string. This + * function is a hook for derived classes to change the value returned. + * + * @param lo Start of string. + * @param hi End of string. + * @return Hash value. + */ + virtual long + do_hash(const _CharT* __lo, const _CharT* __hi) const; + }; + + template + locale::id collate<_CharT>::id; + + // Specializations. + template<> + int + collate::_M_compare(const char*, const char*) const; + + template<> + size_t + collate::_M_transform(char*, const char*, size_t) const; + +#ifdef _GLIBCXX_USE_WCHAR_T + template<> + int + collate::_M_compare(const wchar_t*, const wchar_t*) const; + + template<> + size_t + collate::_M_transform(wchar_t*, const wchar_t*, size_t) const; +#endif + + /// class collate_byname [22.2.4.2]. + template + class collate_byname : public collate<_CharT> + { + public: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef basic_string<_CharT> string_type; + //@} + + explicit + collate_byname(const char* __s, size_t __refs = 0) + : collate<_CharT>(__refs) + { + if (__builtin_strcmp(__s, "C") != 0 + && __builtin_strcmp(__s, "POSIX") != 0) + { + this->_S_destroy_c_locale(this->_M_c_locale_collate); + this->_S_create_c_locale(this->_M_c_locale_collate, __s); + } + } + + protected: + virtual + ~collate_byname() { } + }; + +_GLIBCXX_END_NAMESPACE + +#ifndef _GLIBCXX_EXPORT_TEMPLATE +# include +#endif + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/locale_classes.tcc b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/locale_classes.tcc new file mode 100644 index 00000000..c97e555a --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/locale_classes.tcc @@ -0,0 +1,271 @@ +// Locale support -*- C++ -*- + +// Copyright (C) 2007, 2008, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file locale_classes.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 22.1 Locales +// + +#ifndef _LOCALE_CLASSES_TCC +#define _LOCALE_CLASSES_TCC 1 + +#pragma GCC system_header + +_GLIBCXX_BEGIN_NAMESPACE(std) + + template + locale:: + locale(const locale& __other, _Facet* __f) + { + _M_impl = new _Impl(*__other._M_impl, 1); + + __try + { _M_impl->_M_install_facet(&_Facet::id, __f); } + __catch(...) + { + _M_impl->_M_remove_reference(); + __throw_exception_again; + } + delete [] _M_impl->_M_names[0]; + _M_impl->_M_names[0] = 0; // Unnamed. + } + + template + locale + locale:: + combine(const locale& __other) const + { + _Impl* __tmp = new _Impl(*_M_impl, 1); + __try + { + __tmp->_M_replace_facet(__other._M_impl, &_Facet::id); + } + __catch(...) + { + __tmp->_M_remove_reference(); + __throw_exception_again; + } + return locale(__tmp); + } + + template + bool + locale:: + operator()(const basic_string<_CharT, _Traits, _Alloc>& __s1, + const basic_string<_CharT, _Traits, _Alloc>& __s2) const + { + typedef std::collate<_CharT> __collate_type; + const __collate_type& __collate = use_facet<__collate_type>(*this); + return (__collate.compare(__s1.data(), __s1.data() + __s1.length(), + __s2.data(), __s2.data() + __s2.length()) < 0); + } + + + template + bool + has_facet(const locale& __loc) throw() + { + const size_t __i = _Facet::id._M_id(); + const locale::facet** __facets = __loc._M_impl->_M_facets; + return (__i < __loc._M_impl->_M_facets_size +#ifdef __GXX_RTTI + && dynamic_cast(__facets[__i])); +#else + && static_cast(__facets[__i])); +#endif + } + + template + const _Facet& + use_facet(const locale& __loc) + { + const size_t __i = _Facet::id._M_id(); + const locale::facet** __facets = __loc._M_impl->_M_facets; + if (__i >= __loc._M_impl->_M_facets_size || !__facets[__i]) + __throw_bad_cast(); +#ifdef __GXX_RTTI + return dynamic_cast(*__facets[__i]); +#else + return static_cast(*__facets[__i]); +#endif + } + + + // Generic version does nothing. + template + int + collate<_CharT>::_M_compare(const _CharT*, const _CharT*) const + { return 0; } + + // Generic version does nothing. + template + size_t + collate<_CharT>::_M_transform(_CharT*, const _CharT*, size_t) const + { return 0; } + + template + int + collate<_CharT>:: + do_compare(const _CharT* __lo1, const _CharT* __hi1, + const _CharT* __lo2, const _CharT* __hi2) const + { + // strcoll assumes zero-terminated strings so we make a copy + // and then put a zero at the end. + const string_type __one(__lo1, __hi1); + const string_type __two(__lo2, __hi2); + + const _CharT* __p = __one.c_str(); + const _CharT* __pend = __one.data() + __one.length(); + const _CharT* __q = __two.c_str(); + const _CharT* __qend = __two.data() + __two.length(); + + // strcoll stops when it sees a nul character so we break + // the strings into zero-terminated substrings and pass those + // to strcoll. + for (;;) + { + const int __res = _M_compare(__p, __q); + if (__res) + return __res; + + __p += char_traits<_CharT>::length(__p); + __q += char_traits<_CharT>::length(__q); + if (__p == __pend && __q == __qend) + return 0; + else if (__p == __pend) + return -1; + else if (__q == __qend) + return 1; + + __p++; + __q++; + } + } + + template + typename collate<_CharT>::string_type + collate<_CharT>:: + do_transform(const _CharT* __lo, const _CharT* __hi) const + { + string_type __ret; + + // strxfrm assumes zero-terminated strings so we make a copy + const string_type __str(__lo, __hi); + + const _CharT* __p = __str.c_str(); + const _CharT* __pend = __str.data() + __str.length(); + + size_t __len = (__hi - __lo) * 2; + + _CharT* __c = new _CharT[__len]; + + __try + { + // strxfrm stops when it sees a nul character so we break + // the string into zero-terminated substrings and pass those + // to strxfrm. + for (;;) + { + // First try a buffer perhaps big enough. + size_t __res = _M_transform(__c, __p, __len); + // If the buffer was not large enough, try again with the + // correct size. + if (__res >= __len) + { + __len = __res + 1; + delete [] __c, __c = 0; + __c = new _CharT[__len]; + __res = _M_transform(__c, __p, __len); + } + + __ret.append(__c, __res); + __p += char_traits<_CharT>::length(__p); + if (__p == __pend) + break; + + __p++; + __ret.push_back(_CharT()); + } + } + __catch(...) + { + delete [] __c; + __throw_exception_again; + } + + delete [] __c; + + return __ret; + } + + template + long + collate<_CharT>:: + do_hash(const _CharT* __lo, const _CharT* __hi) const + { + unsigned long __val = 0; + for (; __lo < __hi; ++__lo) + __val = + *__lo + ((__val << 7) + | (__val >> (__gnu_cxx::__numeric_traits:: + __digits - 7))); + return static_cast(__val); + } + + // Inhibit implicit instantiations for required instantiations, + // which are defined via explicit instantiations elsewhere. + // NB: This syntax is a GNU extension. +#if _GLIBCXX_EXTERN_TEMPLATE + extern template class collate; + extern template class collate_byname; + + extern template + const collate& + use_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + +#ifdef _GLIBCXX_USE_WCHAR_T + extern template class collate; + extern template class collate_byname; + + extern template + const collate& + use_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); +#endif +#endif + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/locale_facets.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/locale_facets.h new file mode 100644 index 00000000..beed6f1c --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/locale_facets.h @@ -0,0 +1,2602 @@ +// Locale support -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file locale_facets.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 22.1 Locales +// + +#ifndef _LOCALE_FACETS_H +#define _LOCALE_FACETS_H 1 + +#pragma GCC system_header + +#include // For wctype_t +#include +#include +#include +#include // For ios_base, ios_base::iostate +#include +#include +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // NB: Don't instantiate required wchar_t facets if no wchar_t support. +#ifdef _GLIBCXX_USE_WCHAR_T +# define _GLIBCXX_NUM_FACETS 28 +#else +# define _GLIBCXX_NUM_FACETS 14 +#endif + + // Convert string to numeric value of type _Tv and store results. + // NB: This is specialized for all required types, there is no + // generic definition. + template + void + __convert_to_v(const char* __in, _Tv& __out, ios_base::iostate& __err, + const __c_locale& __cloc); + + // Explicit specializations for required types. + template<> + void + __convert_to_v(const char*, float&, ios_base::iostate&, + const __c_locale&); + + template<> + void + __convert_to_v(const char*, double&, ios_base::iostate&, + const __c_locale&); + + template<> + void + __convert_to_v(const char*, long double&, ios_base::iostate&, + const __c_locale&); + + // NB: __pad is a struct, rather than a function, so it can be + // partially-specialized. + template + struct __pad + { + static void + _S_pad(ios_base& __io, _CharT __fill, _CharT* __news, + const _CharT* __olds, streamsize __newlen, streamsize __oldlen); + }; + + // Used by both numeric and monetary facets. + // Inserts "group separator" characters into an array of characters. + // It's recursive, one iteration per group. It moves the characters + // in the buffer this way: "xxxx12345" -> "12,345xxx". Call this + // only with __gsize != 0. + template + _CharT* + __add_grouping(_CharT* __s, _CharT __sep, + const char* __gbeg, size_t __gsize, + const _CharT* __first, const _CharT* __last); + + // This template permits specializing facet output code for + // ostreambuf_iterator. For ostreambuf_iterator, sputn is + // significantly more efficient than incrementing iterators. + template + inline + ostreambuf_iterator<_CharT> + __write(ostreambuf_iterator<_CharT> __s, const _CharT* __ws, int __len) + { + __s._M_put(__ws, __len); + return __s; + } + + // This is the unspecialized form of the template. + template + inline + _OutIter + __write(_OutIter __s, const _CharT* __ws, int __len) + { + for (int __j = 0; __j < __len; __j++, ++__s) + *__s = __ws[__j]; + return __s; + } + + + // 22.2.1.1 Template class ctype + // Include host and configuration specific ctype enums for ctype_base. + + // Common base for ctype<_CharT>. + /** + * @brief Common base for ctype facet + * + * This template class provides implementations of the public functions + * that forward to the protected virtual functions. + * + * This template also provides abstract stubs for the protected virtual + * functions. + */ + template + class __ctype_abstract_base : public locale::facet, public ctype_base + { + public: + // Types: + /// Typedef for the template parameter + typedef _CharT char_type; + + /** + * @brief Test char_type classification. + * + * This function finds a mask M for @a c and compares it to mask @a m. + * It does so by returning the value of ctype::do_is(). + * + * @param c The char_type to compare the mask of. + * @param m The mask to compare against. + * @return (M & m) != 0. + */ + bool + is(mask __m, char_type __c) const + { return this->do_is(__m, __c); } + + /** + * @brief Return a mask array. + * + * This function finds the mask for each char_type in the range [lo,hi) + * and successively writes it to vec. vec must have as many elements + * as the char array. It does so by returning the value of + * ctype::do_is(). + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @param vec Pointer to an array of mask storage. + * @return @a hi. + */ + const char_type* + is(const char_type *__lo, const char_type *__hi, mask *__vec) const + { return this->do_is(__lo, __hi, __vec); } + + /** + * @brief Find char_type matching a mask + * + * This function searches for and returns the first char_type c in + * [lo,hi) for which is(m,c) is true. It does so by returning + * ctype::do_scan_is(). + * + * @param m The mask to compare against. + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return Pointer to matching char_type if found, else @a hi. + */ + const char_type* + scan_is(mask __m, const char_type* __lo, const char_type* __hi) const + { return this->do_scan_is(__m, __lo, __hi); } + + /** + * @brief Find char_type not matching a mask + * + * This function searches for and returns the first char_type c in + * [lo,hi) for which is(m,c) is false. It does so by returning + * ctype::do_scan_not(). + * + * @param m The mask to compare against. + * @param lo Pointer to first char in range. + * @param hi Pointer to end of range. + * @return Pointer to non-matching char if found, else @a hi. + */ + const char_type* + scan_not(mask __m, const char_type* __lo, const char_type* __hi) const + { return this->do_scan_not(__m, __lo, __hi); } + + /** + * @brief Convert to uppercase. + * + * This function converts the argument to uppercase if possible. + * If not possible (for example, '2'), returns the argument. It does + * so by returning ctype::do_toupper(). + * + * @param c The char_type to convert. + * @return The uppercase char_type if convertible, else @a c. + */ + char_type + toupper(char_type __c) const + { return this->do_toupper(__c); } + + /** + * @brief Convert array to uppercase. + * + * This function converts each char_type in the range [lo,hi) to + * uppercase if possible. Other elements remain untouched. It does so + * by returning ctype:: do_toupper(lo, hi). + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return @a hi. + */ + const char_type* + toupper(char_type *__lo, const char_type* __hi) const + { return this->do_toupper(__lo, __hi); } + + /** + * @brief Convert to lowercase. + * + * This function converts the argument to lowercase if possible. If + * not possible (for example, '2'), returns the argument. It does so + * by returning ctype::do_tolower(c). + * + * @param c The char_type to convert. + * @return The lowercase char_type if convertible, else @a c. + */ + char_type + tolower(char_type __c) const + { return this->do_tolower(__c); } + + /** + * @brief Convert array to lowercase. + * + * This function converts each char_type in the range [lo,hi) to + * lowercase if possible. Other elements remain untouched. It does so + * by returning ctype:: do_tolower(lo, hi). + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return @a hi. + */ + const char_type* + tolower(char_type* __lo, const char_type* __hi) const + { return this->do_tolower(__lo, __hi); } + + /** + * @brief Widen char to char_type + * + * This function converts the char argument to char_type using the + * simplest reasonable transformation. It does so by returning + * ctype::do_widen(c). + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param c The char to convert. + * @return The converted char_type. + */ + char_type + widen(char __c) const + { return this->do_widen(__c); } + + /** + * @brief Widen array to char_type + * + * This function converts each char in the input to char_type using the + * simplest reasonable transformation. It does so by returning + * ctype::do_widen(c). + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @param to Pointer to the destination array. + * @return @a hi. + */ + const char* + widen(const char* __lo, const char* __hi, char_type* __to) const + { return this->do_widen(__lo, __hi, __to); } + + /** + * @brief Narrow char_type to char + * + * This function converts the char_type to char using the simplest + * reasonable transformation. If the conversion fails, dfault is + * returned instead. It does so by returning + * ctype::do_narrow(c). + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param c The char_type to convert. + * @param dfault Char to return if conversion fails. + * @return The converted char. + */ + char + narrow(char_type __c, char __dfault) const + { return this->do_narrow(__c, __dfault); } + + /** + * @brief Narrow array to char array + * + * This function converts each char_type in the input to char using the + * simplest reasonable transformation and writes the results to the + * destination array. For any char_type in the input that cannot be + * converted, @a dfault is used instead. It does so by returning + * ctype::do_narrow(lo, hi, dfault, to). + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @param dfault Char to use if conversion fails. + * @param to Pointer to the destination array. + * @return @a hi. + */ + const char_type* + narrow(const char_type* __lo, const char_type* __hi, + char __dfault, char *__to) const + { return this->do_narrow(__lo, __hi, __dfault, __to); } + + protected: + explicit + __ctype_abstract_base(size_t __refs = 0): facet(__refs) { } + + virtual + ~__ctype_abstract_base() { } + + /** + * @brief Test char_type classification. + * + * This function finds a mask M for @a c and compares it to mask @a m. + * + * do_is() is a hook for a derived facet to change the behavior of + * classifying. do_is() must always return the same result for the + * same input. + * + * @param c The char_type to find the mask of. + * @param m The mask to compare against. + * @return (M & m) != 0. + */ + virtual bool + do_is(mask __m, char_type __c) const = 0; + + /** + * @brief Return a mask array. + * + * This function finds the mask for each char_type in the range [lo,hi) + * and successively writes it to vec. vec must have as many elements + * as the input. + * + * do_is() is a hook for a derived facet to change the behavior of + * classifying. do_is() must always return the same result for the + * same input. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @param vec Pointer to an array of mask storage. + * @return @a hi. + */ + virtual const char_type* + do_is(const char_type* __lo, const char_type* __hi, + mask* __vec) const = 0; + + /** + * @brief Find char_type matching mask + * + * This function searches for and returns the first char_type c in + * [lo,hi) for which is(m,c) is true. + * + * do_scan_is() is a hook for a derived facet to change the behavior of + * match searching. do_is() must always return the same result for the + * same input. + * + * @param m The mask to compare against. + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return Pointer to a matching char_type if found, else @a hi. + */ + virtual const char_type* + do_scan_is(mask __m, const char_type* __lo, + const char_type* __hi) const = 0; + + /** + * @brief Find char_type not matching mask + * + * This function searches for and returns a pointer to the first + * char_type c of [lo,hi) for which is(m,c) is false. + * + * do_scan_is() is a hook for a derived facet to change the behavior of + * match searching. do_is() must always return the same result for the + * same input. + * + * @param m The mask to compare against. + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return Pointer to a non-matching char_type if found, else @a hi. + */ + virtual const char_type* + do_scan_not(mask __m, const char_type* __lo, + const char_type* __hi) const = 0; + + /** + * @brief Convert to uppercase. + * + * This virtual function converts the char_type argument to uppercase + * if possible. If not possible (for example, '2'), returns the + * argument. + * + * do_toupper() is a hook for a derived facet to change the behavior of + * uppercasing. do_toupper() must always return the same result for + * the same input. + * + * @param c The char_type to convert. + * @return The uppercase char_type if convertible, else @a c. + */ + virtual char_type + do_toupper(char_type) const = 0; + + /** + * @brief Convert array to uppercase. + * + * This virtual function converts each char_type in the range [lo,hi) + * to uppercase if possible. Other elements remain untouched. + * + * do_toupper() is a hook for a derived facet to change the behavior of + * uppercasing. do_toupper() must always return the same result for + * the same input. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return @a hi. + */ + virtual const char_type* + do_toupper(char_type* __lo, const char_type* __hi) const = 0; + + /** + * @brief Convert to lowercase. + * + * This virtual function converts the argument to lowercase if + * possible. If not possible (for example, '2'), returns the argument. + * + * do_tolower() is a hook for a derived facet to change the behavior of + * lowercasing. do_tolower() must always return the same result for + * the same input. + * + * @param c The char_type to convert. + * @return The lowercase char_type if convertible, else @a c. + */ + virtual char_type + do_tolower(char_type) const = 0; + + /** + * @brief Convert array to lowercase. + * + * This virtual function converts each char_type in the range [lo,hi) + * to lowercase if possible. Other elements remain untouched. + * + * do_tolower() is a hook for a derived facet to change the behavior of + * lowercasing. do_tolower() must always return the same result for + * the same input. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return @a hi. + */ + virtual const char_type* + do_tolower(char_type* __lo, const char_type* __hi) const = 0; + + /** + * @brief Widen char + * + * This virtual function converts the char to char_type using the + * simplest reasonable transformation. + * + * do_widen() is a hook for a derived facet to change the behavior of + * widening. do_widen() must always return the same result for the + * same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param c The char to convert. + * @return The converted char_type + */ + virtual char_type + do_widen(char) const = 0; + + /** + * @brief Widen char array + * + * This function converts each char in the input to char_type using the + * simplest reasonable transformation. + * + * do_widen() is a hook for a derived facet to change the behavior of + * widening. do_widen() must always return the same result for the + * same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param lo Pointer to start range. + * @param hi Pointer to end of range. + * @param to Pointer to the destination array. + * @return @a hi. + */ + virtual const char* + do_widen(const char* __lo, const char* __hi, + char_type* __dest) const = 0; + + /** + * @brief Narrow char_type to char + * + * This virtual function converts the argument to char using the + * simplest reasonable transformation. If the conversion fails, dfault + * is returned instead. + * + * do_narrow() is a hook for a derived facet to change the behavior of + * narrowing. do_narrow() must always return the same result for the + * same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param c The char_type to convert. + * @param dfault Char to return if conversion fails. + * @return The converted char. + */ + virtual char + do_narrow(char_type, char __dfault) const = 0; + + /** + * @brief Narrow char_type array to char + * + * This virtual function converts each char_type in the range [lo,hi) to + * char using the simplest reasonable transformation and writes the + * results to the destination array. For any element in the input that + * cannot be converted, @a dfault is used instead. + * + * do_narrow() is a hook for a derived facet to change the behavior of + * narrowing. do_narrow() must always return the same result for the + * same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @param dfault Char to use if conversion fails. + * @param to Pointer to the destination array. + * @return @a hi. + */ + virtual const char_type* + do_narrow(const char_type* __lo, const char_type* __hi, + char __dfault, char* __dest) const = 0; + }; + + // NB: Generic, mostly useless implementation. + /** + * @brief Template ctype facet + * + * This template class defines classification and conversion functions for + * character sets. It wraps functionality. Ctype gets used by + * streams for many I/O operations. + * + * This template provides the protected virtual functions the developer + * will have to replace in a derived class or specialization to make a + * working facet. The public functions that access them are defined in + * __ctype_abstract_base, to allow for implementation flexibility. See + * ctype for an example. The functions are documented in + * __ctype_abstract_base. + * + * Note: implementations are provided for all the protected virtual + * functions, but will likely not be useful. + */ + template + class ctype : public __ctype_abstract_base<_CharT> + { + public: + // Types: + typedef _CharT char_type; + typedef typename __ctype_abstract_base<_CharT>::mask mask; + + /// The facet id for ctype + static locale::id id; + + explicit + ctype(size_t __refs = 0) : __ctype_abstract_base<_CharT>(__refs) { } + + protected: + virtual + ~ctype(); + + virtual bool + do_is(mask __m, char_type __c) const; + + virtual const char_type* + do_is(const char_type* __lo, const char_type* __hi, mask* __vec) const; + + virtual const char_type* + do_scan_is(mask __m, const char_type* __lo, const char_type* __hi) const; + + virtual const char_type* + do_scan_not(mask __m, const char_type* __lo, + const char_type* __hi) const; + + virtual char_type + do_toupper(char_type __c) const; + + virtual const char_type* + do_toupper(char_type* __lo, const char_type* __hi) const; + + virtual char_type + do_tolower(char_type __c) const; + + virtual const char_type* + do_tolower(char_type* __lo, const char_type* __hi) const; + + virtual char_type + do_widen(char __c) const; + + virtual const char* + do_widen(const char* __lo, const char* __hi, char_type* __dest) const; + + virtual char + do_narrow(char_type, char __dfault) const; + + virtual const char_type* + do_narrow(const char_type* __lo, const char_type* __hi, + char __dfault, char* __dest) const; + }; + + template + locale::id ctype<_CharT>::id; + + // 22.2.1.3 ctype specialization. + /** + * @brief The ctype specialization. + * + * This class defines classification and conversion functions for + * the char type. It gets used by char streams for many I/O + * operations. The char specialization provides a number of + * optimizations as well. + */ + template<> + class ctype : public locale::facet, public ctype_base + { + public: + // Types: + /// Typedef for the template parameter char. + typedef char char_type; + + protected: + // Data Members: + __c_locale _M_c_locale_ctype; + bool _M_del; + __to_type _M_toupper; + __to_type _M_tolower; + const mask* _M_table; + mutable char _M_widen_ok; + mutable char _M_widen[1 + static_cast(-1)]; + mutable char _M_narrow[1 + static_cast(-1)]; + mutable char _M_narrow_ok; // 0 uninitialized, 1 init, + // 2 memcpy can't be used + + public: + /// The facet id for ctype + static locale::id id; + /// The size of the mask table. It is SCHAR_MAX + 1. + static const size_t table_size = 1 + static_cast(-1); + + /** + * @brief Constructor performs initialization. + * + * This is the constructor provided by the standard. + * + * @param table If non-zero, table is used as the per-char mask. + * Else classic_table() is used. + * @param del If true, passes ownership of table to this facet. + * @param refs Passed to the base facet class. + */ + explicit + ctype(const mask* __table = 0, bool __del = false, size_t __refs = 0); + + /** + * @brief Constructor performs static initialization. + * + * This constructor is used to construct the initial C locale facet. + * + * @param cloc Handle to C locale data. + * @param table If non-zero, table is used as the per-char mask. + * @param del If true, passes ownership of table to this facet. + * @param refs Passed to the base facet class. + */ + explicit + ctype(__c_locale __cloc, const mask* __table = 0, bool __del = false, + size_t __refs = 0); + + /** + * @brief Test char classification. + * + * This function compares the mask table[c] to @a m. + * + * @param c The char to compare the mask of. + * @param m The mask to compare against. + * @return True if m & table[c] is true, false otherwise. + */ + inline bool + is(mask __m, char __c) const; + + /** + * @brief Return a mask array. + * + * This function finds the mask for each char in the range [lo, hi) and + * successively writes it to vec. vec must have as many elements as + * the char array. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @param vec Pointer to an array of mask storage. + * @return @a hi. + */ + inline const char* + is(const char* __lo, const char* __hi, mask* __vec) const; + + /** + * @brief Find char matching a mask + * + * This function searches for and returns the first char in [lo,hi) for + * which is(m,char) is true. + * + * @param m The mask to compare against. + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return Pointer to a matching char if found, else @a hi. + */ + inline const char* + scan_is(mask __m, const char* __lo, const char* __hi) const; + + /** + * @brief Find char not matching a mask + * + * This function searches for and returns a pointer to the first char + * in [lo,hi) for which is(m,char) is false. + * + * @param m The mask to compare against. + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return Pointer to a non-matching char if found, else @a hi. + */ + inline const char* + scan_not(mask __m, const char* __lo, const char* __hi) const; + + /** + * @brief Convert to uppercase. + * + * This function converts the char argument to uppercase if possible. + * If not possible (for example, '2'), returns the argument. + * + * toupper() acts as if it returns ctype::do_toupper(c). + * do_toupper() must always return the same result for the same input. + * + * @param c The char to convert. + * @return The uppercase char if convertible, else @a c. + */ + char_type + toupper(char_type __c) const + { return this->do_toupper(__c); } + + /** + * @brief Convert array to uppercase. + * + * This function converts each char in the range [lo,hi) to uppercase + * if possible. Other chars remain untouched. + * + * toupper() acts as if it returns ctype:: do_toupper(lo, hi). + * do_toupper() must always return the same result for the same input. + * + * @param lo Pointer to first char in range. + * @param hi Pointer to end of range. + * @return @a hi. + */ + const char_type* + toupper(char_type *__lo, const char_type* __hi) const + { return this->do_toupper(__lo, __hi); } + + /** + * @brief Convert to lowercase. + * + * This function converts the char argument to lowercase if possible. + * If not possible (for example, '2'), returns the argument. + * + * tolower() acts as if it returns ctype::do_tolower(c). + * do_tolower() must always return the same result for the same input. + * + * @param c The char to convert. + * @return The lowercase char if convertible, else @a c. + */ + char_type + tolower(char_type __c) const + { return this->do_tolower(__c); } + + /** + * @brief Convert array to lowercase. + * + * This function converts each char in the range [lo,hi) to lowercase + * if possible. Other chars remain untouched. + * + * tolower() acts as if it returns ctype:: do_tolower(lo, hi). + * do_tolower() must always return the same result for the same input. + * + * @param lo Pointer to first char in range. + * @param hi Pointer to end of range. + * @return @a hi. + */ + const char_type* + tolower(char_type* __lo, const char_type* __hi) const + { return this->do_tolower(__lo, __hi); } + + /** + * @brief Widen char + * + * This function converts the char to char_type using the simplest + * reasonable transformation. For an underived ctype facet, the + * argument will be returned unchanged. + * + * This function works as if it returns ctype::do_widen(c). + * do_widen() must always return the same result for the same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param c The char to convert. + * @return The converted character. + */ + char_type + widen(char __c) const + { + if (_M_widen_ok) + return _M_widen[static_cast(__c)]; + this->_M_widen_init(); + return this->do_widen(__c); + } + + /** + * @brief Widen char array + * + * This function converts each char in the input to char using the + * simplest reasonable transformation. For an underived ctype + * facet, the argument will be copied unchanged. + * + * This function works as if it returns ctype::do_widen(c). + * do_widen() must always return the same result for the same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param lo Pointer to first char in range. + * @param hi Pointer to end of range. + * @param to Pointer to the destination array. + * @return @a hi. + */ + const char* + widen(const char* __lo, const char* __hi, char_type* __to) const + { + if (_M_widen_ok == 1) + { + __builtin_memcpy(__to, __lo, __hi - __lo); + return __hi; + } + if (!_M_widen_ok) + _M_widen_init(); + return this->do_widen(__lo, __hi, __to); + } + + /** + * @brief Narrow char + * + * This function converts the char to char using the simplest + * reasonable transformation. If the conversion fails, dfault is + * returned instead. For an underived ctype facet, @a c + * will be returned unchanged. + * + * This function works as if it returns ctype::do_narrow(c). + * do_narrow() must always return the same result for the same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param c The char to convert. + * @param dfault Char to return if conversion fails. + * @return The converted character. + */ + char + narrow(char_type __c, char __dfault) const + { + if (_M_narrow[static_cast(__c)]) + return _M_narrow[static_cast(__c)]; + const char __t = do_narrow(__c, __dfault); + if (__t != __dfault) + _M_narrow[static_cast(__c)] = __t; + return __t; + } + + /** + * @brief Narrow char array + * + * This function converts each char in the input to char using the + * simplest reasonable transformation and writes the results to the + * destination array. For any char in the input that cannot be + * converted, @a dfault is used instead. For an underived ctype + * facet, the argument will be copied unchanged. + * + * This function works as if it returns ctype::do_narrow(lo, hi, + * dfault, to). do_narrow() must always return the same result for the + * same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @param dfault Char to use if conversion fails. + * @param to Pointer to the destination array. + * @return @a hi. + */ + const char_type* + narrow(const char_type* __lo, const char_type* __hi, + char __dfault, char *__to) const + { + if (__builtin_expect(_M_narrow_ok == 1, true)) + { + __builtin_memcpy(__to, __lo, __hi - __lo); + return __hi; + } + if (!_M_narrow_ok) + _M_narrow_init(); + return this->do_narrow(__lo, __hi, __dfault, __to); + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 695. ctype::classic_table() not accessible. + /// Returns a pointer to the mask table provided to the constructor, or + /// the default from classic_table() if none was provided. + const mask* + table() const throw() + { return _M_table; } + + /// Returns a pointer to the C locale mask table. + static const mask* + classic_table() throw(); + protected: + + /** + * @brief Destructor. + * + * This function deletes table() if @a del was true in the + * constructor. + */ + virtual + ~ctype(); + + /** + * @brief Convert to uppercase. + * + * This virtual function converts the char argument to uppercase if + * possible. If not possible (for example, '2'), returns the argument. + * + * do_toupper() is a hook for a derived facet to change the behavior of + * uppercasing. do_toupper() must always return the same result for + * the same input. + * + * @param c The char to convert. + * @return The uppercase char if convertible, else @a c. + */ + virtual char_type + do_toupper(char_type) const; + + /** + * @brief Convert array to uppercase. + * + * This virtual function converts each char in the range [lo,hi) to + * uppercase if possible. Other chars remain untouched. + * + * do_toupper() is a hook for a derived facet to change the behavior of + * uppercasing. do_toupper() must always return the same result for + * the same input. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return @a hi. + */ + virtual const char_type* + do_toupper(char_type* __lo, const char_type* __hi) const; + + /** + * @brief Convert to lowercase. + * + * This virtual function converts the char argument to lowercase if + * possible. If not possible (for example, '2'), returns the argument. + * + * do_tolower() is a hook for a derived facet to change the behavior of + * lowercasing. do_tolower() must always return the same result for + * the same input. + * + * @param c The char to convert. + * @return The lowercase char if convertible, else @a c. + */ + virtual char_type + do_tolower(char_type) const; + + /** + * @brief Convert array to lowercase. + * + * This virtual function converts each char in the range [lo,hi) to + * lowercase if possible. Other chars remain untouched. + * + * do_tolower() is a hook for a derived facet to change the behavior of + * lowercasing. do_tolower() must always return the same result for + * the same input. + * + * @param lo Pointer to first char in range. + * @param hi Pointer to end of range. + * @return @a hi. + */ + virtual const char_type* + do_tolower(char_type* __lo, const char_type* __hi) const; + + /** + * @brief Widen char + * + * This virtual function converts the char to char using the simplest + * reasonable transformation. For an underived ctype facet, the + * argument will be returned unchanged. + * + * do_widen() is a hook for a derived facet to change the behavior of + * widening. do_widen() must always return the same result for the + * same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param c The char to convert. + * @return The converted character. + */ + virtual char_type + do_widen(char __c) const + { return __c; } + + /** + * @brief Widen char array + * + * This function converts each char in the range [lo,hi) to char using + * the simplest reasonable transformation. For an underived + * ctype facet, the argument will be copied unchanged. + * + * do_widen() is a hook for a derived facet to change the behavior of + * widening. do_widen() must always return the same result for the + * same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @param to Pointer to the destination array. + * @return @a hi. + */ + virtual const char* + do_widen(const char* __lo, const char* __hi, char_type* __dest) const + { + __builtin_memcpy(__dest, __lo, __hi - __lo); + return __hi; + } + + /** + * @brief Narrow char + * + * This virtual function converts the char to char using the simplest + * reasonable transformation. If the conversion fails, dfault is + * returned instead. For an underived ctype facet, @a c will be + * returned unchanged. + * + * do_narrow() is a hook for a derived facet to change the behavior of + * narrowing. do_narrow() must always return the same result for the + * same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param c The char to convert. + * @param dfault Char to return if conversion fails. + * @return The converted char. + */ + virtual char + do_narrow(char_type __c, char) const + { return __c; } + + /** + * @brief Narrow char array to char array + * + * This virtual function converts each char in the range [lo,hi) to + * char using the simplest reasonable transformation and writes the + * results to the destination array. For any char in the input that + * cannot be converted, @a dfault is used instead. For an underived + * ctype facet, the argument will be copied unchanged. + * + * do_narrow() is a hook for a derived facet to change the behavior of + * narrowing. do_narrow() must always return the same result for the + * same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @param dfault Char to use if conversion fails. + * @param to Pointer to the destination array. + * @return @a hi. + */ + virtual const char_type* + do_narrow(const char_type* __lo, const char_type* __hi, + char, char* __dest) const + { + __builtin_memcpy(__dest, __lo, __hi - __lo); + return __hi; + } + + private: + void _M_narrow_init() const; + void _M_widen_init() const; + }; + +#ifdef _GLIBCXX_USE_WCHAR_T + // 22.2.1.3 ctype specialization + /** + * @brief The ctype specialization. + * + * This class defines classification and conversion functions for the + * wchar_t type. It gets used by wchar_t streams for many I/O operations. + * The wchar_t specialization provides a number of optimizations as well. + * + * ctype inherits its public methods from + * __ctype_abstract_base. + */ + template<> + class ctype : public __ctype_abstract_base + { + public: + // Types: + /// Typedef for the template parameter wchar_t. + typedef wchar_t char_type; + typedef wctype_t __wmask_type; + + protected: + __c_locale _M_c_locale_ctype; + + // Pre-computed narrowed and widened chars. + bool _M_narrow_ok; + char _M_narrow[128]; + wint_t _M_widen[1 + static_cast(-1)]; + + // Pre-computed elements for do_is. + mask _M_bit[16]; + __wmask_type _M_wmask[16]; + + public: + // Data Members: + /// The facet id for ctype + static locale::id id; + + /** + * @brief Constructor performs initialization. + * + * This is the constructor provided by the standard. + * + * @param refs Passed to the base facet class. + */ + explicit + ctype(size_t __refs = 0); + + /** + * @brief Constructor performs static initialization. + * + * This constructor is used to construct the initial C locale facet. + * + * @param cloc Handle to C locale data. + * @param refs Passed to the base facet class. + */ + explicit + ctype(__c_locale __cloc, size_t __refs = 0); + + protected: + __wmask_type + _M_convert_to_wmask(const mask __m) const; + + /// Destructor + virtual + ~ctype(); + + /** + * @brief Test wchar_t classification. + * + * This function finds a mask M for @a c and compares it to mask @a m. + * + * do_is() is a hook for a derived facet to change the behavior of + * classifying. do_is() must always return the same result for the + * same input. + * + * @param c The wchar_t to find the mask of. + * @param m The mask to compare against. + * @return (M & m) != 0. + */ + virtual bool + do_is(mask __m, char_type __c) const; + + /** + * @brief Return a mask array. + * + * This function finds the mask for each wchar_t in the range [lo,hi) + * and successively writes it to vec. vec must have as many elements + * as the input. + * + * do_is() is a hook for a derived facet to change the behavior of + * classifying. do_is() must always return the same result for the + * same input. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @param vec Pointer to an array of mask storage. + * @return @a hi. + */ + virtual const char_type* + do_is(const char_type* __lo, const char_type* __hi, mask* __vec) const; + + /** + * @brief Find wchar_t matching mask + * + * This function searches for and returns the first wchar_t c in + * [lo,hi) for which is(m,c) is true. + * + * do_scan_is() is a hook for a derived facet to change the behavior of + * match searching. do_is() must always return the same result for the + * same input. + * + * @param m The mask to compare against. + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return Pointer to a matching wchar_t if found, else @a hi. + */ + virtual const char_type* + do_scan_is(mask __m, const char_type* __lo, const char_type* __hi) const; + + /** + * @brief Find wchar_t not matching mask + * + * This function searches for and returns a pointer to the first + * wchar_t c of [lo,hi) for which is(m,c) is false. + * + * do_scan_is() is a hook for a derived facet to change the behavior of + * match searching. do_is() must always return the same result for the + * same input. + * + * @param m The mask to compare against. + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return Pointer to a non-matching wchar_t if found, else @a hi. + */ + virtual const char_type* + do_scan_not(mask __m, const char_type* __lo, + const char_type* __hi) const; + + /** + * @brief Convert to uppercase. + * + * This virtual function converts the wchar_t argument to uppercase if + * possible. If not possible (for example, '2'), returns the argument. + * + * do_toupper() is a hook for a derived facet to change the behavior of + * uppercasing. do_toupper() must always return the same result for + * the same input. + * + * @param c The wchar_t to convert. + * @return The uppercase wchar_t if convertible, else @a c. + */ + virtual char_type + do_toupper(char_type) const; + + /** + * @brief Convert array to uppercase. + * + * This virtual function converts each wchar_t in the range [lo,hi) to + * uppercase if possible. Other elements remain untouched. + * + * do_toupper() is a hook for a derived facet to change the behavior of + * uppercasing. do_toupper() must always return the same result for + * the same input. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return @a hi. + */ + virtual const char_type* + do_toupper(char_type* __lo, const char_type* __hi) const; + + /** + * @brief Convert to lowercase. + * + * This virtual function converts the argument to lowercase if + * possible. If not possible (for example, '2'), returns the argument. + * + * do_tolower() is a hook for a derived facet to change the behavior of + * lowercasing. do_tolower() must always return the same result for + * the same input. + * + * @param c The wchar_t to convert. + * @return The lowercase wchar_t if convertible, else @a c. + */ + virtual char_type + do_tolower(char_type) const; + + /** + * @brief Convert array to lowercase. + * + * This virtual function converts each wchar_t in the range [lo,hi) to + * lowercase if possible. Other elements remain untouched. + * + * do_tolower() is a hook for a derived facet to change the behavior of + * lowercasing. do_tolower() must always return the same result for + * the same input. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @return @a hi. + */ + virtual const char_type* + do_tolower(char_type* __lo, const char_type* __hi) const; + + /** + * @brief Widen char to wchar_t + * + * This virtual function converts the char to wchar_t using the + * simplest reasonable transformation. For an underived ctype + * facet, the argument will be cast to wchar_t. + * + * do_widen() is a hook for a derived facet to change the behavior of + * widening. do_widen() must always return the same result for the + * same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param c The char to convert. + * @return The converted wchar_t. + */ + virtual char_type + do_widen(char) const; + + /** + * @brief Widen char array to wchar_t array + * + * This function converts each char in the input to wchar_t using the + * simplest reasonable transformation. For an underived ctype + * facet, the argument will be copied, casting each element to wchar_t. + * + * do_widen() is a hook for a derived facet to change the behavior of + * widening. do_widen() must always return the same result for the + * same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param lo Pointer to start range. + * @param hi Pointer to end of range. + * @param to Pointer to the destination array. + * @return @a hi. + */ + virtual const char* + do_widen(const char* __lo, const char* __hi, char_type* __dest) const; + + /** + * @brief Narrow wchar_t to char + * + * This virtual function converts the argument to char using + * the simplest reasonable transformation. If the conversion + * fails, dfault is returned instead. For an underived + * ctype facet, @a c will be cast to char and + * returned. + * + * do_narrow() is a hook for a derived facet to change the + * behavior of narrowing. do_narrow() must always return the + * same result for the same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param c The wchar_t to convert. + * @param dfault Char to return if conversion fails. + * @return The converted char. + */ + virtual char + do_narrow(char_type, char __dfault) const; + + /** + * @brief Narrow wchar_t array to char array + * + * This virtual function converts each wchar_t in the range [lo,hi) to + * char using the simplest reasonable transformation and writes the + * results to the destination array. For any wchar_t in the input that + * cannot be converted, @a dfault is used instead. For an underived + * ctype facet, the argument will be copied, casting each + * element to char. + * + * do_narrow() is a hook for a derived facet to change the behavior of + * narrowing. do_narrow() must always return the same result for the + * same input. + * + * Note: this is not what you want for codepage conversions. See + * codecvt for that. + * + * @param lo Pointer to start of range. + * @param hi Pointer to end of range. + * @param dfault Char to use if conversion fails. + * @param to Pointer to the destination array. + * @return @a hi. + */ + virtual const char_type* + do_narrow(const char_type* __lo, const char_type* __hi, + char __dfault, char* __dest) const; + + // For use at construction time only. + void + _M_initialize_ctype(); + }; +#endif //_GLIBCXX_USE_WCHAR_T + + /// class ctype_byname [22.2.1.2]. + template + class ctype_byname : public ctype<_CharT> + { + public: + typedef typename ctype<_CharT>::mask mask; + + explicit + ctype_byname(const char* __s, size_t __refs = 0); + + protected: + virtual + ~ctype_byname() { }; + }; + + /// 22.2.1.4 Class ctype_byname specializations. + template<> + class ctype_byname : public ctype + { + public: + explicit + ctype_byname(const char* __s, size_t __refs = 0); + + protected: + virtual + ~ctype_byname(); + }; + +#ifdef _GLIBCXX_USE_WCHAR_T + template<> + class ctype_byname : public ctype + { + public: + explicit + ctype_byname(const char* __s, size_t __refs = 0); + + protected: + virtual + ~ctype_byname(); + }; +#endif + +_GLIBCXX_END_NAMESPACE + +// Include host and configuration specific ctype inlines. +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // 22.2.2 The numeric category. + class __num_base + { + public: + // NB: Code depends on the order of _S_atoms_out elements. + // Below are the indices into _S_atoms_out. + enum + { + _S_ominus, + _S_oplus, + _S_ox, + _S_oX, + _S_odigits, + _S_odigits_end = _S_odigits + 16, + _S_oudigits = _S_odigits_end, + _S_oudigits_end = _S_oudigits + 16, + _S_oe = _S_odigits + 14, // For scientific notation, 'e' + _S_oE = _S_oudigits + 14, // For scientific notation, 'E' + _S_oend = _S_oudigits_end + }; + + // A list of valid numeric literals for output. This array + // contains chars that will be passed through the current locale's + // ctype<_CharT>.widen() and then used to render numbers. + // For the standard "C" locale, this is + // "-+xX0123456789abcdef0123456789ABCDEF". + static const char* _S_atoms_out; + + // String literal of acceptable (narrow) input, for num_get. + // "-+xX0123456789abcdefABCDEF" + static const char* _S_atoms_in; + + enum + { + _S_iminus, + _S_iplus, + _S_ix, + _S_iX, + _S_izero, + _S_ie = _S_izero + 14, + _S_iE = _S_izero + 20, + _S_iend = 26 + }; + + // num_put + // Construct and return valid scanf format for floating point types. + static void + _S_format_float(const ios_base& __io, char* __fptr, char __mod); + }; + + template + struct __numpunct_cache : public locale::facet + { + const char* _M_grouping; + size_t _M_grouping_size; + bool _M_use_grouping; + const _CharT* _M_truename; + size_t _M_truename_size; + const _CharT* _M_falsename; + size_t _M_falsename_size; + _CharT _M_decimal_point; + _CharT _M_thousands_sep; + + // A list of valid numeric literals for output: in the standard + // "C" locale, this is "-+xX0123456789abcdef0123456789ABCDEF". + // This array contains the chars after having been passed + // through the current locale's ctype<_CharT>.widen(). + _CharT _M_atoms_out[__num_base::_S_oend]; + + // A list of valid numeric literals for input: in the standard + // "C" locale, this is "-+xX0123456789abcdefABCDEF" + // This array contains the chars after having been passed + // through the current locale's ctype<_CharT>.widen(). + _CharT _M_atoms_in[__num_base::_S_iend]; + + bool _M_allocated; + + __numpunct_cache(size_t __refs = 0) : facet(__refs), + _M_grouping(NULL), _M_grouping_size(0), _M_use_grouping(false), + _M_truename(NULL), _M_truename_size(0), _M_falsename(NULL), + _M_falsename_size(0), _M_decimal_point(_CharT()), + _M_thousands_sep(_CharT()), _M_allocated(false) + { } + + ~__numpunct_cache(); + + void + _M_cache(const locale& __loc); + + private: + __numpunct_cache& + operator=(const __numpunct_cache&); + + explicit + __numpunct_cache(const __numpunct_cache&); + }; + + template + __numpunct_cache<_CharT>::~__numpunct_cache() + { + if (_M_allocated) + { + delete [] _M_grouping; + delete [] _M_truename; + delete [] _M_falsename; + } + } + + /** + * @brief Numpunct facet. + * + * This facet stores several pieces of information related to printing and + * scanning numbers, such as the decimal point character. It takes a + * template parameter specifying the char type. The numpunct facet is + * used by streams for many I/O operations involving numbers. + * + * The numpunct template uses protected virtual functions to provide the + * actual results. The public accessors forward the call to the virtual + * functions. These virtual functions are hooks for developers to + * implement the behavior they require from a numpunct facet. + */ + template + class numpunct : public locale::facet + { + public: + // Types: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef basic_string<_CharT> string_type; + //@} + typedef __numpunct_cache<_CharT> __cache_type; + + protected: + __cache_type* _M_data; + + public: + /// Numpunct facet id. + static locale::id id; + + /** + * @brief Numpunct constructor. + * + * @param refs Refcount to pass to the base class. + */ + explicit + numpunct(size_t __refs = 0) : facet(__refs), _M_data(NULL) + { _M_initialize_numpunct(); } + + /** + * @brief Internal constructor. Not for general use. + * + * This is a constructor for use by the library itself to set up the + * predefined locale facets. + * + * @param cache __numpunct_cache object. + * @param refs Refcount to pass to the base class. + */ + explicit + numpunct(__cache_type* __cache, size_t __refs = 0) + : facet(__refs), _M_data(__cache) + { _M_initialize_numpunct(); } + + /** + * @brief Internal constructor. Not for general use. + * + * This is a constructor for use by the library itself to set up new + * locales. + * + * @param cloc The "C" locale. + * @param refs Refcount to pass to the base class. + */ + explicit + numpunct(__c_locale __cloc, size_t __refs = 0) + : facet(__refs), _M_data(NULL) + { _M_initialize_numpunct(__cloc); } + + /** + * @brief Return decimal point character. + * + * This function returns a char_type to use as a decimal point. It + * does so by returning returning + * numpunct::do_decimal_point(). + * + * @return @a char_type representing a decimal point. + */ + char_type + decimal_point() const + { return this->do_decimal_point(); } + + /** + * @brief Return thousands separator character. + * + * This function returns a char_type to use as a thousands + * separator. It does so by returning returning + * numpunct::do_thousands_sep(). + * + * @return char_type representing a thousands separator. + */ + char_type + thousands_sep() const + { return this->do_thousands_sep(); } + + /** + * @brief Return grouping specification. + * + * This function returns a string representing groupings for the + * integer part of a number. Groupings indicate where thousands + * separators should be inserted in the integer part of a number. + * + * Each char in the return string is interpret as an integer + * rather than a character. These numbers represent the number + * of digits in a group. The first char in the string + * represents the number of digits in the least significant + * group. If a char is negative, it indicates an unlimited + * number of digits for the group. If more chars from the + * string are required to group a number, the last char is used + * repeatedly. + * + * For example, if the grouping() returns "\003\002" and is + * applied to the number 123456789, this corresponds to + * 12,34,56,789. Note that if the string was "32", this would + * put more than 50 digits into the least significant group if + * the character set is ASCII. + * + * The string is returned by calling + * numpunct::do_grouping(). + * + * @return string representing grouping specification. + */ + string + grouping() const + { return this->do_grouping(); } + + /** + * @brief Return string representation of bool true. + * + * This function returns a string_type containing the text + * representation for true bool variables. It does so by calling + * numpunct::do_truename(). + * + * @return string_type representing printed form of true. + */ + string_type + truename() const + { return this->do_truename(); } + + /** + * @brief Return string representation of bool false. + * + * This function returns a string_type containing the text + * representation for false bool variables. It does so by calling + * numpunct::do_falsename(). + * + * @return string_type representing printed form of false. + */ + string_type + falsename() const + { return this->do_falsename(); } + + protected: + /// Destructor. + virtual + ~numpunct(); + + /** + * @brief Return decimal point character. + * + * Returns a char_type to use as a decimal point. This function is a + * hook for derived classes to change the value returned. + * + * @return @a char_type representing a decimal point. + */ + virtual char_type + do_decimal_point() const + { return _M_data->_M_decimal_point; } + + /** + * @brief Return thousands separator character. + * + * Returns a char_type to use as a thousands separator. This function + * is a hook for derived classes to change the value returned. + * + * @return @a char_type representing a thousands separator. + */ + virtual char_type + do_thousands_sep() const + { return _M_data->_M_thousands_sep; } + + /** + * @brief Return grouping specification. + * + * Returns a string representing groupings for the integer part of a + * number. This function is a hook for derived classes to change the + * value returned. @see grouping() for details. + * + * @return String representing grouping specification. + */ + virtual string + do_grouping() const + { return _M_data->_M_grouping; } + + /** + * @brief Return string representation of bool true. + * + * Returns a string_type containing the text representation for true + * bool variables. This function is a hook for derived classes to + * change the value returned. + * + * @return string_type representing printed form of true. + */ + virtual string_type + do_truename() const + { return _M_data->_M_truename; } + + /** + * @brief Return string representation of bool false. + * + * Returns a string_type containing the text representation for false + * bool variables. This function is a hook for derived classes to + * change the value returned. + * + * @return string_type representing printed form of false. + */ + virtual string_type + do_falsename() const + { return _M_data->_M_falsename; } + + // For use at construction time only. + void + _M_initialize_numpunct(__c_locale __cloc = NULL); + }; + + template + locale::id numpunct<_CharT>::id; + + template<> + numpunct::~numpunct(); + + template<> + void + numpunct::_M_initialize_numpunct(__c_locale __cloc); + +#ifdef _GLIBCXX_USE_WCHAR_T + template<> + numpunct::~numpunct(); + + template<> + void + numpunct::_M_initialize_numpunct(__c_locale __cloc); +#endif + + /// class numpunct_byname [22.2.3.2]. + template + class numpunct_byname : public numpunct<_CharT> + { + public: + typedef _CharT char_type; + typedef basic_string<_CharT> string_type; + + explicit + numpunct_byname(const char* __s, size_t __refs = 0) + : numpunct<_CharT>(__refs) + { + if (__builtin_strcmp(__s, "C") != 0 + && __builtin_strcmp(__s, "POSIX") != 0) + { + __c_locale __tmp; + this->_S_create_c_locale(__tmp, __s); + this->_M_initialize_numpunct(__tmp); + this->_S_destroy_c_locale(__tmp); + } + } + + protected: + virtual + ~numpunct_byname() { } + }; + +_GLIBCXX_BEGIN_LDBL_NAMESPACE + + /** + * @brief Facet for parsing number strings. + * + * This facet encapsulates the code to parse and return a number + * from a string. It is used by the istream numeric extraction + * operators. + * + * The num_get template uses protected virtual functions to provide the + * actual results. The public accessors forward the call to the virtual + * functions. These virtual functions are hooks for developers to + * implement the behavior they require from the num_get facet. + */ + template + class num_get : public locale::facet + { + public: + // Types: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef _InIter iter_type; + //@} + + /// Numpunct facet id. + static locale::id id; + + /** + * @brief Constructor performs initialization. + * + * This is the constructor provided by the standard. + * + * @param refs Passed to the base facet class. + */ + explicit + num_get(size_t __refs = 0) : facet(__refs) { } + + /** + * @brief Numeric parsing. + * + * Parses the input stream into the bool @a v. It does so by calling + * num_get::do_get(). + * + * If ios_base::boolalpha is set, attempts to read + * ctype::truename() or ctype::falsename(). Sets + * @a v to true or false if successful. Sets err to + * ios_base::failbit if reading the string fails. Sets err to + * ios_base::eofbit if the stream is emptied. + * + * If ios_base::boolalpha is not set, proceeds as with reading a long, + * except if the value is 1, sets @a v to true, if the value is 0, sets + * @a v to false, and otherwise set err to ios_base::failbit. + * + * @param in Start of input stream. + * @param end End of input stream. + * @param io Source of locale and flags. + * @param err Error flags to set. + * @param v Value to format and insert. + * @return Iterator after reading. + */ + iter_type + get(iter_type __in, iter_type __end, ios_base& __io, + ios_base::iostate& __err, bool& __v) const + { return this->do_get(__in, __end, __io, __err, __v); } + + //@{ + /** + * @brief Numeric parsing. + * + * Parses the input stream into the integral variable @a v. It does so + * by calling num_get::do_get(). + * + * Parsing is affected by the flag settings in @a io. + * + * The basic parse is affected by the value of io.flags() & + * ios_base::basefield. If equal to ios_base::oct, parses like the + * scanf %o specifier. Else if equal to ios_base::hex, parses like %X + * specifier. Else if basefield equal to 0, parses like the %i + * specifier. Otherwise, parses like %d for signed and %u for unsigned + * types. The matching type length modifier is also used. + * + * Digit grouping is interpreted according to numpunct::grouping() and + * numpunct::thousands_sep(). If the pattern of digit groups isn't + * consistent, sets err to ios_base::failbit. + * + * If parsing the string yields a valid value for @a v, @a v is set. + * Otherwise, sets err to ios_base::failbit and leaves @a v unaltered. + * Sets err to ios_base::eofbit if the stream is emptied. + * + * @param in Start of input stream. + * @param end End of input stream. + * @param io Source of locale and flags. + * @param err Error flags to set. + * @param v Value to format and insert. + * @return Iterator after reading. + */ + iter_type + get(iter_type __in, iter_type __end, ios_base& __io, + ios_base::iostate& __err, long& __v) const + { return this->do_get(__in, __end, __io, __err, __v); } + + iter_type + get(iter_type __in, iter_type __end, ios_base& __io, + ios_base::iostate& __err, unsigned short& __v) const + { return this->do_get(__in, __end, __io, __err, __v); } + + iter_type + get(iter_type __in, iter_type __end, ios_base& __io, + ios_base::iostate& __err, unsigned int& __v) const + { return this->do_get(__in, __end, __io, __err, __v); } + + iter_type + get(iter_type __in, iter_type __end, ios_base& __io, + ios_base::iostate& __err, unsigned long& __v) const + { return this->do_get(__in, __end, __io, __err, __v); } + +#ifdef _GLIBCXX_USE_LONG_LONG + iter_type + get(iter_type __in, iter_type __end, ios_base& __io, + ios_base::iostate& __err, long long& __v) const + { return this->do_get(__in, __end, __io, __err, __v); } + + iter_type + get(iter_type __in, iter_type __end, ios_base& __io, + ios_base::iostate& __err, unsigned long long& __v) const + { return this->do_get(__in, __end, __io, __err, __v); } +#endif + //@} + + //@{ + /** + * @brief Numeric parsing. + * + * Parses the input stream into the integral variable @a v. It does so + * by calling num_get::do_get(). + * + * The input characters are parsed like the scanf %g specifier. The + * matching type length modifier is also used. + * + * The decimal point character used is numpunct::decimal_point(). + * Digit grouping is interpreted according to numpunct::grouping() and + * numpunct::thousands_sep(). If the pattern of digit groups isn't + * consistent, sets err to ios_base::failbit. + * + * If parsing the string yields a valid value for @a v, @a v is set. + * Otherwise, sets err to ios_base::failbit and leaves @a v unaltered. + * Sets err to ios_base::eofbit if the stream is emptied. + * + * @param in Start of input stream. + * @param end End of input stream. + * @param io Source of locale and flags. + * @param err Error flags to set. + * @param v Value to format and insert. + * @return Iterator after reading. + */ + iter_type + get(iter_type __in, iter_type __end, ios_base& __io, + ios_base::iostate& __err, float& __v) const + { return this->do_get(__in, __end, __io, __err, __v); } + + iter_type + get(iter_type __in, iter_type __end, ios_base& __io, + ios_base::iostate& __err, double& __v) const + { return this->do_get(__in, __end, __io, __err, __v); } + + iter_type + get(iter_type __in, iter_type __end, ios_base& __io, + ios_base::iostate& __err, long double& __v) const + { return this->do_get(__in, __end, __io, __err, __v); } + //@} + + /** + * @brief Numeric parsing. + * + * Parses the input stream into the pointer variable @a v. It does so + * by calling num_get::do_get(). + * + * The input characters are parsed like the scanf %p specifier. + * + * Digit grouping is interpreted according to numpunct::grouping() and + * numpunct::thousands_sep(). If the pattern of digit groups isn't + * consistent, sets err to ios_base::failbit. + * + * Note that the digit grouping effect for pointers is a bit ambiguous + * in the standard and shouldn't be relied on. See DR 344. + * + * If parsing the string yields a valid value for @a v, @a v is set. + * Otherwise, sets err to ios_base::failbit and leaves @a v unaltered. + * Sets err to ios_base::eofbit if the stream is emptied. + * + * @param in Start of input stream. + * @param end End of input stream. + * @param io Source of locale and flags. + * @param err Error flags to set. + * @param v Value to format and insert. + * @return Iterator after reading. + */ + iter_type + get(iter_type __in, iter_type __end, ios_base& __io, + ios_base::iostate& __err, void*& __v) const + { return this->do_get(__in, __end, __io, __err, __v); } + + protected: + /// Destructor. + virtual ~num_get() { } + + iter_type + _M_extract_float(iter_type, iter_type, ios_base&, ios_base::iostate&, + string&) const; + + template + iter_type + _M_extract_int(iter_type, iter_type, ios_base&, ios_base::iostate&, + _ValueT&) const; + + template + typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, int>::__type + _M_find(const _CharT2*, size_t __len, _CharT2 __c) const + { + int __ret = -1; + if (__len <= 10) + { + if (__c >= _CharT2('0') && __c < _CharT2(_CharT2('0') + __len)) + __ret = __c - _CharT2('0'); + } + else + { + if (__c >= _CharT2('0') && __c <= _CharT2('9')) + __ret = __c - _CharT2('0'); + else if (__c >= _CharT2('a') && __c <= _CharT2('f')) + __ret = 10 + (__c - _CharT2('a')); + else if (__c >= _CharT2('A') && __c <= _CharT2('F')) + __ret = 10 + (__c - _CharT2('A')); + } + return __ret; + } + + template + typename __gnu_cxx::__enable_if::__value, + int>::__type + _M_find(const _CharT2* __zero, size_t __len, _CharT2 __c) const + { + int __ret = -1; + const char_type* __q = char_traits<_CharT2>::find(__zero, __len, __c); + if (__q) + { + __ret = __q - __zero; + if (__ret > 15) + __ret -= 6; + } + return __ret; + } + + //@{ + /** + * @brief Numeric parsing. + * + * Parses the input stream into the variable @a v. This function is a + * hook for derived classes to change the value returned. @see get() + * for more details. + * + * @param in Start of input stream. + * @param end End of input stream. + * @param io Source of locale and flags. + * @param err Error flags to set. + * @param v Value to format and insert. + * @return Iterator after reading. + */ + virtual iter_type + do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, bool&) const; + + virtual iter_type + do_get(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, long& __v) const + { return _M_extract_int(__beg, __end, __io, __err, __v); } + + virtual iter_type + do_get(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, unsigned short& __v) const + { return _M_extract_int(__beg, __end, __io, __err, __v); } + + virtual iter_type + do_get(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, unsigned int& __v) const + { return _M_extract_int(__beg, __end, __io, __err, __v); } + + virtual iter_type + do_get(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, unsigned long& __v) const + { return _M_extract_int(__beg, __end, __io, __err, __v); } + +#ifdef _GLIBCXX_USE_LONG_LONG + virtual iter_type + do_get(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, long long& __v) const + { return _M_extract_int(__beg, __end, __io, __err, __v); } + + virtual iter_type + do_get(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, unsigned long long& __v) const + { return _M_extract_int(__beg, __end, __io, __err, __v); } +#endif + + virtual iter_type + do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, + float&) const; + + virtual iter_type + do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, + double&) const; + + // XXX GLIBCXX_ABI Deprecated +#if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ + virtual iter_type + __do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, + double&) const; +#else + virtual iter_type + do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, + long double&) const; +#endif + + virtual iter_type + do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, + void*&) const; + + // XXX GLIBCXX_ABI Deprecated +#if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ + virtual iter_type + do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, + long double&) const; +#endif + //@} + }; + + template + locale::id num_get<_CharT, _InIter>::id; + + + /** + * @brief Facet for converting numbers to strings. + * + * This facet encapsulates the code to convert a number to a string. It is + * used by the ostream numeric insertion operators. + * + * The num_put template uses protected virtual functions to provide the + * actual results. The public accessors forward the call to the virtual + * functions. These virtual functions are hooks for developers to + * implement the behavior they require from the num_put facet. + */ + template + class num_put : public locale::facet + { + public: + // Types: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef _OutIter iter_type; + //@} + + /// Numpunct facet id. + static locale::id id; + + /** + * @brief Constructor performs initialization. + * + * This is the constructor provided by the standard. + * + * @param refs Passed to the base facet class. + */ + explicit + num_put(size_t __refs = 0) : facet(__refs) { } + + /** + * @brief Numeric formatting. + * + * Formats the boolean @a v and inserts it into a stream. It does so + * by calling num_put::do_put(). + * + * If ios_base::boolalpha is set, writes ctype::truename() or + * ctype::falsename(). Otherwise formats @a v as an int. + * + * @param s Stream to write to. + * @param io Source of locale and flags. + * @param fill Char_type to use for filling. + * @param v Value to format and insert. + * @return Iterator after writing. + */ + iter_type + put(iter_type __s, ios_base& __f, char_type __fill, bool __v) const + { return this->do_put(__s, __f, __fill, __v); } + + //@{ + /** + * @brief Numeric formatting. + * + * Formats the integral value @a v and inserts it into a + * stream. It does so by calling num_put::do_put(). + * + * Formatting is affected by the flag settings in @a io. + * + * The basic format is affected by the value of io.flags() & + * ios_base::basefield. If equal to ios_base::oct, formats like the + * printf %o specifier. Else if equal to ios_base::hex, formats like + * %x or %X with ios_base::uppercase unset or set respectively. + * Otherwise, formats like %d, %ld, %lld for signed and %u, %lu, %llu + * for unsigned values. Note that if both oct and hex are set, neither + * will take effect. + * + * If ios_base::showpos is set, '+' is output before positive values. + * If ios_base::showbase is set, '0' precedes octal values (except 0) + * and '0[xX]' precedes hex values. + * + * Thousands separators are inserted according to numpunct::grouping() + * and numpunct::thousands_sep(). The decimal point character used is + * numpunct::decimal_point(). + * + * If io.width() is non-zero, enough @a fill characters are inserted to + * make the result at least that wide. If + * (io.flags() & ios_base::adjustfield) == ios_base::left, result is + * padded at the end. If ios_base::internal, then padding occurs + * immediately after either a '+' or '-' or after '0x' or '0X'. + * Otherwise, padding occurs at the beginning. + * + * @param s Stream to write to. + * @param io Source of locale and flags. + * @param fill Char_type to use for filling. + * @param v Value to format and insert. + * @return Iterator after writing. + */ + iter_type + put(iter_type __s, ios_base& __f, char_type __fill, long __v) const + { return this->do_put(__s, __f, __fill, __v); } + + iter_type + put(iter_type __s, ios_base& __f, char_type __fill, + unsigned long __v) const + { return this->do_put(__s, __f, __fill, __v); } + +#ifdef _GLIBCXX_USE_LONG_LONG + iter_type + put(iter_type __s, ios_base& __f, char_type __fill, long long __v) const + { return this->do_put(__s, __f, __fill, __v); } + + iter_type + put(iter_type __s, ios_base& __f, char_type __fill, + unsigned long long __v) const + { return this->do_put(__s, __f, __fill, __v); } +#endif + //@} + + //@{ + /** + * @brief Numeric formatting. + * + * Formats the floating point value @a v and inserts it into a stream. + * It does so by calling num_put::do_put(). + * + * Formatting is affected by the flag settings in @a io. + * + * The basic format is affected by the value of io.flags() & + * ios_base::floatfield. If equal to ios_base::fixed, formats like the + * printf %f specifier. Else if equal to ios_base::scientific, formats + * like %e or %E with ios_base::uppercase unset or set respectively. + * Otherwise, formats like %g or %G depending on uppercase. Note that + * if both fixed and scientific are set, the effect will also be like + * %g or %G. + * + * The output precision is given by io.precision(). This precision is + * capped at numeric_limits::digits10 + 2 (different for double and + * long double). The default precision is 6. + * + * If ios_base::showpos is set, '+' is output before positive values. + * If ios_base::showpoint is set, a decimal point will always be + * output. + * + * Thousands separators are inserted according to numpunct::grouping() + * and numpunct::thousands_sep(). The decimal point character used is + * numpunct::decimal_point(). + * + * If io.width() is non-zero, enough @a fill characters are inserted to + * make the result at least that wide. If + * (io.flags() & ios_base::adjustfield) == ios_base::left, result is + * padded at the end. If ios_base::internal, then padding occurs + * immediately after either a '+' or '-' or after '0x' or '0X'. + * Otherwise, padding occurs at the beginning. + * + * @param s Stream to write to. + * @param io Source of locale and flags. + * @param fill Char_type to use for filling. + * @param v Value to format and insert. + * @return Iterator after writing. + */ + iter_type + put(iter_type __s, ios_base& __f, char_type __fill, double __v) const + { return this->do_put(__s, __f, __fill, __v); } + + iter_type + put(iter_type __s, ios_base& __f, char_type __fill, + long double __v) const + { return this->do_put(__s, __f, __fill, __v); } + //@} + + /** + * @brief Numeric formatting. + * + * Formats the pointer value @a v and inserts it into a stream. It + * does so by calling num_put::do_put(). + * + * This function formats @a v as an unsigned long with ios_base::hex + * and ios_base::showbase set. + * + * @param s Stream to write to. + * @param io Source of locale and flags. + * @param fill Char_type to use for filling. + * @param v Value to format and insert. + * @return Iterator after writing. + */ + iter_type + put(iter_type __s, ios_base& __f, char_type __fill, + const void* __v) const + { return this->do_put(__s, __f, __fill, __v); } + + protected: + template + iter_type + _M_insert_float(iter_type, ios_base& __io, char_type __fill, + char __mod, _ValueT __v) const; + + void + _M_group_float(const char* __grouping, size_t __grouping_size, + char_type __sep, const char_type* __p, char_type* __new, + char_type* __cs, int& __len) const; + + template + iter_type + _M_insert_int(iter_type, ios_base& __io, char_type __fill, + _ValueT __v) const; + + void + _M_group_int(const char* __grouping, size_t __grouping_size, + char_type __sep, ios_base& __io, char_type* __new, + char_type* __cs, int& __len) const; + + void + _M_pad(char_type __fill, streamsize __w, ios_base& __io, + char_type* __new, const char_type* __cs, int& __len) const; + + /// Destructor. + virtual + ~num_put() { }; + + //@{ + /** + * @brief Numeric formatting. + * + * These functions do the work of formatting numeric values and + * inserting them into a stream. This function is a hook for derived + * classes to change the value returned. + * + * @param s Stream to write to. + * @param io Source of locale and flags. + * @param fill Char_type to use for filling. + * @param v Value to format and insert. + * @return Iterator after writing. + */ + virtual iter_type + do_put(iter_type, ios_base&, char_type __fill, bool __v) const; + + virtual iter_type + do_put(iter_type __s, ios_base& __io, char_type __fill, long __v) const + { return _M_insert_int(__s, __io, __fill, __v); } + + virtual iter_type + do_put(iter_type __s, ios_base& __io, char_type __fill, + unsigned long __v) const + { return _M_insert_int(__s, __io, __fill, __v); } + +#ifdef _GLIBCXX_USE_LONG_LONG + virtual iter_type + do_put(iter_type __s, ios_base& __io, char_type __fill, + long long __v) const + { return _M_insert_int(__s, __io, __fill, __v); } + + virtual iter_type + do_put(iter_type __s, ios_base& __io, char_type __fill, + unsigned long long __v) const + { return _M_insert_int(__s, __io, __fill, __v); } +#endif + + virtual iter_type + do_put(iter_type, ios_base&, char_type __fill, double __v) const; + + // XXX GLIBCXX_ABI Deprecated +#if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ + virtual iter_type + __do_put(iter_type, ios_base&, char_type __fill, double __v) const; +#else + virtual iter_type + do_put(iter_type, ios_base&, char_type __fill, long double __v) const; +#endif + + virtual iter_type + do_put(iter_type, ios_base&, char_type __fill, const void* __v) const; + + // XXX GLIBCXX_ABI Deprecated +#if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ + virtual iter_type + do_put(iter_type, ios_base&, char_type __fill, long double __v) const; +#endif + //@} + }; + + template + locale::id num_put<_CharT, _OutIter>::id; + +_GLIBCXX_END_LDBL_NAMESPACE + + // Subclause convenience interfaces, inlines. + // NB: These are inline because, when used in a loop, some compilers + // can hoist the body out of the loop; then it's just as fast as the + // C is*() function. + + /// Convenience interface to ctype.is(ctype_base::space, __c). + template + inline bool + isspace(_CharT __c, const locale& __loc) + { return use_facet >(__loc).is(ctype_base::space, __c); } + + /// Convenience interface to ctype.is(ctype_base::print, __c). + template + inline bool + isprint(_CharT __c, const locale& __loc) + { return use_facet >(__loc).is(ctype_base::print, __c); } + + /// Convenience interface to ctype.is(ctype_base::cntrl, __c). + template + inline bool + iscntrl(_CharT __c, const locale& __loc) + { return use_facet >(__loc).is(ctype_base::cntrl, __c); } + + /// Convenience interface to ctype.is(ctype_base::upper, __c). + template + inline bool + isupper(_CharT __c, const locale& __loc) + { return use_facet >(__loc).is(ctype_base::upper, __c); } + + /// Convenience interface to ctype.is(ctype_base::lower, __c). + template + inline bool + islower(_CharT __c, const locale& __loc) + { return use_facet >(__loc).is(ctype_base::lower, __c); } + + /// Convenience interface to ctype.is(ctype_base::alpha, __c). + template + inline bool + isalpha(_CharT __c, const locale& __loc) + { return use_facet >(__loc).is(ctype_base::alpha, __c); } + + /// Convenience interface to ctype.is(ctype_base::digit, __c). + template + inline bool + isdigit(_CharT __c, const locale& __loc) + { return use_facet >(__loc).is(ctype_base::digit, __c); } + + /// Convenience interface to ctype.is(ctype_base::punct, __c). + template + inline bool + ispunct(_CharT __c, const locale& __loc) + { return use_facet >(__loc).is(ctype_base::punct, __c); } + + /// Convenience interface to ctype.is(ctype_base::xdigit, __c). + template + inline bool + isxdigit(_CharT __c, const locale& __loc) + { return use_facet >(__loc).is(ctype_base::xdigit, __c); } + + /// Convenience interface to ctype.is(ctype_base::alnum, __c). + template + inline bool + isalnum(_CharT __c, const locale& __loc) + { return use_facet >(__loc).is(ctype_base::alnum, __c); } + + /// Convenience interface to ctype.is(ctype_base::graph, __c). + template + inline bool + isgraph(_CharT __c, const locale& __loc) + { return use_facet >(__loc).is(ctype_base::graph, __c); } + + /// Convenience interface to ctype.toupper(__c). + template + inline _CharT + toupper(_CharT __c, const locale& __loc) + { return use_facet >(__loc).toupper(__c); } + + /// Convenience interface to ctype.tolower(__c). + template + inline _CharT + tolower(_CharT __c, const locale& __loc) + { return use_facet >(__loc).tolower(__c); } + +_GLIBCXX_END_NAMESPACE + +#ifndef _GLIBCXX_EXPORT_TEMPLATE +# include +#endif + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/locale_facets.tcc b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/locale_facets.tcc new file mode 100644 index 00000000..47eac6a4 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/locale_facets.tcc @@ -0,0 +1,1344 @@ +// Locale support -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file locale_facets.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _LOCALE_FACETS_TCC +#define _LOCALE_FACETS_TCC 1 + +#pragma GCC system_header + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // Routine to access a cache for the facet. If the cache didn't + // exist before, it gets constructed on the fly. + template + struct __use_cache + { + const _Facet* + operator() (const locale& __loc) const; + }; + + // Specializations. + template + struct __use_cache<__numpunct_cache<_CharT> > + { + const __numpunct_cache<_CharT>* + operator() (const locale& __loc) const + { + const size_t __i = numpunct<_CharT>::id._M_id(); + const locale::facet** __caches = __loc._M_impl->_M_caches; + if (!__caches[__i]) + { + __numpunct_cache<_CharT>* __tmp = NULL; + __try + { + __tmp = new __numpunct_cache<_CharT>; + __tmp->_M_cache(__loc); + } + __catch(...) + { + delete __tmp; + __throw_exception_again; + } + __loc._M_impl->_M_install_cache(__tmp, __i); + } + return static_cast*>(__caches[__i]); + } + }; + + template + void + __numpunct_cache<_CharT>::_M_cache(const locale& __loc) + { + _M_allocated = true; + + const numpunct<_CharT>& __np = use_facet >(__loc); + + _M_grouping_size = __np.grouping().size(); + char* __grouping = new char[_M_grouping_size]; + __np.grouping().copy(__grouping, _M_grouping_size); + _M_grouping = __grouping; + _M_use_grouping = (_M_grouping_size + && static_cast(_M_grouping[0]) > 0 + && (_M_grouping[0] + != __gnu_cxx::__numeric_traits::__max)); + + _M_truename_size = __np.truename().size(); + _CharT* __truename = new _CharT[_M_truename_size]; + __np.truename().copy(__truename, _M_truename_size); + _M_truename = __truename; + + _M_falsename_size = __np.falsename().size(); + _CharT* __falsename = new _CharT[_M_falsename_size]; + __np.falsename().copy(__falsename, _M_falsename_size); + _M_falsename = __falsename; + + _M_decimal_point = __np.decimal_point(); + _M_thousands_sep = __np.thousands_sep(); + + const ctype<_CharT>& __ct = use_facet >(__loc); + __ct.widen(__num_base::_S_atoms_out, + __num_base::_S_atoms_out + __num_base::_S_oend, _M_atoms_out); + __ct.widen(__num_base::_S_atoms_in, + __num_base::_S_atoms_in + __num_base::_S_iend, _M_atoms_in); + } + + // Used by both numeric and monetary facets. + // Check to make sure that the __grouping_tmp string constructed in + // money_get or num_get matches the canonical grouping for a given + // locale. + // __grouping_tmp is parsed L to R + // 1,222,444 == __grouping_tmp of "\1\3\3" + // __grouping is parsed R to L + // 1,222,444 == __grouping of "\3" == "\3\3\3" + bool + __verify_grouping(const char* __grouping, size_t __grouping_size, + const string& __grouping_tmp); + +_GLIBCXX_BEGIN_LDBL_NAMESPACE + + template + _InIter + num_get<_CharT, _InIter>:: + _M_extract_float(_InIter __beg, _InIter __end, ios_base& __io, + ios_base::iostate& __err, string& __xtrc) const + { + typedef char_traits<_CharT> __traits_type; + typedef __numpunct_cache<_CharT> __cache_type; + __use_cache<__cache_type> __uc; + const locale& __loc = __io._M_getloc(); + const __cache_type* __lc = __uc(__loc); + const _CharT* __lit = __lc->_M_atoms_in; + char_type __c = char_type(); + + // True if __beg becomes equal to __end. + bool __testeof = __beg == __end; + + // First check for sign. + if (!__testeof) + { + __c = *__beg; + const bool __plus = __c == __lit[__num_base::_S_iplus]; + if ((__plus || __c == __lit[__num_base::_S_iminus]) + && !(__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) + && !(__c == __lc->_M_decimal_point)) + { + __xtrc += __plus ? '+' : '-'; + if (++__beg != __end) + __c = *__beg; + else + __testeof = true; + } + } + + // Next, look for leading zeros. + bool __found_mantissa = false; + int __sep_pos = 0; + while (!__testeof) + { + if ((__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) + || __c == __lc->_M_decimal_point) + break; + else if (__c == __lit[__num_base::_S_izero]) + { + if (!__found_mantissa) + { + __xtrc += '0'; + __found_mantissa = true; + } + ++__sep_pos; + + if (++__beg != __end) + __c = *__beg; + else + __testeof = true; + } + else + break; + } + + // Only need acceptable digits for floating point numbers. + bool __found_dec = false; + bool __found_sci = false; + string __found_grouping; + if (__lc->_M_use_grouping) + __found_grouping.reserve(32); + const char_type* __lit_zero = __lit + __num_base::_S_izero; + + if (!__lc->_M_allocated) + // "C" locale + while (!__testeof) + { + const int __digit = _M_find(__lit_zero, 10, __c); + if (__digit != -1) + { + __xtrc += '0' + __digit; + __found_mantissa = true; + } + else if (__c == __lc->_M_decimal_point + && !__found_dec && !__found_sci) + { + __xtrc += '.'; + __found_dec = true; + } + else if ((__c == __lit[__num_base::_S_ie] + || __c == __lit[__num_base::_S_iE]) + && !__found_sci && __found_mantissa) + { + // Scientific notation. + __xtrc += 'e'; + __found_sci = true; + + // Remove optional plus or minus sign, if they exist. + if (++__beg != __end) + { + __c = *__beg; + const bool __plus = __c == __lit[__num_base::_S_iplus]; + if (__plus || __c == __lit[__num_base::_S_iminus]) + __xtrc += __plus ? '+' : '-'; + else + continue; + } + else + { + __testeof = true; + break; + } + } + else + break; + + if (++__beg != __end) + __c = *__beg; + else + __testeof = true; + } + else + while (!__testeof) + { + // According to 22.2.2.1.2, p8-9, first look for thousands_sep + // and decimal_point. + if (__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) + { + if (!__found_dec && !__found_sci) + { + // NB: Thousands separator at the beginning of a string + // is a no-no, as is two consecutive thousands separators. + if (__sep_pos) + { + __found_grouping += static_cast(__sep_pos); + __sep_pos = 0; + } + else + { + // NB: __convert_to_v will not assign __v and will + // set the failbit. + __xtrc.clear(); + break; + } + } + else + break; + } + else if (__c == __lc->_M_decimal_point) + { + if (!__found_dec && !__found_sci) + { + // If no grouping chars are seen, no grouping check + // is applied. Therefore __found_grouping is adjusted + // only if decimal_point comes after some thousands_sep. + if (__found_grouping.size()) + __found_grouping += static_cast(__sep_pos); + __xtrc += '.'; + __found_dec = true; + } + else + break; + } + else + { + const char_type* __q = + __traits_type::find(__lit_zero, 10, __c); + if (__q) + { + __xtrc += '0' + (__q - __lit_zero); + __found_mantissa = true; + ++__sep_pos; + } + else if ((__c == __lit[__num_base::_S_ie] + || __c == __lit[__num_base::_S_iE]) + && !__found_sci && __found_mantissa) + { + // Scientific notation. + if (__found_grouping.size() && !__found_dec) + __found_grouping += static_cast(__sep_pos); + __xtrc += 'e'; + __found_sci = true; + + // Remove optional plus or minus sign, if they exist. + if (++__beg != __end) + { + __c = *__beg; + const bool __plus = __c == __lit[__num_base::_S_iplus]; + if ((__plus || __c == __lit[__num_base::_S_iminus]) + && !(__lc->_M_use_grouping + && __c == __lc->_M_thousands_sep) + && !(__c == __lc->_M_decimal_point)) + __xtrc += __plus ? '+' : '-'; + else + continue; + } + else + { + __testeof = true; + break; + } + } + else + break; + } + + if (++__beg != __end) + __c = *__beg; + else + __testeof = true; + } + + // Digit grouping is checked. If grouping and found_grouping don't + // match, then get very very upset, and set failbit. + if (__found_grouping.size()) + { + // Add the ending grouping if a decimal or 'e'/'E' wasn't found. + if (!__found_dec && !__found_sci) + __found_grouping += static_cast(__sep_pos); + + if (!std::__verify_grouping(__lc->_M_grouping, + __lc->_M_grouping_size, + __found_grouping)) + __err = ios_base::failbit; + } + + return __beg; + } + + template + template + _InIter + num_get<_CharT, _InIter>:: + _M_extract_int(_InIter __beg, _InIter __end, ios_base& __io, + ios_base::iostate& __err, _ValueT& __v) const + { + typedef char_traits<_CharT> __traits_type; + using __gnu_cxx::__add_unsigned; + typedef typename __add_unsigned<_ValueT>::__type __unsigned_type; + typedef __numpunct_cache<_CharT> __cache_type; + __use_cache<__cache_type> __uc; + const locale& __loc = __io._M_getloc(); + const __cache_type* __lc = __uc(__loc); + const _CharT* __lit = __lc->_M_atoms_in; + char_type __c = char_type(); + + // NB: Iff __basefield == 0, __base can change based on contents. + const ios_base::fmtflags __basefield = __io.flags() + & ios_base::basefield; + const bool __oct = __basefield == ios_base::oct; + int __base = __oct ? 8 : (__basefield == ios_base::hex ? 16 : 10); + + // True if __beg becomes equal to __end. + bool __testeof = __beg == __end; + + // First check for sign. + bool __negative = false; + if (!__testeof) + { + __c = *__beg; + if (__gnu_cxx::__numeric_traits<_ValueT>::__is_signed) + __negative = __c == __lit[__num_base::_S_iminus]; + if ((__negative || __c == __lit[__num_base::_S_iplus]) + && !(__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) + && !(__c == __lc->_M_decimal_point)) + { + if (++__beg != __end) + __c = *__beg; + else + __testeof = true; + } + } + + // Next, look for leading zeros and check required digits + // for base formats. + bool __found_zero = false; + int __sep_pos = 0; + while (!__testeof) + { + if ((__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) + || __c == __lc->_M_decimal_point) + break; + else if (__c == __lit[__num_base::_S_izero] + && (!__found_zero || __base == 10)) + { + __found_zero = true; + ++__sep_pos; + if (__basefield == 0) + __base = 8; + if (__base == 8) + __sep_pos = 0; + } + else if (__found_zero + && (__c == __lit[__num_base::_S_ix] + || __c == __lit[__num_base::_S_iX])) + { + if (__basefield == 0) + __base = 16; + if (__base == 16) + { + __found_zero = false; + __sep_pos = 0; + } + else + break; + } + else + break; + + if (++__beg != __end) + { + __c = *__beg; + if (!__found_zero) + break; + } + else + __testeof = true; + } + + // At this point, base is determined. If not hex, only allow + // base digits as valid input. + const size_t __len = (__base == 16 ? __num_base::_S_iend + - __num_base::_S_izero : __base); + + // Extract. + string __found_grouping; + if (__lc->_M_use_grouping) + __found_grouping.reserve(32); + bool __testfail = false; + bool __testoverflow = false; + const __unsigned_type __max = __negative + ? -__gnu_cxx::__numeric_traits<_ValueT>::__min + : __gnu_cxx::__numeric_traits<_ValueT>::__max; + const __unsigned_type __smax = __max / __base; + __unsigned_type __result = 0; + int __digit = 0; + const char_type* __lit_zero = __lit + __num_base::_S_izero; + + if (!__lc->_M_allocated) + // "C" locale + while (!__testeof) + { + __digit = _M_find(__lit_zero, __len, __c); + if (__digit == -1) + break; + + if (__result > __smax) + __testoverflow = true; + else + { + __result *= __base; + __testoverflow |= __result > __max - __digit; + __result += __digit; + ++__sep_pos; + } + + if (++__beg != __end) + __c = *__beg; + else + __testeof = true; + } + else + while (!__testeof) + { + // According to 22.2.2.1.2, p8-9, first look for thousands_sep + // and decimal_point. + if (__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) + { + // NB: Thousands separator at the beginning of a string + // is a no-no, as is two consecutive thousands separators. + if (__sep_pos) + { + __found_grouping += static_cast(__sep_pos); + __sep_pos = 0; + } + else + { + __testfail = true; + break; + } + } + else if (__c == __lc->_M_decimal_point) + break; + else + { + const char_type* __q = + __traits_type::find(__lit_zero, __len, __c); + if (!__q) + break; + + __digit = __q - __lit_zero; + if (__digit > 15) + __digit -= 6; + if (__result > __smax) + __testoverflow = true; + else + { + __result *= __base; + __testoverflow |= __result > __max - __digit; + __result += __digit; + ++__sep_pos; + } + } + + if (++__beg != __end) + __c = *__beg; + else + __testeof = true; + } + + // Digit grouping is checked. If grouping and found_grouping don't + // match, then get very very upset, and set failbit. + if (__found_grouping.size()) + { + // Add the ending grouping. + __found_grouping += static_cast(__sep_pos); + + if (!std::__verify_grouping(__lc->_M_grouping, + __lc->_M_grouping_size, + __found_grouping)) + __err = ios_base::failbit; + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 23. Num_get overflow result. + if ((!__sep_pos && !__found_zero && !__found_grouping.size()) + || __testfail) + { + __v = 0; + __err = ios_base::failbit; + } + else if (__testoverflow) + { + if (__negative) + __v = __gnu_cxx::__numeric_traits<_ValueT>::__min; + else + __v = __gnu_cxx::__numeric_traits<_ValueT>::__max; + __err = ios_base::failbit; + } + else + __v = __negative ? -__result : __result; + + if (__testeof) + __err |= ios_base::eofbit; + return __beg; + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 17. Bad bool parsing + template + _InIter + num_get<_CharT, _InIter>:: + do_get(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, bool& __v) const + { + if (!(__io.flags() & ios_base::boolalpha)) + { + // Parse bool values as long. + // NB: We can't just call do_get(long) here, as it might + // refer to a derived class. + long __l = -1; + __beg = _M_extract_int(__beg, __end, __io, __err, __l); + if (__l == 0 || __l == 1) + __v = bool(__l); + else + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 23. Num_get overflow result. + __v = true; + __err = ios_base::failbit; + if (__beg == __end) + __err |= ios_base::eofbit; + } + } + else + { + // Parse bool values as alphanumeric. + typedef __numpunct_cache<_CharT> __cache_type; + __use_cache<__cache_type> __uc; + const locale& __loc = __io._M_getloc(); + const __cache_type* __lc = __uc(__loc); + + bool __testf = true; + bool __testt = true; + bool __donef = __lc->_M_falsename_size == 0; + bool __donet = __lc->_M_truename_size == 0; + bool __testeof = false; + size_t __n = 0; + while (!__donef || !__donet) + { + if (__beg == __end) + { + __testeof = true; + break; + } + + const char_type __c = *__beg; + + if (!__donef) + __testf = __c == __lc->_M_falsename[__n]; + + if (!__testf && __donet) + break; + + if (!__donet) + __testt = __c == __lc->_M_truename[__n]; + + if (!__testt && __donef) + break; + + if (!__testt && !__testf) + break; + + ++__n; + ++__beg; + + __donef = !__testf || __n >= __lc->_M_falsename_size; + __donet = !__testt || __n >= __lc->_M_truename_size; + } + if (__testf && __n == __lc->_M_falsename_size && __n) + { + __v = false; + if (__testt && __n == __lc->_M_truename_size) + __err = ios_base::failbit; + else + __err = __testeof ? ios_base::eofbit : ios_base::goodbit; + } + else if (__testt && __n == __lc->_M_truename_size && __n) + { + __v = true; + __err = __testeof ? ios_base::eofbit : ios_base::goodbit; + } + else + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 23. Num_get overflow result. + __v = false; + __err = ios_base::failbit; + if (__testeof) + __err |= ios_base::eofbit; + } + } + return __beg; + } + + template + _InIter + num_get<_CharT, _InIter>:: + do_get(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, float& __v) const + { + string __xtrc; + __xtrc.reserve(32); + __beg = _M_extract_float(__beg, __end, __io, __err, __xtrc); + std::__convert_to_v(__xtrc.c_str(), __v, __err, _S_get_c_locale()); + if (__beg == __end) + __err |= ios_base::eofbit; + return __beg; + } + + template + _InIter + num_get<_CharT, _InIter>:: + do_get(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, double& __v) const + { + string __xtrc; + __xtrc.reserve(32); + __beg = _M_extract_float(__beg, __end, __io, __err, __xtrc); + std::__convert_to_v(__xtrc.c_str(), __v, __err, _S_get_c_locale()); + if (__beg == __end) + __err |= ios_base::eofbit; + return __beg; + } + +#if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ + template + _InIter + num_get<_CharT, _InIter>:: + __do_get(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, double& __v) const + { + string __xtrc; + __xtrc.reserve(32); + __beg = _M_extract_float(__beg, __end, __io, __err, __xtrc); + std::__convert_to_v(__xtrc.c_str(), __v, __err, _S_get_c_locale()); + if (__beg == __end) + __err |= ios_base::eofbit; + return __beg; + } +#endif + + template + _InIter + num_get<_CharT, _InIter>:: + do_get(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, long double& __v) const + { + string __xtrc; + __xtrc.reserve(32); + __beg = _M_extract_float(__beg, __end, __io, __err, __xtrc); + std::__convert_to_v(__xtrc.c_str(), __v, __err, _S_get_c_locale()); + if (__beg == __end) + __err |= ios_base::eofbit; + return __beg; + } + + template + _InIter + num_get<_CharT, _InIter>:: + do_get(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, void*& __v) const + { + // Prepare for hex formatted input. + typedef ios_base::fmtflags fmtflags; + const fmtflags __fmt = __io.flags(); + __io.flags((__fmt & ~ios_base::basefield) | ios_base::hex); + + typedef __gnu_cxx::__conditional_type<(sizeof(void*) + <= sizeof(unsigned long)), + unsigned long, unsigned long long>::__type _UIntPtrType; + + _UIntPtrType __ul; + __beg = _M_extract_int(__beg, __end, __io, __err, __ul); + + // Reset from hex formatted input. + __io.flags(__fmt); + + __v = reinterpret_cast(__ul); + return __beg; + } + + // For use by integer and floating-point types after they have been + // converted into a char_type string. + template + void + num_put<_CharT, _OutIter>:: + _M_pad(_CharT __fill, streamsize __w, ios_base& __io, + _CharT* __new, const _CharT* __cs, int& __len) const + { + // [22.2.2.2.2] Stage 3. + // If necessary, pad. + __pad<_CharT, char_traits<_CharT> >::_S_pad(__io, __fill, __new, + __cs, __w, __len); + __len = static_cast(__w); + } + +_GLIBCXX_END_LDBL_NAMESPACE + + template + int + __int_to_char(_CharT* __bufend, _ValueT __v, const _CharT* __lit, + ios_base::fmtflags __flags, bool __dec) + { + _CharT* __buf = __bufend; + if (__builtin_expect(__dec, true)) + { + // Decimal. + do + { + *--__buf = __lit[(__v % 10) + __num_base::_S_odigits]; + __v /= 10; + } + while (__v != 0); + } + else if ((__flags & ios_base::basefield) == ios_base::oct) + { + // Octal. + do + { + *--__buf = __lit[(__v & 0x7) + __num_base::_S_odigits]; + __v >>= 3; + } + while (__v != 0); + } + else + { + // Hex. + const bool __uppercase = __flags & ios_base::uppercase; + const int __case_offset = __uppercase ? __num_base::_S_oudigits + : __num_base::_S_odigits; + do + { + *--__buf = __lit[(__v & 0xf) + __case_offset]; + __v >>= 4; + } + while (__v != 0); + } + return __bufend - __buf; + } + +_GLIBCXX_BEGIN_LDBL_NAMESPACE + + template + void + num_put<_CharT, _OutIter>:: + _M_group_int(const char* __grouping, size_t __grouping_size, _CharT __sep, + ios_base&, _CharT* __new, _CharT* __cs, int& __len) const + { + _CharT* __p = std::__add_grouping(__new, __sep, __grouping, + __grouping_size, __cs, __cs + __len); + __len = __p - __new; + } + + template + template + _OutIter + num_put<_CharT, _OutIter>:: + _M_insert_int(_OutIter __s, ios_base& __io, _CharT __fill, + _ValueT __v) const + { + using __gnu_cxx::__add_unsigned; + typedef typename __add_unsigned<_ValueT>::__type __unsigned_type; + typedef __numpunct_cache<_CharT> __cache_type; + __use_cache<__cache_type> __uc; + const locale& __loc = __io._M_getloc(); + const __cache_type* __lc = __uc(__loc); + const _CharT* __lit = __lc->_M_atoms_out; + const ios_base::fmtflags __flags = __io.flags(); + + // Long enough to hold hex, dec, and octal representations. + const int __ilen = 5 * sizeof(_ValueT); + _CharT* __cs = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) + * __ilen)); + + // [22.2.2.2.2] Stage 1, numeric conversion to character. + // Result is returned right-justified in the buffer. + const ios_base::fmtflags __basefield = __flags & ios_base::basefield; + const bool __dec = (__basefield != ios_base::oct + && __basefield != ios_base::hex); + const __unsigned_type __u = ((__v > 0 || !__dec) + ? __unsigned_type(__v) + : -__unsigned_type(__v)); + int __len = __int_to_char(__cs + __ilen, __u, __lit, __flags, __dec); + __cs += __ilen - __len; + + // Add grouping, if necessary. + if (__lc->_M_use_grouping) + { + // Grouping can add (almost) as many separators as the number + // of digits + space is reserved for numeric base or sign. + _CharT* __cs2 = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) + * (__len + 1) + * 2)); + _M_group_int(__lc->_M_grouping, __lc->_M_grouping_size, + __lc->_M_thousands_sep, __io, __cs2 + 2, __cs, __len); + __cs = __cs2 + 2; + } + + // Complete Stage 1, prepend numeric base or sign. + if (__builtin_expect(__dec, true)) + { + // Decimal. + if (__v >= 0) + { + if (bool(__flags & ios_base::showpos) + && __gnu_cxx::__numeric_traits<_ValueT>::__is_signed) + *--__cs = __lit[__num_base::_S_oplus], ++__len; + } + else + *--__cs = __lit[__num_base::_S_ominus], ++__len; + } + else if (bool(__flags & ios_base::showbase) && __v) + { + if (__basefield == ios_base::oct) + *--__cs = __lit[__num_base::_S_odigits], ++__len; + else + { + // 'x' or 'X' + const bool __uppercase = __flags & ios_base::uppercase; + *--__cs = __lit[__num_base::_S_ox + __uppercase]; + // '0' + *--__cs = __lit[__num_base::_S_odigits]; + __len += 2; + } + } + + // Pad. + const streamsize __w = __io.width(); + if (__w > static_cast(__len)) + { + _CharT* __cs3 = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) + * __w)); + _M_pad(__fill, __w, __io, __cs3, __cs, __len); + __cs = __cs3; + } + __io.width(0); + + // [22.2.2.2.2] Stage 4. + // Write resulting, fully-formatted string to output iterator. + return std::__write(__s, __cs, __len); + } + + template + void + num_put<_CharT, _OutIter>:: + _M_group_float(const char* __grouping, size_t __grouping_size, + _CharT __sep, const _CharT* __p, _CharT* __new, + _CharT* __cs, int& __len) const + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 282. What types does numpunct grouping refer to? + // Add grouping, if necessary. + const int __declen = __p ? __p - __cs : __len; + _CharT* __p2 = std::__add_grouping(__new, __sep, __grouping, + __grouping_size, + __cs, __cs + __declen); + + // Tack on decimal part. + int __newlen = __p2 - __new; + if (__p) + { + char_traits<_CharT>::copy(__p2, __p, __len - __declen); + __newlen += __len - __declen; + } + __len = __newlen; + } + + // The following code uses vsnprintf (or vsprintf(), when + // _GLIBCXX_USE_C99 is not defined) to convert floating point values + // for insertion into a stream. An optimization would be to replace + // them with code that works directly on a wide buffer and then use + // __pad to do the padding. It would be good to replace them anyway + // to gain back the efficiency that C++ provides by knowing up front + // the type of the values to insert. Also, sprintf is dangerous + // since may lead to accidental buffer overruns. This + // implementation follows the C++ standard fairly directly as + // outlined in 22.2.2.2 [lib.locale.num.put] + template + template + _OutIter + num_put<_CharT, _OutIter>:: + _M_insert_float(_OutIter __s, ios_base& __io, _CharT __fill, char __mod, + _ValueT __v) const + { + typedef __numpunct_cache<_CharT> __cache_type; + __use_cache<__cache_type> __uc; + const locale& __loc = __io._M_getloc(); + const __cache_type* __lc = __uc(__loc); + + // Use default precision if out of range. + const streamsize __prec = __io.precision() < 0 ? 6 : __io.precision(); + + const int __max_digits = + __gnu_cxx::__numeric_traits<_ValueT>::__digits10; + + // [22.2.2.2.2] Stage 1, numeric conversion to character. + int __len; + // Long enough for the max format spec. + char __fbuf[16]; + __num_base::_S_format_float(__io, __fbuf, __mod); + +#ifdef _GLIBCXX_USE_C99 + // First try a buffer perhaps big enough (most probably sufficient + // for non-ios_base::fixed outputs) + int __cs_size = __max_digits * 3; + char* __cs = static_cast(__builtin_alloca(__cs_size)); + __len = std::__convert_from_v(_S_get_c_locale(), __cs, __cs_size, + __fbuf, __prec, __v); + + // If the buffer was not large enough, try again with the correct size. + if (__len >= __cs_size) + { + __cs_size = __len + 1; + __cs = static_cast(__builtin_alloca(__cs_size)); + __len = std::__convert_from_v(_S_get_c_locale(), __cs, __cs_size, + __fbuf, __prec, __v); + } +#else + // Consider the possibility of long ios_base::fixed outputs + const bool __fixed = __io.flags() & ios_base::fixed; + const int __max_exp = + __gnu_cxx::__numeric_traits<_ValueT>::__max_exponent10; + + // The size of the output string is computed as follows. + // ios_base::fixed outputs may need up to __max_exp + 1 chars + // for the integer part + __prec chars for the fractional part + // + 3 chars for sign, decimal point, '\0'. On the other hand, + // for non-fixed outputs __max_digits * 2 + __prec chars are + // largely sufficient. + const int __cs_size = __fixed ? __max_exp + __prec + 4 + : __max_digits * 2 + __prec; + char* __cs = static_cast(__builtin_alloca(__cs_size)); + __len = std::__convert_from_v(_S_get_c_locale(), __cs, 0, __fbuf, + __prec, __v); +#endif + + // [22.2.2.2.2] Stage 2, convert to char_type, using correct + // numpunct.decimal_point() values for '.' and adding grouping. + const ctype<_CharT>& __ctype = use_facet >(__loc); + + _CharT* __ws = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) + * __len)); + __ctype.widen(__cs, __cs + __len, __ws); + + // Replace decimal point. + _CharT* __wp = 0; + const char* __p = char_traits::find(__cs, __len, '.'); + if (__p) + { + __wp = __ws + (__p - __cs); + *__wp = __lc->_M_decimal_point; + } + + // Add grouping, if necessary. + // N.B. Make sure to not group things like 2e20, i.e., no decimal + // point, scientific notation. + if (__lc->_M_use_grouping + && (__wp || __len < 3 || (__cs[1] <= '9' && __cs[2] <= '9' + && __cs[1] >= '0' && __cs[2] >= '0'))) + { + // Grouping can add (almost) as many separators as the + // number of digits, but no more. + _CharT* __ws2 = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) + * __len * 2)); + + streamsize __off = 0; + if (__cs[0] == '-' || __cs[0] == '+') + { + __off = 1; + __ws2[0] = __ws[0]; + __len -= 1; + } + + _M_group_float(__lc->_M_grouping, __lc->_M_grouping_size, + __lc->_M_thousands_sep, __wp, __ws2 + __off, + __ws + __off, __len); + __len += __off; + + __ws = __ws2; + } + + // Pad. + const streamsize __w = __io.width(); + if (__w > static_cast(__len)) + { + _CharT* __ws3 = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) + * __w)); + _M_pad(__fill, __w, __io, __ws3, __ws, __len); + __ws = __ws3; + } + __io.width(0); + + // [22.2.2.2.2] Stage 4. + // Write resulting, fully-formatted string to output iterator. + return std::__write(__s, __ws, __len); + } + + template + _OutIter + num_put<_CharT, _OutIter>:: + do_put(iter_type __s, ios_base& __io, char_type __fill, bool __v) const + { + const ios_base::fmtflags __flags = __io.flags(); + if ((__flags & ios_base::boolalpha) == 0) + { + const long __l = __v; + __s = _M_insert_int(__s, __io, __fill, __l); + } + else + { + typedef __numpunct_cache<_CharT> __cache_type; + __use_cache<__cache_type> __uc; + const locale& __loc = __io._M_getloc(); + const __cache_type* __lc = __uc(__loc); + + const _CharT* __name = __v ? __lc->_M_truename + : __lc->_M_falsename; + int __len = __v ? __lc->_M_truename_size + : __lc->_M_falsename_size; + + const streamsize __w = __io.width(); + if (__w > static_cast(__len)) + { + const streamsize __plen = __w - __len; + _CharT* __ps + = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) + * __plen)); + + char_traits<_CharT>::assign(__ps, __plen, __fill); + __io.width(0); + + if ((__flags & ios_base::adjustfield) == ios_base::left) + { + __s = std::__write(__s, __name, __len); + __s = std::__write(__s, __ps, __plen); + } + else + { + __s = std::__write(__s, __ps, __plen); + __s = std::__write(__s, __name, __len); + } + return __s; + } + __io.width(0); + __s = std::__write(__s, __name, __len); + } + return __s; + } + + template + _OutIter + num_put<_CharT, _OutIter>:: + do_put(iter_type __s, ios_base& __io, char_type __fill, double __v) const + { return _M_insert_float(__s, __io, __fill, char(), __v); } + +#if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ + template + _OutIter + num_put<_CharT, _OutIter>:: + __do_put(iter_type __s, ios_base& __io, char_type __fill, double __v) const + { return _M_insert_float(__s, __io, __fill, char(), __v); } +#endif + + template + _OutIter + num_put<_CharT, _OutIter>:: + do_put(iter_type __s, ios_base& __io, char_type __fill, + long double __v) const + { return _M_insert_float(__s, __io, __fill, 'L', __v); } + + template + _OutIter + num_put<_CharT, _OutIter>:: + do_put(iter_type __s, ios_base& __io, char_type __fill, + const void* __v) const + { + const ios_base::fmtflags __flags = __io.flags(); + const ios_base::fmtflags __fmt = ~(ios_base::basefield + | ios_base::uppercase); + __io.flags((__flags & __fmt) | (ios_base::hex | ios_base::showbase)); + + typedef __gnu_cxx::__conditional_type<(sizeof(const void*) + <= sizeof(unsigned long)), + unsigned long, unsigned long long>::__type _UIntPtrType; + + __s = _M_insert_int(__s, __io, __fill, + reinterpret_cast<_UIntPtrType>(__v)); + __io.flags(__flags); + return __s; + } + +_GLIBCXX_END_LDBL_NAMESPACE + + // Construct correctly padded string, as per 22.2.2.2.2 + // Assumes + // __newlen > __oldlen + // __news is allocated for __newlen size + + // NB: Of the two parameters, _CharT can be deduced from the + // function arguments. The other (_Traits) has to be explicitly specified. + template + void + __pad<_CharT, _Traits>::_S_pad(ios_base& __io, _CharT __fill, + _CharT* __news, const _CharT* __olds, + streamsize __newlen, streamsize __oldlen) + { + const size_t __plen = static_cast(__newlen - __oldlen); + const ios_base::fmtflags __adjust = __io.flags() & ios_base::adjustfield; + + // Padding last. + if (__adjust == ios_base::left) + { + _Traits::copy(__news, __olds, __oldlen); + _Traits::assign(__news + __oldlen, __plen, __fill); + return; + } + + size_t __mod = 0; + if (__adjust == ios_base::internal) + { + // Pad after the sign, if there is one. + // Pad after 0[xX], if there is one. + // Who came up with these rules, anyway? Jeeze. + const locale& __loc = __io._M_getloc(); + const ctype<_CharT>& __ctype = use_facet >(__loc); + + if (__ctype.widen('-') == __olds[0] + || __ctype.widen('+') == __olds[0]) + { + __news[0] = __olds[0]; + __mod = 1; + ++__news; + } + else if (__ctype.widen('0') == __olds[0] + && __oldlen > 1 + && (__ctype.widen('x') == __olds[1] + || __ctype.widen('X') == __olds[1])) + { + __news[0] = __olds[0]; + __news[1] = __olds[1]; + __mod = 2; + __news += 2; + } + // else Padding first. + } + _Traits::assign(__news, __plen, __fill); + _Traits::copy(__news + __plen, __olds + __mod, __oldlen - __mod); + } + + template + _CharT* + __add_grouping(_CharT* __s, _CharT __sep, + const char* __gbeg, size_t __gsize, + const _CharT* __first, const _CharT* __last) + { + size_t __idx = 0; + size_t __ctr = 0; + + while (__last - __first > __gbeg[__idx] + && static_cast(__gbeg[__idx]) > 0 + && __gbeg[__idx] != __gnu_cxx::__numeric_traits::__max) + { + __last -= __gbeg[__idx]; + __idx < __gsize - 1 ? ++__idx : ++__ctr; + } + + while (__first != __last) + *__s++ = *__first++; + + while (__ctr--) + { + *__s++ = __sep; + for (char __i = __gbeg[__idx]; __i > 0; --__i) + *__s++ = *__first++; + } + + while (__idx--) + { + *__s++ = __sep; + for (char __i = __gbeg[__idx]; __i > 0; --__i) + *__s++ = *__first++; + } + + return __s; + } + + // Inhibit implicit instantiations for required instantiations, + // which are defined via explicit instantiations elsewhere. + // NB: This syntax is a GNU extension. +#if _GLIBCXX_EXTERN_TEMPLATE + extern template class numpunct; + extern template class numpunct_byname; + extern template class _GLIBCXX_LDBL_NAMESPACE num_get; + extern template class _GLIBCXX_LDBL_NAMESPACE num_put; + extern template class ctype_byname; + + extern template + const ctype& + use_facet >(const locale&); + + extern template + const numpunct& + use_facet >(const locale&); + + extern template + const num_put& + use_facet >(const locale&); + + extern template + const num_get& + use_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + +#ifdef _GLIBCXX_USE_WCHAR_T + extern template class numpunct; + extern template class numpunct_byname; + extern template class _GLIBCXX_LDBL_NAMESPACE num_get; + extern template class _GLIBCXX_LDBL_NAMESPACE num_put; + extern template class ctype_byname; + + extern template + const ctype& + use_facet >(const locale&); + + extern template + const numpunct& + use_facet >(const locale&); + + extern template + const num_put& + use_facet >(const locale&); + + extern template + const num_get& + use_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); +#endif +#endif + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/locale_facets_nonio.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/locale_facets_nonio.h new file mode 100644 index 00000000..aba96d6c --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/locale_facets_nonio.h @@ -0,0 +1,1914 @@ +// Locale support -*- C++ -*- + +// Copyright (C) 2007, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file locale_facets_nonio.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 22.1 Locales +// + +#ifndef _LOCALE_FACETS_NONIO_H +#define _LOCALE_FACETS_NONIO_H 1 + +#pragma GCC system_header + +#include // For struct tm + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /** + * @brief Time format ordering data. + * + * This class provides an enum representing different orderings of day, + * month, and year. + */ + class time_base + { + public: + enum dateorder { no_order, dmy, mdy, ymd, ydm }; + }; + + template + struct __timepunct_cache : public locale::facet + { + // List of all known timezones, with GMT first. + static const _CharT* _S_timezones[14]; + + const _CharT* _M_date_format; + const _CharT* _M_date_era_format; + const _CharT* _M_time_format; + const _CharT* _M_time_era_format; + const _CharT* _M_date_time_format; + const _CharT* _M_date_time_era_format; + const _CharT* _M_am; + const _CharT* _M_pm; + const _CharT* _M_am_pm_format; + + // Day names, starting with "C"'s Sunday. + const _CharT* _M_day1; + const _CharT* _M_day2; + const _CharT* _M_day3; + const _CharT* _M_day4; + const _CharT* _M_day5; + const _CharT* _M_day6; + const _CharT* _M_day7; + + // Abbreviated day names, starting with "C"'s Sun. + const _CharT* _M_aday1; + const _CharT* _M_aday2; + const _CharT* _M_aday3; + const _CharT* _M_aday4; + const _CharT* _M_aday5; + const _CharT* _M_aday6; + const _CharT* _M_aday7; + + // Month names, starting with "C"'s January. + const _CharT* _M_month01; + const _CharT* _M_month02; + const _CharT* _M_month03; + const _CharT* _M_month04; + const _CharT* _M_month05; + const _CharT* _M_month06; + const _CharT* _M_month07; + const _CharT* _M_month08; + const _CharT* _M_month09; + const _CharT* _M_month10; + const _CharT* _M_month11; + const _CharT* _M_month12; + + // Abbreviated month names, starting with "C"'s Jan. + const _CharT* _M_amonth01; + const _CharT* _M_amonth02; + const _CharT* _M_amonth03; + const _CharT* _M_amonth04; + const _CharT* _M_amonth05; + const _CharT* _M_amonth06; + const _CharT* _M_amonth07; + const _CharT* _M_amonth08; + const _CharT* _M_amonth09; + const _CharT* _M_amonth10; + const _CharT* _M_amonth11; + const _CharT* _M_amonth12; + + bool _M_allocated; + + __timepunct_cache(size_t __refs = 0) : facet(__refs), + _M_date_format(NULL), _M_date_era_format(NULL), _M_time_format(NULL), + _M_time_era_format(NULL), _M_date_time_format(NULL), + _M_date_time_era_format(NULL), _M_am(NULL), _M_pm(NULL), + _M_am_pm_format(NULL), _M_day1(NULL), _M_day2(NULL), _M_day3(NULL), + _M_day4(NULL), _M_day5(NULL), _M_day6(NULL), _M_day7(NULL), + _M_aday1(NULL), _M_aday2(NULL), _M_aday3(NULL), _M_aday4(NULL), + _M_aday5(NULL), _M_aday6(NULL), _M_aday7(NULL), _M_month01(NULL), + _M_month02(NULL), _M_month03(NULL), _M_month04(NULL), _M_month05(NULL), + _M_month06(NULL), _M_month07(NULL), _M_month08(NULL), _M_month09(NULL), + _M_month10(NULL), _M_month11(NULL), _M_month12(NULL), _M_amonth01(NULL), + _M_amonth02(NULL), _M_amonth03(NULL), _M_amonth04(NULL), + _M_amonth05(NULL), _M_amonth06(NULL), _M_amonth07(NULL), + _M_amonth08(NULL), _M_amonth09(NULL), _M_amonth10(NULL), + _M_amonth11(NULL), _M_amonth12(NULL), _M_allocated(false) + { } + + ~__timepunct_cache(); + + void + _M_cache(const locale& __loc); + + private: + __timepunct_cache& + operator=(const __timepunct_cache&); + + explicit + __timepunct_cache(const __timepunct_cache&); + }; + + template + __timepunct_cache<_CharT>::~__timepunct_cache() + { + if (_M_allocated) + { + // Unused. + } + } + + // Specializations. + template<> + const char* + __timepunct_cache::_S_timezones[14]; + +#ifdef _GLIBCXX_USE_WCHAR_T + template<> + const wchar_t* + __timepunct_cache::_S_timezones[14]; +#endif + + // Generic. + template + const _CharT* __timepunct_cache<_CharT>::_S_timezones[14]; + + template + class __timepunct : public locale::facet + { + public: + // Types: + typedef _CharT __char_type; + typedef basic_string<_CharT> __string_type; + typedef __timepunct_cache<_CharT> __cache_type; + + protected: + __cache_type* _M_data; + __c_locale _M_c_locale_timepunct; + const char* _M_name_timepunct; + + public: + /// Numpunct facet id. + static locale::id id; + + explicit + __timepunct(size_t __refs = 0); + + explicit + __timepunct(__cache_type* __cache, size_t __refs = 0); + + /** + * @brief Internal constructor. Not for general use. + * + * This is a constructor for use by the library itself to set up new + * locales. + * + * @param cloc The "C" locale. + * @param s The name of a locale. + * @param refs Passed to the base facet class. + */ + explicit + __timepunct(__c_locale __cloc, const char* __s, size_t __refs = 0); + + // FIXME: for error checking purposes _M_put should return the return + // value of strftime/wcsftime. + void + _M_put(_CharT* __s, size_t __maxlen, const _CharT* __format, + const tm* __tm) const; + + void + _M_date_formats(const _CharT** __date) const + { + // Always have default first. + __date[0] = _M_data->_M_date_format; + __date[1] = _M_data->_M_date_era_format; + } + + void + _M_time_formats(const _CharT** __time) const + { + // Always have default first. + __time[0] = _M_data->_M_time_format; + __time[1] = _M_data->_M_time_era_format; + } + + void + _M_date_time_formats(const _CharT** __dt) const + { + // Always have default first. + __dt[0] = _M_data->_M_date_time_format; + __dt[1] = _M_data->_M_date_time_era_format; + } + + void + _M_am_pm_format(const _CharT* __ampm) const + { __ampm = _M_data->_M_am_pm_format; } + + void + _M_am_pm(const _CharT** __ampm) const + { + __ampm[0] = _M_data->_M_am; + __ampm[1] = _M_data->_M_pm; + } + + void + _M_days(const _CharT** __days) const + { + __days[0] = _M_data->_M_day1; + __days[1] = _M_data->_M_day2; + __days[2] = _M_data->_M_day3; + __days[3] = _M_data->_M_day4; + __days[4] = _M_data->_M_day5; + __days[5] = _M_data->_M_day6; + __days[6] = _M_data->_M_day7; + } + + void + _M_days_abbreviated(const _CharT** __days) const + { + __days[0] = _M_data->_M_aday1; + __days[1] = _M_data->_M_aday2; + __days[2] = _M_data->_M_aday3; + __days[3] = _M_data->_M_aday4; + __days[4] = _M_data->_M_aday5; + __days[5] = _M_data->_M_aday6; + __days[6] = _M_data->_M_aday7; + } + + void + _M_months(const _CharT** __months) const + { + __months[0] = _M_data->_M_month01; + __months[1] = _M_data->_M_month02; + __months[2] = _M_data->_M_month03; + __months[3] = _M_data->_M_month04; + __months[4] = _M_data->_M_month05; + __months[5] = _M_data->_M_month06; + __months[6] = _M_data->_M_month07; + __months[7] = _M_data->_M_month08; + __months[8] = _M_data->_M_month09; + __months[9] = _M_data->_M_month10; + __months[10] = _M_data->_M_month11; + __months[11] = _M_data->_M_month12; + } + + void + _M_months_abbreviated(const _CharT** __months) const + { + __months[0] = _M_data->_M_amonth01; + __months[1] = _M_data->_M_amonth02; + __months[2] = _M_data->_M_amonth03; + __months[3] = _M_data->_M_amonth04; + __months[4] = _M_data->_M_amonth05; + __months[5] = _M_data->_M_amonth06; + __months[6] = _M_data->_M_amonth07; + __months[7] = _M_data->_M_amonth08; + __months[8] = _M_data->_M_amonth09; + __months[9] = _M_data->_M_amonth10; + __months[10] = _M_data->_M_amonth11; + __months[11] = _M_data->_M_amonth12; + } + + protected: + virtual + ~__timepunct(); + + // For use at construction time only. + void + _M_initialize_timepunct(__c_locale __cloc = NULL); + }; + + template + locale::id __timepunct<_CharT>::id; + + // Specializations. + template<> + void + __timepunct::_M_initialize_timepunct(__c_locale __cloc); + + template<> + void + __timepunct::_M_put(char*, size_t, const char*, const tm*) const; + +#ifdef _GLIBCXX_USE_WCHAR_T + template<> + void + __timepunct::_M_initialize_timepunct(__c_locale __cloc); + + template<> + void + __timepunct::_M_put(wchar_t*, size_t, const wchar_t*, + const tm*) const; +#endif + +_GLIBCXX_END_NAMESPACE + + // Include host and configuration specific timepunct functions. + #include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /** + * @brief Facet for parsing dates and times. + * + * This facet encapsulates the code to parse and return a date or + * time from a string. It is used by the istream numeric + * extraction operators. + * + * The time_get template uses protected virtual functions to provide the + * actual results. The public accessors forward the call to the virtual + * functions. These virtual functions are hooks for developers to + * implement the behavior they require from the time_get facet. + */ + template + class time_get : public locale::facet, public time_base + { + public: + // Types: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef _InIter iter_type; + //@} + typedef basic_string<_CharT> __string_type; + + /// Numpunct facet id. + static locale::id id; + + /** + * @brief Constructor performs initialization. + * + * This is the constructor provided by the standard. + * + * @param refs Passed to the base facet class. + */ + explicit + time_get(size_t __refs = 0) + : facet (__refs) { } + + /** + * @brief Return preferred order of month, day, and year. + * + * This function returns an enum from timebase::dateorder giving the + * preferred ordering if the format "x" given to time_put::put() only + * uses month, day, and year. If the format "x" for the associated + * locale uses other fields, this function returns + * timebase::dateorder::noorder. + * + * NOTE: The library always returns noorder at the moment. + * + * @return A member of timebase::dateorder. + */ + dateorder + date_order() const + { return this->do_date_order(); } + + /** + * @brief Parse input time string. + * + * This function parses a time according to the format "x" and puts the + * results into a user-supplied struct tm. The result is returned by + * calling time_get::do_get_time(). + * + * If there is a valid time string according to format "x", @a tm will + * be filled in accordingly and the returned iterator will point to the + * first character beyond the time string. If an error occurs before + * the end, err |= ios_base::failbit. If parsing reads all the + * characters, err |= ios_base::eofbit. + * + * @param beg Start of string to parse. + * @param end End of string to parse. + * @param io Source of the locale. + * @param err Error flags to set. + * @param tm Pointer to struct tm to fill in. + * @return Iterator to first char beyond time string. + */ + iter_type + get_time(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm) const + { return this->do_get_time(__beg, __end, __io, __err, __tm); } + + /** + * @brief Parse input date string. + * + * This function parses a date according to the format "X" and puts the + * results into a user-supplied struct tm. The result is returned by + * calling time_get::do_get_date(). + * + * If there is a valid date string according to format "X", @a tm will + * be filled in accordingly and the returned iterator will point to the + * first character beyond the date string. If an error occurs before + * the end, err |= ios_base::failbit. If parsing reads all the + * characters, err |= ios_base::eofbit. + * + * @param beg Start of string to parse. + * @param end End of string to parse. + * @param io Source of the locale. + * @param err Error flags to set. + * @param tm Pointer to struct tm to fill in. + * @return Iterator to first char beyond date string. + */ + iter_type + get_date(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm) const + { return this->do_get_date(__beg, __end, __io, __err, __tm); } + + /** + * @brief Parse input weekday string. + * + * This function parses a weekday name and puts the results into a + * user-supplied struct tm. The result is returned by calling + * time_get::do_get_weekday(). + * + * Parsing starts by parsing an abbreviated weekday name. If a valid + * abbreviation is followed by a character that would lead to the full + * weekday name, parsing continues until the full name is found or an + * error occurs. Otherwise parsing finishes at the end of the + * abbreviated name. + * + * If an error occurs before the end, err |= ios_base::failbit. If + * parsing reads all the characters, err |= ios_base::eofbit. + * + * @param beg Start of string to parse. + * @param end End of string to parse. + * @param io Source of the locale. + * @param err Error flags to set. + * @param tm Pointer to struct tm to fill in. + * @return Iterator to first char beyond weekday name. + */ + iter_type + get_weekday(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm) const + { return this->do_get_weekday(__beg, __end, __io, __err, __tm); } + + /** + * @brief Parse input month string. + * + * This function parses a month name and puts the results into a + * user-supplied struct tm. The result is returned by calling + * time_get::do_get_monthname(). + * + * Parsing starts by parsing an abbreviated month name. If a valid + * abbreviation is followed by a character that would lead to the full + * month name, parsing continues until the full name is found or an + * error occurs. Otherwise parsing finishes at the end of the + * abbreviated name. + * + * If an error occurs before the end, err |= ios_base::failbit. If + * parsing reads all the characters, err |= + * ios_base::eofbit. + * + * @param beg Start of string to parse. + * @param end End of string to parse. + * @param io Source of the locale. + * @param err Error flags to set. + * @param tm Pointer to struct tm to fill in. + * @return Iterator to first char beyond month name. + */ + iter_type + get_monthname(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm) const + { return this->do_get_monthname(__beg, __end, __io, __err, __tm); } + + /** + * @brief Parse input year string. + * + * This function reads up to 4 characters to parse a year string and + * puts the results into a user-supplied struct tm. The result is + * returned by calling time_get::do_get_year(). + * + * 4 consecutive digits are interpreted as a full year. If there are + * exactly 2 consecutive digits, the library interprets this as the + * number of years since 1900. + * + * If an error occurs before the end, err |= ios_base::failbit. If + * parsing reads all the characters, err |= ios_base::eofbit. + * + * @param beg Start of string to parse. + * @param end End of string to parse. + * @param io Source of the locale. + * @param err Error flags to set. + * @param tm Pointer to struct tm to fill in. + * @return Iterator to first char beyond year. + */ + iter_type + get_year(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm) const + { return this->do_get_year(__beg, __end, __io, __err, __tm); } + + protected: + /// Destructor. + virtual + ~time_get() { } + + /** + * @brief Return preferred order of month, day, and year. + * + * This function returns an enum from timebase::dateorder giving the + * preferred ordering if the format "x" given to time_put::put() only + * uses month, day, and year. This function is a hook for derived + * classes to change the value returned. + * + * @return A member of timebase::dateorder. + */ + virtual dateorder + do_date_order() const; + + /** + * @brief Parse input time string. + * + * This function parses a time according to the format "x" and puts the + * results into a user-supplied struct tm. This function is a hook for + * derived classes to change the value returned. @see get_time() for + * details. + * + * @param beg Start of string to parse. + * @param end End of string to parse. + * @param io Source of the locale. + * @param err Error flags to set. + * @param tm Pointer to struct tm to fill in. + * @return Iterator to first char beyond time string. + */ + virtual iter_type + do_get_time(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm) const; + + /** + * @brief Parse input date string. + * + * This function parses a date according to the format "X" and puts the + * results into a user-supplied struct tm. This function is a hook for + * derived classes to change the value returned. @see get_date() for + * details. + * + * @param beg Start of string to parse. + * @param end End of string to parse. + * @param io Source of the locale. + * @param err Error flags to set. + * @param tm Pointer to struct tm to fill in. + * @return Iterator to first char beyond date string. + */ + virtual iter_type + do_get_date(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm) const; + + /** + * @brief Parse input weekday string. + * + * This function parses a weekday name and puts the results into a + * user-supplied struct tm. This function is a hook for derived + * classes to change the value returned. @see get_weekday() for + * details. + * + * @param beg Start of string to parse. + * @param end End of string to parse. + * @param io Source of the locale. + * @param err Error flags to set. + * @param tm Pointer to struct tm to fill in. + * @return Iterator to first char beyond weekday name. + */ + virtual iter_type + do_get_weekday(iter_type __beg, iter_type __end, ios_base&, + ios_base::iostate& __err, tm* __tm) const; + + /** + * @brief Parse input month string. + * + * This function parses a month name and puts the results into a + * user-supplied struct tm. This function is a hook for derived + * classes to change the value returned. @see get_monthname() for + * details. + * + * @param beg Start of string to parse. + * @param end End of string to parse. + * @param io Source of the locale. + * @param err Error flags to set. + * @param tm Pointer to struct tm to fill in. + * @return Iterator to first char beyond month name. + */ + virtual iter_type + do_get_monthname(iter_type __beg, iter_type __end, ios_base&, + ios_base::iostate& __err, tm* __tm) const; + + /** + * @brief Parse input year string. + * + * This function reads up to 4 characters to parse a year string and + * puts the results into a user-supplied struct tm. This function is a + * hook for derived classes to change the value returned. @see + * get_year() for details. + * + * @param beg Start of string to parse. + * @param end End of string to parse. + * @param io Source of the locale. + * @param err Error flags to set. + * @param tm Pointer to struct tm to fill in. + * @return Iterator to first char beyond year. + */ + virtual iter_type + do_get_year(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm) const; + + // Extract numeric component of length __len. + iter_type + _M_extract_num(iter_type __beg, iter_type __end, int& __member, + int __min, int __max, size_t __len, + ios_base& __io, ios_base::iostate& __err) const; + + // Extract day or month name, or any unique array of string + // literals in a const _CharT* array. + iter_type + _M_extract_name(iter_type __beg, iter_type __end, int& __member, + const _CharT** __names, size_t __indexlen, + ios_base& __io, ios_base::iostate& __err) const; + + // Extract on a component-by-component basis, via __format argument. + iter_type + _M_extract_via_format(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm, + const _CharT* __format) const; + }; + + template + locale::id time_get<_CharT, _InIter>::id; + + /// class time_get_byname [22.2.5.2]. + template + class time_get_byname : public time_get<_CharT, _InIter> + { + public: + // Types: + typedef _CharT char_type; + typedef _InIter iter_type; + + explicit + time_get_byname(const char*, size_t __refs = 0) + : time_get<_CharT, _InIter>(__refs) { } + + protected: + virtual + ~time_get_byname() { } + }; + + /** + * @brief Facet for outputting dates and times. + * + * This facet encapsulates the code to format and output dates and times + * according to formats used by strftime(). + * + * The time_put template uses protected virtual functions to provide the + * actual results. The public accessors forward the call to the virtual + * functions. These virtual functions are hooks for developers to + * implement the behavior they require from the time_put facet. + */ + template + class time_put : public locale::facet + { + public: + // Types: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef _OutIter iter_type; + //@} + + /// Numpunct facet id. + static locale::id id; + + /** + * @brief Constructor performs initialization. + * + * This is the constructor provided by the standard. + * + * @param refs Passed to the base facet class. + */ + explicit + time_put(size_t __refs = 0) + : facet(__refs) { } + + /** + * @brief Format and output a time or date. + * + * This function formats the data in struct tm according to the + * provided format string. The format string is interpreted as by + * strftime(). + * + * @param s The stream to write to. + * @param io Source of locale. + * @param fill char_type to use for padding. + * @param tm Struct tm with date and time info to format. + * @param beg Start of format string. + * @param end End of format string. + * @return Iterator after writing. + */ + iter_type + put(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm, + const _CharT* __beg, const _CharT* __end) const; + + /** + * @brief Format and output a time or date. + * + * This function formats the data in struct tm according to the + * provided format char and optional modifier. The format and modifier + * are interpreted as by strftime(). It does so by returning + * time_put::do_put(). + * + * @param s The stream to write to. + * @param io Source of locale. + * @param fill char_type to use for padding. + * @param tm Struct tm with date and time info to format. + * @param format Format char. + * @param mod Optional modifier char. + * @return Iterator after writing. + */ + iter_type + put(iter_type __s, ios_base& __io, char_type __fill, + const tm* __tm, char __format, char __mod = 0) const + { return this->do_put(__s, __io, __fill, __tm, __format, __mod); } + + protected: + /// Destructor. + virtual + ~time_put() + { } + + /** + * @brief Format and output a time or date. + * + * This function formats the data in struct tm according to the + * provided format char and optional modifier. This function is a hook + * for derived classes to change the value returned. @see put() for + * more details. + * + * @param s The stream to write to. + * @param io Source of locale. + * @param fill char_type to use for padding. + * @param tm Struct tm with date and time info to format. + * @param format Format char. + * @param mod Optional modifier char. + * @return Iterator after writing. + */ + virtual iter_type + do_put(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm, + char __format, char __mod) const; + }; + + template + locale::id time_put<_CharT, _OutIter>::id; + + /// class time_put_byname [22.2.5.4]. + template + class time_put_byname : public time_put<_CharT, _OutIter> + { + public: + // Types: + typedef _CharT char_type; + typedef _OutIter iter_type; + + explicit + time_put_byname(const char*, size_t __refs = 0) + : time_put<_CharT, _OutIter>(__refs) + { }; + + protected: + virtual + ~time_put_byname() { } + }; + + + /** + * @brief Money format ordering data. + * + * This class contains an ordered array of 4 fields to represent the + * pattern for formatting a money amount. Each field may contain one entry + * from the part enum. symbol, sign, and value must be present and the + * remaining field must contain either none or space. @see + * moneypunct::pos_format() and moneypunct::neg_format() for details of how + * these fields are interpreted. + */ + class money_base + { + public: + enum part { none, space, symbol, sign, value }; + struct pattern { char field[4]; }; + + static const pattern _S_default_pattern; + + enum + { + _S_minus, + _S_zero, + _S_end = 11 + }; + + // String literal of acceptable (narrow) input/output, for + // money_get/money_put. "-0123456789" + static const char* _S_atoms; + + // Construct and return valid pattern consisting of some combination of: + // space none symbol sign value + static pattern + _S_construct_pattern(char __precedes, char __space, char __posn); + }; + + template + struct __moneypunct_cache : public locale::facet + { + const char* _M_grouping; + size_t _M_grouping_size; + bool _M_use_grouping; + _CharT _M_decimal_point; + _CharT _M_thousands_sep; + const _CharT* _M_curr_symbol; + size_t _M_curr_symbol_size; + const _CharT* _M_positive_sign; + size_t _M_positive_sign_size; + const _CharT* _M_negative_sign; + size_t _M_negative_sign_size; + int _M_frac_digits; + money_base::pattern _M_pos_format; + money_base::pattern _M_neg_format; + + // A list of valid numeric literals for input and output: in the standard + // "C" locale, this is "-0123456789". This array contains the chars after + // having been passed through the current locale's ctype<_CharT>.widen(). + _CharT _M_atoms[money_base::_S_end]; + + bool _M_allocated; + + __moneypunct_cache(size_t __refs = 0) : facet(__refs), + _M_grouping(NULL), _M_grouping_size(0), _M_use_grouping(false), + _M_decimal_point(_CharT()), _M_thousands_sep(_CharT()), + _M_curr_symbol(NULL), _M_curr_symbol_size(0), + _M_positive_sign(NULL), _M_positive_sign_size(0), + _M_negative_sign(NULL), _M_negative_sign_size(0), + _M_frac_digits(0), + _M_pos_format(money_base::pattern()), + _M_neg_format(money_base::pattern()), _M_allocated(false) + { } + + ~__moneypunct_cache(); + + void + _M_cache(const locale& __loc); + + private: + __moneypunct_cache& + operator=(const __moneypunct_cache&); + + explicit + __moneypunct_cache(const __moneypunct_cache&); + }; + + template + __moneypunct_cache<_CharT, _Intl>::~__moneypunct_cache() + { + if (_M_allocated) + { + delete [] _M_grouping; + delete [] _M_curr_symbol; + delete [] _M_positive_sign; + delete [] _M_negative_sign; + } + } + + /** + * @brief Facet for formatting data for money amounts. + * + * This facet encapsulates the punctuation, grouping and other formatting + * features of money amount string representations. + */ + template + class moneypunct : public locale::facet, public money_base + { + public: + // Types: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef basic_string<_CharT> string_type; + //@} + typedef __moneypunct_cache<_CharT, _Intl> __cache_type; + + private: + __cache_type* _M_data; + + public: + /// This value is provided by the standard, but no reason for its + /// existence. + static const bool intl = _Intl; + /// Numpunct facet id. + static locale::id id; + + /** + * @brief Constructor performs initialization. + * + * This is the constructor provided by the standard. + * + * @param refs Passed to the base facet class. + */ + explicit + moneypunct(size_t __refs = 0) : facet(__refs), _M_data(NULL) + { _M_initialize_moneypunct(); } + + /** + * @brief Constructor performs initialization. + * + * This is an internal constructor. + * + * @param cache Cache for optimization. + * @param refs Passed to the base facet class. + */ + explicit + moneypunct(__cache_type* __cache, size_t __refs = 0) + : facet(__refs), _M_data(__cache) + { _M_initialize_moneypunct(); } + + /** + * @brief Internal constructor. Not for general use. + * + * This is a constructor for use by the library itself to set up new + * locales. + * + * @param cloc The "C" locale. + * @param s The name of a locale. + * @param refs Passed to the base facet class. + */ + explicit + moneypunct(__c_locale __cloc, const char* __s, size_t __refs = 0) + : facet(__refs), _M_data(NULL) + { _M_initialize_moneypunct(__cloc, __s); } + + /** + * @brief Return decimal point character. + * + * This function returns a char_type to use as a decimal point. It + * does so by returning returning + * moneypunct::do_decimal_point(). + * + * @return @a char_type representing a decimal point. + */ + char_type + decimal_point() const + { return this->do_decimal_point(); } + + /** + * @brief Return thousands separator character. + * + * This function returns a char_type to use as a thousands + * separator. It does so by returning returning + * moneypunct::do_thousands_sep(). + * + * @return char_type representing a thousands separator. + */ + char_type + thousands_sep() const + { return this->do_thousands_sep(); } + + /** + * @brief Return grouping specification. + * + * This function returns a string representing groupings for the + * integer part of an amount. Groupings indicate where thousands + * separators should be inserted. + * + * Each char in the return string is interpret as an integer rather + * than a character. These numbers represent the number of digits in a + * group. The first char in the string represents the number of digits + * in the least significant group. If a char is negative, it indicates + * an unlimited number of digits for the group. If more chars from the + * string are required to group a number, the last char is used + * repeatedly. + * + * For example, if the grouping() returns "\003\002" and is applied to + * the number 123456789, this corresponds to 12,34,56,789. Note that + * if the string was "32", this would put more than 50 digits into the + * least significant group if the character set is ASCII. + * + * The string is returned by calling + * moneypunct::do_grouping(). + * + * @return string representing grouping specification. + */ + string + grouping() const + { return this->do_grouping(); } + + /** + * @brief Return currency symbol string. + * + * This function returns a string_type to use as a currency symbol. It + * does so by returning returning + * moneypunct::do_curr_symbol(). + * + * @return @a string_type representing a currency symbol. + */ + string_type + curr_symbol() const + { return this->do_curr_symbol(); } + + /** + * @brief Return positive sign string. + * + * This function returns a string_type to use as a sign for positive + * amounts. It does so by returning returning + * moneypunct::do_positive_sign(). + * + * If the return value contains more than one character, the first + * character appears in the position indicated by pos_format() and the + * remainder appear at the end of the formatted string. + * + * @return @a string_type representing a positive sign. + */ + string_type + positive_sign() const + { return this->do_positive_sign(); } + + /** + * @brief Return negative sign string. + * + * This function returns a string_type to use as a sign for negative + * amounts. It does so by returning returning + * moneypunct::do_negative_sign(). + * + * If the return value contains more than one character, the first + * character appears in the position indicated by neg_format() and the + * remainder appear at the end of the formatted string. + * + * @return @a string_type representing a negative sign. + */ + string_type + negative_sign() const + { return this->do_negative_sign(); } + + /** + * @brief Return number of digits in fraction. + * + * This function returns the exact number of digits that make up the + * fractional part of a money amount. It does so by returning + * returning moneypunct::do_frac_digits(). + * + * The fractional part of a money amount is optional. But if it is + * present, there must be frac_digits() digits. + * + * @return Number of digits in amount fraction. + */ + int + frac_digits() const + { return this->do_frac_digits(); } + + //@{ + /** + * @brief Return pattern for money values. + * + * This function returns a pattern describing the formatting of a + * positive or negative valued money amount. It does so by returning + * returning moneypunct::do_pos_format() or + * moneypunct::do_neg_format(). + * + * The pattern has 4 fields describing the ordering of symbol, sign, + * value, and none or space. There must be one of each in the pattern. + * The none and space enums may not appear in the first field and space + * may not appear in the final field. + * + * The parts of a money string must appear in the order indicated by + * the fields of the pattern. The symbol field indicates that the + * value of curr_symbol() may be present. The sign field indicates + * that the value of positive_sign() or negative_sign() must be + * present. The value field indicates that the absolute value of the + * money amount is present. none indicates 0 or more whitespace + * characters, except at the end, where it permits no whitespace. + * space indicates that 1 or more whitespace characters must be + * present. + * + * For example, for the US locale and pos_format() pattern + * {symbol,sign,value,none}, curr_symbol() == '$' positive_sign() == + * '+', and value 10.01, and options set to force the symbol, the + * corresponding string is "$+10.01". + * + * @return Pattern for money values. + */ + pattern + pos_format() const + { return this->do_pos_format(); } + + pattern + neg_format() const + { return this->do_neg_format(); } + //@} + + protected: + /// Destructor. + virtual + ~moneypunct(); + + /** + * @brief Return decimal point character. + * + * Returns a char_type to use as a decimal point. This function is a + * hook for derived classes to change the value returned. + * + * @return @a char_type representing a decimal point. + */ + virtual char_type + do_decimal_point() const + { return _M_data->_M_decimal_point; } + + /** + * @brief Return thousands separator character. + * + * Returns a char_type to use as a thousands separator. This function + * is a hook for derived classes to change the value returned. + * + * @return @a char_type representing a thousands separator. + */ + virtual char_type + do_thousands_sep() const + { return _M_data->_M_thousands_sep; } + + /** + * @brief Return grouping specification. + * + * Returns a string representing groupings for the integer part of a + * number. This function is a hook for derived classes to change the + * value returned. @see grouping() for details. + * + * @return String representing grouping specification. + */ + virtual string + do_grouping() const + { return _M_data->_M_grouping; } + + /** + * @brief Return currency symbol string. + * + * This function returns a string_type to use as a currency symbol. + * This function is a hook for derived classes to change the value + * returned. @see curr_symbol() for details. + * + * @return @a string_type representing a currency symbol. + */ + virtual string_type + do_curr_symbol() const + { return _M_data->_M_curr_symbol; } + + /** + * @brief Return positive sign string. + * + * This function returns a string_type to use as a sign for positive + * amounts. This function is a hook for derived classes to change the + * value returned. @see positive_sign() for details. + * + * @return @a string_type representing a positive sign. + */ + virtual string_type + do_positive_sign() const + { return _M_data->_M_positive_sign; } + + /** + * @brief Return negative sign string. + * + * This function returns a string_type to use as a sign for negative + * amounts. This function is a hook for derived classes to change the + * value returned. @see negative_sign() for details. + * + * @return @a string_type representing a negative sign. + */ + virtual string_type + do_negative_sign() const + { return _M_data->_M_negative_sign; } + + /** + * @brief Return number of digits in fraction. + * + * This function returns the exact number of digits that make up the + * fractional part of a money amount. This function is a hook for + * derived classes to change the value returned. @see frac_digits() + * for details. + * + * @return Number of digits in amount fraction. + */ + virtual int + do_frac_digits() const + { return _M_data->_M_frac_digits; } + + /** + * @brief Return pattern for money values. + * + * This function returns a pattern describing the formatting of a + * positive valued money amount. This function is a hook for derived + * classes to change the value returned. @see pos_format() for + * details. + * + * @return Pattern for money values. + */ + virtual pattern + do_pos_format() const + { return _M_data->_M_pos_format; } + + /** + * @brief Return pattern for money values. + * + * This function returns a pattern describing the formatting of a + * negative valued money amount. This function is a hook for derived + * classes to change the value returned. @see neg_format() for + * details. + * + * @return Pattern for money values. + */ + virtual pattern + do_neg_format() const + { return _M_data->_M_neg_format; } + + // For use at construction time only. + void + _M_initialize_moneypunct(__c_locale __cloc = NULL, + const char* __name = NULL); + }; + + template + locale::id moneypunct<_CharT, _Intl>::id; + + template + const bool moneypunct<_CharT, _Intl>::intl; + + template<> + moneypunct::~moneypunct(); + + template<> + moneypunct::~moneypunct(); + + template<> + void + moneypunct::_M_initialize_moneypunct(__c_locale, const char*); + + template<> + void + moneypunct::_M_initialize_moneypunct(__c_locale, const char*); + +#ifdef _GLIBCXX_USE_WCHAR_T + template<> + moneypunct::~moneypunct(); + + template<> + moneypunct::~moneypunct(); + + template<> + void + moneypunct::_M_initialize_moneypunct(__c_locale, + const char*); + + template<> + void + moneypunct::_M_initialize_moneypunct(__c_locale, + const char*); +#endif + + /// class moneypunct_byname [22.2.6.4]. + template + class moneypunct_byname : public moneypunct<_CharT, _Intl> + { + public: + typedef _CharT char_type; + typedef basic_string<_CharT> string_type; + + static const bool intl = _Intl; + + explicit + moneypunct_byname(const char* __s, size_t __refs = 0) + : moneypunct<_CharT, _Intl>(__refs) + { + if (__builtin_strcmp(__s, "C") != 0 + && __builtin_strcmp(__s, "POSIX") != 0) + { + __c_locale __tmp; + this->_S_create_c_locale(__tmp, __s); + this->_M_initialize_moneypunct(__tmp); + this->_S_destroy_c_locale(__tmp); + } + } + + protected: + virtual + ~moneypunct_byname() { } + }; + + template + const bool moneypunct_byname<_CharT, _Intl>::intl; + +_GLIBCXX_BEGIN_LDBL_NAMESPACE + + /** + * @brief Facet for parsing monetary amounts. + * + * This facet encapsulates the code to parse and return a monetary + * amount from a string. + * + * The money_get template uses protected virtual functions to + * provide the actual results. The public accessors forward the + * call to the virtual functions. These virtual functions are + * hooks for developers to implement the behavior they require from + * the money_get facet. + */ + template + class money_get : public locale::facet + { + public: + // Types: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef _InIter iter_type; + typedef basic_string<_CharT> string_type; + //@} + + /// Numpunct facet id. + static locale::id id; + + /** + * @brief Constructor performs initialization. + * + * This is the constructor provided by the standard. + * + * @param refs Passed to the base facet class. + */ + explicit + money_get(size_t __refs = 0) : facet(__refs) { } + + /** + * @brief Read and parse a monetary value. + * + * This function reads characters from @a s, interprets them as a + * monetary value according to moneypunct and ctype facets retrieved + * from io.getloc(), and returns the result in @a units as an integral + * value moneypunct::frac_digits() * the actual amount. For example, + * the string $10.01 in a US locale would store 1001 in @a units. + * + * Any characters not part of a valid money amount are not consumed. + * + * If a money value cannot be parsed from the input stream, sets + * err=(err|io.failbit). If the stream is consumed before finishing + * parsing, sets err=(err|io.failbit|io.eofbit). @a units is + * unchanged if parsing fails. + * + * This function works by returning the result of do_get(). + * + * @param s Start of characters to parse. + * @param end End of characters to parse. + * @param intl Parameter to use_facet >. + * @param io Source of facets and io state. + * @param err Error field to set if parsing fails. + * @param units Place to store result of parsing. + * @return Iterator referencing first character beyond valid money + * amount. + */ + iter_type + get(iter_type __s, iter_type __end, bool __intl, ios_base& __io, + ios_base::iostate& __err, long double& __units) const + { return this->do_get(__s, __end, __intl, __io, __err, __units); } + + /** + * @brief Read and parse a monetary value. + * + * This function reads characters from @a s, interprets them as a + * monetary value according to moneypunct and ctype facets retrieved + * from io.getloc(), and returns the result in @a digits. For example, + * the string $10.01 in a US locale would store "1001" in @a digits. + * + * Any characters not part of a valid money amount are not consumed. + * + * If a money value cannot be parsed from the input stream, sets + * err=(err|io.failbit). If the stream is consumed before finishing + * parsing, sets err=(err|io.failbit|io.eofbit). + * + * This function works by returning the result of do_get(). + * + * @param s Start of characters to parse. + * @param end End of characters to parse. + * @param intl Parameter to use_facet >. + * @param io Source of facets and io state. + * @param err Error field to set if parsing fails. + * @param digits Place to store result of parsing. + * @return Iterator referencing first character beyond valid money + * amount. + */ + iter_type + get(iter_type __s, iter_type __end, bool __intl, ios_base& __io, + ios_base::iostate& __err, string_type& __digits) const + { return this->do_get(__s, __end, __intl, __io, __err, __digits); } + + protected: + /// Destructor. + virtual + ~money_get() { } + + /** + * @brief Read and parse a monetary value. + * + * This function reads and parses characters representing a monetary + * value. This function is a hook for derived classes to change the + * value returned. @see get() for details. + */ + // XXX GLIBCXX_ABI Deprecated +#if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ + virtual iter_type + __do_get(iter_type __s, iter_type __end, bool __intl, ios_base& __io, + ios_base::iostate& __err, double& __units) const; +#else + virtual iter_type + do_get(iter_type __s, iter_type __end, bool __intl, ios_base& __io, + ios_base::iostate& __err, long double& __units) const; +#endif + + /** + * @brief Read and parse a monetary value. + * + * This function reads and parses characters representing a monetary + * value. This function is a hook for derived classes to change the + * value returned. @see get() for details. + */ + virtual iter_type + do_get(iter_type __s, iter_type __end, bool __intl, ios_base& __io, + ios_base::iostate& __err, string_type& __digits) const; + + // XXX GLIBCXX_ABI Deprecated +#if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ + virtual iter_type + do_get(iter_type __s, iter_type __end, bool __intl, ios_base& __io, + ios_base::iostate& __err, long double& __units) const; +#endif + + template + iter_type + _M_extract(iter_type __s, iter_type __end, ios_base& __io, + ios_base::iostate& __err, string& __digits) const; + }; + + template + locale::id money_get<_CharT, _InIter>::id; + + /** + * @brief Facet for outputting monetary amounts. + * + * This facet encapsulates the code to format and output a monetary + * amount. + * + * The money_put template uses protected virtual functions to + * provide the actual results. The public accessors forward the + * call to the virtual functions. These virtual functions are + * hooks for developers to implement the behavior they require from + * the money_put facet. + */ + template + class money_put : public locale::facet + { + public: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef _OutIter iter_type; + typedef basic_string<_CharT> string_type; + //@} + + /// Numpunct facet id. + static locale::id id; + + /** + * @brief Constructor performs initialization. + * + * This is the constructor provided by the standard. + * + * @param refs Passed to the base facet class. + */ + explicit + money_put(size_t __refs = 0) : facet(__refs) { } + + /** + * @brief Format and output a monetary value. + * + * This function formats @a units as a monetary value according to + * moneypunct and ctype facets retrieved from io.getloc(), and writes + * the resulting characters to @a s. For example, the value 1001 in a + * US locale would write "$10.01" to @a s. + * + * This function works by returning the result of do_put(). + * + * @param s The stream to write to. + * @param intl Parameter to use_facet >. + * @param io Source of facets and io state. + * @param fill char_type to use for padding. + * @param units Place to store result of parsing. + * @return Iterator after writing. + */ + iter_type + put(iter_type __s, bool __intl, ios_base& __io, + char_type __fill, long double __units) const + { return this->do_put(__s, __intl, __io, __fill, __units); } + + /** + * @brief Format and output a monetary value. + * + * This function formats @a digits as a monetary value according to + * moneypunct and ctype facets retrieved from io.getloc(), and writes + * the resulting characters to @a s. For example, the string "1001" in + * a US locale would write "$10.01" to @a s. + * + * This function works by returning the result of do_put(). + * + * @param s The stream to write to. + * @param intl Parameter to use_facet >. + * @param io Source of facets and io state. + * @param fill char_type to use for padding. + * @param units Place to store result of parsing. + * @return Iterator after writing. + */ + iter_type + put(iter_type __s, bool __intl, ios_base& __io, + char_type __fill, const string_type& __digits) const + { return this->do_put(__s, __intl, __io, __fill, __digits); } + + protected: + /// Destructor. + virtual + ~money_put() { } + + /** + * @brief Format and output a monetary value. + * + * This function formats @a units as a monetary value according to + * moneypunct and ctype facets retrieved from io.getloc(), and writes + * the resulting characters to @a s. For example, the value 1001 in a + * US locale would write "$10.01" to @a s. + * + * This function is a hook for derived classes to change the value + * returned. @see put(). + * + * @param s The stream to write to. + * @param intl Parameter to use_facet >. + * @param io Source of facets and io state. + * @param fill char_type to use for padding. + * @param units Place to store result of parsing. + * @return Iterator after writing. + */ + // XXX GLIBCXX_ABI Deprecated +#if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ + virtual iter_type + __do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill, + double __units) const; +#else + virtual iter_type + do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill, + long double __units) const; +#endif + + /** + * @brief Format and output a monetary value. + * + * This function formats @a digits as a monetary value according to + * moneypunct and ctype facets retrieved from io.getloc(), and writes + * the resulting characters to @a s. For example, the string "1001" in + * a US locale would write "$10.01" to @a s. + * + * This function is a hook for derived classes to change the value + * returned. @see put(). + * + * @param s The stream to write to. + * @param intl Parameter to use_facet >. + * @param io Source of facets and io state. + * @param fill char_type to use for padding. + * @param units Place to store result of parsing. + * @return Iterator after writing. + */ + virtual iter_type + do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill, + const string_type& __digits) const; + + // XXX GLIBCXX_ABI Deprecated +#if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ + virtual iter_type + do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill, + long double __units) const; +#endif + + template + iter_type + _M_insert(iter_type __s, ios_base& __io, char_type __fill, + const string_type& __digits) const; + }; + + template + locale::id money_put<_CharT, _OutIter>::id; + +_GLIBCXX_END_LDBL_NAMESPACE + + /** + * @brief Messages facet base class providing catalog typedef. + */ + struct messages_base + { + typedef int catalog; + }; + + /** + * @brief Facet for handling message catalogs + * + * This facet encapsulates the code to retrieve messages from + * message catalogs. The only thing defined by the standard for this facet + * is the interface. All underlying functionality is + * implementation-defined. + * + * This library currently implements 3 versions of the message facet. The + * first version (gnu) is a wrapper around gettext, provided by libintl. + * The second version (ieee) is a wrapper around catgets. The final + * version (default) does no actual translation. These implementations are + * only provided for char and wchar_t instantiations. + * + * The messages template uses protected virtual functions to + * provide the actual results. The public accessors forward the + * call to the virtual functions. These virtual functions are + * hooks for developers to implement the behavior they require from + * the messages facet. + */ + template + class messages : public locale::facet, public messages_base + { + public: + // Types: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef basic_string<_CharT> string_type; + //@} + + protected: + // Underlying "C" library locale information saved from + // initialization, needed by messages_byname as well. + __c_locale _M_c_locale_messages; + const char* _M_name_messages; + + public: + /// Numpunct facet id. + static locale::id id; + + /** + * @brief Constructor performs initialization. + * + * This is the constructor provided by the standard. + * + * @param refs Passed to the base facet class. + */ + explicit + messages(size_t __refs = 0); + + // Non-standard. + /** + * @brief Internal constructor. Not for general use. + * + * This is a constructor for use by the library itself to set up new + * locales. + * + * @param cloc The "C" locale. + * @param s The name of a locale. + * @param refs Refcount to pass to the base class. + */ + explicit + messages(__c_locale __cloc, const char* __s, size_t __refs = 0); + + /* + * @brief Open a message catalog. + * + * This function opens and returns a handle to a message catalog by + * returning do_open(s, loc). + * + * @param s The catalog to open. + * @param loc Locale to use for character set conversions. + * @return Handle to the catalog or value < 0 if open fails. + */ + catalog + open(const basic_string& __s, const locale& __loc) const + { return this->do_open(__s, __loc); } + + // Non-standard and unorthodox, yet effective. + /* + * @brief Open a message catalog. + * + * This non-standard function opens and returns a handle to a message + * catalog by returning do_open(s, loc). The third argument provides a + * message catalog root directory for gnu gettext and is ignored + * otherwise. + * + * @param s The catalog to open. + * @param loc Locale to use for character set conversions. + * @param dir Message catalog root directory. + * @return Handle to the catalog or value < 0 if open fails. + */ + catalog + open(const basic_string&, const locale&, const char*) const; + + /* + * @brief Look up a string in a message catalog. + * + * This function retrieves and returns a message from a catalog by + * returning do_get(c, set, msgid, s). + * + * For gnu, @a set and @a msgid are ignored. Returns gettext(s). + * For default, returns s. For ieee, returns catgets(c,set,msgid,s). + * + * @param c The catalog to access. + * @param set Implementation-defined. + * @param msgid Implementation-defined. + * @param s Default return value if retrieval fails. + * @return Retrieved message or @a s if get fails. + */ + string_type + get(catalog __c, int __set, int __msgid, const string_type& __s) const + { return this->do_get(__c, __set, __msgid, __s); } + + /* + * @brief Close a message catalog. + * + * Closes catalog @a c by calling do_close(c). + * + * @param c The catalog to close. + */ + void + close(catalog __c) const + { return this->do_close(__c); } + + protected: + /// Destructor. + virtual + ~messages(); + + /* + * @brief Open a message catalog. + * + * This function opens and returns a handle to a message catalog in an + * implementation-defined manner. This function is a hook for derived + * classes to change the value returned. + * + * @param s The catalog to open. + * @param loc Locale to use for character set conversions. + * @return Handle to the opened catalog, value < 0 if open failed. + */ + virtual catalog + do_open(const basic_string&, const locale&) const; + + /* + * @brief Look up a string in a message catalog. + * + * This function retrieves and returns a message from a catalog in an + * implementation-defined manner. This function is a hook for derived + * classes to change the value returned. + * + * For gnu, @a set and @a msgid are ignored. Returns gettext(s). + * For default, returns s. For ieee, returns catgets(c,set,msgid,s). + * + * @param c The catalog to access. + * @param set Implementation-defined. + * @param msgid Implementation-defined. + * @param s Default return value if retrieval fails. + * @return Retrieved message or @a s if get fails. + */ + virtual string_type + do_get(catalog, int, int, const string_type& __dfault) const; + + /* + * @brief Close a message catalog. + * + * @param c The catalog to close. + */ + virtual void + do_close(catalog) const; + + // Returns a locale and codeset-converted string, given a char* message. + char* + _M_convert_to_char(const string_type& __msg) const + { + // XXX + return reinterpret_cast(const_cast<_CharT*>(__msg.c_str())); + } + + // Returns a locale and codeset-converted string, given a char* message. + string_type + _M_convert_from_char(char*) const + { +#if 0 + // Length of message string without terminating null. + size_t __len = char_traits::length(__msg) - 1; + + // "everybody can easily convert the string using + // mbsrtowcs/wcsrtombs or with iconv()" + + // Convert char* to _CharT in locale used to open catalog. + // XXX need additional template parameter on messages class for this.. + // typedef typename codecvt __codecvt_type; + typedef typename codecvt __codecvt_type; + + __codecvt_type::state_type __state; + // XXX may need to initialize state. + //initialize_state(__state._M_init()); + + char* __from_next; + // XXX what size for this string? + _CharT* __to = static_cast<_CharT*>(__builtin_alloca(__len + 1)); + const __codecvt_type& __cvt = use_facet<__codecvt_type>(_M_locale_conv); + __cvt.out(__state, __msg, __msg + __len, __from_next, + __to, __to + __len + 1, __to_next); + return string_type(__to); +#endif +#if 0 + typedef ctype<_CharT> __ctype_type; + // const __ctype_type& __cvt = use_facet<__ctype_type>(_M_locale_msg); + const __ctype_type& __cvt = use_facet<__ctype_type>(locale()); + // XXX Again, proper length of converted string an issue here. + // For now, assume the converted length is not larger. + _CharT* __dest = static_cast<_CharT*>(__builtin_alloca(__len + 1)); + __cvt.widen(__msg, __msg + __len, __dest); + return basic_string<_CharT>(__dest); +#endif + return string_type(); + } + }; + + template + locale::id messages<_CharT>::id; + + // Specializations for required instantiations. + template<> + string + messages::do_get(catalog, int, int, const string&) const; + +#ifdef _GLIBCXX_USE_WCHAR_T + template<> + wstring + messages::do_get(catalog, int, int, const wstring&) const; +#endif + + /// class messages_byname [22.2.7.2]. + template + class messages_byname : public messages<_CharT> + { + public: + typedef _CharT char_type; + typedef basic_string<_CharT> string_type; + + explicit + messages_byname(const char* __s, size_t __refs = 0); + + protected: + virtual + ~messages_byname() + { } + }; + +_GLIBCXX_END_NAMESPACE + +// Include host and configuration specific messages functions. +#include + +// 22.2.1.5 Template class codecvt +#include + +#ifndef _GLIBCXX_EXPORT_TEMPLATE +# include +#endif + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/locale_facets_nonio.tcc b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/locale_facets_nonio.tcc new file mode 100644 index 00000000..06bbfcf4 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/locale_facets_nonio.tcc @@ -0,0 +1,1330 @@ +// Locale support -*- C++ -*- + +// Copyright (C) 2007, 2008, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file locale_facets_nonio.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _LOCALE_FACETS_NONIO_TCC +#define _LOCALE_FACETS_NONIO_TCC 1 + +#pragma GCC system_header + +_GLIBCXX_BEGIN_NAMESPACE(std) + + template + struct __use_cache<__moneypunct_cache<_CharT, _Intl> > + { + const __moneypunct_cache<_CharT, _Intl>* + operator() (const locale& __loc) const + { + const size_t __i = moneypunct<_CharT, _Intl>::id._M_id(); + const locale::facet** __caches = __loc._M_impl->_M_caches; + if (!__caches[__i]) + { + __moneypunct_cache<_CharT, _Intl>* __tmp = NULL; + __try + { + __tmp = new __moneypunct_cache<_CharT, _Intl>; + __tmp->_M_cache(__loc); + } + __catch(...) + { + delete __tmp; + __throw_exception_again; + } + __loc._M_impl->_M_install_cache(__tmp, __i); + } + return static_cast< + const __moneypunct_cache<_CharT, _Intl>*>(__caches[__i]); + } + }; + + template + void + __moneypunct_cache<_CharT, _Intl>::_M_cache(const locale& __loc) + { + _M_allocated = true; + + const moneypunct<_CharT, _Intl>& __mp = + use_facet >(__loc); + + _M_grouping_size = __mp.grouping().size(); + char* __grouping = new char[_M_grouping_size]; + __mp.grouping().copy(__grouping, _M_grouping_size); + _M_grouping = __grouping; + _M_use_grouping = (_M_grouping_size + && static_cast(_M_grouping[0]) > 0 + && (_M_grouping[0] + != __gnu_cxx::__numeric_traits::__max)); + + _M_decimal_point = __mp.decimal_point(); + _M_thousands_sep = __mp.thousands_sep(); + _M_frac_digits = __mp.frac_digits(); + + _M_curr_symbol_size = __mp.curr_symbol().size(); + _CharT* __curr_symbol = new _CharT[_M_curr_symbol_size]; + __mp.curr_symbol().copy(__curr_symbol, _M_curr_symbol_size); + _M_curr_symbol = __curr_symbol; + + _M_positive_sign_size = __mp.positive_sign().size(); + _CharT* __positive_sign = new _CharT[_M_positive_sign_size]; + __mp.positive_sign().copy(__positive_sign, _M_positive_sign_size); + _M_positive_sign = __positive_sign; + + _M_negative_sign_size = __mp.negative_sign().size(); + _CharT* __negative_sign = new _CharT[_M_negative_sign_size]; + __mp.negative_sign().copy(__negative_sign, _M_negative_sign_size); + _M_negative_sign = __negative_sign; + + _M_pos_format = __mp.pos_format(); + _M_neg_format = __mp.neg_format(); + + const ctype<_CharT>& __ct = use_facet >(__loc); + __ct.widen(money_base::_S_atoms, + money_base::_S_atoms + money_base::_S_end, _M_atoms); + } + +_GLIBCXX_BEGIN_LDBL_NAMESPACE + + template + template + _InIter + money_get<_CharT, _InIter>:: + _M_extract(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, string& __units) const + { + typedef char_traits<_CharT> __traits_type; + typedef typename string_type::size_type size_type; + typedef money_base::part part; + typedef __moneypunct_cache<_CharT, _Intl> __cache_type; + + const locale& __loc = __io._M_getloc(); + const ctype<_CharT>& __ctype = use_facet >(__loc); + + __use_cache<__cache_type> __uc; + const __cache_type* __lc = __uc(__loc); + const char_type* __lit = __lc->_M_atoms; + + // Deduced sign. + bool __negative = false; + // Sign size. + size_type __sign_size = 0; + // True if sign is mandatory. + const bool __mandatory_sign = (__lc->_M_positive_sign_size + && __lc->_M_negative_sign_size); + // String of grouping info from thousands_sep plucked from __units. + string __grouping_tmp; + if (__lc->_M_use_grouping) + __grouping_tmp.reserve(32); + // Last position before the decimal point. + int __last_pos = 0; + // Separator positions, then, possibly, fractional digits. + int __n = 0; + // If input iterator is in a valid state. + bool __testvalid = true; + // Flag marking when a decimal point is found. + bool __testdecfound = false; + + // The tentative returned string is stored here. + string __res; + __res.reserve(32); + + const char_type* __lit_zero = __lit + money_base::_S_zero; + const money_base::pattern __p = __lc->_M_neg_format; + for (int __i = 0; __i < 4 && __testvalid; ++__i) + { + const part __which = static_cast(__p.field[__i]); + switch (__which) + { + case money_base::symbol: + // According to 22.2.6.1.2, p2, symbol is required + // if (__io.flags() & ios_base::showbase), otherwise + // is optional and consumed only if other characters + // are needed to complete the format. + if (__io.flags() & ios_base::showbase || __sign_size > 1 + || __i == 0 + || (__i == 1 && (__mandatory_sign + || (static_cast(__p.field[0]) + == money_base::sign) + || (static_cast(__p.field[2]) + == money_base::space))) + || (__i == 2 && ((static_cast(__p.field[3]) + == money_base::value) + || (__mandatory_sign + && (static_cast(__p.field[3]) + == money_base::sign))))) + { + const size_type __len = __lc->_M_curr_symbol_size; + size_type __j = 0; + for (; __beg != __end && __j < __len + && *__beg == __lc->_M_curr_symbol[__j]; + ++__beg, ++__j); + if (__j != __len + && (__j || __io.flags() & ios_base::showbase)) + __testvalid = false; + } + break; + case money_base::sign: + // Sign might not exist, or be more than one character long. + if (__lc->_M_positive_sign_size && __beg != __end + && *__beg == __lc->_M_positive_sign[0]) + { + __sign_size = __lc->_M_positive_sign_size; + ++__beg; + } + else if (__lc->_M_negative_sign_size && __beg != __end + && *__beg == __lc->_M_negative_sign[0]) + { + __negative = true; + __sign_size = __lc->_M_negative_sign_size; + ++__beg; + } + else if (__lc->_M_positive_sign_size + && !__lc->_M_negative_sign_size) + // "... if no sign is detected, the result is given the sign + // that corresponds to the source of the empty string" + __negative = true; + else if (__mandatory_sign) + __testvalid = false; + break; + case money_base::value: + // Extract digits, remove and stash away the + // grouping of found thousands separators. + for (; __beg != __end; ++__beg) + { + const char_type __c = *__beg; + const char_type* __q = __traits_type::find(__lit_zero, + 10, __c); + if (__q != 0) + { + __res += money_base::_S_atoms[__q - __lit]; + ++__n; + } + else if (__c == __lc->_M_decimal_point + && !__testdecfound) + { + if (__lc->_M_frac_digits <= 0) + break; + + __last_pos = __n; + __n = 0; + __testdecfound = true; + } + else if (__lc->_M_use_grouping + && __c == __lc->_M_thousands_sep + && !__testdecfound) + { + if (__n) + { + // Mark position for later analysis. + __grouping_tmp += static_cast(__n); + __n = 0; + } + else + { + __testvalid = false; + break; + } + } + else + break; + } + if (__res.empty()) + __testvalid = false; + break; + case money_base::space: + // At least one space is required. + if (__beg != __end && __ctype.is(ctype_base::space, *__beg)) + ++__beg; + else + __testvalid = false; + case money_base::none: + // Only if not at the end of the pattern. + if (__i != 3) + for (; __beg != __end + && __ctype.is(ctype_base::space, *__beg); ++__beg); + break; + } + } + + // Need to get the rest of the sign characters, if they exist. + if (__sign_size > 1 && __testvalid) + { + const char_type* __sign = __negative ? __lc->_M_negative_sign + : __lc->_M_positive_sign; + size_type __i = 1; + for (; __beg != __end && __i < __sign_size + && *__beg == __sign[__i]; ++__beg, ++__i); + + if (__i != __sign_size) + __testvalid = false; + } + + if (__testvalid) + { + // Strip leading zeros. + if (__res.size() > 1) + { + const size_type __first = __res.find_first_not_of('0'); + const bool __only_zeros = __first == string::npos; + if (__first) + __res.erase(0, __only_zeros ? __res.size() - 1 : __first); + } + + // 22.2.6.1.2, p4 + if (__negative && __res[0] != '0') + __res.insert(__res.begin(), '-'); + + // Test for grouping fidelity. + if (__grouping_tmp.size()) + { + // Add the ending grouping. + __grouping_tmp += static_cast(__testdecfound ? __last_pos + : __n); + if (!std::__verify_grouping(__lc->_M_grouping, + __lc->_M_grouping_size, + __grouping_tmp)) + __err |= ios_base::failbit; + } + + // Iff not enough digits were supplied after the decimal-point. + if (__testdecfound && __n != __lc->_M_frac_digits) + __testvalid = false; + } + + // Iff valid sequence is not recognized. + if (!__testvalid) + __err |= ios_base::failbit; + else + __units.swap(__res); + + // Iff no more characters are available. + if (__beg == __end) + __err |= ios_base::eofbit; + return __beg; + } + +#if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ + template + _InIter + money_get<_CharT, _InIter>:: + __do_get(iter_type __beg, iter_type __end, bool __intl, ios_base& __io, + ios_base::iostate& __err, double& __units) const + { + string __str; + __beg = __intl ? _M_extract(__beg, __end, __io, __err, __str) + : _M_extract(__beg, __end, __io, __err, __str); + std::__convert_to_v(__str.c_str(), __units, __err, _S_get_c_locale()); + return __beg; + } +#endif + + template + _InIter + money_get<_CharT, _InIter>:: + do_get(iter_type __beg, iter_type __end, bool __intl, ios_base& __io, + ios_base::iostate& __err, long double& __units) const + { + string __str; + __beg = __intl ? _M_extract(__beg, __end, __io, __err, __str) + : _M_extract(__beg, __end, __io, __err, __str); + std::__convert_to_v(__str.c_str(), __units, __err, _S_get_c_locale()); + return __beg; + } + + template + _InIter + money_get<_CharT, _InIter>:: + do_get(iter_type __beg, iter_type __end, bool __intl, ios_base& __io, + ios_base::iostate& __err, string_type& __digits) const + { + typedef typename string::size_type size_type; + + const locale& __loc = __io._M_getloc(); + const ctype<_CharT>& __ctype = use_facet >(__loc); + + string __str; + __beg = __intl ? _M_extract(__beg, __end, __io, __err, __str) + : _M_extract(__beg, __end, __io, __err, __str); + const size_type __len = __str.size(); + if (__len) + { + __digits.resize(__len); + __ctype.widen(__str.data(), __str.data() + __len, &__digits[0]); + } + return __beg; + } + + template + template + _OutIter + money_put<_CharT, _OutIter>:: + _M_insert(iter_type __s, ios_base& __io, char_type __fill, + const string_type& __digits) const + { + typedef typename string_type::size_type size_type; + typedef money_base::part part; + typedef __moneypunct_cache<_CharT, _Intl> __cache_type; + + const locale& __loc = __io._M_getloc(); + const ctype<_CharT>& __ctype = use_facet >(__loc); + + __use_cache<__cache_type> __uc; + const __cache_type* __lc = __uc(__loc); + const char_type* __lit = __lc->_M_atoms; + + // Determine if negative or positive formats are to be used, and + // discard leading negative_sign if it is present. + const char_type* __beg = __digits.data(); + + money_base::pattern __p; + const char_type* __sign; + size_type __sign_size; + if (!(*__beg == __lit[money_base::_S_minus])) + { + __p = __lc->_M_pos_format; + __sign = __lc->_M_positive_sign; + __sign_size = __lc->_M_positive_sign_size; + } + else + { + __p = __lc->_M_neg_format; + __sign = __lc->_M_negative_sign; + __sign_size = __lc->_M_negative_sign_size; + if (__digits.size()) + ++__beg; + } + + // Look for valid numbers in the ctype facet within input digits. + size_type __len = __ctype.scan_not(ctype_base::digit, __beg, + __beg + __digits.size()) - __beg; + if (__len) + { + // Assume valid input, and attempt to format. + // Break down input numbers into base components, as follows: + // final_value = grouped units + (decimal point) + (digits) + string_type __value; + __value.reserve(2 * __len); + + // Add thousands separators to non-decimal digits, per + // grouping rules. + long __paddec = __len - __lc->_M_frac_digits; + if (__paddec > 0) + { + if (__lc->_M_frac_digits < 0) + __paddec = __len; + if (__lc->_M_grouping_size) + { + __value.assign(2 * __paddec, char_type()); + _CharT* __vend = + std::__add_grouping(&__value[0], __lc->_M_thousands_sep, + __lc->_M_grouping, + __lc->_M_grouping_size, + __beg, __beg + __paddec); + __value.erase(__vend - &__value[0]); + } + else + __value.assign(__beg, __paddec); + } + + // Deal with decimal point, decimal digits. + if (__lc->_M_frac_digits > 0) + { + __value += __lc->_M_decimal_point; + if (__paddec >= 0) + __value.append(__beg + __paddec, __lc->_M_frac_digits); + else + { + // Have to pad zeros in the decimal position. + __value.append(-__paddec, __lit[money_base::_S_zero]); + __value.append(__beg, __len); + } + } + + // Calculate length of resulting string. + const ios_base::fmtflags __f = __io.flags() + & ios_base::adjustfield; + __len = __value.size() + __sign_size; + __len += ((__io.flags() & ios_base::showbase) + ? __lc->_M_curr_symbol_size : 0); + + string_type __res; + __res.reserve(2 * __len); + + const size_type __width = static_cast(__io.width()); + const bool __testipad = (__f == ios_base::internal + && __len < __width); + // Fit formatted digits into the required pattern. + for (int __i = 0; __i < 4; ++__i) + { + const part __which = static_cast(__p.field[__i]); + switch (__which) + { + case money_base::symbol: + if (__io.flags() & ios_base::showbase) + __res.append(__lc->_M_curr_symbol, + __lc->_M_curr_symbol_size); + break; + case money_base::sign: + // Sign might not exist, or be more than one + // character long. In that case, add in the rest + // below. + if (__sign_size) + __res += __sign[0]; + break; + case money_base::value: + __res += __value; + break; + case money_base::space: + // At least one space is required, but if internal + // formatting is required, an arbitrary number of + // fill spaces will be necessary. + if (__testipad) + __res.append(__width - __len, __fill); + else + __res += __fill; + break; + case money_base::none: + if (__testipad) + __res.append(__width - __len, __fill); + break; + } + } + + // Special case of multi-part sign parts. + if (__sign_size > 1) + __res.append(__sign + 1, __sign_size - 1); + + // Pad, if still necessary. + __len = __res.size(); + if (__width > __len) + { + if (__f == ios_base::left) + // After. + __res.append(__width - __len, __fill); + else + // Before. + __res.insert(0, __width - __len, __fill); + __len = __width; + } + + // Write resulting, fully-formatted string to output iterator. + __s = std::__write(__s, __res.data(), __len); + } + __io.width(0); + return __s; + } + +#if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ + template + _OutIter + money_put<_CharT, _OutIter>:: + __do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill, + double __units) const + { return this->do_put(__s, __intl, __io, __fill, (long double) __units); } +#endif + + template + _OutIter + money_put<_CharT, _OutIter>:: + do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill, + long double __units) const + { + const locale __loc = __io.getloc(); + const ctype<_CharT>& __ctype = use_facet >(__loc); +#ifdef _GLIBCXX_USE_C99 + // First try a buffer perhaps big enough. + int __cs_size = 64; + char* __cs = static_cast(__builtin_alloca(__cs_size)); + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 328. Bad sprintf format modifier in money_put<>::do_put() + int __len = std::__convert_from_v(_S_get_c_locale(), __cs, __cs_size, + "%.*Lf", 0, __units); + // If the buffer was not large enough, try again with the correct size. + if (__len >= __cs_size) + { + __cs_size = __len + 1; + __cs = static_cast(__builtin_alloca(__cs_size)); + __len = std::__convert_from_v(_S_get_c_locale(), __cs, __cs_size, + "%.*Lf", 0, __units); + } +#else + // max_exponent10 + 1 for the integer part, + 2 for sign and '\0'. + const int __cs_size = + __gnu_cxx::__numeric_traits::__max_exponent10 + 3; + char* __cs = static_cast(__builtin_alloca(__cs_size)); + int __len = std::__convert_from_v(_S_get_c_locale(), __cs, 0, "%.*Lf", + 0, __units); +#endif + string_type __digits(__len, char_type()); + __ctype.widen(__cs, __cs + __len, &__digits[0]); + return __intl ? _M_insert(__s, __io, __fill, __digits) + : _M_insert(__s, __io, __fill, __digits); + } + + template + _OutIter + money_put<_CharT, _OutIter>:: + do_put(iter_type __s, bool __intl, ios_base& __io, char_type __fill, + const string_type& __digits) const + { return __intl ? _M_insert(__s, __io, __fill, __digits) + : _M_insert(__s, __io, __fill, __digits); } + +_GLIBCXX_END_LDBL_NAMESPACE + + // NB: Not especially useful. Without an ios_base object or some + // kind of locale reference, we are left clawing at the air where + // the side of the mountain used to be... + template + time_base::dateorder + time_get<_CharT, _InIter>::do_date_order() const + { return time_base::no_order; } + + // Expand a strftime format string and parse it. E.g., do_get_date() may + // pass %m/%d/%Y => extracted characters. + template + _InIter + time_get<_CharT, _InIter>:: + _M_extract_via_format(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm, + const _CharT* __format) const + { + const locale& __loc = __io._M_getloc(); + const __timepunct<_CharT>& __tp = use_facet<__timepunct<_CharT> >(__loc); + const ctype<_CharT>& __ctype = use_facet >(__loc); + const size_t __len = char_traits<_CharT>::length(__format); + + ios_base::iostate __tmperr = ios_base::goodbit; + for (size_t __i = 0; __beg != __end && __i < __len && !__tmperr; ++__i) + { + if (__ctype.narrow(__format[__i], 0) == '%') + { + // Verify valid formatting code, attempt to extract. + char __c = __ctype.narrow(__format[++__i], 0); + int __mem = 0; + if (__c == 'E' || __c == 'O') + __c = __ctype.narrow(__format[++__i], 0); + switch (__c) + { + const char* __cs; + _CharT __wcs[10]; + case 'a': + // Abbreviated weekday name [tm_wday] + const char_type* __days1[7]; + __tp._M_days_abbreviated(__days1); + __beg = _M_extract_name(__beg, __end, __tm->tm_wday, __days1, + 7, __io, __tmperr); + break; + case 'A': + // Weekday name [tm_wday]. + const char_type* __days2[7]; + __tp._M_days(__days2); + __beg = _M_extract_name(__beg, __end, __tm->tm_wday, __days2, + 7, __io, __tmperr); + break; + case 'h': + case 'b': + // Abbreviated month name [tm_mon] + const char_type* __months1[12]; + __tp._M_months_abbreviated(__months1); + __beg = _M_extract_name(__beg, __end, __tm->tm_mon, + __months1, 12, __io, __tmperr); + break; + case 'B': + // Month name [tm_mon]. + const char_type* __months2[12]; + __tp._M_months(__months2); + __beg = _M_extract_name(__beg, __end, __tm->tm_mon, + __months2, 12, __io, __tmperr); + break; + case 'c': + // Default time and date representation. + const char_type* __dt[2]; + __tp._M_date_time_formats(__dt); + __beg = _M_extract_via_format(__beg, __end, __io, __tmperr, + __tm, __dt[0]); + break; + case 'd': + // Day [01, 31]. [tm_mday] + __beg = _M_extract_num(__beg, __end, __tm->tm_mday, 1, 31, 2, + __io, __tmperr); + break; + case 'e': + // Day [1, 31], with single digits preceded by + // space. [tm_mday] + if (__ctype.is(ctype_base::space, *__beg)) + __beg = _M_extract_num(++__beg, __end, __tm->tm_mday, 1, 9, + 1, __io, __tmperr); + else + __beg = _M_extract_num(__beg, __end, __tm->tm_mday, 10, 31, + 2, __io, __tmperr); + break; + case 'D': + // Equivalent to %m/%d/%y.[tm_mon, tm_mday, tm_year] + __cs = "%m/%d/%y"; + __ctype.widen(__cs, __cs + 9, __wcs); + __beg = _M_extract_via_format(__beg, __end, __io, __tmperr, + __tm, __wcs); + break; + case 'H': + // Hour [00, 23]. [tm_hour] + __beg = _M_extract_num(__beg, __end, __tm->tm_hour, 0, 23, 2, + __io, __tmperr); + break; + case 'I': + // Hour [01, 12]. [tm_hour] + __beg = _M_extract_num(__beg, __end, __tm->tm_hour, 1, 12, 2, + __io, __tmperr); + break; + case 'm': + // Month [01, 12]. [tm_mon] + __beg = _M_extract_num(__beg, __end, __mem, 1, 12, 2, + __io, __tmperr); + if (!__tmperr) + __tm->tm_mon = __mem - 1; + break; + case 'M': + // Minute [00, 59]. [tm_min] + __beg = _M_extract_num(__beg, __end, __tm->tm_min, 0, 59, 2, + __io, __tmperr); + break; + case 'n': + if (__ctype.narrow(*__beg, 0) == '\n') + ++__beg; + else + __tmperr |= ios_base::failbit; + break; + case 'R': + // Equivalent to (%H:%M). + __cs = "%H:%M"; + __ctype.widen(__cs, __cs + 6, __wcs); + __beg = _M_extract_via_format(__beg, __end, __io, __tmperr, + __tm, __wcs); + break; + case 'S': + // Seconds. [tm_sec] + // [00, 60] in C99 (one leap-second), [00, 61] in C89. +#ifdef _GLIBCXX_USE_C99 + __beg = _M_extract_num(__beg, __end, __tm->tm_sec, 0, 60, 2, +#else + __beg = _M_extract_num(__beg, __end, __tm->tm_sec, 0, 61, 2, +#endif + __io, __tmperr); + break; + case 't': + if (__ctype.narrow(*__beg, 0) == '\t') + ++__beg; + else + __tmperr |= ios_base::failbit; + break; + case 'T': + // Equivalent to (%H:%M:%S). + __cs = "%H:%M:%S"; + __ctype.widen(__cs, __cs + 9, __wcs); + __beg = _M_extract_via_format(__beg, __end, __io, __tmperr, + __tm, __wcs); + break; + case 'x': + // Locale's date. + const char_type* __dates[2]; + __tp._M_date_formats(__dates); + __beg = _M_extract_via_format(__beg, __end, __io, __tmperr, + __tm, __dates[0]); + break; + case 'X': + // Locale's time. + const char_type* __times[2]; + __tp._M_time_formats(__times); + __beg = _M_extract_via_format(__beg, __end, __io, __tmperr, + __tm, __times[0]); + break; + case 'y': + case 'C': // C99 + // Two digit year. [tm_year] + __beg = _M_extract_num(__beg, __end, __tm->tm_year, 0, 99, 2, + __io, __tmperr); + break; + case 'Y': + // Year [1900). [tm_year] + __beg = _M_extract_num(__beg, __end, __mem, 0, 9999, 4, + __io, __tmperr); + if (!__tmperr) + __tm->tm_year = __mem - 1900; + break; + case 'Z': + // Timezone info. + if (__ctype.is(ctype_base::upper, *__beg)) + { + int __tmp; + __beg = _M_extract_name(__beg, __end, __tmp, + __timepunct_cache<_CharT>::_S_timezones, + 14, __io, __tmperr); + + // GMT requires special effort. + if (__beg != __end && !__tmperr && __tmp == 0 + && (*__beg == __ctype.widen('-') + || *__beg == __ctype.widen('+'))) + { + __beg = _M_extract_num(__beg, __end, __tmp, 0, 23, 2, + __io, __tmperr); + __beg = _M_extract_num(__beg, __end, __tmp, 0, 59, 2, + __io, __tmperr); + } + } + else + __tmperr |= ios_base::failbit; + break; + default: + // Not recognized. + __tmperr |= ios_base::failbit; + } + } + else + { + // Verify format and input match, extract and discard. + if (__format[__i] == *__beg) + ++__beg; + else + __tmperr |= ios_base::failbit; + } + } + + if (__tmperr) + __err |= ios_base::failbit; + + return __beg; + } + + template + _InIter + time_get<_CharT, _InIter>:: + _M_extract_num(iter_type __beg, iter_type __end, int& __member, + int __min, int __max, size_t __len, + ios_base& __io, ios_base::iostate& __err) const + { + const locale& __loc = __io._M_getloc(); + const ctype<_CharT>& __ctype = use_facet >(__loc); + + // As-is works for __len = 1, 2, 4, the values actually used. + int __mult = __len == 2 ? 10 : (__len == 4 ? 1000 : 1); + + ++__min; + size_t __i = 0; + int __value = 0; + for (; __beg != __end && __i < __len; ++__beg, ++__i) + { + const char __c = __ctype.narrow(*__beg, '*'); + if (__c >= '0' && __c <= '9') + { + __value = __value * 10 + (__c - '0'); + const int __valuec = __value * __mult; + if (__valuec > __max || __valuec + __mult < __min) + break; + __mult /= 10; + } + else + break; + } + if (__i == __len) + __member = __value; + else + __err |= ios_base::failbit; + + return __beg; + } + + // Assumptions: + // All elements in __names are unique. + template + _InIter + time_get<_CharT, _InIter>:: + _M_extract_name(iter_type __beg, iter_type __end, int& __member, + const _CharT** __names, size_t __indexlen, + ios_base& __io, ios_base::iostate& __err) const + { + typedef char_traits<_CharT> __traits_type; + const locale& __loc = __io._M_getloc(); + const ctype<_CharT>& __ctype = use_facet >(__loc); + + int* __matches = static_cast(__builtin_alloca(sizeof(int) + * __indexlen)); + size_t __nmatches = 0; + size_t __pos = 0; + bool __testvalid = true; + const char_type* __name; + + // Look for initial matches. + // NB: Some of the locale data is in the form of all lowercase + // names, and some is in the form of initially-capitalized + // names. Look for both. + if (__beg != __end) + { + const char_type __c = *__beg; + for (size_t __i1 = 0; __i1 < __indexlen; ++__i1) + if (__c == __names[__i1][0] + || __c == __ctype.toupper(__names[__i1][0])) + __matches[__nmatches++] = __i1; + } + + while (__nmatches > 1) + { + // Find smallest matching string. + size_t __minlen = __traits_type::length(__names[__matches[0]]); + for (size_t __i2 = 1; __i2 < __nmatches; ++__i2) + __minlen = std::min(__minlen, + __traits_type::length(__names[__matches[__i2]])); + ++__beg, ++__pos; + if (__pos < __minlen && __beg != __end) + for (size_t __i3 = 0; __i3 < __nmatches;) + { + __name = __names[__matches[__i3]]; + if (!(__name[__pos] == *__beg)) + __matches[__i3] = __matches[--__nmatches]; + else + ++__i3; + } + else + break; + } + + if (__nmatches == 1) + { + // Make sure found name is completely extracted. + ++__beg, ++__pos; + __name = __names[__matches[0]]; + const size_t __len = __traits_type::length(__name); + while (__pos < __len && __beg != __end && __name[__pos] == *__beg) + ++__beg, ++__pos; + + if (__len == __pos) + __member = __matches[0]; + else + __testvalid = false; + } + else + __testvalid = false; + if (!__testvalid) + __err |= ios_base::failbit; + + return __beg; + } + + template + _InIter + time_get<_CharT, _InIter>:: + do_get_time(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm) const + { + const locale& __loc = __io._M_getloc(); + const __timepunct<_CharT>& __tp = use_facet<__timepunct<_CharT> >(__loc); + const char_type* __times[2]; + __tp._M_time_formats(__times); + __beg = _M_extract_via_format(__beg, __end, __io, __err, + __tm, __times[0]); + if (__beg == __end) + __err |= ios_base::eofbit; + return __beg; + } + + template + _InIter + time_get<_CharT, _InIter>:: + do_get_date(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm) const + { + const locale& __loc = __io._M_getloc(); + const __timepunct<_CharT>& __tp = use_facet<__timepunct<_CharT> >(__loc); + const char_type* __dates[2]; + __tp._M_date_formats(__dates); + __beg = _M_extract_via_format(__beg, __end, __io, __err, + __tm, __dates[0]); + if (__beg == __end) + __err |= ios_base::eofbit; + return __beg; + } + + template + _InIter + time_get<_CharT, _InIter>:: + do_get_weekday(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm) const + { + typedef char_traits<_CharT> __traits_type; + const locale& __loc = __io._M_getloc(); + const __timepunct<_CharT>& __tp = use_facet<__timepunct<_CharT> >(__loc); + const ctype<_CharT>& __ctype = use_facet >(__loc); + const char_type* __days[7]; + __tp._M_days_abbreviated(__days); + int __tmpwday; + ios_base::iostate __tmperr = ios_base::goodbit; + __beg = _M_extract_name(__beg, __end, __tmpwday, __days, 7, + __io, __tmperr); + + // Check to see if non-abbreviated name exists, and extract. + // NB: Assumes both _M_days and _M_days_abbreviated organized in + // exact same order, first to last, such that the resulting + // __days array with the same index points to a day, and that + // day's abbreviated form. + // NB: Also assumes that an abbreviated name is a subset of the name. + if (!__tmperr && __beg != __end) + { + size_t __pos = __traits_type::length(__days[__tmpwday]); + __tp._M_days(__days); + const char_type* __name = __days[__tmpwday]; + if (__name[__pos] == *__beg) + { + // Extract the rest of it. + const size_t __len = __traits_type::length(__name); + while (__pos < __len && __beg != __end + && __name[__pos] == *__beg) + ++__beg, ++__pos; + if (__len != __pos) + __tmperr |= ios_base::failbit; + } + } + if (!__tmperr) + __tm->tm_wday = __tmpwday; + else + __err |= ios_base::failbit; + + if (__beg == __end) + __err |= ios_base::eofbit; + return __beg; + } + + template + _InIter + time_get<_CharT, _InIter>:: + do_get_monthname(iter_type __beg, iter_type __end, + ios_base& __io, ios_base::iostate& __err, tm* __tm) const + { + typedef char_traits<_CharT> __traits_type; + const locale& __loc = __io._M_getloc(); + const __timepunct<_CharT>& __tp = use_facet<__timepunct<_CharT> >(__loc); + const ctype<_CharT>& __ctype = use_facet >(__loc); + const char_type* __months[12]; + __tp._M_months_abbreviated(__months); + int __tmpmon; + ios_base::iostate __tmperr = ios_base::goodbit; + __beg = _M_extract_name(__beg, __end, __tmpmon, __months, 12, + __io, __tmperr); + + // Check to see if non-abbreviated name exists, and extract. + // NB: Assumes both _M_months and _M_months_abbreviated organized in + // exact same order, first to last, such that the resulting + // __months array with the same index points to a month, and that + // month's abbreviated form. + // NB: Also assumes that an abbreviated name is a subset of the name. + if (!__tmperr && __beg != __end) + { + size_t __pos = __traits_type::length(__months[__tmpmon]); + __tp._M_months(__months); + const char_type* __name = __months[__tmpmon]; + if (__name[__pos] == *__beg) + { + // Extract the rest of it. + const size_t __len = __traits_type::length(__name); + while (__pos < __len && __beg != __end + && __name[__pos] == *__beg) + ++__beg, ++__pos; + if (__len != __pos) + __tmperr |= ios_base::failbit; + } + } + if (!__tmperr) + __tm->tm_mon = __tmpmon; + else + __err |= ios_base::failbit; + + if (__beg == __end) + __err |= ios_base::eofbit; + return __beg; + } + + template + _InIter + time_get<_CharT, _InIter>:: + do_get_year(iter_type __beg, iter_type __end, ios_base& __io, + ios_base::iostate& __err, tm* __tm) const + { + const locale& __loc = __io._M_getloc(); + const ctype<_CharT>& __ctype = use_facet >(__loc); + + size_t __i = 0; + int __value = 0; + for (; __beg != __end && __i < 4; ++__beg, ++__i) + { + const char __c = __ctype.narrow(*__beg, '*'); + if (__c >= '0' && __c <= '9') + __value = __value * 10 + (__c - '0'); + else + break; + } + if (__i == 2 || __i == 4) + __tm->tm_year = __i == 2 ? __value : __value - 1900; + else + __err |= ios_base::failbit; + + if (__beg == __end) + __err |= ios_base::eofbit; + return __beg; + } + + template + _OutIter + time_put<_CharT, _OutIter>:: + put(iter_type __s, ios_base& __io, char_type __fill, const tm* __tm, + const _CharT* __beg, const _CharT* __end) const + { + const locale& __loc = __io._M_getloc(); + ctype<_CharT> const& __ctype = use_facet >(__loc); + for (; __beg != __end; ++__beg) + if (__ctype.narrow(*__beg, 0) != '%') + { + *__s = *__beg; + ++__s; + } + else if (++__beg != __end) + { + char __format; + char __mod = 0; + const char __c = __ctype.narrow(*__beg, 0); + if (__c != 'E' && __c != 'O') + __format = __c; + else if (++__beg != __end) + { + __mod = __c; + __format = __ctype.narrow(*__beg, 0); + } + else + break; + __s = this->do_put(__s, __io, __fill, __tm, __format, __mod); + } + else + break; + return __s; + } + + template + _OutIter + time_put<_CharT, _OutIter>:: + do_put(iter_type __s, ios_base& __io, char_type, const tm* __tm, + char __format, char __mod) const + { + const locale& __loc = __io._M_getloc(); + ctype<_CharT> const& __ctype = use_facet >(__loc); + __timepunct<_CharT> const& __tp = use_facet<__timepunct<_CharT> >(__loc); + + // NB: This size is arbitrary. Should this be a data member, + // initialized at construction? + const size_t __maxlen = 128; + char_type* __res = + static_cast(__builtin_alloca(sizeof(char_type) * __maxlen)); + + // NB: In IEE 1003.1-200x, and perhaps other locale models, it + // is possible that the format character will be longer than one + // character. Possibilities include 'E' or 'O' followed by a + // format character: if __mod is not the default argument, assume + // it's a valid modifier. + char_type __fmt[4]; + __fmt[0] = __ctype.widen('%'); + if (!__mod) + { + __fmt[1] = __format; + __fmt[2] = char_type(); + } + else + { + __fmt[1] = __mod; + __fmt[2] = __format; + __fmt[3] = char_type(); + } + + __tp._M_put(__res, __maxlen, __fmt, __tm); + + // Write resulting, fully-formatted string to output iterator. + return std::__write(__s, __res, char_traits::length(__res)); + } + + + // Inhibit implicit instantiations for required instantiations, + // which are defined via explicit instantiations elsewhere. + // NB: This syntax is a GNU extension. +#if _GLIBCXX_EXTERN_TEMPLATE + extern template class moneypunct; + extern template class moneypunct; + extern template class moneypunct_byname; + extern template class moneypunct_byname; + extern template class _GLIBCXX_LDBL_NAMESPACE money_get; + extern template class _GLIBCXX_LDBL_NAMESPACE money_put; + extern template class __timepunct; + extern template class time_put; + extern template class time_put_byname; + extern template class time_get; + extern template class time_get_byname; + extern template class messages; + extern template class messages_byname; + + extern template + const moneypunct& + use_facet >(const locale&); + + extern template + const moneypunct& + use_facet >(const locale&); + + extern template + const money_put& + use_facet >(const locale&); + + extern template + const money_get& + use_facet >(const locale&); + + extern template + const __timepunct& + use_facet<__timepunct >(const locale&); + + extern template + const time_put& + use_facet >(const locale&); + + extern template + const time_get& + use_facet >(const locale&); + + extern template + const messages& + use_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet<__timepunct >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + +#ifdef _GLIBCXX_USE_WCHAR_T + extern template class moneypunct; + extern template class moneypunct; + extern template class moneypunct_byname; + extern template class moneypunct_byname; + extern template class _GLIBCXX_LDBL_NAMESPACE money_get; + extern template class _GLIBCXX_LDBL_NAMESPACE money_put; + extern template class __timepunct; + extern template class time_put; + extern template class time_put_byname; + extern template class time_get; + extern template class time_get_byname; + extern template class messages; + extern template class messages_byname; + + extern template + const moneypunct& + use_facet >(const locale&); + + extern template + const moneypunct& + use_facet >(const locale&); + + extern template + const money_put& + use_facet >(const locale&); + + extern template + const money_get& + use_facet >(const locale&); + + extern template + const __timepunct& + use_facet<__timepunct >(const locale&); + + extern template + const time_put& + use_facet >(const locale&); + + extern template + const time_get& + use_facet >(const locale&); + + extern template + const messages& + use_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet<__timepunct >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); + + extern template + bool + has_facet >(const locale&); +#endif +#endif + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/localefwd.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/localefwd.h new file mode 100644 index 00000000..909df1ec --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/localefwd.h @@ -0,0 +1,183 @@ +// Locale support -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file localefwd.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 22.1 Locales +// + +#ifndef _LOCALE_FWD_H +#define _LOCALE_FWD_H 1 + +#pragma GCC system_header + +#include +#include // Defines __c_locale, config-specific include +#include // For ostreambuf_iterator, istreambuf_iterator +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // 22.1.1 Locale + class locale; + + template + bool + has_facet(const locale&) throw(); + + template + const _Facet& + use_facet(const locale&); + + // 22.1.3 Convenience interfaces + template + bool + isspace(_CharT, const locale&); + + template + bool + isprint(_CharT, const locale&); + + template + bool + iscntrl(_CharT, const locale&); + + template + bool + isupper(_CharT, const locale&); + + template + bool + islower(_CharT, const locale&); + + template + bool + isalpha(_CharT, const locale&); + + template + bool + isdigit(_CharT, const locale&); + + template + bool + ispunct(_CharT, const locale&); + + template + bool + isxdigit(_CharT, const locale&); + + template + bool + isalnum(_CharT, const locale&); + + template + bool + isgraph(_CharT, const locale&); + + template + _CharT + toupper(_CharT, const locale&); + + template + _CharT + tolower(_CharT, const locale&); + + // 22.2.1 and 22.2.1.3 ctype + class ctype_base; + template + class ctype; + template<> class ctype; +#ifdef _GLIBCXX_USE_WCHAR_T + template<> class ctype; +#endif + template + class ctype_byname; + // NB: Specialized for char and wchar_t in locale_facets.h. + + class codecvt_base; + template + class codecvt; + template<> class codecvt; +#ifdef _GLIBCXX_USE_WCHAR_T + template<> class codecvt; +#endif + template + class codecvt_byname; + + // 22.2.2 and 22.2.3 numeric +_GLIBCXX_BEGIN_LDBL_NAMESPACE + template > + class num_get; + template > + class num_put; +_GLIBCXX_END_LDBL_NAMESPACE + template class numpunct; + template class numpunct_byname; + + // 22.2.4 collation + template + class collate; + template class + collate_byname; + + // 22.2.5 date and time + class time_base; + template > + class time_get; + template > + class time_get_byname; + template > + class time_put; + template > + class time_put_byname; + + // 22.2.6 money + class money_base; +_GLIBCXX_BEGIN_LDBL_NAMESPACE + template > + class money_get; + template > + class money_put; +_GLIBCXX_END_LDBL_NAMESPACE + template + class moneypunct; + template + class moneypunct_byname; + + // 22.2.7 message retrieval + class messages_base; + template + class messages; + template + class messages_byname; + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/mask_array.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/mask_array.h new file mode 100644 index 00000000..f915dd91 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/mask_array.h @@ -0,0 +1,206 @@ +// The template and inlines for the -*- C++ -*- mask_array class. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2004, 2005, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file mask_array.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// Written by Gabriel Dos Reis + +#ifndef _MASK_ARRAY_H +#define _MASK_ARRAY_H 1 + +#pragma GCC system_header + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /** + * @addtogroup numeric_arrays + * @{ + */ + + /** + * @brief Reference to selected subset of an array. + * + * A mask_array is a reference to the actual elements of an array specified + * by a bitmask in the form of an array of bool. The way to get a + * mask_array is to call operator[](valarray) on a valarray. The + * returned mask_array then permits carrying operations out on the + * referenced subset of elements in the original valarray. + * + * For example, if a mask_array is obtained using the array (false, true, + * false, true) as an argument, the mask array has two elements referring + * to array[1] and array[3] in the underlying array. + * + * @param Tp Element type. + */ + template + class mask_array + { + public: + typedef _Tp value_type; + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 253. valarray helper functions are almost entirely useless + + /// Copy constructor. Both slices refer to the same underlying array. + mask_array (const mask_array&); + + /// Assignment operator. Assigns elements to corresponding elements + /// of @a a. + mask_array& operator=(const mask_array&); + + void operator=(const valarray<_Tp>&) const; + /// Multiply slice elements by corresponding elements of @a v. + void operator*=(const valarray<_Tp>&) const; + /// Divide slice elements by corresponding elements of @a v. + void operator/=(const valarray<_Tp>&) const; + /// Modulo slice elements by corresponding elements of @a v. + void operator%=(const valarray<_Tp>&) const; + /// Add corresponding elements of @a v to slice elements. + void operator+=(const valarray<_Tp>&) const; + /// Subtract corresponding elements of @a v from slice elements. + void operator-=(const valarray<_Tp>&) const; + /// Logical xor slice elements with corresponding elements of @a v. + void operator^=(const valarray<_Tp>&) const; + /// Logical and slice elements with corresponding elements of @a v. + void operator&=(const valarray<_Tp>&) const; + /// Logical or slice elements with corresponding elements of @a v. + void operator|=(const valarray<_Tp>&) const; + /// Left shift slice elements by corresponding elements of @a v. + void operator<<=(const valarray<_Tp>&) const; + /// Right shift slice elements by corresponding elements of @a v. + void operator>>=(const valarray<_Tp>&) const; + /// Assign all slice elements to @a t. + void operator=(const _Tp&) const; + + // ~mask_array (); + + template + void operator=(const _Expr<_Dom,_Tp>&) const; + template + void operator*=(const _Expr<_Dom,_Tp>&) const; + template + void operator/=(const _Expr<_Dom,_Tp>&) const; + template + void operator%=(const _Expr<_Dom,_Tp>&) const; + template + void operator+=(const _Expr<_Dom,_Tp>&) const; + template + void operator-=(const _Expr<_Dom,_Tp>&) const; + template + void operator^=(const _Expr<_Dom,_Tp>&) const; + template + void operator&=(const _Expr<_Dom,_Tp>&) const; + template + void operator|=(const _Expr<_Dom,_Tp>&) const; + template + void operator<<=(const _Expr<_Dom,_Tp>&) const; + template + void operator>>=(const _Expr<_Dom,_Tp>&) const; + + private: + mask_array(_Array<_Tp>, size_t, _Array); + friend class valarray<_Tp>; + + const size_t _M_sz; + const _Array _M_mask; + const _Array<_Tp> _M_array; + + // not implemented + mask_array(); + }; + + template + inline mask_array<_Tp>::mask_array(const mask_array<_Tp>& a) + : _M_sz(a._M_sz), _M_mask(a._M_mask), _M_array(a._M_array) {} + + template + inline + mask_array<_Tp>::mask_array(_Array<_Tp> __a, size_t __s, _Array __m) + : _M_sz(__s), _M_mask(__m), _M_array(__a) {} + + template + inline mask_array<_Tp>& + mask_array<_Tp>::operator=(const mask_array<_Tp>& __a) + { + std::__valarray_copy(__a._M_array, __a._M_mask, + _M_sz, _M_array, _M_mask); + return *this; + } + + template + inline void + mask_array<_Tp>::operator=(const _Tp& __t) const + { std::__valarray_fill(_M_array, _M_sz, _M_mask, __t); } + + template + inline void + mask_array<_Tp>::operator=(const valarray<_Tp>& __v) const + { std::__valarray_copy(_Array<_Tp>(__v), __v.size(), _M_array, _M_mask); } + + template + template + inline void + mask_array<_Tp>::operator=(const _Expr<_Ex, _Tp>& __e) const + { std::__valarray_copy(__e, __e.size(), _M_array, _M_mask); } + +#undef _DEFINE_VALARRAY_OPERATOR +#define _DEFINE_VALARRAY_OPERATOR(_Op, _Name) \ + template \ + inline void \ + mask_array<_Tp>::operator _Op##=(const valarray<_Tp>& __v) const \ + { \ + _Array_augmented_##_Name(_M_array, _M_mask, \ + _Array<_Tp>(__v), __v.size()); \ + } \ + \ + template \ + template \ + inline void \ + mask_array<_Tp>::operator _Op##=(const _Expr<_Dom, _Tp>& __e) const\ + { \ + _Array_augmented_##_Name(_M_array, _M_mask, __e, __e.size()); \ + } + +_DEFINE_VALARRAY_OPERATOR(*, __multiplies) +_DEFINE_VALARRAY_OPERATOR(/, __divides) +_DEFINE_VALARRAY_OPERATOR(%, __modulus) +_DEFINE_VALARRAY_OPERATOR(+, __plus) +_DEFINE_VALARRAY_OPERATOR(-, __minus) +_DEFINE_VALARRAY_OPERATOR(^, __bitwise_xor) +_DEFINE_VALARRAY_OPERATOR(&, __bitwise_and) +_DEFINE_VALARRAY_OPERATOR(|, __bitwise_or) +_DEFINE_VALARRAY_OPERATOR(<<, __shift_left) +_DEFINE_VALARRAY_OPERATOR(>>, __shift_right) + +#undef _DEFINE_VALARRAY_OPERATOR + + // @} group numeric_arrays + +_GLIBCXX_END_NAMESPACE + +#endif /* _MASK_ARRAY_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/move.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/move.h new file mode 100644 index 00000000..ef86c4d1 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/move.h @@ -0,0 +1,98 @@ +// Move, forward and identity for C++0x + swap -*- C++ -*- + +// Copyright (C) 2007, 2008, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file move.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _MOVE_H +#define _MOVE_H 1 + +#include +#include +#include + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // 20.2.2, forward/move + template + struct identity + { + typedef _Tp type; + }; + + template + inline _Tp&& + forward(typename std::identity<_Tp>::type&& __t) + { return __t; } + + template + inline typename std::remove_reference<_Tp>::type&& + move(_Tp&& __t) + { return __t; } + +_GLIBCXX_END_NAMESPACE + +#define _GLIBCXX_MOVE(_Tp) std::move(_Tp) +#else +#define _GLIBCXX_MOVE(_Tp) (_Tp) +#endif + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /** + * @brief Swaps two values. + * @param a A thing of arbitrary type. + * @param b Another thing of arbitrary type. + * @return Nothing. + */ + template + inline void + swap(_Tp& __a, _Tp& __b) + { + // concept requirements + __glibcxx_function_requires(_SGIAssignableConcept<_Tp>) + + _Tp __tmp = _GLIBCXX_MOVE(__a); + __a = _GLIBCXX_MOVE(__b); + __b = _GLIBCXX_MOVE(__tmp); + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 809. std::swap should be overloaded for array types. + template + inline void + swap(_Tp (&__a)[_Nm], _Tp (&__b)[_Nm]) + { + for (size_t __n = 0; __n < _Nm; ++__n) + swap(__a[__n], __b[__n]); + } + +_GLIBCXX_END_NAMESPACE + +#endif /* _MOVE_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/ostream.tcc b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/ostream.tcc new file mode 100644 index 00000000..e2cbb585 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/ostream.tcc @@ -0,0 +1,407 @@ +// ostream classes -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file ostream.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 27.6.2 Output streams +// + +#ifndef _OSTREAM_TCC +#define _OSTREAM_TCC 1 + +#pragma GCC system_header + +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + template + basic_ostream<_CharT, _Traits>::sentry:: + sentry(basic_ostream<_CharT, _Traits>& __os) + : _M_ok(false), _M_os(__os) + { + // XXX MT + if (__os.tie() && __os.good()) + __os.tie()->flush(); + + if (__os.good()) + _M_ok = true; + else + __os.setstate(ios_base::failbit); + } + + template + template + basic_ostream<_CharT, _Traits>& + basic_ostream<_CharT, _Traits>:: + _M_insert(_ValueT __v) + { + sentry __cerb(*this); + if (__cerb) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + __try + { + const __num_put_type& __np = __check_facet(this->_M_num_put); + if (__np.put(*this, *this, this->fill(), __v).failed()) + __err |= ios_base::badbit; + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + } + return *this; + } + + template + basic_ostream<_CharT, _Traits>& + basic_ostream<_CharT, _Traits>:: + operator<<(short __n) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 117. basic_ostream uses nonexistent num_put member functions. + const ios_base::fmtflags __fmt = this->flags() & ios_base::basefield; + if (__fmt == ios_base::oct || __fmt == ios_base::hex) + return _M_insert(static_cast(static_cast(__n))); + else + return _M_insert(static_cast(__n)); + } + + template + basic_ostream<_CharT, _Traits>& + basic_ostream<_CharT, _Traits>:: + operator<<(int __n) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 117. basic_ostream uses nonexistent num_put member functions. + const ios_base::fmtflags __fmt = this->flags() & ios_base::basefield; + if (__fmt == ios_base::oct || __fmt == ios_base::hex) + return _M_insert(static_cast(static_cast(__n))); + else + return _M_insert(static_cast(__n)); + } + + template + basic_ostream<_CharT, _Traits>& + basic_ostream<_CharT, _Traits>:: + operator<<(__streambuf_type* __sbin) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + sentry __cerb(*this); + if (__cerb && __sbin) + { + __try + { + if (!__copy_streambufs(__sbin, this->rdbuf())) + __err |= ios_base::failbit; + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::failbit); } + } + else if (!__sbin) + __err |= ios_base::badbit; + if (__err) + this->setstate(__err); + return *this; + } + + template + basic_ostream<_CharT, _Traits>& + basic_ostream<_CharT, _Traits>:: + put(char_type __c) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 60. What is a formatted input function? + // basic_ostream::put(char_type) is an unformatted output function. + // DR 63. Exception-handling policy for unformatted output. + // Unformatted output functions should catch exceptions thrown + // from streambuf members. + sentry __cerb(*this); + if (__cerb) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + __try + { + const int_type __put = this->rdbuf()->sputc(__c); + if (traits_type::eq_int_type(__put, traits_type::eof())) + __err |= ios_base::badbit; + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + } + return *this; + } + + template + basic_ostream<_CharT, _Traits>& + basic_ostream<_CharT, _Traits>:: + write(const _CharT* __s, streamsize __n) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 60. What is a formatted input function? + // basic_ostream::write(const char_type*, streamsize) is an + // unformatted output function. + // DR 63. Exception-handling policy for unformatted output. + // Unformatted output functions should catch exceptions thrown + // from streambuf members. + sentry __cerb(*this); + if (__cerb) + { + __try + { _M_write(__s, __n); } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::badbit); } + } + return *this; + } + + template + basic_ostream<_CharT, _Traits>& + basic_ostream<_CharT, _Traits>:: + flush() + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 60. What is a formatted input function? + // basic_ostream::flush() is *not* an unformatted output function. + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + __try + { + if (this->rdbuf() && this->rdbuf()->pubsync() == -1) + __err |= ios_base::badbit; + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + return *this; + } + + template + typename basic_ostream<_CharT, _Traits>::pos_type + basic_ostream<_CharT, _Traits>:: + tellp() + { + pos_type __ret = pos_type(-1); + __try + { + if (!this->fail()) + __ret = this->rdbuf()->pubseekoff(0, ios_base::cur, ios_base::out); + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::badbit); } + return __ret; + } + + template + basic_ostream<_CharT, _Traits>& + basic_ostream<_CharT, _Traits>:: + seekp(pos_type __pos) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + __try + { + if (!this->fail()) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 136. seekp, seekg setting wrong streams? + const pos_type __p = this->rdbuf()->pubseekpos(__pos, + ios_base::out); + + // 129. Need error indication from seekp() and seekg() + if (__p == pos_type(off_type(-1))) + __err |= ios_base::failbit; + } + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + return *this; + } + + template + basic_ostream<_CharT, _Traits>& + basic_ostream<_CharT, _Traits>:: + seekp(off_type __off, ios_base::seekdir __dir) + { + ios_base::iostate __err = ios_base::iostate(ios_base::goodbit); + __try + { + if (!this->fail()) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 136. seekp, seekg setting wrong streams? + const pos_type __p = this->rdbuf()->pubseekoff(__off, __dir, + ios_base::out); + + // 129. Need error indication from seekp() and seekg() + if (__p == pos_type(off_type(-1))) + __err |= ios_base::failbit; + } + } + __catch(__cxxabiv1::__forced_unwind&) + { + this->_M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { this->_M_setstate(ios_base::badbit); } + if (__err) + this->setstate(__err); + return *this; + } + + template + basic_ostream<_CharT, _Traits>& + operator<<(basic_ostream<_CharT, _Traits>& __out, const char* __s) + { + if (!__s) + __out.setstate(ios_base::badbit); + else + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 167. Improper use of traits_type::length() + const size_t __clen = char_traits::length(__s); + __try + { + struct __ptr_guard + { + _CharT *__p; + __ptr_guard (_CharT *__ip): __p(__ip) { } + ~__ptr_guard() { delete[] __p; } + _CharT* __get() { return __p; } + } __pg (new _CharT[__clen]); + + _CharT *__ws = __pg.__get(); + for (size_t __i = 0; __i < __clen; ++__i) + __ws[__i] = __out.widen(__s[__i]); + __ostream_insert(__out, __ws, __clen); + } + __catch(__cxxabiv1::__forced_unwind&) + { + __out._M_setstate(ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { __out._M_setstate(ios_base::badbit); } + } + return __out; + } + + // Inhibit implicit instantiations for required instantiations, + // which are defined via explicit instantiations elsewhere. + // NB: This syntax is a GNU extension. +#if _GLIBCXX_EXTERN_TEMPLATE + extern template class basic_ostream; + extern template ostream& endl(ostream&); + extern template ostream& ends(ostream&); + extern template ostream& flush(ostream&); + extern template ostream& operator<<(ostream&, char); + extern template ostream& operator<<(ostream&, unsigned char); + extern template ostream& operator<<(ostream&, signed char); + extern template ostream& operator<<(ostream&, const char*); + extern template ostream& operator<<(ostream&, const unsigned char*); + extern template ostream& operator<<(ostream&, const signed char*); + + extern template ostream& ostream::_M_insert(long); + extern template ostream& ostream::_M_insert(unsigned long); + extern template ostream& ostream::_M_insert(bool); +#ifdef _GLIBCXX_USE_LONG_LONG + extern template ostream& ostream::_M_insert(long long); + extern template ostream& ostream::_M_insert(unsigned long long); +#endif + extern template ostream& ostream::_M_insert(double); + extern template ostream& ostream::_M_insert(long double); + extern template ostream& ostream::_M_insert(const void*); + +#ifdef _GLIBCXX_USE_WCHAR_T + extern template class basic_ostream; + extern template wostream& endl(wostream&); + extern template wostream& ends(wostream&); + extern template wostream& flush(wostream&); + extern template wostream& operator<<(wostream&, wchar_t); + extern template wostream& operator<<(wostream&, char); + extern template wostream& operator<<(wostream&, const wchar_t*); + extern template wostream& operator<<(wostream&, const char*); + + extern template wostream& wostream::_M_insert(long); + extern template wostream& wostream::_M_insert(unsigned long); + extern template wostream& wostream::_M_insert(bool); +#ifdef _GLIBCXX_USE_LONG_LONG + extern template wostream& wostream::_M_insert(long long); + extern template wostream& wostream::_M_insert(unsigned long long); +#endif + extern template wostream& wostream::_M_insert(double); + extern template wostream& wostream::_M_insert(long double); + extern template wostream& wostream::_M_insert(const void*); +#endif +#endif + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/ostream_insert.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/ostream_insert.h new file mode 100644 index 00000000..e0017ee7 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/ostream_insert.h @@ -0,0 +1,127 @@ +// Helpers for ostream inserters -*- C++ -*- + +// Copyright (C) 2007, 2008, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file ostream_insert.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _OSTREAM_INSERT_H +#define _OSTREAM_INSERT_H 1 + +#pragma GCC system_header + +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + template + inline void + __ostream_write(basic_ostream<_CharT, _Traits>& __out, + const _CharT* __s, streamsize __n) + { + typedef basic_ostream<_CharT, _Traits> __ostream_type; + typedef typename __ostream_type::ios_base __ios_base; + + const streamsize __put = __out.rdbuf()->sputn(__s, __n); + if (__put != __n) + __out.setstate(__ios_base::badbit); + } + + template + inline void + __ostream_fill(basic_ostream<_CharT, _Traits>& __out, streamsize __n) + { + typedef basic_ostream<_CharT, _Traits> __ostream_type; + typedef typename __ostream_type::ios_base __ios_base; + + const _CharT __c = __out.fill(); + for (; __n > 0; --__n) + { + const typename _Traits::int_type __put = __out.rdbuf()->sputc(__c); + if (_Traits::eq_int_type(__put, _Traits::eof())) + { + __out.setstate(__ios_base::badbit); + break; + } + } + } + + template + basic_ostream<_CharT, _Traits>& + __ostream_insert(basic_ostream<_CharT, _Traits>& __out, + const _CharT* __s, streamsize __n) + { + typedef basic_ostream<_CharT, _Traits> __ostream_type; + typedef typename __ostream_type::ios_base __ios_base; + + typename __ostream_type::sentry __cerb(__out); + if (__cerb) + { + __try + { + const streamsize __w = __out.width(); + if (__w > __n) + { + const bool __left = ((__out.flags() + & __ios_base::adjustfield) + == __ios_base::left); + if (!__left) + __ostream_fill(__out, __w - __n); + if (__out.good()) + __ostream_write(__out, __s, __n); + if (__left && __out.good()) + __ostream_fill(__out, __w - __n); + } + else + __ostream_write(__out, __s, __n); + __out.width(0); + } + __catch(__cxxabiv1::__forced_unwind&) + { + __out._M_setstate(__ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { __out._M_setstate(__ios_base::badbit); } + } + return __out; + } + + // Inhibit implicit instantiations for required instantiations, + // which are defined via explicit instantiations elsewhere. + // NB: This syntax is a GNU extension. +#if _GLIBCXX_EXTERN_TEMPLATE + extern template ostream& __ostream_insert(ostream&, const char*, streamsize); + +#ifdef _GLIBCXX_USE_WCHAR_T + extern template wostream& __ostream_insert(wostream&, const wchar_t*, + streamsize); +#endif +#endif + +_GLIBCXX_END_NAMESPACE + +#endif /* _OSTREAM_INSERT_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/postypes.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/postypes.h new file mode 100644 index 00000000..8066d9b0 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/postypes.h @@ -0,0 +1,241 @@ +// Position types -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file postypes.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 27.4.1 - Types +// ISO C++ 14882: 27.4.3 - Template class fpos +// + +#ifndef _GLIBCXX_POSTYPES_H +#define _GLIBCXX_POSTYPES_H 1 + +#pragma GCC system_header + +#include // For mbstate_t + +// XXX If is really needed, make sure to define the macros +// before including it, in order not to break (and +// in C++0x). Reconsider all this as soon as possible... +#if (defined(_GLIBCXX_HAVE_INT64_T) && !defined(_GLIBCXX_HAVE_INT64_T_LONG) \ + && !defined(_GLIBCXX_HAVE_INT64_T_LONG_LONG)) + +#ifndef __STDC_LIMIT_MACROS +# define _UNDEF__STDC_LIMIT_MACROS +# define __STDC_LIMIT_MACROS +#endif +#ifndef __STDC_CONSTANT_MACROS +# define _UNDEF__STDC_CONSTANT_MACROS +# define __STDC_CONSTANT_MACROS +#endif +#include // For int64_t +#ifdef _UNDEF__STDC_LIMIT_MACROS +# undef __STDC_LIMIT_MACROS +# undef _UNDEF__STDC_LIMIT_MACROS +#endif +#ifdef _UNDEF__STDC_CONSTANT_MACROS +# undef __STDC_CONSTANT_MACROS +# undef _UNDEF__STDC_CONSTANT_MACROS +#endif + +#endif + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // The types streamoff, streampos and wstreampos and the class + // template fpos<> are described in clauses 21.1.2, 21.1.3, 27.1.2, + // 27.2, 27.4.1, 27.4.3 and D.6. Despite all this verbiage, the + // behaviour of these types is mostly implementation defined or + // unspecified. The behaviour in this implementation is as noted + // below. + + /** + * @brief Type used by fpos, char_traits, and char_traits. + * + * In clauses 21.1.3.1 and 27.4.1 streamoff is described as an + * implementation defined type. + * Note: In versions of GCC up to and including GCC 3.3, streamoff + * was typedef long. + */ +#ifdef _GLIBCXX_HAVE_INT64_T_LONG + typedef long streamoff; +#elif defined(_GLIBCXX_HAVE_INT64_T_LONG_LONG) + typedef long long streamoff; +#elif defined(_GLIBCXX_HAVE_INT64_T) + typedef int64_t streamoff; +#else + typedef long long streamoff; +#endif + + /// Integral type for I/O operation counts and buffer sizes. + typedef ptrdiff_t streamsize; // Signed integral type + + /** + * @brief Class representing stream positions. + * + * The standard places no requirements upon the template parameter StateT. + * In this implementation StateT must be DefaultConstructible, + * CopyConstructible and Assignable. The standard only requires that fpos + * should contain a member of type StateT. In this implementation it also + * contains an offset stored as a signed integer. + * + * @param StateT Type passed to and returned from state(). + */ + template + class fpos + { + private: + streamoff _M_off; + _StateT _M_state; + + public: + // The standard doesn't require that fpos objects can be default + // constructed. This implementation provides a default + // constructor that initializes the offset to 0 and default + // constructs the state. + fpos() + : _M_off(0), _M_state() { } + + // The standard requires that fpos objects can be constructed + // from streamoff objects using the constructor syntax, and + // fails to give any meaningful semantics. In this + // implementation implicit conversion is also allowed, and this + // constructor stores the streamoff as the offset and default + // constructs the state. + /// Construct position from offset. + fpos(streamoff __off) + : _M_off(__off), _M_state() { } + + /// Convert to streamoff. + operator streamoff() const { return _M_off; } + + /// Remember the value of @a st. + void + state(_StateT __st) + { _M_state = __st; } + + /// Return the last set value of @a st. + _StateT + state() const + { return _M_state; } + + // The standard requires that this operator must be defined, but + // gives no semantics. In this implementation it just adds its + // argument to the stored offset and returns *this. + /// Add offset to this position. + fpos& + operator+=(streamoff __off) + { + _M_off += __off; + return *this; + } + + // The standard requires that this operator must be defined, but + // gives no semantics. In this implementation it just subtracts + // its argument from the stored offset and returns *this. + /// Subtract offset from this position. + fpos& + operator-=(streamoff __off) + { + _M_off -= __off; + return *this; + } + + // The standard requires that this operator must be defined, but + // defines its semantics only in terms of operator-. In this + // implementation it constructs a copy of *this, adds the + // argument to that copy using operator+= and then returns the + // copy. + /// Add position and offset. + fpos + operator+(streamoff __off) const + { + fpos __pos(*this); + __pos += __off; + return __pos; + } + + // The standard requires that this operator must be defined, but + // defines its semantics only in terms of operator+. In this + // implementation it constructs a copy of *this, subtracts the + // argument from that copy using operator-= and then returns the + // copy. + /// Subtract offset from position. + fpos + operator-(streamoff __off) const + { + fpos __pos(*this); + __pos -= __off; + return __pos; + } + + // The standard requires that this operator must be defined, but + // defines its semantics only in terms of operator+. In this + // implementation it returns the difference between the offset + // stored in *this and in the argument. + /// Subtract position to return offset. + streamoff + operator-(const fpos& __other) const + { return _M_off - __other._M_off; } + }; + + // The standard only requires that operator== must be an + // equivalence relation. In this implementation two fpos + // objects belong to the same equivalence class if the contained + // offsets compare equal. + /// Test if equivalent to another position. + template + inline bool + operator==(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs) + { return streamoff(__lhs) == streamoff(__rhs); } + + template + inline bool + operator!=(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs) + { return streamoff(__lhs) != streamoff(__rhs); } + + // Clauses 21.1.3.1 and 21.1.3.2 describe streampos and wstreampos + // as implementation defined types, but clause 27.2 requires that + // they must both be typedefs for fpos + /// File position for char streams. + typedef fpos streampos; + /// File position for wchar_t streams. + typedef fpos wstreampos; + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /// File position for char16_t streams. + typedef fpos u16streampos; + /// File position for char32_t streams. + typedef fpos u32streampos; +#endif + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/shared_ptr.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/shared_ptr.h new file mode 100644 index 00000000..a378ae01 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/shared_ptr.h @@ -0,0 +1,1591 @@ +// shared_ptr and weak_ptr implementation -*- C++ -*- + +// Copyright (C) 2007, 2008, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +// shared_count.hpp +// Copyright (c) 2001, 2002, 2003 Peter Dimov and Multi Media Ltd. + +// shared_ptr.hpp +// Copyright (C) 1998, 1999 Greg Colvin and Beman Dawes. +// Copyright (C) 2001, 2002, 2003 Peter Dimov + +// weak_ptr.hpp +// Copyright (C) 2001, 2002, 2003 Peter Dimov + +// enable_shared_from_this.hpp +// Copyright (C) 2002 Peter Dimov + +// Distributed under the Boost Software License, Version 1.0. (See +// accompanying file LICENSE_1_0.txt or copy at +// http://www.boost.org/LICENSE_1_0.txt) + +// GCC Note: based on version 1.32.0 of the Boost library. + +/** @file bits/shared_ptr.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _SHARED_PTR_H +#define _SHARED_PTR_H 1 + +#ifndef __GXX_EXPERIMENTAL_CXX0X__ +# include +#endif + +#if defined(_GLIBCXX_INCLUDE_AS_TR1) +# error C++0x header cannot be included from TR1 header +#endif + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /** + * @addtogroup pointer_abstractions + * @{ + */ + + // counted ptr with no deleter or allocator support + template + class _Sp_counted_ptr + : public _Sp_counted_base<_Lp> + { + public: + _Sp_counted_ptr(_Ptr __p) + : _M_ptr(__p) { } + + virtual void + _M_dispose() // nothrow + { delete _M_ptr; } + + virtual void + _M_destroy() // nothrow + { delete this; } + + virtual void* + _M_get_deleter(const std::type_info& __ti) + { return 0; } + + _Sp_counted_ptr(const _Sp_counted_ptr&) = delete; + _Sp_counted_ptr& operator=(const _Sp_counted_ptr&) = delete; + + protected: + _Ptr _M_ptr; // copy constructor must not throw + }; + + // support for custom deleter and/or allocator + template + class _Sp_counted_deleter + : public _Sp_counted_ptr<_Ptr, _Lp> + { + typedef typename _Alloc::template + rebind<_Sp_counted_deleter>::other _My_alloc_type; + + // Helper class that stores the Deleter and also acts as an allocator. + // Used to dispose of the owned pointer and the internal refcount + // Requires that copies of _Alloc can free each other's memory. + struct _My_Deleter + : public _My_alloc_type // copy constructor must not throw + { + _Deleter _M_del; // copy constructor must not throw + _My_Deleter(_Deleter __d, const _Alloc& __a) + : _My_alloc_type(__a), _M_del(__d) { } + }; + + protected: + typedef _Sp_counted_ptr<_Ptr, _Lp> _Base_type; + + public: + /** + * @brief + * @pre __d(__p) must not throw. + */ + _Sp_counted_deleter(_Ptr __p, _Deleter __d) + : _Base_type(__p), _M_del(__d, _Alloc()) { } + + /** + * @brief + * @pre __d(__p) must not throw. + */ + _Sp_counted_deleter(_Ptr __p, _Deleter __d, const _Alloc& __a) + : _Base_type(__p), _M_del(__d, __a) { } + + virtual void + _M_dispose() // nothrow + { _M_del._M_del(_Base_type::_M_ptr); } + + virtual void + _M_destroy() // nothrow + { + _My_alloc_type __a(_M_del); + this->~_Sp_counted_deleter(); + __a.deallocate(this, 1); + } + + virtual void* + _M_get_deleter(const std::type_info& __ti) + { return __ti == typeid(_Deleter) ? &_M_del._M_del : 0; } + + protected: + _My_Deleter _M_del; // copy constructor must not throw + }; + + // helpers for make_shared / allocate_shared + + template + struct _Sp_destroy_inplace + { + void operator()(_Tp* __p) const { if (__p) __p->~_Tp(); } + }; + + struct _Sp_make_shared_tag { }; + + template + class _Sp_counted_ptr_inplace + : public _Sp_counted_deleter<_Tp*, _Sp_destroy_inplace<_Tp>, _Alloc, _Lp> + { + typedef _Sp_counted_deleter<_Tp*, _Sp_destroy_inplace<_Tp>, _Alloc, _Lp> + _Base_type; + + public: + _Sp_counted_ptr_inplace(_Alloc __a) + : _Base_type(static_cast<_Tp*>(0), _Sp_destroy_inplace<_Tp>(), __a) + , _M_storage() + { + void* __p = &_M_storage; + ::new (__p) _Tp(); // might throw + _Base_type::_Base_type::_M_ptr = static_cast<_Tp*>(__p); + } + + template + _Sp_counted_ptr_inplace(_Alloc __a, _Args&&... __args) + : _Base_type(static_cast<_Tp*>(0), _Sp_destroy_inplace<_Tp>(), __a) + , _M_storage() + { + void* __p = &_M_storage; + ::new (__p) _Tp(std::forward<_Args>(__args)...); // might throw + _Base_type::_Base_type::_M_ptr = static_cast<_Tp*>(__p); + } + + // override because the allocator needs to know the dynamic type + virtual void + _M_destroy() // nothrow + { + typedef typename _Alloc::template + rebind<_Sp_counted_ptr_inplace>::other _My_alloc_type; + _My_alloc_type __a(_Base_type::_M_del); + this->~_Sp_counted_ptr_inplace(); + __a.deallocate(this, 1); + } + + // sneaky trick so __shared_ptr can get the managed pointer + virtual void* + _M_get_deleter(const std::type_info& __ti) + { + return __ti == typeid(_Sp_make_shared_tag) + ? static_cast(&_M_storage) + : _Base_type::_M_get_deleter(__ti); + } + + private: + typename aligned_storage::value>::type + _M_storage; + }; + + template<_Lock_policy _Lp = __default_lock_policy> + class __weak_count; + + template<_Lock_policy _Lp = __default_lock_policy> + class __shared_count + { + public: + __shared_count() + : _M_pi(0) // nothrow + { } + + template + __shared_count(_Ptr __p) : _M_pi(0) + { + __try + { + _M_pi = new _Sp_counted_ptr<_Ptr, _Lp>(__p); + } + __catch(...) + { + delete __p; + __throw_exception_again; + } + } + + template + __shared_count(_Ptr __p, _Deleter __d) : _M_pi(0) + { + // allocator's value_type doesn't matter, will rebind it anyway + typedef std::allocator _Alloc; + typedef _Sp_counted_deleter<_Ptr, _Deleter, _Alloc, _Lp> _Sp_cd_type; + typedef std::allocator<_Sp_cd_type> _Alloc2; + _Alloc2 __a2; + __try + { + _M_pi = __a2.allocate(1); + ::new(static_cast(_M_pi)) _Sp_cd_type(__p, __d); + } + __catch(...) + { + __d(__p); // Call _Deleter on __p. + if (_M_pi) + __a2.deallocate(static_cast<_Sp_cd_type*>(_M_pi), 1); + __throw_exception_again; + } + } + + template + __shared_count(_Ptr __p, _Deleter __d, _Alloc __a) : _M_pi(0) + { + typedef _Sp_counted_deleter<_Ptr, _Deleter, _Alloc, _Lp> _Sp_cd_type; + typedef typename _Alloc::template rebind<_Sp_cd_type>::other _Alloc2; + _Alloc2 __a2(__a); + __try + { + _M_pi = __a2.allocate(1); + ::new(static_cast(_M_pi)) _Sp_cd_type(__p, __d, __a); + } + __catch(...) + { + __d(__p); // Call _Deleter on __p. + if (_M_pi) + __a2.deallocate(static_cast<_Sp_cd_type*>(_M_pi), 1); + __throw_exception_again; + } + } + + template + __shared_count(_Sp_make_shared_tag, _Tp*, _Alloc __a, _Args&&... __args) + : _M_pi(0) + { + typedef _Sp_counted_ptr_inplace<_Tp, _Alloc, _Lp> _Sp_cp_type; + typedef typename _Alloc::template rebind<_Sp_cp_type>::other _Alloc2; + _Alloc2 __a2(__a); + __try + { + _M_pi = __a2.allocate(1); + ::new(static_cast(_M_pi)) _Sp_cp_type(__a, + std::forward<_Args>(__args)...); + } + __catch(...) + { + if (_M_pi) + __a2.deallocate(static_cast<_Sp_cp_type*>(_M_pi), 1); + __throw_exception_again; + } + } + +#if _GLIBCXX_DEPRECATED + // Special case for auto_ptr<_Tp> to provide the strong guarantee. + template + explicit + __shared_count(std::auto_ptr<_Tp>&& __r) + : _M_pi(new _Sp_counted_ptr<_Tp*, _Lp>(__r.get())) + { __r.release(); } +#endif + + // Special case for unique_ptr<_Tp,_Del> to provide the strong guarantee. + template + explicit + __shared_count(std::unique_ptr<_Tp, _Del>&& __r) + : _M_pi(_S_create_from_up(std::move(__r))) + { __r.release(); } + + // Throw bad_weak_ptr when __r._M_get_use_count() == 0. + explicit + __shared_count(const __weak_count<_Lp>& __r); + + ~__shared_count() // nothrow + { + if (_M_pi != 0) + _M_pi->_M_release(); + } + + __shared_count(const __shared_count& __r) + : _M_pi(__r._M_pi) // nothrow + { + if (_M_pi != 0) + _M_pi->_M_add_ref_copy(); + } + + __shared_count& + operator=(const __shared_count& __r) // nothrow + { + _Sp_counted_base<_Lp>* __tmp = __r._M_pi; + if (__tmp != _M_pi) + { + if (__tmp != 0) + __tmp->_M_add_ref_copy(); + if (_M_pi != 0) + _M_pi->_M_release(); + _M_pi = __tmp; + } + return *this; + } + + void + _M_swap(__shared_count& __r) // nothrow + { + _Sp_counted_base<_Lp>* __tmp = __r._M_pi; + __r._M_pi = _M_pi; + _M_pi = __tmp; + } + + long + _M_get_use_count() const // nothrow + { return _M_pi != 0 ? _M_pi->_M_get_use_count() : 0; } + + bool + _M_unique() const // nothrow + { return this->_M_get_use_count() == 1; } + + void* + _M_get_deleter(const std::type_info& __ti) const + { return _M_pi ? _M_pi->_M_get_deleter(__ti) : 0; } + + bool + _M_less(const __shared_count& __rhs) const + { return std::less<_Sp_counted_base<_Lp>*>()(this->_M_pi, __rhs._M_pi); } + + bool + _M_less(const __weak_count<_Lp>& __rhs) const + { return std::less<_Sp_counted_base<_Lp>*>()(this->_M_pi, __rhs._M_pi); } + + // friend function injected into enclosing namespace and found by ADL + friend inline bool + operator==(const __shared_count& __a, const __shared_count& __b) + { return __a._M_pi == __b._M_pi; } + + private: + friend class __weak_count<_Lp>; + + template + static _Sp_counted_base<_Lp>* + _S_create_from_up(std::unique_ptr<_Tp, _Del>&& __r, + typename std::enable_if::value>::type* = 0) + { + return new _Sp_counted_deleter<_Tp*, _Del, std::allocator<_Tp>, + _Lp>(__r.get(), __r.get_deleter()); + } + + template + static _Sp_counted_base<_Lp>* + _S_create_from_up(std::unique_ptr<_Tp, _Del>&& __r, + typename std::enable_if::value>::type* = 0) + { + typedef typename std::remove_reference<_Del>::type _Del1; + typedef std::reference_wrapper<_Del1> _Del2; + return new _Sp_counted_deleter<_Tp*, _Del2, std::allocator<_Tp>, + _Lp>(__r.get(), std::ref(__r.get_deleter())); + } + + _Sp_counted_base<_Lp>* _M_pi; + }; + + + template<_Lock_policy _Lp> + class __weak_count + { + public: + __weak_count() + : _M_pi(0) // nothrow + { } + + __weak_count(const __shared_count<_Lp>& __r) + : _M_pi(__r._M_pi) // nothrow + { + if (_M_pi != 0) + _M_pi->_M_weak_add_ref(); + } + + __weak_count(const __weak_count<_Lp>& __r) + : _M_pi(__r._M_pi) // nothrow + { + if (_M_pi != 0) + _M_pi->_M_weak_add_ref(); + } + + ~__weak_count() // nothrow + { + if (_M_pi != 0) + _M_pi->_M_weak_release(); + } + + __weak_count<_Lp>& + operator=(const __shared_count<_Lp>& __r) // nothrow + { + _Sp_counted_base<_Lp>* __tmp = __r._M_pi; + if (__tmp != 0) + __tmp->_M_weak_add_ref(); + if (_M_pi != 0) + _M_pi->_M_weak_release(); + _M_pi = __tmp; + return *this; + } + + __weak_count<_Lp>& + operator=(const __weak_count<_Lp>& __r) // nothrow + { + _Sp_counted_base<_Lp>* __tmp = __r._M_pi; + if (__tmp != 0) + __tmp->_M_weak_add_ref(); + if (_M_pi != 0) + _M_pi->_M_weak_release(); + _M_pi = __tmp; + return *this; + } + + void + _M_swap(__weak_count<_Lp>& __r) // nothrow + { + _Sp_counted_base<_Lp>* __tmp = __r._M_pi; + __r._M_pi = _M_pi; + _M_pi = __tmp; + } + + long + _M_get_use_count() const // nothrow + { return _M_pi != 0 ? _M_pi->_M_get_use_count() : 0; } + + bool + _M_less(const __weak_count& __rhs) const + { return std::less<_Sp_counted_base<_Lp>*>()(this->_M_pi, __rhs._M_pi); } + + bool + _M_less(const __shared_count<_Lp>& __rhs) const + { return std::less<_Sp_counted_base<_Lp>*>()(this->_M_pi, __rhs._M_pi); } + + // friend function injected into enclosing namespace and found by ADL + friend inline bool + operator==(const __weak_count& __a, const __weak_count& __b) + { return __a._M_pi == __b._M_pi; } + + private: + friend class __shared_count<_Lp>; + + _Sp_counted_base<_Lp>* _M_pi; + }; + + // now that __weak_count is defined we can define this constructor: + template<_Lock_policy _Lp> + inline + __shared_count<_Lp>:: + __shared_count(const __weak_count<_Lp>& __r) + : _M_pi(__r._M_pi) + { + if (_M_pi != 0) + _M_pi->_M_add_ref_lock(); + else + __throw_bad_weak_ptr(); + } + + // Forward declarations. + template + class __shared_ptr; + + template + class __weak_ptr; + + template + class __enable_shared_from_this; + + template + class shared_ptr; + + template + class weak_ptr; + + template + class enable_shared_from_this; + + // Support for enable_shared_from_this. + + // Friend of __enable_shared_from_this. + template<_Lock_policy _Lp, typename _Tp1, typename _Tp2> + void + __enable_shared_from_this_helper(const __shared_count<_Lp>&, + const __enable_shared_from_this<_Tp1, + _Lp>*, const _Tp2*); + + // Friend of enable_shared_from_this. + template + void + __enable_shared_from_this_helper(const __shared_count<>&, + const enable_shared_from_this<_Tp1>*, + const _Tp2*); + + template<_Lock_policy _Lp> + inline void + __enable_shared_from_this_helper(const __shared_count<_Lp>&, ...) + { } + + + template + class __shared_ptr + { + public: + typedef _Tp element_type; + + /** @brief Construct an empty %__shared_ptr. + * @post use_count()==0 && get()==0 + */ + __shared_ptr() + : _M_ptr(0), _M_refcount() // never throws + { } + + /** @brief Construct a %__shared_ptr that owns the pointer @a __p. + * @param __p A pointer that is convertible to element_type*. + * @post use_count() == 1 && get() == __p + * @throw std::bad_alloc, in which case @c delete @a __p is called. + */ + template + explicit + __shared_ptr(_Tp1* __p) + : _M_ptr(__p), _M_refcount(__p) + { + __glibcxx_function_requires(_ConvertibleConcept<_Tp1*, _Tp*>) + // __glibcxx_function_requires(_CompleteConcept<_Tp1*>) + __enable_shared_from_this_helper(_M_refcount, __p, __p); + } + + // + // Requirements: _Deleter's copy constructor and destructor must + // not throw + // + // __shared_ptr will release __p by calling __d(__p) + // + /** @brief Construct a %__shared_ptr that owns the pointer @a __p + * and the deleter @a __d. + * @param __p A pointer. + * @param __d A deleter. + * @post use_count() == 1 && get() == __p + * @throw std::bad_alloc, in which case @a __d(__p) is called. + */ + template + __shared_ptr(_Tp1* __p, _Deleter __d) + : _M_ptr(__p), _M_refcount(__p, __d) + { + __glibcxx_function_requires(_ConvertibleConcept<_Tp1*, _Tp*>) + // TODO requires _Deleter CopyConstructible and __d(__p) well-formed + __enable_shared_from_this_helper(_M_refcount, __p, __p); + } + + // + // Requirements: _Deleter's copy constructor and destructor must + // not throw _Alloc's copy constructor and destructor must not + // throw. + // + // __shared_ptr will release __p by calling __d(__p) + // + /** @brief Construct a %__shared_ptr that owns the pointer @a __p + * and the deleter @a __d. + * @param __p A pointer. + * @param __d A deleter. + * @param __a An allocator. + * @post use_count() == 1 && get() == __p + * @throw std::bad_alloc, in which case @a __d(__p) is called. + */ + template + __shared_ptr(_Tp1* __p, _Deleter __d, const _Alloc& __a) + : _M_ptr(__p), _M_refcount(__p, __d, __a) + { + __glibcxx_function_requires(_ConvertibleConcept<_Tp1*, _Tp*>) + // TODO requires _Deleter CopyConstructible and __d(__p) well-formed + __enable_shared_from_this_helper(_M_refcount, __p, __p); + } + + /** @brief Constructs a %__shared_ptr instance that stores @a __p + * and shares ownership with @a __r. + * @param __r A %__shared_ptr. + * @param __p A pointer that will remain valid while @a *__r is valid. + * @post get() == __p && use_count() == __r.use_count() + * + * This can be used to construct a @c shared_ptr to a sub-object + * of an object managed by an existing @c shared_ptr. + * + * @code + * shared_ptr< pair > pii(new pair()); + * shared_ptr pi(pii, &pii->first); + * assert(pii.use_count() == 2); + * @endcode + */ + template + __shared_ptr(const __shared_ptr<_Tp1, _Lp>& __r, _Tp* __p) + : _M_ptr(__p), _M_refcount(__r._M_refcount) // never throws + { } + + // generated copy constructor, assignment, destructor are fine. + + /** @brief If @a __r is empty, constructs an empty %__shared_ptr; + * otherwise construct a %__shared_ptr that shares ownership + * with @a __r. + * @param __r A %__shared_ptr. + * @post get() == __r.get() && use_count() == __r.use_count() + */ + template + __shared_ptr(const __shared_ptr<_Tp1, _Lp>& __r) + : _M_ptr(__r._M_ptr), _M_refcount(__r._M_refcount) // never throws + { __glibcxx_function_requires(_ConvertibleConcept<_Tp1*, _Tp*>) } + + /** @brief Move-constructs a %__shared_ptr instance from @a __r. + * @param __r A %__shared_ptr rvalue. + * @post *this contains the old value of @a __r, @a __r is empty. + */ + __shared_ptr(__shared_ptr&& __r) + : _M_ptr(__r._M_ptr), _M_refcount() // never throws + { + _M_refcount._M_swap(__r._M_refcount); + __r._M_ptr = 0; + } + + /** @brief Move-constructs a %__shared_ptr instance from @a __r. + * @param __r A %__shared_ptr rvalue. + * @post *this contains the old value of @a __r, @a __r is empty. + */ + template + __shared_ptr(__shared_ptr<_Tp1, _Lp>&& __r) + : _M_ptr(__r._M_ptr), _M_refcount() // never throws + { + __glibcxx_function_requires(_ConvertibleConcept<_Tp1*, _Tp*>) + _M_refcount._M_swap(__r._M_refcount); + __r._M_ptr = 0; + } + + /** @brief Constructs a %__shared_ptr that shares ownership with @a __r + * and stores a copy of the pointer stored in @a __r. + * @param __r A weak_ptr. + * @post use_count() == __r.use_count() + * @throw bad_weak_ptr when __r.expired(), + * in which case the constructor has no effect. + */ + template + explicit + __shared_ptr(const __weak_ptr<_Tp1, _Lp>& __r) + : _M_refcount(__r._M_refcount) // may throw + { + __glibcxx_function_requires(_ConvertibleConcept<_Tp1*, _Tp*>) + // It is now safe to copy __r._M_ptr, as _M_refcount(__r._M_refcount) + // did not throw. + _M_ptr = __r._M_ptr; + } + + template + explicit + __shared_ptr(const std::unique_ptr<_Tp1, _Del>&) = delete; + + /** + * If an exception is thrown this constructor has no effect. + */ + template + explicit + __shared_ptr(std::unique_ptr<_Tp1, _Del>&& __r) + : _M_ptr(__r.get()), _M_refcount() + { + __glibcxx_function_requires(_ConvertibleConcept<_Tp1*, _Tp*>) + _Tp1* __tmp = __r.get(); + _M_refcount = __shared_count<_Lp>(std::move(__r)); + __enable_shared_from_this_helper(_M_refcount, __tmp, __tmp); + } + +#if _GLIBCXX_DEPRECATED + /** + * @post use_count() == 1 and __r.get() == 0 + */ + template + explicit + __shared_ptr(std::auto_ptr<_Tp1>&& __r) + : _M_ptr(__r.get()), _M_refcount() + { + __glibcxx_function_requires(_ConvertibleConcept<_Tp1*, _Tp*>) + // TODO requires _Tp1 is complete, delete __r.release() well-formed + _Tp1* __tmp = __r.get(); + _M_refcount = __shared_count<_Lp>(std::move(__r)); + __enable_shared_from_this_helper(_M_refcount, __tmp, __tmp); + } +#endif + + template + __shared_ptr& + operator=(const __shared_ptr<_Tp1, _Lp>& __r) // never throws + { + _M_ptr = __r._M_ptr; + _M_refcount = __r._M_refcount; // __shared_count::op= doesn't throw + return *this; + } + +#if _GLIBCXX_DEPRECATED + template + __shared_ptr& + operator=(std::auto_ptr<_Tp1>&& __r) + { + __shared_ptr(std::move(__r)).swap(*this); + return *this; + } +#endif + + __shared_ptr& + operator=(__shared_ptr&& __r) + { + __shared_ptr(std::move(__r)).swap(*this); + return *this; + } + + template + __shared_ptr& + operator=(__shared_ptr<_Tp1, _Lp>&& __r) + { + __shared_ptr(std::move(__r)).swap(*this); + return *this; + } + + template + __shared_ptr& + operator=(const std::unique_ptr<_Tp1, _Del>& __r) = delete; + + template + __shared_ptr& + operator=(std::unique_ptr<_Tp1, _Del>&& __r) + { + __shared_ptr(std::move(__r)).swap(*this); + return *this; + } + + void + reset() // never throws + { __shared_ptr().swap(*this); } + + template + void + reset(_Tp1* __p) // _Tp1 must be complete. + { + // Catch self-reset errors. + _GLIBCXX_DEBUG_ASSERT(__p == 0 || __p != _M_ptr); + __shared_ptr(__p).swap(*this); + } + + template + void + reset(_Tp1* __p, _Deleter __d) + { __shared_ptr(__p, __d).swap(*this); } + + template + void + reset(_Tp1* __p, _Deleter __d, const _Alloc& __a) + { __shared_ptr(__p, __d, __a).swap(*this); } + + // Allow class instantiation when _Tp is [cv-qual] void. + typename std::add_lvalue_reference<_Tp>::type + operator*() const // never throws + { + _GLIBCXX_DEBUG_ASSERT(_M_ptr != 0); + return *_M_ptr; + } + + _Tp* + operator->() const // never throws + { + _GLIBCXX_DEBUG_ASSERT(_M_ptr != 0); + return _M_ptr; + } + + _Tp* + get() const // never throws + { return _M_ptr; } + + // Implicit conversion to "bool" + private: + typedef _Tp* __shared_ptr::*__unspecified_bool_type; + + public: + operator __unspecified_bool_type() const // never throws + { return _M_ptr == 0 ? 0 : &__shared_ptr::_M_ptr; } + + bool + unique() const // never throws + { return _M_refcount._M_unique(); } + + long + use_count() const // never throws + { return _M_refcount._M_get_use_count(); } + + void + swap(__shared_ptr<_Tp, _Lp>&& __other) // never throws + { + std::swap(_M_ptr, __other._M_ptr); + _M_refcount._M_swap(__other._M_refcount); + } + + template + bool + owner_before(__shared_ptr<_Tp1, _Lp> const& __rhs) const + { return _M_refcount._M_less(__rhs._M_refcount); } + + template + bool + owner_before(__weak_ptr<_Tp1, _Lp> const& __rhs) const + { return _M_refcount._M_less(__rhs._M_refcount); } + + protected: + // This constructor is non-standard, it is used by allocate_shared. + template + __shared_ptr(_Sp_make_shared_tag __tag, _Alloc __a, _Args&&... __args) + : _M_ptr(), _M_refcount(__tag, (_Tp*)0, __a, + std::forward<_Args>(__args)...) + { + // _M_ptr needs to point to the newly constructed object. + // This relies on _Sp_counted_ptr_inplace::_M_get_deleter. + void* __p = _M_refcount._M_get_deleter(typeid(__tag)); + _M_ptr = static_cast<_Tp*>(__p); + __enable_shared_from_this_helper(_M_refcount, _M_ptr, _M_ptr); + } + + template + friend __shared_ptr<_Tp1, _Lp1> + __allocate_shared(_Alloc __a, _Args&&... __args); + + private: + void* + _M_get_deleter(const std::type_info& __ti) const + { return _M_refcount._M_get_deleter(__ti); } + + template friend class __shared_ptr; + template friend class __weak_ptr; + + template + friend _Del* get_deleter(const __shared_ptr<_Tp1, _Lp1>&); + + _Tp* _M_ptr; // Contained pointer. + __shared_count<_Lp> _M_refcount; // Reference counter. + }; + + // 20.8.13.2.7 shared_ptr comparisons + template + inline bool + operator==(const __shared_ptr<_Tp1, _Lp>& __a, + const __shared_ptr<_Tp2, _Lp>& __b) + { return __a.get() == __b.get(); } + + template + inline bool + operator!=(const __shared_ptr<_Tp1, _Lp>& __a, + const __shared_ptr<_Tp2, _Lp>& __b) + { return __a.get() != __b.get(); } + + template + inline bool + operator<(const __shared_ptr<_Tp1, _Lp>& __a, + const __shared_ptr<_Tp2, _Lp>& __b) + { return __a.get() < __b.get(); } + + template + struct _Sp_less : public binary_function<_Sp, _Sp, bool> + { + bool + operator()(const _Sp& __lhs, const _Sp& __rhs) const + { + return std::less()(__lhs.get(), + __rhs.get()); + } + }; + + template + struct less<__shared_ptr<_Tp, _Lp>> + : public _Sp_less<__shared_ptr<_Tp, _Lp>> + { }; + + // XXX LessThanComparable<_Tp> concept should provide >, >= and <= + template + inline bool + operator>(const __shared_ptr<_Tp, _Lp>& __a, + const __shared_ptr<_Tp, _Lp>& __b) + { return __a.get() > __b.get(); } + + template + inline bool + operator>=(const __shared_ptr<_Tp, _Lp>& __a, + const __shared_ptr<_Tp, _Lp>& __b) + { return __a.get() >= __b.get(); } + + template + inline bool + operator<=(const __shared_ptr<_Tp, _Lp>& __a, + const __shared_ptr<_Tp, _Lp>& __b) + { return __a.get() <= __b.get(); } + + // 2.2.3.8 shared_ptr specialized algorithms. + template + inline void + swap(__shared_ptr<_Tp, _Lp>& __a, __shared_ptr<_Tp, _Lp>& __b) + { __a.swap(__b); } + + template + inline void + swap(__shared_ptr<_Tp, _Lp>&& __a, __shared_ptr<_Tp, _Lp>& __b) + { __a.swap(__b); } + + template + inline void + swap(__shared_ptr<_Tp, _Lp>& __a, __shared_ptr<_Tp, _Lp>&& __b) + { __a.swap(__b); } + + // 2.2.3.9 shared_ptr casts + /** @warning The seemingly equivalent + * shared_ptr<_Tp, _Lp>(static_cast<_Tp*>(__r.get())) + * will eventually result in undefined behaviour, + * attempting to delete the same object twice. + */ + template + inline __shared_ptr<_Tp, _Lp> + static_pointer_cast(const __shared_ptr<_Tp1, _Lp>& __r) + { return __shared_ptr<_Tp, _Lp>(__r, static_cast<_Tp*>(__r.get())); } + + /** @warning The seemingly equivalent + * shared_ptr<_Tp, _Lp>(const_cast<_Tp*>(__r.get())) + * will eventually result in undefined behaviour, + * attempting to delete the same object twice. + */ + template + inline __shared_ptr<_Tp, _Lp> + const_pointer_cast(const __shared_ptr<_Tp1, _Lp>& __r) + { return __shared_ptr<_Tp, _Lp>(__r, const_cast<_Tp*>(__r.get())); } + + /** @warning The seemingly equivalent + * shared_ptr<_Tp, _Lp>(dynamic_cast<_Tp*>(__r.get())) + * will eventually result in undefined behaviour, + * attempting to delete the same object twice. + */ + template + inline __shared_ptr<_Tp, _Lp> + dynamic_pointer_cast(const __shared_ptr<_Tp1, _Lp>& __r) + { + if (_Tp* __p = dynamic_cast<_Tp*>(__r.get())) + return __shared_ptr<_Tp, _Lp>(__r, __p); + return __shared_ptr<_Tp, _Lp>(); + } + + // 2.2.3.7 shared_ptr I/O + template + std::basic_ostream<_Ch, _Tr>& + operator<<(std::basic_ostream<_Ch, _Tr>& __os, + const __shared_ptr<_Tp, _Lp>& __p) + { + __os << __p.get(); + return __os; + } + + // 2.2.3.10 shared_ptr get_deleter (experimental) + template + inline _Del* + get_deleter(const __shared_ptr<_Tp, _Lp>& __p) + { return static_cast<_Del*>(__p._M_get_deleter(typeid(_Del))); } + + + template + class __weak_ptr + { + public: + typedef _Tp element_type; + + __weak_ptr() + : _M_ptr(0), _M_refcount() // never throws + { } + + // Generated copy constructor, assignment, destructor are fine. + + // The "obvious" converting constructor implementation: + // + // template + // __weak_ptr(const __weak_ptr<_Tp1, _Lp>& __r) + // : _M_ptr(__r._M_ptr), _M_refcount(__r._M_refcount) // never throws + // { } + // + // has a serious problem. + // + // __r._M_ptr may already have been invalidated. The _M_ptr(__r._M_ptr) + // conversion may require access to *__r._M_ptr (virtual inheritance). + // + // It is not possible to avoid spurious access violations since + // in multithreaded programs __r._M_ptr may be invalidated at any point. + template + __weak_ptr(const __weak_ptr<_Tp1, _Lp>& __r) + : _M_refcount(__r._M_refcount) // never throws + { + __glibcxx_function_requires(_ConvertibleConcept<_Tp1*, _Tp*>) + _M_ptr = __r.lock().get(); + } + + template + __weak_ptr(const __shared_ptr<_Tp1, _Lp>& __r) + : _M_ptr(__r._M_ptr), _M_refcount(__r._M_refcount) // never throws + { __glibcxx_function_requires(_ConvertibleConcept<_Tp1*, _Tp*>) } + + template + __weak_ptr& + operator=(const __weak_ptr<_Tp1, _Lp>& __r) // never throws + { + _M_ptr = __r.lock().get(); + _M_refcount = __r._M_refcount; + return *this; + } + + template + __weak_ptr& + operator=(const __shared_ptr<_Tp1, _Lp>& __r) // never throws + { + _M_ptr = __r._M_ptr; + _M_refcount = __r._M_refcount; + return *this; + } + + __shared_ptr<_Tp, _Lp> + lock() const // never throws + { +#ifdef __GTHREADS + // Optimization: avoid throw overhead. + if (expired()) + return __shared_ptr(); + + __try + { + return __shared_ptr(*this); + } + __catch(const bad_weak_ptr&) + { + // Q: How can we get here? + // A: Another thread may have invalidated r after the + // use_count test above. + return __shared_ptr(); + } + +#else + // Optimization: avoid try/catch overhead when single threaded. + return expired() ? __shared_ptr() + : __shared_ptr(*this); + +#endif + } // XXX MT + + long + use_count() const // never throws + { return _M_refcount._M_get_use_count(); } + + bool + expired() const // never throws + { return _M_refcount._M_get_use_count() == 0; } + + template + bool + owner_before(const __shared_ptr<_Tp1, _Lp>& __rhs) const + { return _M_refcount._M_less(__rhs._M_refcount); } + + template + bool + owner_before(const __weak_ptr<_Tp1, _Lp>& __rhs) const + { return _M_refcount._M_less(__rhs._M_refcount); } + + void + reset() // never throws + { __weak_ptr().swap(*this); } + + void + swap(__weak_ptr& __s) // never throws + { + std::swap(_M_ptr, __s._M_ptr); + _M_refcount._M_swap(__s._M_refcount); + } + + // comparisons + template + bool operator<(const __weak_ptr<_Tp1, _Lp>&) const = delete; + template + bool operator<=(const __weak_ptr<_Tp1, _Lp>&) const = delete; + template + bool operator>(const __weak_ptr<_Tp1, _Lp>&) const = delete; + template + bool operator>=(const __weak_ptr<_Tp1, _Lp>&) const = delete; + + private: + // Used by __enable_shared_from_this. + void + _M_assign(_Tp* __ptr, const __shared_count<_Lp>& __refcount) + { + _M_ptr = __ptr; + _M_refcount = __refcount; + } + + template friend class __shared_ptr; + template friend class __weak_ptr; + friend class __enable_shared_from_this<_Tp, _Lp>; + friend class enable_shared_from_this<_Tp>; + + _Tp* _M_ptr; // Contained pointer. + __weak_count<_Lp> _M_refcount; // Reference counter. + }; + + // 20.8.13.3.7 weak_ptr specialized algorithms. + template + inline void + swap(__weak_ptr<_Tp, _Lp>& __a, __weak_ptr<_Tp, _Lp>& __b) + { __a.swap(__b); } + + /// owner_less + template struct owner_less; + + template + struct _Sp_owner_less : public binary_function<_Tp, _Tp, bool> + { + bool + operator()(const _Tp& __lhs, const _Tp& __rhs) const + { return __lhs.owner_before(__rhs); } + bool + operator()(const _Tp& __lhs, const _Tp1& __rhs) const + { return __lhs.owner_before(__rhs); } + bool + operator()(const _Tp1& __lhs, const _Tp& __rhs) const + { return __lhs.owner_before(__rhs); } + }; + + template + struct owner_less<__shared_ptr<_Tp, _Lp>> + : public _Sp_owner_less<__shared_ptr<_Tp, _Lp>, __weak_ptr<_Tp, _Lp>> + { }; + + template + struct owner_less<__weak_ptr<_Tp, _Lp>> + : public _Sp_owner_less<__weak_ptr<_Tp, _Lp>, __shared_ptr<_Tp, _Lp>> + { + }; + + + template + class __enable_shared_from_this + { + protected: + __enable_shared_from_this() { } + + __enable_shared_from_this(const __enable_shared_from_this&) { } + + __enable_shared_from_this& + operator=(const __enable_shared_from_this&) + { return *this; } + + ~__enable_shared_from_this() { } + + public: + __shared_ptr<_Tp, _Lp> + shared_from_this() + { return __shared_ptr<_Tp, _Lp>(this->_M_weak_this); } + + __shared_ptr + shared_from_this() const + { return __shared_ptr(this->_M_weak_this); } + + private: + template + void + _M_weak_assign(_Tp1* __p, const __shared_count<_Lp>& __n) const + { _M_weak_this._M_assign(__p, __n); } + + template + friend void + __enable_shared_from_this_helper(const __shared_count<_Lp>& __pn, + const __enable_shared_from_this* __pe, + const _Tp1* __px) + { + if (__pe != 0) + __pe->_M_weak_assign(const_cast<_Tp1*>(__px), __pn); + } + + mutable __weak_ptr<_Tp, _Lp> _M_weak_this; + }; + + /** + * @brief A smart pointer with reference-counted copy semantics. + * + * The object pointed to is deleted when the last shared_ptr pointing to + * it is destroyed or reset. + */ + template + class shared_ptr + : public __shared_ptr<_Tp> + { + public: + shared_ptr() + : __shared_ptr<_Tp>() { } + + template + explicit + shared_ptr(_Tp1* __p) + : __shared_ptr<_Tp>(__p) { } + + template + shared_ptr(_Tp1* __p, _Deleter __d) + : __shared_ptr<_Tp>(__p, __d) { } + + template + shared_ptr(_Tp1* __p, _Deleter __d, const _Alloc& __a) + : __shared_ptr<_Tp>(__p, __d, __a) { } + + // Aliasing constructor + template + shared_ptr(const shared_ptr<_Tp1>& __r, _Tp* __p) + : __shared_ptr<_Tp>(__r, __p) { } + + template + shared_ptr(const shared_ptr<_Tp1>& __r) + : __shared_ptr<_Tp>(__r) { } + + shared_ptr(shared_ptr&& __r) + : __shared_ptr<_Tp>(std::move(__r)) { } + + template + shared_ptr(shared_ptr<_Tp1>&& __r) + : __shared_ptr<_Tp>(std::move(__r)) { } + + template + explicit + shared_ptr(const weak_ptr<_Tp1>& __r) + : __shared_ptr<_Tp>(__r) { } + +#if _GLIBCXX_DEPRECATED + template + explicit + shared_ptr(std::auto_ptr<_Tp1>&& __r) + : __shared_ptr<_Tp>(std::move(__r)) { } +#endif + + template + explicit + shared_ptr(const std::unique_ptr<_Tp1, _Del>&) = delete; + + template + explicit + shared_ptr(std::unique_ptr<_Tp1, _Del>&& __r) + : __shared_ptr<_Tp>(std::move(__r)) { } + + template + shared_ptr& + operator=(const shared_ptr<_Tp1>& __r) // never throws + { + this->__shared_ptr<_Tp>::operator=(__r); + return *this; + } + +#if _GLIBCXX_DEPRECATED + template + shared_ptr& + operator=(std::auto_ptr<_Tp1>&& __r) + { + this->__shared_ptr<_Tp>::operator=(std::move(__r)); + return *this; + } +#endif + + shared_ptr& + operator=(shared_ptr&& __r) + { + this->__shared_ptr<_Tp>::operator=(std::move(__r)); + return *this; + } + + template + shared_ptr& + operator=(shared_ptr<_Tp1>&& __r) + { + this->__shared_ptr<_Tp>::operator=(std::move(__r)); + return *this; + } + + template + shared_ptr& + operator=(const std::unique_ptr<_Tp1, _Del>& __r) = delete; + + template + shared_ptr& + operator=(std::unique_ptr<_Tp1, _Del>&& __r) + { + this->__shared_ptr<_Tp>::operator=(std::move(__r)); + return *this; + } + + private: + // This constructor is non-standard, it is used by allocate_shared. + template + shared_ptr(_Sp_make_shared_tag __tag, _Alloc __a, _Args&&... __args) + : __shared_ptr<_Tp>(__tag, __a, std::forward<_Args>(__args)...) + { } + + template + friend shared_ptr<_Tp1> + allocate_shared(_Alloc __a, _Args&&... __args); + }; + + // 20.8.13.2.7 shared_ptr comparisons + template + inline bool + operator==(const shared_ptr<_Tp1>& __a, const shared_ptr<_Tp2>& __b) + { return __a.get() == __b.get(); } + + template + inline bool + operator!=(const shared_ptr<_Tp1>& __a, const shared_ptr<_Tp2>& __b) + { return __a.get() != __b.get(); } + + template + inline bool + operator<(const shared_ptr<_Tp1>& __a, const shared_ptr<_Tp2>& __b) + { return __a.get() < __b.get(); } + + template + struct less> + : public _Sp_less> + { }; + + // 20.8.13.2.9 shared_ptr specialized algorithms. + template + inline void + swap(shared_ptr<_Tp>& __a, shared_ptr<_Tp>& __b) + { __a.swap(__b); } + + template + inline void + swap(shared_ptr<_Tp>&& __a, shared_ptr<_Tp>& __b) + { __a.swap(__b); } + + template + inline void + swap(shared_ptr<_Tp>& __a, shared_ptr<_Tp>&& __b) + { __a.swap(__b); } + + // 20.8.13.2.10 shared_ptr casts. + template + inline shared_ptr<_Tp> + static_pointer_cast(const shared_ptr<_Tp1>& __r) + { return shared_ptr<_Tp>(__r, static_cast<_Tp*>(__r.get())); } + + template + inline shared_ptr<_Tp> + const_pointer_cast(const shared_ptr<_Tp1>& __r) + { return shared_ptr<_Tp>(__r, const_cast<_Tp*>(__r.get())); } + + template + inline shared_ptr<_Tp> + dynamic_pointer_cast(const shared_ptr<_Tp1>& __r) + { + if (_Tp* __p = dynamic_cast<_Tp*>(__r.get())) + return shared_ptr<_Tp>(__r, __p); + return shared_ptr<_Tp>(); + } + + + /** + * @brief A smart pointer with weak semantics. + * + * With forwarding constructors and assignment operators. + */ + template + class weak_ptr + : public __weak_ptr<_Tp> + { + public: + weak_ptr() + : __weak_ptr<_Tp>() { } + + template + weak_ptr(const weak_ptr<_Tp1>& __r) + : __weak_ptr<_Tp>(__r) { } + + template + weak_ptr(const shared_ptr<_Tp1>& __r) + : __weak_ptr<_Tp>(__r) { } + + template + weak_ptr& + operator=(const weak_ptr<_Tp1>& __r) // never throws + { + this->__weak_ptr<_Tp>::operator=(__r); + return *this; + } + + template + weak_ptr& + operator=(const shared_ptr<_Tp1>& __r) // never throws + { + this->__weak_ptr<_Tp>::operator=(__r); + return *this; + } + + shared_ptr<_Tp> + lock() const // never throws + { +#ifdef __GTHREADS + if (this->expired()) + return shared_ptr<_Tp>(); + + __try + { + return shared_ptr<_Tp>(*this); + } + __catch(const bad_weak_ptr&) + { + return shared_ptr<_Tp>(); + } +#else + return this->expired() ? shared_ptr<_Tp>() + : shared_ptr<_Tp>(*this); +#endif + } + + // comparisons + template + bool operator<(const weak_ptr<_Tp1>&) const = delete; + template + bool operator<=(const weak_ptr<_Tp1>&) const = delete; + template + bool operator>(const weak_ptr<_Tp1>&) const = delete; + template + bool operator>=(const weak_ptr<_Tp1>&) const = delete; + }; + + // 20.8.13.3.7 weak_ptr specialized algorithms. + template + inline void + swap(weak_ptr<_Tp>& __a, weak_ptr<_Tp>& __b) + { __a.swap(__b); } + + /// owner_less + template + struct owner_less> + : public _Sp_owner_less, weak_ptr<_Tp>> + { }; + + template + struct owner_less> + : public _Sp_owner_less, shared_ptr<_Tp>> + { }; + + /** + * @brief Base class allowing use of member function shared_from_this. + */ + template + class enable_shared_from_this + { + protected: + enable_shared_from_this() { } + + enable_shared_from_this(const enable_shared_from_this&) { } + + enable_shared_from_this& + operator=(const enable_shared_from_this&) + { return *this; } + + ~enable_shared_from_this() { } + + public: + shared_ptr<_Tp> + shared_from_this() + { return shared_ptr<_Tp>(this->_M_weak_this); } + + shared_ptr + shared_from_this() const + { return shared_ptr(this->_M_weak_this); } + + private: + template + void + _M_weak_assign(_Tp1* __p, const __shared_count<>& __n) const + { _M_weak_this._M_assign(__p, __n); } + + template + friend void + __enable_shared_from_this_helper(const __shared_count<>& __pn, + const enable_shared_from_this* __pe, + const _Tp1* __px) + { + if (__pe != 0) + __pe->_M_weak_assign(const_cast<_Tp1*>(__px), __pn); + } + + mutable weak_ptr<_Tp> _M_weak_this; + }; + + template + inline __shared_ptr<_Tp, _Lp> + __allocate_shared(_Alloc __a, _Args&&... __args) + { + return __shared_ptr<_Tp, _Lp>(_Sp_make_shared_tag(), + std::forward<_Alloc>(__a), std::forward<_Args>(__args)...); + } + + template + inline __shared_ptr<_Tp, _Lp> + __make_shared(_Args&&... __args) + { + typedef typename std::remove_const<_Tp>::type _Tp_nc; + return __allocate_shared<_Tp, _Lp>(std::allocator<_Tp_nc>(), + std::forward<_Args>(__args)...); + } + + /** @brief Create an object that is owned by a shared_ptr. + * @param __a An allocator. + * @param __args Arguments for the @a _Tp object's constructor. + * @return A shared_ptr that owns the newly created object. + * @throw An exception thrown from @a _Alloc::allocate or from the + * constructor of @a _Tp. + * + * A copy of @a __a will be used to allocate memory for the shared_ptr + * and the new object. + */ + template + inline shared_ptr<_Tp> + allocate_shared(_Alloc __a, _Args&&... __args) + { + return shared_ptr<_Tp>(_Sp_make_shared_tag(), std::forward<_Alloc>(__a), + std::forward<_Args>(__args)...); + } + + /** @brief Create an object that is owned by a shared_ptr. + * @param __args Arguments for the @a _Tp object's constructor. + * @return A shared_ptr that owns the newly created object. + * @throw std::bad_alloc, or an exception thrown from the + * constructor of @a _Tp. + */ + template + inline shared_ptr<_Tp> + make_shared(_Args&&... __args) + { + typedef typename std::remove_const<_Tp>::type _Tp_nc; + return allocate_shared<_Tp>(std::allocator<_Tp_nc>(), + std::forward<_Args>(__args)...); + } + + // @} group pointer_abstractions + +_GLIBCXX_END_NAMESPACE + +#endif // _SHARED_PTR_H diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/slice_array.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/slice_array.h new file mode 100644 index 00000000..566c764e --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/slice_array.h @@ -0,0 +1,272 @@ +// The template and inlines for the -*- C++ -*- slice_array class. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2004, 2005, 2006, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file slice_array.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// Written by Gabriel Dos Reis + +#ifndef _SLICE_ARRAY_H +#define _SLICE_ARRAY_H 1 + +#pragma GCC system_header + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /** + * @addtogroup numeric_arrays + * @{ + */ + + /** + * @brief Class defining one-dimensional subset of an array. + * + * The slice class represents a one-dimensional subset of an array, + * specified by three parameters: start offset, size, and stride. The + * start offset is the index of the first element of the array that is part + * of the subset. The size is the total number of elements in the subset. + * Stride is the distance between each successive array element to include + * in the subset. + * + * For example, with an array of size 10, and a slice with offset 1, size 3 + * and stride 2, the subset consists of array elements 1, 3, and 5. + */ + class slice + { + public: + /// Construct an empty slice. + slice(); + + /** + * @brief Construct a slice. + * + * @param o Offset in array of first element. + * @param d Number of elements in slice. + * @param s Stride between array elements. + */ + slice(size_t, size_t, size_t); + + /// Return array offset of first slice element. + size_t start() const; + /// Return size of slice. + size_t size() const; + /// Return array stride of slice. + size_t stride() const; + + private: + size_t _M_off; // offset + size_t _M_sz; // size + size_t _M_st; // stride unit + }; + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 543. valarray slice default constructor + inline + slice::slice() + : _M_off(0), _M_sz(0), _M_st(0) {} + + inline + slice::slice(size_t __o, size_t __d, size_t __s) + : _M_off(__o), _M_sz(__d), _M_st(__s) {} + + inline size_t + slice::start() const + { return _M_off; } + + inline size_t + slice::size() const + { return _M_sz; } + + inline size_t + slice::stride() const + { return _M_st; } + + /** + * @brief Reference to one-dimensional subset of an array. + * + * A slice_array is a reference to the actual elements of an array + * specified by a slice. The way to get a slice_array is to call + * operator[](slice) on a valarray. The returned slice_array then permits + * carrying operations out on the referenced subset of elements in the + * original valarray. For example, operator+=(valarray) will add values + * to the subset of elements in the underlying valarray this slice_array + * refers to. + * + * @param Tp Element type. + */ + template + class slice_array + { + public: + typedef _Tp value_type; + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 253. valarray helper functions are almost entirely useless + + /// Copy constructor. Both slices refer to the same underlying array. + slice_array(const slice_array&); + + /// Assignment operator. Assigns slice elements to corresponding + /// elements of @a a. + slice_array& operator=(const slice_array&); + + /// Assign slice elements to corresponding elements of @a v. + void operator=(const valarray<_Tp>&) const; + /// Multiply slice elements by corresponding elements of @a v. + void operator*=(const valarray<_Tp>&) const; + /// Divide slice elements by corresponding elements of @a v. + void operator/=(const valarray<_Tp>&) const; + /// Modulo slice elements by corresponding elements of @a v. + void operator%=(const valarray<_Tp>&) const; + /// Add corresponding elements of @a v to slice elements. + void operator+=(const valarray<_Tp>&) const; + /// Subtract corresponding elements of @a v from slice elements. + void operator-=(const valarray<_Tp>&) const; + /// Logical xor slice elements with corresponding elements of @a v. + void operator^=(const valarray<_Tp>&) const; + /// Logical and slice elements with corresponding elements of @a v. + void operator&=(const valarray<_Tp>&) const; + /// Logical or slice elements with corresponding elements of @a v. + void operator|=(const valarray<_Tp>&) const; + /// Left shift slice elements by corresponding elements of @a v. + void operator<<=(const valarray<_Tp>&) const; + /// Right shift slice elements by corresponding elements of @a v. + void operator>>=(const valarray<_Tp>&) const; + /// Assign all slice elements to @a t. + void operator=(const _Tp &) const; + // ~slice_array (); + + template + void operator=(const _Expr<_Dom, _Tp>&) const; + template + void operator*=(const _Expr<_Dom, _Tp>&) const; + template + void operator/=(const _Expr<_Dom, _Tp>&) const; + template + void operator%=(const _Expr<_Dom, _Tp>&) const; + template + void operator+=(const _Expr<_Dom, _Tp>&) const; + template + void operator-=(const _Expr<_Dom, _Tp>&) const; + template + void operator^=(const _Expr<_Dom, _Tp>&) const; + template + void operator&=(const _Expr<_Dom, _Tp>&) const; + template + void operator|=(const _Expr<_Dom, _Tp>&) const; + template + void operator<<=(const _Expr<_Dom, _Tp>&) const; + template + void operator>>=(const _Expr<_Dom, _Tp>&) const; + + private: + friend class valarray<_Tp>; + slice_array(_Array<_Tp>, const slice&); + + const size_t _M_sz; + const size_t _M_stride; + const _Array<_Tp> _M_array; + + // not implemented + slice_array(); + }; + + template + inline + slice_array<_Tp>::slice_array(_Array<_Tp> __a, const slice& __s) + : _M_sz(__s.size()), _M_stride(__s.stride()), + _M_array(__a.begin() + __s.start()) {} + + template + inline + slice_array<_Tp>::slice_array(const slice_array<_Tp>& a) + : _M_sz(a._M_sz), _M_stride(a._M_stride), _M_array(a._M_array) {} + + // template + // inline slice_array<_Tp>::~slice_array () {} + + template + inline slice_array<_Tp>& + slice_array<_Tp>::operator=(const slice_array<_Tp>& __a) + { + std::__valarray_copy(__a._M_array, __a._M_sz, __a._M_stride, + _M_array, _M_stride); + return *this; + } + + template + inline void + slice_array<_Tp>::operator=(const _Tp& __t) const + { std::__valarray_fill(_M_array, _M_sz, _M_stride, __t); } + + template + inline void + slice_array<_Tp>::operator=(const valarray<_Tp>& __v) const + { std::__valarray_copy(_Array<_Tp>(__v), _M_array, _M_sz, _M_stride); } + + template + template + inline void + slice_array<_Tp>::operator=(const _Expr<_Dom,_Tp>& __e) const + { std::__valarray_copy(__e, _M_sz, _M_array, _M_stride); } + +#undef _DEFINE_VALARRAY_OPERATOR +#define _DEFINE_VALARRAY_OPERATOR(_Op,_Name) \ + template \ + inline void \ + slice_array<_Tp>::operator _Op##=(const valarray<_Tp>& __v) const \ + { \ + _Array_augmented_##_Name(_M_array, _M_sz, _M_stride, _Array<_Tp>(__v));\ + } \ + \ + template \ + template \ + inline void \ + slice_array<_Tp>::operator _Op##=(const _Expr<_Dom,_Tp>& __e) const\ + { \ + _Array_augmented_##_Name(_M_array, _M_stride, __e, _M_sz); \ + } + + +_DEFINE_VALARRAY_OPERATOR(*, __multiplies) +_DEFINE_VALARRAY_OPERATOR(/, __divides) +_DEFINE_VALARRAY_OPERATOR(%, __modulus) +_DEFINE_VALARRAY_OPERATOR(+, __plus) +_DEFINE_VALARRAY_OPERATOR(-, __minus) +_DEFINE_VALARRAY_OPERATOR(^, __bitwise_xor) +_DEFINE_VALARRAY_OPERATOR(&, __bitwise_and) +_DEFINE_VALARRAY_OPERATOR(|, __bitwise_or) +_DEFINE_VALARRAY_OPERATOR(<<, __shift_left) +_DEFINE_VALARRAY_OPERATOR(>>, __shift_right) + +#undef _DEFINE_VALARRAY_OPERATOR + + // @} group numeric_arrays + +_GLIBCXX_END_NAMESPACE + +#endif /* _SLICE_ARRAY_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/sstream.tcc b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/sstream.tcc new file mode 100644 index 00000000..0f9db8e9 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/sstream.tcc @@ -0,0 +1,273 @@ +// String based streams -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file sstream.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 27.7 String-based streams +// + +#ifndef _SSTREAM_TCC +#define _SSTREAM_TCC 1 + +#pragma GCC system_header + +_GLIBCXX_BEGIN_NAMESPACE(std) + + template + typename basic_stringbuf<_CharT, _Traits, _Alloc>::int_type + basic_stringbuf<_CharT, _Traits, _Alloc>:: + pbackfail(int_type __c) + { + int_type __ret = traits_type::eof(); + if (this->eback() < this->gptr()) + { + // Try to put back __c into input sequence in one of three ways. + // Order these tests done in is unspecified by the standard. + const bool __testeof = traits_type::eq_int_type(__c, __ret); + if (!__testeof) + { + const bool __testeq = traits_type::eq(traits_type:: + to_char_type(__c), + this->gptr()[-1]); + const bool __testout = this->_M_mode & ios_base::out; + if (__testeq || __testout) + { + this->gbump(-1); + if (!__testeq) + *this->gptr() = traits_type::to_char_type(__c); + __ret = __c; + } + } + else + { + this->gbump(-1); + __ret = traits_type::not_eof(__c); + } + } + return __ret; + } + + template + typename basic_stringbuf<_CharT, _Traits, _Alloc>::int_type + basic_stringbuf<_CharT, _Traits, _Alloc>:: + overflow(int_type __c) + { + const bool __testout = this->_M_mode & ios_base::out; + if (__builtin_expect(!__testout, false)) + return traits_type::eof(); + + const bool __testeof = traits_type::eq_int_type(__c, traits_type::eof()); + if (__builtin_expect(__testeof, false)) + return traits_type::not_eof(__c); + + const __size_type __capacity = _M_string.capacity(); + const __size_type __max_size = _M_string.max_size(); + const bool __testput = this->pptr() < this->epptr(); + if (__builtin_expect(!__testput && __capacity == __max_size, false)) + return traits_type::eof(); + + // Try to append __c into output sequence in one of two ways. + // Order these tests done in is unspecified by the standard. + const char_type __conv = traits_type::to_char_type(__c); + if (!__testput) + { + // NB: Start ostringstream buffers at 512 chars. This is an + // experimental value (pronounced "arbitrary" in some of the + // hipper English-speaking countries), and can be changed to + // suit particular needs. + // + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 169. Bad efficiency of overflow() mandated + // 432. stringbuf::overflow() makes only one write position + // available + const __size_type __opt_len = std::max(__size_type(2 * __capacity), + __size_type(512)); + const __size_type __len = std::min(__opt_len, __max_size); + __string_type __tmp; + __tmp.reserve(__len); + if (this->pbase()) + __tmp.assign(this->pbase(), this->epptr() - this->pbase()); + __tmp.push_back(__conv); + _M_string.swap(__tmp); + _M_sync(const_cast(_M_string.data()), + this->gptr() - this->eback(), this->pptr() - this->pbase()); + } + else + *this->pptr() = __conv; + this->pbump(1); + return __c; + } + + template + typename basic_stringbuf<_CharT, _Traits, _Alloc>::int_type + basic_stringbuf<_CharT, _Traits, _Alloc>:: + underflow() + { + int_type __ret = traits_type::eof(); + const bool __testin = this->_M_mode & ios_base::in; + if (__testin) + { + // Update egptr() to match the actual string end. + _M_update_egptr(); + + if (this->gptr() < this->egptr()) + __ret = traits_type::to_int_type(*this->gptr()); + } + return __ret; + } + + template + typename basic_stringbuf<_CharT, _Traits, _Alloc>::pos_type + basic_stringbuf<_CharT, _Traits, _Alloc>:: + seekoff(off_type __off, ios_base::seekdir __way, ios_base::openmode __mode) + { + pos_type __ret = pos_type(off_type(-1)); + bool __testin = (ios_base::in & this->_M_mode & __mode) != 0; + bool __testout = (ios_base::out & this->_M_mode & __mode) != 0; + const bool __testboth = __testin && __testout && __way != ios_base::cur; + __testin &= !(__mode & ios_base::out); + __testout &= !(__mode & ios_base::in); + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 453. basic_stringbuf::seekoff need not always fail for an empty stream. + const char_type* __beg = __testin ? this->eback() : this->pbase(); + if ((__beg || !__off) && (__testin || __testout || __testboth)) + { + _M_update_egptr(); + + off_type __newoffi = __off; + off_type __newoffo = __newoffi; + if (__way == ios_base::cur) + { + __newoffi += this->gptr() - __beg; + __newoffo += this->pptr() - __beg; + } + else if (__way == ios_base::end) + __newoffo = __newoffi += this->egptr() - __beg; + + if ((__testin || __testboth) + && __newoffi >= 0 + && this->egptr() - __beg >= __newoffi) + { + this->gbump((__beg + __newoffi) - this->gptr()); + __ret = pos_type(__newoffi); + } + if ((__testout || __testboth) + && __newoffo >= 0 + && this->egptr() - __beg >= __newoffo) + { + this->pbump((__beg + __newoffo) - this->pptr()); + __ret = pos_type(__newoffo); + } + } + return __ret; + } + + template + typename basic_stringbuf<_CharT, _Traits, _Alloc>::pos_type + basic_stringbuf<_CharT, _Traits, _Alloc>:: + seekpos(pos_type __sp, ios_base::openmode __mode) + { + pos_type __ret = pos_type(off_type(-1)); + const bool __testin = (ios_base::in & this->_M_mode & __mode) != 0; + const bool __testout = (ios_base::out & this->_M_mode & __mode) != 0; + + const char_type* __beg = __testin ? this->eback() : this->pbase(); + if ((__beg || !off_type(__sp)) && (__testin || __testout)) + { + _M_update_egptr(); + + const off_type __pos(__sp); + const bool __testpos = (0 <= __pos + && __pos <= this->egptr() - __beg); + if (__testpos) + { + if (__testin) + this->gbump((__beg + __pos) - this->gptr()); + if (__testout) + this->pbump((__beg + __pos) - this->pptr()); + __ret = __sp; + } + } + return __ret; + } + + template + void + basic_stringbuf<_CharT, _Traits, _Alloc>:: + _M_sync(char_type* __base, __size_type __i, __size_type __o) + { + const bool __testin = _M_mode & ios_base::in; + const bool __testout = _M_mode & ios_base::out; + char_type* __endg = __base + _M_string.size(); + char_type* __endp = __base + _M_string.capacity(); + + if (__base != _M_string.data()) + { + // setbuf: __i == size of buffer area (_M_string.size() == 0). + __endg += __i; + __i = 0; + __endp = __endg; + } + + if (__testin) + this->setg(__base, __base + __i, __endg); + if (__testout) + { + this->setp(__base, __endp); + this->pbump(__o); + // egptr() always tracks the string end. When !__testin, + // for the correct functioning of the streambuf inlines + // the other get area pointers are identical. + if (!__testin) + this->setg(__endg, __endg, __endg); + } + } + + // Inhibit implicit instantiations for required instantiations, + // which are defined via explicit instantiations elsewhere. + // NB: This syntax is a GNU extension. +#if _GLIBCXX_EXTERN_TEMPLATE + extern template class basic_stringbuf; + extern template class basic_istringstream; + extern template class basic_ostringstream; + extern template class basic_stringstream; + +#ifdef _GLIBCXX_USE_WCHAR_T + extern template class basic_stringbuf; + extern template class basic_istringstream; + extern template class basic_ostringstream; + extern template class basic_stringstream; +#endif +#endif + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_algo.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_algo.h new file mode 100644 index 00000000..6418ebf6 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_algo.h @@ -0,0 +1,6090 @@ +// Algorithm implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_algo.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_ALGO_H +#define _STL_ALGO_H 1 + +#include // for rand +#include +#include +#include // for _Temporary_buffer +#include +#include + +// See concept_check.h for the __glibcxx_*_requires macros. + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /** + * @brief Find the median of three values. + * @param a A value. + * @param b A value. + * @param c A value. + * @return One of @p a, @p b or @p c. + * + * If @c {l,m,n} is some convolution of @p {a,b,c} such that @c l<=m<=n + * then the value returned will be @c m. + * This is an SGI extension. + * @ingroup SGIextensions + */ + template + inline const _Tp& + __median(const _Tp& __a, const _Tp& __b, const _Tp& __c) + { + // concept requirements + __glibcxx_function_requires(_LessThanComparableConcept<_Tp>) + if (__a < __b) + if (__b < __c) + return __b; + else if (__a < __c) + return __c; + else + return __a; + else if (__a < __c) + return __a; + else if (__b < __c) + return __c; + else + return __b; + } + + /** + * @brief Find the median of three values using a predicate for comparison. + * @param a A value. + * @param b A value. + * @param c A value. + * @param comp A binary predicate. + * @return One of @p a, @p b or @p c. + * + * If @c {l,m,n} is some convolution of @p {a,b,c} such that @p comp(l,m) + * and @p comp(m,n) are both true then the value returned will be @c m. + * This is an SGI extension. + * @ingroup SGIextensions + */ + template + inline const _Tp& + __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) + { + // concept requirements + __glibcxx_function_requires(_BinaryFunctionConcept<_Compare, bool, + _Tp, _Tp>) + if (__comp(__a, __b)) + if (__comp(__b, __c)) + return __b; + else if (__comp(__a, __c)) + return __c; + else + return __a; + else if (__comp(__a, __c)) + return __a; + else if (__comp(__b, __c)) + return __c; + else + return __b; + } + + // for_each + + /// This is an overload used by find() for the Input Iterator case. + template + inline _InputIterator + __find(_InputIterator __first, _InputIterator __last, + const _Tp& __val, input_iterator_tag) + { + while (__first != __last && !(*__first == __val)) + ++__first; + return __first; + } + + /// This is an overload used by find_if() for the Input Iterator case. + template + inline _InputIterator + __find_if(_InputIterator __first, _InputIterator __last, + _Predicate __pred, input_iterator_tag) + { + while (__first != __last && !bool(__pred(*__first))) + ++__first; + return __first; + } + + /// This is an overload used by find() for the RAI case. + template + _RandomAccessIterator + __find(_RandomAccessIterator __first, _RandomAccessIterator __last, + const _Tp& __val, random_access_iterator_tag) + { + typename iterator_traits<_RandomAccessIterator>::difference_type + __trip_count = (__last - __first) >> 2; + + for (; __trip_count > 0; --__trip_count) + { + if (*__first == __val) + return __first; + ++__first; + + if (*__first == __val) + return __first; + ++__first; + + if (*__first == __val) + return __first; + ++__first; + + if (*__first == __val) + return __first; + ++__first; + } + + switch (__last - __first) + { + case 3: + if (*__first == __val) + return __first; + ++__first; + case 2: + if (*__first == __val) + return __first; + ++__first; + case 1: + if (*__first == __val) + return __first; + ++__first; + case 0: + default: + return __last; + } + } + + /// This is an overload used by find_if() for the RAI case. + template + _RandomAccessIterator + __find_if(_RandomAccessIterator __first, _RandomAccessIterator __last, + _Predicate __pred, random_access_iterator_tag) + { + typename iterator_traits<_RandomAccessIterator>::difference_type + __trip_count = (__last - __first) >> 2; + + for (; __trip_count > 0; --__trip_count) + { + if (__pred(*__first)) + return __first; + ++__first; + + if (__pred(*__first)) + return __first; + ++__first; + + if (__pred(*__first)) + return __first; + ++__first; + + if (__pred(*__first)) + return __first; + ++__first; + } + + switch (__last - __first) + { + case 3: + if (__pred(*__first)) + return __first; + ++__first; + case 2: + if (__pred(*__first)) + return __first; + ++__first; + case 1: + if (__pred(*__first)) + return __first; + ++__first; + case 0: + default: + return __last; + } + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /// This is an overload used by find_if_not() for the Input Iterator case. + template + inline _InputIterator + __find_if_not(_InputIterator __first, _InputIterator __last, + _Predicate __pred, input_iterator_tag) + { + while (__first != __last && bool(__pred(*__first))) + ++__first; + return __first; + } + + /// This is an overload used by find_if_not() for the RAI case. + template + _RandomAccessIterator + __find_if_not(_RandomAccessIterator __first, _RandomAccessIterator __last, + _Predicate __pred, random_access_iterator_tag) + { + typename iterator_traits<_RandomAccessIterator>::difference_type + __trip_count = (__last - __first) >> 2; + + for (; __trip_count > 0; --__trip_count) + { + if (!bool(__pred(*__first))) + return __first; + ++__first; + + if (!bool(__pred(*__first))) + return __first; + ++__first; + + if (!bool(__pred(*__first))) + return __first; + ++__first; + + if (!bool(__pred(*__first))) + return __first; + ++__first; + } + + switch (__last - __first) + { + case 3: + if (!bool(__pred(*__first))) + return __first; + ++__first; + case 2: + if (!bool(__pred(*__first))) + return __first; + ++__first; + case 1: + if (!bool(__pred(*__first))) + return __first; + ++__first; + case 0: + default: + return __last; + } + } +#endif + + // set_difference + // set_intersection + // set_symmetric_difference + // set_union + // for_each + // find + // find_if + // find_first_of + // adjacent_find + // count + // count_if + // search + + /** + * This is an uglified + * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&) + * overloaded for forward iterators. + */ + template + _ForwardIterator + __search_n(_ForwardIterator __first, _ForwardIterator __last, + _Integer __count, const _Tp& __val, + std::forward_iterator_tag) + { + __first = _GLIBCXX_STD_P::find(__first, __last, __val); + while (__first != __last) + { + typename iterator_traits<_ForwardIterator>::difference_type + __n = __count; + _ForwardIterator __i = __first; + ++__i; + while (__i != __last && __n != 1 && *__i == __val) + { + ++__i; + --__n; + } + if (__n == 1) + return __first; + if (__i == __last) + return __last; + __first = _GLIBCXX_STD_P::find(++__i, __last, __val); + } + return __last; + } + + /** + * This is an uglified + * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&) + * overloaded for random access iterators. + */ + template + _RandomAccessIter + __search_n(_RandomAccessIter __first, _RandomAccessIter __last, + _Integer __count, const _Tp& __val, + std::random_access_iterator_tag) + { + + typedef typename std::iterator_traits<_RandomAccessIter>::difference_type + _DistanceType; + + _DistanceType __tailSize = __last - __first; + const _DistanceType __pattSize = __count; + + if (__tailSize < __pattSize) + return __last; + + const _DistanceType __skipOffset = __pattSize - 1; + _RandomAccessIter __lookAhead = __first + __skipOffset; + __tailSize -= __pattSize; + + while (1) // the main loop... + { + // __lookAhead here is always pointing to the last element of next + // possible match. + while (!(*__lookAhead == __val)) // the skip loop... + { + if (__tailSize < __pattSize) + return __last; // Failure + __lookAhead += __pattSize; + __tailSize -= __pattSize; + } + _DistanceType __remainder = __skipOffset; + for (_RandomAccessIter __backTrack = __lookAhead - 1; + *__backTrack == __val; --__backTrack) + { + if (--__remainder == 0) + return (__lookAhead - __skipOffset); // Success + } + if (__remainder > __tailSize) + return __last; // Failure + __lookAhead += __remainder; + __tailSize -= __remainder; + } + } + + // search_n + + /** + * This is an uglified + * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&, + * _BinaryPredicate) + * overloaded for forward iterators. + */ + template + _ForwardIterator + __search_n(_ForwardIterator __first, _ForwardIterator __last, + _Integer __count, const _Tp& __val, + _BinaryPredicate __binary_pred, std::forward_iterator_tag) + { + while (__first != __last && !bool(__binary_pred(*__first, __val))) + ++__first; + + while (__first != __last) + { + typename iterator_traits<_ForwardIterator>::difference_type + __n = __count; + _ForwardIterator __i = __first; + ++__i; + while (__i != __last && __n != 1 && bool(__binary_pred(*__i, __val))) + { + ++__i; + --__n; + } + if (__n == 1) + return __first; + if (__i == __last) + return __last; + __first = ++__i; + while (__first != __last + && !bool(__binary_pred(*__first, __val))) + ++__first; + } + return __last; + } + + /** + * This is an uglified + * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&, + * _BinaryPredicate) + * overloaded for random access iterators. + */ + template + _RandomAccessIter + __search_n(_RandomAccessIter __first, _RandomAccessIter __last, + _Integer __count, const _Tp& __val, + _BinaryPredicate __binary_pred, std::random_access_iterator_tag) + { + + typedef typename std::iterator_traits<_RandomAccessIter>::difference_type + _DistanceType; + + _DistanceType __tailSize = __last - __first; + const _DistanceType __pattSize = __count; + + if (__tailSize < __pattSize) + return __last; + + const _DistanceType __skipOffset = __pattSize - 1; + _RandomAccessIter __lookAhead = __first + __skipOffset; + __tailSize -= __pattSize; + + while (1) // the main loop... + { + // __lookAhead here is always pointing to the last element of next + // possible match. + while (!bool(__binary_pred(*__lookAhead, __val))) // the skip loop... + { + if (__tailSize < __pattSize) + return __last; // Failure + __lookAhead += __pattSize; + __tailSize -= __pattSize; + } + _DistanceType __remainder = __skipOffset; + for (_RandomAccessIter __backTrack = __lookAhead - 1; + __binary_pred(*__backTrack, __val); --__backTrack) + { + if (--__remainder == 0) + return (__lookAhead - __skipOffset); // Success + } + if (__remainder > __tailSize) + return __last; // Failure + __lookAhead += __remainder; + __tailSize -= __remainder; + } + } + + // find_end for forward iterators. + template + _ForwardIterator1 + __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, + _ForwardIterator2 __first2, _ForwardIterator2 __last2, + forward_iterator_tag, forward_iterator_tag) + { + if (__first2 == __last2) + return __last1; + else + { + _ForwardIterator1 __result = __last1; + while (1) + { + _ForwardIterator1 __new_result + = _GLIBCXX_STD_P::search(__first1, __last1, __first2, __last2); + if (__new_result == __last1) + return __result; + else + { + __result = __new_result; + __first1 = __new_result; + ++__first1; + } + } + } + } + + template + _ForwardIterator1 + __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, + _ForwardIterator2 __first2, _ForwardIterator2 __last2, + forward_iterator_tag, forward_iterator_tag, + _BinaryPredicate __comp) + { + if (__first2 == __last2) + return __last1; + else + { + _ForwardIterator1 __result = __last1; + while (1) + { + _ForwardIterator1 __new_result + = _GLIBCXX_STD_P::search(__first1, __last1, __first2, + __last2, __comp); + if (__new_result == __last1) + return __result; + else + { + __result = __new_result; + __first1 = __new_result; + ++__first1; + } + } + } + } + + // find_end for bidirectional iterators (much faster). + template + _BidirectionalIterator1 + __find_end(_BidirectionalIterator1 __first1, + _BidirectionalIterator1 __last1, + _BidirectionalIterator2 __first2, + _BidirectionalIterator2 __last2, + bidirectional_iterator_tag, bidirectional_iterator_tag) + { + // concept requirements + __glibcxx_function_requires(_BidirectionalIteratorConcept< + _BidirectionalIterator1>) + __glibcxx_function_requires(_BidirectionalIteratorConcept< + _BidirectionalIterator2>) + + typedef reverse_iterator<_BidirectionalIterator1> _RevIterator1; + typedef reverse_iterator<_BidirectionalIterator2> _RevIterator2; + + _RevIterator1 __rlast1(__first1); + _RevIterator2 __rlast2(__first2); + _RevIterator1 __rresult = _GLIBCXX_STD_P::search(_RevIterator1(__last1), + __rlast1, + _RevIterator2(__last2), + __rlast2); + + if (__rresult == __rlast1) + return __last1; + else + { + _BidirectionalIterator1 __result = __rresult.base(); + std::advance(__result, -std::distance(__first2, __last2)); + return __result; + } + } + + template + _BidirectionalIterator1 + __find_end(_BidirectionalIterator1 __first1, + _BidirectionalIterator1 __last1, + _BidirectionalIterator2 __first2, + _BidirectionalIterator2 __last2, + bidirectional_iterator_tag, bidirectional_iterator_tag, + _BinaryPredicate __comp) + { + // concept requirements + __glibcxx_function_requires(_BidirectionalIteratorConcept< + _BidirectionalIterator1>) + __glibcxx_function_requires(_BidirectionalIteratorConcept< + _BidirectionalIterator2>) + + typedef reverse_iterator<_BidirectionalIterator1> _RevIterator1; + typedef reverse_iterator<_BidirectionalIterator2> _RevIterator2; + + _RevIterator1 __rlast1(__first1); + _RevIterator2 __rlast2(__first2); + _RevIterator1 __rresult = std::search(_RevIterator1(__last1), __rlast1, + _RevIterator2(__last2), __rlast2, + __comp); + + if (__rresult == __rlast1) + return __last1; + else + { + _BidirectionalIterator1 __result = __rresult.base(); + std::advance(__result, -std::distance(__first2, __last2)); + return __result; + } + } + + /** + * @brief Find last matching subsequence in a sequence. + * @ingroup non_mutating_algorithms + * @param first1 Start of range to search. + * @param last1 End of range to search. + * @param first2 Start of sequence to match. + * @param last2 End of sequence to match. + * @return The last iterator @c i in the range + * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N) + * for each @c N in the range @p [0,last2-first2), or @p last1 if no + * such iterator exists. + * + * Searches the range @p [first1,last1) for a sub-sequence that compares + * equal value-by-value with the sequence given by @p [first2,last2) and + * returns an iterator to the first element of the sub-sequence, or + * @p last1 if the sub-sequence is not found. The sub-sequence will be the + * last such subsequence contained in [first,last1). + * + * Because the sub-sequence must lie completely within the range + * @p [first1,last1) it must start at a position less than + * @p last1-(last2-first2) where @p last2-first2 is the length of the + * sub-sequence. + * This means that the returned iterator @c i will be in the range + * @p [first1,last1-(last2-first2)) + */ + template + inline _ForwardIterator1 + find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, + _ForwardIterator2 __first2, _ForwardIterator2 __last2) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>) + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>) + __glibcxx_function_requires(_EqualOpConcept< + typename iterator_traits<_ForwardIterator1>::value_type, + typename iterator_traits<_ForwardIterator2>::value_type>) + __glibcxx_requires_valid_range(__first1, __last1); + __glibcxx_requires_valid_range(__first2, __last2); + + return std::__find_end(__first1, __last1, __first2, __last2, + std::__iterator_category(__first1), + std::__iterator_category(__first2)); + } + + /** + * @brief Find last matching subsequence in a sequence using a predicate. + * @ingroup non_mutating_algorithms + * @param first1 Start of range to search. + * @param last1 End of range to search. + * @param first2 Start of sequence to match. + * @param last2 End of sequence to match. + * @param comp The predicate to use. + * @return The last iterator @c i in the range + * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @p + * (first2+N)) is true for each @c N in the range @p [0,last2-first2), or + * @p last1 if no such iterator exists. + * + * Searches the range @p [first1,last1) for a sub-sequence that compares + * equal value-by-value with the sequence given by @p [first2,last2) using + * comp as a predicate and returns an iterator to the first element of the + * sub-sequence, or @p last1 if the sub-sequence is not found. The + * sub-sequence will be the last such subsequence contained in + * [first,last1). + * + * Because the sub-sequence must lie completely within the range + * @p [first1,last1) it must start at a position less than + * @p last1-(last2-first2) where @p last2-first2 is the length of the + * sub-sequence. + * This means that the returned iterator @c i will be in the range + * @p [first1,last1-(last2-first2)) + */ + template + inline _ForwardIterator1 + find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, + _ForwardIterator2 __first2, _ForwardIterator2 __last2, + _BinaryPredicate __comp) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>) + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>) + __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, + typename iterator_traits<_ForwardIterator1>::value_type, + typename iterator_traits<_ForwardIterator2>::value_type>) + __glibcxx_requires_valid_range(__first1, __last1); + __glibcxx_requires_valid_range(__first2, __last2); + + return std::__find_end(__first1, __last1, __first2, __last2, + std::__iterator_category(__first1), + std::__iterator_category(__first2), + __comp); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Checks that a predicate is true for all the elements + * of a sequence. + * @ingroup non_mutating_algorithms + * @param first An input iterator. + * @param last An input iterator. + * @param pred A predicate. + * @return True if the check is true, false otherwise. + * + * Returns true if @p pred is true for each element in the range + * @p [first,last), and false otherwise. + */ + template + inline bool + all_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) + { return __last == std::find_if_not(__first, __last, __pred); } + + /** + * @brief Checks that a predicate is false for all the elements + * of a sequence. + * @ingroup non_mutating_algorithms + * @param first An input iterator. + * @param last An input iterator. + * @param pred A predicate. + * @return True if the check is true, false otherwise. + * + * Returns true if @p pred is false for each element in the range + * @p [first,last), and false otherwise. + */ + template + inline bool + none_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) + { return __last == _GLIBCXX_STD_P::find_if(__first, __last, __pred); } + + /** + * @brief Checks that a predicate is false for at least an element + * of a sequence. + * @ingroup non_mutating_algorithms + * @param first An input iterator. + * @param last An input iterator. + * @param pred A predicate. + * @return True if the check is true, false otherwise. + * + * Returns true if an element exists in the range @p [first,last) such that + * @p pred is true, and false otherwise. + */ + template + inline bool + any_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) + { return !std::none_of(__first, __last, __pred); } + + /** + * @brief Find the first element in a sequence for which a + * predicate is false. + * @ingroup non_mutating_algorithms + * @param first An input iterator. + * @param last An input iterator. + * @param pred A predicate. + * @return The first iterator @c i in the range @p [first,last) + * such that @p pred(*i) is false, or @p last if no such iterator exists. + */ + template + inline _InputIterator + find_if_not(_InputIterator __first, _InputIterator __last, + _Predicate __pred) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + return std::__find_if_not(__first, __last, __pred, + std::__iterator_category(__first)); + } + + /** + * @brief Checks whether the sequence is partitioned. + * @ingroup mutating_algorithms + * @param first An input iterator. + * @param last An input iterator. + * @param pred A predicate. + * @return True if the range @p [first,last) is partioned by @p pred, + * i.e. if all elements that satisfy @p pred appear before those that + * do not. + */ + template + inline bool + is_partitioned(_InputIterator __first, _InputIterator __last, + _Predicate __pred) + { + __first = std::find_if_not(__first, __last, __pred); + return std::none_of(__first, __last, __pred); + } + + /** + * @brief Find the partition point of a partitioned range. + * @ingroup mutating_algorithms + * @param first An iterator. + * @param last Another iterator. + * @param pred A predicate. + * @return An iterator @p mid such that @p all_of(first, mid, pred) + * and @p none_of(mid, last, pred) are both true. + */ + template + _ForwardIterator + partition_point(_ForwardIterator __first, _ForwardIterator __last, + _Predicate __pred) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, + typename iterator_traits<_ForwardIterator>::value_type>) + + // A specific debug-mode test will be necessary... + __glibcxx_requires_valid_range(__first, __last); + + typedef typename iterator_traits<_ForwardIterator>::difference_type + _DistanceType; + + _DistanceType __len = std::distance(__first, __last); + _DistanceType __half; + _ForwardIterator __middle; + + while (__len > 0) + { + __half = __len >> 1; + __middle = __first; + std::advance(__middle, __half); + if (__pred(*__middle)) + { + __first = __middle; + ++__first; + __len = __len - __half - 1; + } + else + __len = __half; + } + return __first; + } +#endif + + + /** + * @brief Copy a sequence, removing elements of a given value. + * @ingroup mutating_algorithms + * @param first An input iterator. + * @param last An input iterator. + * @param result An output iterator. + * @param value The value to be removed. + * @return An iterator designating the end of the resulting sequence. + * + * Copies each element in the range @p [first,last) not equal to @p value + * to the range beginning at @p result. + * remove_copy() is stable, so the relative order of elements that are + * copied is unchanged. + */ + template + _OutputIterator + remove_copy(_InputIterator __first, _InputIterator __last, + _OutputIterator __result, const _Tp& __value) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_function_requires(_EqualOpConcept< + typename iterator_traits<_InputIterator>::value_type, _Tp>) + __glibcxx_requires_valid_range(__first, __last); + + for (; __first != __last; ++__first) + if (!(*__first == __value)) + { + *__result = *__first; + ++__result; + } + return __result; + } + + /** + * @brief Copy a sequence, removing elements for which a predicate is true. + * @ingroup mutating_algorithms + * @param first An input iterator. + * @param last An input iterator. + * @param result An output iterator. + * @param pred A predicate. + * @return An iterator designating the end of the resulting sequence. + * + * Copies each element in the range @p [first,last) for which + * @p pred returns false to the range beginning at @p result. + * + * remove_copy_if() is stable, so the relative order of elements that are + * copied is unchanged. + */ + template + _OutputIterator + remove_copy_if(_InputIterator __first, _InputIterator __last, + _OutputIterator __result, _Predicate __pred) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + for (; __first != __last; ++__first) + if (!bool(__pred(*__first))) + { + *__result = *__first; + ++__result; + } + return __result; + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Copy the elements of a sequence for which a predicate is true. + * @ingroup mutating_algorithms + * @param first An input iterator. + * @param last An input iterator. + * @param result An output iterator. + * @param pred A predicate. + * @return An iterator designating the end of the resulting sequence. + * + * Copies each element in the range @p [first,last) for which + * @p pred returns true to the range beginning at @p result. + * + * copy_if() is stable, so the relative order of elements that are + * copied is unchanged. + */ + template + _OutputIterator + copy_if(_InputIterator __first, _InputIterator __last, + _OutputIterator __result, _Predicate __pred) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + for (; __first != __last; ++__first) + if (__pred(*__first)) + { + *__result = *__first; + ++__result; + } + return __result; + } + + + template + _OutputIterator + __copy_n(_InputIterator __first, _Size __n, + _OutputIterator __result, input_iterator_tag) + { + for (; __n > 0; --__n) + { + *__result = *__first; + ++__first; + ++__result; + } + return __result; + } + + template + inline _OutputIterator + __copy_n(_RandomAccessIterator __first, _Size __n, + _OutputIterator __result, random_access_iterator_tag) + { return std::copy(__first, __first + __n, __result); } + + /** + * @brief Copies the range [first,first+n) into [result,result+n). + * @ingroup mutating_algorithms + * @param first An input iterator. + * @param n The number of elements to copy. + * @param result An output iterator. + * @return result+n. + * + * This inline function will boil down to a call to @c memmove whenever + * possible. Failing that, if random access iterators are passed, then the + * loop count will be known (and therefore a candidate for compiler + * optimizations such as unrolling). + */ + template + inline _OutputIterator + copy_n(_InputIterator __first, _Size __n, _OutputIterator __result) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + typename iterator_traits<_InputIterator>::value_type>) + + return std::__copy_n(__first, __n, __result, + std::__iterator_category(__first)); + } + + /** + * @brief Copy the elements of a sequence to separate output sequences + * depending on the truth value of a predicate. + * @ingroup mutating_algorithms + * @param first An input iterator. + * @param last An input iterator. + * @param out_true An output iterator. + * @param out_false An output iterator. + * @param pred A predicate. + * @return A pair designating the ends of the resulting sequences. + * + * Copies each element in the range @p [first,last) for which + * @p pred returns true to the range beginning at @p out_true + * and each element for which @p pred returns false to @p out_false. + */ + template + pair<_OutputIterator1, _OutputIterator2> + partition_copy(_InputIterator __first, _InputIterator __last, + _OutputIterator1 __out_true, _OutputIterator2 __out_false, + _Predicate __pred) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator1, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator2, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + for (; __first != __last; ++__first) + if (__pred(*__first)) + { + *__out_true = *__first; + ++__out_true; + } + else + { + *__out_false = *__first; + ++__out_false; + } + + return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); + } +#endif + + /** + * @brief Remove elements from a sequence. + * @ingroup mutating_algorithms + * @param first An input iterator. + * @param last An input iterator. + * @param value The value to be removed. + * @return An iterator designating the end of the resulting sequence. + * + * All elements equal to @p value are removed from the range + * @p [first,last). + * + * remove() is stable, so the relative order of elements that are + * not removed is unchanged. + * + * Elements between the end of the resulting sequence and @p last + * are still present, but their value is unspecified. + */ + template + _ForwardIterator + remove(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __value) + { + // concept requirements + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator>) + __glibcxx_function_requires(_EqualOpConcept< + typename iterator_traits<_ForwardIterator>::value_type, _Tp>) + __glibcxx_requires_valid_range(__first, __last); + + __first = _GLIBCXX_STD_P::find(__first, __last, __value); + if(__first == __last) + return __first; + _ForwardIterator __result = __first; + ++__first; + for(; __first != __last; ++__first) + if(!(*__first == __value)) + { + *__result = _GLIBCXX_MOVE(*__first); + ++__result; + } + return __result; + } + + /** + * @brief Remove elements from a sequence using a predicate. + * @ingroup mutating_algorithms + * @param first A forward iterator. + * @param last A forward iterator. + * @param pred A predicate. + * @return An iterator designating the end of the resulting sequence. + * + * All elements for which @p pred returns true are removed from the range + * @p [first,last). + * + * remove_if() is stable, so the relative order of elements that are + * not removed is unchanged. + * + * Elements between the end of the resulting sequence and @p last + * are still present, but their value is unspecified. + */ + template + _ForwardIterator + remove_if(_ForwardIterator __first, _ForwardIterator __last, + _Predicate __pred) + { + // concept requirements + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator>) + __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + __first = _GLIBCXX_STD_P::find_if(__first, __last, __pred); + if(__first == __last) + return __first; + _ForwardIterator __result = __first; + ++__first; + for(; __first != __last; ++__first) + if(!bool(__pred(*__first))) + { + *__result = _GLIBCXX_MOVE(*__first); + ++__result; + } + return __result; + } + + /** + * @brief Remove consecutive duplicate values from a sequence. + * @ingroup mutating_algorithms + * @param first A forward iterator. + * @param last A forward iterator. + * @return An iterator designating the end of the resulting sequence. + * + * Removes all but the first element from each group of consecutive + * values that compare equal. + * unique() is stable, so the relative order of elements that are + * not removed is unchanged. + * Elements between the end of the resulting sequence and @p last + * are still present, but their value is unspecified. + */ + template + _ForwardIterator + unique(_ForwardIterator __first, _ForwardIterator __last) + { + // concept requirements + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator>) + __glibcxx_function_requires(_EqualityComparableConcept< + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + // Skip the beginning, if already unique. + __first = _GLIBCXX_STD_P::adjacent_find(__first, __last); + if (__first == __last) + return __last; + + // Do the real copy work. + _ForwardIterator __dest = __first; + ++__first; + while (++__first != __last) + if (!(*__dest == *__first)) + *++__dest = _GLIBCXX_MOVE(*__first); + return ++__dest; + } + + /** + * @brief Remove consecutive values from a sequence using a predicate. + * @ingroup mutating_algorithms + * @param first A forward iterator. + * @param last A forward iterator. + * @param binary_pred A binary predicate. + * @return An iterator designating the end of the resulting sequence. + * + * Removes all but the first element from each group of consecutive + * values for which @p binary_pred returns true. + * unique() is stable, so the relative order of elements that are + * not removed is unchanged. + * Elements between the end of the resulting sequence and @p last + * are still present, but their value is unspecified. + */ + template + _ForwardIterator + unique(_ForwardIterator __first, _ForwardIterator __last, + _BinaryPredicate __binary_pred) + { + // concept requirements + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, + typename iterator_traits<_ForwardIterator>::value_type, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + // Skip the beginning, if already unique. + __first = _GLIBCXX_STD_P::adjacent_find(__first, __last, __binary_pred); + if (__first == __last) + return __last; + + // Do the real copy work. + _ForwardIterator __dest = __first; + ++__first; + while (++__first != __last) + if (!bool(__binary_pred(*__dest, *__first))) + *++__dest = _GLIBCXX_MOVE(*__first); + return ++__dest; + } + + /** + * This is an uglified unique_copy(_InputIterator, _InputIterator, + * _OutputIterator) + * overloaded for forward iterators and output iterator as result. + */ + template + _OutputIterator + __unique_copy(_ForwardIterator __first, _ForwardIterator __last, + _OutputIterator __result, + forward_iterator_tag, output_iterator_tag) + { + // concept requirements -- taken care of in dispatching function + _ForwardIterator __next = __first; + *__result = *__first; + while (++__next != __last) + if (!(*__first == *__next)) + { + __first = __next; + *++__result = *__first; + } + return ++__result; + } + + /** + * This is an uglified unique_copy(_InputIterator, _InputIterator, + * _OutputIterator) + * overloaded for input iterators and output iterator as result. + */ + template + _OutputIterator + __unique_copy(_InputIterator __first, _InputIterator __last, + _OutputIterator __result, + input_iterator_tag, output_iterator_tag) + { + // concept requirements -- taken care of in dispatching function + typename iterator_traits<_InputIterator>::value_type __value = *__first; + *__result = __value; + while (++__first != __last) + if (!(__value == *__first)) + { + __value = *__first; + *++__result = __value; + } + return ++__result; + } + + /** + * This is an uglified unique_copy(_InputIterator, _InputIterator, + * _OutputIterator) + * overloaded for input iterators and forward iterator as result. + */ + template + _ForwardIterator + __unique_copy(_InputIterator __first, _InputIterator __last, + _ForwardIterator __result, + input_iterator_tag, forward_iterator_tag) + { + // concept requirements -- taken care of in dispatching function + *__result = *__first; + while (++__first != __last) + if (!(*__result == *__first)) + *++__result = *__first; + return ++__result; + } + + /** + * This is an uglified + * unique_copy(_InputIterator, _InputIterator, _OutputIterator, + * _BinaryPredicate) + * overloaded for forward iterators and output iterator as result. + */ + template + _OutputIterator + __unique_copy(_ForwardIterator __first, _ForwardIterator __last, + _OutputIterator __result, _BinaryPredicate __binary_pred, + forward_iterator_tag, output_iterator_tag) + { + // concept requirements -- iterators already checked + __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, + typename iterator_traits<_ForwardIterator>::value_type, + typename iterator_traits<_ForwardIterator>::value_type>) + + _ForwardIterator __next = __first; + *__result = *__first; + while (++__next != __last) + if (!bool(__binary_pred(*__first, *__next))) + { + __first = __next; + *++__result = *__first; + } + return ++__result; + } + + /** + * This is an uglified + * unique_copy(_InputIterator, _InputIterator, _OutputIterator, + * _BinaryPredicate) + * overloaded for input iterators and output iterator as result. + */ + template + _OutputIterator + __unique_copy(_InputIterator __first, _InputIterator __last, + _OutputIterator __result, _BinaryPredicate __binary_pred, + input_iterator_tag, output_iterator_tag) + { + // concept requirements -- iterators already checked + __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, + typename iterator_traits<_InputIterator>::value_type, + typename iterator_traits<_InputIterator>::value_type>) + + typename iterator_traits<_InputIterator>::value_type __value = *__first; + *__result = __value; + while (++__first != __last) + if (!bool(__binary_pred(__value, *__first))) + { + __value = *__first; + *++__result = __value; + } + return ++__result; + } + + /** + * This is an uglified + * unique_copy(_InputIterator, _InputIterator, _OutputIterator, + * _BinaryPredicate) + * overloaded for input iterators and forward iterator as result. + */ + template + _ForwardIterator + __unique_copy(_InputIterator __first, _InputIterator __last, + _ForwardIterator __result, _BinaryPredicate __binary_pred, + input_iterator_tag, forward_iterator_tag) + { + // concept requirements -- iterators already checked + __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, + typename iterator_traits<_ForwardIterator>::value_type, + typename iterator_traits<_InputIterator>::value_type>) + + *__result = *__first; + while (++__first != __last) + if (!bool(__binary_pred(*__result, *__first))) + *++__result = *__first; + return ++__result; + } + + /** + * This is an uglified reverse(_BidirectionalIterator, + * _BidirectionalIterator) + * overloaded for bidirectional iterators. + */ + template + void + __reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, + bidirectional_iterator_tag) + { + while (true) + if (__first == __last || __first == --__last) + return; + else + { + std::iter_swap(__first, __last); + ++__first; + } + } + + /** + * This is an uglified reverse(_BidirectionalIterator, + * _BidirectionalIterator) + * overloaded for random access iterators. + */ + template + void + __reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, + random_access_iterator_tag) + { + if (__first == __last) + return; + --__last; + while (__first < __last) + { + std::iter_swap(__first, __last); + ++__first; + --__last; + } + } + + /** + * @brief Reverse a sequence. + * @ingroup mutating_algorithms + * @param first A bidirectional iterator. + * @param last A bidirectional iterator. + * @return reverse() returns no value. + * + * Reverses the order of the elements in the range @p [first,last), + * so that the first element becomes the last etc. + * For every @c i such that @p 0<=i<=(last-first)/2), @p reverse() + * swaps @p *(first+i) and @p *(last-(i+1)) + */ + template + inline void + reverse(_BidirectionalIterator __first, _BidirectionalIterator __last) + { + // concept requirements + __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept< + _BidirectionalIterator>) + __glibcxx_requires_valid_range(__first, __last); + std::__reverse(__first, __last, std::__iterator_category(__first)); + } + + /** + * @brief Copy a sequence, reversing its elements. + * @ingroup mutating_algorithms + * @param first A bidirectional iterator. + * @param last A bidirectional iterator. + * @param result An output iterator. + * @return An iterator designating the end of the resulting sequence. + * + * Copies the elements in the range @p [first,last) to the range + * @p [result,result+(last-first)) such that the order of the + * elements is reversed. + * For every @c i such that @p 0<=i<=(last-first), @p reverse_copy() + * performs the assignment @p *(result+(last-first)-i) = *(first+i). + * The ranges @p [first,last) and @p [result,result+(last-first)) + * must not overlap. + */ + template + _OutputIterator + reverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, + _OutputIterator __result) + { + // concept requirements + __glibcxx_function_requires(_BidirectionalIteratorConcept< + _BidirectionalIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + typename iterator_traits<_BidirectionalIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + while (__first != __last) + { + --__last; + *__result = *__last; + ++__result; + } + return __result; + } + + /** + * This is a helper function for the rotate algorithm specialized on RAIs. + * It returns the greatest common divisor of two integer values. + */ + template + _EuclideanRingElement + __gcd(_EuclideanRingElement __m, _EuclideanRingElement __n) + { + while (__n != 0) + { + _EuclideanRingElement __t = __m % __n; + __m = __n; + __n = __t; + } + return __m; + } + + /// This is a helper function for the rotate algorithm. + template + void + __rotate(_ForwardIterator __first, + _ForwardIterator __middle, + _ForwardIterator __last, + forward_iterator_tag) + { + if (__first == __middle || __last == __middle) + return; + + _ForwardIterator __first2 = __middle; + do + { + std::iter_swap(__first, __first2); + ++__first; + ++__first2; + if (__first == __middle) + __middle = __first2; + } + while (__first2 != __last); + + __first2 = __middle; + + while (__first2 != __last) + { + std::iter_swap(__first, __first2); + ++__first; + ++__first2; + if (__first == __middle) + __middle = __first2; + else if (__first2 == __last) + __first2 = __middle; + } + } + + /// This is a helper function for the rotate algorithm. + template + void + __rotate(_BidirectionalIterator __first, + _BidirectionalIterator __middle, + _BidirectionalIterator __last, + bidirectional_iterator_tag) + { + // concept requirements + __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept< + _BidirectionalIterator>) + + if (__first == __middle || __last == __middle) + return; + + std::__reverse(__first, __middle, bidirectional_iterator_tag()); + std::__reverse(__middle, __last, bidirectional_iterator_tag()); + + while (__first != __middle && __middle != __last) + { + std::iter_swap(__first, --__last); + ++__first; + } + + if (__first == __middle) + std::__reverse(__middle, __last, bidirectional_iterator_tag()); + else + std::__reverse(__first, __middle, bidirectional_iterator_tag()); + } + + /// This is a helper function for the rotate algorithm. + template + void + __rotate(_RandomAccessIterator __first, + _RandomAccessIterator __middle, + _RandomAccessIterator __last, + random_access_iterator_tag) + { + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + + if (__first == __middle || __last == __middle) + return; + + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _Distance; + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + const _Distance __n = __last - __first; + const _Distance __k = __middle - __first; + const _Distance __l = __n - __k; + + if (__k == __l) + { + std::swap_ranges(__first, __middle, __middle); + return; + } + + const _Distance __d = std::__gcd(__n, __k); + + for (_Distance __i = 0; __i < __d; __i++) + { + _ValueType __tmp = _GLIBCXX_MOVE(*__first); + _RandomAccessIterator __p = __first; + + if (__k < __l) + { + for (_Distance __j = 0; __j < __l / __d; __j++) + { + if (__p > __first + __l) + { + *__p = _GLIBCXX_MOVE(*(__p - __l)); + __p -= __l; + } + + *__p = _GLIBCXX_MOVE(*(__p + __k)); + __p += __k; + } + } + else + { + for (_Distance __j = 0; __j < __k / __d - 1; __j ++) + { + if (__p < __last - __k) + { + *__p = _GLIBCXX_MOVE(*(__p + __k)); + __p += __k; + } + *__p = _GLIBCXX_MOVE(*(__p - __l)); + __p -= __l; + } + } + + *__p = _GLIBCXX_MOVE(__tmp); + ++__first; + } + } + + /** + * @brief Rotate the elements of a sequence. + * @ingroup mutating_algorithms + * @param first A forward iterator. + * @param middle A forward iterator. + * @param last A forward iterator. + * @return Nothing. + * + * Rotates the elements of the range @p [first,last) by @p (middle-first) + * positions so that the element at @p middle is moved to @p first, the + * element at @p middle+1 is moved to @first+1 and so on for each element + * in the range @p [first,last). + * + * This effectively swaps the ranges @p [first,middle) and + * @p [middle,last). + * + * Performs @p *(first+(n+(last-middle))%(last-first))=*(first+n) for + * each @p n in the range @p [0,last-first). + */ + template + inline void + rotate(_ForwardIterator __first, _ForwardIterator __middle, + _ForwardIterator __last) + { + // concept requirements + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator>) + __glibcxx_requires_valid_range(__first, __middle); + __glibcxx_requires_valid_range(__middle, __last); + + typedef typename iterator_traits<_ForwardIterator>::iterator_category + _IterType; + std::__rotate(__first, __middle, __last, _IterType()); + } + + /** + * @brief Copy a sequence, rotating its elements. + * @ingroup mutating_algorithms + * @param first A forward iterator. + * @param middle A forward iterator. + * @param last A forward iterator. + * @param result An output iterator. + * @return An iterator designating the end of the resulting sequence. + * + * Copies the elements of the range @p [first,last) to the range + * beginning at @result, rotating the copied elements by @p (middle-first) + * positions so that the element at @p middle is moved to @p result, the + * element at @p middle+1 is moved to @result+1 and so on for each element + * in the range @p [first,last). + * + * Performs @p *(result+(n+(last-middle))%(last-first))=*(first+n) for + * each @p n in the range @p [0,last-first). + */ + template + _OutputIterator + rotate_copy(_ForwardIterator __first, _ForwardIterator __middle, + _ForwardIterator __last, _OutputIterator __result) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __middle); + __glibcxx_requires_valid_range(__middle, __last); + + return std::copy(__first, __middle, + std::copy(__middle, __last, __result)); + } + + /// This is a helper function... + template + _ForwardIterator + __partition(_ForwardIterator __first, _ForwardIterator __last, + _Predicate __pred, forward_iterator_tag) + { + if (__first == __last) + return __first; + + while (__pred(*__first)) + if (++__first == __last) + return __first; + + _ForwardIterator __next = __first; + + while (++__next != __last) + if (__pred(*__next)) + { + std::iter_swap(__first, __next); + ++__first; + } + + return __first; + } + + /// This is a helper function... + template + _BidirectionalIterator + __partition(_BidirectionalIterator __first, _BidirectionalIterator __last, + _Predicate __pred, bidirectional_iterator_tag) + { + while (true) + { + while (true) + if (__first == __last) + return __first; + else if (__pred(*__first)) + ++__first; + else + break; + --__last; + while (true) + if (__first == __last) + return __first; + else if (!bool(__pred(*__last))) + --__last; + else + break; + std::iter_swap(__first, __last); + ++__first; + } + } + + // partition + + /// This is a helper function... + template + _ForwardIterator + __inplace_stable_partition(_ForwardIterator __first, + _ForwardIterator __last, + _Predicate __pred, _Distance __len) + { + if (__len == 1) + return __pred(*__first) ? __last : __first; + _ForwardIterator __middle = __first; + std::advance(__middle, __len / 2); + _ForwardIterator __begin = std::__inplace_stable_partition(__first, + __middle, + __pred, + __len / 2); + _ForwardIterator __end = std::__inplace_stable_partition(__middle, __last, + __pred, + __len + - __len / 2); + std::rotate(__begin, __middle, __end); + std::advance(__begin, std::distance(__middle, __end)); + return __begin; + } + + /// This is a helper function... + template + _ForwardIterator + __stable_partition_adaptive(_ForwardIterator __first, + _ForwardIterator __last, + _Predicate __pred, _Distance __len, + _Pointer __buffer, + _Distance __buffer_size) + { + if (__len <= __buffer_size) + { + _ForwardIterator __result1 = __first; + _Pointer __result2 = __buffer; + for (; __first != __last; ++__first) + if (__pred(*__first)) + { + *__result1 = *__first; + ++__result1; + } + else + { + *__result2 = *__first; + ++__result2; + } + std::copy(__buffer, __result2, __result1); + return __result1; + } + else + { + _ForwardIterator __middle = __first; + std::advance(__middle, __len / 2); + _ForwardIterator __begin = + std::__stable_partition_adaptive(__first, __middle, __pred, + __len / 2, __buffer, + __buffer_size); + _ForwardIterator __end = + std::__stable_partition_adaptive(__middle, __last, __pred, + __len - __len / 2, + __buffer, __buffer_size); + std::rotate(__begin, __middle, __end); + std::advance(__begin, std::distance(__middle, __end)); + return __begin; + } + } + + /** + * @brief Move elements for which a predicate is true to the beginning + * of a sequence, preserving relative ordering. + * @ingroup mutating_algorithms + * @param first A forward iterator. + * @param last A forward iterator. + * @param pred A predicate functor. + * @return An iterator @p middle such that @p pred(i) is true for each + * iterator @p i in the range @p [first,middle) and false for each @p i + * in the range @p [middle,last). + * + * Performs the same function as @p partition() with the additional + * guarantee that the relative ordering of elements in each group is + * preserved, so any two elements @p x and @p y in the range + * @p [first,last) such that @p pred(x)==pred(y) will have the same + * relative ordering after calling @p stable_partition(). + */ + template + _ForwardIterator + stable_partition(_ForwardIterator __first, _ForwardIterator __last, + _Predicate __pred) + { + // concept requirements + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator>) + __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return __first; + else + { + typedef typename iterator_traits<_ForwardIterator>::value_type + _ValueType; + typedef typename iterator_traits<_ForwardIterator>::difference_type + _DistanceType; + + _Temporary_buffer<_ForwardIterator, _ValueType> __buf(__first, + __last); + if (__buf.size() > 0) + return + std::__stable_partition_adaptive(__first, __last, __pred, + _DistanceType(__buf.requested_size()), + __buf.begin(), + _DistanceType(__buf.size())); + else + return + std::__inplace_stable_partition(__first, __last, __pred, + _DistanceType(__buf.requested_size())); + } + } + + /// This is a helper function for the sort routines. + template + void + __heap_select(_RandomAccessIterator __first, + _RandomAccessIterator __middle, + _RandomAccessIterator __last) + { + std::make_heap(__first, __middle); + for (_RandomAccessIterator __i = __middle; __i < __last; ++__i) + if (*__i < *__first) + std::__pop_heap(__first, __middle, __i); + } + + /// This is a helper function for the sort routines. + template + void + __heap_select(_RandomAccessIterator __first, + _RandomAccessIterator __middle, + _RandomAccessIterator __last, _Compare __comp) + { + std::make_heap(__first, __middle, __comp); + for (_RandomAccessIterator __i = __middle; __i < __last; ++__i) + if (__comp(*__i, *__first)) + std::__pop_heap(__first, __middle, __i, __comp); + } + + // partial_sort + + /** + * @brief Copy the smallest elements of a sequence. + * @ingroup sorting_algorithms + * @param first An iterator. + * @param last Another iterator. + * @param result_first A random-access iterator. + * @param result_last Another random-access iterator. + * @return An iterator indicating the end of the resulting sequence. + * + * Copies and sorts the smallest N values from the range @p [first,last) + * to the range beginning at @p result_first, where the number of + * elements to be copied, @p N, is the smaller of @p (last-first) and + * @p (result_last-result_first). + * After the sort if @p i and @j are iterators in the range + * @p [result_first,result_first+N) such that @i precedes @j then + * @p *j<*i is false. + * The value returned is @p result_first+N. + */ + template + _RandomAccessIterator + partial_sort_copy(_InputIterator __first, _InputIterator __last, + _RandomAccessIterator __result_first, + _RandomAccessIterator __result_last) + { + typedef typename iterator_traits<_InputIterator>::value_type + _InputValueType; + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _OutputValueType; + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_ConvertibleConcept<_InputValueType, + _OutputValueType>) + __glibcxx_function_requires(_LessThanOpConcept<_InputValueType, + _OutputValueType>) + __glibcxx_function_requires(_LessThanComparableConcept<_OutputValueType>) + __glibcxx_requires_valid_range(__first, __last); + __glibcxx_requires_valid_range(__result_first, __result_last); + + if (__result_first == __result_last) + return __result_last; + _RandomAccessIterator __result_real_last = __result_first; + while(__first != __last && __result_real_last != __result_last) + { + *__result_real_last = *__first; + ++__result_real_last; + ++__first; + } + std::make_heap(__result_first, __result_real_last); + while (__first != __last) + { + if (*__first < *__result_first) + std::__adjust_heap(__result_first, _DistanceType(0), + _DistanceType(__result_real_last + - __result_first), + _InputValueType(*__first)); + ++__first; + } + std::sort_heap(__result_first, __result_real_last); + return __result_real_last; + } + + /** + * @brief Copy the smallest elements of a sequence using a predicate for + * comparison. + * @ingroup sorting_algorithms + * @param first An input iterator. + * @param last Another input iterator. + * @param result_first A random-access iterator. + * @param result_last Another random-access iterator. + * @param comp A comparison functor. + * @return An iterator indicating the end of the resulting sequence. + * + * Copies and sorts the smallest N values from the range @p [first,last) + * to the range beginning at @p result_first, where the number of + * elements to be copied, @p N, is the smaller of @p (last-first) and + * @p (result_last-result_first). + * After the sort if @p i and @j are iterators in the range + * @p [result_first,result_first+N) such that @i precedes @j then + * @p comp(*j,*i) is false. + * The value returned is @p result_first+N. + */ + template + _RandomAccessIterator + partial_sort_copy(_InputIterator __first, _InputIterator __last, + _RandomAccessIterator __result_first, + _RandomAccessIterator __result_last, + _Compare __comp) + { + typedef typename iterator_traits<_InputIterator>::value_type + _InputValueType; + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _OutputValueType; + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_ConvertibleConcept<_InputValueType, + _OutputValueType>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _InputValueType, _OutputValueType>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _OutputValueType, _OutputValueType>) + __glibcxx_requires_valid_range(__first, __last); + __glibcxx_requires_valid_range(__result_first, __result_last); + + if (__result_first == __result_last) + return __result_last; + _RandomAccessIterator __result_real_last = __result_first; + while(__first != __last && __result_real_last != __result_last) + { + *__result_real_last = *__first; + ++__result_real_last; + ++__first; + } + std::make_heap(__result_first, __result_real_last, __comp); + while (__first != __last) + { + if (__comp(*__first, *__result_first)) + std::__adjust_heap(__result_first, _DistanceType(0), + _DistanceType(__result_real_last + - __result_first), + _InputValueType(*__first), + __comp); + ++__first; + } + std::sort_heap(__result_first, __result_real_last, __comp); + return __result_real_last; + } + + /// This is a helper function for the sort routine. + template + void + __unguarded_linear_insert(_RandomAccessIterator __last, _Tp __val) + { + _RandomAccessIterator __next = __last; + --__next; + while (__val < *__next) + { + *__last = *__next; + __last = __next; + --__next; + } + *__last = __val; + } + + /// This is a helper function for the sort routine. + template + void + __unguarded_linear_insert(_RandomAccessIterator __last, _Tp __val, + _Compare __comp) + { + _RandomAccessIterator __next = __last; + --__next; + while (__comp(__val, *__next)) + { + *__last = *__next; + __last = __next; + --__next; + } + *__last = __val; + } + + /// This is a helper function for the sort routine. + template + void + __insertion_sort(_RandomAccessIterator __first, + _RandomAccessIterator __last) + { + if (__first == __last) + return; + + for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) + { + typename iterator_traits<_RandomAccessIterator>::value_type + __val = *__i; + if (__val < *__first) + { + std::copy_backward(__first, __i, __i + 1); + *__first = __val; + } + else + std::__unguarded_linear_insert(__i, __val); + } + } + + /// This is a helper function for the sort routine. + template + void + __insertion_sort(_RandomAccessIterator __first, + _RandomAccessIterator __last, _Compare __comp) + { + if (__first == __last) return; + + for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) + { + typename iterator_traits<_RandomAccessIterator>::value_type + __val = *__i; + if (__comp(__val, *__first)) + { + std::copy_backward(__first, __i, __i + 1); + *__first = __val; + } + else + std::__unguarded_linear_insert(__i, __val, __comp); + } + } + + /// This is a helper function for the sort routine. + template + inline void + __unguarded_insertion_sort(_RandomAccessIterator __first, + _RandomAccessIterator __last) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + for (_RandomAccessIterator __i = __first; __i != __last; ++__i) + std::__unguarded_linear_insert(__i, _ValueType(*__i)); + } + + /// This is a helper function for the sort routine. + template + inline void + __unguarded_insertion_sort(_RandomAccessIterator __first, + _RandomAccessIterator __last, _Compare __comp) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + for (_RandomAccessIterator __i = __first; __i != __last; ++__i) + std::__unguarded_linear_insert(__i, _ValueType(*__i), __comp); + } + + /** + * @doctodo + * This controls some aspect of the sort routines. + */ + enum { _S_threshold = 16 }; + + /// This is a helper function for the sort routine. + template + void + __final_insertion_sort(_RandomAccessIterator __first, + _RandomAccessIterator __last) + { + if (__last - __first > int(_S_threshold)) + { + std::__insertion_sort(__first, __first + int(_S_threshold)); + std::__unguarded_insertion_sort(__first + int(_S_threshold), __last); + } + else + std::__insertion_sort(__first, __last); + } + + /// This is a helper function for the sort routine. + template + void + __final_insertion_sort(_RandomAccessIterator __first, + _RandomAccessIterator __last, _Compare __comp) + { + if (__last - __first > int(_S_threshold)) + { + std::__insertion_sort(__first, __first + int(_S_threshold), __comp); + std::__unguarded_insertion_sort(__first + int(_S_threshold), __last, + __comp); + } + else + std::__insertion_sort(__first, __last, __comp); + } + + /// This is a helper function... + template + _RandomAccessIterator + __unguarded_partition(_RandomAccessIterator __first, + _RandomAccessIterator __last, _Tp __pivot) + { + while (true) + { + while (*__first < __pivot) + ++__first; + --__last; + while (__pivot < *__last) + --__last; + if (!(__first < __last)) + return __first; + std::iter_swap(__first, __last); + ++__first; + } + } + + /// This is a helper function... + template + _RandomAccessIterator + __unguarded_partition(_RandomAccessIterator __first, + _RandomAccessIterator __last, + _Tp __pivot, _Compare __comp) + { + while (true) + { + while (__comp(*__first, __pivot)) + ++__first; + --__last; + while (__comp(__pivot, *__last)) + --__last; + if (!(__first < __last)) + return __first; + std::iter_swap(__first, __last); + ++__first; + } + } + + /// This is a helper function for the sort routine. + template + void + __introsort_loop(_RandomAccessIterator __first, + _RandomAccessIterator __last, + _Size __depth_limit) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + while (__last - __first > int(_S_threshold)) + { + if (__depth_limit == 0) + { + _GLIBCXX_STD_P::partial_sort(__first, __last, __last); + return; + } + --__depth_limit; + _RandomAccessIterator __cut = + std::__unguarded_partition(__first, __last, + _ValueType(std::__median(*__first, + *(__first + + (__last + - __first) + / 2), + *(__last + - 1)))); + std::__introsort_loop(__cut, __last, __depth_limit); + __last = __cut; + } + } + + /// This is a helper function for the sort routine. + template + void + __introsort_loop(_RandomAccessIterator __first, + _RandomAccessIterator __last, + _Size __depth_limit, _Compare __comp) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + while (__last - __first > int(_S_threshold)) + { + if (__depth_limit == 0) + { + _GLIBCXX_STD_P::partial_sort(__first, __last, __last, __comp); + return; + } + --__depth_limit; + _RandomAccessIterator __cut = + std::__unguarded_partition(__first, __last, + _ValueType(std::__median(*__first, + *(__first + + (__last + - __first) + / 2), + *(__last - 1), + __comp)), + __comp); + std::__introsort_loop(__cut, __last, __depth_limit, __comp); + __last = __cut; + } + } + + /// This is a helper function for the sort routines. Precondition: __n > 0. + template + inline _Size + __lg(_Size __n) + { + _Size __k; + for (__k = 0; __n != 0; __n >>= 1) + ++__k; + return __k - 1; + } + + inline int + __lg(int __n) + { return sizeof(int) * __CHAR_BIT__ - 1 - __builtin_clz(__n); } + + inline long + __lg(long __n) + { return sizeof(long) * __CHAR_BIT__ - 1 - __builtin_clzl(__n); } + + inline long long + __lg(long long __n) + { return sizeof(long long) * __CHAR_BIT__ - 1 - __builtin_clzll(__n); } + + // sort + + template + void + __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth, + _RandomAccessIterator __last, _Size __depth_limit) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + while (__last - __first > 3) + { + if (__depth_limit == 0) + { + std::__heap_select(__first, __nth + 1, __last); + + // Place the nth largest element in its final position. + std::iter_swap(__first, __nth); + return; + } + --__depth_limit; + _RandomAccessIterator __cut = + std::__unguarded_partition(__first, __last, + _ValueType(std::__median(*__first, + *(__first + + (__last + - __first) + / 2), + *(__last + - 1)))); + if (__cut <= __nth) + __first = __cut; + else + __last = __cut; + } + std::__insertion_sort(__first, __last); + } + + template + void + __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth, + _RandomAccessIterator __last, _Size __depth_limit, + _Compare __comp) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + while (__last - __first > 3) + { + if (__depth_limit == 0) + { + std::__heap_select(__first, __nth + 1, __last, __comp); + // Place the nth largest element in its final position. + std::iter_swap(__first, __nth); + return; + } + --__depth_limit; + _RandomAccessIterator __cut = + std::__unguarded_partition(__first, __last, + _ValueType(std::__median(*__first, + *(__first + + (__last + - __first) + / 2), + *(__last - 1), + __comp)), + __comp); + if (__cut <= __nth) + __first = __cut; + else + __last = __cut; + } + std::__insertion_sort(__first, __last, __comp); + } + + // nth_element + + /** + * @brief Finds the first position in which @a val could be inserted + * without changing the ordering. + * @param first An iterator. + * @param last Another iterator. + * @param val The search term. + * @return An iterator pointing to the first element "not less + * than" @a val, or end() if every element is less than + * @a val. + * @ingroup binary_search_algorithms + */ + template + _ForwardIterator + lower_bound(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __val) + { + typedef typename iterator_traits<_ForwardIterator>::value_type + _ValueType; + typedef typename iterator_traits<_ForwardIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType, _Tp>) + __glibcxx_requires_partitioned_lower(__first, __last, __val); + + _DistanceType __len = std::distance(__first, __last); + _DistanceType __half; + _ForwardIterator __middle; + + while (__len > 0) + { + __half = __len >> 1; + __middle = __first; + std::advance(__middle, __half); + if (*__middle < __val) + { + __first = __middle; + ++__first; + __len = __len - __half - 1; + } + else + __len = __half; + } + return __first; + } + + /** + * @brief Finds the first position in which @a val could be inserted + * without changing the ordering. + * @ingroup binary_search_algorithms + * @param first An iterator. + * @param last Another iterator. + * @param val The search term. + * @param comp A functor to use for comparisons. + * @return An iterator pointing to the first element "not less than" @a val, + * or end() if every element is less than @a val. + * @ingroup binary_search_algorithms + * + * The comparison function should have the same effects on ordering as + * the function used for the initial sort. + */ + template + _ForwardIterator + lower_bound(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __val, _Compare __comp) + { + typedef typename iterator_traits<_ForwardIterator>::value_type + _ValueType; + typedef typename iterator_traits<_ForwardIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType, _Tp>) + __glibcxx_requires_partitioned_lower_pred(__first, __last, + __val, __comp); + + _DistanceType __len = std::distance(__first, __last); + _DistanceType __half; + _ForwardIterator __middle; + + while (__len > 0) + { + __half = __len >> 1; + __middle = __first; + std::advance(__middle, __half); + if (__comp(*__middle, __val)) + { + __first = __middle; + ++__first; + __len = __len - __half - 1; + } + else + __len = __half; + } + return __first; + } + + /** + * @brief Finds the last position in which @a val could be inserted + * without changing the ordering. + * @ingroup binary_search_algorithms + * @param first An iterator. + * @param last Another iterator. + * @param val The search term. + * @return An iterator pointing to the first element greater than @a val, + * or end() if no elements are greater than @a val. + * @ingroup binary_search_algorithms + */ + template + _ForwardIterator + upper_bound(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __val) + { + typedef typename iterator_traits<_ForwardIterator>::value_type + _ValueType; + typedef typename iterator_traits<_ForwardIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_LessThanOpConcept<_Tp, _ValueType>) + __glibcxx_requires_partitioned_upper(__first, __last, __val); + + _DistanceType __len = std::distance(__first, __last); + _DistanceType __half; + _ForwardIterator __middle; + + while (__len > 0) + { + __half = __len >> 1; + __middle = __first; + std::advance(__middle, __half); + if (__val < *__middle) + __len = __half; + else + { + __first = __middle; + ++__first; + __len = __len - __half - 1; + } + } + return __first; + } + + /** + * @brief Finds the last position in which @a val could be inserted + * without changing the ordering. + * @ingroup binary_search_algorithms + * @param first An iterator. + * @param last Another iterator. + * @param val The search term. + * @param comp A functor to use for comparisons. + * @return An iterator pointing to the first element greater than @a val, + * or end() if no elements are greater than @a val. + * @ingroup binary_search_algorithms + * + * The comparison function should have the same effects on ordering as + * the function used for the initial sort. + */ + template + _ForwardIterator + upper_bound(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __val, _Compare __comp) + { + typedef typename iterator_traits<_ForwardIterator>::value_type + _ValueType; + typedef typename iterator_traits<_ForwardIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _Tp, _ValueType>) + __glibcxx_requires_partitioned_upper_pred(__first, __last, + __val, __comp); + + _DistanceType __len = std::distance(__first, __last); + _DistanceType __half; + _ForwardIterator __middle; + + while (__len > 0) + { + __half = __len >> 1; + __middle = __first; + std::advance(__middle, __half); + if (__comp(__val, *__middle)) + __len = __half; + else + { + __first = __middle; + ++__first; + __len = __len - __half - 1; + } + } + return __first; + } + + /** + * @brief Finds the largest subrange in which @a val could be inserted + * at any place in it without changing the ordering. + * @ingroup binary_search_algorithms + * @param first An iterator. + * @param last Another iterator. + * @param val The search term. + * @return An pair of iterators defining the subrange. + * @ingroup binary_search_algorithms + * + * This is equivalent to + * @code + * std::make_pair(lower_bound(first, last, val), + * upper_bound(first, last, val)) + * @endcode + * but does not actually call those functions. + */ + template + pair<_ForwardIterator, _ForwardIterator> + equal_range(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __val) + { + typedef typename iterator_traits<_ForwardIterator>::value_type + _ValueType; + typedef typename iterator_traits<_ForwardIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType, _Tp>) + __glibcxx_function_requires(_LessThanOpConcept<_Tp, _ValueType>) + __glibcxx_requires_partitioned_lower(__first, __last, __val); + __glibcxx_requires_partitioned_upper(__first, __last, __val); + + _DistanceType __len = std::distance(__first, __last); + _DistanceType __half; + _ForwardIterator __middle, __left, __right; + + while (__len > 0) + { + __half = __len >> 1; + __middle = __first; + std::advance(__middle, __half); + if (*__middle < __val) + { + __first = __middle; + ++__first; + __len = __len - __half - 1; + } + else if (__val < *__middle) + __len = __half; + else + { + __left = std::lower_bound(__first, __middle, __val); + std::advance(__first, __len); + __right = std::upper_bound(++__middle, __first, __val); + return pair<_ForwardIterator, _ForwardIterator>(__left, __right); + } + } + return pair<_ForwardIterator, _ForwardIterator>(__first, __first); + } + + /** + * @brief Finds the largest subrange in which @a val could be inserted + * at any place in it without changing the ordering. + * @param first An iterator. + * @param last Another iterator. + * @param val The search term. + * @param comp A functor to use for comparisons. + * @return An pair of iterators defining the subrange. + * @ingroup binary_search_algorithms + * + * This is equivalent to + * @code + * std::make_pair(lower_bound(first, last, val, comp), + * upper_bound(first, last, val, comp)) + * @endcode + * but does not actually call those functions. + */ + template + pair<_ForwardIterator, _ForwardIterator> + equal_range(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __val, + _Compare __comp) + { + typedef typename iterator_traits<_ForwardIterator>::value_type + _ValueType; + typedef typename iterator_traits<_ForwardIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType, _Tp>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _Tp, _ValueType>) + __glibcxx_requires_partitioned_lower_pred(__first, __last, + __val, __comp); + __glibcxx_requires_partitioned_upper_pred(__first, __last, + __val, __comp); + + _DistanceType __len = std::distance(__first, __last); + _DistanceType __half; + _ForwardIterator __middle, __left, __right; + + while (__len > 0) + { + __half = __len >> 1; + __middle = __first; + std::advance(__middle, __half); + if (__comp(*__middle, __val)) + { + __first = __middle; + ++__first; + __len = __len - __half - 1; + } + else if (__comp(__val, *__middle)) + __len = __half; + else + { + __left = std::lower_bound(__first, __middle, __val, __comp); + std::advance(__first, __len); + __right = std::upper_bound(++__middle, __first, __val, __comp); + return pair<_ForwardIterator, _ForwardIterator>(__left, __right); + } + } + return pair<_ForwardIterator, _ForwardIterator>(__first, __first); + } + + /** + * @brief Determines whether an element exists in a range. + * @ingroup binary_search_algorithms + * @param first An iterator. + * @param last Another iterator. + * @param val The search term. + * @return True if @a val (or its equivalent) is in [@a first,@a last ]. + * + * Note that this does not actually return an iterator to @a val. For + * that, use std::find or a container's specialized find member functions. + */ + template + bool + binary_search(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __val) + { + typedef typename iterator_traits<_ForwardIterator>::value_type + _ValueType; + + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_LessThanOpConcept<_Tp, _ValueType>) + __glibcxx_requires_partitioned_lower(__first, __last, __val); + __glibcxx_requires_partitioned_upper(__first, __last, __val); + + _ForwardIterator __i = std::lower_bound(__first, __last, __val); + return __i != __last && !(__val < *__i); + } + + /** + * @brief Determines whether an element exists in a range. + * @ingroup binary_search_algorithms + * @param first An iterator. + * @param last Another iterator. + * @param val The search term. + * @param comp A functor to use for comparisons. + * @return True if @a val (or its equivalent) is in [@a first,@a last ]. + * + * Note that this does not actually return an iterator to @a val. For + * that, use std::find or a container's specialized find member functions. + * + * The comparison function should have the same effects on ordering as + * the function used for the initial sort. + */ + template + bool + binary_search(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __val, _Compare __comp) + { + typedef typename iterator_traits<_ForwardIterator>::value_type + _ValueType; + + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _Tp, _ValueType>) + __glibcxx_requires_partitioned_lower_pred(__first, __last, + __val, __comp); + __glibcxx_requires_partitioned_upper_pred(__first, __last, + __val, __comp); + + _ForwardIterator __i = std::lower_bound(__first, __last, __val, __comp); + return __i != __last && !bool(__comp(__val, *__i)); + } + + // merge + + /// This is a helper function for the merge routines. + template + _BidirectionalIterator3 + __merge_backward(_BidirectionalIterator1 __first1, + _BidirectionalIterator1 __last1, + _BidirectionalIterator2 __first2, + _BidirectionalIterator2 __last2, + _BidirectionalIterator3 __result) + { + if (__first1 == __last1) + return std::copy_backward(__first2, __last2, __result); + if (__first2 == __last2) + return std::copy_backward(__first1, __last1, __result); + --__last1; + --__last2; + while (true) + { + if (*__last2 < *__last1) + { + *--__result = *__last1; + if (__first1 == __last1) + return std::copy_backward(__first2, ++__last2, __result); + --__last1; + } + else + { + *--__result = *__last2; + if (__first2 == __last2) + return std::copy_backward(__first1, ++__last1, __result); + --__last2; + } + } + } + + /// This is a helper function for the merge routines. + template + _BidirectionalIterator3 + __merge_backward(_BidirectionalIterator1 __first1, + _BidirectionalIterator1 __last1, + _BidirectionalIterator2 __first2, + _BidirectionalIterator2 __last2, + _BidirectionalIterator3 __result, + _Compare __comp) + { + if (__first1 == __last1) + return std::copy_backward(__first2, __last2, __result); + if (__first2 == __last2) + return std::copy_backward(__first1, __last1, __result); + --__last1; + --__last2; + while (true) + { + if (__comp(*__last2, *__last1)) + { + *--__result = *__last1; + if (__first1 == __last1) + return std::copy_backward(__first2, ++__last2, __result); + --__last1; + } + else + { + *--__result = *__last2; + if (__first2 == __last2) + return std::copy_backward(__first1, ++__last1, __result); + --__last2; + } + } + } + + /// This is a helper function for the merge routines. + template + _BidirectionalIterator1 + __rotate_adaptive(_BidirectionalIterator1 __first, + _BidirectionalIterator1 __middle, + _BidirectionalIterator1 __last, + _Distance __len1, _Distance __len2, + _BidirectionalIterator2 __buffer, + _Distance __buffer_size) + { + _BidirectionalIterator2 __buffer_end; + if (__len1 > __len2 && __len2 <= __buffer_size) + { + __buffer_end = std::copy(__middle, __last, __buffer); + std::copy_backward(__first, __middle, __last); + return std::copy(__buffer, __buffer_end, __first); + } + else if (__len1 <= __buffer_size) + { + __buffer_end = std::copy(__first, __middle, __buffer); + std::copy(__middle, __last, __first); + return std::copy_backward(__buffer, __buffer_end, __last); + } + else + { + std::rotate(__first, __middle, __last); + std::advance(__first, std::distance(__middle, __last)); + return __first; + } + } + + /// This is a helper function for the merge routines. + template + void + __merge_adaptive(_BidirectionalIterator __first, + _BidirectionalIterator __middle, + _BidirectionalIterator __last, + _Distance __len1, _Distance __len2, + _Pointer __buffer, _Distance __buffer_size) + { + if (__len1 <= __len2 && __len1 <= __buffer_size) + { + _Pointer __buffer_end = std::copy(__first, __middle, __buffer); + _GLIBCXX_STD_P::merge(__buffer, __buffer_end, __middle, __last, + __first); + } + else if (__len2 <= __buffer_size) + { + _Pointer __buffer_end = std::copy(__middle, __last, __buffer); + std::__merge_backward(__first, __middle, __buffer, + __buffer_end, __last); + } + else + { + _BidirectionalIterator __first_cut = __first; + _BidirectionalIterator __second_cut = __middle; + _Distance __len11 = 0; + _Distance __len22 = 0; + if (__len1 > __len2) + { + __len11 = __len1 / 2; + std::advance(__first_cut, __len11); + __second_cut = std::lower_bound(__middle, __last, + *__first_cut); + __len22 = std::distance(__middle, __second_cut); + } + else + { + __len22 = __len2 / 2; + std::advance(__second_cut, __len22); + __first_cut = std::upper_bound(__first, __middle, + *__second_cut); + __len11 = std::distance(__first, __first_cut); + } + _BidirectionalIterator __new_middle = + std::__rotate_adaptive(__first_cut, __middle, __second_cut, + __len1 - __len11, __len22, __buffer, + __buffer_size); + std::__merge_adaptive(__first, __first_cut, __new_middle, __len11, + __len22, __buffer, __buffer_size); + std::__merge_adaptive(__new_middle, __second_cut, __last, + __len1 - __len11, + __len2 - __len22, __buffer, __buffer_size); + } + } + + /// This is a helper function for the merge routines. + template + void + __merge_adaptive(_BidirectionalIterator __first, + _BidirectionalIterator __middle, + _BidirectionalIterator __last, + _Distance __len1, _Distance __len2, + _Pointer __buffer, _Distance __buffer_size, + _Compare __comp) + { + if (__len1 <= __len2 && __len1 <= __buffer_size) + { + _Pointer __buffer_end = std::copy(__first, __middle, __buffer); + _GLIBCXX_STD_P::merge(__buffer, __buffer_end, __middle, __last, + __first, __comp); + } + else if (__len2 <= __buffer_size) + { + _Pointer __buffer_end = std::copy(__middle, __last, __buffer); + std::__merge_backward(__first, __middle, __buffer, __buffer_end, + __last, __comp); + } + else + { + _BidirectionalIterator __first_cut = __first; + _BidirectionalIterator __second_cut = __middle; + _Distance __len11 = 0; + _Distance __len22 = 0; + if (__len1 > __len2) + { + __len11 = __len1 / 2; + std::advance(__first_cut, __len11); + __second_cut = std::lower_bound(__middle, __last, *__first_cut, + __comp); + __len22 = std::distance(__middle, __second_cut); + } + else + { + __len22 = __len2 / 2; + std::advance(__second_cut, __len22); + __first_cut = std::upper_bound(__first, __middle, *__second_cut, + __comp); + __len11 = std::distance(__first, __first_cut); + } + _BidirectionalIterator __new_middle = + std::__rotate_adaptive(__first_cut, __middle, __second_cut, + __len1 - __len11, __len22, __buffer, + __buffer_size); + std::__merge_adaptive(__first, __first_cut, __new_middle, __len11, + __len22, __buffer, __buffer_size, __comp); + std::__merge_adaptive(__new_middle, __second_cut, __last, + __len1 - __len11, + __len2 - __len22, __buffer, + __buffer_size, __comp); + } + } + + /// This is a helper function for the merge routines. + template + void + __merge_without_buffer(_BidirectionalIterator __first, + _BidirectionalIterator __middle, + _BidirectionalIterator __last, + _Distance __len1, _Distance __len2) + { + if (__len1 == 0 || __len2 == 0) + return; + if (__len1 + __len2 == 2) + { + if (*__middle < *__first) + std::iter_swap(__first, __middle); + return; + } + _BidirectionalIterator __first_cut = __first; + _BidirectionalIterator __second_cut = __middle; + _Distance __len11 = 0; + _Distance __len22 = 0; + if (__len1 > __len2) + { + __len11 = __len1 / 2; + std::advance(__first_cut, __len11); + __second_cut = std::lower_bound(__middle, __last, *__first_cut); + __len22 = std::distance(__middle, __second_cut); + } + else + { + __len22 = __len2 / 2; + std::advance(__second_cut, __len22); + __first_cut = std::upper_bound(__first, __middle, *__second_cut); + __len11 = std::distance(__first, __first_cut); + } + std::rotate(__first_cut, __middle, __second_cut); + _BidirectionalIterator __new_middle = __first_cut; + std::advance(__new_middle, std::distance(__middle, __second_cut)); + std::__merge_without_buffer(__first, __first_cut, __new_middle, + __len11, __len22); + std::__merge_without_buffer(__new_middle, __second_cut, __last, + __len1 - __len11, __len2 - __len22); + } + + /// This is a helper function for the merge routines. + template + void + __merge_without_buffer(_BidirectionalIterator __first, + _BidirectionalIterator __middle, + _BidirectionalIterator __last, + _Distance __len1, _Distance __len2, + _Compare __comp) + { + if (__len1 == 0 || __len2 == 0) + return; + if (__len1 + __len2 == 2) + { + if (__comp(*__middle, *__first)) + std::iter_swap(__first, __middle); + return; + } + _BidirectionalIterator __first_cut = __first; + _BidirectionalIterator __second_cut = __middle; + _Distance __len11 = 0; + _Distance __len22 = 0; + if (__len1 > __len2) + { + __len11 = __len1 / 2; + std::advance(__first_cut, __len11); + __second_cut = std::lower_bound(__middle, __last, *__first_cut, + __comp); + __len22 = std::distance(__middle, __second_cut); + } + else + { + __len22 = __len2 / 2; + std::advance(__second_cut, __len22); + __first_cut = std::upper_bound(__first, __middle, *__second_cut, + __comp); + __len11 = std::distance(__first, __first_cut); + } + std::rotate(__first_cut, __middle, __second_cut); + _BidirectionalIterator __new_middle = __first_cut; + std::advance(__new_middle, std::distance(__middle, __second_cut)); + std::__merge_without_buffer(__first, __first_cut, __new_middle, + __len11, __len22, __comp); + std::__merge_without_buffer(__new_middle, __second_cut, __last, + __len1 - __len11, __len2 - __len22, __comp); + } + + /** + * @brief Merges two sorted ranges in place. + * @ingroup sorting_algorithms + * @param first An iterator. + * @param middle Another iterator. + * @param last Another iterator. + * @return Nothing. + * + * Merges two sorted and consecutive ranges, [first,middle) and + * [middle,last), and puts the result in [first,last). The output will + * be sorted. The sort is @e stable, that is, for equivalent + * elements in the two ranges, elements from the first range will always + * come before elements from the second. + * + * If enough additional memory is available, this takes (last-first)-1 + * comparisons. Otherwise an NlogN algorithm is used, where N is + * distance(first,last). + */ + template + void + inplace_merge(_BidirectionalIterator __first, + _BidirectionalIterator __middle, + _BidirectionalIterator __last) + { + typedef typename iterator_traits<_BidirectionalIterator>::value_type + _ValueType; + typedef typename iterator_traits<_BidirectionalIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept< + _BidirectionalIterator>) + __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) + __glibcxx_requires_sorted(__first, __middle); + __glibcxx_requires_sorted(__middle, __last); + + if (__first == __middle || __middle == __last) + return; + + _DistanceType __len1 = std::distance(__first, __middle); + _DistanceType __len2 = std::distance(__middle, __last); + + _Temporary_buffer<_BidirectionalIterator, _ValueType> __buf(__first, + __last); + if (__buf.begin() == 0) + std::__merge_without_buffer(__first, __middle, __last, __len1, __len2); + else + std::__merge_adaptive(__first, __middle, __last, __len1, __len2, + __buf.begin(), _DistanceType(__buf.size())); + } + + /** + * @brief Merges two sorted ranges in place. + * @ingroup sorting_algorithms + * @param first An iterator. + * @param middle Another iterator. + * @param last Another iterator. + * @param comp A functor to use for comparisons. + * @return Nothing. + * + * Merges two sorted and consecutive ranges, [first,middle) and + * [middle,last), and puts the result in [first,last). The output will + * be sorted. The sort is @e stable, that is, for equivalent + * elements in the two ranges, elements from the first range will always + * come before elements from the second. + * + * If enough additional memory is available, this takes (last-first)-1 + * comparisons. Otherwise an NlogN algorithm is used, where N is + * distance(first,last). + * + * The comparison function should have the same effects on ordering as + * the function used for the initial sort. + */ + template + void + inplace_merge(_BidirectionalIterator __first, + _BidirectionalIterator __middle, + _BidirectionalIterator __last, + _Compare __comp) + { + typedef typename iterator_traits<_BidirectionalIterator>::value_type + _ValueType; + typedef typename iterator_traits<_BidirectionalIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept< + _BidirectionalIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType, _ValueType>) + __glibcxx_requires_sorted_pred(__first, __middle, __comp); + __glibcxx_requires_sorted_pred(__middle, __last, __comp); + + if (__first == __middle || __middle == __last) + return; + + const _DistanceType __len1 = std::distance(__first, __middle); + const _DistanceType __len2 = std::distance(__middle, __last); + + _Temporary_buffer<_BidirectionalIterator, _ValueType> __buf(__first, + __last); + if (__buf.begin() == 0) + std::__merge_without_buffer(__first, __middle, __last, __len1, + __len2, __comp); + else + std::__merge_adaptive(__first, __middle, __last, __len1, __len2, + __buf.begin(), _DistanceType(__buf.size()), + __comp); + } + + template + void + __merge_sort_loop(_RandomAccessIterator1 __first, + _RandomAccessIterator1 __last, + _RandomAccessIterator2 __result, + _Distance __step_size) + { + const _Distance __two_step = 2 * __step_size; + + while (__last - __first >= __two_step) + { + __result = _GLIBCXX_STD_P::merge(__first, __first + __step_size, + __first + __step_size, + __first + __two_step, + __result); + __first += __two_step; + } + + __step_size = std::min(_Distance(__last - __first), __step_size); + _GLIBCXX_STD_P::merge(__first, __first + __step_size, + __first + __step_size, __last, + __result); + } + + template + void + __merge_sort_loop(_RandomAccessIterator1 __first, + _RandomAccessIterator1 __last, + _RandomAccessIterator2 __result, _Distance __step_size, + _Compare __comp) + { + const _Distance __two_step = 2 * __step_size; + + while (__last - __first >= __two_step) + { + __result = _GLIBCXX_STD_P::merge(__first, __first + __step_size, + __first + __step_size, __first + __two_step, + __result, + __comp); + __first += __two_step; + } + __step_size = std::min(_Distance(__last - __first), __step_size); + + _GLIBCXX_STD_P::merge(__first, __first + __step_size, + __first + __step_size, __last, __result, __comp); + } + + template + void + __chunk_insertion_sort(_RandomAccessIterator __first, + _RandomAccessIterator __last, + _Distance __chunk_size) + { + while (__last - __first >= __chunk_size) + { + std::__insertion_sort(__first, __first + __chunk_size); + __first += __chunk_size; + } + std::__insertion_sort(__first, __last); + } + + template + void + __chunk_insertion_sort(_RandomAccessIterator __first, + _RandomAccessIterator __last, + _Distance __chunk_size, _Compare __comp) + { + while (__last - __first >= __chunk_size) + { + std::__insertion_sort(__first, __first + __chunk_size, __comp); + __first += __chunk_size; + } + std::__insertion_sort(__first, __last, __comp); + } + + enum { _S_chunk_size = 7 }; + + template + void + __merge_sort_with_buffer(_RandomAccessIterator __first, + _RandomAccessIterator __last, + _Pointer __buffer) + { + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _Distance; + + const _Distance __len = __last - __first; + const _Pointer __buffer_last = __buffer + __len; + + _Distance __step_size = _S_chunk_size; + std::__chunk_insertion_sort(__first, __last, __step_size); + + while (__step_size < __len) + { + std::__merge_sort_loop(__first, __last, __buffer, __step_size); + __step_size *= 2; + std::__merge_sort_loop(__buffer, __buffer_last, __first, __step_size); + __step_size *= 2; + } + } + + template + void + __merge_sort_with_buffer(_RandomAccessIterator __first, + _RandomAccessIterator __last, + _Pointer __buffer, _Compare __comp) + { + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _Distance; + + const _Distance __len = __last - __first; + const _Pointer __buffer_last = __buffer + __len; + + _Distance __step_size = _S_chunk_size; + std::__chunk_insertion_sort(__first, __last, __step_size, __comp); + + while (__step_size < __len) + { + std::__merge_sort_loop(__first, __last, __buffer, + __step_size, __comp); + __step_size *= 2; + std::__merge_sort_loop(__buffer, __buffer_last, __first, + __step_size, __comp); + __step_size *= 2; + } + } + + template + void + __stable_sort_adaptive(_RandomAccessIterator __first, + _RandomAccessIterator __last, + _Pointer __buffer, _Distance __buffer_size) + { + const _Distance __len = (__last - __first + 1) / 2; + const _RandomAccessIterator __middle = __first + __len; + if (__len > __buffer_size) + { + std::__stable_sort_adaptive(__first, __middle, + __buffer, __buffer_size); + std::__stable_sort_adaptive(__middle, __last, + __buffer, __buffer_size); + } + else + { + std::__merge_sort_with_buffer(__first, __middle, __buffer); + std::__merge_sort_with_buffer(__middle, __last, __buffer); + } + std::__merge_adaptive(__first, __middle, __last, + _Distance(__middle - __first), + _Distance(__last - __middle), + __buffer, __buffer_size); + } + + template + void + __stable_sort_adaptive(_RandomAccessIterator __first, + _RandomAccessIterator __last, + _Pointer __buffer, _Distance __buffer_size, + _Compare __comp) + { + const _Distance __len = (__last - __first + 1) / 2; + const _RandomAccessIterator __middle = __first + __len; + if (__len > __buffer_size) + { + std::__stable_sort_adaptive(__first, __middle, __buffer, + __buffer_size, __comp); + std::__stable_sort_adaptive(__middle, __last, __buffer, + __buffer_size, __comp); + } + else + { + std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp); + std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp); + } + std::__merge_adaptive(__first, __middle, __last, + _Distance(__middle - __first), + _Distance(__last - __middle), + __buffer, __buffer_size, + __comp); + } + + /// This is a helper function for the stable sorting routines. + template + void + __inplace_stable_sort(_RandomAccessIterator __first, + _RandomAccessIterator __last) + { + if (__last - __first < 15) + { + std::__insertion_sort(__first, __last); + return; + } + _RandomAccessIterator __middle = __first + (__last - __first) / 2; + std::__inplace_stable_sort(__first, __middle); + std::__inplace_stable_sort(__middle, __last); + std::__merge_without_buffer(__first, __middle, __last, + __middle - __first, + __last - __middle); + } + + /// This is a helper function for the stable sorting routines. + template + void + __inplace_stable_sort(_RandomAccessIterator __first, + _RandomAccessIterator __last, _Compare __comp) + { + if (__last - __first < 15) + { + std::__insertion_sort(__first, __last, __comp); + return; + } + _RandomAccessIterator __middle = __first + (__last - __first) / 2; + std::__inplace_stable_sort(__first, __middle, __comp); + std::__inplace_stable_sort(__middle, __last, __comp); + std::__merge_without_buffer(__first, __middle, __last, + __middle - __first, + __last - __middle, + __comp); + } + + // stable_sort + + // Set algorithms: includes, set_union, set_intersection, set_difference, + // set_symmetric_difference. All of these algorithms have the precondition + // that their input ranges are sorted and the postcondition that their output + // ranges are sorted. + + /** + * @brief Determines whether all elements of a sequence exists in a range. + * @param first1 Start of search range. + * @param last1 End of search range. + * @param first2 Start of sequence + * @param last2 End of sequence. + * @return True if each element in [first2,last2) is contained in order + * within [first1,last1). False otherwise. + * @ingroup set_algorithms + * + * This operation expects both [first1,last1) and [first2,last2) to be + * sorted. Searches for the presence of each element in [first2,last2) + * within [first1,last1). The iterators over each range only move forward, + * so this is a linear algorithm. If an element in [first2,last2) is not + * found before the search iterator reaches @a last2, false is returned. + */ + template + bool + includes(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2) + { + typedef typename iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_InputIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType1, _ValueType2>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) + __glibcxx_requires_sorted_set(__first1, __last1, __first2); + __glibcxx_requires_sorted_set(__first2, __last2, __first1); + + while (__first1 != __last1 && __first2 != __last2) + if (*__first2 < *__first1) + return false; + else if(*__first1 < *__first2) + ++__first1; + else + ++__first1, ++__first2; + + return __first2 == __last2; + } + + /** + * @brief Determines whether all elements of a sequence exists in a range + * using comparison. + * @ingroup set_algorithms + * @param first1 Start of search range. + * @param last1 End of search range. + * @param first2 Start of sequence + * @param last2 End of sequence. + * @param comp Comparison function to use. + * @return True if each element in [first2,last2) is contained in order + * within [first1,last1) according to comp. False otherwise. + * @ingroup set_algorithms + * + * This operation expects both [first1,last1) and [first2,last2) to be + * sorted. Searches for the presence of each element in [first2,last2) + * within [first1,last1), using comp to decide. The iterators over each + * range only move forward, so this is a linear algorithm. If an element + * in [first2,last2) is not found before the search iterator reaches @a + * last2, false is returned. + */ + template + bool + includes(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2, + _Compare __comp) + { + typedef typename iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_InputIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType1, _ValueType2>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType2, _ValueType1>) + __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp); + __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp); + + while (__first1 != __last1 && __first2 != __last2) + if (__comp(*__first2, *__first1)) + return false; + else if(__comp(*__first1, *__first2)) + ++__first1; + else + ++__first1, ++__first2; + + return __first2 == __last2; + } + + // nth_element + // merge + // set_difference + // set_intersection + // set_union + // stable_sort + // set_symmetric_difference + // min_element + // max_element + + /** + * @brief Permute range into the next "dictionary" ordering. + * @ingroup sorting_algorithms + * @param first Start of range. + * @param last End of range. + * @return False if wrapped to first permutation, true otherwise. + * + * Treats all permutations of the range as a set of "dictionary" sorted + * sequences. Permutes the current sequence into the next one of this set. + * Returns true if there are more sequences to generate. If the sequence + * is the largest of the set, the smallest is generated and false returned. + */ + template + bool + next_permutation(_BidirectionalIterator __first, + _BidirectionalIterator __last) + { + // concept requirements + __glibcxx_function_requires(_BidirectionalIteratorConcept< + _BidirectionalIterator>) + __glibcxx_function_requires(_LessThanComparableConcept< + typename iterator_traits<_BidirectionalIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return false; + _BidirectionalIterator __i = __first; + ++__i; + if (__i == __last) + return false; + __i = __last; + --__i; + + for(;;) + { + _BidirectionalIterator __ii = __i; + --__i; + if (*__i < *__ii) + { + _BidirectionalIterator __j = __last; + while (!(*__i < *--__j)) + {} + std::iter_swap(__i, __j); + std::reverse(__ii, __last); + return true; + } + if (__i == __first) + { + std::reverse(__first, __last); + return false; + } + } + } + + /** + * @brief Permute range into the next "dictionary" ordering using + * comparison functor. + * @ingroup sorting_algorithms + * @param first Start of range. + * @param last End of range. + * @param comp A comparison functor. + * @return False if wrapped to first permutation, true otherwise. + * + * Treats all permutations of the range [first,last) as a set of + * "dictionary" sorted sequences ordered by @a comp. Permutes the current + * sequence into the next one of this set. Returns true if there are more + * sequences to generate. If the sequence is the largest of the set, the + * smallest is generated and false returned. + */ + template + bool + next_permutation(_BidirectionalIterator __first, + _BidirectionalIterator __last, _Compare __comp) + { + // concept requirements + __glibcxx_function_requires(_BidirectionalIteratorConcept< + _BidirectionalIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + typename iterator_traits<_BidirectionalIterator>::value_type, + typename iterator_traits<_BidirectionalIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return false; + _BidirectionalIterator __i = __first; + ++__i; + if (__i == __last) + return false; + __i = __last; + --__i; + + for(;;) + { + _BidirectionalIterator __ii = __i; + --__i; + if (__comp(*__i, *__ii)) + { + _BidirectionalIterator __j = __last; + while (!bool(__comp(*__i, *--__j))) + {} + std::iter_swap(__i, __j); + std::reverse(__ii, __last); + return true; + } + if (__i == __first) + { + std::reverse(__first, __last); + return false; + } + } + } + + /** + * @brief Permute range into the previous "dictionary" ordering. + * @ingroup sorting_algorithms + * @param first Start of range. + * @param last End of range. + * @return False if wrapped to last permutation, true otherwise. + * + * Treats all permutations of the range as a set of "dictionary" sorted + * sequences. Permutes the current sequence into the previous one of this + * set. Returns true if there are more sequences to generate. If the + * sequence is the smallest of the set, the largest is generated and false + * returned. + */ + template + bool + prev_permutation(_BidirectionalIterator __first, + _BidirectionalIterator __last) + { + // concept requirements + __glibcxx_function_requires(_BidirectionalIteratorConcept< + _BidirectionalIterator>) + __glibcxx_function_requires(_LessThanComparableConcept< + typename iterator_traits<_BidirectionalIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return false; + _BidirectionalIterator __i = __first; + ++__i; + if (__i == __last) + return false; + __i = __last; + --__i; + + for(;;) + { + _BidirectionalIterator __ii = __i; + --__i; + if (*__ii < *__i) + { + _BidirectionalIterator __j = __last; + while (!(*--__j < *__i)) + {} + std::iter_swap(__i, __j); + std::reverse(__ii, __last); + return true; + } + if (__i == __first) + { + std::reverse(__first, __last); + return false; + } + } + } + + /** + * @brief Permute range into the previous "dictionary" ordering using + * comparison functor. + * @ingroup sorting_algorithms + * @param first Start of range. + * @param last End of range. + * @param comp A comparison functor. + * @return False if wrapped to last permutation, true otherwise. + * + * Treats all permutations of the range [first,last) as a set of + * "dictionary" sorted sequences ordered by @a comp. Permutes the current + * sequence into the previous one of this set. Returns true if there are + * more sequences to generate. If the sequence is the smallest of the set, + * the largest is generated and false returned. + */ + template + bool + prev_permutation(_BidirectionalIterator __first, + _BidirectionalIterator __last, _Compare __comp) + { + // concept requirements + __glibcxx_function_requires(_BidirectionalIteratorConcept< + _BidirectionalIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + typename iterator_traits<_BidirectionalIterator>::value_type, + typename iterator_traits<_BidirectionalIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return false; + _BidirectionalIterator __i = __first; + ++__i; + if (__i == __last) + return false; + __i = __last; + --__i; + + for(;;) + { + _BidirectionalIterator __ii = __i; + --__i; + if (__comp(*__ii, *__i)) + { + _BidirectionalIterator __j = __last; + while (!bool(__comp(*--__j, *__i))) + {} + std::iter_swap(__i, __j); + std::reverse(__ii, __last); + return true; + } + if (__i == __first) + { + std::reverse(__first, __last); + return false; + } + } + } + + // replace + // replace_if + + /** + * @brief Copy a sequence, replacing each element of one value with another + * value. + * @param first An input iterator. + * @param last An input iterator. + * @param result An output iterator. + * @param old_value The value to be replaced. + * @param new_value The replacement value. + * @return The end of the output sequence, @p result+(last-first). + * + * Copies each element in the input range @p [first,last) to the + * output range @p [result,result+(last-first)) replacing elements + * equal to @p old_value with @p new_value. + */ + template + _OutputIterator + replace_copy(_InputIterator __first, _InputIterator __last, + _OutputIterator __result, + const _Tp& __old_value, const _Tp& __new_value) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_function_requires(_EqualOpConcept< + typename iterator_traits<_InputIterator>::value_type, _Tp>) + __glibcxx_requires_valid_range(__first, __last); + + for (; __first != __last; ++__first, ++__result) + if (*__first == __old_value) + *__result = __new_value; + else + *__result = *__first; + return __result; + } + + /** + * @brief Copy a sequence, replacing each value for which a predicate + * returns true with another value. + * @ingroup mutating_algorithms + * @param first An input iterator. + * @param last An input iterator. + * @param result An output iterator. + * @param pred A predicate. + * @param new_value The replacement value. + * @return The end of the output sequence, @p result+(last-first). + * + * Copies each element in the range @p [first,last) to the range + * @p [result,result+(last-first)) replacing elements for which + * @p pred returns true with @p new_value. + */ + template + _OutputIterator + replace_copy_if(_InputIterator __first, _InputIterator __last, + _OutputIterator __result, + _Predicate __pred, const _Tp& __new_value) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + for (; __first != __last; ++__first, ++__result) + if (__pred(*__first)) + *__result = __new_value; + else + *__result = *__first; + return __result; + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Determines whether the elements of a sequence are sorted. + * @ingroup sorting_algorithms + * @param first An iterator. + * @param last Another iterator. + * @return True if the elements are sorted, false otherwise. + */ + template + inline bool + is_sorted(_ForwardIterator __first, _ForwardIterator __last) + { return std::is_sorted_until(__first, __last) == __last; } + + /** + * @brief Determines whether the elements of a sequence are sorted + * according to a comparison functor. + * @ingroup sorting_algorithms + * @param first An iterator. + * @param last Another iterator. + * @param comp A comparison functor. + * @return True if the elements are sorted, false otherwise. + */ + template + inline bool + is_sorted(_ForwardIterator __first, _ForwardIterator __last, + _Compare __comp) + { return std::is_sorted_until(__first, __last, __comp) == __last; } + + /** + * @brief Determines the end of a sorted sequence. + * @ingroup sorting_algorithms + * @param first An iterator. + * @param last Another iterator. + * @return An iterator pointing to the last iterator i in [first, last) + * for which the range [first, i) is sorted. + */ + template + _ForwardIterator + is_sorted_until(_ForwardIterator __first, _ForwardIterator __last) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_LessThanComparableConcept< + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return __last; + + _ForwardIterator __next = __first; + for (++__next; __next != __last; __first = __next, ++__next) + if (*__next < *__first) + return __next; + return __next; + } + + /** + * @brief Determines the end of a sorted sequence using comparison functor. + * @ingroup sorting_algorithms + * @param first An iterator. + * @param last Another iterator. + * @param comp A comparison functor. + * @return An iterator pointing to the last iterator i in [first, last) + * for which the range [first, i) is sorted. + */ + template + _ForwardIterator + is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, + _Compare __comp) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + typename iterator_traits<_ForwardIterator>::value_type, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return __last; + + _ForwardIterator __next = __first; + for (++__next; __next != __last; __first = __next, ++__next) + if (__comp(*__next, *__first)) + return __next; + return __next; + } + + /** + * @brief Determines min and max at once as an ordered pair. + * @ingroup sorting_algorithms + * @param a A thing of arbitrary type. + * @param b Another thing of arbitrary type. + * @return A pair(b, a) if b is smaller than a, pair(a, b) otherwise. + */ + template + inline pair + minmax(const _Tp& __a, const _Tp& __b) + { + // concept requirements + __glibcxx_function_requires(_LessThanComparableConcept<_Tp>) + + return __b < __a ? pair(__b, __a) + : pair(__a, __b); + } + + /** + * @brief Determines min and max at once as an ordered pair. + * @ingroup sorting_algorithms + * @param a A thing of arbitrary type. + * @param b Another thing of arbitrary type. + * @param comp A @link comparison_functor comparison functor@endlink. + * @return A pair(b, a) if b is smaller than a, pair(a, b) otherwise. + */ + template + inline pair + minmax(const _Tp& __a, const _Tp& __b, _Compare __comp) + { + return __comp(__b, __a) ? pair(__b, __a) + : pair(__a, __b); + } + + /** + * @brief Return a pair of iterators pointing to the minimum and maximum + * elements in a range. + * @ingroup sorting_algorithms + * @param first Start of range. + * @param last End of range. + * @return make_pair(m, M), where m is the first iterator i in + * [first, last) such that no other element in the range is + * smaller, and where M is the last iterator i in [first, last) + * such that no other element in the range is larger. + */ + template + pair<_ForwardIterator, _ForwardIterator> + minmax_element(_ForwardIterator __first, _ForwardIterator __last) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_LessThanComparableConcept< + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + _ForwardIterator __next = __first; + if (__first == __last + || ++__next == __last) + return std::make_pair(__first, __first); + + _ForwardIterator __min, __max; + if (*__next < *__first) + { + __min = __next; + __max = __first; + } + else + { + __min = __first; + __max = __next; + } + + __first = __next; + ++__first; + + while (__first != __last) + { + __next = __first; + if (++__next == __last) + { + if (*__first < *__min) + __min = __first; + else if (!(*__first < *__max)) + __max = __first; + break; + } + + if (*__next < *__first) + { + if (*__next < *__min) + __min = __next; + if (!(*__first < *__max)) + __max = __first; + } + else + { + if (*__first < *__min) + __min = __first; + if (!(*__next < *__max)) + __max = __next; + } + + __first = __next; + ++__first; + } + + return std::make_pair(__min, __max); + } + + /** + * @brief Return a pair of iterators pointing to the minimum and maximum + * elements in a range. + * @ingroup sorting_algorithms + * @param first Start of range. + * @param last End of range. + * @param comp Comparison functor. + * @return make_pair(m, M), where m is the first iterator i in + * [first, last) such that no other element in the range is + * smaller, and where M is the last iterator i in [first, last) + * such that no other element in the range is larger. + */ + template + pair<_ForwardIterator, _ForwardIterator> + minmax_element(_ForwardIterator __first, _ForwardIterator __last, + _Compare __comp) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + typename iterator_traits<_ForwardIterator>::value_type, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + _ForwardIterator __next = __first; + if (__first == __last + || ++__next == __last) + return std::make_pair(__first, __first); + + _ForwardIterator __min, __max; + if (__comp(*__next, *__first)) + { + __min = __next; + __max = __first; + } + else + { + __min = __first; + __max = __next; + } + + __first = __next; + ++__first; + + while (__first != __last) + { + __next = __first; + if (++__next == __last) + { + if (__comp(*__first, *__min)) + __min = __first; + else if (!__comp(*__first, *__max)) + __max = __first; + break; + } + + if (__comp(*__next, *__first)) + { + if (__comp(*__next, *__min)) + __min = __next; + if (!__comp(*__first, *__max)) + __max = __first; + } + else + { + if (__comp(*__first, *__min)) + __min = __first; + if (!__comp(*__next, *__max)) + __max = __next; + } + + __first = __next; + ++__first; + } + + return std::make_pair(__min, __max); + } + + // N2722 + fixes. + template + inline _Tp + min(initializer_list<_Tp> __l) + { return *std::min_element(__l.begin(), __l.end()); } + + template + inline _Tp + min(initializer_list<_Tp> __l, _Compare __comp) + { return *std::min_element(__l.begin(), __l.end(), __comp); } + + template + inline _Tp + max(initializer_list<_Tp> __l) + { return *std::max_element(__l.begin(), __l.end()); } + + template + inline _Tp + max(initializer_list<_Tp> __l, _Compare __comp) + { return *std::max_element(__l.begin(), __l.end(), __comp); } + + template + inline pair<_Tp, _Tp> + minmax(initializer_list<_Tp> __l) + { + pair __p = + std::minmax_element(__l.begin(), __l.end()); + return std::make_pair(*__p.first, *__p.second); + } + + template + inline pair<_Tp, _Tp> + minmax(initializer_list<_Tp> __l, _Compare __comp) + { + pair __p = + std::minmax_element(__l.begin(), __l.end(), __comp); + return std::make_pair(*__p.first, *__p.second); + } +#endif // __GXX_EXPERIMENTAL_CXX0X__ + +_GLIBCXX_END_NAMESPACE + +_GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_P) + + /** + * @brief Apply a function to every element of a sequence. + * @ingroup non_mutating_algorithms + * @param first An input iterator. + * @param last An input iterator. + * @param f A unary function object. + * @return @p f. + * + * Applies the function object @p f to each element in the range + * @p [first,last). @p f must not modify the order of the sequence. + * If @p f has a return value it is ignored. + */ + template + _Function + for_each(_InputIterator __first, _InputIterator __last, _Function __f) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_requires_valid_range(__first, __last); + for (; __first != __last; ++__first) + __f(*__first); + return __f; + } + + /** + * @brief Find the first occurrence of a value in a sequence. + * @ingroup non_mutating_algorithms + * @param first An input iterator. + * @param last An input iterator. + * @param val The value to find. + * @return The first iterator @c i in the range @p [first,last) + * such that @c *i == @p val, or @p last if no such iterator exists. + */ + template + inline _InputIterator + find(_InputIterator __first, _InputIterator __last, + const _Tp& __val) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_EqualOpConcept< + typename iterator_traits<_InputIterator>::value_type, _Tp>) + __glibcxx_requires_valid_range(__first, __last); + return std::__find(__first, __last, __val, + std::__iterator_category(__first)); + } + + /** + * @brief Find the first element in a sequence for which a + * predicate is true. + * @ingroup non_mutating_algorithms + * @param first An input iterator. + * @param last An input iterator. + * @param pred A predicate. + * @return The first iterator @c i in the range @p [first,last) + * such that @p pred(*i) is true, or @p last if no such iterator exists. + */ + template + inline _InputIterator + find_if(_InputIterator __first, _InputIterator __last, + _Predicate __pred) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + return std::__find_if(__first, __last, __pred, + std::__iterator_category(__first)); + } + + /** + * @brief Find element from a set in a sequence. + * @ingroup non_mutating_algorithms + * @param first1 Start of range to search. + * @param last1 End of range to search. + * @param first2 Start of match candidates. + * @param last2 End of match candidates. + * @return The first iterator @c i in the range + * @p [first1,last1) such that @c *i == @p *(i2) such that i2 is an + * iterator in [first2,last2), or @p last1 if no such iterator exists. + * + * Searches the range @p [first1,last1) for an element that is equal to + * some element in the range [first2,last2). If found, returns an iterator + * in the range [first1,last1), otherwise returns @p last1. + */ + template + _InputIterator + find_first_of(_InputIterator __first1, _InputIterator __last1, + _ForwardIterator __first2, _ForwardIterator __last2) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_EqualOpConcept< + typename iterator_traits<_InputIterator>::value_type, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first1, __last1); + __glibcxx_requires_valid_range(__first2, __last2); + + for (; __first1 != __last1; ++__first1) + for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter) + if (*__first1 == *__iter) + return __first1; + return __last1; + } + + /** + * @brief Find element from a set in a sequence using a predicate. + * @ingroup non_mutating_algorithms + * @param first1 Start of range to search. + * @param last1 End of range to search. + * @param first2 Start of match candidates. + * @param last2 End of match candidates. + * @param comp Predicate to use. + * @return The first iterator @c i in the range + * @p [first1,last1) such that @c comp(*i, @p *(i2)) is true and i2 is an + * iterator in [first2,last2), or @p last1 if no such iterator exists. + * + + * Searches the range @p [first1,last1) for an element that is + * equal to some element in the range [first2,last2). If found, + * returns an iterator in the range [first1,last1), otherwise + * returns @p last1. + */ + template + _InputIterator + find_first_of(_InputIterator __first1, _InputIterator __last1, + _ForwardIterator __first2, _ForwardIterator __last2, + _BinaryPredicate __comp) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, + typename iterator_traits<_InputIterator>::value_type, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first1, __last1); + __glibcxx_requires_valid_range(__first2, __last2); + + for (; __first1 != __last1; ++__first1) + for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter) + if (__comp(*__first1, *__iter)) + return __first1; + return __last1; + } + + /** + * @brief Find two adjacent values in a sequence that are equal. + * @ingroup non_mutating_algorithms + * @param first A forward iterator. + * @param last A forward iterator. + * @return The first iterator @c i such that @c i and @c i+1 are both + * valid iterators in @p [first,last) and such that @c *i == @c *(i+1), + * or @p last if no such iterator exists. + */ + template + _ForwardIterator + adjacent_find(_ForwardIterator __first, _ForwardIterator __last) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_EqualityComparableConcept< + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + if (__first == __last) + return __last; + _ForwardIterator __next = __first; + while(++__next != __last) + { + if (*__first == *__next) + return __first; + __first = __next; + } + return __last; + } + + /** + * @brief Find two adjacent values in a sequence using a predicate. + * @ingroup non_mutating_algorithms + * @param first A forward iterator. + * @param last A forward iterator. + * @param binary_pred A binary predicate. + * @return The first iterator @c i such that @c i and @c i+1 are both + * valid iterators in @p [first,last) and such that + * @p binary_pred(*i,*(i+1)) is true, or @p last if no such iterator + * exists. + */ + template + _ForwardIterator + adjacent_find(_ForwardIterator __first, _ForwardIterator __last, + _BinaryPredicate __binary_pred) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, + typename iterator_traits<_ForwardIterator>::value_type, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + if (__first == __last) + return __last; + _ForwardIterator __next = __first; + while(++__next != __last) + { + if (__binary_pred(*__first, *__next)) + return __first; + __first = __next; + } + return __last; + } + + /** + * @brief Count the number of copies of a value in a sequence. + * @ingroup non_mutating_algorithms + * @param first An input iterator. + * @param last An input iterator. + * @param value The value to be counted. + * @return The number of iterators @c i in the range @p [first,last) + * for which @c *i == @p value + */ + template + typename iterator_traits<_InputIterator>::difference_type + count(_InputIterator __first, _InputIterator __last, const _Tp& __value) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_EqualOpConcept< + typename iterator_traits<_InputIterator>::value_type, _Tp>) + __glibcxx_requires_valid_range(__first, __last); + typename iterator_traits<_InputIterator>::difference_type __n = 0; + for (; __first != __last; ++__first) + if (*__first == __value) + ++__n; + return __n; + } + + /** + * @brief Count the elements of a sequence for which a predicate is true. + * @ingroup non_mutating_algorithms + * @param first An input iterator. + * @param last An input iterator. + * @param pred A predicate. + * @return The number of iterators @c i in the range @p [first,last) + * for which @p pred(*i) is true. + */ + template + typename iterator_traits<_InputIterator>::difference_type + count_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + typename iterator_traits<_InputIterator>::difference_type __n = 0; + for (; __first != __last; ++__first) + if (__pred(*__first)) + ++__n; + return __n; + } + + /** + * @brief Search a sequence for a matching sub-sequence. + * @ingroup non_mutating_algorithms + * @param first1 A forward iterator. + * @param last1 A forward iterator. + * @param first2 A forward iterator. + * @param last2 A forward iterator. + * @return The first iterator @c i in the range + * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N) + * for each @c N in the range @p [0,last2-first2), or @p last1 if no + * such iterator exists. + * + * Searches the range @p [first1,last1) for a sub-sequence that compares + * equal value-by-value with the sequence given by @p [first2,last2) and + * returns an iterator to the first element of the sub-sequence, or + * @p last1 if the sub-sequence is not found. + * + * Because the sub-sequence must lie completely within the range + * @p [first1,last1) it must start at a position less than + * @p last1-(last2-first2) where @p last2-first2 is the length of the + * sub-sequence. + * This means that the returned iterator @c i will be in the range + * @p [first1,last1-(last2-first2)) + */ + template + _ForwardIterator1 + search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, + _ForwardIterator2 __first2, _ForwardIterator2 __last2) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>) + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>) + __glibcxx_function_requires(_EqualOpConcept< + typename iterator_traits<_ForwardIterator1>::value_type, + typename iterator_traits<_ForwardIterator2>::value_type>) + __glibcxx_requires_valid_range(__first1, __last1); + __glibcxx_requires_valid_range(__first2, __last2); + + // Test for empty ranges + if (__first1 == __last1 || __first2 == __last2) + return __first1; + + // Test for a pattern of length 1. + _ForwardIterator2 __p1(__first2); + if (++__p1 == __last2) + return _GLIBCXX_STD_P::find(__first1, __last1, *__first2); + + // General case. + _ForwardIterator2 __p; + _ForwardIterator1 __current = __first1; + + for (;;) + { + __first1 = _GLIBCXX_STD_P::find(__first1, __last1, *__first2); + if (__first1 == __last1) + return __last1; + + __p = __p1; + __current = __first1; + if (++__current == __last1) + return __last1; + + while (*__current == *__p) + { + if (++__p == __last2) + return __first1; + if (++__current == __last1) + return __last1; + } + ++__first1; + } + return __first1; + } + + /** + * @brief Search a sequence for a matching sub-sequence using a predicate. + * @ingroup non_mutating_algorithms + * @param first1 A forward iterator. + * @param last1 A forward iterator. + * @param first2 A forward iterator. + * @param last2 A forward iterator. + * @param predicate A binary predicate. + * @return The first iterator @c i in the range + * @p [first1,last1-(last2-first2)) such that + * @p predicate(*(i+N),*(first2+N)) is true for each @c N in the range + * @p [0,last2-first2), or @p last1 if no such iterator exists. + * + * Searches the range @p [first1,last1) for a sub-sequence that compares + * equal value-by-value with the sequence given by @p [first2,last2), + * using @p predicate to determine equality, and returns an iterator + * to the first element of the sub-sequence, or @p last1 if no such + * iterator exists. + * + * @see search(_ForwardIter1, _ForwardIter1, _ForwardIter2, _ForwardIter2) + */ + template + _ForwardIterator1 + search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, + _ForwardIterator2 __first2, _ForwardIterator2 __last2, + _BinaryPredicate __predicate) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>) + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>) + __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, + typename iterator_traits<_ForwardIterator1>::value_type, + typename iterator_traits<_ForwardIterator2>::value_type>) + __glibcxx_requires_valid_range(__first1, __last1); + __glibcxx_requires_valid_range(__first2, __last2); + + // Test for empty ranges + if (__first1 == __last1 || __first2 == __last2) + return __first1; + + // Test for a pattern of length 1. + _ForwardIterator2 __p1(__first2); + if (++__p1 == __last2) + { + while (__first1 != __last1 + && !bool(__predicate(*__first1, *__first2))) + ++__first1; + return __first1; + } + + // General case. + _ForwardIterator2 __p; + _ForwardIterator1 __current = __first1; + + for (;;) + { + while (__first1 != __last1 + && !bool(__predicate(*__first1, *__first2))) + ++__first1; + if (__first1 == __last1) + return __last1; + + __p = __p1; + __current = __first1; + if (++__current == __last1) + return __last1; + + while (__predicate(*__current, *__p)) + { + if (++__p == __last2) + return __first1; + if (++__current == __last1) + return __last1; + } + ++__first1; + } + return __first1; + } + + + /** + * @brief Search a sequence for a number of consecutive values. + * @ingroup non_mutating_algorithms + * @param first A forward iterator. + * @param last A forward iterator. + * @param count The number of consecutive values. + * @param val The value to find. + * @return The first iterator @c i in the range @p [first,last-count) + * such that @c *(i+N) == @p val for each @c N in the range @p [0,count), + * or @p last if no such iterator exists. + * + * Searches the range @p [first,last) for @p count consecutive elements + * equal to @p val. + */ + template + _ForwardIterator + search_n(_ForwardIterator __first, _ForwardIterator __last, + _Integer __count, const _Tp& __val) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_EqualOpConcept< + typename iterator_traits<_ForwardIterator>::value_type, _Tp>) + __glibcxx_requires_valid_range(__first, __last); + + if (__count <= 0) + return __first; + if (__count == 1) + return _GLIBCXX_STD_P::find(__first, __last, __val); + return std::__search_n(__first, __last, __count, __val, + std::__iterator_category(__first)); + } + + + /** + * @brief Search a sequence for a number of consecutive values using a + * predicate. + * @ingroup non_mutating_algorithms + * @param first A forward iterator. + * @param last A forward iterator. + * @param count The number of consecutive values. + * @param val The value to find. + * @param binary_pred A binary predicate. + * @return The first iterator @c i in the range @p [first,last-count) + * such that @p binary_pred(*(i+N),val) is true for each @c N in the + * range @p [0,count), or @p last if no such iterator exists. + * + * Searches the range @p [first,last) for @p count consecutive elements + * for which the predicate returns true. + */ + template + _ForwardIterator + search_n(_ForwardIterator __first, _ForwardIterator __last, + _Integer __count, const _Tp& __val, + _BinaryPredicate __binary_pred) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, + typename iterator_traits<_ForwardIterator>::value_type, _Tp>) + __glibcxx_requires_valid_range(__first, __last); + + if (__count <= 0) + return __first; + if (__count == 1) + { + while (__first != __last && !bool(__binary_pred(*__first, __val))) + ++__first; + return __first; + } + return std::__search_n(__first, __last, __count, __val, __binary_pred, + std::__iterator_category(__first)); + } + + + /** + * @brief Perform an operation on a sequence. + * @ingroup mutating_algorithms + * @param first An input iterator. + * @param last An input iterator. + * @param result An output iterator. + * @param unary_op A unary operator. + * @return An output iterator equal to @p result+(last-first). + * + * Applies the operator to each element in the input range and assigns + * the results to successive elements of the output sequence. + * Evaluates @p *(result+N)=unary_op(*(first+N)) for each @c N in the + * range @p [0,last-first). + * + * @p unary_op must not alter its argument. + */ + template + _OutputIterator + transform(_InputIterator __first, _InputIterator __last, + _OutputIterator __result, _UnaryOperation __unary_op) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + // "the type returned by a _UnaryOperation" + __typeof__(__unary_op(*__first))>) + __glibcxx_requires_valid_range(__first, __last); + + for (; __first != __last; ++__first, ++__result) + *__result = __unary_op(*__first); + return __result; + } + + /** + * @brief Perform an operation on corresponding elements of two sequences. + * @ingroup mutating_algorithms + * @param first1 An input iterator. + * @param last1 An input iterator. + * @param first2 An input iterator. + * @param result An output iterator. + * @param binary_op A binary operator. + * @return An output iterator equal to @p result+(last-first). + * + * Applies the operator to the corresponding elements in the two + * input ranges and assigns the results to successive elements of the + * output sequence. + * Evaluates @p *(result+N)=binary_op(*(first1+N),*(first2+N)) for each + * @c N in the range @p [0,last1-first1). + * + * @p binary_op must not alter either of its arguments. + */ + template + _OutputIterator + transform(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _OutputIterator __result, + _BinaryOperation __binary_op) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + // "the type returned by a _BinaryOperation" + __typeof__(__binary_op(*__first1,*__first2))>) + __glibcxx_requires_valid_range(__first1, __last1); + + for (; __first1 != __last1; ++__first1, ++__first2, ++__result) + *__result = __binary_op(*__first1, *__first2); + return __result; + } + + /** + * @brief Replace each occurrence of one value in a sequence with another + * value. + * @ingroup mutating_algorithms + * @param first A forward iterator. + * @param last A forward iterator. + * @param old_value The value to be replaced. + * @param new_value The replacement value. + * @return replace() returns no value. + * + * For each iterator @c i in the range @p [first,last) if @c *i == + * @p old_value then the assignment @c *i = @p new_value is performed. + */ + template + void + replace(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __old_value, const _Tp& __new_value) + { + // concept requirements + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator>) + __glibcxx_function_requires(_EqualOpConcept< + typename iterator_traits<_ForwardIterator>::value_type, _Tp>) + __glibcxx_function_requires(_ConvertibleConcept<_Tp, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + for (; __first != __last; ++__first) + if (*__first == __old_value) + *__first = __new_value; + } + + /** + * @brief Replace each value in a sequence for which a predicate returns + * true with another value. + * @ingroup mutating_algorithms + * @param first A forward iterator. + * @param last A forward iterator. + * @param pred A predicate. + * @param new_value The replacement value. + * @return replace_if() returns no value. + * + * For each iterator @c i in the range @p [first,last) if @p pred(*i) + * is true then the assignment @c *i = @p new_value is performed. + */ + template + void + replace_if(_ForwardIterator __first, _ForwardIterator __last, + _Predicate __pred, const _Tp& __new_value) + { + // concept requirements + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator>) + __glibcxx_function_requires(_ConvertibleConcept<_Tp, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + for (; __first != __last; ++__first) + if (__pred(*__first)) + *__first = __new_value; + } + + /** + * @brief Assign the result of a function object to each value in a + * sequence. + * @ingroup mutating_algorithms + * @param first A forward iterator. + * @param last A forward iterator. + * @param gen A function object taking no arguments and returning + * std::iterator_traits<_ForwardIterator>::value_type + * @return generate() returns no value. + * + * Performs the assignment @c *i = @p gen() for each @c i in the range + * @p [first,last). + */ + template + void + generate(_ForwardIterator __first, _ForwardIterator __last, + _Generator __gen) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_GeneratorConcept<_Generator, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + for (; __first != __last; ++__first) + *__first = __gen(); + } + + /** + * @brief Assign the result of a function object to each value in a + * sequence. + * @ingroup mutating_algorithms + * @param first A forward iterator. + * @param n The length of the sequence. + * @param gen A function object taking no arguments and returning + * std::iterator_traits<_ForwardIterator>::value_type + * @return The end of the sequence, @p first+n + * + * Performs the assignment @c *i = @p gen() for each @c i in the range + * @p [first,first+n). + */ + template + _OutputIterator + generate_n(_OutputIterator __first, _Size __n, _Generator __gen) + { + // concept requirements + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + // "the type returned by a _Generator" + __typeof__(__gen())>) + + for (; __n > 0; --__n, ++__first) + *__first = __gen(); + return __first; + } + + + /** + * @brief Copy a sequence, removing consecutive duplicate values. + * @ingroup mutating_algorithms + * @param first An input iterator. + * @param last An input iterator. + * @param result An output iterator. + * @return An iterator designating the end of the resulting sequence. + * + * Copies each element in the range @p [first,last) to the range + * beginning at @p result, except that only the first element is copied + * from groups of consecutive elements that compare equal. + * unique_copy() is stable, so the relative order of elements that are + * copied is unchanged. + * + * _GLIBCXX_RESOLVE_LIB_DEFECTS + * DR 241. Does unique_copy() require CopyConstructible and Assignable? + * + * _GLIBCXX_RESOLVE_LIB_DEFECTS + * DR 538. 241 again: Does unique_copy() require CopyConstructible and + * Assignable? + */ + template + inline _OutputIterator + unique_copy(_InputIterator __first, _InputIterator __last, + _OutputIterator __result) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_function_requires(_EqualityComparableConcept< + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return __result; + return std::__unique_copy(__first, __last, __result, + std::__iterator_category(__first), + std::__iterator_category(__result)); + } + + /** + * @brief Copy a sequence, removing consecutive values using a predicate. + * @ingroup mutating_algorithms + * @param first An input iterator. + * @param last An input iterator. + * @param result An output iterator. + * @param binary_pred A binary predicate. + * @return An iterator designating the end of the resulting sequence. + * + * Copies each element in the range @p [first,last) to the range + * beginning at @p result, except that only the first element is copied + * from groups of consecutive elements for which @p binary_pred returns + * true. + * unique_copy() is stable, so the relative order of elements that are + * copied is unchanged. + * + * _GLIBCXX_RESOLVE_LIB_DEFECTS + * DR 241. Does unique_copy() require CopyConstructible and Assignable? + */ + template + inline _OutputIterator + unique_copy(_InputIterator __first, _InputIterator __last, + _OutputIterator __result, + _BinaryPredicate __binary_pred) + { + // concept requirements -- predicates checked later + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return __result; + return std::__unique_copy(__first, __last, __result, __binary_pred, + std::__iterator_category(__first), + std::__iterator_category(__result)); + } + + + /** + * @brief Randomly shuffle the elements of a sequence. + * @ingroup mutating_algorithms + * @param first A forward iterator. + * @param last A forward iterator. + * @return Nothing. + * + * Reorder the elements in the range @p [first,last) using a random + * distribution, so that every possible ordering of the sequence is + * equally likely. + */ + template + inline void + random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) + { + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first != __last) + for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) + std::iter_swap(__i, __first + (std::rand() % ((__i - __first) + 1))); + } + + /** + * @brief Shuffle the elements of a sequence using a random number + * generator. + * @ingroup mutating_algorithms + * @param first A forward iterator. + * @param last A forward iterator. + * @param rand The RNG functor or function. + * @return Nothing. + * + * Reorders the elements in the range @p [first,last) using @p rand to + * provide a random distribution. Calling @p rand(N) for a positive + * integer @p N should return a randomly chosen integer from the + * range [0,N). + */ + template + void + random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, + _RandomNumberGenerator& __rand) + { + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return; + for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) + std::iter_swap(__i, __first + __rand((__i - __first) + 1)); + } + + + /** + * @brief Move elements for which a predicate is true to the beginning + * of a sequence. + * @ingroup mutating_algorithms + * @param first A forward iterator. + * @param last A forward iterator. + * @param pred A predicate functor. + * @return An iterator @p middle such that @p pred(i) is true for each + * iterator @p i in the range @p [first,middle) and false for each @p i + * in the range @p [middle,last). + * + * @p pred must not modify its operand. @p partition() does not preserve + * the relative ordering of elements in each group, use + * @p stable_partition() if this is needed. + */ + template + inline _ForwardIterator + partition(_ForwardIterator __first, _ForwardIterator __last, + _Predicate __pred) + { + // concept requirements + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator>) + __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + return std::__partition(__first, __last, __pred, + std::__iterator_category(__first)); + } + + + + /** + * @brief Sort the smallest elements of a sequence. + * @ingroup sorting_algorithms + * @param first An iterator. + * @param middle Another iterator. + * @param last Another iterator. + * @return Nothing. + * + * Sorts the smallest @p (middle-first) elements in the range + * @p [first,last) and moves them to the range @p [first,middle). The + * order of the remaining elements in the range @p [middle,last) is + * undefined. + * After the sort if @p i and @j are iterators in the range + * @p [first,middle) such that @i precedes @j and @k is an iterator in + * the range @p [middle,last) then @p *j<*i and @p *k<*i are both false. + */ + template + inline void + partial_sort(_RandomAccessIterator __first, + _RandomAccessIterator __middle, + _RandomAccessIterator __last) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) + __glibcxx_requires_valid_range(__first, __middle); + __glibcxx_requires_valid_range(__middle, __last); + + std::__heap_select(__first, __middle, __last); + std::sort_heap(__first, __middle); + } + + /** + * @brief Sort the smallest elements of a sequence using a predicate + * for comparison. + * @ingroup sorting_algorithms + * @param first An iterator. + * @param middle Another iterator. + * @param last Another iterator. + * @param comp A comparison functor. + * @return Nothing. + * + * Sorts the smallest @p (middle-first) elements in the range + * @p [first,last) and moves them to the range @p [first,middle). The + * order of the remaining elements in the range @p [middle,last) is + * undefined. + * After the sort if @p i and @j are iterators in the range + * @p [first,middle) such that @i precedes @j and @k is an iterator in + * the range @p [middle,last) then @p *comp(j,*i) and @p comp(*k,*i) + * are both false. + */ + template + inline void + partial_sort(_RandomAccessIterator __first, + _RandomAccessIterator __middle, + _RandomAccessIterator __last, + _Compare __comp) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType, _ValueType>) + __glibcxx_requires_valid_range(__first, __middle); + __glibcxx_requires_valid_range(__middle, __last); + + std::__heap_select(__first, __middle, __last, __comp); + std::sort_heap(__first, __middle, __comp); + } + + /** + * @brief Sort a sequence just enough to find a particular position. + * @ingroup sorting_algorithms + * @param first An iterator. + * @param nth Another iterator. + * @param last Another iterator. + * @return Nothing. + * + * Rearranges the elements in the range @p [first,last) so that @p *nth + * is the same element that would have been in that position had the + * whole sequence been sorted. + * whole sequence been sorted. The elements either side of @p *nth are + * not completely sorted, but for any iterator @i in the range + * @p [first,nth) and any iterator @j in the range @p [nth,last) it + * holds that @p *j<*i is false. + */ + template + inline void + nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, + _RandomAccessIterator __last) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) + __glibcxx_requires_valid_range(__first, __nth); + __glibcxx_requires_valid_range(__nth, __last); + + if (__first == __last || __nth == __last) + return; + + std::__introselect(__first, __nth, __last, + std::__lg(__last - __first) * 2); + } + + /** + * @brief Sort a sequence just enough to find a particular position + * using a predicate for comparison. + * @ingroup sorting_algorithms + * @param first An iterator. + * @param nth Another iterator. + * @param last Another iterator. + * @param comp A comparison functor. + * @return Nothing. + * + * Rearranges the elements in the range @p [first,last) so that @p *nth + * is the same element that would have been in that position had the + * whole sequence been sorted. The elements either side of @p *nth are + * not completely sorted, but for any iterator @i in the range + * @p [first,nth) and any iterator @j in the range @p [nth,last) it + * holds that @p comp(*j,*i) is false. + */ + template + inline void + nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, + _RandomAccessIterator __last, _Compare __comp) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType, _ValueType>) + __glibcxx_requires_valid_range(__first, __nth); + __glibcxx_requires_valid_range(__nth, __last); + + if (__first == __last || __nth == __last) + return; + + std::__introselect(__first, __nth, __last, + std::__lg(__last - __first) * 2, __comp); + } + + + /** + * @brief Sort the elements of a sequence. + * @ingroup sorting_algorithms + * @param first An iterator. + * @param last Another iterator. + * @return Nothing. + * + * Sorts the elements in the range @p [first,last) in ascending order, + * such that @p *(i+1)<*i is false for each iterator @p i in the range + * @p [first,last-1). + * + * The relative ordering of equivalent elements is not preserved, use + * @p stable_sort() if this is needed. + */ + template + inline void + sort(_RandomAccessIterator __first, _RandomAccessIterator __last) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first != __last) + { + std::__introsort_loop(__first, __last, + std::__lg(__last - __first) * 2); + std::__final_insertion_sort(__first, __last); + } + } + + /** + * @brief Sort the elements of a sequence using a predicate for comparison. + * @ingroup sorting_algorithms + * @param first An iterator. + * @param last Another iterator. + * @param comp A comparison functor. + * @return Nothing. + * + * Sorts the elements in the range @p [first,last) in ascending order, + * such that @p comp(*(i+1),*i) is false for every iterator @p i in the + * range @p [first,last-1). + * + * The relative ordering of equivalent elements is not preserved, use + * @p stable_sort() if this is needed. + */ + template + inline void + sort(_RandomAccessIterator __first, _RandomAccessIterator __last, + _Compare __comp) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, _ValueType, + _ValueType>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first != __last) + { + std::__introsort_loop(__first, __last, + std::__lg(__last - __first) * 2, __comp); + std::__final_insertion_sort(__first, __last, __comp); + } + } + + /** + * @brief Merges two sorted ranges. + * @ingroup sorting_algorithms + * @param first1 An iterator. + * @param first2 Another iterator. + * @param last1 Another iterator. + * @param last2 Another iterator. + * @param result An iterator pointing to the end of the merged range. + * @return An iterator pointing to the first element "not less + * than" @a val. + * + * Merges the ranges [first1,last1) and [first2,last2) into the sorted range + * [result, result + (last1-first1) + (last2-first2)). Both input ranges + * must be sorted, and the output range must not overlap with either of + * the input ranges. The sort is @e stable, that is, for equivalent + * elements in the two ranges, elements from the first range will always + * come before elements from the second. + */ + template + _OutputIterator + merge(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2, + _OutputIterator __result) + { + typedef typename iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_InputIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType1>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType2>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) + __glibcxx_requires_sorted_set(__first1, __last1, __first2); + __glibcxx_requires_sorted_set(__first2, __last2, __first1); + + while (__first1 != __last1 && __first2 != __last2) + { + if (*__first2 < *__first1) + { + *__result = *__first2; + ++__first2; + } + else + { + *__result = *__first1; + ++__first1; + } + ++__result; + } + return std::copy(__first2, __last2, std::copy(__first1, __last1, + __result)); + } + + /** + * @brief Merges two sorted ranges. + * @ingroup sorting_algorithms + * @param first1 An iterator. + * @param first2 Another iterator. + * @param last1 Another iterator. + * @param last2 Another iterator. + * @param result An iterator pointing to the end of the merged range. + * @param comp A functor to use for comparisons. + * @return An iterator pointing to the first element "not less + * than" @a val. + * + * Merges the ranges [first1,last1) and [first2,last2) into the sorted range + * [result, result + (last1-first1) + (last2-first2)). Both input ranges + * must be sorted, and the output range must not overlap with either of + * the input ranges. The sort is @e stable, that is, for equivalent + * elements in the two ranges, elements from the first range will always + * come before elements from the second. + * + * The comparison function should have the same effects on ordering as + * the function used for the initial sort. + */ + template + _OutputIterator + merge(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2, + _OutputIterator __result, _Compare __comp) + { + typedef typename iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_InputIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType1>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType2>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType2, _ValueType1>) + __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp); + __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp); + + while (__first1 != __last1 && __first2 != __last2) + { + if (__comp(*__first2, *__first1)) + { + *__result = *__first2; + ++__first2; + } + else + { + *__result = *__first1; + ++__first1; + } + ++__result; + } + return std::copy(__first2, __last2, std::copy(__first1, __last1, + __result)); + } + + + /** + * @brief Sort the elements of a sequence, preserving the relative order + * of equivalent elements. + * @ingroup sorting_algorithms + * @param first An iterator. + * @param last Another iterator. + * @return Nothing. + * + * Sorts the elements in the range @p [first,last) in ascending order, + * such that @p *(i+1)<*i is false for each iterator @p i in the range + * @p [first,last-1). + * + * The relative ordering of equivalent elements is preserved, so any two + * elements @p x and @p y in the range @p [first,last) such that + * @p x + inline void + stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) + __glibcxx_requires_valid_range(__first, __last); + + _Temporary_buffer<_RandomAccessIterator, _ValueType> __buf(__first, + __last); + if (__buf.begin() == 0) + std::__inplace_stable_sort(__first, __last); + else + std::__stable_sort_adaptive(__first, __last, __buf.begin(), + _DistanceType(__buf.size())); + } + + /** + * @brief Sort the elements of a sequence using a predicate for comparison, + * preserving the relative order of equivalent elements. + * @ingroup sorting_algorithms + * @param first An iterator. + * @param last Another iterator. + * @param comp A comparison functor. + * @return Nothing. + * + * Sorts the elements in the range @p [first,last) in ascending order, + * such that @p comp(*(i+1),*i) is false for each iterator @p i in the + * range @p [first,last-1). + * + * The relative ordering of equivalent elements is preserved, so any two + * elements @p x and @p y in the range @p [first,last) such that + * @p comp(x,y) is false and @p comp(y,x) is false will have the same + * relative ordering after calling @p stable_sort(). + */ + template + inline void + stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, + _Compare __comp) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType, + _ValueType>) + __glibcxx_requires_valid_range(__first, __last); + + _Temporary_buffer<_RandomAccessIterator, _ValueType> __buf(__first, + __last); + if (__buf.begin() == 0) + std::__inplace_stable_sort(__first, __last, __comp); + else + std::__stable_sort_adaptive(__first, __last, __buf.begin(), + _DistanceType(__buf.size()), __comp); + } + + + /** + * @brief Return the union of two sorted ranges. + * @ingroup set_algorithms + * @param first1 Start of first range. + * @param last1 End of first range. + * @param first2 Start of second range. + * @param last2 End of second range. + * @return End of the output range. + * @ingroup set_algorithms + * + * This operation iterates over both ranges, copying elements present in + * each range in order to the output range. Iterators increment for each + * range. When the current element of one range is less than the other, + * that element is copied and the iterator advanced. If an element is + * contained in both ranges, the element from the first range is copied and + * both ranges advance. The output range may not overlap either input + * range. + */ + template + _OutputIterator + set_union(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2, + _OutputIterator __result) + { + typedef typename iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_InputIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType1>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType2>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType1, _ValueType2>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) + __glibcxx_requires_sorted_set(__first1, __last1, __first2); + __glibcxx_requires_sorted_set(__first2, __last2, __first1); + + while (__first1 != __last1 && __first2 != __last2) + { + if (*__first1 < *__first2) + { + *__result = *__first1; + ++__first1; + } + else if (*__first2 < *__first1) + { + *__result = *__first2; + ++__first2; + } + else + { + *__result = *__first1; + ++__first1; + ++__first2; + } + ++__result; + } + return std::copy(__first2, __last2, std::copy(__first1, __last1, + __result)); + } + + /** + * @brief Return the union of two sorted ranges using a comparison functor. + * @ingroup set_algorithms + * @param first1 Start of first range. + * @param last1 End of first range. + * @param first2 Start of second range. + * @param last2 End of second range. + * @param comp The comparison functor. + * @return End of the output range. + * @ingroup set_algorithms + * + * This operation iterates over both ranges, copying elements present in + * each range in order to the output range. Iterators increment for each + * range. When the current element of one range is less than the other + * according to @a comp, that element is copied and the iterator advanced. + * If an equivalent element according to @a comp is contained in both + * ranges, the element from the first range is copied and both ranges + * advance. The output range may not overlap either input range. + */ + template + _OutputIterator + set_union(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2, + _OutputIterator __result, _Compare __comp) + { + typedef typename iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_InputIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType1>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType2>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType1, _ValueType2>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType2, _ValueType1>) + __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp); + __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp); + + while (__first1 != __last1 && __first2 != __last2) + { + if (__comp(*__first1, *__first2)) + { + *__result = *__first1; + ++__first1; + } + else if (__comp(*__first2, *__first1)) + { + *__result = *__first2; + ++__first2; + } + else + { + *__result = *__first1; + ++__first1; + ++__first2; + } + ++__result; + } + return std::copy(__first2, __last2, std::copy(__first1, __last1, + __result)); + } + + /** + * @brief Return the intersection of two sorted ranges. + * @ingroup set_algorithms + * @param first1 Start of first range. + * @param last1 End of first range. + * @param first2 Start of second range. + * @param last2 End of second range. + * @return End of the output range. + * @ingroup set_algorithms + * + * This operation iterates over both ranges, copying elements present in + * both ranges in order to the output range. Iterators increment for each + * range. When the current element of one range is less than the other, + * that iterator advances. If an element is contained in both ranges, the + * element from the first range is copied and both ranges advance. The + * output range may not overlap either input range. + */ + template + _OutputIterator + set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2, + _OutputIterator __result) + { + typedef typename iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_InputIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType1>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType1, _ValueType2>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) + __glibcxx_requires_sorted_set(__first1, __last1, __first2); + __glibcxx_requires_sorted_set(__first2, __last2, __first1); + + while (__first1 != __last1 && __first2 != __last2) + if (*__first1 < *__first2) + ++__first1; + else if (*__first2 < *__first1) + ++__first2; + else + { + *__result = *__first1; + ++__first1; + ++__first2; + ++__result; + } + return __result; + } + + /** + * @brief Return the intersection of two sorted ranges using comparison + * functor. + * @ingroup set_algorithms + * @param first1 Start of first range. + * @param last1 End of first range. + * @param first2 Start of second range. + * @param last2 End of second range. + * @param comp The comparison functor. + * @return End of the output range. + * @ingroup set_algorithms + * + * This operation iterates over both ranges, copying elements present in + * both ranges in order to the output range. Iterators increment for each + * range. When the current element of one range is less than the other + * according to @a comp, that iterator advances. If an element is + * contained in both ranges according to @a comp, the element from the + * first range is copied and both ranges advance. The output range may not + * overlap either input range. + */ + template + _OutputIterator + set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2, + _OutputIterator __result, _Compare __comp) + { + typedef typename iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_InputIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType1>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType1, _ValueType2>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType2, _ValueType1>) + __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp); + __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp); + + while (__first1 != __last1 && __first2 != __last2) + if (__comp(*__first1, *__first2)) + ++__first1; + else if (__comp(*__first2, *__first1)) + ++__first2; + else + { + *__result = *__first1; + ++__first1; + ++__first2; + ++__result; + } + return __result; + } + + /** + * @brief Return the difference of two sorted ranges. + * @ingroup set_algorithms + * @param first1 Start of first range. + * @param last1 End of first range. + * @param first2 Start of second range. + * @param last2 End of second range. + * @return End of the output range. + * @ingroup set_algorithms + * + * This operation iterates over both ranges, copying elements present in + * the first range but not the second in order to the output range. + * Iterators increment for each range. When the current element of the + * first range is less than the second, that element is copied and the + * iterator advances. If the current element of the second range is less, + * the iterator advances, but no element is copied. If an element is + * contained in both ranges, no elements are copied and both ranges + * advance. The output range may not overlap either input range. + */ + template + _OutputIterator + set_difference(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2, + _OutputIterator __result) + { + typedef typename iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_InputIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType1>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType1, _ValueType2>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) + __glibcxx_requires_sorted_set(__first1, __last1, __first2); + __glibcxx_requires_sorted_set(__first2, __last2, __first1); + + while (__first1 != __last1 && __first2 != __last2) + if (*__first1 < *__first2) + { + *__result = *__first1; + ++__first1; + ++__result; + } + else if (*__first2 < *__first1) + ++__first2; + else + { + ++__first1; + ++__first2; + } + return std::copy(__first1, __last1, __result); + } + + /** + * @brief Return the difference of two sorted ranges using comparison + * functor. + * @ingroup set_algorithms + * @param first1 Start of first range. + * @param last1 End of first range. + * @param first2 Start of second range. + * @param last2 End of second range. + * @param comp The comparison functor. + * @return End of the output range. + * @ingroup set_algorithms + * + * This operation iterates over both ranges, copying elements present in + * the first range but not the second in order to the output range. + * Iterators increment for each range. When the current element of the + * first range is less than the second according to @a comp, that element + * is copied and the iterator advances. If the current element of the + * second range is less, no element is copied and the iterator advances. + * If an element is contained in both ranges according to @a comp, no + * elements are copied and both ranges advance. The output range may not + * overlap either input range. + */ + template + _OutputIterator + set_difference(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2, + _OutputIterator __result, _Compare __comp) + { + typedef typename iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_InputIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType1>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType1, _ValueType2>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType2, _ValueType1>) + __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp); + __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp); + + while (__first1 != __last1 && __first2 != __last2) + if (__comp(*__first1, *__first2)) + { + *__result = *__first1; + ++__first1; + ++__result; + } + else if (__comp(*__first2, *__first1)) + ++__first2; + else + { + ++__first1; + ++__first2; + } + return std::copy(__first1, __last1, __result); + } + + /** + * @brief Return the symmetric difference of two sorted ranges. + * @ingroup set_algorithms + * @param first1 Start of first range. + * @param last1 End of first range. + * @param first2 Start of second range. + * @param last2 End of second range. + * @return End of the output range. + * @ingroup set_algorithms + * + * This operation iterates over both ranges, copying elements present in + * one range but not the other in order to the output range. Iterators + * increment for each range. When the current element of one range is less + * than the other, that element is copied and the iterator advances. If an + * element is contained in both ranges, no elements are copied and both + * ranges advance. The output range may not overlap either input range. + */ + template + _OutputIterator + set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2, + _OutputIterator __result) + { + typedef typename iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_InputIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType1>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType2>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType1, _ValueType2>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) + __glibcxx_requires_sorted_set(__first1, __last1, __first2); + __glibcxx_requires_sorted_set(__first2, __last2, __first1); + + while (__first1 != __last1 && __first2 != __last2) + if (*__first1 < *__first2) + { + *__result = *__first1; + ++__first1; + ++__result; + } + else if (*__first2 < *__first1) + { + *__result = *__first2; + ++__first2; + ++__result; + } + else + { + ++__first1; + ++__first2; + } + return std::copy(__first2, __last2, std::copy(__first1, + __last1, __result)); + } + + /** + * @brief Return the symmetric difference of two sorted ranges using + * comparison functor. + * @ingroup set_algorithms + * @param first1 Start of first range. + * @param last1 End of first range. + * @param first2 Start of second range. + * @param last2 End of second range. + * @param comp The comparison functor. + * @return End of the output range. + * @ingroup set_algorithms + * + * This operation iterates over both ranges, copying elements present in + * one range but not the other in order to the output range. Iterators + * increment for each range. When the current element of one range is less + * than the other according to @a comp, that element is copied and the + * iterator advances. If an element is contained in both ranges according + * to @a comp, no elements are copied and both ranges advance. The output + * range may not overlap either input range. + */ + template + _OutputIterator + set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _InputIterator2 __last2, + _OutputIterator __result, + _Compare __comp) + { + typedef typename iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_InputIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType1>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType2>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType1, _ValueType2>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + _ValueType2, _ValueType1>) + __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp); + __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp); + + while (__first1 != __last1 && __first2 != __last2) + if (__comp(*__first1, *__first2)) + { + *__result = *__first1; + ++__first1; + ++__result; + } + else if (__comp(*__first2, *__first1)) + { + *__result = *__first2; + ++__first2; + ++__result; + } + else + { + ++__first1; + ++__first2; + } + return std::copy(__first2, __last2, + std::copy(__first1, __last1, __result)); + } + + + /** + * @brief Return the minimum element in a range. + * @ingroup sorting_algorithms + * @param first Start of range. + * @param last End of range. + * @return Iterator referencing the first instance of the smallest value. + */ + template + _ForwardIterator + min_element(_ForwardIterator __first, _ForwardIterator __last) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_LessThanComparableConcept< + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return __first; + _ForwardIterator __result = __first; + while (++__first != __last) + if (*__first < *__result) + __result = __first; + return __result; + } + + /** + * @brief Return the minimum element in a range using comparison functor. + * @ingroup sorting_algorithms + * @param first Start of range. + * @param last End of range. + * @param comp Comparison functor. + * @return Iterator referencing the first instance of the smallest value + * according to comp. + */ + template + _ForwardIterator + min_element(_ForwardIterator __first, _ForwardIterator __last, + _Compare __comp) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + typename iterator_traits<_ForwardIterator>::value_type, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return __first; + _ForwardIterator __result = __first; + while (++__first != __last) + if (__comp(*__first, *__result)) + __result = __first; + return __result; + } + + /** + * @brief Return the maximum element in a range. + * @ingroup sorting_algorithms + * @param first Start of range. + * @param last End of range. + * @return Iterator referencing the first instance of the largest value. + */ + template + _ForwardIterator + max_element(_ForwardIterator __first, _ForwardIterator __last) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_LessThanComparableConcept< + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return __first; + _ForwardIterator __result = __first; + while (++__first != __last) + if (*__result < *__first) + __result = __first; + return __result; + } + + /** + * @brief Return the maximum element in a range using comparison functor. + * @ingroup sorting_algorithms + * @param first Start of range. + * @param last End of range. + * @param comp Comparison functor. + * @return Iterator referencing the first instance of the largest value + * according to comp. + */ + template + _ForwardIterator + max_element(_ForwardIterator __first, _ForwardIterator __last, + _Compare __comp) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, + typename iterator_traits<_ForwardIterator>::value_type, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) return __first; + _ForwardIterator __result = __first; + while (++__first != __last) + if (__comp(*__result, *__first)) + __result = __first; + return __result; + } + +_GLIBCXX_END_NESTED_NAMESPACE + +#endif /* _STL_ALGO_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_algobase.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_algobase.h new file mode 100644 index 00000000..2cef9237 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_algobase.h @@ -0,0 +1,1153 @@ +// Core algorithmic facilities -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996-1998 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_algobase.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_ALGOBASE_H +#define _STL_ALGOBASE_H 1 + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include // For std::swap and _GLIBCXX_MOVE + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // See http://gcc.gnu.org/ml/libstdc++/2004-08/msg00167.html: in a + // nutshell, we are partially implementing the resolution of DR 187, + // when it's safe, i.e., the value_types are equal. + template + struct __iter_swap + { + template + static void + iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b) + { + typedef typename iterator_traits<_ForwardIterator1>::value_type + _ValueType1; + _ValueType1 __tmp = _GLIBCXX_MOVE(*__a); + *__a = _GLIBCXX_MOVE(*__b); + *__b = _GLIBCXX_MOVE(__tmp); + } + }; + + template<> + struct __iter_swap + { + template + static void + iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b) + { + swap(*__a, *__b); + } + }; + + /** + * @brief Swaps the contents of two iterators. + * @ingroup mutating_algorithms + * @param a An iterator. + * @param b Another iterator. + * @return Nothing. + * + * This function swaps the values pointed to by two iterators, not the + * iterators themselves. + */ + template + inline void + iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b) + { + typedef typename iterator_traits<_ForwardIterator1>::value_type + _ValueType1; + typedef typename iterator_traits<_ForwardIterator2>::value_type + _ValueType2; + + // concept requirements + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator1>) + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator2>) + __glibcxx_function_requires(_ConvertibleConcept<_ValueType1, + _ValueType2>) + __glibcxx_function_requires(_ConvertibleConcept<_ValueType2, + _ValueType1>) + + typedef typename iterator_traits<_ForwardIterator1>::reference + _ReferenceType1; + typedef typename iterator_traits<_ForwardIterator2>::reference + _ReferenceType2; + std::__iter_swap<__are_same<_ValueType1, _ValueType2>::__value + && __are_same<_ValueType1&, _ReferenceType1>::__value + && __are_same<_ValueType2&, _ReferenceType2>::__value>:: + iter_swap(__a, __b); + } + + /** + * @brief Swap the elements of two sequences. + * @ingroup mutating_algorithms + * @param first1 A forward iterator. + * @param last1 A forward iterator. + * @param first2 A forward iterator. + * @return An iterator equal to @p first2+(last1-first1). + * + * Swaps each element in the range @p [first1,last1) with the + * corresponding element in the range @p [first2,(last1-first1)). + * The ranges must not overlap. + */ + template + _ForwardIterator2 + swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1, + _ForwardIterator2 __first2) + { + // concept requirements + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator1>) + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator2>) + __glibcxx_requires_valid_range(__first1, __last1); + + for (; __first1 != __last1; ++__first1, ++__first2) + std::iter_swap(__first1, __first2); + return __first2; + } + + /** + * @brief This does what you think it does. + * @ingroup sorting_algorithms + * @param a A thing of arbitrary type. + * @param b Another thing of arbitrary type. + * @return The lesser of the parameters. + * + * This is the simple classic generic implementation. It will work on + * temporary expressions, since they are only evaluated once, unlike a + * preprocessor macro. + */ + template + inline const _Tp& + min(const _Tp& __a, const _Tp& __b) + { + // concept requirements + __glibcxx_function_requires(_LessThanComparableConcept<_Tp>) + //return __b < __a ? __b : __a; + if (__b < __a) + return __b; + return __a; + } + + /** + * @brief This does what you think it does. + * @ingroup sorting_algorithms + * @param a A thing of arbitrary type. + * @param b Another thing of arbitrary type. + * @return The greater of the parameters. + * + * This is the simple classic generic implementation. It will work on + * temporary expressions, since they are only evaluated once, unlike a + * preprocessor macro. + */ + template + inline const _Tp& + max(const _Tp& __a, const _Tp& __b) + { + // concept requirements + __glibcxx_function_requires(_LessThanComparableConcept<_Tp>) + //return __a < __b ? __b : __a; + if (__a < __b) + return __b; + return __a; + } + + /** + * @brief This does what you think it does. + * @ingroup sorting_algorithms + * @param a A thing of arbitrary type. + * @param b Another thing of arbitrary type. + * @param comp A @link comparison_functors comparison functor@endlink. + * @return The lesser of the parameters. + * + * This will work on temporary expressions, since they are only evaluated + * once, unlike a preprocessor macro. + */ + template + inline const _Tp& + min(const _Tp& __a, const _Tp& __b, _Compare __comp) + { + //return __comp(__b, __a) ? __b : __a; + if (__comp(__b, __a)) + return __b; + return __a; + } + + /** + * @brief This does what you think it does. + * @ingroup sorting_algorithms + * @param a A thing of arbitrary type. + * @param b Another thing of arbitrary type. + * @param comp A @link comparison_functors comparison functor@endlink. + * @return The greater of the parameters. + * + * This will work on temporary expressions, since they are only evaluated + * once, unlike a preprocessor macro. + */ + template + inline const _Tp& + max(const _Tp& __a, const _Tp& __b, _Compare __comp) + { + //return __comp(__a, __b) ? __b : __a; + if (__comp(__a, __b)) + return __b; + return __a; + } + + + // If _Iterator is a __normal_iterator return its base (a plain pointer, + // normally) otherwise return it untouched. See copy, fill, ... + template::__value> + struct __niter_base + { + static _Iterator + __b(_Iterator __it) + { return __it; } + }; + + template + struct __niter_base<_Iterator, true> + { + static typename _Iterator::iterator_type + __b(_Iterator __it) + { return __it.base(); } + }; + + // Likewise, for move_iterator. + template::__value> + struct __miter_base + { + static _Iterator + __b(_Iterator __it) + { return __it; } + }; + + template + struct __miter_base<_Iterator, true> + { + static typename _Iterator::iterator_type + __b(_Iterator __it) + { return __it.base(); } + }; + + // All of these auxiliary structs serve two purposes. (1) Replace + // calls to copy with memmove whenever possible. (Memmove, not memcpy, + // because the input and output ranges are permitted to overlap.) + // (2) If we're using random access iterators, then write the loop as + // a for loop with an explicit count. + + template + struct __copy_move + { + template + static _OI + __copy_m(_II __first, _II __last, _OI __result) + { + for (; __first != __last; ++__result, ++__first) + *__result = *__first; + return __result; + } + }; + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + struct __copy_move + { + template + static _OI + __copy_m(_II __first, _II __last, _OI __result) + { + for (; __first != __last; ++__result, ++__first) + *__result = std::move(*__first); + return __result; + } + }; +#endif + + template<> + struct __copy_move + { + template + static _OI + __copy_m(_II __first, _II __last, _OI __result) + { + typedef typename iterator_traits<_II>::difference_type _Distance; + for(_Distance __n = __last - __first; __n > 0; --__n) + { + *__result = *__first; + ++__first; + ++__result; + } + return __result; + } + }; + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template<> + struct __copy_move + { + template + static _OI + __copy_m(_II __first, _II __last, _OI __result) + { + typedef typename iterator_traits<_II>::difference_type _Distance; + for(_Distance __n = __last - __first; __n > 0; --__n) + { + *__result = std::move(*__first); + ++__first; + ++__result; + } + return __result; + } + }; +#endif + + template + struct __copy_move<_IsMove, true, random_access_iterator_tag> + { + template + static _Tp* + __copy_m(const _Tp* __first, const _Tp* __last, _Tp* __result) + { + __builtin_memmove(__result, __first, + sizeof(_Tp) * (__last - __first)); + return __result + (__last - __first); + } + }; + + template + inline _OI + __copy_move_a(_II __first, _II __last, _OI __result) + { + typedef typename iterator_traits<_II>::value_type _ValueTypeI; + typedef typename iterator_traits<_OI>::value_type _ValueTypeO; + typedef typename iterator_traits<_II>::iterator_category _Category; + const bool __simple = (__is_pod(_ValueTypeI) + && __is_pointer<_II>::__value + && __is_pointer<_OI>::__value + && __are_same<_ValueTypeI, _ValueTypeO>::__value); + + return std::__copy_move<_IsMove, __simple, + _Category>::__copy_m(__first, __last, __result); + } + + // Helpers for streambuf iterators (either istream or ostream). + // NB: avoid including , relatively large. + template + struct char_traits; + + template + class istreambuf_iterator; + + template + class ostreambuf_iterator; + + template + typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, + ostreambuf_iterator<_CharT, char_traits<_CharT> > >::__type + __copy_move_a2(_CharT*, _CharT*, + ostreambuf_iterator<_CharT, char_traits<_CharT> >); + + template + typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, + ostreambuf_iterator<_CharT, char_traits<_CharT> > >::__type + __copy_move_a2(const _CharT*, const _CharT*, + ostreambuf_iterator<_CharT, char_traits<_CharT> >); + + template + typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, + _CharT*>::__type + __copy_move_a2(istreambuf_iterator<_CharT, char_traits<_CharT> >, + istreambuf_iterator<_CharT, char_traits<_CharT> >, _CharT*); + + template + inline _OI + __copy_move_a2(_II __first, _II __last, _OI __result) + { + return _OI(std::__copy_move_a<_IsMove> + (std::__niter_base<_II>::__b(__first), + std::__niter_base<_II>::__b(__last), + std::__niter_base<_OI>::__b(__result))); + } + + /** + * @brief Copies the range [first,last) into result. + * @ingroup mutating_algorithms + * @param first An input iterator. + * @param last An input iterator. + * @param result An output iterator. + * @return result + (first - last) + * + * This inline function will boil down to a call to @c memmove whenever + * possible. Failing that, if random access iterators are passed, then the + * loop count will be known (and therefore a candidate for compiler + * optimizations such as unrolling). Result may not be contained within + * [first,last); the copy_backward function should be used instead. + * + * Note that the end of the output range is permitted to be contained + * within [first,last). + */ + template + inline _OI + copy(_II __first, _II __last, _OI __result) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_II>) + __glibcxx_function_requires(_OutputIteratorConcept<_OI, + typename iterator_traits<_II>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + return (std::__copy_move_a2<__is_move_iterator<_II>::__value> + (std::__miter_base<_II>::__b(__first), + std::__miter_base<_II>::__b(__last), __result)); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Moves the range [first,last) into result. + * @ingroup mutating_algorithms + * @param first An input iterator. + * @param last An input iterator. + * @param result An output iterator. + * @return result + (first - last) + * + * This inline function will boil down to a call to @c memmove whenever + * possible. Failing that, if random access iterators are passed, then the + * loop count will be known (and therefore a candidate for compiler + * optimizations such as unrolling). Result may not be contained within + * [first,last); the move_backward function should be used instead. + * + * Note that the end of the output range is permitted to be contained + * within [first,last). + */ + template + inline _OI + move(_II __first, _II __last, _OI __result) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_II>) + __glibcxx_function_requires(_OutputIteratorConcept<_OI, + typename iterator_traits<_II>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + return (std::__copy_move_a2 + (std::__miter_base<_II>::__b(__first), + std::__miter_base<_II>::__b(__last), __result)); + } + +#define _GLIBCXX_MOVE3(_Tp, _Up, _Vp) std::move(_Tp, _Up, _Vp) +#else +#define _GLIBCXX_MOVE3(_Tp, _Up, _Vp) std::copy(_Tp, _Up, _Vp) +#endif + + template + struct __copy_move_backward + { + template + static _BI2 + __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result) + { + while (__first != __last) + *--__result = *--__last; + return __result; + } + }; + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + struct __copy_move_backward + { + template + static _BI2 + __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result) + { + while (__first != __last) + *--__result = std::move(*--__last); + return __result; + } + }; +#endif + + template<> + struct __copy_move_backward + { + template + static _BI2 + __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result) + { + typename iterator_traits<_BI1>::difference_type __n; + for (__n = __last - __first; __n > 0; --__n) + *--__result = *--__last; + return __result; + } + }; + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template<> + struct __copy_move_backward + { + template + static _BI2 + __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result) + { + typename iterator_traits<_BI1>::difference_type __n; + for (__n = __last - __first; __n > 0; --__n) + *--__result = std::move(*--__last); + return __result; + } + }; +#endif + + template + struct __copy_move_backward<_IsMove, true, random_access_iterator_tag> + { + template + static _Tp* + __copy_move_b(const _Tp* __first, const _Tp* __last, _Tp* __result) + { + const ptrdiff_t _Num = __last - __first; + __builtin_memmove(__result - _Num, __first, sizeof(_Tp) * _Num); + return __result - _Num; + } + }; + + template + inline _BI2 + __copy_move_backward_a(_BI1 __first, _BI1 __last, _BI2 __result) + { + typedef typename iterator_traits<_BI1>::value_type _ValueType1; + typedef typename iterator_traits<_BI2>::value_type _ValueType2; + typedef typename iterator_traits<_BI1>::iterator_category _Category; + const bool __simple = (__is_pod(_ValueType1) + && __is_pointer<_BI1>::__value + && __is_pointer<_BI2>::__value + && __are_same<_ValueType1, _ValueType2>::__value); + + return std::__copy_move_backward<_IsMove, __simple, + _Category>::__copy_move_b(__first, + __last, + __result); + } + + template + inline _BI2 + __copy_move_backward_a2(_BI1 __first, _BI1 __last, _BI2 __result) + { + return _BI2(std::__copy_move_backward_a<_IsMove> + (std::__niter_base<_BI1>::__b(__first), + std::__niter_base<_BI1>::__b(__last), + std::__niter_base<_BI2>::__b(__result))); + } + + /** + * @brief Copies the range [first,last) into result. + * @ingroup mutating_algorithms + * @param first A bidirectional iterator. + * @param last A bidirectional iterator. + * @param result A bidirectional iterator. + * @return result - (first - last) + * + * The function has the same effect as copy, but starts at the end of the + * range and works its way to the start, returning the start of the result. + * This inline function will boil down to a call to @c memmove whenever + * possible. Failing that, if random access iterators are passed, then the + * loop count will be known (and therefore a candidate for compiler + * optimizations such as unrolling). + * + * Result may not be in the range [first,last). Use copy instead. Note + * that the start of the output range may overlap [first,last). + */ + template + inline _BI2 + copy_backward(_BI1 __first, _BI1 __last, _BI2 __result) + { + // concept requirements + __glibcxx_function_requires(_BidirectionalIteratorConcept<_BI1>) + __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<_BI2>) + __glibcxx_function_requires(_ConvertibleConcept< + typename iterator_traits<_BI1>::value_type, + typename iterator_traits<_BI2>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + return (std::__copy_move_backward_a2<__is_move_iterator<_BI1>::__value> + (std::__miter_base<_BI1>::__b(__first), + std::__miter_base<_BI1>::__b(__last), __result)); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Moves the range [first,last) into result. + * @ingroup mutating_algorithms + * @param first A bidirectional iterator. + * @param last A bidirectional iterator. + * @param result A bidirectional iterator. + * @return result - (first - last) + * + * The function has the same effect as move, but starts at the end of the + * range and works its way to the start, returning the start of the result. + * This inline function will boil down to a call to @c memmove whenever + * possible. Failing that, if random access iterators are passed, then the + * loop count will be known (and therefore a candidate for compiler + * optimizations such as unrolling). + * + * Result may not be in the range [first,last). Use move instead. Note + * that the start of the output range may overlap [first,last). + */ + template + inline _BI2 + move_backward(_BI1 __first, _BI1 __last, _BI2 __result) + { + // concept requirements + __glibcxx_function_requires(_BidirectionalIteratorConcept<_BI1>) + __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<_BI2>) + __glibcxx_function_requires(_ConvertibleConcept< + typename iterator_traits<_BI1>::value_type, + typename iterator_traits<_BI2>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + return (std::__copy_move_backward_a2 + (std::__miter_base<_BI1>::__b(__first), + std::__miter_base<_BI1>::__b(__last), __result)); + } + +#define _GLIBCXX_MOVE_BACKWARD3(_Tp, _Up, _Vp) std::move_backward(_Tp, _Up, _Vp) +#else +#define _GLIBCXX_MOVE_BACKWARD3(_Tp, _Up, _Vp) std::copy_backward(_Tp, _Up, _Vp) +#endif + + template + inline typename + __gnu_cxx::__enable_if::__value, void>::__type + __fill_a(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __value) + { + for (; __first != __last; ++__first) + *__first = __value; + } + + template + inline typename + __gnu_cxx::__enable_if<__is_scalar<_Tp>::__value, void>::__type + __fill_a(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __value) + { + const _Tp __tmp = __value; + for (; __first != __last; ++__first) + *__first = __tmp; + } + + // Specialization: for char types we can use memset. + template + inline typename + __gnu_cxx::__enable_if<__is_byte<_Tp>::__value, void>::__type + __fill_a(_Tp* __first, _Tp* __last, const _Tp& __c) + { + const _Tp __tmp = __c; + __builtin_memset(__first, static_cast(__tmp), + __last - __first); + } + + /** + * @brief Fills the range [first,last) with copies of value. + * @ingroup mutating_algorithms + * @param first A forward iterator. + * @param last A forward iterator. + * @param value A reference-to-const of arbitrary type. + * @return Nothing. + * + * This function fills a range with copies of the same value. For char + * types filling contiguous areas of memory, this becomes an inline call + * to @c memset or @c wmemset. + */ + template + inline void + fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) + { + // concept requirements + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator>) + __glibcxx_requires_valid_range(__first, __last); + + std::__fill_a(std::__niter_base<_ForwardIterator>::__b(__first), + std::__niter_base<_ForwardIterator>::__b(__last), __value); + } + + template + inline typename + __gnu_cxx::__enable_if::__value, _OutputIterator>::__type + __fill_n_a(_OutputIterator __first, _Size __n, const _Tp& __value) + { + for (; __n > 0; --__n, ++__first) + *__first = __value; + return __first; + } + + template + inline typename + __gnu_cxx::__enable_if<__is_scalar<_Tp>::__value, _OutputIterator>::__type + __fill_n_a(_OutputIterator __first, _Size __n, const _Tp& __value) + { + const _Tp __tmp = __value; + for (; __n > 0; --__n, ++__first) + *__first = __tmp; + return __first; + } + + template + inline typename + __gnu_cxx::__enable_if<__is_byte<_Tp>::__value, _Tp*>::__type + __fill_n_a(_Tp* __first, _Size __n, const _Tp& __c) + { + std::__fill_a(__first, __first + __n, __c); + return __first + __n; + } + + /** + * @brief Fills the range [first,first+n) with copies of value. + * @ingroup mutating_algorithms + * @param first An output iterator. + * @param n The count of copies to perform. + * @param value A reference-to-const of arbitrary type. + * @return The iterator at first+n. + * + * This function fills a range with copies of the same value. For char + * types filling contiguous areas of memory, this becomes an inline call + * to @c memset or @ wmemset. + */ + template + inline _OI + fill_n(_OI __first, _Size __n, const _Tp& __value) + { + // concept requirements + __glibcxx_function_requires(_OutputIteratorConcept<_OI, _Tp>) + + return _OI(std::__fill_n_a(std::__niter_base<_OI>::__b(__first), + __n, __value)); + } + + template + struct __equal + { + template + static bool + equal(_II1 __first1, _II1 __last1, _II2 __first2) + { + for (; __first1 != __last1; ++__first1, ++__first2) + if (!(*__first1 == *__first2)) + return false; + return true; + } + }; + + template<> + struct __equal + { + template + static bool + equal(const _Tp* __first1, const _Tp* __last1, const _Tp* __first2) + { + return !__builtin_memcmp(__first1, __first2, sizeof(_Tp) + * (__last1 - __first1)); + } + }; + + template + inline bool + __equal_aux(_II1 __first1, _II1 __last1, _II2 __first2) + { + typedef typename iterator_traits<_II1>::value_type _ValueType1; + typedef typename iterator_traits<_II2>::value_type _ValueType2; + const bool __simple = (__is_integer<_ValueType1>::__value + && __is_pointer<_II1>::__value + && __is_pointer<_II2>::__value + && __are_same<_ValueType1, _ValueType2>::__value); + + return std::__equal<__simple>::equal(__first1, __last1, __first2); + } + + + template + struct __lc_rai + { + template + static _II1 + __newlast1(_II1, _II1 __last1, _II2, _II2) + { return __last1; } + + template + static bool + __cnd2(_II __first, _II __last) + { return __first != __last; } + }; + + template<> + struct __lc_rai + { + template + static _RAI1 + __newlast1(_RAI1 __first1, _RAI1 __last1, + _RAI2 __first2, _RAI2 __last2) + { + const typename iterator_traits<_RAI1>::difference_type + __diff1 = __last1 - __first1; + const typename iterator_traits<_RAI2>::difference_type + __diff2 = __last2 - __first2; + return __diff2 < __diff1 ? __first1 + __diff2 : __last1; + } + + template + static bool + __cnd2(_RAI, _RAI) + { return true; } + }; + + template + struct __lexicographical_compare + { + template + static bool __lc(_II1, _II1, _II2, _II2); + }; + + template + template + bool + __lexicographical_compare<_BoolType>:: + __lc(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2) + { + typedef typename iterator_traits<_II1>::iterator_category _Category1; + typedef typename iterator_traits<_II2>::iterator_category _Category2; + typedef std::__lc_rai<_Category1, _Category2> __rai_type; + + __last1 = __rai_type::__newlast1(__first1, __last1, + __first2, __last2); + for (; __first1 != __last1 && __rai_type::__cnd2(__first2, __last2); + ++__first1, ++__first2) + { + if (*__first1 < *__first2) + return true; + if (*__first2 < *__first1) + return false; + } + return __first1 == __last1 && __first2 != __last2; + } + + template<> + struct __lexicographical_compare + { + template + static bool + __lc(const _Tp* __first1, const _Tp* __last1, + const _Up* __first2, const _Up* __last2) + { + const size_t __len1 = __last1 - __first1; + const size_t __len2 = __last2 - __first2; + const int __result = __builtin_memcmp(__first1, __first2, + std::min(__len1, __len2)); + return __result != 0 ? __result < 0 : __len1 < __len2; + } + }; + + template + inline bool + __lexicographical_compare_aux(_II1 __first1, _II1 __last1, + _II2 __first2, _II2 __last2) + { + typedef typename iterator_traits<_II1>::value_type _ValueType1; + typedef typename iterator_traits<_II2>::value_type _ValueType2; + const bool __simple = + (__is_byte<_ValueType1>::__value && __is_byte<_ValueType2>::__value + && !__gnu_cxx::__numeric_traits<_ValueType1>::__is_signed + && !__gnu_cxx::__numeric_traits<_ValueType2>::__is_signed + && __is_pointer<_II1>::__value + && __is_pointer<_II2>::__value); + + return std::__lexicographical_compare<__simple>::__lc(__first1, __last1, + __first2, __last2); + } + +_GLIBCXX_END_NAMESPACE + +_GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_P) + + /** + * @brief Tests a range for element-wise equality. + * @ingroup non_mutating_algorithms + * @param first1 An input iterator. + * @param last1 An input iterator. + * @param first2 An input iterator. + * @return A boolean true or false. + * + * This compares the elements of two ranges using @c == and returns true or + * false depending on whether all of the corresponding elements of the + * ranges are equal. + */ + template + inline bool + equal(_II1 __first1, _II1 __last1, _II2 __first2) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_II1>) + __glibcxx_function_requires(_InputIteratorConcept<_II2>) + __glibcxx_function_requires(_EqualOpConcept< + typename iterator_traits<_II1>::value_type, + typename iterator_traits<_II2>::value_type>) + __glibcxx_requires_valid_range(__first1, __last1); + + return std::__equal_aux(std::__niter_base<_II1>::__b(__first1), + std::__niter_base<_II1>::__b(__last1), + std::__niter_base<_II2>::__b(__first2)); + } + + /** + * @brief Tests a range for element-wise equality. + * @ingroup non_mutating_algorithms + * @param first1 An input iterator. + * @param last1 An input iterator. + * @param first2 An input iterator. + * @param binary_pred A binary predicate @link functors + * functor@endlink. + * @return A boolean true or false. + * + * This compares the elements of two ranges using the binary_pred + * parameter, and returns true or + * false depending on whether all of the corresponding elements of the + * ranges are equal. + */ + template + inline bool + equal(_IIter1 __first1, _IIter1 __last1, + _IIter2 __first2, _BinaryPredicate __binary_pred) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_IIter1>) + __glibcxx_function_requires(_InputIteratorConcept<_IIter2>) + __glibcxx_requires_valid_range(__first1, __last1); + + for (; __first1 != __last1; ++__first1, ++__first2) + if (!bool(__binary_pred(*__first1, *__first2))) + return false; + return true; + } + + /** + * @brief Performs "dictionary" comparison on ranges. + * @ingroup sorting_algorithms + * @param first1 An input iterator. + * @param last1 An input iterator. + * @param first2 An input iterator. + * @param last2 An input iterator. + * @return A boolean true or false. + * + * "Returns true if the sequence of elements defined by the range + * [first1,last1) is lexicographically less than the sequence of elements + * defined by the range [first2,last2). Returns false otherwise." + * (Quoted from [25.3.8]/1.) If the iterators are all character pointers, + * then this is an inline call to @c memcmp. + */ + template + inline bool + lexicographical_compare(_II1 __first1, _II1 __last1, + _II2 __first2, _II2 __last2) + { + // concept requirements + typedef typename iterator_traits<_II1>::value_type _ValueType1; + typedef typename iterator_traits<_II2>::value_type _ValueType2; + __glibcxx_function_requires(_InputIteratorConcept<_II1>) + __glibcxx_function_requires(_InputIteratorConcept<_II2>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType1, _ValueType2>) + __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) + __glibcxx_requires_valid_range(__first1, __last1); + __glibcxx_requires_valid_range(__first2, __last2); + + return std::__lexicographical_compare_aux + (std::__niter_base<_II1>::__b(__first1), + std::__niter_base<_II1>::__b(__last1), + std::__niter_base<_II2>::__b(__first2), + std::__niter_base<_II2>::__b(__last2)); + } + + /** + * @brief Performs "dictionary" comparison on ranges. + * @ingroup sorting_algorithms + * @param first1 An input iterator. + * @param last1 An input iterator. + * @param first2 An input iterator. + * @param last2 An input iterator. + * @param comp A @link comparison_functors comparison functor@endlink. + * @return A boolean true or false. + * + * The same as the four-parameter @c lexicographical_compare, but uses the + * comp parameter instead of @c <. + */ + template + bool + lexicographical_compare(_II1 __first1, _II1 __last1, + _II2 __first2, _II2 __last2, _Compare __comp) + { + typedef typename iterator_traits<_II1>::iterator_category _Category1; + typedef typename iterator_traits<_II2>::iterator_category _Category2; + typedef std::__lc_rai<_Category1, _Category2> __rai_type; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_II1>) + __glibcxx_function_requires(_InputIteratorConcept<_II2>) + __glibcxx_requires_valid_range(__first1, __last1); + __glibcxx_requires_valid_range(__first2, __last2); + + __last1 = __rai_type::__newlast1(__first1, __last1, __first2, __last2); + for (; __first1 != __last1 && __rai_type::__cnd2(__first2, __last2); + ++__first1, ++__first2) + { + if (__comp(*__first1, *__first2)) + return true; + if (__comp(*__first2, *__first1)) + return false; + } + return __first1 == __last1 && __first2 != __last2; + } + + /** + * @brief Finds the places in ranges which don't match. + * @ingroup non_mutating_algorithms + * @param first1 An input iterator. + * @param last1 An input iterator. + * @param first2 An input iterator. + * @return A pair of iterators pointing to the first mismatch. + * + * This compares the elements of two ranges using @c == and returns a pair + * of iterators. The first iterator points into the first range, the + * second iterator points into the second range, and the elements pointed + * to by the iterators are not equal. + */ + template + pair<_InputIterator1, _InputIterator2> + mismatch(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_EqualOpConcept< + typename iterator_traits<_InputIterator1>::value_type, + typename iterator_traits<_InputIterator2>::value_type>) + __glibcxx_requires_valid_range(__first1, __last1); + + while (__first1 != __last1 && *__first1 == *__first2) + { + ++__first1; + ++__first2; + } + return pair<_InputIterator1, _InputIterator2>(__first1, __first2); + } + + /** + * @brief Finds the places in ranges which don't match. + * @ingroup non_mutating_algorithms + * @param first1 An input iterator. + * @param last1 An input iterator. + * @param first2 An input iterator. + * @param binary_pred A binary predicate @link functors + * functor@endlink. + * @return A pair of iterators pointing to the first mismatch. + * + * This compares the elements of two ranges using the binary_pred + * parameter, and returns a pair + * of iterators. The first iterator points into the first range, the + * second iterator points into the second range, and the elements pointed + * to by the iterators are not equal. + */ + template + pair<_InputIterator1, _InputIterator2> + mismatch(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _BinaryPredicate __binary_pred) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_requires_valid_range(__first1, __last1); + + while (__first1 != __last1 && bool(__binary_pred(*__first1, *__first2))) + { + ++__first1; + ++__first2; + } + return pair<_InputIterator1, _InputIterator2>(__first1, __first2); + } + +_GLIBCXX_END_NESTED_NAMESPACE + +// NB: This file is included within many other C++ includes, as a way +// of getting the base algorithms. So, make sure that parallel bits +// come in too if requested. +#ifdef _GLIBCXX_PARALLEL +# include +#endif + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_bvector.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_bvector.h new file mode 100644 index 00000000..0e60b7f1 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_bvector.h @@ -0,0 +1,1024 @@ +// vector specialization -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996-1999 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_bvector.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_BVECTOR_H +#define _STL_BVECTOR_H 1 + +#include + +_GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D) + + typedef unsigned long _Bit_type; + enum { _S_word_bit = int(__CHAR_BIT__ * sizeof(_Bit_type)) }; + + struct _Bit_reference + { + _Bit_type * _M_p; + _Bit_type _M_mask; + + _Bit_reference(_Bit_type * __x, _Bit_type __y) + : _M_p(__x), _M_mask(__y) { } + + _Bit_reference() : _M_p(0), _M_mask(0) { } + + operator bool() const + { return !!(*_M_p & _M_mask); } + + _Bit_reference& + operator=(bool __x) + { + if (__x) + *_M_p |= _M_mask; + else + *_M_p &= ~_M_mask; + return *this; + } + + _Bit_reference& + operator=(const _Bit_reference& __x) + { return *this = bool(__x); } + + bool + operator==(const _Bit_reference& __x) const + { return bool(*this) == bool(__x); } + + bool + operator<(const _Bit_reference& __x) const + { return !bool(*this) && bool(__x); } + + void + flip() + { *_M_p ^= _M_mask; } + }; + + struct _Bit_iterator_base + : public std::iterator + { + _Bit_type * _M_p; + unsigned int _M_offset; + + _Bit_iterator_base(_Bit_type * __x, unsigned int __y) + : _M_p(__x), _M_offset(__y) { } + + void + _M_bump_up() + { + if (_M_offset++ == int(_S_word_bit) - 1) + { + _M_offset = 0; + ++_M_p; + } + } + + void + _M_bump_down() + { + if (_M_offset-- == 0) + { + _M_offset = int(_S_word_bit) - 1; + --_M_p; + } + } + + void + _M_incr(ptrdiff_t __i) + { + difference_type __n = __i + _M_offset; + _M_p += __n / int(_S_word_bit); + __n = __n % int(_S_word_bit); + if (__n < 0) + { + __n += int(_S_word_bit); + --_M_p; + } + _M_offset = static_cast(__n); + } + + bool + operator==(const _Bit_iterator_base& __i) const + { return _M_p == __i._M_p && _M_offset == __i._M_offset; } + + bool + operator<(const _Bit_iterator_base& __i) const + { + return _M_p < __i._M_p + || (_M_p == __i._M_p && _M_offset < __i._M_offset); + } + + bool + operator!=(const _Bit_iterator_base& __i) const + { return !(*this == __i); } + + bool + operator>(const _Bit_iterator_base& __i) const + { return __i < *this; } + + bool + operator<=(const _Bit_iterator_base& __i) const + { return !(__i < *this); } + + bool + operator>=(const _Bit_iterator_base& __i) const + { return !(*this < __i); } + }; + + inline ptrdiff_t + operator-(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y) + { + return (int(_S_word_bit) * (__x._M_p - __y._M_p) + + __x._M_offset - __y._M_offset); + } + + struct _Bit_iterator : public _Bit_iterator_base + { + typedef _Bit_reference reference; + typedef _Bit_reference* pointer; + typedef _Bit_iterator iterator; + + _Bit_iterator() : _Bit_iterator_base(0, 0) { } + + _Bit_iterator(_Bit_type * __x, unsigned int __y) + : _Bit_iterator_base(__x, __y) { } + + reference + operator*() const + { return reference(_M_p, 1UL << _M_offset); } + + iterator& + operator++() + { + _M_bump_up(); + return *this; + } + + iterator + operator++(int) + { + iterator __tmp = *this; + _M_bump_up(); + return __tmp; + } + + iterator& + operator--() + { + _M_bump_down(); + return *this; + } + + iterator + operator--(int) + { + iterator __tmp = *this; + _M_bump_down(); + return __tmp; + } + + iterator& + operator+=(difference_type __i) + { + _M_incr(__i); + return *this; + } + + iterator& + operator-=(difference_type __i) + { + *this += -__i; + return *this; + } + + iterator + operator+(difference_type __i) const + { + iterator __tmp = *this; + return __tmp += __i; + } + + iterator + operator-(difference_type __i) const + { + iterator __tmp = *this; + return __tmp -= __i; + } + + reference + operator[](difference_type __i) const + { return *(*this + __i); } + }; + + inline _Bit_iterator + operator+(ptrdiff_t __n, const _Bit_iterator& __x) + { return __x + __n; } + + struct _Bit_const_iterator : public _Bit_iterator_base + { + typedef bool reference; + typedef bool const_reference; + typedef const bool* pointer; + typedef _Bit_const_iterator const_iterator; + + _Bit_const_iterator() : _Bit_iterator_base(0, 0) { } + + _Bit_const_iterator(_Bit_type * __x, unsigned int __y) + : _Bit_iterator_base(__x, __y) { } + + _Bit_const_iterator(const _Bit_iterator& __x) + : _Bit_iterator_base(__x._M_p, __x._M_offset) { } + + const_reference + operator*() const + { return _Bit_reference(_M_p, 1UL << _M_offset); } + + const_iterator& + operator++() + { + _M_bump_up(); + return *this; + } + + const_iterator + operator++(int) + { + const_iterator __tmp = *this; + _M_bump_up(); + return __tmp; + } + + const_iterator& + operator--() + { + _M_bump_down(); + return *this; + } + + const_iterator + operator--(int) + { + const_iterator __tmp = *this; + _M_bump_down(); + return __tmp; + } + + const_iterator& + operator+=(difference_type __i) + { + _M_incr(__i); + return *this; + } + + const_iterator& + operator-=(difference_type __i) + { + *this += -__i; + return *this; + } + + const_iterator + operator+(difference_type __i) const + { + const_iterator __tmp = *this; + return __tmp += __i; + } + + const_iterator + operator-(difference_type __i) const + { + const_iterator __tmp = *this; + return __tmp -= __i; + } + + const_reference + operator[](difference_type __i) const + { return *(*this + __i); } + }; + + inline _Bit_const_iterator + operator+(ptrdiff_t __n, const _Bit_const_iterator& __x) + { return __x + __n; } + + inline void + __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x) + { + for (; __first != __last; ++__first) + *__first = __x; + } + + inline void + fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x) + { + if (__first._M_p != __last._M_p) + { + std::fill(__first._M_p + 1, __last._M_p, __x ? ~0 : 0); + __fill_bvector(__first, _Bit_iterator(__first._M_p + 1, 0), __x); + __fill_bvector(_Bit_iterator(__last._M_p, 0), __last, __x); + } + else + __fill_bvector(__first, __last, __x); + } + + template + struct _Bvector_base + { + typedef typename _Alloc::template rebind<_Bit_type>::other + _Bit_alloc_type; + + struct _Bvector_impl + : public _Bit_alloc_type + { + _Bit_iterator _M_start; + _Bit_iterator _M_finish; + _Bit_type* _M_end_of_storage; + + _Bvector_impl() + : _Bit_alloc_type(), _M_start(), _M_finish(), _M_end_of_storage(0) + { } + + _Bvector_impl(const _Bit_alloc_type& __a) + : _Bit_alloc_type(__a), _M_start(), _M_finish(), _M_end_of_storage(0) + { } + }; + + public: + typedef _Alloc allocator_type; + + _Bit_alloc_type& + _M_get_Bit_allocator() + { return *static_cast<_Bit_alloc_type*>(&this->_M_impl); } + + const _Bit_alloc_type& + _M_get_Bit_allocator() const + { return *static_cast(&this->_M_impl); } + + allocator_type + get_allocator() const + { return allocator_type(_M_get_Bit_allocator()); } + + _Bvector_base() + : _M_impl() { } + + _Bvector_base(const allocator_type& __a) + : _M_impl(__a) { } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + _Bvector_base(_Bvector_base&& __x) + : _M_impl(__x._M_get_Bit_allocator()) + { + this->_M_impl._M_start = __x._M_impl._M_start; + this->_M_impl._M_finish = __x._M_impl._M_finish; + this->_M_impl._M_end_of_storage = __x._M_impl._M_end_of_storage; + __x._M_impl._M_start = _Bit_iterator(); + __x._M_impl._M_finish = _Bit_iterator(); + __x._M_impl._M_end_of_storage = 0; + } +#endif + + ~_Bvector_base() + { this->_M_deallocate(); } + + protected: + _Bvector_impl _M_impl; + + _Bit_type* + _M_allocate(size_t __n) + { return _M_impl.allocate((__n + int(_S_word_bit) - 1) + / int(_S_word_bit)); } + + void + _M_deallocate() + { + if (_M_impl._M_start._M_p) + _M_impl.deallocate(_M_impl._M_start._M_p, + _M_impl._M_end_of_storage - _M_impl._M_start._M_p); + } + }; + +_GLIBCXX_END_NESTED_NAMESPACE + +// Declare a partial specialization of vector. +#include + +_GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D) + + /** + * @brief A specialization of vector for booleans which offers fixed time + * access to individual elements in any order. + * + * Note that vector does not actually meet the requirements for being + * a container. This is because the reference and pointer types are not + * really references and pointers to bool. See DR96 for details. @see + * vector for function documentation. + * + * @ingroup sequences + * + * In some terminology a %vector can be described as a dynamic + * C-style array, it offers fast and efficient access to individual + * elements in any order and saves the user from worrying about + * memory and size allocation. Subscripting ( @c [] ) access is + * also provided as with C-style arrays. + */ +template + class vector : protected _Bvector_base<_Alloc> + { + typedef _Bvector_base<_Alloc> _Base; + + public: + typedef bool value_type; + typedef size_t size_type; + typedef ptrdiff_t difference_type; + typedef _Bit_reference reference; + typedef bool const_reference; + typedef _Bit_reference* pointer; + typedef const bool* const_pointer; + typedef _Bit_iterator iterator; + typedef _Bit_const_iterator const_iterator; + typedef std::reverse_iterator const_reverse_iterator; + typedef std::reverse_iterator reverse_iterator; + typedef _Alloc allocator_type; + + allocator_type get_allocator() const + { return _Base::get_allocator(); } + + protected: + using _Base::_M_allocate; + using _Base::_M_deallocate; + using _Base::_M_get_Bit_allocator; + + public: + vector() + : _Base() { } + + explicit + vector(const allocator_type& __a) + : _Base(__a) { } + + explicit + vector(size_type __n, const bool& __value = bool(), + const allocator_type& __a = allocator_type()) + : _Base(__a) + { + _M_initialize(__n); + std::fill(this->_M_impl._M_start._M_p, this->_M_impl._M_end_of_storage, + __value ? ~0 : 0); + } + + vector(const vector& __x) + : _Base(__x._M_get_Bit_allocator()) + { + _M_initialize(__x.size()); + _M_copy_aligned(__x.begin(), __x.end(), this->_M_impl._M_start); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + vector(vector&& __x) + : _Base(std::forward<_Base>(__x)) { } + + vector(initializer_list __l, + const allocator_type& __a = allocator_type()) + : _Base(__a) + { + _M_initialize_range(__l.begin(), __l.end(), + random_access_iterator_tag()); + } +#endif + + template + vector(_InputIterator __first, _InputIterator __last, + const allocator_type& __a = allocator_type()) + : _Base(__a) + { + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + _M_initialize_dispatch(__first, __last, _Integral()); + } + + ~vector() { } + + vector& + operator=(const vector& __x) + { + if (&__x == this) + return *this; + if (__x.size() > capacity()) + { + this->_M_deallocate(); + _M_initialize(__x.size()); + } + this->_M_impl._M_finish = _M_copy_aligned(__x.begin(), __x.end(), + begin()); + return *this; + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + vector& + operator=(vector&& __x) + { + // NB: DR 675. + this->clear(); + this->swap(__x); + return *this; + } + + vector& + operator=(initializer_list __l) + { + this->assign (__l.begin(), __l.end()); + return *this; + } +#endif + + // assign(), a generalized assignment member function. Two + // versions: one that takes a count, and one that takes a range. + // The range version is a member template, so we dispatch on whether + // or not the type is an integer. + void + assign(size_type __n, const bool& __x) + { _M_fill_assign(__n, __x); } + + template + void + assign(_InputIterator __first, _InputIterator __last) + { + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + _M_assign_dispatch(__first, __last, _Integral()); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + void + assign(initializer_list __l) + { this->assign(__l.begin(), __l.end()); } +#endif + + iterator + begin() + { return this->_M_impl._M_start; } + + const_iterator + begin() const + { return this->_M_impl._M_start; } + + iterator + end() + { return this->_M_impl._M_finish; } + + const_iterator + end() const + { return this->_M_impl._M_finish; } + + reverse_iterator + rbegin() + { return reverse_iterator(end()); } + + const_reverse_iterator + rbegin() const + { return const_reverse_iterator(end()); } + + reverse_iterator + rend() + { return reverse_iterator(begin()); } + + const_reverse_iterator + rend() const + { return const_reverse_iterator(begin()); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + const_iterator + cbegin() const + { return this->_M_impl._M_start; } + + const_iterator + cend() const + { return this->_M_impl._M_finish; } + + const_reverse_iterator + crbegin() const + { return const_reverse_iterator(end()); } + + const_reverse_iterator + crend() const + { return const_reverse_iterator(begin()); } +#endif + + size_type + size() const + { return size_type(end() - begin()); } + + size_type + max_size() const + { + const size_type __isize = + __gnu_cxx::__numeric_traits::__max + - int(_S_word_bit) + 1; + const size_type __asize = _M_get_Bit_allocator().max_size(); + return (__asize <= __isize / int(_S_word_bit) + ? __asize * int(_S_word_bit) : __isize); + } + + size_type + capacity() const + { return size_type(const_iterator(this->_M_impl._M_end_of_storage, 0) + - begin()); } + + bool + empty() const + { return begin() == end(); } + + reference + operator[](size_type __n) + { + return *iterator(this->_M_impl._M_start._M_p + + __n / int(_S_word_bit), __n % int(_S_word_bit)); + } + + const_reference + operator[](size_type __n) const + { + return *const_iterator(this->_M_impl._M_start._M_p + + __n / int(_S_word_bit), __n % int(_S_word_bit)); + } + + protected: + void + _M_range_check(size_type __n) const + { + if (__n >= this->size()) + __throw_out_of_range(__N("vector::_M_range_check")); + } + + public: + reference + at(size_type __n) + { _M_range_check(__n); return (*this)[__n]; } + + const_reference + at(size_type __n) const + { _M_range_check(__n); return (*this)[__n]; } + + void + reserve(size_type __n); + + reference + front() + { return *begin(); } + + const_reference + front() const + { return *begin(); } + + reference + back() + { return *(end() - 1); } + + const_reference + back() const + { return *(end() - 1); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 464. Suggestion for new member functions in standard containers. + // N.B. DR 464 says nothing about vector but we need something + // here due to the way we are implementing DR 464 in the debug-mode + // vector class. + void + data() { } + + void + push_back(bool __x) + { + if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_of_storage) + *this->_M_impl._M_finish++ = __x; + else + _M_insert_aux(end(), __x); + } + + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + swap(vector&& __x) +#else + swap(vector& __x) +#endif + { + std::swap(this->_M_impl._M_start, __x._M_impl._M_start); + std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish); + std::swap(this->_M_impl._M_end_of_storage, + __x._M_impl._M_end_of_storage); + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 431. Swapping containers with unequal allocators. + std::__alloc_swap:: + _S_do_it(_M_get_Bit_allocator(), __x._M_get_Bit_allocator()); + } + + // [23.2.5]/1, third-to-last entry in synopsis listing + static void + swap(reference __x, reference __y) + { + bool __tmp = __x; + __x = __y; + __y = __tmp; + } + + iterator + insert(iterator __position, const bool& __x = bool()) + { + const difference_type __n = __position - begin(); + if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_of_storage + && __position == end()) + *this->_M_impl._M_finish++ = __x; + else + _M_insert_aux(__position, __x); + return begin() + __n; + } + + template + void + insert(iterator __position, + _InputIterator __first, _InputIterator __last) + { + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + _M_insert_dispatch(__position, __first, __last, _Integral()); + } + + void + insert(iterator __position, size_type __n, const bool& __x) + { _M_fill_insert(__position, __n, __x); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + void insert(iterator __p, initializer_list __l) + { this->insert(__p, __l.begin(), __l.end()); } +#endif + + void + pop_back() + { --this->_M_impl._M_finish; } + + iterator + erase(iterator __position) + { + if (__position + 1 != end()) + std::copy(__position + 1, end(), __position); + --this->_M_impl._M_finish; + return __position; + } + + iterator + erase(iterator __first, iterator __last) + { + _M_erase_at_end(std::copy(__last, end(), __first)); + return __first; + } + + void + resize(size_type __new_size, bool __x = bool()) + { + if (__new_size < size()) + _M_erase_at_end(begin() + difference_type(__new_size)); + else + insert(end(), __new_size - size(), __x); + } + + void + flip() + { + for (_Bit_type * __p = this->_M_impl._M_start._M_p; + __p != this->_M_impl._M_end_of_storage; ++__p) + *__p = ~*__p; + } + + void + clear() + { _M_erase_at_end(begin()); } + + + protected: + // Precondition: __first._M_offset == 0 && __result._M_offset == 0. + iterator + _M_copy_aligned(const_iterator __first, const_iterator __last, + iterator __result) + { + _Bit_type* __q = std::copy(__first._M_p, __last._M_p, __result._M_p); + return std::copy(const_iterator(__last._M_p, 0), __last, + iterator(__q, 0)); + } + + void + _M_initialize(size_type __n) + { + _Bit_type* __q = this->_M_allocate(__n); + this->_M_impl._M_end_of_storage = (__q + + ((__n + int(_S_word_bit) - 1) + / int(_S_word_bit))); + this->_M_impl._M_start = iterator(__q, 0); + this->_M_impl._M_finish = this->_M_impl._M_start + difference_type(__n); + } + + // Check whether it's an integral type. If so, it's not an iterator. + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 438. Ambiguity in the "do the right thing" clause + template + void + _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) + { + _M_initialize(static_cast(__n)); + std::fill(this->_M_impl._M_start._M_p, + this->_M_impl._M_end_of_storage, __x ? ~0 : 0); + } + + template + void + _M_initialize_dispatch(_InputIterator __first, _InputIterator __last, + __false_type) + { _M_initialize_range(__first, __last, + std::__iterator_category(__first)); } + + template + void + _M_initialize_range(_InputIterator __first, _InputIterator __last, + std::input_iterator_tag) + { + for (; __first != __last; ++__first) + push_back(*__first); + } + + template + void + _M_initialize_range(_ForwardIterator __first, _ForwardIterator __last, + std::forward_iterator_tag) + { + const size_type __n = std::distance(__first, __last); + _M_initialize(__n); + std::copy(__first, __last, this->_M_impl._M_start); + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 438. Ambiguity in the "do the right thing" clause + template + void + _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) + { _M_fill_assign(__n, __val); } + + template + void + _M_assign_dispatch(_InputIterator __first, _InputIterator __last, + __false_type) + { _M_assign_aux(__first, __last, std::__iterator_category(__first)); } + + void + _M_fill_assign(size_t __n, bool __x) + { + if (__n > size()) + { + std::fill(this->_M_impl._M_start._M_p, + this->_M_impl._M_end_of_storage, __x ? ~0 : 0); + insert(end(), __n - size(), __x); + } + else + { + _M_erase_at_end(begin() + __n); + std::fill(this->_M_impl._M_start._M_p, + this->_M_impl._M_end_of_storage, __x ? ~0 : 0); + } + } + + template + void + _M_assign_aux(_InputIterator __first, _InputIterator __last, + std::input_iterator_tag) + { + iterator __cur = begin(); + for (; __first != __last && __cur != end(); ++__cur, ++__first) + *__cur = *__first; + if (__first == __last) + _M_erase_at_end(__cur); + else + insert(end(), __first, __last); + } + + template + void + _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last, + std::forward_iterator_tag) + { + const size_type __len = std::distance(__first, __last); + if (__len < size()) + _M_erase_at_end(std::copy(__first, __last, begin())); + else + { + _ForwardIterator __mid = __first; + std::advance(__mid, size()); + std::copy(__first, __mid, begin()); + insert(end(), __mid, __last); + } + } + + // Check whether it's an integral type. If so, it's not an iterator. + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 438. Ambiguity in the "do the right thing" clause + template + void + _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, + __true_type) + { _M_fill_insert(__pos, __n, __x); } + + template + void + _M_insert_dispatch(iterator __pos, + _InputIterator __first, _InputIterator __last, + __false_type) + { _M_insert_range(__pos, __first, __last, + std::__iterator_category(__first)); } + + void + _M_fill_insert(iterator __position, size_type __n, bool __x); + + template + void + _M_insert_range(iterator __pos, _InputIterator __first, + _InputIterator __last, std::input_iterator_tag) + { + for (; __first != __last; ++__first) + { + __pos = insert(__pos, *__first); + ++__pos; + } + } + + template + void + _M_insert_range(iterator __position, _ForwardIterator __first, + _ForwardIterator __last, std::forward_iterator_tag); + + void + _M_insert_aux(iterator __position, bool __x); + + size_type + _M_check_len(size_type __n, const char* __s) const + { + if (max_size() - size() < __n) + __throw_length_error(__N(__s)); + + const size_type __len = size() + std::max(size(), __n); + return (__len < size() || __len > max_size()) ? max_size() : __len; + } + + void + _M_erase_at_end(iterator __pos) + { this->_M_impl._M_finish = __pos; } + }; + +_GLIBCXX_END_NESTED_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_construct.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_construct.h new file mode 100644 index 00000000..265c3ab1 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_construct.h @@ -0,0 +1,129 @@ +// nonstandard construct and destroy functions -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_construct.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_CONSTRUCT_H +#define _STL_CONSTRUCT_H 1 + +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /** + * Constructs an object in existing memory by invoking an allocated + * object's constructor with an initializer. + */ + template + inline void + _Construct(_T1* __p, const _T2& __value) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 402. wrong new expression in [some_]allocator::construct + ::new(static_cast(__p)) _T1(__value); + } + + /** + * Destroy the object pointed to by a pointer type. + */ + template + inline void + _Destroy(_Tp* __pointer) + { __pointer->~_Tp(); } + + /** + * Destroy a range of objects. If the value_type of the object has + * a trivial destructor, the compiler should optimize all of this + * away, otherwise the objects' destructors must be invoked. + */ + template + inline void + _Destroy(_ForwardIterator __first, _ForwardIterator __last) + { + typedef typename iterator_traits<_ForwardIterator>::value_type + _Value_type; + if (!__has_trivial_destructor(_Value_type)) + for (; __first != __last; ++__first) + std::_Destroy(&*__first); + } + + /** + * Destroy a range of objects using the supplied allocator. For + * nondefault allocators we do not optimize away invocation of + * destroy() even if _Tp has a trivial destructor. + */ + + template class allocator; + + template + void + _Destroy(_ForwardIterator __first, _ForwardIterator __last, + _Allocator& __alloc) + { + for (; __first != __last; ++__first) + __alloc.destroy(&*__first); + } + + template + inline void + _Destroy(_ForwardIterator __first, _ForwardIterator __last, + allocator<_Tp>&) + { + _Destroy(__first, __last); + } + +_GLIBCXX_END_NAMESPACE + +#endif /* _STL_CONSTRUCT_H */ + diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_deque.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_deque.h new file mode 100644 index 00000000..1c20e275 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_deque.h @@ -0,0 +1,1819 @@ +// Deque implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_deque.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_DEQUE_H +#define _STL_DEQUE_H 1 + +#include +#include +#include +#include + +_GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D) + + /** + * @brief This function controls the size of memory nodes. + * @param size The size of an element. + * @return The number (not byte size) of elements per node. + * + * This function started off as a compiler kludge from SGI, but seems to + * be a useful wrapper around a repeated constant expression. The '512' is + * tunable (and no other code needs to change), but no investigation has + * been done since inheriting the SGI code. + */ + inline size_t + __deque_buf_size(size_t __size) + { return __size < 512 ? size_t(512 / __size) : size_t(1); } + + + /** + * @brief A deque::iterator. + * + * Quite a bit of intelligence here. Much of the functionality of + * deque is actually passed off to this class. A deque holds two + * of these internally, marking its valid range. Access to + * elements is done as offsets of either of those two, relying on + * operator overloading in this class. + * + * All the functions are op overloads except for _M_set_node. + */ + template + struct _Deque_iterator + { + typedef _Deque_iterator<_Tp, _Tp&, _Tp*> iterator; + typedef _Deque_iterator<_Tp, const _Tp&, const _Tp*> const_iterator; + + static size_t _S_buffer_size() + { return __deque_buf_size(sizeof(_Tp)); } + + typedef std::random_access_iterator_tag iterator_category; + typedef _Tp value_type; + typedef _Ptr pointer; + typedef _Ref reference; + typedef size_t size_type; + typedef ptrdiff_t difference_type; + typedef _Tp** _Map_pointer; + typedef _Deque_iterator _Self; + + _Tp* _M_cur; + _Tp* _M_first; + _Tp* _M_last; + _Map_pointer _M_node; + + _Deque_iterator(_Tp* __x, _Map_pointer __y) + : _M_cur(__x), _M_first(*__y), + _M_last(*__y + _S_buffer_size()), _M_node(__y) { } + + _Deque_iterator() + : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) { } + + _Deque_iterator(const iterator& __x) + : _M_cur(__x._M_cur), _M_first(__x._M_first), + _M_last(__x._M_last), _M_node(__x._M_node) { } + + reference + operator*() const + { return *_M_cur; } + + pointer + operator->() const + { return _M_cur; } + + _Self& + operator++() + { + ++_M_cur; + if (_M_cur == _M_last) + { + _M_set_node(_M_node + 1); + _M_cur = _M_first; + } + return *this; + } + + _Self + operator++(int) + { + _Self __tmp = *this; + ++*this; + return __tmp; + } + + _Self& + operator--() + { + if (_M_cur == _M_first) + { + _M_set_node(_M_node - 1); + _M_cur = _M_last; + } + --_M_cur; + return *this; + } + + _Self + operator--(int) + { + _Self __tmp = *this; + --*this; + return __tmp; + } + + _Self& + operator+=(difference_type __n) + { + const difference_type __offset = __n + (_M_cur - _M_first); + if (__offset >= 0 && __offset < difference_type(_S_buffer_size())) + _M_cur += __n; + else + { + const difference_type __node_offset = + __offset > 0 ? __offset / difference_type(_S_buffer_size()) + : -difference_type((-__offset - 1) + / _S_buffer_size()) - 1; + _M_set_node(_M_node + __node_offset); + _M_cur = _M_first + (__offset - __node_offset + * difference_type(_S_buffer_size())); + } + return *this; + } + + _Self + operator+(difference_type __n) const + { + _Self __tmp = *this; + return __tmp += __n; + } + + _Self& + operator-=(difference_type __n) + { return *this += -__n; } + + _Self + operator-(difference_type __n) const + { + _Self __tmp = *this; + return __tmp -= __n; + } + + reference + operator[](difference_type __n) const + { return *(*this + __n); } + + /** + * Prepares to traverse new_node. Sets everything except + * _M_cur, which should therefore be set by the caller + * immediately afterwards, based on _M_first and _M_last. + */ + void + _M_set_node(_Map_pointer __new_node) + { + _M_node = __new_node; + _M_first = *__new_node; + _M_last = _M_first + difference_type(_S_buffer_size()); + } + }; + + // Note: we also provide overloads whose operands are of the same type in + // order to avoid ambiguous overload resolution when std::rel_ops operators + // are in scope (for additional details, see libstdc++/3628) + template + inline bool + operator==(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, + const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) + { return __x._M_cur == __y._M_cur; } + + template + inline bool + operator==(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, + const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) + { return __x._M_cur == __y._M_cur; } + + template + inline bool + operator!=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, + const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) + { return !(__x == __y); } + + template + inline bool + operator!=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, + const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) + { return !(__x == __y); } + + template + inline bool + operator<(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, + const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) + { return (__x._M_node == __y._M_node) ? (__x._M_cur < __y._M_cur) + : (__x._M_node < __y._M_node); } + + template + inline bool + operator<(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, + const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) + { return (__x._M_node == __y._M_node) ? (__x._M_cur < __y._M_cur) + : (__x._M_node < __y._M_node); } + + template + inline bool + operator>(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, + const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) + { return __y < __x; } + + template + inline bool + operator>(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, + const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) + { return __y < __x; } + + template + inline bool + operator<=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, + const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) + { return !(__y < __x); } + + template + inline bool + operator<=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, + const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) + { return !(__y < __x); } + + template + inline bool + operator>=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, + const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) + { return !(__x < __y); } + + template + inline bool + operator>=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, + const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) + { return !(__x < __y); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // According to the resolution of DR179 not only the various comparison + // operators but also operator- must accept mixed iterator/const_iterator + // parameters. + template + inline typename _Deque_iterator<_Tp, _Ref, _Ptr>::difference_type + operator-(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, + const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) + { + return typename _Deque_iterator<_Tp, _Ref, _Ptr>::difference_type + (_Deque_iterator<_Tp, _Ref, _Ptr>::_S_buffer_size()) + * (__x._M_node - __y._M_node - 1) + (__x._M_cur - __x._M_first) + + (__y._M_last - __y._M_cur); + } + + template + inline typename _Deque_iterator<_Tp, _RefL, _PtrL>::difference_type + operator-(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, + const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) + { + return typename _Deque_iterator<_Tp, _RefL, _PtrL>::difference_type + (_Deque_iterator<_Tp, _RefL, _PtrL>::_S_buffer_size()) + * (__x._M_node - __y._M_node - 1) + (__x._M_cur - __x._M_first) + + (__y._M_last - __y._M_cur); + } + + template + inline _Deque_iterator<_Tp, _Ref, _Ptr> + operator+(ptrdiff_t __n, const _Deque_iterator<_Tp, _Ref, _Ptr>& __x) + { return __x + __n; } + + template + void + fill(const _Deque_iterator<_Tp, _Tp&, _Tp*>& __first, + const _Deque_iterator<_Tp, _Tp&, _Tp*>& __last, const _Tp& __value); + + /** + * Deque base class. This class provides the unified face for %deque's + * allocation. This class's constructor and destructor allocate and + * deallocate (but do not initialize) storage. This makes %exception + * safety easier. + * + * Nothing in this class ever constructs or destroys an actual Tp element. + * (Deque handles that itself.) Only/All memory management is performed + * here. + */ + template + class _Deque_base + { + public: + typedef _Alloc allocator_type; + + allocator_type + get_allocator() const + { return allocator_type(_M_get_Tp_allocator()); } + + typedef _Deque_iterator<_Tp, _Tp&, _Tp*> iterator; + typedef _Deque_iterator<_Tp, const _Tp&, const _Tp*> const_iterator; + + _Deque_base() + : _M_impl() + { _M_initialize_map(0); } + + _Deque_base(const allocator_type& __a, size_t __num_elements) + : _M_impl(__a) + { _M_initialize_map(__num_elements); } + + _Deque_base(const allocator_type& __a) + : _M_impl(__a) + { } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + _Deque_base(_Deque_base&& __x) + : _M_impl(__x._M_get_Tp_allocator()) + { + _M_initialize_map(0); + if (__x._M_impl._M_map) + { + std::swap(this->_M_impl._M_start, __x._M_impl._M_start); + std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish); + std::swap(this->_M_impl._M_map, __x._M_impl._M_map); + std::swap(this->_M_impl._M_map_size, __x._M_impl._M_map_size); + } + } +#endif + + ~_Deque_base(); + + protected: + //This struct encapsulates the implementation of the std::deque + //standard container and at the same time makes use of the EBO + //for empty allocators. + typedef typename _Alloc::template rebind<_Tp*>::other _Map_alloc_type; + + typedef typename _Alloc::template rebind<_Tp>::other _Tp_alloc_type; + + struct _Deque_impl + : public _Tp_alloc_type + { + _Tp** _M_map; + size_t _M_map_size; + iterator _M_start; + iterator _M_finish; + + _Deque_impl() + : _Tp_alloc_type(), _M_map(0), _M_map_size(0), + _M_start(), _M_finish() + { } + + _Deque_impl(const _Tp_alloc_type& __a) + : _Tp_alloc_type(__a), _M_map(0), _M_map_size(0), + _M_start(), _M_finish() + { } + }; + + _Tp_alloc_type& + _M_get_Tp_allocator() + { return *static_cast<_Tp_alloc_type*>(&this->_M_impl); } + + const _Tp_alloc_type& + _M_get_Tp_allocator() const + { return *static_cast(&this->_M_impl); } + + _Map_alloc_type + _M_get_map_allocator() const + { return _Map_alloc_type(_M_get_Tp_allocator()); } + + _Tp* + _M_allocate_node() + { + return _M_impl._Tp_alloc_type::allocate(__deque_buf_size(sizeof(_Tp))); + } + + void + _M_deallocate_node(_Tp* __p) + { + _M_impl._Tp_alloc_type::deallocate(__p, __deque_buf_size(sizeof(_Tp))); + } + + _Tp** + _M_allocate_map(size_t __n) + { return _M_get_map_allocator().allocate(__n); } + + void + _M_deallocate_map(_Tp** __p, size_t __n) + { _M_get_map_allocator().deallocate(__p, __n); } + + protected: + void _M_initialize_map(size_t); + void _M_create_nodes(_Tp** __nstart, _Tp** __nfinish); + void _M_destroy_nodes(_Tp** __nstart, _Tp** __nfinish); + enum { _S_initial_map_size = 8 }; + + _Deque_impl _M_impl; + }; + + template + _Deque_base<_Tp, _Alloc>:: + ~_Deque_base() + { + if (this->_M_impl._M_map) + { + _M_destroy_nodes(this->_M_impl._M_start._M_node, + this->_M_impl._M_finish._M_node + 1); + _M_deallocate_map(this->_M_impl._M_map, this->_M_impl._M_map_size); + } + } + + /** + * @brief Layout storage. + * @param num_elements The count of T's for which to allocate space + * at first. + * @return Nothing. + * + * The initial underlying memory layout is a bit complicated... + */ + template + void + _Deque_base<_Tp, _Alloc>:: + _M_initialize_map(size_t __num_elements) + { + const size_t __num_nodes = (__num_elements/ __deque_buf_size(sizeof(_Tp)) + + 1); + + this->_M_impl._M_map_size = std::max((size_t) _S_initial_map_size, + size_t(__num_nodes + 2)); + this->_M_impl._M_map = _M_allocate_map(this->_M_impl._M_map_size); + + // For "small" maps (needing less than _M_map_size nodes), allocation + // starts in the middle elements and grows outwards. So nstart may be + // the beginning of _M_map, but for small maps it may be as far in as + // _M_map+3. + + _Tp** __nstart = (this->_M_impl._M_map + + (this->_M_impl._M_map_size - __num_nodes) / 2); + _Tp** __nfinish = __nstart + __num_nodes; + + __try + { _M_create_nodes(__nstart, __nfinish); } + __catch(...) + { + _M_deallocate_map(this->_M_impl._M_map, this->_M_impl._M_map_size); + this->_M_impl._M_map = 0; + this->_M_impl._M_map_size = 0; + __throw_exception_again; + } + + this->_M_impl._M_start._M_set_node(__nstart); + this->_M_impl._M_finish._M_set_node(__nfinish - 1); + this->_M_impl._M_start._M_cur = _M_impl._M_start._M_first; + this->_M_impl._M_finish._M_cur = (this->_M_impl._M_finish._M_first + + __num_elements + % __deque_buf_size(sizeof(_Tp))); + } + + template + void + _Deque_base<_Tp, _Alloc>:: + _M_create_nodes(_Tp** __nstart, _Tp** __nfinish) + { + _Tp** __cur; + __try + { + for (__cur = __nstart; __cur < __nfinish; ++__cur) + *__cur = this->_M_allocate_node(); + } + __catch(...) + { + _M_destroy_nodes(__nstart, __cur); + __throw_exception_again; + } + } + + template + void + _Deque_base<_Tp, _Alloc>:: + _M_destroy_nodes(_Tp** __nstart, _Tp** __nfinish) + { + for (_Tp** __n = __nstart; __n < __nfinish; ++__n) + _M_deallocate_node(*__n); + } + + /** + * @brief A standard container using fixed-size memory allocation and + * constant-time manipulation of elements at either end. + * + * @ingroup sequences + * + * Meets the requirements of a container, a + * reversible container, and a + * sequence, including the + * optional sequence requirements. + * + * In previous HP/SGI versions of deque, there was an extra template + * parameter so users could control the node size. This extension turned + * out to violate the C++ standard (it can be detected using template + * template parameters), and it was removed. + * + * Here's how a deque manages memory. Each deque has 4 members: + * + * - Tp** _M_map + * - size_t _M_map_size + * - iterator _M_start, _M_finish + * + * map_size is at least 8. %map is an array of map_size + * pointers-to-"nodes". (The name %map has nothing to do with the + * std::map class, and "nodes" should not be confused with + * std::list's usage of "node".) + * + * A "node" has no specific type name as such, but it is referred + * to as "node" in this file. It is a simple array-of-Tp. If Tp + * is very large, there will be one Tp element per node (i.e., an + * "array" of one). For non-huge Tp's, node size is inversely + * related to Tp size: the larger the Tp, the fewer Tp's will fit + * in a node. The goal here is to keep the total size of a node + * relatively small and constant over different Tp's, to improve + * allocator efficiency. + * + * Not every pointer in the %map array will point to a node. If + * the initial number of elements in the deque is small, the + * /middle/ %map pointers will be valid, and the ones at the edges + * will be unused. This same situation will arise as the %map + * grows: available %map pointers, if any, will be on the ends. As + * new nodes are created, only a subset of the %map's pointers need + * to be copied "outward". + * + * Class invariants: + * - For any nonsingular iterator i: + * - i.node points to a member of the %map array. (Yes, you read that + * correctly: i.node does not actually point to a node.) The member of + * the %map array is what actually points to the node. + * - i.first == *(i.node) (This points to the node (first Tp element).) + * - i.last == i.first + node_size + * - i.cur is a pointer in the range [i.first, i.last). NOTE: + * the implication of this is that i.cur is always a dereferenceable + * pointer, even if i is a past-the-end iterator. + * - Start and Finish are always nonsingular iterators. NOTE: this + * means that an empty deque must have one node, a deque with > + class deque : protected _Deque_base<_Tp, _Alloc> + { + // concept requirements + typedef typename _Alloc::value_type _Alloc_value_type; + __glibcxx_class_requires(_Tp, _SGIAssignableConcept) + __glibcxx_class_requires2(_Tp, _Alloc_value_type, _SameTypeConcept) + + typedef _Deque_base<_Tp, _Alloc> _Base; + typedef typename _Base::_Tp_alloc_type _Tp_alloc_type; + + public: + typedef _Tp value_type; + typedef typename _Tp_alloc_type::pointer pointer; + typedef typename _Tp_alloc_type::const_pointer const_pointer; + typedef typename _Tp_alloc_type::reference reference; + typedef typename _Tp_alloc_type::const_reference const_reference; + typedef typename _Base::iterator iterator; + typedef typename _Base::const_iterator const_iterator; + typedef std::reverse_iterator const_reverse_iterator; + typedef std::reverse_iterator reverse_iterator; + typedef size_t size_type; + typedef ptrdiff_t difference_type; + typedef _Alloc allocator_type; + + protected: + typedef pointer* _Map_pointer; + + static size_t _S_buffer_size() + { return __deque_buf_size(sizeof(_Tp)); } + + // Functions controlling memory layout, and nothing else. + using _Base::_M_initialize_map; + using _Base::_M_create_nodes; + using _Base::_M_destroy_nodes; + using _Base::_M_allocate_node; + using _Base::_M_deallocate_node; + using _Base::_M_allocate_map; + using _Base::_M_deallocate_map; + using _Base::_M_get_Tp_allocator; + + /** + * A total of four data members accumulated down the hierarchy. + * May be accessed via _M_impl.* + */ + using _Base::_M_impl; + + public: + // [23.2.1.1] construct/copy/destroy + // (assign() and get_allocator() are also listed in this section) + /** + * @brief Default constructor creates no elements. + */ + deque() + : _Base() { } + + /** + * @brief Creates a %deque with no elements. + * @param a An allocator object. + */ + explicit + deque(const allocator_type& __a) + : _Base(__a, 0) { } + + /** + * @brief Creates a %deque with copies of an exemplar element. + * @param n The number of elements to initially create. + * @param value An element to copy. + * @param a An allocator. + * + * This constructor fills the %deque with @a n copies of @a value. + */ + explicit + deque(size_type __n, const value_type& __value = value_type(), + const allocator_type& __a = allocator_type()) + : _Base(__a, __n) + { _M_fill_initialize(__value); } + + /** + * @brief %Deque copy constructor. + * @param x A %deque of identical element and allocator types. + * + * The newly-created %deque uses a copy of the allocation object used + * by @a x. + */ + deque(const deque& __x) + : _Base(__x._M_get_Tp_allocator(), __x.size()) + { std::__uninitialized_copy_a(__x.begin(), __x.end(), + this->_M_impl._M_start, + _M_get_Tp_allocator()); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief %Deque move constructor. + * @param x A %deque of identical element and allocator types. + * + * The newly-created %deque contains the exact contents of @a x. + * The contents of @a x are a valid, but unspecified %deque. + */ + deque(deque&& __x) + : _Base(std::forward<_Base>(__x)) { } + + /** + * @brief Builds a %deque from an initializer list. + * @param l An initializer_list. + * @param a An allocator object. + * + * Create a %deque consisting of copies of the elements in the + * initializer_list @a l. + * + * This will call the element type's copy constructor N times + * (where N is l.size()) and do no memory reallocation. + */ + deque(initializer_list __l, + const allocator_type& __a = allocator_type()) + : _Base(__a) + { + _M_range_initialize(__l.begin(), __l.end(), + random_access_iterator_tag()); + } +#endif + + /** + * @brief Builds a %deque from a range. + * @param first An input iterator. + * @param last An input iterator. + * @param a An allocator object. + * + * Create a %deque consisting of copies of the elements from [first, + * last). + * + * If the iterators are forward, bidirectional, or random-access, then + * this will call the elements' copy constructor N times (where N is + * distance(first,last)) and do no memory reallocation. But if only + * input iterators are used, then this will do at most 2N calls to the + * copy constructor, and logN memory reallocations. + */ + template + deque(_InputIterator __first, _InputIterator __last, + const allocator_type& __a = allocator_type()) + : _Base(__a) + { + // Check whether it's an integral type. If so, it's not an iterator. + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + _M_initialize_dispatch(__first, __last, _Integral()); + } + + /** + * The dtor only erases the elements, and note that if the elements + * themselves are pointers, the pointed-to memory is not touched in any + * way. Managing the pointer is the user's responsibility. + */ + ~deque() + { _M_destroy_data(begin(), end(), _M_get_Tp_allocator()); } + + /** + * @brief %Deque assignment operator. + * @param x A %deque of identical element and allocator types. + * + * All the elements of @a x are copied, but unlike the copy constructor, + * the allocator object is not copied. + */ + deque& + operator=(const deque& __x); + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief %Deque move assignment operator. + * @param x A %deque of identical element and allocator types. + * + * The contents of @a x are moved into this deque (without copying). + * @a x is a valid, but unspecified %deque. + */ + deque& + operator=(deque&& __x) + { + // NB: DR 675. + this->clear(); + this->swap(__x); + return *this; + } + + /** + * @brief Assigns an initializer list to a %deque. + * @param l An initializer_list. + * + * This function fills a %deque with copies of the elements in the + * initializer_list @a l. + * + * Note that the assignment completely changes the %deque and that the + * resulting %deque's size is the same as the number of elements + * assigned. Old data may be lost. + */ + deque& + operator=(initializer_list __l) + { + this->assign(__l.begin(), __l.end()); + return *this; + } +#endif + + /** + * @brief Assigns a given value to a %deque. + * @param n Number of elements to be assigned. + * @param val Value to be assigned. + * + * This function fills a %deque with @a n copies of the given + * value. Note that the assignment completely changes the + * %deque and that the resulting %deque's size is the same as + * the number of elements assigned. Old data may be lost. + */ + void + assign(size_type __n, const value_type& __val) + { _M_fill_assign(__n, __val); } + + /** + * @brief Assigns a range to a %deque. + * @param first An input iterator. + * @param last An input iterator. + * + * This function fills a %deque with copies of the elements in the + * range [first,last). + * + * Note that the assignment completely changes the %deque and that the + * resulting %deque's size is the same as the number of elements + * assigned. Old data may be lost. + */ + template + void + assign(_InputIterator __first, _InputIterator __last) + { + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + _M_assign_dispatch(__first, __last, _Integral()); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Assigns an initializer list to a %deque. + * @param l An initializer_list. + * + * This function fills a %deque with copies of the elements in the + * initializer_list @a l. + * + * Note that the assignment completely changes the %deque and that the + * resulting %deque's size is the same as the number of elements + * assigned. Old data may be lost. + */ + void + assign(initializer_list __l) + { this->assign(__l.begin(), __l.end()); } +#endif + + /// Get a copy of the memory allocation object. + allocator_type + get_allocator() const + { return _Base::get_allocator(); } + + // iterators + /** + * Returns a read/write iterator that points to the first element in the + * %deque. Iteration is done in ordinary element order. + */ + iterator + begin() + { return this->_M_impl._M_start; } + + /** + * Returns a read-only (constant) iterator that points to the first + * element in the %deque. Iteration is done in ordinary element order. + */ + const_iterator + begin() const + { return this->_M_impl._M_start; } + + /** + * Returns a read/write iterator that points one past the last + * element in the %deque. Iteration is done in ordinary + * element order. + */ + iterator + end() + { return this->_M_impl._M_finish; } + + /** + * Returns a read-only (constant) iterator that points one past + * the last element in the %deque. Iteration is done in + * ordinary element order. + */ + const_iterator + end() const + { return this->_M_impl._M_finish; } + + /** + * Returns a read/write reverse iterator that points to the + * last element in the %deque. Iteration is done in reverse + * element order. + */ + reverse_iterator + rbegin() + { return reverse_iterator(this->_M_impl._M_finish); } + + /** + * Returns a read-only (constant) reverse iterator that points + * to the last element in the %deque. Iteration is done in + * reverse element order. + */ + const_reverse_iterator + rbegin() const + { return const_reverse_iterator(this->_M_impl._M_finish); } + + /** + * Returns a read/write reverse iterator that points to one + * before the first element in the %deque. Iteration is done + * in reverse element order. + */ + reverse_iterator + rend() + { return reverse_iterator(this->_M_impl._M_start); } + + /** + * Returns a read-only (constant) reverse iterator that points + * to one before the first element in the %deque. Iteration is + * done in reverse element order. + */ + const_reverse_iterator + rend() const + { return const_reverse_iterator(this->_M_impl._M_start); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * Returns a read-only (constant) iterator that points to the first + * element in the %deque. Iteration is done in ordinary element order. + */ + const_iterator + cbegin() const + { return this->_M_impl._M_start; } + + /** + * Returns a read-only (constant) iterator that points one past + * the last element in the %deque. Iteration is done in + * ordinary element order. + */ + const_iterator + cend() const + { return this->_M_impl._M_finish; } + + /** + * Returns a read-only (constant) reverse iterator that points + * to the last element in the %deque. Iteration is done in + * reverse element order. + */ + const_reverse_iterator + crbegin() const + { return const_reverse_iterator(this->_M_impl._M_finish); } + + /** + * Returns a read-only (constant) reverse iterator that points + * to one before the first element in the %deque. Iteration is + * done in reverse element order. + */ + const_reverse_iterator + crend() const + { return const_reverse_iterator(this->_M_impl._M_start); } +#endif + + // [23.2.1.2] capacity + /** Returns the number of elements in the %deque. */ + size_type + size() const + { return this->_M_impl._M_finish - this->_M_impl._M_start; } + + /** Returns the size() of the largest possible %deque. */ + size_type + max_size() const + { return _M_get_Tp_allocator().max_size(); } + + /** + * @brief Resizes the %deque to the specified number of elements. + * @param new_size Number of elements the %deque should contain. + * @param x Data with which new elements should be populated. + * + * This function will %resize the %deque to the specified + * number of elements. If the number is smaller than the + * %deque's current size the %deque is truncated, otherwise the + * %deque is extended and new elements are populated with given + * data. + */ + void + resize(size_type __new_size, value_type __x = value_type()) + { + const size_type __len = size(); + if (__new_size < __len) + _M_erase_at_end(this->_M_impl._M_start + difference_type(__new_size)); + else + insert(this->_M_impl._M_finish, __new_size - __len, __x); + } + + /** + * Returns true if the %deque is empty. (Thus begin() would + * equal end().) + */ + bool + empty() const + { return this->_M_impl._M_finish == this->_M_impl._M_start; } + + // element access + /** + * @brief Subscript access to the data contained in the %deque. + * @param n The index of the element for which data should be + * accessed. + * @return Read/write reference to data. + * + * This operator allows for easy, array-style, data access. + * Note that data access with this operator is unchecked and + * out_of_range lookups are not defined. (For checked lookups + * see at().) + */ + reference + operator[](size_type __n) + { return this->_M_impl._M_start[difference_type(__n)]; } + + /** + * @brief Subscript access to the data contained in the %deque. + * @param n The index of the element for which data should be + * accessed. + * @return Read-only (constant) reference to data. + * + * This operator allows for easy, array-style, data access. + * Note that data access with this operator is unchecked and + * out_of_range lookups are not defined. (For checked lookups + * see at().) + */ + const_reference + operator[](size_type __n) const + { return this->_M_impl._M_start[difference_type(__n)]; } + + protected: + /// Safety check used only from at(). + void + _M_range_check(size_type __n) const + { + if (__n >= this->size()) + __throw_out_of_range(__N("deque::_M_range_check")); + } + + public: + /** + * @brief Provides access to the data contained in the %deque. + * @param n The index of the element for which data should be + * accessed. + * @return Read/write reference to data. + * @throw std::out_of_range If @a n is an invalid index. + * + * This function provides for safer data access. The parameter + * is first checked that it is in the range of the deque. The + * function throws out_of_range if the check fails. + */ + reference + at(size_type __n) + { + _M_range_check(__n); + return (*this)[__n]; + } + + /** + * @brief Provides access to the data contained in the %deque. + * @param n The index of the element for which data should be + * accessed. + * @return Read-only (constant) reference to data. + * @throw std::out_of_range If @a n is an invalid index. + * + * This function provides for safer data access. The parameter is first + * checked that it is in the range of the deque. The function throws + * out_of_range if the check fails. + */ + const_reference + at(size_type __n) const + { + _M_range_check(__n); + return (*this)[__n]; + } + + /** + * Returns a read/write reference to the data at the first + * element of the %deque. + */ + reference + front() + { return *begin(); } + + /** + * Returns a read-only (constant) reference to the data at the first + * element of the %deque. + */ + const_reference + front() const + { return *begin(); } + + /** + * Returns a read/write reference to the data at the last element of the + * %deque. + */ + reference + back() + { + iterator __tmp = end(); + --__tmp; + return *__tmp; + } + + /** + * Returns a read-only (constant) reference to the data at the last + * element of the %deque. + */ + const_reference + back() const + { + const_iterator __tmp = end(); + --__tmp; + return *__tmp; + } + + // [23.2.1.2] modifiers + /** + * @brief Add data to the front of the %deque. + * @param x Data to be added. + * + * This is a typical stack operation. The function creates an + * element at the front of the %deque and assigns the given + * data to it. Due to the nature of a %deque this operation + * can be done in constant time. + */ + void + push_front(const value_type& __x) + { + if (this->_M_impl._M_start._M_cur != this->_M_impl._M_start._M_first) + { + this->_M_impl.construct(this->_M_impl._M_start._M_cur - 1, __x); + --this->_M_impl._M_start._M_cur; + } + else + _M_push_front_aux(__x); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + void + push_front(value_type&& __x) + { emplace_front(std::move(__x)); } + + template + void + emplace_front(_Args&&... __args); +#endif + + /** + * @brief Add data to the end of the %deque. + * @param x Data to be added. + * + * This is a typical stack operation. The function creates an + * element at the end of the %deque and assigns the given data + * to it. Due to the nature of a %deque this operation can be + * done in constant time. + */ + void + push_back(const value_type& __x) + { + if (this->_M_impl._M_finish._M_cur + != this->_M_impl._M_finish._M_last - 1) + { + this->_M_impl.construct(this->_M_impl._M_finish._M_cur, __x); + ++this->_M_impl._M_finish._M_cur; + } + else + _M_push_back_aux(__x); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + void + push_back(value_type&& __x) + { emplace_back(std::move(__x)); } + + template + void + emplace_back(_Args&&... __args); +#endif + + /** + * @brief Removes first element. + * + * This is a typical stack operation. It shrinks the %deque by one. + * + * Note that no data is returned, and if the first element's data is + * needed, it should be retrieved before pop_front() is called. + */ + void + pop_front() + { + if (this->_M_impl._M_start._M_cur + != this->_M_impl._M_start._M_last - 1) + { + this->_M_impl.destroy(this->_M_impl._M_start._M_cur); + ++this->_M_impl._M_start._M_cur; + } + else + _M_pop_front_aux(); + } + + /** + * @brief Removes last element. + * + * This is a typical stack operation. It shrinks the %deque by one. + * + * Note that no data is returned, and if the last element's data is + * needed, it should be retrieved before pop_back() is called. + */ + void + pop_back() + { + if (this->_M_impl._M_finish._M_cur + != this->_M_impl._M_finish._M_first) + { + --this->_M_impl._M_finish._M_cur; + this->_M_impl.destroy(this->_M_impl._M_finish._M_cur); + } + else + _M_pop_back_aux(); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Inserts an object in %deque before specified iterator. + * @param position An iterator into the %deque. + * @param args Arguments. + * @return An iterator that points to the inserted data. + * + * This function will insert an object of type T constructed + * with T(std::forward(args)...) before the specified location. + */ + template + iterator + emplace(iterator __position, _Args&&... __args); +#endif + + /** + * @brief Inserts given value into %deque before specified iterator. + * @param position An iterator into the %deque. + * @param x Data to be inserted. + * @return An iterator that points to the inserted data. + * + * This function will insert a copy of the given value before the + * specified location. + */ + iterator + insert(iterator __position, const value_type& __x); + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Inserts given rvalue into %deque before specified iterator. + * @param position An iterator into the %deque. + * @param x Data to be inserted. + * @return An iterator that points to the inserted data. + * + * This function will insert a copy of the given rvalue before the + * specified location. + */ + iterator + insert(iterator __position, value_type&& __x) + { return emplace(__position, std::move(__x)); } + + /** + * @brief Inserts an initializer list into the %deque. + * @param p An iterator into the %deque. + * @param l An initializer_list. + * + * This function will insert copies of the data in the + * initializer_list @a l into the %deque before the location + * specified by @a p. This is known as "list insert." + */ + void + insert(iterator __p, initializer_list __l) + { this->insert(__p, __l.begin(), __l.end()); } +#endif + + /** + * @brief Inserts a number of copies of given data into the %deque. + * @param position An iterator into the %deque. + * @param n Number of elements to be inserted. + * @param x Data to be inserted. + * + * This function will insert a specified number of copies of the given + * data before the location specified by @a position. + */ + void + insert(iterator __position, size_type __n, const value_type& __x) + { _M_fill_insert(__position, __n, __x); } + + /** + * @brief Inserts a range into the %deque. + * @param position An iterator into the %deque. + * @param first An input iterator. + * @param last An input iterator. + * + * This function will insert copies of the data in the range + * [first,last) into the %deque before the location specified + * by @a pos. This is known as "range insert." + */ + template + void + insert(iterator __position, _InputIterator __first, + _InputIterator __last) + { + // Check whether it's an integral type. If so, it's not an iterator. + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + _M_insert_dispatch(__position, __first, __last, _Integral()); + } + + /** + * @brief Remove element at given position. + * @param position Iterator pointing to element to be erased. + * @return An iterator pointing to the next element (or end()). + * + * This function will erase the element at the given position and thus + * shorten the %deque by one. + * + * The user is cautioned that + * this function only erases the element, and that if the element is + * itself a pointer, the pointed-to memory is not touched in any way. + * Managing the pointer is the user's responsibility. + */ + iterator + erase(iterator __position); + + /** + * @brief Remove a range of elements. + * @param first Iterator pointing to the first element to be erased. + * @param last Iterator pointing to one past the last element to be + * erased. + * @return An iterator pointing to the element pointed to by @a last + * prior to erasing (or end()). + * + * This function will erase the elements in the range [first,last) and + * shorten the %deque accordingly. + * + * The user is cautioned that + * this function only erases the elements, and that if the elements + * themselves are pointers, the pointed-to memory is not touched in any + * way. Managing the pointer is the user's responsibility. + */ + iterator + erase(iterator __first, iterator __last); + + /** + * @brief Swaps data with another %deque. + * @param x A %deque of the same element and allocator types. + * + * This exchanges the elements between two deques in constant time. + * (Four pointers, so it should be quite fast.) + * Note that the global std::swap() function is specialized such that + * std::swap(d1,d2) will feed to this function. + */ + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + swap(deque&& __x) +#else + swap(deque& __x) +#endif + { + std::swap(this->_M_impl._M_start, __x._M_impl._M_start); + std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish); + std::swap(this->_M_impl._M_map, __x._M_impl._M_map); + std::swap(this->_M_impl._M_map_size, __x._M_impl._M_map_size); + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 431. Swapping containers with unequal allocators. + std::__alloc_swap<_Tp_alloc_type>::_S_do_it(_M_get_Tp_allocator(), + __x._M_get_Tp_allocator()); + } + + /** + * Erases all the elements. Note that this function only erases the + * elements, and that if the elements themselves are pointers, the + * pointed-to memory is not touched in any way. Managing the pointer is + * the user's responsibility. + */ + void + clear() + { _M_erase_at_end(begin()); } + + protected: + // Internal constructor functions follow. + + // called by the range constructor to implement [23.1.1]/9 + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 438. Ambiguity in the "do the right thing" clause + template + void + _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) + { + _M_initialize_map(static_cast(__n)); + _M_fill_initialize(__x); + } + + // called by the range constructor to implement [23.1.1]/9 + template + void + _M_initialize_dispatch(_InputIterator __first, _InputIterator __last, + __false_type) + { + typedef typename std::iterator_traits<_InputIterator>:: + iterator_category _IterCategory; + _M_range_initialize(__first, __last, _IterCategory()); + } + + // called by the second initialize_dispatch above + //@{ + /** + * @brief Fills the deque with whatever is in [first,last). + * @param first An input iterator. + * @param last An input iterator. + * @return Nothing. + * + * If the iterators are actually forward iterators (or better), then the + * memory layout can be done all at once. Else we move forward using + * push_back on each value from the iterator. + */ + template + void + _M_range_initialize(_InputIterator __first, _InputIterator __last, + std::input_iterator_tag); + + // called by the second initialize_dispatch above + template + void + _M_range_initialize(_ForwardIterator __first, _ForwardIterator __last, + std::forward_iterator_tag); + //@} + + /** + * @brief Fills the %deque with copies of value. + * @param value Initial value. + * @return Nothing. + * @pre _M_start and _M_finish have already been initialized, + * but none of the %deque's elements have yet been constructed. + * + * This function is called only when the user provides an explicit size + * (with or without an explicit exemplar value). + */ + void + _M_fill_initialize(const value_type& __value); + + // Internal assign functions follow. The *_aux functions do the actual + // assignment work for the range versions. + + // called by the range assign to implement [23.1.1]/9 + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 438. Ambiguity in the "do the right thing" clause + template + void + _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) + { _M_fill_assign(__n, __val); } + + // called by the range assign to implement [23.1.1]/9 + template + void + _M_assign_dispatch(_InputIterator __first, _InputIterator __last, + __false_type) + { + typedef typename std::iterator_traits<_InputIterator>:: + iterator_category _IterCategory; + _M_assign_aux(__first, __last, _IterCategory()); + } + + // called by the second assign_dispatch above + template + void + _M_assign_aux(_InputIterator __first, _InputIterator __last, + std::input_iterator_tag); + + // called by the second assign_dispatch above + template + void + _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last, + std::forward_iterator_tag) + { + const size_type __len = std::distance(__first, __last); + if (__len > size()) + { + _ForwardIterator __mid = __first; + std::advance(__mid, size()); + std::copy(__first, __mid, begin()); + insert(end(), __mid, __last); + } + else + _M_erase_at_end(std::copy(__first, __last, begin())); + } + + // Called by assign(n,t), and the range assign when it turns out + // to be the same thing. + void + _M_fill_assign(size_type __n, const value_type& __val) + { + if (__n > size()) + { + std::fill(begin(), end(), __val); + insert(end(), __n - size(), __val); + } + else + { + _M_erase_at_end(begin() + difference_type(__n)); + std::fill(begin(), end(), __val); + } + } + + //@{ + /// Helper functions for push_* and pop_*. +#ifndef __GXX_EXPERIMENTAL_CXX0X__ + void _M_push_back_aux(const value_type&); + + void _M_push_front_aux(const value_type&); +#else + template + void _M_push_back_aux(_Args&&... __args); + + template + void _M_push_front_aux(_Args&&... __args); +#endif + + void _M_pop_back_aux(); + + void _M_pop_front_aux(); + //@} + + // Internal insert functions follow. The *_aux functions do the actual + // insertion work when all shortcuts fail. + + // called by the range insert to implement [23.1.1]/9 + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 438. Ambiguity in the "do the right thing" clause + template + void + _M_insert_dispatch(iterator __pos, + _Integer __n, _Integer __x, __true_type) + { _M_fill_insert(__pos, __n, __x); } + + // called by the range insert to implement [23.1.1]/9 + template + void + _M_insert_dispatch(iterator __pos, + _InputIterator __first, _InputIterator __last, + __false_type) + { + typedef typename std::iterator_traits<_InputIterator>:: + iterator_category _IterCategory; + _M_range_insert_aux(__pos, __first, __last, _IterCategory()); + } + + // called by the second insert_dispatch above + template + void + _M_range_insert_aux(iterator __pos, _InputIterator __first, + _InputIterator __last, std::input_iterator_tag); + + // called by the second insert_dispatch above + template + void + _M_range_insert_aux(iterator __pos, _ForwardIterator __first, + _ForwardIterator __last, std::forward_iterator_tag); + + // Called by insert(p,n,x), and the range insert when it turns out to be + // the same thing. Can use fill functions in optimal situations, + // otherwise passes off to insert_aux(p,n,x). + void + _M_fill_insert(iterator __pos, size_type __n, const value_type& __x); + + // called by insert(p,x) +#ifndef __GXX_EXPERIMENTAL_CXX0X__ + iterator + _M_insert_aux(iterator __pos, const value_type& __x); +#else + template + iterator + _M_insert_aux(iterator __pos, _Args&&... __args); +#endif + + // called by insert(p,n,x) via fill_insert + void + _M_insert_aux(iterator __pos, size_type __n, const value_type& __x); + + // called by range_insert_aux for forward iterators + template + void + _M_insert_aux(iterator __pos, + _ForwardIterator __first, _ForwardIterator __last, + size_type __n); + + + // Internal erase functions follow. + + void + _M_destroy_data_aux(iterator __first, iterator __last); + + // Called by ~deque(). + // NB: Doesn't deallocate the nodes. + template + void + _M_destroy_data(iterator __first, iterator __last, const _Alloc1&) + { _M_destroy_data_aux(__first, __last); } + + void + _M_destroy_data(iterator __first, iterator __last, + const std::allocator<_Tp>&) + { + if (!__has_trivial_destructor(value_type)) + _M_destroy_data_aux(__first, __last); + } + + // Called by erase(q1, q2). + void + _M_erase_at_begin(iterator __pos) + { + _M_destroy_data(begin(), __pos, _M_get_Tp_allocator()); + _M_destroy_nodes(this->_M_impl._M_start._M_node, __pos._M_node); + this->_M_impl._M_start = __pos; + } + + // Called by erase(q1, q2), resize(), clear(), _M_assign_aux, + // _M_fill_assign, operator=. + void + _M_erase_at_end(iterator __pos) + { + _M_destroy_data(__pos, end(), _M_get_Tp_allocator()); + _M_destroy_nodes(__pos._M_node + 1, + this->_M_impl._M_finish._M_node + 1); + this->_M_impl._M_finish = __pos; + } + + //@{ + /// Memory-handling helpers for the previous internal insert functions. + iterator + _M_reserve_elements_at_front(size_type __n) + { + const size_type __vacancies = this->_M_impl._M_start._M_cur + - this->_M_impl._M_start._M_first; + if (__n > __vacancies) + _M_new_elements_at_front(__n - __vacancies); + return this->_M_impl._M_start - difference_type(__n); + } + + iterator + _M_reserve_elements_at_back(size_type __n) + { + const size_type __vacancies = (this->_M_impl._M_finish._M_last + - this->_M_impl._M_finish._M_cur) - 1; + if (__n > __vacancies) + _M_new_elements_at_back(__n - __vacancies); + return this->_M_impl._M_finish + difference_type(__n); + } + + void + _M_new_elements_at_front(size_type __new_elements); + + void + _M_new_elements_at_back(size_type __new_elements); + //@} + + + //@{ + /** + * @brief Memory-handling helpers for the major %map. + * + * Makes sure the _M_map has space for new nodes. Does not + * actually add the nodes. Can invalidate _M_map pointers. + * (And consequently, %deque iterators.) + */ + void + _M_reserve_map_at_back(size_type __nodes_to_add = 1) + { + if (__nodes_to_add + 1 > this->_M_impl._M_map_size + - (this->_M_impl._M_finish._M_node - this->_M_impl._M_map)) + _M_reallocate_map(__nodes_to_add, false); + } + + void + _M_reserve_map_at_front(size_type __nodes_to_add = 1) + { + if (__nodes_to_add > size_type(this->_M_impl._M_start._M_node + - this->_M_impl._M_map)) + _M_reallocate_map(__nodes_to_add, true); + } + + void + _M_reallocate_map(size_type __nodes_to_add, bool __add_at_front); + //@} + }; + + + /** + * @brief Deque equality comparison. + * @param x A %deque. + * @param y A %deque of the same type as @a x. + * @return True iff the size and elements of the deques are equal. + * + * This is an equivalence relation. It is linear in the size of the + * deques. Deques are considered equivalent if their sizes are equal, + * and if corresponding elements compare equal. + */ + template + inline bool + operator==(const deque<_Tp, _Alloc>& __x, + const deque<_Tp, _Alloc>& __y) + { return __x.size() == __y.size() + && std::equal(__x.begin(), __x.end(), __y.begin()); } + + /** + * @brief Deque ordering relation. + * @param x A %deque. + * @param y A %deque of the same type as @a x. + * @return True iff @a x is lexicographically less than @a y. + * + * This is a total ordering relation. It is linear in the size of the + * deques. The elements must be comparable with @c <. + * + * See std::lexicographical_compare() for how the determination is made. + */ + template + inline bool + operator<(const deque<_Tp, _Alloc>& __x, + const deque<_Tp, _Alloc>& __y) + { return std::lexicographical_compare(__x.begin(), __x.end(), + __y.begin(), __y.end()); } + + /// Based on operator== + template + inline bool + operator!=(const deque<_Tp, _Alloc>& __x, + const deque<_Tp, _Alloc>& __y) + { return !(__x == __y); } + + /// Based on operator< + template + inline bool + operator>(const deque<_Tp, _Alloc>& __x, + const deque<_Tp, _Alloc>& __y) + { return __y < __x; } + + /// Based on operator< + template + inline bool + operator<=(const deque<_Tp, _Alloc>& __x, + const deque<_Tp, _Alloc>& __y) + { return !(__y < __x); } + + /// Based on operator< + template + inline bool + operator>=(const deque<_Tp, _Alloc>& __x, + const deque<_Tp, _Alloc>& __y) + { return !(__x < __y); } + + /// See std::deque::swap(). + template + inline void + swap(deque<_Tp,_Alloc>& __x, deque<_Tp,_Alloc>& __y) + { __x.swap(__y); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + inline void + swap(deque<_Tp,_Alloc>&& __x, deque<_Tp,_Alloc>& __y) + { __x.swap(__y); } + + template + inline void + swap(deque<_Tp,_Alloc>& __x, deque<_Tp,_Alloc>&& __y) + { __x.swap(__y); } +#endif + +_GLIBCXX_END_NESTED_NAMESPACE + +#endif /* _STL_DEQUE_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_function.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_function.h new file mode 100644 index 00000000..b2569d51 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_function.h @@ -0,0 +1,715 @@ +// Functor implementations -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996-1998 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_function.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_FUNCTION_H +#define _STL_FUNCTION_H 1 + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // 20.3.1 base classes + /** @defgroup functors Function Objects + * @ingroup utilities + * + * Function objects, or @e functors, are objects with an @c operator() + * defined and accessible. They can be passed as arguments to algorithm + * templates and used in place of a function pointer. Not only is the + * resulting expressiveness of the library increased, but the generated + * code can be more efficient than what you might write by hand. When we + * refer to "functors," then, generally we include function pointers in + * the description as well. + * + * Often, functors are only created as temporaries passed to algorithm + * calls, rather than being created as named variables. + * + * Two examples taken from the standard itself follow. To perform a + * by-element addition of two vectors @c a and @c b containing @c double, + * and put the result in @c a, use + * \code + * transform (a.begin(), a.end(), b.begin(), a.begin(), plus()); + * \endcode + * To negate every element in @c a, use + * \code + * transform(a.begin(), a.end(), a.begin(), negate()); + * \endcode + * The addition and negation functions will be inlined directly. + * + * The standard functors are derived from structs named @c unary_function + * and @c binary_function. These two classes contain nothing but typedefs, + * to aid in generic (template) programming. If you write your own + * functors, you might consider doing the same. + * + * @{ + */ + /** + * This is one of the @link functors functor base classes@endlink. + */ + template + struct unary_function + { + typedef _Arg argument_type; ///< @c argument_type is the type of the + /// argument (no surprises here) + + typedef _Result result_type; ///< @c result_type is the return type + }; + + /** + * This is one of the @link functors functor base classes@endlink. + */ + template + struct binary_function + { + typedef _Arg1 first_argument_type; ///< the type of the first argument + /// (no surprises here) + + typedef _Arg2 second_argument_type; ///< the type of the second argument + typedef _Result result_type; ///< type of the return type + }; + /** @} */ + + // 20.3.2 arithmetic + /** @defgroup arithmetic_functors Arithmetic Classes + * @ingroup functors + * + * Because basic math often needs to be done during an algorithm, + * the library provides functors for those operations. See the + * documentation for @link functors the base classes@endlink + * for examples of their use. + * + * @{ + */ + /// One of the @link arithmetic_functors math functors@endlink. + template + struct plus : public binary_function<_Tp, _Tp, _Tp> + { + _Tp + operator()(const _Tp& __x, const _Tp& __y) const + { return __x + __y; } + }; + + /// One of the @link arithmetic_functors math functors@endlink. + template + struct minus : public binary_function<_Tp, _Tp, _Tp> + { + _Tp + operator()(const _Tp& __x, const _Tp& __y) const + { return __x - __y; } + }; + + /// One of the @link arithmetic_functors math functors@endlink. + template + struct multiplies : public binary_function<_Tp, _Tp, _Tp> + { + _Tp + operator()(const _Tp& __x, const _Tp& __y) const + { return __x * __y; } + }; + + /// One of the @link arithmetic_functors math functors@endlink. + template + struct divides : public binary_function<_Tp, _Tp, _Tp> + { + _Tp + operator()(const _Tp& __x, const _Tp& __y) const + { return __x / __y; } + }; + + /// One of the @link arithmetic_functors math functors@endlink. + template + struct modulus : public binary_function<_Tp, _Tp, _Tp> + { + _Tp + operator()(const _Tp& __x, const _Tp& __y) const + { return __x % __y; } + }; + + /// One of the @link arithmetic_functors math functors@endlink. + template + struct negate : public unary_function<_Tp, _Tp> + { + _Tp + operator()(const _Tp& __x) const + { return -__x; } + }; + /** @} */ + + // 20.3.3 comparisons + /** @defgroup comparison_functors Comparison Classes + * @ingroup functors + * + * The library provides six wrapper functors for all the basic comparisons + * in C++, like @c <. + * + * @{ + */ + /// One of the @link comparison_functors comparison functors@endlink. + template + struct equal_to : public binary_function<_Tp, _Tp, bool> + { + bool + operator()(const _Tp& __x, const _Tp& __y) const + { return __x == __y; } + }; + + /// One of the @link comparison_functors comparison functors@endlink. + template + struct not_equal_to : public binary_function<_Tp, _Tp, bool> + { + bool + operator()(const _Tp& __x, const _Tp& __y) const + { return __x != __y; } + }; + + /// One of the @link comparison_functors comparison functors@endlink. + template + struct greater : public binary_function<_Tp, _Tp, bool> + { + bool + operator()(const _Tp& __x, const _Tp& __y) const + { return __x > __y; } + }; + + /// One of the @link comparison_functors comparison functors@endlink. + template + struct less : public binary_function<_Tp, _Tp, bool> + { + bool + operator()(const _Tp& __x, const _Tp& __y) const + { return __x < __y; } + }; + + /// One of the @link comparison_functors comparison functors@endlink. + template + struct greater_equal : public binary_function<_Tp, _Tp, bool> + { + bool + operator()(const _Tp& __x, const _Tp& __y) const + { return __x >= __y; } + }; + + /// One of the @link comparison_functors comparison functors@endlink. + template + struct less_equal : public binary_function<_Tp, _Tp, bool> + { + bool + operator()(const _Tp& __x, const _Tp& __y) const + { return __x <= __y; } + }; + /** @} */ + + // 20.3.4 logical operations + /** @defgroup logical_functors Boolean Operations Classes + * @ingroup functors + * + * Here are wrapper functors for Boolean operations: @c &&, @c ||, + * and @c !. + * + * @{ + */ + /// One of the @link logical_functors Boolean operations functors@endlink. + template + struct logical_and : public binary_function<_Tp, _Tp, bool> + { + bool + operator()(const _Tp& __x, const _Tp& __y) const + { return __x && __y; } + }; + + /// One of the @link logical_functors Boolean operations functors@endlink. + template + struct logical_or : public binary_function<_Tp, _Tp, bool> + { + bool + operator()(const _Tp& __x, const _Tp& __y) const + { return __x || __y; } + }; + + /// One of the @link logical_functors Boolean operations functors@endlink. + template + struct logical_not : public unary_function<_Tp, bool> + { + bool + operator()(const _Tp& __x) const + { return !__x; } + }; + /** @} */ + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 660. Missing Bitwise Operations. + template + struct bit_and : public binary_function<_Tp, _Tp, _Tp> + { + _Tp + operator()(const _Tp& __x, const _Tp& __y) const + { return __x & __y; } + }; + + template + struct bit_or : public binary_function<_Tp, _Tp, _Tp> + { + _Tp + operator()(const _Tp& __x, const _Tp& __y) const + { return __x | __y; } + }; + + template + struct bit_xor : public binary_function<_Tp, _Tp, _Tp> + { + _Tp + operator()(const _Tp& __x, const _Tp& __y) const + { return __x ^ __y; } + }; + + // 20.3.5 negators + /** @defgroup negators Negators + * @ingroup functors + * + * The functions @c not1 and @c not2 each take a predicate functor + * and return an instance of @c unary_negate or + * @c binary_negate, respectively. These classes are functors whose + * @c operator() performs the stored predicate function and then returns + * the negation of the result. + * + * For example, given a vector of integers and a trivial predicate, + * \code + * struct IntGreaterThanThree + * : public std::unary_function + * { + * bool operator() (int x) { return x > 3; } + * }; + * + * std::find_if (v.begin(), v.end(), not1(IntGreaterThanThree())); + * \endcode + * The call to @c find_if will locate the first index (i) of @c v for which + * "!(v[i] > 3)" is true. + * + * The not1/unary_negate combination works on predicates taking a single + * argument. The not2/binary_negate combination works on predicates which + * take two arguments. + * + * @{ + */ + /// One of the @link negators negation functors@endlink. + template + class unary_negate + : public unary_function + { + protected: + _Predicate _M_pred; + + public: + explicit + unary_negate(const _Predicate& __x) : _M_pred(__x) { } + + bool + operator()(const typename _Predicate::argument_type& __x) const + { return !_M_pred(__x); } + }; + + /// One of the @link negators negation functors@endlink. + template + inline unary_negate<_Predicate> + not1(const _Predicate& __pred) + { return unary_negate<_Predicate>(__pred); } + + /// One of the @link negators negation functors@endlink. + template + class binary_negate + : public binary_function + { + protected: + _Predicate _M_pred; + + public: + explicit + binary_negate(const _Predicate& __x) : _M_pred(__x) { } + + bool + operator()(const typename _Predicate::first_argument_type& __x, + const typename _Predicate::second_argument_type& __y) const + { return !_M_pred(__x, __y); } + }; + + /// One of the @link negators negation functors@endlink. + template + inline binary_negate<_Predicate> + not2(const _Predicate& __pred) + { return binary_negate<_Predicate>(__pred); } + /** @} */ + + // 20.3.7 adaptors pointers functions + /** @defgroup pointer_adaptors Adaptors for pointers to functions + * @ingroup functors + * + * The advantage of function objects over pointers to functions is that + * the objects in the standard library declare nested typedefs describing + * their argument and result types with uniform names (e.g., @c result_type + * from the base classes @c unary_function and @c binary_function). + * Sometimes those typedefs are required, not just optional. + * + * Adaptors are provided to turn pointers to unary (single-argument) and + * binary (double-argument) functions into function objects. The + * long-winded functor @c pointer_to_unary_function is constructed with a + * function pointer @c f, and its @c operator() called with argument @c x + * returns @c f(x). The functor @c pointer_to_binary_function does the same + * thing, but with a double-argument @c f and @c operator(). + * + * The function @c ptr_fun takes a pointer-to-function @c f and constructs + * an instance of the appropriate functor. + * + * @{ + */ + /// One of the @link pointer_adaptors adaptors for function pointers@endlink. + template + class pointer_to_unary_function : public unary_function<_Arg, _Result> + { + protected: + _Result (*_M_ptr)(_Arg); + + public: + pointer_to_unary_function() { } + + explicit + pointer_to_unary_function(_Result (*__x)(_Arg)) + : _M_ptr(__x) { } + + _Result + operator()(_Arg __x) const + { return _M_ptr(__x); } + }; + + /// One of the @link pointer_adaptors adaptors for function pointers@endlink. + template + inline pointer_to_unary_function<_Arg, _Result> + ptr_fun(_Result (*__x)(_Arg)) + { return pointer_to_unary_function<_Arg, _Result>(__x); } + + /// One of the @link pointer_adaptors adaptors for function pointers@endlink. + template + class pointer_to_binary_function + : public binary_function<_Arg1, _Arg2, _Result> + { + protected: + _Result (*_M_ptr)(_Arg1, _Arg2); + + public: + pointer_to_binary_function() { } + + explicit + pointer_to_binary_function(_Result (*__x)(_Arg1, _Arg2)) + : _M_ptr(__x) { } + + _Result + operator()(_Arg1 __x, _Arg2 __y) const + { return _M_ptr(__x, __y); } + }; + + /// One of the @link pointer_adaptors adaptors for function pointers@endlink. + template + inline pointer_to_binary_function<_Arg1, _Arg2, _Result> + ptr_fun(_Result (*__x)(_Arg1, _Arg2)) + { return pointer_to_binary_function<_Arg1, _Arg2, _Result>(__x); } + /** @} */ + + template + struct _Identity : public unary_function<_Tp,_Tp> + { + _Tp& + operator()(_Tp& __x) const + { return __x; } + + const _Tp& + operator()(const _Tp& __x) const + { return __x; } + }; + + template + struct _Select1st : public unary_function<_Pair, + typename _Pair::first_type> + { + typename _Pair::first_type& + operator()(_Pair& __x) const + { return __x.first; } + + const typename _Pair::first_type& + operator()(const _Pair& __x) const + { return __x.first; } + }; + + template + struct _Select2nd : public unary_function<_Pair, + typename _Pair::second_type> + { + typename _Pair::second_type& + operator()(_Pair& __x) const + { return __x.second; } + + const typename _Pair::second_type& + operator()(const _Pair& __x) const + { return __x.second; } + }; + + // 20.3.8 adaptors pointers members + /** @defgroup memory_adaptors Adaptors for pointers to members + * @ingroup functors + * + * There are a total of 8 = 2^3 function objects in this family. + * (1) Member functions taking no arguments vs member functions taking + * one argument. + * (2) Call through pointer vs call through reference. + * (3) Const vs non-const member function. + * + * All of this complexity is in the function objects themselves. You can + * ignore it by using the helper function mem_fun and mem_fun_ref, + * which create whichever type of adaptor is appropriate. + * + * @{ + */ + /// One of the @link memory_adaptors adaptors for member + /// pointers@endlink. + template + class mem_fun_t : public unary_function<_Tp*, _Ret> + { + public: + explicit + mem_fun_t(_Ret (_Tp::*__pf)()) + : _M_f(__pf) { } + + _Ret + operator()(_Tp* __p) const + { return (__p->*_M_f)(); } + + private: + _Ret (_Tp::*_M_f)(); + }; + + /// One of the @link memory_adaptors adaptors for member + /// pointers@endlink. + template + class const_mem_fun_t : public unary_function + { + public: + explicit + const_mem_fun_t(_Ret (_Tp::*__pf)() const) + : _M_f(__pf) { } + + _Ret + operator()(const _Tp* __p) const + { return (__p->*_M_f)(); } + + private: + _Ret (_Tp::*_M_f)() const; + }; + + /// One of the @link memory_adaptors adaptors for member + /// pointers@endlink. + template + class mem_fun_ref_t : public unary_function<_Tp, _Ret> + { + public: + explicit + mem_fun_ref_t(_Ret (_Tp::*__pf)()) + : _M_f(__pf) { } + + _Ret + operator()(_Tp& __r) const + { return (__r.*_M_f)(); } + + private: + _Ret (_Tp::*_M_f)(); + }; + + /// One of the @link memory_adaptors adaptors for member + /// pointers@endlink. + template + class const_mem_fun_ref_t : public unary_function<_Tp, _Ret> + { + public: + explicit + const_mem_fun_ref_t(_Ret (_Tp::*__pf)() const) + : _M_f(__pf) { } + + _Ret + operator()(const _Tp& __r) const + { return (__r.*_M_f)(); } + + private: + _Ret (_Tp::*_M_f)() const; + }; + + /// One of the @link memory_adaptors adaptors for member + /// pointers@endlink. + template + class mem_fun1_t : public binary_function<_Tp*, _Arg, _Ret> + { + public: + explicit + mem_fun1_t(_Ret (_Tp::*__pf)(_Arg)) + : _M_f(__pf) { } + + _Ret + operator()(_Tp* __p, _Arg __x) const + { return (__p->*_M_f)(__x); } + + private: + _Ret (_Tp::*_M_f)(_Arg); + }; + + /// One of the @link memory_adaptors adaptors for member + /// pointers@endlink. + template + class const_mem_fun1_t : public binary_function + { + public: + explicit + const_mem_fun1_t(_Ret (_Tp::*__pf)(_Arg) const) + : _M_f(__pf) { } + + _Ret + operator()(const _Tp* __p, _Arg __x) const + { return (__p->*_M_f)(__x); } + + private: + _Ret (_Tp::*_M_f)(_Arg) const; + }; + + /// One of the @link memory_adaptors adaptors for member + /// pointers@endlink. + template + class mem_fun1_ref_t : public binary_function<_Tp, _Arg, _Ret> + { + public: + explicit + mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg)) + : _M_f(__pf) { } + + _Ret + operator()(_Tp& __r, _Arg __x) const + { return (__r.*_M_f)(__x); } + + private: + _Ret (_Tp::*_M_f)(_Arg); + }; + + /// One of the @link memory_adaptors adaptors for member + /// pointers@endlink. + template + class const_mem_fun1_ref_t : public binary_function<_Tp, _Arg, _Ret> + { + public: + explicit + const_mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg) const) + : _M_f(__pf) { } + + _Ret + operator()(const _Tp& __r, _Arg __x) const + { return (__r.*_M_f)(__x); } + + private: + _Ret (_Tp::*_M_f)(_Arg) const; + }; + + // Mem_fun adaptor helper functions. There are only two: + // mem_fun and mem_fun_ref. + template + inline mem_fun_t<_Ret, _Tp> + mem_fun(_Ret (_Tp::*__f)()) + { return mem_fun_t<_Ret, _Tp>(__f); } + + template + inline const_mem_fun_t<_Ret, _Tp> + mem_fun(_Ret (_Tp::*__f)() const) + { return const_mem_fun_t<_Ret, _Tp>(__f); } + + template + inline mem_fun_ref_t<_Ret, _Tp> + mem_fun_ref(_Ret (_Tp::*__f)()) + { return mem_fun_ref_t<_Ret, _Tp>(__f); } + + template + inline const_mem_fun_ref_t<_Ret, _Tp> + mem_fun_ref(_Ret (_Tp::*__f)() const) + { return const_mem_fun_ref_t<_Ret, _Tp>(__f); } + + template + inline mem_fun1_t<_Ret, _Tp, _Arg> + mem_fun(_Ret (_Tp::*__f)(_Arg)) + { return mem_fun1_t<_Ret, _Tp, _Arg>(__f); } + + template + inline const_mem_fun1_t<_Ret, _Tp, _Arg> + mem_fun(_Ret (_Tp::*__f)(_Arg) const) + { return const_mem_fun1_t<_Ret, _Tp, _Arg>(__f); } + + template + inline mem_fun1_ref_t<_Ret, _Tp, _Arg> + mem_fun_ref(_Ret (_Tp::*__f)(_Arg)) + { return mem_fun1_ref_t<_Ret, _Tp, _Arg>(__f); } + + template + inline const_mem_fun1_ref_t<_Ret, _Tp, _Arg> + mem_fun_ref(_Ret (_Tp::*__f)(_Arg) const) + { return const_mem_fun1_ref_t<_Ret, _Tp, _Arg>(__f); } + + /** @} */ + +_GLIBCXX_END_NAMESPACE + +#if !defined(__GXX_EXPERIMENTAL_CXX0X__) || _GLIBCXX_DEPRECATED +# include +#endif + +#endif /* _STL_FUNCTION_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_heap.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_heap.h new file mode 100644 index 00000000..9348fe97 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_heap.h @@ -0,0 +1,578 @@ +// Heap implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * Copyright (c) 1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_heap.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_HEAP_H +#define _STL_HEAP_H 1 + +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /** + * @defgroup heap_algorithms Heap Algorithms + * @ingroup sorting_algorithms + */ + + template + _Distance + __is_heap_until(_RandomAccessIterator __first, _Distance __n) + { + _Distance __parent = 0; + for (_Distance __child = 1; __child < __n; ++__child) + { + if (__first[__parent] < __first[__child]) + return __child; + if ((__child & 1) == 0) + ++__parent; + } + return __n; + } + + template + _Distance + __is_heap_until(_RandomAccessIterator __first, _Distance __n, + _Compare __comp) + { + _Distance __parent = 0; + for (_Distance __child = 1; __child < __n; ++__child) + { + if (__comp(__first[__parent], __first[__child])) + return __child; + if ((__child & 1) == 0) + ++__parent; + } + return __n; + } + + // __is_heap, a predicate testing whether or not a range is a heap. + // This function is an extension, not part of the C++ standard. + template + inline bool + __is_heap(_RandomAccessIterator __first, _Distance __n) + { return std::__is_heap_until(__first, __n) == __n; } + + template + inline bool + __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n) + { return std::__is_heap_until(__first, __n, __comp) == __n; } + + template + inline bool + __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) + { return std::__is_heap(__first, std::distance(__first, __last)); } + + template + inline bool + __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, + _Compare __comp) + { return std::__is_heap(__first, __comp, std::distance(__first, __last)); } + + // Heap-manipulation functions: push_heap, pop_heap, make_heap, sort_heap, + // + is_heap and is_heap_until in C++0x. + + template + void + __push_heap(_RandomAccessIterator __first, + _Distance __holeIndex, _Distance __topIndex, _Tp __value) + { + _Distance __parent = (__holeIndex - 1) / 2; + while (__holeIndex > __topIndex && *(__first + __parent) < __value) + { + *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __parent)); + __holeIndex = __parent; + __parent = (__holeIndex - 1) / 2; + } + *(__first + __holeIndex) = _GLIBCXX_MOVE(__value); + } + + /** + * @brief Push an element onto a heap. + * @param first Start of heap. + * @param last End of heap + element. + * @ingroup heap_algorithms + * + * This operation pushes the element at last-1 onto the valid heap over the + * range [first,last-1). After completion, [first,last) is a valid heap. + */ + template + inline void + push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) + __glibcxx_requires_valid_range(__first, __last); + __glibcxx_requires_heap(__first, __last - 1); + + _ValueType __value = _GLIBCXX_MOVE(*(__last - 1)); + std::__push_heap(__first, _DistanceType((__last - __first) - 1), + _DistanceType(0), _GLIBCXX_MOVE(__value)); + } + + template + void + __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, + _Distance __topIndex, _Tp __value, _Compare __comp) + { + _Distance __parent = (__holeIndex - 1) / 2; + while (__holeIndex > __topIndex + && __comp(*(__first + __parent), __value)) + { + *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __parent)); + __holeIndex = __parent; + __parent = (__holeIndex - 1) / 2; + } + *(__first + __holeIndex) = _GLIBCXX_MOVE(__value); + } + + /** + * @brief Push an element onto a heap using comparison functor. + * @param first Start of heap. + * @param last End of heap + element. + * @param comp Comparison functor. + * @ingroup heap_algorithms + * + * This operation pushes the element at last-1 onto the valid heap over the + * range [first,last-1). After completion, [first,last) is a valid heap. + * Compare operations are performed using comp. + */ + template + inline void + push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, + _Compare __comp) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_requires_valid_range(__first, __last); + __glibcxx_requires_heap_pred(__first, __last - 1, __comp); + + _ValueType __value = _GLIBCXX_MOVE(*(__last - 1)); + std::__push_heap(__first, _DistanceType((__last - __first) - 1), + _DistanceType(0), _GLIBCXX_MOVE(__value), __comp); + } + + template + void + __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, + _Distance __len, _Tp __value) + { + const _Distance __topIndex = __holeIndex; + _Distance __secondChild = __holeIndex; + while (__secondChild < (__len - 1) / 2) + { + __secondChild = 2 * (__secondChild + 1); + if (*(__first + __secondChild) < *(__first + (__secondChild - 1))) + __secondChild--; + *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __secondChild)); + __holeIndex = __secondChild; + } + if ((__len & 1) == 0 && __secondChild == (__len - 2) / 2) + { + __secondChild = 2 * (__secondChild + 1); + *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + + (__secondChild - 1))); + __holeIndex = __secondChild - 1; + } + std::__push_heap(__first, __holeIndex, __topIndex, + _GLIBCXX_MOVE(__value)); + } + + template + inline void + __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, + _RandomAccessIterator __result) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _DistanceType; + + _ValueType __value = _GLIBCXX_MOVE(*__result); + *__result = _GLIBCXX_MOVE(*__first); + std::__adjust_heap(__first, _DistanceType(0), + _DistanceType(__last - __first), + _GLIBCXX_MOVE(__value)); + } + + /** + * @brief Pop an element off a heap. + * @param first Start of heap. + * @param last End of heap. + * @ingroup heap_algorithms + * + * This operation pops the top of the heap. The elements first and last-1 + * are swapped and [first,last-1) is made into a heap. + */ + template + inline void + pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) + __glibcxx_requires_valid_range(__first, __last); + __glibcxx_requires_heap(__first, __last); + + --__last; + std::__pop_heap(__first, __last, __last); + } + + template + void + __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, + _Distance __len, _Tp __value, _Compare __comp) + { + const _Distance __topIndex = __holeIndex; + _Distance __secondChild = __holeIndex; + while (__secondChild < (__len - 1) / 2) + { + __secondChild = 2 * (__secondChild + 1); + if (__comp(*(__first + __secondChild), + *(__first + (__secondChild - 1)))) + __secondChild--; + *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __secondChild)); + __holeIndex = __secondChild; + } + if ((__len & 1) == 0 && __secondChild == (__len - 2) / 2) + { + __secondChild = 2 * (__secondChild + 1); + *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + + (__secondChild - 1))); + __holeIndex = __secondChild - 1; + } + std::__push_heap(__first, __holeIndex, __topIndex, + _GLIBCXX_MOVE(__value), __comp); + } + + template + inline void + __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, + _RandomAccessIterator __result, _Compare __comp) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _DistanceType; + + _ValueType __value = _GLIBCXX_MOVE(*__result); + *__result = _GLIBCXX_MOVE(*__first); + std::__adjust_heap(__first, _DistanceType(0), + _DistanceType(__last - __first), + _GLIBCXX_MOVE(__value), __comp); + } + + /** + * @brief Pop an element off a heap using comparison functor. + * @param first Start of heap. + * @param last End of heap. + * @param comp Comparison functor to use. + * @ingroup heap_algorithms + * + * This operation pops the top of the heap. The elements first and last-1 + * are swapped and [first,last-1) is made into a heap. Comparisons are + * made using comp. + */ + template + inline void + pop_heap(_RandomAccessIterator __first, + _RandomAccessIterator __last, _Compare __comp) + { + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_requires_valid_range(__first, __last); + __glibcxx_requires_heap_pred(__first, __last, __comp); + + --__last; + std::__pop_heap(__first, __last, __last, __comp); + } + + /** + * @brief Construct a heap over a range. + * @param first Start of heap. + * @param last End of heap. + * @ingroup heap_algorithms + * + * This operation makes the elements in [first,last) into a heap. + */ + template + void + make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) + __glibcxx_requires_valid_range(__first, __last); + + if (__last - __first < 2) + return; + + const _DistanceType __len = __last - __first; + _DistanceType __parent = (__len - 2) / 2; + while (true) + { + _ValueType __value = _GLIBCXX_MOVE(*(__first + __parent)); + std::__adjust_heap(__first, __parent, __len, _GLIBCXX_MOVE(__value)); + if (__parent == 0) + return; + __parent--; + } + } + + /** + * @brief Construct a heap over a range using comparison functor. + * @param first Start of heap. + * @param last End of heap. + * @param comp Comparison functor to use. + * @ingroup heap_algorithms + * + * This operation makes the elements in [first,last) into a heap. + * Comparisons are made using comp. + */ + template + void + make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, + _Compare __comp) + { + typedef typename iterator_traits<_RandomAccessIterator>::value_type + _ValueType; + typedef typename iterator_traits<_RandomAccessIterator>::difference_type + _DistanceType; + + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_requires_valid_range(__first, __last); + + if (__last - __first < 2) + return; + + const _DistanceType __len = __last - __first; + _DistanceType __parent = (__len - 2) / 2; + while (true) + { + _ValueType __value = _GLIBCXX_MOVE(*(__first + __parent)); + std::__adjust_heap(__first, __parent, __len, _GLIBCXX_MOVE(__value), + __comp); + if (__parent == 0) + return; + __parent--; + } + } + + /** + * @brief Sort a heap. + * @param first Start of heap. + * @param last End of heap. + * @ingroup heap_algorithms + * + * This operation sorts the valid heap in the range [first,last). + */ + template + void + sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) + { + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_LessThanComparableConcept< + typename iterator_traits<_RandomAccessIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + __glibcxx_requires_heap(__first, __last); + + while (__last - __first > 1) + { + --__last; + std::__pop_heap(__first, __last, __last); + } + } + + /** + * @brief Sort a heap using comparison functor. + * @param first Start of heap. + * @param last End of heap. + * @param comp Comparison functor to use. + * @ingroup heap_algorithms + * + * This operation sorts the valid heap in the range [first,last). + * Comparisons are made using comp. + */ + template + void + sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, + _Compare __comp) + { + // concept requirements + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_requires_valid_range(__first, __last); + __glibcxx_requires_heap_pred(__first, __last, __comp); + + while (__last - __first > 1) + { + --__last; + std::__pop_heap(__first, __last, __last, __comp); + } + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Search the end of a heap. + * @param first Start of range. + * @param last End of range. + * @return An iterator pointing to the first element not in the heap. + * @ingroup heap_algorithms + * + * This operation returns the last iterator i in [first, last) for which + * the range [first, i) is a heap. + */ + template + inline _RandomAccessIterator + is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) + { + // concept requirements + __glibcxx_function_requires(_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_LessThanComparableConcept< + typename iterator_traits<_RandomAccessIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + return __first + std::__is_heap_until(__first, std::distance(__first, + __last)); + } + + /** + * @brief Search the end of a heap using comparison functor. + * @param first Start of range. + * @param last End of range. + * @param comp Comparison functor to use. + * @return An iterator pointing to the first element not in the heap. + * @ingroup heap_algorithms + * + * This operation returns the last iterator i in [first, last) for which + * the range [first, i) is a heap. Comparisons are made using comp. + */ + template + inline _RandomAccessIterator + is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, + _Compare __comp) + { + // concept requirements + __glibcxx_function_requires(_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_requires_valid_range(__first, __last); + + return __first + std::__is_heap_until(__first, std::distance(__first, + __last), + __comp); + } + + /** + * @brief Determines whether a range is a heap. + * @param first Start of range. + * @param last End of range. + * @return True if range is a heap, false otherwise. + * @ingroup heap_algorithms + */ + template + inline bool + is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) + { return std::is_heap_until(__first, __last) == __last; } + + /** + * @brief Determines whether a range is a heap using comparison functor. + * @param first Start of range. + * @param last End of range. + * @param comp Comparison functor to use. + * @return True if range is a heap, false otherwise. + * @ingroup heap_algorithms + */ + template + inline bool + is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, + _Compare __comp) + { return std::is_heap_until(__first, __last, __comp) == __last; } +#endif + +_GLIBCXX_END_NAMESPACE + +#endif /* _STL_HEAP_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_iterator.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_iterator.h new file mode 100644 index 00000000..129552f3 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_iterator.h @@ -0,0 +1,1041 @@ +// Iterators -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996-1998 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_iterator.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + * + * This file implements reverse_iterator, back_insert_iterator, + * front_insert_iterator, insert_iterator, __normal_iterator, and their + * supporting functions and overloaded operators. + */ + +#ifndef _STL_ITERATOR_H +#define _STL_ITERATOR_H 1 + +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // 24.4.1 Reverse iterators + /** + * "Bidirectional and random access iterators have corresponding reverse + * %iterator adaptors that iterate through the data structure in the + * opposite direction. They have the same signatures as the corresponding + * iterators. The fundamental relation between a reverse %iterator and its + * corresponding %iterator @c i is established by the identity: + * @code + * &*(reverse_iterator(i)) == &*(i - 1) + * @endcode + * + * This mapping is dictated by the fact that while there is always a + * pointer past the end of an array, there might not be a valid pointer + * before the beginning of an array." [24.4.1]/1,2 + * + * Reverse iterators can be tricky and surprising at first. Their + * semantics make sense, however, and the trickiness is a side effect of + * the requirement that the iterators must be safe. + */ + template + class reverse_iterator + : public iterator::iterator_category, + typename iterator_traits<_Iterator>::value_type, + typename iterator_traits<_Iterator>::difference_type, + typename iterator_traits<_Iterator>::pointer, + typename iterator_traits<_Iterator>::reference> + { + protected: + _Iterator current; + + public: + typedef _Iterator iterator_type; + typedef typename iterator_traits<_Iterator>::difference_type + difference_type; + typedef typename iterator_traits<_Iterator>::reference reference; + typedef typename iterator_traits<_Iterator>::pointer pointer; + + public: + /** + * The default constructor default-initializes member @p current. + * If it is a pointer, that means it is zero-initialized. + */ + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 235 No specification of default ctor for reverse_iterator + reverse_iterator() : current() { } + + /** + * This %iterator will move in the opposite direction that @p x does. + */ + explicit + reverse_iterator(iterator_type __x) : current(__x) { } + + /** + * The copy constructor is normal. + */ + reverse_iterator(const reverse_iterator& __x) + : current(__x.current) { } + + /** + * A reverse_iterator across other types can be copied in the normal + * fashion. + */ + template + reverse_iterator(const reverse_iterator<_Iter>& __x) + : current(__x.base()) { } + + /** + * @return @c current, the %iterator used for underlying work. + */ + iterator_type + base() const + { return current; } + + /** + * @return TODO + * + * @doctodo + */ + reference + operator*() const + { + _Iterator __tmp = current; + return *--__tmp; + } + + /** + * @return TODO + * + * @doctodo + */ + pointer + operator->() const + { return &(operator*()); } + + /** + * @return TODO + * + * @doctodo + */ + reverse_iterator& + operator++() + { + --current; + return *this; + } + + /** + * @return TODO + * + * @doctodo + */ + reverse_iterator + operator++(int) + { + reverse_iterator __tmp = *this; + --current; + return __tmp; + } + + /** + * @return TODO + * + * @doctodo + */ + reverse_iterator& + operator--() + { + ++current; + return *this; + } + + /** + * @return TODO + * + * @doctodo + */ + reverse_iterator + operator--(int) + { + reverse_iterator __tmp = *this; + ++current; + return __tmp; + } + + /** + * @return TODO + * + * @doctodo + */ + reverse_iterator + operator+(difference_type __n) const + { return reverse_iterator(current - __n); } + + /** + * @return TODO + * + * @doctodo + */ + reverse_iterator& + operator+=(difference_type __n) + { + current -= __n; + return *this; + } + + /** + * @return TODO + * + * @doctodo + */ + reverse_iterator + operator-(difference_type __n) const + { return reverse_iterator(current + __n); } + + /** + * @return TODO + * + * @doctodo + */ + reverse_iterator& + operator-=(difference_type __n) + { + current += __n; + return *this; + } + + /** + * @return TODO + * + * @doctodo + */ + reference + operator[](difference_type __n) const + { return *(*this + __n); } + }; + + //@{ + /** + * @param x A %reverse_iterator. + * @param y A %reverse_iterator. + * @return A simple bool. + * + * Reverse iterators forward many operations to their underlying base() + * iterators. Others are implemented in terms of one another. + * + */ + template + inline bool + operator==(const reverse_iterator<_Iterator>& __x, + const reverse_iterator<_Iterator>& __y) + { return __x.base() == __y.base(); } + + template + inline bool + operator<(const reverse_iterator<_Iterator>& __x, + const reverse_iterator<_Iterator>& __y) + { return __y.base() < __x.base(); } + + template + inline bool + operator!=(const reverse_iterator<_Iterator>& __x, + const reverse_iterator<_Iterator>& __y) + { return !(__x == __y); } + + template + inline bool + operator>(const reverse_iterator<_Iterator>& __x, + const reverse_iterator<_Iterator>& __y) + { return __y < __x; } + + template + inline bool + operator<=(const reverse_iterator<_Iterator>& __x, + const reverse_iterator<_Iterator>& __y) + { return !(__y < __x); } + + template + inline bool + operator>=(const reverse_iterator<_Iterator>& __x, + const reverse_iterator<_Iterator>& __y) + { return !(__x < __y); } + + template + inline typename reverse_iterator<_Iterator>::difference_type + operator-(const reverse_iterator<_Iterator>& __x, + const reverse_iterator<_Iterator>& __y) + { return __y.base() - __x.base(); } + + template + inline reverse_iterator<_Iterator> + operator+(typename reverse_iterator<_Iterator>::difference_type __n, + const reverse_iterator<_Iterator>& __x) + { return reverse_iterator<_Iterator>(__x.base() - __n); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 280. Comparison of reverse_iterator to const reverse_iterator. + template + inline bool + operator==(const reverse_iterator<_IteratorL>& __x, + const reverse_iterator<_IteratorR>& __y) + { return __x.base() == __y.base(); } + + template + inline bool + operator<(const reverse_iterator<_IteratorL>& __x, + const reverse_iterator<_IteratorR>& __y) + { return __y.base() < __x.base(); } + + template + inline bool + operator!=(const reverse_iterator<_IteratorL>& __x, + const reverse_iterator<_IteratorR>& __y) + { return !(__x == __y); } + + template + inline bool + operator>(const reverse_iterator<_IteratorL>& __x, + const reverse_iterator<_IteratorR>& __y) + { return __y < __x; } + + template + inline bool + operator<=(const reverse_iterator<_IteratorL>& __x, + const reverse_iterator<_IteratorR>& __y) + { return !(__y < __x); } + + template + inline bool + operator>=(const reverse_iterator<_IteratorL>& __x, + const reverse_iterator<_IteratorR>& __y) + { return !(__x < __y); } + + template +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + // DR 685. + inline auto + operator-(const reverse_iterator<_IteratorL>& __x, + const reverse_iterator<_IteratorR>& __y) + -> decltype(__y.base() - __x.base()) +#else + inline typename reverse_iterator<_IteratorL>::difference_type + operator-(const reverse_iterator<_IteratorL>& __x, + const reverse_iterator<_IteratorR>& __y) +#endif + { return __y.base() - __x.base(); } + //@} + + // 24.4.2.2.1 back_insert_iterator + /** + * @brief Turns assignment into insertion. + * + * These are output iterators, constructed from a container-of-T. + * Assigning a T to the iterator appends it to the container using + * push_back. + * + * Tip: Using the back_inserter function to create these iterators can + * save typing. + */ + template + class back_insert_iterator + : public iterator + { + protected: + _Container* container; + + public: + /// A nested typedef for the type of whatever container you used. + typedef _Container container_type; + + /// The only way to create this %iterator is with a container. + explicit + back_insert_iterator(_Container& __x) : container(&__x) { } + + /** + * @param value An instance of whatever type + * container_type::const_reference is; presumably a + * reference-to-const T for container. + * @return This %iterator, for chained operations. + * + * This kind of %iterator doesn't really have a "position" in the + * container (you can think of the position as being permanently at + * the end, if you like). Assigning a value to the %iterator will + * always append the value to the end of the container. + */ + back_insert_iterator& + operator=(typename _Container::const_reference __value) + { + container->push_back(__value); + return *this; + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + back_insert_iterator& + operator=(typename _Container::value_type&& __value) + { + container->push_back(std::move(__value)); + return *this; + } +#endif + + /// Simply returns *this. + back_insert_iterator& + operator*() + { return *this; } + + /// Simply returns *this. (This %iterator does not "move".) + back_insert_iterator& + operator++() + { return *this; } + + /// Simply returns *this. (This %iterator does not "move".) + back_insert_iterator + operator++(int) + { return *this; } + }; + + /** + * @param x A container of arbitrary type. + * @return An instance of back_insert_iterator working on @p x. + * + * This wrapper function helps in creating back_insert_iterator instances. + * Typing the name of the %iterator requires knowing the precise full + * type of the container, which can be tedious and impedes generic + * programming. Using this function lets you take advantage of automatic + * template parameter deduction, making the compiler match the correct + * types for you. + */ + template + inline back_insert_iterator<_Container> + back_inserter(_Container& __x) + { return back_insert_iterator<_Container>(__x); } + + /** + * @brief Turns assignment into insertion. + * + * These are output iterators, constructed from a container-of-T. + * Assigning a T to the iterator prepends it to the container using + * push_front. + * + * Tip: Using the front_inserter function to create these iterators can + * save typing. + */ + template + class front_insert_iterator + : public iterator + { + protected: + _Container* container; + + public: + /// A nested typedef for the type of whatever container you used. + typedef _Container container_type; + + /// The only way to create this %iterator is with a container. + explicit front_insert_iterator(_Container& __x) : container(&__x) { } + + /** + * @param value An instance of whatever type + * container_type::const_reference is; presumably a + * reference-to-const T for container. + * @return This %iterator, for chained operations. + * + * This kind of %iterator doesn't really have a "position" in the + * container (you can think of the position as being permanently at + * the front, if you like). Assigning a value to the %iterator will + * always prepend the value to the front of the container. + */ + front_insert_iterator& + operator=(typename _Container::const_reference __value) + { + container->push_front(__value); + return *this; + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + front_insert_iterator& + operator=(typename _Container::value_type&& __value) + { + container->push_front(std::move(__value)); + return *this; + } +#endif + + /// Simply returns *this. + front_insert_iterator& + operator*() + { return *this; } + + /// Simply returns *this. (This %iterator does not "move".) + front_insert_iterator& + operator++() + { return *this; } + + /// Simply returns *this. (This %iterator does not "move".) + front_insert_iterator + operator++(int) + { return *this; } + }; + + /** + * @param x A container of arbitrary type. + * @return An instance of front_insert_iterator working on @p x. + * + * This wrapper function helps in creating front_insert_iterator instances. + * Typing the name of the %iterator requires knowing the precise full + * type of the container, which can be tedious and impedes generic + * programming. Using this function lets you take advantage of automatic + * template parameter deduction, making the compiler match the correct + * types for you. + */ + template + inline front_insert_iterator<_Container> + front_inserter(_Container& __x) + { return front_insert_iterator<_Container>(__x); } + + /** + * @brief Turns assignment into insertion. + * + * These are output iterators, constructed from a container-of-T. + * Assigning a T to the iterator inserts it in the container at the + * %iterator's position, rather than overwriting the value at that + * position. + * + * (Sequences will actually insert a @e copy of the value before the + * %iterator's position.) + * + * Tip: Using the inserter function to create these iterators can + * save typing. + */ + template + class insert_iterator + : public iterator + { + protected: + _Container* container; + typename _Container::iterator iter; + + public: + /// A nested typedef for the type of whatever container you used. + typedef _Container container_type; + + /** + * The only way to create this %iterator is with a container and an + * initial position (a normal %iterator into the container). + */ + insert_iterator(_Container& __x, typename _Container::iterator __i) + : container(&__x), iter(__i) {} + + /** + * @param value An instance of whatever type + * container_type::const_reference is; presumably a + * reference-to-const T for container. + * @return This %iterator, for chained operations. + * + * This kind of %iterator maintains its own position in the + * container. Assigning a value to the %iterator will insert the + * value into the container at the place before the %iterator. + * + * The position is maintained such that subsequent assignments will + * insert values immediately after one another. For example, + * @code + * // vector v contains A and Z + * + * insert_iterator i (v, ++v.begin()); + * i = 1; + * i = 2; + * i = 3; + * + * // vector v contains A, 1, 2, 3, and Z + * @endcode + */ + insert_iterator& + operator=(typename _Container::const_reference __value) + { + iter = container->insert(iter, __value); + ++iter; + return *this; + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + insert_iterator& + operator=(typename _Container::value_type&& __value) + { + iter = container->insert(iter, std::move(__value)); + ++iter; + return *this; + } +#endif + + /// Simply returns *this. + insert_iterator& + operator*() + { return *this; } + + /// Simply returns *this. (This %iterator does not "move".) + insert_iterator& + operator++() + { return *this; } + + /// Simply returns *this. (This %iterator does not "move".) + insert_iterator& + operator++(int) + { return *this; } + }; + + /** + * @param x A container of arbitrary type. + * @return An instance of insert_iterator working on @p x. + * + * This wrapper function helps in creating insert_iterator instances. + * Typing the name of the %iterator requires knowing the precise full + * type of the container, which can be tedious and impedes generic + * programming. Using this function lets you take advantage of automatic + * template parameter deduction, making the compiler match the correct + * types for you. + */ + template + inline insert_iterator<_Container> + inserter(_Container& __x, _Iterator __i) + { + return insert_iterator<_Container>(__x, + typename _Container::iterator(__i)); + } + +_GLIBCXX_END_NAMESPACE + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + // This iterator adapter is 'normal' in the sense that it does not + // change the semantics of any of the operators of its iterator + // parameter. Its primary purpose is to convert an iterator that is + // not a class, e.g. a pointer, into an iterator that is a class. + // The _Container parameter exists solely so that different containers + // using this template can instantiate different types, even if the + // _Iterator parameter is the same. + using std::iterator_traits; + using std::iterator; + template + class __normal_iterator + { + protected: + _Iterator _M_current; + + public: + typedef _Iterator iterator_type; + typedef typename iterator_traits<_Iterator>::iterator_category + iterator_category; + typedef typename iterator_traits<_Iterator>::value_type value_type; + typedef typename iterator_traits<_Iterator>::difference_type + difference_type; + typedef typename iterator_traits<_Iterator>::reference reference; + typedef typename iterator_traits<_Iterator>::pointer pointer; + + __normal_iterator() : _M_current(_Iterator()) { } + + explicit + __normal_iterator(const _Iterator& __i) : _M_current(__i) { } + + // Allow iterator to const_iterator conversion + template + __normal_iterator(const __normal_iterator<_Iter, + typename __enable_if< + (std::__are_same<_Iter, typename _Container::pointer>::__value), + _Container>::__type>& __i) + : _M_current(__i.base()) { } + + // Forward iterator requirements + reference + operator*() const + { return *_M_current; } + + pointer + operator->() const + { return _M_current; } + + __normal_iterator& + operator++() + { + ++_M_current; + return *this; + } + + __normal_iterator + operator++(int) + { return __normal_iterator(_M_current++); } + + // Bidirectional iterator requirements + __normal_iterator& + operator--() + { + --_M_current; + return *this; + } + + __normal_iterator + operator--(int) + { return __normal_iterator(_M_current--); } + + // Random access iterator requirements + reference + operator[](const difference_type& __n) const + { return _M_current[__n]; } + + __normal_iterator& + operator+=(const difference_type& __n) + { _M_current += __n; return *this; } + + __normal_iterator + operator+(const difference_type& __n) const + { return __normal_iterator(_M_current + __n); } + + __normal_iterator& + operator-=(const difference_type& __n) + { _M_current -= __n; return *this; } + + __normal_iterator + operator-(const difference_type& __n) const + { return __normal_iterator(_M_current - __n); } + + const _Iterator& + base() const + { return _M_current; } + }; + + // Note: In what follows, the left- and right-hand-side iterators are + // allowed to vary in types (conceptually in cv-qualification) so that + // comparison between cv-qualified and non-cv-qualified iterators be + // valid. However, the greedy and unfriendly operators in std::rel_ops + // will make overload resolution ambiguous (when in scope) if we don't + // provide overloads whose operands are of the same type. Can someone + // remind me what generic programming is about? -- Gaby + + // Forward iterator requirements + template + inline bool + operator==(const __normal_iterator<_IteratorL, _Container>& __lhs, + const __normal_iterator<_IteratorR, _Container>& __rhs) + { return __lhs.base() == __rhs.base(); } + + template + inline bool + operator==(const __normal_iterator<_Iterator, _Container>& __lhs, + const __normal_iterator<_Iterator, _Container>& __rhs) + { return __lhs.base() == __rhs.base(); } + + template + inline bool + operator!=(const __normal_iterator<_IteratorL, _Container>& __lhs, + const __normal_iterator<_IteratorR, _Container>& __rhs) + { return __lhs.base() != __rhs.base(); } + + template + inline bool + operator!=(const __normal_iterator<_Iterator, _Container>& __lhs, + const __normal_iterator<_Iterator, _Container>& __rhs) + { return __lhs.base() != __rhs.base(); } + + // Random access iterator requirements + template + inline bool + operator<(const __normal_iterator<_IteratorL, _Container>& __lhs, + const __normal_iterator<_IteratorR, _Container>& __rhs) + { return __lhs.base() < __rhs.base(); } + + template + inline bool + operator<(const __normal_iterator<_Iterator, _Container>& __lhs, + const __normal_iterator<_Iterator, _Container>& __rhs) + { return __lhs.base() < __rhs.base(); } + + template + inline bool + operator>(const __normal_iterator<_IteratorL, _Container>& __lhs, + const __normal_iterator<_IteratorR, _Container>& __rhs) + { return __lhs.base() > __rhs.base(); } + + template + inline bool + operator>(const __normal_iterator<_Iterator, _Container>& __lhs, + const __normal_iterator<_Iterator, _Container>& __rhs) + { return __lhs.base() > __rhs.base(); } + + template + inline bool + operator<=(const __normal_iterator<_IteratorL, _Container>& __lhs, + const __normal_iterator<_IteratorR, _Container>& __rhs) + { return __lhs.base() <= __rhs.base(); } + + template + inline bool + operator<=(const __normal_iterator<_Iterator, _Container>& __lhs, + const __normal_iterator<_Iterator, _Container>& __rhs) + { return __lhs.base() <= __rhs.base(); } + + template + inline bool + operator>=(const __normal_iterator<_IteratorL, _Container>& __lhs, + const __normal_iterator<_IteratorR, _Container>& __rhs) + { return __lhs.base() >= __rhs.base(); } + + template + inline bool + operator>=(const __normal_iterator<_Iterator, _Container>& __lhs, + const __normal_iterator<_Iterator, _Container>& __rhs) + { return __lhs.base() >= __rhs.base(); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // According to the resolution of DR179 not only the various comparison + // operators but also operator- must accept mixed iterator/const_iterator + // parameters. + template +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + // DR 685. + inline auto + operator-(const __normal_iterator<_IteratorL, _Container>& __lhs, + const __normal_iterator<_IteratorR, _Container>& __rhs) + -> decltype(__lhs.base() - __rhs.base()) +#else + inline typename __normal_iterator<_IteratorL, _Container>::difference_type + operator-(const __normal_iterator<_IteratorL, _Container>& __lhs, + const __normal_iterator<_IteratorR, _Container>& __rhs) +#endif + { return __lhs.base() - __rhs.base(); } + + template + inline typename __normal_iterator<_Iterator, _Container>::difference_type + operator-(const __normal_iterator<_Iterator, _Container>& __lhs, + const __normal_iterator<_Iterator, _Container>& __rhs) + { return __lhs.base() - __rhs.base(); } + + template + inline __normal_iterator<_Iterator, _Container> + operator+(typename __normal_iterator<_Iterator, _Container>::difference_type + __n, const __normal_iterator<_Iterator, _Container>& __i) + { return __normal_iterator<_Iterator, _Container>(__i.base() + __n); } + +_GLIBCXX_END_NAMESPACE + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // 24.4.3 Move iterators + /** + * Class template move_iterator is an iterator adapter with the same + * behavior as the underlying iterator except that its dereference + * operator implicitly converts the value returned by the underlying + * iterator's dereference operator to an rvalue reference. Some + * generic algorithms can be called with move iterators to replace + * copying with moving. + */ + template + class move_iterator + { + protected: + _Iterator _M_current; + + public: + typedef _Iterator iterator_type; + typedef typename iterator_traits<_Iterator>::difference_type + difference_type; + // NB: DR 680. + typedef _Iterator pointer; + typedef typename iterator_traits<_Iterator>::value_type value_type; + typedef typename iterator_traits<_Iterator>::iterator_category + iterator_category; + typedef value_type&& reference; + + public: + move_iterator() + : _M_current() { } + + explicit + move_iterator(iterator_type __i) + : _M_current(__i) { } + + template + move_iterator(const move_iterator<_Iter>& __i) + : _M_current(__i.base()) { } + + iterator_type + base() const + { return _M_current; } + + reference + operator*() const + { return *_M_current; } + + pointer + operator->() const + { return _M_current; } + + move_iterator& + operator++() + { + ++_M_current; + return *this; + } + + move_iterator + operator++(int) + { + move_iterator __tmp = *this; + ++_M_current; + return __tmp; + } + + move_iterator& + operator--() + { + --_M_current; + return *this; + } + + move_iterator + operator--(int) + { + move_iterator __tmp = *this; + --_M_current; + return __tmp; + } + + move_iterator + operator+(difference_type __n) const + { return move_iterator(_M_current + __n); } + + move_iterator& + operator+=(difference_type __n) + { + _M_current += __n; + return *this; + } + + move_iterator + operator-(difference_type __n) const + { return move_iterator(_M_current - __n); } + + move_iterator& + operator-=(difference_type __n) + { + _M_current -= __n; + return *this; + } + + reference + operator[](difference_type __n) const + { return _M_current[__n]; } + }; + + template + inline bool + operator==(const move_iterator<_IteratorL>& __x, + const move_iterator<_IteratorR>& __y) + { return __x.base() == __y.base(); } + + template + inline bool + operator!=(const move_iterator<_IteratorL>& __x, + const move_iterator<_IteratorR>& __y) + { return !(__x == __y); } + + template + inline bool + operator<(const move_iterator<_IteratorL>& __x, + const move_iterator<_IteratorR>& __y) + { return __x.base() < __y.base(); } + + template + inline bool + operator<=(const move_iterator<_IteratorL>& __x, + const move_iterator<_IteratorR>& __y) + { return !(__y < __x); } + + template + inline bool + operator>(const move_iterator<_IteratorL>& __x, + const move_iterator<_IteratorR>& __y) + { return __y < __x; } + + template + inline bool + operator>=(const move_iterator<_IteratorL>& __x, + const move_iterator<_IteratorR>& __y) + { return !(__x < __y); } + + // DR 685. + template + inline auto + operator-(const move_iterator<_IteratorL>& __x, + const move_iterator<_IteratorR>& __y) + -> decltype(__x.base() - __y.base()) + { return __x.base() - __y.base(); } + + template + inline move_iterator<_Iterator> + operator+(typename move_iterator<_Iterator>::difference_type __n, + const move_iterator<_Iterator>& __x) + { return __x + __n; } + + template + inline move_iterator<_Iterator> + make_move_iterator(const _Iterator& __i) + { return move_iterator<_Iterator>(__i); } + +_GLIBCXX_END_NAMESPACE + +#define _GLIBCXX_MAKE_MOVE_ITERATOR(_Iter) std::make_move_iterator(_Iter) +#else +#define _GLIBCXX_MAKE_MOVE_ITERATOR(_Iter) (_Iter) +#endif // __GXX_EXPERIMENTAL_CXX0X__ + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_iterator_base_funcs.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_iterator_base_funcs.h new file mode 100644 index 00000000..0a854faa --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_iterator_base_funcs.h @@ -0,0 +1,197 @@ +// Functions used by iterators -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996-1998 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_iterator_base_funcs.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + * + * This file contains all of the general iterator-related utility + * functions, such as distance() and advance(). + */ + +#ifndef _STL_ITERATOR_BASE_FUNCS_H +#define _STL_ITERATOR_BASE_FUNCS_H 1 + +#pragma GCC system_header +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + template + inline typename iterator_traits<_InputIterator>::difference_type + __distance(_InputIterator __first, _InputIterator __last, + input_iterator_tag) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + + typename iterator_traits<_InputIterator>::difference_type __n = 0; + while (__first != __last) + { + ++__first; + ++__n; + } + return __n; + } + + template + inline typename iterator_traits<_RandomAccessIterator>::difference_type + __distance(_RandomAccessIterator __first, _RandomAccessIterator __last, + random_access_iterator_tag) + { + // concept requirements + __glibcxx_function_requires(_RandomAccessIteratorConcept< + _RandomAccessIterator>) + return __last - __first; + } + + /** + * @brief A generalization of pointer arithmetic. + * @param first An input iterator. + * @param last An input iterator. + * @return The distance between them. + * + * Returns @c n such that first + n == last. This requires that @p last + * must be reachable from @p first. Note that @c n may be negative. + * + * For random access iterators, this uses their @c + and @c - operations + * and are constant time. For other %iterator classes they are linear time. + */ + template + inline typename iterator_traits<_InputIterator>::difference_type + distance(_InputIterator __first, _InputIterator __last) + { + // concept requirements -- taken care of in __distance + return std::__distance(__first, __last, + std::__iterator_category(__first)); + } + + template + inline void + __advance(_InputIterator& __i, _Distance __n, input_iterator_tag) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + while (__n--) + ++__i; + } + + template + inline void + __advance(_BidirectionalIterator& __i, _Distance __n, + bidirectional_iterator_tag) + { + // concept requirements + __glibcxx_function_requires(_BidirectionalIteratorConcept< + _BidirectionalIterator>) + if (__n > 0) + while (__n--) + ++__i; + else + while (__n++) + --__i; + } + + template + inline void + __advance(_RandomAccessIterator& __i, _Distance __n, + random_access_iterator_tag) + { + // concept requirements + __glibcxx_function_requires(_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __i += __n; + } + + /** + * @brief A generalization of pointer arithmetic. + * @param i An input iterator. + * @param n The "delta" by which to change @p i. + * @return Nothing. + * + * This increments @p i by @p n. For bidirectional and random access + * iterators, @p n may be negative, in which case @p i is decremented. + * + * For random access iterators, this uses their @c + and @c - operations + * and are constant time. For other %iterator classes they are linear time. + */ + template + inline void + advance(_InputIterator& __i, _Distance __n) + { + // concept requirements -- taken care of in __advance + typename iterator_traits<_InputIterator>::difference_type __d = __n; + std::__advance(__i, __d, std::__iterator_category(__i)); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + inline _InputIterator + next(_InputIterator __x, typename + iterator_traits<_InputIterator>::difference_type __n = 1) + { + std::advance(__x, __n); + return __x; + } + + template + inline _BidirectionalIterator + prev(_BidirectionalIterator __x, typename + iterator_traits<_BidirectionalIterator>::difference_type __n = 1) + { + std::advance(__x, -__n); + return __x; + } +#endif + +_GLIBCXX_END_NAMESPACE + +#endif /* _STL_ITERATOR_BASE_FUNCS_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_iterator_base_types.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_iterator_base_types.h new file mode 100644 index 00000000..6dc0d783 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_iterator_base_types.h @@ -0,0 +1,168 @@ +// Types used in iterator implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996-1998 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_iterator_base_types.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + * + * This file contains all of the general iterator-related utility types, + * such as iterator_traits and struct iterator. + */ + +#ifndef _STL_ITERATOR_BASE_TYPES_H +#define _STL_ITERATOR_BASE_TYPES_H 1 + +#pragma GCC system_header + +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /** + * @defgroup iterators Iterators + * These are empty types, used to distinguish different iterators. The + * distinction is not made by what they contain, but simply by what they + * are. Different underlying algorithms can then be used based on the + * different operations supported by different iterator types. + */ + //@{ + /// Marking input iterators. + struct input_iterator_tag { }; + /// Marking output iterators. + struct output_iterator_tag { }; + /// Forward iterators support a superset of input iterator operations. + struct forward_iterator_tag : public input_iterator_tag { }; + /// Bidirectional iterators support a superset of forward iterator + /// operations. + struct bidirectional_iterator_tag : public forward_iterator_tag { }; + /// Random-access iterators support a superset of bidirectional iterator + /// operations. + struct random_access_iterator_tag : public bidirectional_iterator_tag { }; + + + /** + * @brief Common %iterator class. + * + * This class does nothing but define nested typedefs. %Iterator classes + * can inherit from this class to save some work. The typedefs are then + * used in specializations and overloading. + * + * In particular, there are no default implementations of requirements + * such as @c operator++ and the like. (How could there be?) + */ + template + struct iterator + { + /// One of the @link iterator_tags tag types@endlink. + typedef _Category iterator_category; + /// The type "pointed to" by the iterator. + typedef _Tp value_type; + /// Distance between iterators is represented as this type. + typedef _Distance difference_type; + /// This type represents a pointer-to-value_type. + typedef _Pointer pointer; + /// This type represents a reference-to-value_type. + typedef _Reference reference; + }; + + /** + * This class does nothing but define nested typedefs. The general + * version simply "forwards" the nested typedefs from the Iterator + * argument. Specialized versions for pointers and pointers-to-const + * provide tighter, more correct semantics. + */ + template + struct iterator_traits + { + typedef typename _Iterator::iterator_category iterator_category; + typedef typename _Iterator::value_type value_type; + typedef typename _Iterator::difference_type difference_type; + typedef typename _Iterator::pointer pointer; + typedef typename _Iterator::reference reference; + }; + + template + struct iterator_traits<_Tp*> + { + typedef random_access_iterator_tag iterator_category; + typedef _Tp value_type; + typedef ptrdiff_t difference_type; + typedef _Tp* pointer; + typedef _Tp& reference; + }; + + template + struct iterator_traits + { + typedef random_access_iterator_tag iterator_category; + typedef _Tp value_type; + typedef ptrdiff_t difference_type; + typedef const _Tp* pointer; + typedef const _Tp& reference; + }; + + /** + * This function is not a part of the C++ standard but is syntactic + * sugar for internal library use only. + */ + template + inline typename iterator_traits<_Iter>::iterator_category + __iterator_category(const _Iter&) + { return typename iterator_traits<_Iter>::iterator_category(); } + + //@} + +_GLIBCXX_END_NAMESPACE + +#endif /* _STL_ITERATOR_BASE_TYPES_H */ + diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_list.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_list.h new file mode 100644 index 00000000..66a50b81 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_list.h @@ -0,0 +1,1533 @@ +// List implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_list.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_LIST_H +#define _STL_LIST_H 1 + +#include +#include + +_GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D) + + // Supporting structures are split into common and templated types; the + // latter publicly inherits from the former in an effort to reduce code + // duplication. This results in some "needless" static_cast'ing later on, + // but it's all safe downcasting. + + /// Common part of a node in the %list. + struct _List_node_base + { + _List_node_base* _M_next; + _List_node_base* _M_prev; + + static void + swap(_List_node_base& __x, _List_node_base& __y); + + void + transfer(_List_node_base * const __first, + _List_node_base * const __last); + + void + reverse(); + + void + hook(_List_node_base * const __position); + + void + unhook(); + }; + + /// An actual node in the %list. + template + struct _List_node : public _List_node_base + { + ///< User's data. + _Tp _M_data; + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + _List_node(_Args&&... __args) + : _List_node_base(), _M_data(std::forward<_Args>(__args)...) { } +#endif + }; + + /** + * @brief A list::iterator. + * + * All the functions are op overloads. + */ + template + struct _List_iterator + { + typedef _List_iterator<_Tp> _Self; + typedef _List_node<_Tp> _Node; + + typedef ptrdiff_t difference_type; + typedef std::bidirectional_iterator_tag iterator_category; + typedef _Tp value_type; + typedef _Tp* pointer; + typedef _Tp& reference; + + _List_iterator() + : _M_node() { } + + explicit + _List_iterator(_List_node_base* __x) + : _M_node(__x) { } + + // Must downcast from List_node_base to _List_node to get to _M_data. + reference + operator*() const + { return static_cast<_Node*>(_M_node)->_M_data; } + + pointer + operator->() const + { return &static_cast<_Node*>(_M_node)->_M_data; } + + _Self& + operator++() + { + _M_node = _M_node->_M_next; + return *this; + } + + _Self + operator++(int) + { + _Self __tmp = *this; + _M_node = _M_node->_M_next; + return __tmp; + } + + _Self& + operator--() + { + _M_node = _M_node->_M_prev; + return *this; + } + + _Self + operator--(int) + { + _Self __tmp = *this; + _M_node = _M_node->_M_prev; + return __tmp; + } + + bool + operator==(const _Self& __x) const + { return _M_node == __x._M_node; } + + bool + operator!=(const _Self& __x) const + { return _M_node != __x._M_node; } + + // The only member points to the %list element. + _List_node_base* _M_node; + }; + + /** + * @brief A list::const_iterator. + * + * All the functions are op overloads. + */ + template + struct _List_const_iterator + { + typedef _List_const_iterator<_Tp> _Self; + typedef const _List_node<_Tp> _Node; + typedef _List_iterator<_Tp> iterator; + + typedef ptrdiff_t difference_type; + typedef std::bidirectional_iterator_tag iterator_category; + typedef _Tp value_type; + typedef const _Tp* pointer; + typedef const _Tp& reference; + + _List_const_iterator() + : _M_node() { } + + explicit + _List_const_iterator(const _List_node_base* __x) + : _M_node(__x) { } + + _List_const_iterator(const iterator& __x) + : _M_node(__x._M_node) { } + + // Must downcast from List_node_base to _List_node to get to + // _M_data. + reference + operator*() const + { return static_cast<_Node*>(_M_node)->_M_data; } + + pointer + operator->() const + { return &static_cast<_Node*>(_M_node)->_M_data; } + + _Self& + operator++() + { + _M_node = _M_node->_M_next; + return *this; + } + + _Self + operator++(int) + { + _Self __tmp = *this; + _M_node = _M_node->_M_next; + return __tmp; + } + + _Self& + operator--() + { + _M_node = _M_node->_M_prev; + return *this; + } + + _Self + operator--(int) + { + _Self __tmp = *this; + _M_node = _M_node->_M_prev; + return __tmp; + } + + bool + operator==(const _Self& __x) const + { return _M_node == __x._M_node; } + + bool + operator!=(const _Self& __x) const + { return _M_node != __x._M_node; } + + // The only member points to the %list element. + const _List_node_base* _M_node; + }; + + template + inline bool + operator==(const _List_iterator<_Val>& __x, + const _List_const_iterator<_Val>& __y) + { return __x._M_node == __y._M_node; } + + template + inline bool + operator!=(const _List_iterator<_Val>& __x, + const _List_const_iterator<_Val>& __y) + { return __x._M_node != __y._M_node; } + + + /// See bits/stl_deque.h's _Deque_base for an explanation. + template + class _List_base + { + protected: + // NOTA BENE + // The stored instance is not actually of "allocator_type"'s + // type. Instead we rebind the type to + // Allocator>, which according to [20.1.5]/4 + // should probably be the same. List_node is not the same + // size as Tp (it's two pointers larger), and specializations on + // Tp may go unused because List_node is being bound + // instead. + // + // We put this to the test in the constructors and in + // get_allocator, where we use conversions between + // allocator_type and _Node_alloc_type. The conversion is + // required by table 32 in [20.1.5]. + typedef typename _Alloc::template rebind<_List_node<_Tp> >::other + _Node_alloc_type; + + typedef typename _Alloc::template rebind<_Tp>::other _Tp_alloc_type; + + struct _List_impl + : public _Node_alloc_type + { + _List_node_base _M_node; + + _List_impl() + : _Node_alloc_type(), _M_node() + { } + + _List_impl(const _Node_alloc_type& __a) + : _Node_alloc_type(__a), _M_node() + { } + }; + + _List_impl _M_impl; + + _List_node<_Tp>* + _M_get_node() + { return _M_impl._Node_alloc_type::allocate(1); } + + void + _M_put_node(_List_node<_Tp>* __p) + { _M_impl._Node_alloc_type::deallocate(__p, 1); } + + public: + typedef _Alloc allocator_type; + + _Node_alloc_type& + _M_get_Node_allocator() + { return *static_cast<_Node_alloc_type*>(&this->_M_impl); } + + const _Node_alloc_type& + _M_get_Node_allocator() const + { return *static_cast(&this->_M_impl); } + + _Tp_alloc_type + _M_get_Tp_allocator() const + { return _Tp_alloc_type(_M_get_Node_allocator()); } + + allocator_type + get_allocator() const + { return allocator_type(_M_get_Node_allocator()); } + + _List_base() + : _M_impl() + { _M_init(); } + + _List_base(const allocator_type& __a) + : _M_impl(__a) + { _M_init(); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + _List_base(_List_base&& __x) + : _M_impl(__x._M_get_Node_allocator()) + { + _M_init(); + _List_node_base::swap(this->_M_impl._M_node, __x._M_impl._M_node); + } +#endif + + // This is what actually destroys the list. + ~_List_base() + { _M_clear(); } + + void + _M_clear(); + + void + _M_init() + { + this->_M_impl._M_node._M_next = &this->_M_impl._M_node; + this->_M_impl._M_node._M_prev = &this->_M_impl._M_node; + } + }; + + /** + * @brief A standard container with linear time access to elements, + * and fixed time insertion/deletion at any point in the sequence. + * + * @ingroup sequences + * + * Meets the requirements of a container, a + * reversible container, and a + * sequence, including the + * optional sequence requirements with the + * %exception of @c at and @c operator[]. + * + * This is a @e doubly @e linked %list. Traversal up and down the + * %list requires linear time, but adding and removing elements (or + * @e nodes) is done in constant time, regardless of where the + * change takes place. Unlike std::vector and std::deque, + * random-access iterators are not provided, so subscripting ( @c + * [] ) access is not allowed. For algorithms which only need + * sequential access, this lack makes no difference. + * + * Also unlike the other standard containers, std::list provides + * specialized algorithms %unique to linked lists, such as + * splicing, sorting, and in-place reversal. + * + * A couple points on memory allocation for list: + * + * First, we never actually allocate a Tp, we allocate + * List_node's and trust [20.1.5]/4 to DTRT. This is to ensure + * that after elements from %list are spliced into + * %list, destroying the memory of the second %list is a + * valid operation, i.e., Alloc1 giveth and Alloc2 taketh away. + * + * Second, a %list conceptually represented as + * @code + * A <---> B <---> C <---> D + * @endcode + * is actually circular; a link exists between A and D. The %list + * class holds (as its only data member) a private list::iterator + * pointing to @e D, not to @e A! To get to the head of the %list, + * we start at the tail and move forward by one. When this member + * iterator's next/previous pointers refer to itself, the %list is + * %empty. + */ + template > + class list : protected _List_base<_Tp, _Alloc> + { + // concept requirements + typedef typename _Alloc::value_type _Alloc_value_type; + __glibcxx_class_requires(_Tp, _SGIAssignableConcept) + __glibcxx_class_requires2(_Tp, _Alloc_value_type, _SameTypeConcept) + + typedef _List_base<_Tp, _Alloc> _Base; + typedef typename _Base::_Tp_alloc_type _Tp_alloc_type; + + public: + typedef _Tp value_type; + typedef typename _Tp_alloc_type::pointer pointer; + typedef typename _Tp_alloc_type::const_pointer const_pointer; + typedef typename _Tp_alloc_type::reference reference; + typedef typename _Tp_alloc_type::const_reference const_reference; + typedef _List_iterator<_Tp> iterator; + typedef _List_const_iterator<_Tp> const_iterator; + typedef std::reverse_iterator const_reverse_iterator; + typedef std::reverse_iterator reverse_iterator; + typedef size_t size_type; + typedef ptrdiff_t difference_type; + typedef _Alloc allocator_type; + + protected: + // Note that pointers-to-_Node's can be ctor-converted to + // iterator types. + typedef _List_node<_Tp> _Node; + + using _Base::_M_impl; + using _Base::_M_put_node; + using _Base::_M_get_node; + using _Base::_M_get_Tp_allocator; + using _Base::_M_get_Node_allocator; + + /** + * @param x An instance of user data. + * + * Allocates space for a new node and constructs a copy of @a x in it. + */ +#ifndef __GXX_EXPERIMENTAL_CXX0X__ + _Node* + _M_create_node(const value_type& __x) + { + _Node* __p = this->_M_get_node(); + __try + { + _M_get_Tp_allocator().construct(&__p->_M_data, __x); + } + __catch(...) + { + _M_put_node(__p); + __throw_exception_again; + } + return __p; + } +#else + template + _Node* + _M_create_node(_Args&&... __args) + { + _Node* __p = this->_M_get_node(); + __try + { + _M_get_Node_allocator().construct(__p, + std::forward<_Args>(__args)...); + } + __catch(...) + { + _M_put_node(__p); + __throw_exception_again; + } + return __p; + } +#endif + + public: + // [23.2.2.1] construct/copy/destroy + // (assign() and get_allocator() are also listed in this section) + /** + * @brief Default constructor creates no elements. + */ + list() + : _Base() { } + + /** + * @brief Creates a %list with no elements. + * @param a An allocator object. + */ + explicit + list(const allocator_type& __a) + : _Base(__a) { } + + /** + * @brief Creates a %list with copies of an exemplar element. + * @param n The number of elements to initially create. + * @param value An element to copy. + * @param a An allocator object. + * + * This constructor fills the %list with @a n copies of @a value. + */ + explicit + list(size_type __n, const value_type& __value = value_type(), + const allocator_type& __a = allocator_type()) + : _Base(__a) + { _M_fill_initialize(__n, __value); } + + /** + * @brief %List copy constructor. + * @param x A %list of identical element and allocator types. + * + * The newly-created %list uses a copy of the allocation object used + * by @a x. + */ + list(const list& __x) + : _Base(__x._M_get_Node_allocator()) + { _M_initialize_dispatch(__x.begin(), __x.end(), __false_type()); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief %List move constructor. + * @param x A %list of identical element and allocator types. + * + * The newly-created %list contains the exact contents of @a x. + * The contents of @a x are a valid, but unspecified %list. + */ + list(list&& __x) + : _Base(std::forward<_Base>(__x)) { } + + /** + * @brief Builds a %list from an initializer_list + * @param l An initializer_list of value_type. + * @param a An allocator object. + * + * Create a %list consisting of copies of the elements in the + * initializer_list @a l. This is linear in l.size(). + */ + list(initializer_list __l, + const allocator_type& __a = allocator_type()) + : _Base(__a) + { _M_initialize_dispatch(__l.begin(), __l.end(), __false_type()); } +#endif + + /** + * @brief Builds a %list from a range. + * @param first An input iterator. + * @param last An input iterator. + * @param a An allocator object. + * + * Create a %list consisting of copies of the elements from + * [@a first,@a last). This is linear in N (where N is + * distance(@a first,@a last)). + */ + template + list(_InputIterator __first, _InputIterator __last, + const allocator_type& __a = allocator_type()) + : _Base(__a) + { + // Check whether it's an integral type. If so, it's not an iterator. + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + _M_initialize_dispatch(__first, __last, _Integral()); + } + + /** + * No explicit dtor needed as the _Base dtor takes care of + * things. The _Base dtor only erases the elements, and note + * that if the elements themselves are pointers, the pointed-to + * memory is not touched in any way. Managing the pointer is + * the user's responsibility. + */ + + /** + * @brief %List assignment operator. + * @param x A %list of identical element and allocator types. + * + * All the elements of @a x are copied, but unlike the copy + * constructor, the allocator object is not copied. + */ + list& + operator=(const list& __x); + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief %List move assignment operator. + * @param x A %list of identical element and allocator types. + * + * The contents of @a x are moved into this %list (without copying). + * @a x is a valid, but unspecified %list + */ + list& + operator=(list&& __x) + { + // NB: DR 675. + this->clear(); + this->swap(__x); + return *this; + } + + /** + * @brief %List initializer list assignment operator. + * @param l An initializer_list of value_type. + * + * Replace the contents of the %list with copies of the elements + * in the initializer_list @a l. This is linear in l.size(). + */ + list& + operator=(initializer_list __l) + { + this->assign(__l.begin(), __l.end()); + return *this; + } +#endif + + /** + * @brief Assigns a given value to a %list. + * @param n Number of elements to be assigned. + * @param val Value to be assigned. + * + * This function fills a %list with @a n copies of the given + * value. Note that the assignment completely changes the %list + * and that the resulting %list's size is the same as the number + * of elements assigned. Old data may be lost. + */ + void + assign(size_type __n, const value_type& __val) + { _M_fill_assign(__n, __val); } + + /** + * @brief Assigns a range to a %list. + * @param first An input iterator. + * @param last An input iterator. + * + * This function fills a %list with copies of the elements in the + * range [@a first,@a last). + * + * Note that the assignment completely changes the %list and + * that the resulting %list's size is the same as the number of + * elements assigned. Old data may be lost. + */ + template + void + assign(_InputIterator __first, _InputIterator __last) + { + // Check whether it's an integral type. If so, it's not an iterator. + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + _M_assign_dispatch(__first, __last, _Integral()); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Assigns an initializer_list to a %list. + * @param l An initializer_list of value_type. + * + * Replace the contents of the %list with copies of the elements + * in the initializer_list @a l. This is linear in l.size(). + */ + void + assign(initializer_list __l) + { this->assign(__l.begin(), __l.end()); } +#endif + + /// Get a copy of the memory allocation object. + allocator_type + get_allocator() const + { return _Base::get_allocator(); } + + // iterators + /** + * Returns a read/write iterator that points to the first element in the + * %list. Iteration is done in ordinary element order. + */ + iterator + begin() + { return iterator(this->_M_impl._M_node._M_next); } + + /** + * Returns a read-only (constant) iterator that points to the + * first element in the %list. Iteration is done in ordinary + * element order. + */ + const_iterator + begin() const + { return const_iterator(this->_M_impl._M_node._M_next); } + + /** + * Returns a read/write iterator that points one past the last + * element in the %list. Iteration is done in ordinary element + * order. + */ + iterator + end() + { return iterator(&this->_M_impl._M_node); } + + /** + * Returns a read-only (constant) iterator that points one past + * the last element in the %list. Iteration is done in ordinary + * element order. + */ + const_iterator + end() const + { return const_iterator(&this->_M_impl._M_node); } + + /** + * Returns a read/write reverse iterator that points to the last + * element in the %list. Iteration is done in reverse element + * order. + */ + reverse_iterator + rbegin() + { return reverse_iterator(end()); } + + /** + * Returns a read-only (constant) reverse iterator that points to + * the last element in the %list. Iteration is done in reverse + * element order. + */ + const_reverse_iterator + rbegin() const + { return const_reverse_iterator(end()); } + + /** + * Returns a read/write reverse iterator that points to one + * before the first element in the %list. Iteration is done in + * reverse element order. + */ + reverse_iterator + rend() + { return reverse_iterator(begin()); } + + /** + * Returns a read-only (constant) reverse iterator that points to one + * before the first element in the %list. Iteration is done in reverse + * element order. + */ + const_reverse_iterator + rend() const + { return const_reverse_iterator(begin()); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * Returns a read-only (constant) iterator that points to the + * first element in the %list. Iteration is done in ordinary + * element order. + */ + const_iterator + cbegin() const + { return const_iterator(this->_M_impl._M_node._M_next); } + + /** + * Returns a read-only (constant) iterator that points one past + * the last element in the %list. Iteration is done in ordinary + * element order. + */ + const_iterator + cend() const + { return const_iterator(&this->_M_impl._M_node); } + + /** + * Returns a read-only (constant) reverse iterator that points to + * the last element in the %list. Iteration is done in reverse + * element order. + */ + const_reverse_iterator + crbegin() const + { return const_reverse_iterator(end()); } + + /** + * Returns a read-only (constant) reverse iterator that points to one + * before the first element in the %list. Iteration is done in reverse + * element order. + */ + const_reverse_iterator + crend() const + { return const_reverse_iterator(begin()); } +#endif + + // [23.2.2.2] capacity + /** + * Returns true if the %list is empty. (Thus begin() would equal + * end().) + */ + bool + empty() const + { return this->_M_impl._M_node._M_next == &this->_M_impl._M_node; } + + /** Returns the number of elements in the %list. */ + size_type + size() const + { return std::distance(begin(), end()); } + + /** Returns the size() of the largest possible %list. */ + size_type + max_size() const + { return _M_get_Node_allocator().max_size(); } + + /** + * @brief Resizes the %list to the specified number of elements. + * @param new_size Number of elements the %list should contain. + * @param x Data with which new elements should be populated. + * + * This function will %resize the %list to the specified number + * of elements. If the number is smaller than the %list's + * current size the %list is truncated, otherwise the %list is + * extended and new elements are populated with given data. + */ + void + resize(size_type __new_size, value_type __x = value_type()); + + // element access + /** + * Returns a read/write reference to the data at the first + * element of the %list. + */ + reference + front() + { return *begin(); } + + /** + * Returns a read-only (constant) reference to the data at the first + * element of the %list. + */ + const_reference + front() const + { return *begin(); } + + /** + * Returns a read/write reference to the data at the last element + * of the %list. + */ + reference + back() + { + iterator __tmp = end(); + --__tmp; + return *__tmp; + } + + /** + * Returns a read-only (constant) reference to the data at the last + * element of the %list. + */ + const_reference + back() const + { + const_iterator __tmp = end(); + --__tmp; + return *__tmp; + } + + // [23.2.2.3] modifiers + /** + * @brief Add data to the front of the %list. + * @param x Data to be added. + * + * This is a typical stack operation. The function creates an + * element at the front of the %list and assigns the given data + * to it. Due to the nature of a %list this operation can be + * done in constant time, and does not invalidate iterators and + * references. + */ + void + push_front(const value_type& __x) + { this->_M_insert(begin(), __x); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + void + push_front(value_type&& __x) + { this->_M_insert(begin(), std::move(__x)); } + + template + void + emplace_front(_Args&&... __args) + { this->_M_insert(begin(), std::forward<_Args>(__args)...); } +#endif + + /** + * @brief Removes first element. + * + * This is a typical stack operation. It shrinks the %list by + * one. Due to the nature of a %list this operation can be done + * in constant time, and only invalidates iterators/references to + * the element being removed. + * + * Note that no data is returned, and if the first element's data + * is needed, it should be retrieved before pop_front() is + * called. + */ + void + pop_front() + { this->_M_erase(begin()); } + + /** + * @brief Add data to the end of the %list. + * @param x Data to be added. + * + * This is a typical stack operation. The function creates an + * element at the end of the %list and assigns the given data to + * it. Due to the nature of a %list this operation can be done + * in constant time, and does not invalidate iterators and + * references. + */ + void + push_back(const value_type& __x) + { this->_M_insert(end(), __x); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + void + push_back(value_type&& __x) + { this->_M_insert(end(), std::move(__x)); } + + template + void + emplace_back(_Args&&... __args) + { this->_M_insert(end(), std::forward<_Args>(__args)...); } +#endif + + /** + * @brief Removes last element. + * + * This is a typical stack operation. It shrinks the %list by + * one. Due to the nature of a %list this operation can be done + * in constant time, and only invalidates iterators/references to + * the element being removed. + * + * Note that no data is returned, and if the last element's data + * is needed, it should be retrieved before pop_back() is called. + */ + void + pop_back() + { this->_M_erase(iterator(this->_M_impl._M_node._M_prev)); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Constructs object in %list before specified iterator. + * @param position A const_iterator into the %list. + * @param args Arguments. + * @return An iterator that points to the inserted data. + * + * This function will insert an object of type T constructed + * with T(std::forward(args)...) before the specified + * location. Due to the nature of a %list this operation can + * be done in constant time, and does not invalidate iterators + * and references. + */ + template + iterator + emplace(iterator __position, _Args&&... __args); +#endif + + /** + * @brief Inserts given value into %list before specified iterator. + * @param position An iterator into the %list. + * @param x Data to be inserted. + * @return An iterator that points to the inserted data. + * + * This function will insert a copy of the given value before + * the specified location. Due to the nature of a %list this + * operation can be done in constant time, and does not + * invalidate iterators and references. + */ + iterator + insert(iterator __position, const value_type& __x); + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Inserts given rvalue into %list before specified iterator. + * @param position An iterator into the %list. + * @param x Data to be inserted. + * @return An iterator that points to the inserted data. + * + * This function will insert a copy of the given rvalue before + * the specified location. Due to the nature of a %list this + * operation can be done in constant time, and does not + * invalidate iterators and references. + */ + iterator + insert(iterator __position, value_type&& __x) + { return emplace(__position, std::move(__x)); } + + /** + * @brief Inserts the contents of an initializer_list into %list + * before specified iterator. + * @param p An iterator into the %list. + * @param l An initializer_list of value_type. + * + * This function will insert copies of the data in the + * initializer_list @a l into the %list before the location + * specified by @a p. + * + * This operation is linear in the number of elements inserted and + * does not invalidate iterators and references. + */ + void + insert(iterator __p, initializer_list __l) + { this->insert(__p, __l.begin(), __l.end()); } +#endif + + /** + * @brief Inserts a number of copies of given data into the %list. + * @param position An iterator into the %list. + * @param n Number of elements to be inserted. + * @param x Data to be inserted. + * + * This function will insert a specified number of copies of the + * given data before the location specified by @a position. + * + * This operation is linear in the number of elements inserted and + * does not invalidate iterators and references. + */ + void + insert(iterator __position, size_type __n, const value_type& __x) + { + list __tmp(__n, __x, _M_get_Node_allocator()); + splice(__position, __tmp); + } + + /** + * @brief Inserts a range into the %list. + * @param position An iterator into the %list. + * @param first An input iterator. + * @param last An input iterator. + * + * This function will insert copies of the data in the range [@a + * first,@a last) into the %list before the location specified by + * @a position. + * + * This operation is linear in the number of elements inserted and + * does not invalidate iterators and references. + */ + template + void + insert(iterator __position, _InputIterator __first, + _InputIterator __last) + { + list __tmp(__first, __last, _M_get_Node_allocator()); + splice(__position, __tmp); + } + + /** + * @brief Remove element at given position. + * @param position Iterator pointing to element to be erased. + * @return An iterator pointing to the next element (or end()). + * + * This function will erase the element at the given position and thus + * shorten the %list by one. + * + * Due to the nature of a %list this operation can be done in + * constant time, and only invalidates iterators/references to + * the element being removed. The user is also cautioned that + * this function only erases the element, and that if the element + * is itself a pointer, the pointed-to memory is not touched in + * any way. Managing the pointer is the user's responsibility. + */ + iterator + erase(iterator __position); + + /** + * @brief Remove a range of elements. + * @param first Iterator pointing to the first element to be erased. + * @param last Iterator pointing to one past the last element to be + * erased. + * @return An iterator pointing to the element pointed to by @a last + * prior to erasing (or end()). + * + * This function will erase the elements in the range @a + * [first,last) and shorten the %list accordingly. + * + * This operation is linear time in the size of the range and only + * invalidates iterators/references to the element being removed. + * The user is also cautioned that this function only erases the + * elements, and that if the elements themselves are pointers, the + * pointed-to memory is not touched in any way. Managing the pointer + * is the user's responsibility. + */ + iterator + erase(iterator __first, iterator __last) + { + while (__first != __last) + __first = erase(__first); + return __last; + } + + /** + * @brief Swaps data with another %list. + * @param x A %list of the same element and allocator types. + * + * This exchanges the elements between two lists in constant + * time. Note that the global std::swap() function is + * specialized such that std::swap(l1,l2) will feed to this + * function. + */ + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + swap(list&& __x) +#else + swap(list& __x) +#endif + { + _List_node_base::swap(this->_M_impl._M_node, __x._M_impl._M_node); + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 431. Swapping containers with unequal allocators. + std::__alloc_swap:: + _S_do_it(_M_get_Node_allocator(), __x._M_get_Node_allocator()); + } + + /** + * Erases all the elements. Note that this function only erases + * the elements, and that if the elements themselves are + * pointers, the pointed-to memory is not touched in any way. + * Managing the pointer is the user's responsibility. + */ + void + clear() + { + _Base::_M_clear(); + _Base::_M_init(); + } + + // [23.2.2.4] list operations + /** + * @brief Insert contents of another %list. + * @param position Iterator referencing the element to insert before. + * @param x Source list. + * + * The elements of @a x are inserted in constant time in front of + * the element referenced by @a position. @a x becomes an empty + * list. + * + * Requires this != @a x. + */ + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + splice(iterator __position, list&& __x) +#else + splice(iterator __position, list& __x) +#endif + { + if (!__x.empty()) + { + _M_check_equal_allocators(__x); + + this->_M_transfer(__position, __x.begin(), __x.end()); + } + } + + /** + * @brief Insert element from another %list. + * @param position Iterator referencing the element to insert before. + * @param x Source list. + * @param i Iterator referencing the element to move. + * + * Removes the element in list @a x referenced by @a i and + * inserts it into the current list before @a position. + */ + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + splice(iterator __position, list&& __x, iterator __i) +#else + splice(iterator __position, list& __x, iterator __i) +#endif + { + iterator __j = __i; + ++__j; + if (__position == __i || __position == __j) + return; + + if (this != &__x) + _M_check_equal_allocators(__x); + + this->_M_transfer(__position, __i, __j); + } + + /** + * @brief Insert range from another %list. + * @param position Iterator referencing the element to insert before. + * @param x Source list. + * @param first Iterator referencing the start of range in x. + * @param last Iterator referencing the end of range in x. + * + * Removes elements in the range [first,last) and inserts them + * before @a position in constant time. + * + * Undefined if @a position is in [first,last). + */ + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + splice(iterator __position, list&& __x, iterator __first, + iterator __last) +#else + splice(iterator __position, list& __x, iterator __first, + iterator __last) +#endif + { + if (__first != __last) + { + if (this != &__x) + _M_check_equal_allocators(__x); + + this->_M_transfer(__position, __first, __last); + } + } + + /** + * @brief Remove all elements equal to value. + * @param value The value to remove. + * + * Removes every element in the list equal to @a value. + * Remaining elements stay in list order. Note that this + * function only erases the elements, and that if the elements + * themselves are pointers, the pointed-to memory is not + * touched in any way. Managing the pointer is the user's + * responsibility. + */ + void + remove(const _Tp& __value); + + /** + * @brief Remove all elements satisfying a predicate. + * @param Predicate Unary predicate function or object. + * + * Removes every element in the list for which the predicate + * returns true. Remaining elements stay in list order. Note + * that this function only erases the elements, and that if the + * elements themselves are pointers, the pointed-to memory is + * not touched in any way. Managing the pointer is the user's + * responsibility. + */ + template + void + remove_if(_Predicate); + + /** + * @brief Remove consecutive duplicate elements. + * + * For each consecutive set of elements with the same value, + * remove all but the first one. Remaining elements stay in + * list order. Note that this function only erases the + * elements, and that if the elements themselves are pointers, + * the pointed-to memory is not touched in any way. Managing + * the pointer is the user's responsibility. + */ + void + unique(); + + /** + * @brief Remove consecutive elements satisfying a predicate. + * @param BinaryPredicate Binary predicate function or object. + * + * For each consecutive set of elements [first,last) that + * satisfy predicate(first,i) where i is an iterator in + * [first,last), remove all but the first one. Remaining + * elements stay in list order. Note that this function only + * erases the elements, and that if the elements themselves are + * pointers, the pointed-to memory is not touched in any way. + * Managing the pointer is the user's responsibility. + */ + template + void + unique(_BinaryPredicate); + + /** + * @brief Merge sorted lists. + * @param x Sorted list to merge. + * + * Assumes that both @a x and this list are sorted according to + * operator<(). Merges elements of @a x into this list in + * sorted order, leaving @a x empty when complete. Elements in + * this list precede elements in @a x that are equal. + */ + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + merge(list&& __x); +#else + merge(list& __x); +#endif + + /** + * @brief Merge sorted lists according to comparison function. + * @param x Sorted list to merge. + * @param StrictWeakOrdering Comparison function defining + * sort order. + * + * Assumes that both @a x and this list are sorted according to + * StrictWeakOrdering. Merges elements of @a x into this list + * in sorted order, leaving @a x empty when complete. Elements + * in this list precede elements in @a x that are equivalent + * according to StrictWeakOrdering(). + */ + template + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + merge(list&&, _StrictWeakOrdering); +#else + merge(list&, _StrictWeakOrdering); +#endif + + /** + * @brief Reverse the elements in list. + * + * Reverse the order of elements in the list in linear time. + */ + void + reverse() + { this->_M_impl._M_node.reverse(); } + + /** + * @brief Sort the elements. + * + * Sorts the elements of this list in NlogN time. Equivalent + * elements remain in list order. + */ + void + sort(); + + /** + * @brief Sort the elements according to comparison function. + * + * Sorts the elements of this list in NlogN time. Equivalent + * elements remain in list order. + */ + template + void + sort(_StrictWeakOrdering); + + protected: + // Internal constructor functions follow. + + // Called by the range constructor to implement [23.1.1]/9 + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 438. Ambiguity in the "do the right thing" clause + template + void + _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) + { _M_fill_initialize(static_cast(__n), __x); } + + // Called by the range constructor to implement [23.1.1]/9 + template + void + _M_initialize_dispatch(_InputIterator __first, _InputIterator __last, + __false_type) + { + for (; __first != __last; ++__first) + push_back(*__first); + } + + // Called by list(n,v,a), and the range constructor when it turns out + // to be the same thing. + void + _M_fill_initialize(size_type __n, const value_type& __x) + { + for (; __n > 0; --__n) + push_back(__x); + } + + + // Internal assign functions follow. + + // Called by the range assign to implement [23.1.1]/9 + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 438. Ambiguity in the "do the right thing" clause + template + void + _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) + { _M_fill_assign(__n, __val); } + + // Called by the range assign to implement [23.1.1]/9 + template + void + _M_assign_dispatch(_InputIterator __first, _InputIterator __last, + __false_type); + + // Called by assign(n,t), and the range assign when it turns out + // to be the same thing. + void + _M_fill_assign(size_type __n, const value_type& __val); + + + // Moves the elements from [first,last) before position. + void + _M_transfer(iterator __position, iterator __first, iterator __last) + { __position._M_node->transfer(__first._M_node, __last._M_node); } + + // Inserts new element at position given and with value given. +#ifndef __GXX_EXPERIMENTAL_CXX0X__ + void + _M_insert(iterator __position, const value_type& __x) + { + _Node* __tmp = _M_create_node(__x); + __tmp->hook(__position._M_node); + } +#else + template + void + _M_insert(iterator __position, _Args&&... __args) + { + _Node* __tmp = _M_create_node(std::forward<_Args>(__args)...); + __tmp->hook(__position._M_node); + } +#endif + + // Erases element at position given. + void + _M_erase(iterator __position) + { + __position._M_node->unhook(); + _Node* __n = static_cast<_Node*>(__position._M_node); +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + _M_get_Node_allocator().destroy(__n); +#else + _M_get_Tp_allocator().destroy(&__n->_M_data); +#endif + _M_put_node(__n); + } + + // To implement the splice (and merge) bits of N1599. + void + _M_check_equal_allocators(list& __x) + { + if (std::__alloc_neq:: + _S_do_it(_M_get_Node_allocator(), __x._M_get_Node_allocator())) + __throw_runtime_error(__N("list::_M_check_equal_allocators")); + } + }; + + /** + * @brief List equality comparison. + * @param x A %list. + * @param y A %list of the same type as @a x. + * @return True iff the size and elements of the lists are equal. + * + * This is an equivalence relation. It is linear in the size of + * the lists. Lists are considered equivalent if their sizes are + * equal, and if corresponding elements compare equal. + */ + template + inline bool + operator==(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) + { + typedef typename list<_Tp, _Alloc>::const_iterator const_iterator; + const_iterator __end1 = __x.end(); + const_iterator __end2 = __y.end(); + + const_iterator __i1 = __x.begin(); + const_iterator __i2 = __y.begin(); + while (__i1 != __end1 && __i2 != __end2 && *__i1 == *__i2) + { + ++__i1; + ++__i2; + } + return __i1 == __end1 && __i2 == __end2; + } + + /** + * @brief List ordering relation. + * @param x A %list. + * @param y A %list of the same type as @a x. + * @return True iff @a x is lexicographically less than @a y. + * + * This is a total ordering relation. It is linear in the size of the + * lists. The elements must be comparable with @c <. + * + * See std::lexicographical_compare() for how the determination is made. + */ + template + inline bool + operator<(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) + { return std::lexicographical_compare(__x.begin(), __x.end(), + __y.begin(), __y.end()); } + + /// Based on operator== + template + inline bool + operator!=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) + { return !(__x == __y); } + + /// Based on operator< + template + inline bool + operator>(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) + { return __y < __x; } + + /// Based on operator< + template + inline bool + operator<=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) + { return !(__y < __x); } + + /// Based on operator< + template + inline bool + operator>=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) + { return !(__x < __y); } + + /// See std::list::swap(). + template + inline void + swap(list<_Tp, _Alloc>& __x, list<_Tp, _Alloc>& __y) + { __x.swap(__y); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + inline void + swap(list<_Tp, _Alloc>&& __x, list<_Tp, _Alloc>& __y) + { __x.swap(__y); } + + template + inline void + swap(list<_Tp, _Alloc>& __x, list<_Tp, _Alloc>&& __y) + { __x.swap(__y); } +#endif + +_GLIBCXX_END_NESTED_NAMESPACE + +#endif /* _STL_LIST_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_map.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_map.h new file mode 100644 index 00000000..90e5239d --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_map.h @@ -0,0 +1,871 @@ +// Map implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_map.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_MAP_H +#define _STL_MAP_H 1 + +#include +#include +#include + +_GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D) + + /** + * @brief A standard container made up of (key,value) pairs, which can be + * retrieved based on a key, in logarithmic time. + * + * @ingroup associative_containers + * + * Meets the requirements of a container, a + * reversible container, and an + * associative container (using unique keys). + * For a @c map the key_type is Key, the mapped_type is T, and the + * value_type is std::pair. + * + * Maps support bidirectional iterators. + * + * The private tree data is declared exactly the same way for map and + * multimap; the distinction is made entirely in how the tree functions are + * called (*_unique versus *_equal, same as the standard). + */ + template , + typename _Alloc = std::allocator > > + class map + { + public: + typedef _Key key_type; + typedef _Tp mapped_type; + typedef std::pair value_type; + typedef _Compare key_compare; + typedef _Alloc allocator_type; + + private: + // concept requirements + typedef typename _Alloc::value_type _Alloc_value_type; + __glibcxx_class_requires(_Tp, _SGIAssignableConcept) + __glibcxx_class_requires4(_Compare, bool, _Key, _Key, + _BinaryFunctionConcept) + __glibcxx_class_requires2(value_type, _Alloc_value_type, _SameTypeConcept) + + public: + class value_compare + : public std::binary_function + { + friend class map<_Key, _Tp, _Compare, _Alloc>; + protected: + _Compare comp; + + value_compare(_Compare __c) + : comp(__c) { } + + public: + bool operator()(const value_type& __x, const value_type& __y) const + { return comp(__x.first, __y.first); } + }; + + private: + /// This turns a red-black tree into a [multi]map. + typedef typename _Alloc::template rebind::other + _Pair_alloc_type; + + typedef _Rb_tree, + key_compare, _Pair_alloc_type> _Rep_type; + + /// The actual tree structure. + _Rep_type _M_t; + + public: + // many of these are specified differently in ISO, but the following are + // "functionally equivalent" + typedef typename _Pair_alloc_type::pointer pointer; + typedef typename _Pair_alloc_type::const_pointer const_pointer; + typedef typename _Pair_alloc_type::reference reference; + typedef typename _Pair_alloc_type::const_reference const_reference; + typedef typename _Rep_type::iterator iterator; + typedef typename _Rep_type::const_iterator const_iterator; + typedef typename _Rep_type::size_type size_type; + typedef typename _Rep_type::difference_type difference_type; + typedef typename _Rep_type::reverse_iterator reverse_iterator; + typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator; + + // [23.3.1.1] construct/copy/destroy + // (get_allocator() is normally listed in this section, but seems to have + // been accidentally omitted in the printed standard) + /** + * @brief Default constructor creates no elements. + */ + map() + : _M_t() { } + + /** + * @brief Creates a %map with no elements. + * @param comp A comparison object. + * @param a An allocator object. + */ + explicit + map(const _Compare& __comp, + const allocator_type& __a = allocator_type()) + : _M_t(__comp, __a) { } + + /** + * @brief %Map copy constructor. + * @param x A %map of identical element and allocator types. + * + * The newly-created %map uses a copy of the allocation object + * used by @a x. + */ + map(const map& __x) + : _M_t(__x._M_t) { } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief %Map move constructor. + * @param x A %map of identical element and allocator types. + * + * The newly-created %map contains the exact contents of @a x. + * The contents of @a x are a valid, but unspecified %map. + */ + map(map&& __x) + : _M_t(std::forward<_Rep_type>(__x._M_t)) { } + + /** + * @brief Builds a %map from an initializer_list. + * @param l An initializer_list. + * @param comp A comparison object. + * @param a An allocator object. + * + * Create a %map consisting of copies of the elements in the + * initializer_list @a l. + * This is linear in N if the range is already sorted, and NlogN + * otherwise (where N is @a l.size()). + */ + map(initializer_list __l, + const _Compare& __c = _Compare(), + const allocator_type& __a = allocator_type()) + : _M_t(__c, __a) + { _M_t._M_insert_unique(__l.begin(), __l.end()); } +#endif + + /** + * @brief Builds a %map from a range. + * @param first An input iterator. + * @param last An input iterator. + * + * Create a %map consisting of copies of the elements from [first,last). + * This is linear in N if the range is already sorted, and NlogN + * otherwise (where N is distance(first,last)). + */ + template + map(_InputIterator __first, _InputIterator __last) + : _M_t() + { _M_t._M_insert_unique(__first, __last); } + + /** + * @brief Builds a %map from a range. + * @param first An input iterator. + * @param last An input iterator. + * @param comp A comparison functor. + * @param a An allocator object. + * + * Create a %map consisting of copies of the elements from [first,last). + * This is linear in N if the range is already sorted, and NlogN + * otherwise (where N is distance(first,last)). + */ + template + map(_InputIterator __first, _InputIterator __last, + const _Compare& __comp, + const allocator_type& __a = allocator_type()) + : _M_t(__comp, __a) + { _M_t._M_insert_unique(__first, __last); } + + // FIXME There is no dtor declared, but we should have something + // generated by Doxygen. I don't know what tags to add to this + // paragraph to make that happen: + /** + * The dtor only erases the elements, and note that if the elements + * themselves are pointers, the pointed-to memory is not touched in any + * way. Managing the pointer is the user's responsibility. + */ + + /** + * @brief %Map assignment operator. + * @param x A %map of identical element and allocator types. + * + * All the elements of @a x are copied, but unlike the copy constructor, + * the allocator object is not copied. + */ + map& + operator=(const map& __x) + { + _M_t = __x._M_t; + return *this; + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief %Map move assignment operator. + * @param x A %map of identical element and allocator types. + * + * The contents of @a x are moved into this map (without copying). + * @a x is a valid, but unspecified %map. + */ + map& + operator=(map&& __x) + { + // NB: DR 675. + this->clear(); + this->swap(__x); + return *this; + } + + /** + * @brief %Map list assignment operator. + * @param l An initializer_list. + * + * This function fills a %map with copies of the elements in the + * initializer list @a l. + * + * Note that the assignment completely changes the %map and + * that the resulting %map's size is the same as the number + * of elements assigned. Old data may be lost. + */ + map& + operator=(initializer_list __l) + { + this->clear(); + this->insert(__l.begin(), __l.end()); + return *this; + } +#endif + + /// Get a copy of the memory allocation object. + allocator_type + get_allocator() const + { return _M_t.get_allocator(); } + + // iterators + /** + * Returns a read/write iterator that points to the first pair in the + * %map. + * Iteration is done in ascending order according to the keys. + */ + iterator + begin() + { return _M_t.begin(); } + + /** + * Returns a read-only (constant) iterator that points to the first pair + * in the %map. Iteration is done in ascending order according to the + * keys. + */ + const_iterator + begin() const + { return _M_t.begin(); } + + /** + * Returns a read/write iterator that points one past the last + * pair in the %map. Iteration is done in ascending order + * according to the keys. + */ + iterator + end() + { return _M_t.end(); } + + /** + * Returns a read-only (constant) iterator that points one past the last + * pair in the %map. Iteration is done in ascending order according to + * the keys. + */ + const_iterator + end() const + { return _M_t.end(); } + + /** + * Returns a read/write reverse iterator that points to the last pair in + * the %map. Iteration is done in descending order according to the + * keys. + */ + reverse_iterator + rbegin() + { return _M_t.rbegin(); } + + /** + * Returns a read-only (constant) reverse iterator that points to the + * last pair in the %map. Iteration is done in descending order + * according to the keys. + */ + const_reverse_iterator + rbegin() const + { return _M_t.rbegin(); } + + /** + * Returns a read/write reverse iterator that points to one before the + * first pair in the %map. Iteration is done in descending order + * according to the keys. + */ + reverse_iterator + rend() + { return _M_t.rend(); } + + /** + * Returns a read-only (constant) reverse iterator that points to one + * before the first pair in the %map. Iteration is done in descending + * order according to the keys. + */ + const_reverse_iterator + rend() const + { return _M_t.rend(); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * Returns a read-only (constant) iterator that points to the first pair + * in the %map. Iteration is done in ascending order according to the + * keys. + */ + const_iterator + cbegin() const + { return _M_t.begin(); } + + /** + * Returns a read-only (constant) iterator that points one past the last + * pair in the %map. Iteration is done in ascending order according to + * the keys. + */ + const_iterator + cend() const + { return _M_t.end(); } + + /** + * Returns a read-only (constant) reverse iterator that points to the + * last pair in the %map. Iteration is done in descending order + * according to the keys. + */ + const_reverse_iterator + crbegin() const + { return _M_t.rbegin(); } + + /** + * Returns a read-only (constant) reverse iterator that points to one + * before the first pair in the %map. Iteration is done in descending + * order according to the keys. + */ + const_reverse_iterator + crend() const + { return _M_t.rend(); } +#endif + + // capacity + /** Returns true if the %map is empty. (Thus begin() would equal + * end().) + */ + bool + empty() const + { return _M_t.empty(); } + + /** Returns the size of the %map. */ + size_type + size() const + { return _M_t.size(); } + + /** Returns the maximum size of the %map. */ + size_type + max_size() const + { return _M_t.max_size(); } + + // [23.3.1.2] element access + /** + * @brief Subscript ( @c [] ) access to %map data. + * @param k The key for which data should be retrieved. + * @return A reference to the data of the (key,data) %pair. + * + * Allows for easy lookup with the subscript ( @c [] ) + * operator. Returns data associated with the key specified in + * subscript. If the key does not exist, a pair with that key + * is created using default values, which is then returned. + * + * Lookup requires logarithmic time. + */ + mapped_type& + operator[](const key_type& __k) + { + // concept requirements + __glibcxx_function_requires(_DefaultConstructibleConcept) + + iterator __i = lower_bound(__k); + // __i->first is greater than or equivalent to __k. + if (__i == end() || key_comp()(__k, (*__i).first)) + __i = insert(__i, value_type(__k, mapped_type())); + return (*__i).second; + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 464. Suggestion for new member functions in standard containers. + /** + * @brief Access to %map data. + * @param k The key for which data should be retrieved. + * @return A reference to the data whose key is equivalent to @a k, if + * such a data is present in the %map. + * @throw std::out_of_range If no such data is present. + */ + mapped_type& + at(const key_type& __k) + { + iterator __i = lower_bound(__k); + if (__i == end() || key_comp()(__k, (*__i).first)) + __throw_out_of_range(__N("map::at")); + return (*__i).second; + } + + const mapped_type& + at(const key_type& __k) const + { + const_iterator __i = lower_bound(__k); + if (__i == end() || key_comp()(__k, (*__i).first)) + __throw_out_of_range(__N("map::at")); + return (*__i).second; + } + + // modifiers + /** + * @brief Attempts to insert a std::pair into the %map. + + * @param x Pair to be inserted (see std::make_pair for easy creation + * of pairs). + + * @return A pair, of which the first element is an iterator that + * points to the possibly inserted pair, and the second is + * a bool that is true if the pair was actually inserted. + * + * This function attempts to insert a (key, value) %pair into the %map. + * A %map relies on unique keys and thus a %pair is only inserted if its + * first element (the key) is not already present in the %map. + * + * Insertion requires logarithmic time. + */ + std::pair + insert(const value_type& __x) + { return _M_t._M_insert_unique(__x); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Attempts to insert a list of std::pairs into the %map. + * @param list A std::initializer_list of pairs to be + * inserted. + * + * Complexity similar to that of the range constructor. + */ + void + insert(std::initializer_list __list) + { insert (__list.begin(), __list.end()); } +#endif + + /** + * @brief Attempts to insert a std::pair into the %map. + * @param position An iterator that serves as a hint as to where the + * pair should be inserted. + * @param x Pair to be inserted (see std::make_pair for easy creation + * of pairs). + * @return An iterator that points to the element with key of @a x (may + * or may not be the %pair passed in). + * + + * This function is not concerned about whether the insertion + * took place, and thus does not return a boolean like the + * single-argument insert() does. Note that the first + * parameter is only a hint and can potentially improve the + * performance of the insertion process. A bad hint would + * cause no gains in efficiency. + * + * See + * http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt07ch17.html + * for more on "hinting". + * + * Insertion requires logarithmic time (if the hint is not taken). + */ + iterator + insert(iterator __position, const value_type& __x) + { return _M_t._M_insert_unique_(__position, __x); } + + /** + * @brief Template function that attempts to insert a range of elements. + * @param first Iterator pointing to the start of the range to be + * inserted. + * @param last Iterator pointing to the end of the range. + * + * Complexity similar to that of the range constructor. + */ + template + void + insert(_InputIterator __first, _InputIterator __last) + { _M_t._M_insert_unique(__first, __last); } + + /** + * @brief Erases an element from a %map. + * @param position An iterator pointing to the element to be erased. + * + * This function erases an element, pointed to by the given + * iterator, from a %map. Note that this function only erases + * the element, and that if the element is itself a pointer, + * the pointed-to memory is not touched in any way. Managing + * the pointer is the user's responsibility. + */ + void + erase(iterator __position) + { _M_t.erase(__position); } + + /** + * @brief Erases elements according to the provided key. + * @param x Key of element to be erased. + * @return The number of elements erased. + * + * This function erases all the elements located by the given key from + * a %map. + * Note that this function only erases the element, and that if + * the element is itself a pointer, the pointed-to memory is not touched + * in any way. Managing the pointer is the user's responsibility. + */ + size_type + erase(const key_type& __x) + { return _M_t.erase(__x); } + + /** + * @brief Erases a [first,last) range of elements from a %map. + * @param first Iterator pointing to the start of the range to be + * erased. + * @param last Iterator pointing to the end of the range to be erased. + * + * This function erases a sequence of elements from a %map. + * Note that this function only erases the element, and that if + * the element is itself a pointer, the pointed-to memory is not touched + * in any way. Managing the pointer is the user's responsibility. + */ + void + erase(iterator __first, iterator __last) + { _M_t.erase(__first, __last); } + + /** + * @brief Swaps data with another %map. + * @param x A %map of the same element and allocator types. + * + * This exchanges the elements between two maps in constant + * time. (It is only swapping a pointer, an integer, and an + * instance of the @c Compare type (which itself is often + * stateless and empty), so it should be quite fast.) Note + * that the global std::swap() function is specialized such + * that std::swap(m1,m2) will feed to this function. + */ + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + swap(map&& __x) +#else + swap(map& __x) +#endif + { _M_t.swap(__x._M_t); } + + /** + * Erases all elements in a %map. Note that this function only + * erases the elements, and that if the elements themselves are + * pointers, the pointed-to memory is not touched in any way. + * Managing the pointer is the user's responsibility. + */ + void + clear() + { _M_t.clear(); } + + // observers + /** + * Returns the key comparison object out of which the %map was + * constructed. + */ + key_compare + key_comp() const + { return _M_t.key_comp(); } + + /** + * Returns a value comparison object, built from the key comparison + * object out of which the %map was constructed. + */ + value_compare + value_comp() const + { return value_compare(_M_t.key_comp()); } + + // [23.3.1.3] map operations + /** + * @brief Tries to locate an element in a %map. + * @param x Key of (key, value) %pair to be located. + * @return Iterator pointing to sought-after element, or end() if not + * found. + * + * This function takes a key and tries to locate the element with which + * the key matches. If successful the function returns an iterator + * pointing to the sought after %pair. If unsuccessful it returns the + * past-the-end ( @c end() ) iterator. + */ + iterator + find(const key_type& __x) + { return _M_t.find(__x); } + + /** + * @brief Tries to locate an element in a %map. + * @param x Key of (key, value) %pair to be located. + * @return Read-only (constant) iterator pointing to sought-after + * element, or end() if not found. + * + * This function takes a key and tries to locate the element with which + * the key matches. If successful the function returns a constant + * iterator pointing to the sought after %pair. If unsuccessful it + * returns the past-the-end ( @c end() ) iterator. + */ + const_iterator + find(const key_type& __x) const + { return _M_t.find(__x); } + + /** + * @brief Finds the number of elements with given key. + * @param x Key of (key, value) pairs to be located. + * @return Number of elements with specified key. + * + * This function only makes sense for multimaps; for map the result will + * either be 0 (not present) or 1 (present). + */ + size_type + count(const key_type& __x) const + { return _M_t.find(__x) == _M_t.end() ? 0 : 1; } + + /** + * @brief Finds the beginning of a subsequence matching given key. + * @param x Key of (key, value) pair to be located. + * @return Iterator pointing to first element equal to or greater + * than key, or end(). + * + * This function returns the first element of a subsequence of elements + * that matches the given key. If unsuccessful it returns an iterator + * pointing to the first element that has a greater value than given key + * or end() if no such element exists. + */ + iterator + lower_bound(const key_type& __x) + { return _M_t.lower_bound(__x); } + + /** + * @brief Finds the beginning of a subsequence matching given key. + * @param x Key of (key, value) pair to be located. + * @return Read-only (constant) iterator pointing to first element + * equal to or greater than key, or end(). + * + * This function returns the first element of a subsequence of elements + * that matches the given key. If unsuccessful it returns an iterator + * pointing to the first element that has a greater value than given key + * or end() if no such element exists. + */ + const_iterator + lower_bound(const key_type& __x) const + { return _M_t.lower_bound(__x); } + + /** + * @brief Finds the end of a subsequence matching given key. + * @param x Key of (key, value) pair to be located. + * @return Iterator pointing to the first element + * greater than key, or end(). + */ + iterator + upper_bound(const key_type& __x) + { return _M_t.upper_bound(__x); } + + /** + * @brief Finds the end of a subsequence matching given key. + * @param x Key of (key, value) pair to be located. + * @return Read-only (constant) iterator pointing to first iterator + * greater than key, or end(). + */ + const_iterator + upper_bound(const key_type& __x) const + { return _M_t.upper_bound(__x); } + + /** + * @brief Finds a subsequence matching given key. + * @param x Key of (key, value) pairs to be located. + * @return Pair of iterators that possibly points to the subsequence + * matching given key. + * + * This function is equivalent to + * @code + * std::make_pair(c.lower_bound(val), + * c.upper_bound(val)) + * @endcode + * (but is faster than making the calls separately). + * + * This function probably only makes sense for multimaps. + */ + std::pair + equal_range(const key_type& __x) + { return _M_t.equal_range(__x); } + + /** + * @brief Finds a subsequence matching given key. + * @param x Key of (key, value) pairs to be located. + * @return Pair of read-only (constant) iterators that possibly points + * to the subsequence matching given key. + * + * This function is equivalent to + * @code + * std::make_pair(c.lower_bound(val), + * c.upper_bound(val)) + * @endcode + * (but is faster than making the calls separately). + * + * This function probably only makes sense for multimaps. + */ + std::pair + equal_range(const key_type& __x) const + { return _M_t.equal_range(__x); } + + template + friend bool + operator==(const map<_K1, _T1, _C1, _A1>&, + const map<_K1, _T1, _C1, _A1>&); + + template + friend bool + operator<(const map<_K1, _T1, _C1, _A1>&, + const map<_K1, _T1, _C1, _A1>&); + }; + + /** + * @brief Map equality comparison. + * @param x A %map. + * @param y A %map of the same type as @a x. + * @return True iff the size and elements of the maps are equal. + * + * This is an equivalence relation. It is linear in the size of the + * maps. Maps are considered equivalent if their sizes are equal, + * and if corresponding elements compare equal. + */ + template + inline bool + operator==(const map<_Key, _Tp, _Compare, _Alloc>& __x, + const map<_Key, _Tp, _Compare, _Alloc>& __y) + { return __x._M_t == __y._M_t; } + + /** + * @brief Map ordering relation. + * @param x A %map. + * @param y A %map of the same type as @a x. + * @return True iff @a x is lexicographically less than @a y. + * + * This is a total ordering relation. It is linear in the size of the + * maps. The elements must be comparable with @c <. + * + * See std::lexicographical_compare() for how the determination is made. + */ + template + inline bool + operator<(const map<_Key, _Tp, _Compare, _Alloc>& __x, + const map<_Key, _Tp, _Compare, _Alloc>& __y) + { return __x._M_t < __y._M_t; } + + /// Based on operator== + template + inline bool + operator!=(const map<_Key, _Tp, _Compare, _Alloc>& __x, + const map<_Key, _Tp, _Compare, _Alloc>& __y) + { return !(__x == __y); } + + /// Based on operator< + template + inline bool + operator>(const map<_Key, _Tp, _Compare, _Alloc>& __x, + const map<_Key, _Tp, _Compare, _Alloc>& __y) + { return __y < __x; } + + /// Based on operator< + template + inline bool + operator<=(const map<_Key, _Tp, _Compare, _Alloc>& __x, + const map<_Key, _Tp, _Compare, _Alloc>& __y) + { return !(__y < __x); } + + /// Based on operator< + template + inline bool + operator>=(const map<_Key, _Tp, _Compare, _Alloc>& __x, + const map<_Key, _Tp, _Compare, _Alloc>& __y) + { return !(__x < __y); } + + /// See std::map::swap(). + template + inline void + swap(map<_Key, _Tp, _Compare, _Alloc>& __x, + map<_Key, _Tp, _Compare, _Alloc>& __y) + { __x.swap(__y); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + inline void + swap(map<_Key, _Tp, _Compare, _Alloc>&& __x, + map<_Key, _Tp, _Compare, _Alloc>& __y) + { __x.swap(__y); } + + template + inline void + swap(map<_Key, _Tp, _Compare, _Alloc>& __x, + map<_Key, _Tp, _Compare, _Alloc>&& __y) + { __x.swap(__y); } +#endif + +_GLIBCXX_END_NESTED_NAMESPACE + +#endif /* _STL_MAP_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_multimap.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_multimap.h new file mode 100644 index 00000000..484537cf --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_multimap.h @@ -0,0 +1,800 @@ +// Multimap implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_multimap.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_MULTIMAP_H +#define _STL_MULTIMAP_H 1 + +#include +#include + +_GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D) + + /** + * @brief A standard container made up of (key,value) pairs, which can be + * retrieved based on a key, in logarithmic time. + * + * @ingroup associative_containers + * + * Meets the requirements of a container, a + * reversible container, and an + * associative container (using equivalent + * keys). For a @c multimap the key_type is Key, the mapped_type + * is T, and the value_type is std::pair. + * + * Multimaps support bidirectional iterators. + * + * The private tree data is declared exactly the same way for map and + * multimap; the distinction is made entirely in how the tree functions are + * called (*_unique versus *_equal, same as the standard). + */ + template , + typename _Alloc = std::allocator > > + class multimap + { + public: + typedef _Key key_type; + typedef _Tp mapped_type; + typedef std::pair value_type; + typedef _Compare key_compare; + typedef _Alloc allocator_type; + + private: + // concept requirements + typedef typename _Alloc::value_type _Alloc_value_type; + __glibcxx_class_requires(_Tp, _SGIAssignableConcept) + __glibcxx_class_requires4(_Compare, bool, _Key, _Key, + _BinaryFunctionConcept) + __glibcxx_class_requires2(value_type, _Alloc_value_type, _SameTypeConcept) + + public: + class value_compare + : public std::binary_function + { + friend class multimap<_Key, _Tp, _Compare, _Alloc>; + protected: + _Compare comp; + + value_compare(_Compare __c) + : comp(__c) { } + + public: + bool operator()(const value_type& __x, const value_type& __y) const + { return comp(__x.first, __y.first); } + }; + + private: + /// This turns a red-black tree into a [multi]map. + typedef typename _Alloc::template rebind::other + _Pair_alloc_type; + + typedef _Rb_tree, + key_compare, _Pair_alloc_type> _Rep_type; + /// The actual tree structure. + _Rep_type _M_t; + + public: + // many of these are specified differently in ISO, but the following are + // "functionally equivalent" + typedef typename _Pair_alloc_type::pointer pointer; + typedef typename _Pair_alloc_type::const_pointer const_pointer; + typedef typename _Pair_alloc_type::reference reference; + typedef typename _Pair_alloc_type::const_reference const_reference; + typedef typename _Rep_type::iterator iterator; + typedef typename _Rep_type::const_iterator const_iterator; + typedef typename _Rep_type::size_type size_type; + typedef typename _Rep_type::difference_type difference_type; + typedef typename _Rep_type::reverse_iterator reverse_iterator; + typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator; + + // [23.3.2] construct/copy/destroy + // (get_allocator() is also listed in this section) + /** + * @brief Default constructor creates no elements. + */ + multimap() + : _M_t() { } + + /** + * @brief Creates a %multimap with no elements. + * @param comp A comparison object. + * @param a An allocator object. + */ + explicit + multimap(const _Compare& __comp, + const allocator_type& __a = allocator_type()) + : _M_t(__comp, __a) { } + + /** + * @brief %Multimap copy constructor. + * @param x A %multimap of identical element and allocator types. + * + * The newly-created %multimap uses a copy of the allocation object + * used by @a x. + */ + multimap(const multimap& __x) + : _M_t(__x._M_t) { } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief %Multimap move constructor. + * @param x A %multimap of identical element and allocator types. + * + * The newly-created %multimap contains the exact contents of @a x. + * The contents of @a x are a valid, but unspecified %multimap. + */ + multimap(multimap&& __x) + : _M_t(std::forward<_Rep_type>(__x._M_t)) { } + + /** + * @brief Builds a %multimap from an initializer_list. + * @param l An initializer_list. + * @param comp A comparison functor. + * @param a An allocator object. + * + * Create a %multimap consisting of copies of the elements from + * the initializer_list. This is linear in N if the list is already + * sorted, and NlogN otherwise (where N is @a __l.size()). + */ + multimap(initializer_list __l, + const _Compare& __comp = _Compare(), + const allocator_type& __a = allocator_type()) + : _M_t(__comp, __a) + { _M_t._M_insert_equal(__l.begin(), __l.end()); } +#endif + + /** + * @brief Builds a %multimap from a range. + * @param first An input iterator. + * @param last An input iterator. + * + * Create a %multimap consisting of copies of the elements from + * [first,last). This is linear in N if the range is already sorted, + * and NlogN otherwise (where N is distance(first,last)). + */ + template + multimap(_InputIterator __first, _InputIterator __last) + : _M_t() + { _M_t._M_insert_equal(__first, __last); } + + /** + * @brief Builds a %multimap from a range. + * @param first An input iterator. + * @param last An input iterator. + * @param comp A comparison functor. + * @param a An allocator object. + * + * Create a %multimap consisting of copies of the elements from + * [first,last). This is linear in N if the range is already sorted, + * and NlogN otherwise (where N is distance(first,last)). + */ + template + multimap(_InputIterator __first, _InputIterator __last, + const _Compare& __comp, + const allocator_type& __a = allocator_type()) + : _M_t(__comp, __a) + { _M_t._M_insert_equal(__first, __last); } + + // FIXME There is no dtor declared, but we should have something generated + // by Doxygen. I don't know what tags to add to this paragraph to make + // that happen: + /** + * The dtor only erases the elements, and note that if the elements + * themselves are pointers, the pointed-to memory is not touched in any + * way. Managing the pointer is the user's responsibility. + */ + + /** + * @brief %Multimap assignment operator. + * @param x A %multimap of identical element and allocator types. + * + * All the elements of @a x are copied, but unlike the copy constructor, + * the allocator object is not copied. + */ + multimap& + operator=(const multimap& __x) + { + _M_t = __x._M_t; + return *this; + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief %Multimap move assignment operator. + * @param x A %multimap of identical element and allocator types. + * + * The contents of @a x are moved into this multimap (without copying). + * @a x is a valid, but unspecified multimap. + */ + multimap& + operator=(multimap&& __x) + { + // NB: DR 675. + this->clear(); + this->swap(__x); + return *this; + } + + /** + * @brief %Multimap list assignment operator. + * @param l An initializer_list. + * + * This function fills a %multimap with copies of the elements + * in the initializer list @a l. + * + * Note that the assignment completely changes the %multimap and + * that the resulting %multimap's size is the same as the number + * of elements assigned. Old data may be lost. + */ + multimap& + operator=(initializer_list __l) + { + this->clear(); + this->insert(__l.begin(), __l.end()); + return *this; + } +#endif + + /// Get a copy of the memory allocation object. + allocator_type + get_allocator() const + { return _M_t.get_allocator(); } + + // iterators + /** + * Returns a read/write iterator that points to the first pair in the + * %multimap. Iteration is done in ascending order according to the + * keys. + */ + iterator + begin() + { return _M_t.begin(); } + + /** + * Returns a read-only (constant) iterator that points to the first pair + * in the %multimap. Iteration is done in ascending order according to + * the keys. + */ + const_iterator + begin() const + { return _M_t.begin(); } + + /** + * Returns a read/write iterator that points one past the last pair in + * the %multimap. Iteration is done in ascending order according to the + * keys. + */ + iterator + end() + { return _M_t.end(); } + + /** + * Returns a read-only (constant) iterator that points one past the last + * pair in the %multimap. Iteration is done in ascending order according + * to the keys. + */ + const_iterator + end() const + { return _M_t.end(); } + + /** + * Returns a read/write reverse iterator that points to the last pair in + * the %multimap. Iteration is done in descending order according to the + * keys. + */ + reverse_iterator + rbegin() + { return _M_t.rbegin(); } + + /** + * Returns a read-only (constant) reverse iterator that points to the + * last pair in the %multimap. Iteration is done in descending order + * according to the keys. + */ + const_reverse_iterator + rbegin() const + { return _M_t.rbegin(); } + + /** + * Returns a read/write reverse iterator that points to one before the + * first pair in the %multimap. Iteration is done in descending order + * according to the keys. + */ + reverse_iterator + rend() + { return _M_t.rend(); } + + /** + * Returns a read-only (constant) reverse iterator that points to one + * before the first pair in the %multimap. Iteration is done in + * descending order according to the keys. + */ + const_reverse_iterator + rend() const + { return _M_t.rend(); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * Returns a read-only (constant) iterator that points to the first pair + * in the %multimap. Iteration is done in ascending order according to + * the keys. + */ + const_iterator + cbegin() const + { return _M_t.begin(); } + + /** + * Returns a read-only (constant) iterator that points one past the last + * pair in the %multimap. Iteration is done in ascending order according + * to the keys. + */ + const_iterator + cend() const + { return _M_t.end(); } + + /** + * Returns a read-only (constant) reverse iterator that points to the + * last pair in the %multimap. Iteration is done in descending order + * according to the keys. + */ + const_reverse_iterator + crbegin() const + { return _M_t.rbegin(); } + + /** + * Returns a read-only (constant) reverse iterator that points to one + * before the first pair in the %multimap. Iteration is done in + * descending order according to the keys. + */ + const_reverse_iterator + crend() const + { return _M_t.rend(); } +#endif + + // capacity + /** Returns true if the %multimap is empty. */ + bool + empty() const + { return _M_t.empty(); } + + /** Returns the size of the %multimap. */ + size_type + size() const + { return _M_t.size(); } + + /** Returns the maximum size of the %multimap. */ + size_type + max_size() const + { return _M_t.max_size(); } + + // modifiers + /** + * @brief Inserts a std::pair into the %multimap. + * @param x Pair to be inserted (see std::make_pair for easy creation + * of pairs). + * @return An iterator that points to the inserted (key,value) pair. + * + * This function inserts a (key, value) pair into the %multimap. + * Contrary to a std::map the %multimap does not rely on unique keys and + * thus multiple pairs with the same key can be inserted. + * + * Insertion requires logarithmic time. + */ + iterator + insert(const value_type& __x) + { return _M_t._M_insert_equal(__x); } + + /** + * @brief Inserts a std::pair into the %multimap. + * @param position An iterator that serves as a hint as to where the + * pair should be inserted. + * @param x Pair to be inserted (see std::make_pair for easy creation + * of pairs). + * @return An iterator that points to the inserted (key,value) pair. + * + * This function inserts a (key, value) pair into the %multimap. + * Contrary to a std::map the %multimap does not rely on unique keys and + * thus multiple pairs with the same key can be inserted. + * Note that the first parameter is only a hint and can potentially + * improve the performance of the insertion process. A bad hint would + * cause no gains in efficiency. + * + * For more on "hinting," see: + * http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt07ch17.html + * + * Insertion requires logarithmic time (if the hint is not taken). + */ + iterator + insert(iterator __position, const value_type& __x) + { return _M_t._M_insert_equal_(__position, __x); } + + /** + * @brief A template function that attempts to insert a range + * of elements. + * @param first Iterator pointing to the start of the range to be + * inserted. + * @param last Iterator pointing to the end of the range. + * + * Complexity similar to that of the range constructor. + */ + template + void + insert(_InputIterator __first, _InputIterator __last) + { _M_t._M_insert_equal(__first, __last); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Attempts to insert a list of std::pairs into the %multimap. + * @param list A std::initializer_list of pairs to be + * inserted. + * + * Complexity similar to that of the range constructor. + */ + void + insert(initializer_list __l) + { this->insert(__l.begin(), __l.end()); } +#endif + + /** + * @brief Erases an element from a %multimap. + * @param position An iterator pointing to the element to be erased. + * + * This function erases an element, pointed to by the given iterator, + * from a %multimap. Note that this function only erases the element, + * and that if the element is itself a pointer, the pointed-to memory is + * not touched in any way. Managing the pointer is the user's + * responsibility. + */ + void + erase(iterator __position) + { _M_t.erase(__position); } + + /** + * @brief Erases elements according to the provided key. + * @param x Key of element to be erased. + * @return The number of elements erased. + * + * This function erases all elements located by the given key from a + * %multimap. + * Note that this function only erases the element, and that if + * the element is itself a pointer, the pointed-to memory is not touched + * in any way. Managing the pointer is the user's responsibility. + */ + size_type + erase(const key_type& __x) + { return _M_t.erase(__x); } + + /** + * @brief Erases a [first,last) range of elements from a %multimap. + * @param first Iterator pointing to the start of the range to be + * erased. + * @param last Iterator pointing to the end of the range to be erased. + * + * This function erases a sequence of elements from a %multimap. + * Note that this function only erases the elements, and that if + * the elements themselves are pointers, the pointed-to memory is not + * touched in any way. Managing the pointer is the user's responsibility. + */ + void + erase(iterator __first, iterator __last) + { _M_t.erase(__first, __last); } + + /** + * @brief Swaps data with another %multimap. + * @param x A %multimap of the same element and allocator types. + * + * This exchanges the elements between two multimaps in constant time. + * (It is only swapping a pointer, an integer, and an instance of + * the @c Compare type (which itself is often stateless and empty), so it + * should be quite fast.) + * Note that the global std::swap() function is specialized such that + * std::swap(m1,m2) will feed to this function. + */ + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + swap(multimap&& __x) +#else + swap(multimap& __x) +#endif + { _M_t.swap(__x._M_t); } + + /** + * Erases all elements in a %multimap. Note that this function only + * erases the elements, and that if the elements themselves are pointers, + * the pointed-to memory is not touched in any way. Managing the pointer + * is the user's responsibility. + */ + void + clear() + { _M_t.clear(); } + + // observers + /** + * Returns the key comparison object out of which the %multimap + * was constructed. + */ + key_compare + key_comp() const + { return _M_t.key_comp(); } + + /** + * Returns a value comparison object, built from the key comparison + * object out of which the %multimap was constructed. + */ + value_compare + value_comp() const + { return value_compare(_M_t.key_comp()); } + + // multimap operations + /** + * @brief Tries to locate an element in a %multimap. + * @param x Key of (key, value) pair to be located. + * @return Iterator pointing to sought-after element, + * or end() if not found. + * + * This function takes a key and tries to locate the element with which + * the key matches. If successful the function returns an iterator + * pointing to the sought after %pair. If unsuccessful it returns the + * past-the-end ( @c end() ) iterator. + */ + iterator + find(const key_type& __x) + { return _M_t.find(__x); } + + /** + * @brief Tries to locate an element in a %multimap. + * @param x Key of (key, value) pair to be located. + * @return Read-only (constant) iterator pointing to sought-after + * element, or end() if not found. + * + * This function takes a key and tries to locate the element with which + * the key matches. If successful the function returns a constant + * iterator pointing to the sought after %pair. If unsuccessful it + * returns the past-the-end ( @c end() ) iterator. + */ + const_iterator + find(const key_type& __x) const + { return _M_t.find(__x); } + + /** + * @brief Finds the number of elements with given key. + * @param x Key of (key, value) pairs to be located. + * @return Number of elements with specified key. + */ + size_type + count(const key_type& __x) const + { return _M_t.count(__x); } + + /** + * @brief Finds the beginning of a subsequence matching given key. + * @param x Key of (key, value) pair to be located. + * @return Iterator pointing to first element equal to or greater + * than key, or end(). + * + * This function returns the first element of a subsequence of elements + * that matches the given key. If unsuccessful it returns an iterator + * pointing to the first element that has a greater value than given key + * or end() if no such element exists. + */ + iterator + lower_bound(const key_type& __x) + { return _M_t.lower_bound(__x); } + + /** + * @brief Finds the beginning of a subsequence matching given key. + * @param x Key of (key, value) pair to be located. + * @return Read-only (constant) iterator pointing to first element + * equal to or greater than key, or end(). + * + * This function returns the first element of a subsequence of elements + * that matches the given key. If unsuccessful the iterator will point + * to the next greatest element or, if no such greater element exists, to + * end(). + */ + const_iterator + lower_bound(const key_type& __x) const + { return _M_t.lower_bound(__x); } + + /** + * @brief Finds the end of a subsequence matching given key. + * @param x Key of (key, value) pair to be located. + * @return Iterator pointing to the first element + * greater than key, or end(). + */ + iterator + upper_bound(const key_type& __x) + { return _M_t.upper_bound(__x); } + + /** + * @brief Finds the end of a subsequence matching given key. + * @param x Key of (key, value) pair to be located. + * @return Read-only (constant) iterator pointing to first iterator + * greater than key, or end(). + */ + const_iterator + upper_bound(const key_type& __x) const + { return _M_t.upper_bound(__x); } + + /** + * @brief Finds a subsequence matching given key. + * @param x Key of (key, value) pairs to be located. + * @return Pair of iterators that possibly points to the subsequence + * matching given key. + * + * This function is equivalent to + * @code + * std::make_pair(c.lower_bound(val), + * c.upper_bound(val)) + * @endcode + * (but is faster than making the calls separately). + */ + std::pair + equal_range(const key_type& __x) + { return _M_t.equal_range(__x); } + + /** + * @brief Finds a subsequence matching given key. + * @param x Key of (key, value) pairs to be located. + * @return Pair of read-only (constant) iterators that possibly points + * to the subsequence matching given key. + * + * This function is equivalent to + * @code + * std::make_pair(c.lower_bound(val), + * c.upper_bound(val)) + * @endcode + * (but is faster than making the calls separately). + */ + std::pair + equal_range(const key_type& __x) const + { return _M_t.equal_range(__x); } + + template + friend bool + operator==(const multimap<_K1, _T1, _C1, _A1>&, + const multimap<_K1, _T1, _C1, _A1>&); + + template + friend bool + operator<(const multimap<_K1, _T1, _C1, _A1>&, + const multimap<_K1, _T1, _C1, _A1>&); + }; + + /** + * @brief Multimap equality comparison. + * @param x A %multimap. + * @param y A %multimap of the same type as @a x. + * @return True iff the size and elements of the maps are equal. + * + * This is an equivalence relation. It is linear in the size of the + * multimaps. Multimaps are considered equivalent if their sizes are equal, + * and if corresponding elements compare equal. + */ + template + inline bool + operator==(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, + const multimap<_Key, _Tp, _Compare, _Alloc>& __y) + { return __x._M_t == __y._M_t; } + + /** + * @brief Multimap ordering relation. + * @param x A %multimap. + * @param y A %multimap of the same type as @a x. + * @return True iff @a x is lexicographically less than @a y. + * + * This is a total ordering relation. It is linear in the size of the + * multimaps. The elements must be comparable with @c <. + * + * See std::lexicographical_compare() for how the determination is made. + */ + template + inline bool + operator<(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, + const multimap<_Key, _Tp, _Compare, _Alloc>& __y) + { return __x._M_t < __y._M_t; } + + /// Based on operator== + template + inline bool + operator!=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, + const multimap<_Key, _Tp, _Compare, _Alloc>& __y) + { return !(__x == __y); } + + /// Based on operator< + template + inline bool + operator>(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, + const multimap<_Key, _Tp, _Compare, _Alloc>& __y) + { return __y < __x; } + + /// Based on operator< + template + inline bool + operator<=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, + const multimap<_Key, _Tp, _Compare, _Alloc>& __y) + { return !(__y < __x); } + + /// Based on operator< + template + inline bool + operator>=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, + const multimap<_Key, _Tp, _Compare, _Alloc>& __y) + { return !(__x < __y); } + + /// See std::multimap::swap(). + template + inline void + swap(multimap<_Key, _Tp, _Compare, _Alloc>& __x, + multimap<_Key, _Tp, _Compare, _Alloc>& __y) + { __x.swap(__y); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + inline void + swap(multimap<_Key, _Tp, _Compare, _Alloc>&& __x, + multimap<_Key, _Tp, _Compare, _Alloc>& __y) + { __x.swap(__y); } + + template + inline void + swap(multimap<_Key, _Tp, _Compare, _Alloc>& __x, + multimap<_Key, _Tp, _Compare, _Alloc>&& __y) + { __x.swap(__y); } +#endif + +_GLIBCXX_END_NESTED_NAMESPACE + +#endif /* _STL_MULTIMAP_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_multiset.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_multiset.h new file mode 100644 index 00000000..b5c710f3 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_multiset.h @@ -0,0 +1,697 @@ +// Multiset implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_multiset.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_MULTISET_H +#define _STL_MULTISET_H 1 + +#include +#include + +_GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D) + + /** + * @brief A standard container made up of elements, which can be retrieved + * in logarithmic time. + * + * @ingroup associative_containers + * + * Meets the requirements of a container, a + * reversible container, and an + * associative container (using equivalent + * keys). For a @c multiset the key_type and value_type are Key. + * + * Multisets support bidirectional iterators. + * + * The private tree data is declared exactly the same way for set and + * multiset; the distinction is made entirely in how the tree functions are + * called (*_unique versus *_equal, same as the standard). + */ + template , + typename _Alloc = std::allocator<_Key> > + class multiset + { + // concept requirements + typedef typename _Alloc::value_type _Alloc_value_type; + __glibcxx_class_requires(_Key, _SGIAssignableConcept) + __glibcxx_class_requires4(_Compare, bool, _Key, _Key, + _BinaryFunctionConcept) + __glibcxx_class_requires2(_Key, _Alloc_value_type, _SameTypeConcept) + + public: + // typedefs: + typedef _Key key_type; + typedef _Key value_type; + typedef _Compare key_compare; + typedef _Compare value_compare; + typedef _Alloc allocator_type; + + private: + /// This turns a red-black tree into a [multi]set. + typedef typename _Alloc::template rebind<_Key>::other _Key_alloc_type; + + typedef _Rb_tree, + key_compare, _Key_alloc_type> _Rep_type; + /// The actual tree structure. + _Rep_type _M_t; + + public: + typedef typename _Key_alloc_type::pointer pointer; + typedef typename _Key_alloc_type::const_pointer const_pointer; + typedef typename _Key_alloc_type::reference reference; + typedef typename _Key_alloc_type::const_reference const_reference; + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 103. set::iterator is required to be modifiable, + // but this allows modification of keys. + typedef typename _Rep_type::const_iterator iterator; + typedef typename _Rep_type::const_iterator const_iterator; + typedef typename _Rep_type::const_reverse_iterator reverse_iterator; + typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator; + typedef typename _Rep_type::size_type size_type; + typedef typename _Rep_type::difference_type difference_type; + + // allocation/deallocation + /** + * @brief Default constructor creates no elements. + */ + multiset() + : _M_t() { } + + /** + * @brief Creates a %multiset with no elements. + * @param comp Comparator to use. + * @param a An allocator object. + */ + explicit + multiset(const _Compare& __comp, + const allocator_type& __a = allocator_type()) + : _M_t(__comp, __a) { } + + /** + * @brief Builds a %multiset from a range. + * @param first An input iterator. + * @param last An input iterator. + * + * Create a %multiset consisting of copies of the elements from + * [first,last). This is linear in N if the range is already sorted, + * and NlogN otherwise (where N is distance(first,last)). + */ + template + multiset(_InputIterator __first, _InputIterator __last) + : _M_t() + { _M_t._M_insert_equal(__first, __last); } + + /** + * @brief Builds a %multiset from a range. + * @param first An input iterator. + * @param last An input iterator. + * @param comp A comparison functor. + * @param a An allocator object. + * + * Create a %multiset consisting of copies of the elements from + * [first,last). This is linear in N if the range is already sorted, + * and NlogN otherwise (where N is distance(first,last)). + */ + template + multiset(_InputIterator __first, _InputIterator __last, + const _Compare& __comp, + const allocator_type& __a = allocator_type()) + : _M_t(__comp, __a) + { _M_t._M_insert_equal(__first, __last); } + + /** + * @brief %Multiset copy constructor. + * @param x A %multiset of identical element and allocator types. + * + * The newly-created %multiset uses a copy of the allocation object used + * by @a x. + */ + multiset(const multiset& __x) + : _M_t(__x._M_t) { } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief %Multiset move constructor. + * @param x A %multiset of identical element and allocator types. + * + * The newly-created %multiset contains the exact contents of @a x. + * The contents of @a x are a valid, but unspecified %multiset. + */ + multiset(multiset&& __x) + : _M_t(std::forward<_Rep_type>(__x._M_t)) { } + + /** + * @brief Builds a %multiset from an initializer_list. + * @param l An initializer_list. + * @param comp A comparison functor. + * @param a An allocator object. + * + * Create a %multiset consisting of copies of the elements from + * the list. This is linear in N if the list is already sorted, + * and NlogN otherwise (where N is @a l.size()). + */ + multiset(initializer_list __l, + const _Compare& __comp = _Compare(), + const allocator_type& __a = allocator_type()) + : _M_t(__comp, __a) + { _M_t._M_insert_equal(__l.begin(), __l.end()); } +#endif + + /** + * @brief %Multiset assignment operator. + * @param x A %multiset of identical element and allocator types. + * + * All the elements of @a x are copied, but unlike the copy constructor, + * the allocator object is not copied. + */ + multiset& + operator=(const multiset& __x) + { + _M_t = __x._M_t; + return *this; + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief %Multiset move assignment operator. + * @param x A %multiset of identical element and allocator types. + * + * The contents of @a x are moved into this %multiset (without copying). + * @a x is a valid, but unspecified %multiset. + */ + multiset& + operator=(multiset&& __x) + { + // NB: DR 675. + this->clear(); + this->swap(__x); + return *this; + } + + /** + * @brief %Multiset list assignment operator. + * @param l An initializer_list. + * + * This function fills a %multiset with copies of the elements in the + * initializer list @a l. + * + * Note that the assignment completely changes the %multiset and + * that the resulting %multiset's size is the same as the number + * of elements assigned. Old data may be lost. + */ + multiset& + operator=(initializer_list __l) + { + this->clear(); + this->insert(__l.begin(), __l.end()); + return *this; + } +#endif + + // accessors: + + /// Returns the comparison object. + key_compare + key_comp() const + { return _M_t.key_comp(); } + /// Returns the comparison object. + value_compare + value_comp() const + { return _M_t.key_comp(); } + /// Returns the memory allocation object. + allocator_type + get_allocator() const + { return _M_t.get_allocator(); } + + /** + * Returns a read-only (constant) iterator that points to the first + * element in the %multiset. Iteration is done in ascending order + * according to the keys. + */ + iterator + begin() const + { return _M_t.begin(); } + + /** + * Returns a read-only (constant) iterator that points one past the last + * element in the %multiset. Iteration is done in ascending order + * according to the keys. + */ + iterator + end() const + { return _M_t.end(); } + + /** + * Returns a read-only (constant) reverse iterator that points to the + * last element in the %multiset. Iteration is done in descending order + * according to the keys. + */ + reverse_iterator + rbegin() const + { return _M_t.rbegin(); } + + /** + * Returns a read-only (constant) reverse iterator that points to the + * last element in the %multiset. Iteration is done in descending order + * according to the keys. + */ + reverse_iterator + rend() const + { return _M_t.rend(); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * Returns a read-only (constant) iterator that points to the first + * element in the %multiset. Iteration is done in ascending order + * according to the keys. + */ + iterator + cbegin() const + { return _M_t.begin(); } + + /** + * Returns a read-only (constant) iterator that points one past the last + * element in the %multiset. Iteration is done in ascending order + * according to the keys. + */ + iterator + cend() const + { return _M_t.end(); } + + /** + * Returns a read-only (constant) reverse iterator that points to the + * last element in the %multiset. Iteration is done in descending order + * according to the keys. + */ + reverse_iterator + crbegin() const + { return _M_t.rbegin(); } + + /** + * Returns a read-only (constant) reverse iterator that points to the + * last element in the %multiset. Iteration is done in descending order + * according to the keys. + */ + reverse_iterator + crend() const + { return _M_t.rend(); } +#endif + + /// Returns true if the %set is empty. + bool + empty() const + { return _M_t.empty(); } + + /// Returns the size of the %set. + size_type + size() const + { return _M_t.size(); } + + /// Returns the maximum size of the %set. + size_type + max_size() const + { return _M_t.max_size(); } + + /** + * @brief Swaps data with another %multiset. + * @param x A %multiset of the same element and allocator types. + * + * This exchanges the elements between two multisets in constant time. + * (It is only swapping a pointer, an integer, and an instance of the @c + * Compare type (which itself is often stateless and empty), so it should + * be quite fast.) + * Note that the global std::swap() function is specialized such that + * std::swap(s1,s2) will feed to this function. + */ + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + swap(multiset&& __x) +#else + swap(multiset& __x) +#endif + { _M_t.swap(__x._M_t); } + + // insert/erase + /** + * @brief Inserts an element into the %multiset. + * @param x Element to be inserted. + * @return An iterator that points to the inserted element. + * + * This function inserts an element into the %multiset. Contrary + * to a std::set the %multiset does not rely on unique keys and thus + * multiple copies of the same element can be inserted. + * + * Insertion requires logarithmic time. + */ + iterator + insert(const value_type& __x) + { return _M_t._M_insert_equal(__x); } + + /** + * @brief Inserts an element into the %multiset. + * @param position An iterator that serves as a hint as to where the + * element should be inserted. + * @param x Element to be inserted. + * @return An iterator that points to the inserted element. + * + * This function inserts an element into the %multiset. Contrary + * to a std::set the %multiset does not rely on unique keys and thus + * multiple copies of the same element can be inserted. + * + * Note that the first parameter is only a hint and can potentially + * improve the performance of the insertion process. A bad hint would + * cause no gains in efficiency. + * + * See http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt07ch17.html + * for more on "hinting". + * + * Insertion requires logarithmic time (if the hint is not taken). + */ + iterator + insert(iterator __position, const value_type& __x) + { return _M_t._M_insert_equal_(__position, __x); } + + /** + * @brief A template function that attempts to insert a range of elements. + * @param first Iterator pointing to the start of the range to be + * inserted. + * @param last Iterator pointing to the end of the range. + * + * Complexity similar to that of the range constructor. + */ + template + void + insert(_InputIterator __first, _InputIterator __last) + { _M_t._M_insert_equal(__first, __last); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Attempts to insert a list of elements into the %multiset. + * @param list A std::initializer_list of elements + * to be inserted. + * + * Complexity similar to that of the range constructor. + */ + void + insert(initializer_list __l) + { this->insert(__l.begin(), __l.end()); } +#endif + + /** + * @brief Erases an element from a %multiset. + * @param position An iterator pointing to the element to be erased. + * + * This function erases an element, pointed to by the given iterator, + * from a %multiset. Note that this function only erases the element, + * and that if the element is itself a pointer, the pointed-to memory is + * not touched in any way. Managing the pointer is the user's + * responsibility. + */ + void + erase(iterator __position) + { _M_t.erase(__position); } + + /** + * @brief Erases elements according to the provided key. + * @param x Key of element to be erased. + * @return The number of elements erased. + * + * This function erases all elements located by the given key from a + * %multiset. + * Note that this function only erases the element, and that if + * the element is itself a pointer, the pointed-to memory is not touched + * in any way. Managing the pointer is the user's responsibility. + */ + size_type + erase(const key_type& __x) + { return _M_t.erase(__x); } + + /** + * @brief Erases a [first,last) range of elements from a %multiset. + * @param first Iterator pointing to the start of the range to be + * erased. + * @param last Iterator pointing to the end of the range to be erased. + * + * This function erases a sequence of elements from a %multiset. + * Note that this function only erases the elements, and that if + * the elements themselves are pointers, the pointed-to memory is not + * touched in any way. Managing the pointer is the user's responsibility. + */ + void + erase(iterator __first, iterator __last) + { _M_t.erase(__first, __last); } + + /** + * Erases all elements in a %multiset. Note that this function only + * erases the elements, and that if the elements themselves are pointers, + * the pointed-to memory is not touched in any way. Managing the pointer + * is the user's responsibility. + */ + void + clear() + { _M_t.clear(); } + + // multiset operations: + + /** + * @brief Finds the number of elements with given key. + * @param x Key of elements to be located. + * @return Number of elements with specified key. + */ + size_type + count(const key_type& __x) const + { return _M_t.count(__x); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 214. set::find() missing const overload + //@{ + /** + * @brief Tries to locate an element in a %set. + * @param x Element to be located. + * @return Iterator pointing to sought-after element, or end() if not + * found. + * + * This function takes a key and tries to locate the element with which + * the key matches. If successful the function returns an iterator + * pointing to the sought after element. If unsuccessful it returns the + * past-the-end ( @c end() ) iterator. + */ + iterator + find(const key_type& __x) + { return _M_t.find(__x); } + + const_iterator + find(const key_type& __x) const + { return _M_t.find(__x); } + //@} + + //@{ + /** + * @brief Finds the beginning of a subsequence matching given key. + * @param x Key to be located. + * @return Iterator pointing to first element equal to or greater + * than key, or end(). + * + * This function returns the first element of a subsequence of elements + * that matches the given key. If unsuccessful it returns an iterator + * pointing to the first element that has a greater value than given key + * or end() if no such element exists. + */ + iterator + lower_bound(const key_type& __x) + { return _M_t.lower_bound(__x); } + + const_iterator + lower_bound(const key_type& __x) const + { return _M_t.lower_bound(__x); } + //@} + + //@{ + /** + * @brief Finds the end of a subsequence matching given key. + * @param x Key to be located. + * @return Iterator pointing to the first element + * greater than key, or end(). + */ + iterator + upper_bound(const key_type& __x) + { return _M_t.upper_bound(__x); } + + const_iterator + upper_bound(const key_type& __x) const + { return _M_t.upper_bound(__x); } + //@} + + //@{ + /** + * @brief Finds a subsequence matching given key. + * @param x Key to be located. + * @return Pair of iterators that possibly points to the subsequence + * matching given key. + * + * This function is equivalent to + * @code + * std::make_pair(c.lower_bound(val), + * c.upper_bound(val)) + * @endcode + * (but is faster than making the calls separately). + * + * This function probably only makes sense for multisets. + */ + std::pair + equal_range(const key_type& __x) + { return _M_t.equal_range(__x); } + + std::pair + equal_range(const key_type& __x) const + { return _M_t.equal_range(__x); } + + template + friend bool + operator==(const multiset<_K1, _C1, _A1>&, + const multiset<_K1, _C1, _A1>&); + + template + friend bool + operator< (const multiset<_K1, _C1, _A1>&, + const multiset<_K1, _C1, _A1>&); + }; + + /** + * @brief Multiset equality comparison. + * @param x A %multiset. + * @param y A %multiset of the same type as @a x. + * @return True iff the size and elements of the multisets are equal. + * + * This is an equivalence relation. It is linear in the size of the + * multisets. + * Multisets are considered equivalent if their sizes are equal, and if + * corresponding elements compare equal. + */ + template + inline bool + operator==(const multiset<_Key, _Compare, _Alloc>& __x, + const multiset<_Key, _Compare, _Alloc>& __y) + { return __x._M_t == __y._M_t; } + + /** + * @brief Multiset ordering relation. + * @param x A %multiset. + * @param y A %multiset of the same type as @a x. + * @return True iff @a x is lexicographically less than @a y. + * + * This is a total ordering relation. It is linear in the size of the + * maps. The elements must be comparable with @c <. + * + * See std::lexicographical_compare() for how the determination is made. + */ + template + inline bool + operator<(const multiset<_Key, _Compare, _Alloc>& __x, + const multiset<_Key, _Compare, _Alloc>& __y) + { return __x._M_t < __y._M_t; } + + /// Returns !(x == y). + template + inline bool + operator!=(const multiset<_Key, _Compare, _Alloc>& __x, + const multiset<_Key, _Compare, _Alloc>& __y) + { return !(__x == __y); } + + /// Returns y < x. + template + inline bool + operator>(const multiset<_Key,_Compare,_Alloc>& __x, + const multiset<_Key,_Compare,_Alloc>& __y) + { return __y < __x; } + + /// Returns !(y < x) + template + inline bool + operator<=(const multiset<_Key, _Compare, _Alloc>& __x, + const multiset<_Key, _Compare, _Alloc>& __y) + { return !(__y < __x); } + + /// Returns !(x < y) + template + inline bool + operator>=(const multiset<_Key, _Compare, _Alloc>& __x, + const multiset<_Key, _Compare, _Alloc>& __y) + { return !(__x < __y); } + + /// See std::multiset::swap(). + template + inline void + swap(multiset<_Key, _Compare, _Alloc>& __x, + multiset<_Key, _Compare, _Alloc>& __y) + { __x.swap(__y); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + inline void + swap(multiset<_Key, _Compare, _Alloc>&& __x, + multiset<_Key, _Compare, _Alloc>& __y) + { __x.swap(__y); } + + template + inline void + swap(multiset<_Key, _Compare, _Alloc>& __x, + multiset<_Key, _Compare, _Alloc>&& __y) + { __x.swap(__y); } +#endif + +_GLIBCXX_END_NESTED_NAMESPACE + +#endif /* _STL_MULTISET_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_numeric.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_numeric.h new file mode 100644 index 00000000..5edf2bc5 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_numeric.h @@ -0,0 +1,373 @@ +// Numeric functions implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_numeric.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_NUMERIC_H +#define _STL_NUMERIC_H 1 + +#include +#include + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /** + * @brief Create a range of sequentially increasing values. + * + * For each element in the range @p [first,last) assigns @p value and + * increments @p value as if by @p ++value. + * + * @param first Start of range. + * @param last End of range. + * @param value Starting value. + * @return Nothing. + */ + template + void + iota(_ForwardIterator __first, _ForwardIterator __last, _Tp __value) + { + // concept requirements + __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< + _ForwardIterator>) + __glibcxx_function_requires(_ConvertibleConcept<_Tp, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + for (; __first != __last; ++__first) + { + *__first = __value; + ++__value; + } + } + +_GLIBCXX_END_NAMESPACE + +#endif + +_GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_P) + + /** + * @brief Accumulate values in a range. + * + * Accumulates the values in the range [first,last) using operator+(). The + * initial value is @a init. The values are processed in order. + * + * @param first Start of range. + * @param last End of range. + * @param init Starting value to add other values to. + * @return The final sum. + */ + template + inline _Tp + accumulate(_InputIterator __first, _InputIterator __last, _Tp __init) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_requires_valid_range(__first, __last); + + for (; __first != __last; ++__first) + __init = __init + *__first; + return __init; + } + + /** + * @brief Accumulate values in a range with operation. + * + * Accumulates the values in the range [first,last) using the function + * object @a binary_op. The initial value is @a init. The values are + * processed in order. + * + * @param first Start of range. + * @param last End of range. + * @param init Starting value to add other values to. + * @param binary_op Function object to accumulate with. + * @return The final sum. + */ + template + inline _Tp + accumulate(_InputIterator __first, _InputIterator __last, _Tp __init, + _BinaryOperation __binary_op) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_requires_valid_range(__first, __last); + + for (; __first != __last; ++__first) + __init = __binary_op(__init, *__first); + return __init; + } + + /** + * @brief Compute inner product of two ranges. + * + * Starting with an initial value of @a init, multiplies successive + * elements from the two ranges and adds each product into the accumulated + * value using operator+(). The values in the ranges are processed in + * order. + * + * @param first1 Start of range 1. + * @param last1 End of range 1. + * @param first2 Start of range 2. + * @param init Starting value to add other values to. + * @return The final inner product. + */ + template + inline _Tp + inner_product(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _Tp __init) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_requires_valid_range(__first1, __last1); + + for (; __first1 != __last1; ++__first1, ++__first2) + __init = __init + (*__first1 * *__first2); + return __init; + } + + /** + * @brief Compute inner product of two ranges. + * + * Starting with an initial value of @a init, applies @a binary_op2 to + * successive elements from the two ranges and accumulates each result into + * the accumulated value using @a binary_op1. The values in the ranges are + * processed in order. + * + * @param first1 Start of range 1. + * @param last1 End of range 1. + * @param first2 Start of range 2. + * @param init Starting value to add other values to. + * @param binary_op1 Function object to accumulate with. + * @param binary_op2 Function object to apply to pairs of input values. + * @return The final inner product. + */ + template + inline _Tp + inner_product(_InputIterator1 __first1, _InputIterator1 __last1, + _InputIterator2 __first2, _Tp __init, + _BinaryOperation1 __binary_op1, + _BinaryOperation2 __binary_op2) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_requires_valid_range(__first1, __last1); + + for (; __first1 != __last1; ++__first1, ++__first2) + __init = __binary_op1(__init, __binary_op2(*__first1, *__first2)); + return __init; + } + + /** + * @brief Return list of partial sums + * + * Accumulates the values in the range [first,last) using operator+(). + * As each successive input value is added into the total, that partial sum + * is written to @a result. Therefore, the first value in result is the + * first value of the input, the second value in result is the sum of the + * first and second input values, and so on. + * + * @param first Start of input range. + * @param last End of input range. + * @param result Output to write sums to. + * @return Iterator pointing just beyond the values written to result. + */ + template + _OutputIterator + partial_sum(_InputIterator __first, _InputIterator __last, + _OutputIterator __result) + { + typedef typename iterator_traits<_InputIterator>::value_type _ValueType; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return __result; + _ValueType __value = *__first; + *__result = __value; + while (++__first != __last) + { + __value = __value + *__first; + *++__result = __value; + } + return ++__result; + } + + /** + * @brief Return list of partial sums + * + * Accumulates the values in the range [first,last) using operator+(). + * As each successive input value is added into the total, that partial sum + * is written to @a result. Therefore, the first value in result is the + * first value of the input, the second value in result is the sum of the + * first and second input values, and so on. + * + * @param first Start of input range. + * @param last End of input range. + * @param result Output to write sums to. + * @return Iterator pointing just beyond the values written to result. + */ + template + _OutputIterator + partial_sum(_InputIterator __first, _InputIterator __last, + _OutputIterator __result, _BinaryOperation __binary_op) + { + typedef typename iterator_traits<_InputIterator>::value_type _ValueType; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return __result; + _ValueType __value = *__first; + *__result = __value; + while (++__first != __last) + { + __value = __binary_op(__value, *__first); + *++__result = __value; + } + return ++__result; + } + + /** + * @brief Return differences between adjacent values. + * + * Computes the difference between adjacent values in the range + * [first,last) using operator-() and writes the result to @a result. + * + * @param first Start of input range. + * @param last End of input range. + * @param result Output to write sums to. + * @return Iterator pointing just beyond the values written to result. + */ + template + _OutputIterator + adjacent_difference(_InputIterator __first, + _InputIterator __last, _OutputIterator __result) + { + typedef typename iterator_traits<_InputIterator>::value_type _ValueType; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return __result; + _ValueType __value = *__first; + *__result = __value; + while (++__first != __last) + { + _ValueType __tmp = *__first; + *++__result = __tmp - __value; + __value = __tmp; + } + return ++__result; + } + + /** + * @brief Return differences between adjacent values. + * + * Computes the difference between adjacent values in the range + * [first,last) using the function object @a binary_op and writes the + * result to @a result. + * + * @param first Start of input range. + * @param last End of input range. + * @param result Output to write sums to. + * @return Iterator pointing just beyond the values written to result. + */ + template + _OutputIterator + adjacent_difference(_InputIterator __first, _InputIterator __last, + _OutputIterator __result, _BinaryOperation __binary_op) + { + typedef typename iterator_traits<_InputIterator>::value_type _ValueType; + + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + _ValueType>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return __result; + _ValueType __value = *__first; + *__result = __value; + while (++__first != __last) + { + _ValueType __tmp = *__first; + *++__result = __binary_op(__tmp, __value); + __value = __tmp; + } + return ++__result; + } + +_GLIBCXX_END_NESTED_NAMESPACE + +#endif /* _STL_NUMERIC_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_pair.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_pair.h new file mode 100644 index 00000000..fd395adb --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_pair.h @@ -0,0 +1,261 @@ +// Pair implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_pair.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_PAIR_H +#define _STL_PAIR_H 1 + +#include // for std::move / std::forward, std::decay, and + // std::swap + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /// pair holds two objects of arbitrary type. + template + struct pair + { + typedef _T1 first_type; ///< @c first_type is the first bound type + typedef _T2 second_type; ///< @c second_type is the second bound type + + _T1 first; ///< @c first is a copy of the first object + _T2 second; ///< @c second is a copy of the second object + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 265. std::pair::pair() effects overly restrictive + /** The default constructor creates @c first and @c second using their + * respective default constructors. */ + pair() + : first(), second() { } + + /** Two objects may be passed to a @c pair constructor to be copied. */ + pair(const _T1& __a, const _T2& __b) + : first(__a), second(__b) { } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + pair(_U1&& __x, _U2&& __y) + : first(std::forward<_U1>(__x)), + second(std::forward<_U2>(__y)) { } + + pair(pair&& __p) + : first(std::move(__p.first)), + second(std::move(__p.second)) { } +#endif + + /** There is also a templated copy ctor for the @c pair class itself. */ + template + pair(const pair<_U1, _U2>& __p) + : first(__p.first), + second(__p.second) { } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + pair(pair<_U1, _U2>&& __p) + : first(std::move(__p.first)), + second(std::move(__p.second)) { } + + // http://gcc.gnu.org/ml/libstdc++/2007-08/msg00052.html + template + pair(_U1&& __x, _Arg0&& __arg0, _Args&&... __args) + : first(std::forward<_U1>(__x)), + second(std::forward<_Arg0>(__arg0), + std::forward<_Args>(__args)...) { } + + pair& + operator=(pair&& __p) + { + first = std::move(__p.first); + second = std::move(__p.second); + return *this; + } + + template + pair& + operator=(pair<_U1, _U2>&& __p) + { + first = std::move(__p.first); + second = std::move(__p.second); + return *this; + } + + void + swap(pair&& __p) + { + using std::swap; + swap(first, __p.first); + swap(second, __p.second); + } +#endif + }; + + /// Two pairs of the same type are equal iff their members are equal. + template + inline bool + operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) + { return __x.first == __y.first && __x.second == __y.second; } + + /// + template + inline bool + operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) + { return __x.first < __y.first + || (!(__y.first < __x.first) && __x.second < __y.second); } + + /// Uses @c operator== to find the result. + template + inline bool + operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) + { return !(__x == __y); } + + /// Uses @c operator< to find the result. + template + inline bool + operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) + { return __y < __x; } + + /// Uses @c operator< to find the result. + template + inline bool + operator<=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) + { return !(__y < __x); } + + /// Uses @c operator< to find the result. + template + inline bool + operator>=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) + { return !(__x < __y); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /// See std::pair::swap(). + // Note: no std::swap overloads in C++03 mode, this has performance + // implications, see, eg, libstdc++/38466. + template + inline void + swap(pair<_T1, _T2>& __x, pair<_T1, _T2>& __y) + { __x.swap(__y); } + + template + inline void + swap(pair<_T1, _T2>&& __x, pair<_T1, _T2>& __y) + { __x.swap(__y); } + + template + inline void + swap(pair<_T1, _T2>& __x, pair<_T1, _T2>&& __y) + { __x.swap(__y); } +#endif + + /** + * @brief A convenience wrapper for creating a pair from two objects. + * @param x The first object. + * @param y The second object. + * @return A newly-constructed pair<> object of the appropriate type. + * + * The standard requires that the objects be passed by reference-to-const, + * but LWG issue #181 says they should be passed by const value. We follow + * the LWG by default. + */ + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 181. make_pair() unintended behavior +#ifndef __GXX_EXPERIMENTAL_CXX0X__ + template + inline pair<_T1, _T2> + make_pair(_T1 __x, _T2 __y) + { return pair<_T1, _T2>(__x, __y); } +#else + template + class reference_wrapper; + + // Helper which adds a reference to a type when given a reference_wrapper + template + struct __strip_reference_wrapper + { + typedef _Tp __type; + }; + + template + struct __strip_reference_wrapper > + { + typedef _Tp& __type; + }; + + template + struct __strip_reference_wrapper > + { + typedef _Tp& __type; + }; + + template + struct __decay_and_strip + { + typedef typename __strip_reference_wrapper< + typename decay<_Tp>::type>::__type __type; + }; + + // NB: DR 706. + template + inline pair::__type, + typename __decay_and_strip<_T2>::__type> + make_pair(_T1&& __x, _T2&& __y) + { + return pair::__type, + typename __decay_and_strip<_T2>::__type> + (std::forward<_T1>(__x), std::forward<_T2>(__y)); + } +#endif + +_GLIBCXX_END_NAMESPACE + +#endif /* _STL_PAIR_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_queue.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_queue.h new file mode 100644 index 00000000..7479469d --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_queue.h @@ -0,0 +1,586 @@ +// Queue implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_queue.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_QUEUE_H +#define _STL_QUEUE_H 1 + +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /** + * @brief A standard container giving FIFO behavior. + * + * @ingroup sequences + * + * Meets many of the requirements of a + * container, + * but does not define anything to do with iterators. Very few of the + * other standard container interfaces are defined. + * + * This is not a true container, but an @e adaptor. It holds another + * container, and provides a wrapper interface to that container. The + * wrapper is what enforces strict first-in-first-out %queue behavior. + * + * The second template parameter defines the type of the underlying + * sequence/container. It defaults to std::deque, but it can be any type + * that supports @c front, @c back, @c push_back, and @c pop_front, + * such as std::list or an appropriate user-defined type. + * + * Members not found in "normal" containers are @c container_type, + * which is a typedef for the second Sequence parameter, and @c push and + * @c pop, which are standard %queue/FIFO operations. + */ + template > + class queue + { + // concept requirements + typedef typename _Sequence::value_type _Sequence_value_type; + __glibcxx_class_requires(_Tp, _SGIAssignableConcept) + __glibcxx_class_requires(_Sequence, _FrontInsertionSequenceConcept) + __glibcxx_class_requires(_Sequence, _BackInsertionSequenceConcept) + __glibcxx_class_requires2(_Tp, _Sequence_value_type, _SameTypeConcept) + + template + friend bool + operator==(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&); + + template + friend bool + operator<(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&); + + public: + typedef typename _Sequence::value_type value_type; + typedef typename _Sequence::reference reference; + typedef typename _Sequence::const_reference const_reference; + typedef typename _Sequence::size_type size_type; + typedef _Sequence container_type; + + protected: + /** + * 'c' is the underlying container. Maintainers wondering why + * this isn't uglified as per style guidelines should note that + * this name is specified in the standard, [23.2.3.1]. (Why? + * Presumably for the same reason that it's protected instead + * of private: to allow derivation. But none of the other + * containers allow for derivation. Odd.) + */ + _Sequence c; + + public: + /** + * @brief Default constructor creates no elements. + */ +#ifndef __GXX_EXPERIMENTAL_CXX0X__ + explicit + queue(const _Sequence& __c = _Sequence()) + : c(__c) { } +#else + explicit + queue(const _Sequence& __c) + : c(__c) { } + + explicit + queue(_Sequence&& __c = _Sequence()) + : c(std::move(__c)) { } + + queue(queue&& __q) + : c(std::move(__q.c)) { } + + queue& + operator=(queue&& __q) + { + c = std::move(__q.c); + return *this; + } +#endif + + /** + * Returns true if the %queue is empty. + */ + bool + empty() const + { return c.empty(); } + + /** Returns the number of elements in the %queue. */ + size_type + size() const + { return c.size(); } + + /** + * Returns a read/write reference to the data at the first + * element of the %queue. + */ + reference + front() + { + __glibcxx_requires_nonempty(); + return c.front(); + } + + /** + * Returns a read-only (constant) reference to the data at the first + * element of the %queue. + */ + const_reference + front() const + { + __glibcxx_requires_nonempty(); + return c.front(); + } + + /** + * Returns a read/write reference to the data at the last + * element of the %queue. + */ + reference + back() + { + __glibcxx_requires_nonempty(); + return c.back(); + } + + /** + * Returns a read-only (constant) reference to the data at the last + * element of the %queue. + */ + const_reference + back() const + { + __glibcxx_requires_nonempty(); + return c.back(); + } + + /** + * @brief Add data to the end of the %queue. + * @param x Data to be added. + * + * This is a typical %queue operation. The function creates an + * element at the end of the %queue and assigns the given data + * to it. The time complexity of the operation depends on the + * underlying sequence. + */ + void + push(const value_type& __x) + { c.push_back(__x); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + void + push(value_type&& __x) + { c.push_back(std::move(__x)); } + + template + void + emplace(_Args&&... __args) + { c.emplace_back(std::forward<_Args>(__args)...); } +#endif + + /** + * @brief Removes first element. + * + * This is a typical %queue operation. It shrinks the %queue by one. + * The time complexity of the operation depends on the underlying + * sequence. + * + * Note that no data is returned, and if the first element's + * data is needed, it should be retrieved before pop() is + * called. + */ + void + pop() + { + __glibcxx_requires_nonempty(); + c.pop_front(); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + void + swap(queue&& __q) + { c.swap(__q.c); } +#endif + }; + + /** + * @brief Queue equality comparison. + * @param x A %queue. + * @param y A %queue of the same type as @a x. + * @return True iff the size and elements of the queues are equal. + * + * This is an equivalence relation. Complexity and semantics depend on the + * underlying sequence type, but the expected rules are: this relation is + * linear in the size of the sequences, and queues are considered equivalent + * if their sequences compare equal. + */ + template + inline bool + operator==(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) + { return __x.c == __y.c; } + + /** + * @brief Queue ordering relation. + * @param x A %queue. + * @param y A %queue of the same type as @a x. + * @return True iff @a x is lexicographically less than @a y. + * + * This is an total ordering relation. Complexity and semantics + * depend on the underlying sequence type, but the expected rules + * are: this relation is linear in the size of the sequences, the + * elements must be comparable with @c <, and + * std::lexicographical_compare() is usually used to make the + * determination. + */ + template + inline bool + operator<(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) + { return __x.c < __y.c; } + + /// Based on operator== + template + inline bool + operator!=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) + { return !(__x == __y); } + + /// Based on operator< + template + inline bool + operator>(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) + { return __y < __x; } + + /// Based on operator< + template + inline bool + operator<=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) + { return !(__y < __x); } + + /// Based on operator< + template + inline bool + operator>=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) + { return !(__x < __y); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + inline void + swap(queue<_Tp, _Seq>& __x, queue<_Tp, _Seq>& __y) + { __x.swap(__y); } + + template + inline void + swap(queue<_Tp, _Seq>&& __x, queue<_Tp, _Seq>& __y) + { __x.swap(__y); } + + template + inline void + swap(queue<_Tp, _Seq>& __x, queue<_Tp, _Seq>&& __y) + { __x.swap(__y); } +#endif + + /** + * @brief A standard container automatically sorting its contents. + * + * @ingroup sequences + * + * This is not a true container, but an @e adaptor. It holds + * another container, and provides a wrapper interface to that + * container. The wrapper is what enforces priority-based sorting + * and %queue behavior. Very few of the standard container/sequence + * interface requirements are met (e.g., iterators). + * + * The second template parameter defines the type of the underlying + * sequence/container. It defaults to std::vector, but it can be + * any type that supports @c front(), @c push_back, @c pop_back, + * and random-access iterators, such as std::deque or an + * appropriate user-defined type. + * + * The third template parameter supplies the means of making + * priority comparisons. It defaults to @c less but + * can be anything defining a strict weak ordering. + * + * Members not found in "normal" containers are @c container_type, + * which is a typedef for the second Sequence parameter, and @c + * push, @c pop, and @c top, which are standard %queue operations. + * + * @note No equality/comparison operators are provided for + * %priority_queue. + * + * @note Sorting of the elements takes place as they are added to, + * and removed from, the %priority_queue using the + * %priority_queue's member functions. If you access the elements + * by other means, and change their data such that the sorting + * order would be different, the %priority_queue will not re-sort + * the elements for you. (How could it know to do so?) + */ + template, + typename _Compare = less > + class priority_queue + { + // concept requirements + typedef typename _Sequence::value_type _Sequence_value_type; + __glibcxx_class_requires(_Tp, _SGIAssignableConcept) + __glibcxx_class_requires(_Sequence, _SequenceConcept) + __glibcxx_class_requires(_Sequence, _RandomAccessContainerConcept) + __glibcxx_class_requires2(_Tp, _Sequence_value_type, _SameTypeConcept) + __glibcxx_class_requires4(_Compare, bool, _Tp, _Tp, + _BinaryFunctionConcept) + + public: + typedef typename _Sequence::value_type value_type; + typedef typename _Sequence::reference reference; + typedef typename _Sequence::const_reference const_reference; + typedef typename _Sequence::size_type size_type; + typedef _Sequence container_type; + + protected: + // See queue::c for notes on these names. + _Sequence c; + _Compare comp; + + public: + /** + * @brief Default constructor creates no elements. + */ +#ifndef __GXX_EXPERIMENTAL_CXX0X__ + explicit + priority_queue(const _Compare& __x = _Compare(), + const _Sequence& __s = _Sequence()) + : c(__s), comp(__x) + { std::make_heap(c.begin(), c.end(), comp); } +#else + explicit + priority_queue(const _Compare& __x, + const _Sequence& __s) + : c(__s), comp(__x) + { std::make_heap(c.begin(), c.end(), comp); } + + explicit + priority_queue(const _Compare& __x = _Compare(), + _Sequence&& __s = _Sequence()) + : c(std::move(__s)), comp(__x) + { std::make_heap(c.begin(), c.end(), comp); } +#endif + + /** + * @brief Builds a %queue from a range. + * @param first An input iterator. + * @param last An input iterator. + * @param x A comparison functor describing a strict weak ordering. + * @param s An initial sequence with which to start. + * + * Begins by copying @a s, inserting a copy of the elements + * from @a [first,last) into the copy of @a s, then ordering + * the copy according to @a x. + * + * For more information on function objects, see the + * documentation on @link functors functor base + * classes@endlink. + */ +#ifndef __GXX_EXPERIMENTAL_CXX0X__ + template + priority_queue(_InputIterator __first, _InputIterator __last, + const _Compare& __x = _Compare(), + const _Sequence& __s = _Sequence()) + : c(__s), comp(__x) + { + __glibcxx_requires_valid_range(__first, __last); + c.insert(c.end(), __first, __last); + std::make_heap(c.begin(), c.end(), comp); + } +#else + template + priority_queue(_InputIterator __first, _InputIterator __last, + const _Compare& __x, + const _Sequence& __s) + : c(__s), comp(__x) + { + __glibcxx_requires_valid_range(__first, __last); + c.insert(c.end(), __first, __last); + std::make_heap(c.begin(), c.end(), comp); + } + + template + priority_queue(_InputIterator __first, _InputIterator __last, + const _Compare& __x = _Compare(), + _Sequence&& __s = _Sequence()) + : c(std::move(__s)), comp(__x) + { + __glibcxx_requires_valid_range(__first, __last); + c.insert(c.end(), __first, __last); + std::make_heap(c.begin(), c.end(), comp); + } + + priority_queue(priority_queue&& __pq) + : c(std::move(__pq.c)), comp(std::move(__pq.comp)) { } + + priority_queue& + operator=(priority_queue&& __pq) + { + c = std::move(__pq.c); + comp = std::move(__pq.comp); + return *this; + } +#endif + + /** + * Returns true if the %queue is empty. + */ + bool + empty() const + { return c.empty(); } + + /** Returns the number of elements in the %queue. */ + size_type + size() const + { return c.size(); } + + /** + * Returns a read-only (constant) reference to the data at the first + * element of the %queue. + */ + const_reference + top() const + { + __glibcxx_requires_nonempty(); + return c.front(); + } + + /** + * @brief Add data to the %queue. + * @param x Data to be added. + * + * This is a typical %queue operation. + * The time complexity of the operation depends on the underlying + * sequence. + */ + void + push(const value_type& __x) + { + c.push_back(__x); + std::push_heap(c.begin(), c.end(), comp); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + void + push(value_type&& __x) + { + c.push_back(std::move(__x)); + std::push_heap(c.begin(), c.end(), comp); + } + + template + void + emplace(_Args&&... __args) + { + c.emplace_back(std::forward<_Args>(__args)...); + std::push_heap(c.begin(), c.end(), comp); + } +#endif + + /** + * @brief Removes first element. + * + * This is a typical %queue operation. It shrinks the %queue + * by one. The time complexity of the operation depends on the + * underlying sequence. + * + * Note that no data is returned, and if the first element's + * data is needed, it should be retrieved before pop() is + * called. + */ + void + pop() + { + __glibcxx_requires_nonempty(); + std::pop_heap(c.begin(), c.end(), comp); + c.pop_back(); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + void + swap(priority_queue&& __pq) + { + using std::swap; + c.swap(__pq.c); + swap(comp, __pq.comp); + } +#endif + }; + + // No equality/comparison operators are provided for priority_queue. + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + inline void + swap(priority_queue<_Tp, _Sequence, _Compare>& __x, + priority_queue<_Tp, _Sequence, _Compare>& __y) + { __x.swap(__y); } + + template + inline void + swap(priority_queue<_Tp, _Sequence, _Compare>&& __x, + priority_queue<_Tp, _Sequence, _Compare>& __y) + { __x.swap(__y); } + + template + inline void + swap(priority_queue<_Tp, _Sequence, _Compare>& __x, + priority_queue<_Tp, _Sequence, _Compare>&& __y) + { __x.swap(__y); } +#endif + +_GLIBCXX_END_NAMESPACE + +#endif /* _STL_QUEUE_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_raw_storage_iter.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_raw_storage_iter.h new file mode 100644 index 00000000..de6cad97 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_raw_storage_iter.h @@ -0,0 +1,106 @@ +// -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_raw_storage_iter.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_RAW_STORAGE_ITERATOR_H +#define _STL_RAW_STORAGE_ITERATOR_H 1 + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /** + * This iterator class lets algorithms store their results into + * uninitialized memory. + */ + template + class raw_storage_iterator + : public iterator + { + protected: + _OutputIterator _M_iter; + + public: + explicit + raw_storage_iterator(_OutputIterator __x) + : _M_iter(__x) {} + + raw_storage_iterator& + operator*() { return *this; } + + raw_storage_iterator& + operator=(const _Tp& __element) + { + std::_Construct(&*_M_iter, __element); + return *this; + } + + raw_storage_iterator<_OutputIterator, _Tp>& + operator++() + { + ++_M_iter; + return *this; + } + + raw_storage_iterator<_OutputIterator, _Tp> + operator++(int) + { + raw_storage_iterator<_OutputIterator, _Tp> __tmp = *this; + ++_M_iter; + return __tmp; + } + }; + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_relops.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_relops.h new file mode 100644 index 00000000..4377c5fa --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_relops.h @@ -0,0 +1,131 @@ +// std::rel_ops implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2004, 2005, 2008 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the, 2009 Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * Copyright (c) 1996,1997 + * Silicon Graphics + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + */ + +/** @file stl_relops.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + * + * Inclusion of this file has been removed from + * all of the other STL headers for safety reasons, except std_utility.h. + * For more information, see the thread of about twenty messages starting + * with http://gcc.gnu.org/ml/libstdc++/2001-01/msg00223.html, or + * http://gcc.gnu.org/onlinedocs/libstdc++/faq.html#faq.ambiguous_overloads + * + * Short summary: the rel_ops operators should be avoided for the present. + */ + +#ifndef _STL_RELOPS_H +#define _STL_RELOPS_H 1 + +_GLIBCXX_BEGIN_NAMESPACE(std) + + namespace rel_ops + { + /** @namespace std::rel_ops + * @brief The generated relational operators are sequestered here. + */ + + /** + * @brief Defines @c != for arbitrary types, in terms of @c ==. + * @param x A thing. + * @param y Another thing. + * @return x != y + * + * This function uses @c == to determine its result. + */ + template + inline bool + operator!=(const _Tp& __x, const _Tp& __y) + { return !(__x == __y); } + + /** + * @brief Defines @c > for arbitrary types, in terms of @c <. + * @param x A thing. + * @param y Another thing. + * @return x > y + * + * This function uses @c < to determine its result. + */ + template + inline bool + operator>(const _Tp& __x, const _Tp& __y) + { return __y < __x; } + + /** + * @brief Defines @c <= for arbitrary types, in terms of @c <. + * @param x A thing. + * @param y Another thing. + * @return x <= y + * + * This function uses @c < to determine its result. + */ + template + inline bool + operator<=(const _Tp& __x, const _Tp& __y) + { return !(__y < __x); } + + /** + * @brief Defines @c >= for arbitrary types, in terms of @c <. + * @param x A thing. + * @param y Another thing. + * @return x >= y + * + * This function uses @c < to determine its result. + */ + template + inline bool + operator>=(const _Tp& __x, const _Tp& __y) + { return !(__x < __y); } + + } // namespace rel_ops + +_GLIBCXX_END_NAMESPACE + +#endif /* _STL_RELOPS_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_set.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_set.h new file mode 100644 index 00000000..f06fe033 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_set.h @@ -0,0 +1,708 @@ +// Set implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_set.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_SET_H +#define _STL_SET_H 1 + +#include +#include + +_GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D) + + /** + * @brief A standard container made up of unique keys, which can be + * retrieved in logarithmic time. + * + * @ingroup associative_containers + * + * Meets the requirements of a container, a + * reversible container, and an + * associative container (using unique keys). + * + * Sets support bidirectional iterators. + * + * @param Key Type of key objects. + * @param Compare Comparison function object type, defaults to less. + * @param Alloc Allocator type, defaults to allocator. + * + * The private tree data is declared exactly the same way for set and + * multiset; the distinction is made entirely in how the tree functions are + * called (*_unique versus *_equal, same as the standard). + */ + template, + typename _Alloc = std::allocator<_Key> > + class set + { + // concept requirements + typedef typename _Alloc::value_type _Alloc_value_type; + __glibcxx_class_requires(_Key, _SGIAssignableConcept) + __glibcxx_class_requires4(_Compare, bool, _Key, _Key, + _BinaryFunctionConcept) + __glibcxx_class_requires2(_Key, _Alloc_value_type, _SameTypeConcept) + + public: + // typedefs: + //@{ + /// Public typedefs. + typedef _Key key_type; + typedef _Key value_type; + typedef _Compare key_compare; + typedef _Compare value_compare; + typedef _Alloc allocator_type; + //@} + + private: + typedef typename _Alloc::template rebind<_Key>::other _Key_alloc_type; + + typedef _Rb_tree, + key_compare, _Key_alloc_type> _Rep_type; + _Rep_type _M_t; // Red-black tree representing set. + + public: + //@{ + /// Iterator-related typedefs. + typedef typename _Key_alloc_type::pointer pointer; + typedef typename _Key_alloc_type::const_pointer const_pointer; + typedef typename _Key_alloc_type::reference reference; + typedef typename _Key_alloc_type::const_reference const_reference; + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 103. set::iterator is required to be modifiable, + // but this allows modification of keys. + typedef typename _Rep_type::const_iterator iterator; + typedef typename _Rep_type::const_iterator const_iterator; + typedef typename _Rep_type::const_reverse_iterator reverse_iterator; + typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator; + typedef typename _Rep_type::size_type size_type; + typedef typename _Rep_type::difference_type difference_type; + //@} + + // allocation/deallocation + /** + * @brief Default constructor creates no elements. + */ + set() + : _M_t() { } + + /** + * @brief Creates a %set with no elements. + * @param comp Comparator to use. + * @param a An allocator object. + */ + explicit + set(const _Compare& __comp, + const allocator_type& __a = allocator_type()) + : _M_t(__comp, __a) { } + + /** + * @brief Builds a %set from a range. + * @param first An input iterator. + * @param last An input iterator. + * + * Create a %set consisting of copies of the elements from [first,last). + * This is linear in N if the range is already sorted, and NlogN + * otherwise (where N is distance(first,last)). + */ + template + set(_InputIterator __first, _InputIterator __last) + : _M_t() + { _M_t._M_insert_unique(__first, __last); } + + /** + * @brief Builds a %set from a range. + * @param first An input iterator. + * @param last An input iterator. + * @param comp A comparison functor. + * @param a An allocator object. + * + * Create a %set consisting of copies of the elements from [first,last). + * This is linear in N if the range is already sorted, and NlogN + * otherwise (where N is distance(first,last)). + */ + template + set(_InputIterator __first, _InputIterator __last, + const _Compare& __comp, + const allocator_type& __a = allocator_type()) + : _M_t(__comp, __a) + { _M_t._M_insert_unique(__first, __last); } + + /** + * @brief %Set copy constructor. + * @param x A %set of identical element and allocator types. + * + * The newly-created %set uses a copy of the allocation object used + * by @a x. + */ + set(const set& __x) + : _M_t(__x._M_t) { } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief %Set move constructor + * @param x A %set of identical element and allocator types. + * + * The newly-created %set contains the exact contents of @a x. + * The contents of @a x are a valid, but unspecified %set. + */ + set(set&& __x) + : _M_t(std::forward<_Rep_type>(__x._M_t)) { } + + /** + * @brief Builds a %set from an initializer_list. + * @param l An initializer_list. + * @param comp A comparison functor. + * @param a An allocator object. + * + * Create a %set consisting of copies of the elements in the list. + * This is linear in N if the list is already sorted, and NlogN + * otherwise (where N is @a l.size()). + */ + set(initializer_list __l, + const _Compare& __comp = _Compare(), + const allocator_type& __a = allocator_type()) + : _M_t(__comp, __a) + { _M_t._M_insert_unique(__l.begin(), __l.end()); } +#endif + + /** + * @brief %Set assignment operator. + * @param x A %set of identical element and allocator types. + * + * All the elements of @a x are copied, but unlike the copy constructor, + * the allocator object is not copied. + */ + set& + operator=(const set& __x) + { + _M_t = __x._M_t; + return *this; + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief %Set move assignment operator. + * @param x A %set of identical element and allocator types. + * + * The contents of @a x are moved into this %set (without copying). + * @a x is a valid, but unspecified %set. + */ + set& + operator=(set&& __x) + { + // NB: DR 675. + this->clear(); + this->swap(__x); + return *this; + } + + /** + * @brief %Set list assignment operator. + * @param l An initializer_list. + * + * This function fills a %set with copies of the elements in the + * initializer list @a l. + * + * Note that the assignment completely changes the %set and + * that the resulting %set's size is the same as the number + * of elements assigned. Old data may be lost. + */ + set& + operator=(initializer_list __l) + { + this->clear(); + this->insert(__l.begin(), __l.end()); + return *this; + } +#endif + + // accessors: + + /// Returns the comparison object with which the %set was constructed. + key_compare + key_comp() const + { return _M_t.key_comp(); } + /// Returns the comparison object with which the %set was constructed. + value_compare + value_comp() const + { return _M_t.key_comp(); } + /// Returns the allocator object with which the %set was constructed. + allocator_type + get_allocator() const + { return _M_t.get_allocator(); } + + /** + * Returns a read-only (constant) iterator that points to the first + * element in the %set. Iteration is done in ascending order according + * to the keys. + */ + iterator + begin() const + { return _M_t.begin(); } + + /** + * Returns a read-only (constant) iterator that points one past the last + * element in the %set. Iteration is done in ascending order according + * to the keys. + */ + iterator + end() const + { return _M_t.end(); } + + /** + * Returns a read-only (constant) iterator that points to the last + * element in the %set. Iteration is done in descending order according + * to the keys. + */ + reverse_iterator + rbegin() const + { return _M_t.rbegin(); } + + /** + * Returns a read-only (constant) reverse iterator that points to the + * last pair in the %set. Iteration is done in descending order + * according to the keys. + */ + reverse_iterator + rend() const + { return _M_t.rend(); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * Returns a read-only (constant) iterator that points to the first + * element in the %set. Iteration is done in ascending order according + * to the keys. + */ + iterator + cbegin() const + { return _M_t.begin(); } + + /** + * Returns a read-only (constant) iterator that points one past the last + * element in the %set. Iteration is done in ascending order according + * to the keys. + */ + iterator + cend() const + { return _M_t.end(); } + + /** + * Returns a read-only (constant) iterator that points to the last + * element in the %set. Iteration is done in descending order according + * to the keys. + */ + reverse_iterator + crbegin() const + { return _M_t.rbegin(); } + + /** + * Returns a read-only (constant) reverse iterator that points to the + * last pair in the %set. Iteration is done in descending order + * according to the keys. + */ + reverse_iterator + crend() const + { return _M_t.rend(); } +#endif + + /// Returns true if the %set is empty. + bool + empty() const + { return _M_t.empty(); } + + /// Returns the size of the %set. + size_type + size() const + { return _M_t.size(); } + + /// Returns the maximum size of the %set. + size_type + max_size() const + { return _M_t.max_size(); } + + /** + * @brief Swaps data with another %set. + * @param x A %set of the same element and allocator types. + * + * This exchanges the elements between two sets in constant time. + * (It is only swapping a pointer, an integer, and an instance of + * the @c Compare type (which itself is often stateless and empty), so it + * should be quite fast.) + * Note that the global std::swap() function is specialized such that + * std::swap(s1,s2) will feed to this function. + */ + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + swap(set&& __x) +#else + swap(set& __x) +#endif + { _M_t.swap(__x._M_t); } + + // insert/erase + /** + * @brief Attempts to insert an element into the %set. + * @param x Element to be inserted. + * @return A pair, of which the first element is an iterator that points + * to the possibly inserted element, and the second is a bool + * that is true if the element was actually inserted. + * + * This function attempts to insert an element into the %set. A %set + * relies on unique keys and thus an element is only inserted if it is + * not already present in the %set. + * + * Insertion requires logarithmic time. + */ + std::pair + insert(const value_type& __x) + { + std::pair __p = + _M_t._M_insert_unique(__x); + return std::pair(__p.first, __p.second); + } + + /** + * @brief Attempts to insert an element into the %set. + * @param position An iterator that serves as a hint as to where the + * element should be inserted. + * @param x Element to be inserted. + * @return An iterator that points to the element with key of @a x (may + * or may not be the element passed in). + * + * This function is not concerned about whether the insertion took place, + * and thus does not return a boolean like the single-argument insert() + * does. Note that the first parameter is only a hint and can + * potentially improve the performance of the insertion process. A bad + * hint would cause no gains in efficiency. + * + * For more on "hinting", see: + * http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt07ch17.html + * + * Insertion requires logarithmic time (if the hint is not taken). + */ + iterator + insert(iterator __position, const value_type& __x) + { return _M_t._M_insert_unique_(__position, __x); } + + /** + * @brief A template function that attempts to insert a range + * of elements. + * @param first Iterator pointing to the start of the range to be + * inserted. + * @param last Iterator pointing to the end of the range. + * + * Complexity similar to that of the range constructor. + */ + template + void + insert(_InputIterator __first, _InputIterator __last) + { _M_t._M_insert_unique(__first, __last); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Attempts to insert a list of elements into the %set. + * @param list A std::initializer_list of elements + * to be inserted. + * + * Complexity similar to that of the range constructor. + */ + void + insert(initializer_list __l) + { this->insert(__l.begin(), __l.end()); } +#endif + + /** + * @brief Erases an element from a %set. + * @param position An iterator pointing to the element to be erased. + * + * This function erases an element, pointed to by the given iterator, + * from a %set. Note that this function only erases the element, and + * that if the element is itself a pointer, the pointed-to memory is not + * touched in any way. Managing the pointer is the user's responsibility. + */ + void + erase(iterator __position) + { _M_t.erase(__position); } + + /** + * @brief Erases elements according to the provided key. + * @param x Key of element to be erased. + * @return The number of elements erased. + * + * This function erases all the elements located by the given key from + * a %set. + * Note that this function only erases the element, and that if + * the element is itself a pointer, the pointed-to memory is not touched + * in any way. Managing the pointer is the user's responsibility. + */ + size_type + erase(const key_type& __x) + { return _M_t.erase(__x); } + + /** + * @brief Erases a [first,last) range of elements from a %set. + * @param first Iterator pointing to the start of the range to be + * erased. + * @param last Iterator pointing to the end of the range to be erased. + * + * This function erases a sequence of elements from a %set. + * Note that this function only erases the element, and that if + * the element is itself a pointer, the pointed-to memory is not touched + * in any way. Managing the pointer is the user's responsibility. + */ + void + erase(iterator __first, iterator __last) + { _M_t.erase(__first, __last); } + + /** + * Erases all elements in a %set. Note that this function only erases + * the elements, and that if the elements themselves are pointers, the + * pointed-to memory is not touched in any way. Managing the pointer is + * the user's responsibility. + */ + void + clear() + { _M_t.clear(); } + + // set operations: + + /** + * @brief Finds the number of elements. + * @param x Element to located. + * @return Number of elements with specified key. + * + * This function only makes sense for multisets; for set the result will + * either be 0 (not present) or 1 (present). + */ + size_type + count(const key_type& __x) const + { return _M_t.find(__x) == _M_t.end() ? 0 : 1; } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 214. set::find() missing const overload + //@{ + /** + * @brief Tries to locate an element in a %set. + * @param x Element to be located. + * @return Iterator pointing to sought-after element, or end() if not + * found. + * + * This function takes a key and tries to locate the element with which + * the key matches. If successful the function returns an iterator + * pointing to the sought after element. If unsuccessful it returns the + * past-the-end ( @c end() ) iterator. + */ + iterator + find(const key_type& __x) + { return _M_t.find(__x); } + + const_iterator + find(const key_type& __x) const + { return _M_t.find(__x); } + //@} + + //@{ + /** + * @brief Finds the beginning of a subsequence matching given key. + * @param x Key to be located. + * @return Iterator pointing to first element equal to or greater + * than key, or end(). + * + * This function returns the first element of a subsequence of elements + * that matches the given key. If unsuccessful it returns an iterator + * pointing to the first element that has a greater value than given key + * or end() if no such element exists. + */ + iterator + lower_bound(const key_type& __x) + { return _M_t.lower_bound(__x); } + + const_iterator + lower_bound(const key_type& __x) const + { return _M_t.lower_bound(__x); } + //@} + + //@{ + /** + * @brief Finds the end of a subsequence matching given key. + * @param x Key to be located. + * @return Iterator pointing to the first element + * greater than key, or end(). + */ + iterator + upper_bound(const key_type& __x) + { return _M_t.upper_bound(__x); } + + const_iterator + upper_bound(const key_type& __x) const + { return _M_t.upper_bound(__x); } + //@} + + //@{ + /** + * @brief Finds a subsequence matching given key. + * @param x Key to be located. + * @return Pair of iterators that possibly points to the subsequence + * matching given key. + * + * This function is equivalent to + * @code + * std::make_pair(c.lower_bound(val), + * c.upper_bound(val)) + * @endcode + * (but is faster than making the calls separately). + * + * This function probably only makes sense for multisets. + */ + std::pair + equal_range(const key_type& __x) + { return _M_t.equal_range(__x); } + + std::pair + equal_range(const key_type& __x) const + { return _M_t.equal_range(__x); } + //@} + + template + friend bool + operator==(const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&); + + template + friend bool + operator<(const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&); + }; + + + /** + * @brief Set equality comparison. + * @param x A %set. + * @param y A %set of the same type as @a x. + * @return True iff the size and elements of the sets are equal. + * + * This is an equivalence relation. It is linear in the size of the sets. + * Sets are considered equivalent if their sizes are equal, and if + * corresponding elements compare equal. + */ + template + inline bool + operator==(const set<_Key, _Compare, _Alloc>& __x, + const set<_Key, _Compare, _Alloc>& __y) + { return __x._M_t == __y._M_t; } + + /** + * @brief Set ordering relation. + * @param x A %set. + * @param y A %set of the same type as @a x. + * @return True iff @a x is lexicographically less than @a y. + * + * This is a total ordering relation. It is linear in the size of the + * maps. The elements must be comparable with @c <. + * + * See std::lexicographical_compare() for how the determination is made. + */ + template + inline bool + operator<(const set<_Key, _Compare, _Alloc>& __x, + const set<_Key, _Compare, _Alloc>& __y) + { return __x._M_t < __y._M_t; } + + /// Returns !(x == y). + template + inline bool + operator!=(const set<_Key, _Compare, _Alloc>& __x, + const set<_Key, _Compare, _Alloc>& __y) + { return !(__x == __y); } + + /// Returns y < x. + template + inline bool + operator>(const set<_Key, _Compare, _Alloc>& __x, + const set<_Key, _Compare, _Alloc>& __y) + { return __y < __x; } + + /// Returns !(y < x) + template + inline bool + operator<=(const set<_Key, _Compare, _Alloc>& __x, + const set<_Key, _Compare, _Alloc>& __y) + { return !(__y < __x); } + + /// Returns !(x < y) + template + inline bool + operator>=(const set<_Key, _Compare, _Alloc>& __x, + const set<_Key, _Compare, _Alloc>& __y) + { return !(__x < __y); } + + /// See std::set::swap(). + template + inline void + swap(set<_Key, _Compare, _Alloc>& __x, set<_Key, _Compare, _Alloc>& __y) + { __x.swap(__y); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + inline void + swap(set<_Key, _Compare, _Alloc>&& __x, set<_Key, _Compare, _Alloc>& __y) + { __x.swap(__y); } + + template + inline void + swap(set<_Key, _Compare, _Alloc>& __x, set<_Key, _Compare, _Alloc>&& __y) + { __x.swap(__y); } +#endif + +_GLIBCXX_END_NESTED_NAMESPACE + +#endif /* _STL_SET_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_stack.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_stack.h new file mode 100644 index 00000000..da301d47 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_stack.h @@ -0,0 +1,299 @@ +// Stack implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_stack.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_STACK_H +#define _STL_STACK_H 1 + +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /** + * @brief A standard container giving FILO behavior. + * + * @ingroup sequences + * + * Meets many of the requirements of a + * container, + * but does not define anything to do with iterators. Very few of the + * other standard container interfaces are defined. + * + * This is not a true container, but an @e adaptor. It holds + * another container, and provides a wrapper interface to that + * container. The wrapper is what enforces strict + * first-in-last-out %stack behavior. + * + * The second template parameter defines the type of the underlying + * sequence/container. It defaults to std::deque, but it can be + * any type that supports @c back, @c push_back, and @c pop_front, + * such as std::list, std::vector, or an appropriate user-defined + * type. + * + * Members not found in "normal" containers are @c container_type, + * which is a typedef for the second Sequence parameter, and @c + * push, @c pop, and @c top, which are standard %stack/FILO + * operations. + */ + template > + class stack + { + // concept requirements + typedef typename _Sequence::value_type _Sequence_value_type; + __glibcxx_class_requires(_Tp, _SGIAssignableConcept) + __glibcxx_class_requires(_Sequence, _BackInsertionSequenceConcept) + __glibcxx_class_requires2(_Tp, _Sequence_value_type, _SameTypeConcept) + + template + friend bool + operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&); + + template + friend bool + operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&); + + public: + typedef typename _Sequence::value_type value_type; + typedef typename _Sequence::reference reference; + typedef typename _Sequence::const_reference const_reference; + typedef typename _Sequence::size_type size_type; + typedef _Sequence container_type; + + protected: + // See queue::c for notes on this name. + _Sequence c; + + public: + // XXX removed old def ctor, added def arg to this one to match 14882 + /** + * @brief Default constructor creates no elements. + */ +#ifndef __GXX_EXPERIMENTAL_CXX0X__ + explicit + stack(const _Sequence& __c = _Sequence()) + : c(__c) { } +#else + explicit + stack(const _Sequence& __c) + : c(__c) { } + + explicit + stack(_Sequence&& __c = _Sequence()) + : c(std::move(__c)) { } +#endif + + /** + * Returns true if the %stack is empty. + */ + bool + empty() const + { return c.empty(); } + + /** Returns the number of elements in the %stack. */ + size_type + size() const + { return c.size(); } + + /** + * Returns a read/write reference to the data at the first + * element of the %stack. + */ + reference + top() + { + __glibcxx_requires_nonempty(); + return c.back(); + } + + /** + * Returns a read-only (constant) reference to the data at the first + * element of the %stack. + */ + const_reference + top() const + { + __glibcxx_requires_nonempty(); + return c.back(); + } + + /** + * @brief Add data to the top of the %stack. + * @param x Data to be added. + * + * This is a typical %stack operation. The function creates an + * element at the top of the %stack and assigns the given data + * to it. The time complexity of the operation depends on the + * underlying sequence. + */ + void + push(const value_type& __x) + { c.push_back(__x); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + void + push(value_type&& __x) + { c.push_back(std::move(__x)); } + + template + void + emplace(_Args&&... __args) + { c.emplace_back(std::forward<_Args>(__args)...); } +#endif + + /** + * @brief Removes first element. + * + * This is a typical %stack operation. It shrinks the %stack + * by one. The time complexity of the operation depends on the + * underlying sequence. + * + * Note that no data is returned, and if the first element's + * data is needed, it should be retrieved before pop() is + * called. + */ + void + pop() + { + __glibcxx_requires_nonempty(); + c.pop_back(); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + void + swap(stack&& __s) + { c.swap(__s.c); } +#endif + }; + + /** + * @brief Stack equality comparison. + * @param x A %stack. + * @param y A %stack of the same type as @a x. + * @return True iff the size and elements of the stacks are equal. + * + * This is an equivalence relation. Complexity and semantics + * depend on the underlying sequence type, but the expected rules + * are: this relation is linear in the size of the sequences, and + * stacks are considered equivalent if their sequences compare + * equal. + */ + template + inline bool + operator==(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) + { return __x.c == __y.c; } + + /** + * @brief Stack ordering relation. + * @param x A %stack. + * @param y A %stack of the same type as @a x. + * @return True iff @a x is lexicographically less than @a y. + * + * This is an total ordering relation. Complexity and semantics + * depend on the underlying sequence type, but the expected rules + * are: this relation is linear in the size of the sequences, the + * elements must be comparable with @c <, and + * std::lexicographical_compare() is usually used to make the + * determination. + */ + template + inline bool + operator<(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) + { return __x.c < __y.c; } + + /// Based on operator== + template + inline bool + operator!=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) + { return !(__x == __y); } + + /// Based on operator< + template + inline bool + operator>(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) + { return __y < __x; } + + /// Based on operator< + template + inline bool + operator<=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) + { return !(__y < __x); } + + /// Based on operator< + template + inline bool + operator>=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) + { return !(__x < __y); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + inline void + swap(stack<_Tp, _Seq>& __x, stack<_Tp, _Seq>& __y) + { __x.swap(__y); } + + template + inline void + swap(stack<_Tp, _Seq>&& __x, stack<_Tp, _Seq>& __y) + { __x.swap(__y); } + + template + inline void + swap(stack<_Tp, _Seq>& __x, stack<_Tp, _Seq>&& __y) + { __x.swap(__y); } +#endif + +_GLIBCXX_END_NAMESPACE + +#endif /* _STL_STACK_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_tempbuf.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_tempbuf.h new file mode 100644 index 00000000..a3b08100 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_tempbuf.h @@ -0,0 +1,206 @@ +// Temporary buffer implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_tempbuf.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_TEMPBUF_H +#define _STL_TEMPBUF_H 1 + +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /** + * @brief Allocates a temporary buffer. + * @param len The number of objects of type Tp. + * @return See full description. + * + * Reinventing the wheel, but this time with prettier spokes! + * + * This function tries to obtain storage for @c len adjacent Tp + * objects. The objects themselves are not constructed, of course. + * A pair<> is returned containing "the buffer s address and + * capacity (in the units of sizeof(Tp)), or a pair of 0 values if + * no storage can be obtained." Note that the capacity obtained + * may be less than that requested if the memory is unavailable; + * you should compare len with the .second return value. + * + * Provides the nothrow exception guarantee. + */ + template + pair<_Tp*, ptrdiff_t> + get_temporary_buffer(ptrdiff_t __len) + { + const ptrdiff_t __max = + __gnu_cxx::__numeric_traits::__max / sizeof(_Tp); + if (__len > __max) + __len = __max; + + while (__len > 0) + { + _Tp* __tmp = static_cast<_Tp*>(::operator new(__len * sizeof(_Tp), + std::nothrow)); + if (__tmp != 0) + return std::pair<_Tp*, ptrdiff_t>(__tmp, __len); + __len /= 2; + } + return std::pair<_Tp*, ptrdiff_t>(static_cast<_Tp*>(0), 0); + } + + /** + * @brief The companion to get_temporary_buffer(). + * @param p A buffer previously allocated by get_temporary_buffer. + * @return None. + * + * Frees the memory pointed to by p. + */ + template + inline void + return_temporary_buffer(_Tp* __p) + { ::operator delete(__p, std::nothrow); } + + + /** + * This class is used in two places: stl_algo.h and ext/memory, + * where it is wrapped as the temporary_buffer class. See + * temporary_buffer docs for more notes. + */ + template + class _Temporary_buffer + { + // concept requirements + __glibcxx_class_requires(_ForwardIterator, _ForwardIteratorConcept) + + public: + typedef _Tp value_type; + typedef value_type* pointer; + typedef pointer iterator; + typedef ptrdiff_t size_type; + + protected: + size_type _M_original_len; + size_type _M_len; + pointer _M_buffer; + + public: + /// As per Table mumble. + size_type + size() const + { return _M_len; } + + /// Returns the size requested by the constructor; may be >size(). + size_type + requested_size() const + { return _M_original_len; } + + /// As per Table mumble. + iterator + begin() + { return _M_buffer; } + + /// As per Table mumble. + iterator + end() + { return _M_buffer + _M_len; } + + /** + * Constructs a temporary buffer of a size somewhere between + * zero and the size of the given range. + */ + _Temporary_buffer(_ForwardIterator __first, _ForwardIterator __last); + + ~_Temporary_buffer() + { + std::_Destroy(_M_buffer, _M_buffer + _M_len); + std::return_temporary_buffer(_M_buffer); + } + + private: + // Disable copy constructor and assignment operator. + _Temporary_buffer(const _Temporary_buffer&); + + void + operator=(const _Temporary_buffer&); + }; + + template + _Temporary_buffer<_ForwardIterator, _Tp>:: + _Temporary_buffer(_ForwardIterator __first, _ForwardIterator __last) + : _M_original_len(std::distance(__first, __last)), + _M_len(0), _M_buffer(0) + { + __try + { + std::pair __p(std::get_temporary_buffer< + value_type>(_M_original_len)); + _M_buffer = __p.first; + _M_len = __p.second; + if (!__is_pod(_Tp) && _M_len > 0) + std::uninitialized_fill_n(_M_buffer, _M_len, *__first); + } + __catch(...) + { + std::return_temporary_buffer(_M_buffer); + _M_buffer = 0; + _M_len = 0; + __throw_exception_again; + } + } + +_GLIBCXX_END_NAMESPACE + +#endif /* _STL_TEMPBUF_H */ + diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_tree.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_tree.h new file mode 100644 index 00000000..2e567360 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_tree.h @@ -0,0 +1,1495 @@ +// RB tree implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + */ + +/** @file stl_tree.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_TREE_H +#define _STL_TREE_H 1 + +#include +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // Red-black tree class, designed for use in implementing STL + // associative containers (set, multiset, map, and multimap). The + // insertion and deletion algorithms are based on those in Cormen, + // Leiserson, and Rivest, Introduction to Algorithms (MIT Press, + // 1990), except that + // + // (1) the header cell is maintained with links not only to the root + // but also to the leftmost node of the tree, to enable constant + // time begin(), and to the rightmost node of the tree, to enable + // linear time performance when used with the generic set algorithms + // (set_union, etc.) + // + // (2) when a node being deleted has two children its successor node + // is relinked into its place, rather than copied, so that the only + // iterators invalidated are those referring to the deleted node. + + enum _Rb_tree_color { _S_red = false, _S_black = true }; + + struct _Rb_tree_node_base + { + typedef _Rb_tree_node_base* _Base_ptr; + typedef const _Rb_tree_node_base* _Const_Base_ptr; + + _Rb_tree_color _M_color; + _Base_ptr _M_parent; + _Base_ptr _M_left; + _Base_ptr _M_right; + + static _Base_ptr + _S_minimum(_Base_ptr __x) + { + while (__x->_M_left != 0) __x = __x->_M_left; + return __x; + } + + static _Const_Base_ptr + _S_minimum(_Const_Base_ptr __x) + { + while (__x->_M_left != 0) __x = __x->_M_left; + return __x; + } + + static _Base_ptr + _S_maximum(_Base_ptr __x) + { + while (__x->_M_right != 0) __x = __x->_M_right; + return __x; + } + + static _Const_Base_ptr + _S_maximum(_Const_Base_ptr __x) + { + while (__x->_M_right != 0) __x = __x->_M_right; + return __x; + } + }; + + template + struct _Rb_tree_node : public _Rb_tree_node_base + { + typedef _Rb_tree_node<_Val>* _Link_type; + _Val _M_value_field; + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + _Rb_tree_node(_Args&&... __args) + : _Rb_tree_node_base(), + _M_value_field(std::forward<_Args>(__args)...) { } +#endif + }; + + _Rb_tree_node_base* + _Rb_tree_increment(_Rb_tree_node_base* __x); + + const _Rb_tree_node_base* + _Rb_tree_increment(const _Rb_tree_node_base* __x); + + _Rb_tree_node_base* + _Rb_tree_decrement(_Rb_tree_node_base* __x); + + const _Rb_tree_node_base* + _Rb_tree_decrement(const _Rb_tree_node_base* __x); + + template + struct _Rb_tree_iterator + { + typedef _Tp value_type; + typedef _Tp& reference; + typedef _Tp* pointer; + + typedef bidirectional_iterator_tag iterator_category; + typedef ptrdiff_t difference_type; + + typedef _Rb_tree_iterator<_Tp> _Self; + typedef _Rb_tree_node_base::_Base_ptr _Base_ptr; + typedef _Rb_tree_node<_Tp>* _Link_type; + + _Rb_tree_iterator() + : _M_node() { } + + explicit + _Rb_tree_iterator(_Link_type __x) + : _M_node(__x) { } + + reference + operator*() const + { return static_cast<_Link_type>(_M_node)->_M_value_field; } + + pointer + operator->() const + { return &static_cast<_Link_type>(_M_node)->_M_value_field; } + + _Self& + operator++() + { + _M_node = _Rb_tree_increment(_M_node); + return *this; + } + + _Self + operator++(int) + { + _Self __tmp = *this; + _M_node = _Rb_tree_increment(_M_node); + return __tmp; + } + + _Self& + operator--() + { + _M_node = _Rb_tree_decrement(_M_node); + return *this; + } + + _Self + operator--(int) + { + _Self __tmp = *this; + _M_node = _Rb_tree_decrement(_M_node); + return __tmp; + } + + bool + operator==(const _Self& __x) const + { return _M_node == __x._M_node; } + + bool + operator!=(const _Self& __x) const + { return _M_node != __x._M_node; } + + _Base_ptr _M_node; + }; + + template + struct _Rb_tree_const_iterator + { + typedef _Tp value_type; + typedef const _Tp& reference; + typedef const _Tp* pointer; + + typedef _Rb_tree_iterator<_Tp> iterator; + + typedef bidirectional_iterator_tag iterator_category; + typedef ptrdiff_t difference_type; + + typedef _Rb_tree_const_iterator<_Tp> _Self; + typedef _Rb_tree_node_base::_Const_Base_ptr _Base_ptr; + typedef const _Rb_tree_node<_Tp>* _Link_type; + + _Rb_tree_const_iterator() + : _M_node() { } + + explicit + _Rb_tree_const_iterator(_Link_type __x) + : _M_node(__x) { } + + _Rb_tree_const_iterator(const iterator& __it) + : _M_node(__it._M_node) { } + + reference + operator*() const + { return static_cast<_Link_type>(_M_node)->_M_value_field; } + + pointer + operator->() const + { return &static_cast<_Link_type>(_M_node)->_M_value_field; } + + _Self& + operator++() + { + _M_node = _Rb_tree_increment(_M_node); + return *this; + } + + _Self + operator++(int) + { + _Self __tmp = *this; + _M_node = _Rb_tree_increment(_M_node); + return __tmp; + } + + _Self& + operator--() + { + _M_node = _Rb_tree_decrement(_M_node); + return *this; + } + + _Self + operator--(int) + { + _Self __tmp = *this; + _M_node = _Rb_tree_decrement(_M_node); + return __tmp; + } + + bool + operator==(const _Self& __x) const + { return _M_node == __x._M_node; } + + bool + operator!=(const _Self& __x) const + { return _M_node != __x._M_node; } + + _Base_ptr _M_node; + }; + + template + inline bool + operator==(const _Rb_tree_iterator<_Val>& __x, + const _Rb_tree_const_iterator<_Val>& __y) + { return __x._M_node == __y._M_node; } + + template + inline bool + operator!=(const _Rb_tree_iterator<_Val>& __x, + const _Rb_tree_const_iterator<_Val>& __y) + { return __x._M_node != __y._M_node; } + + void + _Rb_tree_insert_and_rebalance(const bool __insert_left, + _Rb_tree_node_base* __x, + _Rb_tree_node_base* __p, + _Rb_tree_node_base& __header); + + _Rb_tree_node_base* + _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* const __z, + _Rb_tree_node_base& __header); + + + template > + class _Rb_tree + { + typedef typename _Alloc::template rebind<_Rb_tree_node<_Val> >::other + _Node_allocator; + + protected: + typedef _Rb_tree_node_base* _Base_ptr; + typedef const _Rb_tree_node_base* _Const_Base_ptr; + + public: + typedef _Key key_type; + typedef _Val value_type; + typedef value_type* pointer; + typedef const value_type* const_pointer; + typedef value_type& reference; + typedef const value_type& const_reference; + typedef _Rb_tree_node<_Val>* _Link_type; + typedef const _Rb_tree_node<_Val>* _Const_Link_type; + typedef size_t size_type; + typedef ptrdiff_t difference_type; + typedef _Alloc allocator_type; + + _Node_allocator& + _M_get_Node_allocator() + { return *static_cast<_Node_allocator*>(&this->_M_impl); } + + const _Node_allocator& + _M_get_Node_allocator() const + { return *static_cast(&this->_M_impl); } + + allocator_type + get_allocator() const + { return allocator_type(_M_get_Node_allocator()); } + + protected: + _Link_type + _M_get_node() + { return _M_impl._Node_allocator::allocate(1); } + + void + _M_put_node(_Link_type __p) + { _M_impl._Node_allocator::deallocate(__p, 1); } + +#ifndef __GXX_EXPERIMENTAL_CXX0X__ + _Link_type + _M_create_node(const value_type& __x) + { + _Link_type __tmp = _M_get_node(); + __try + { get_allocator().construct(&__tmp->_M_value_field, __x); } + __catch(...) + { + _M_put_node(__tmp); + __throw_exception_again; + } + return __tmp; + } + + void + _M_destroy_node(_Link_type __p) + { + get_allocator().destroy(&__p->_M_value_field); + _M_put_node(__p); + } +#else + template + _Link_type + _M_create_node(_Args&&... __args) + { + _Link_type __tmp = _M_get_node(); + __try + { + _M_get_Node_allocator().construct(__tmp, + std::forward<_Args>(__args)...); + } + __catch(...) + { + _M_put_node(__tmp); + __throw_exception_again; + } + return __tmp; + } + + void + _M_destroy_node(_Link_type __p) + { + _M_get_Node_allocator().destroy(__p); + _M_put_node(__p); + } +#endif + + _Link_type + _M_clone_node(_Const_Link_type __x) + { + _Link_type __tmp = _M_create_node(__x->_M_value_field); + __tmp->_M_color = __x->_M_color; + __tmp->_M_left = 0; + __tmp->_M_right = 0; + return __tmp; + } + + protected: + template + struct _Rb_tree_impl : public _Node_allocator + { + _Key_compare _M_key_compare; + _Rb_tree_node_base _M_header; + size_type _M_node_count; // Keeps track of size of tree. + + _Rb_tree_impl() + : _Node_allocator(), _M_key_compare(), _M_header(), + _M_node_count(0) + { _M_initialize(); } + + _Rb_tree_impl(const _Key_compare& __comp, const _Node_allocator& __a) + : _Node_allocator(__a), _M_key_compare(__comp), _M_header(), + _M_node_count(0) + { _M_initialize(); } + + private: + void + _M_initialize() + { + this->_M_header._M_color = _S_red; + this->_M_header._M_parent = 0; + this->_M_header._M_left = &this->_M_header; + this->_M_header._M_right = &this->_M_header; + } + }; + + _Rb_tree_impl<_Compare> _M_impl; + + protected: + _Base_ptr& + _M_root() + { return this->_M_impl._M_header._M_parent; } + + _Const_Base_ptr + _M_root() const + { return this->_M_impl._M_header._M_parent; } + + _Base_ptr& + _M_leftmost() + { return this->_M_impl._M_header._M_left; } + + _Const_Base_ptr + _M_leftmost() const + { return this->_M_impl._M_header._M_left; } + + _Base_ptr& + _M_rightmost() + { return this->_M_impl._M_header._M_right; } + + _Const_Base_ptr + _M_rightmost() const + { return this->_M_impl._M_header._M_right; } + + _Link_type + _M_begin() + { return static_cast<_Link_type>(this->_M_impl._M_header._M_parent); } + + _Const_Link_type + _M_begin() const + { + return static_cast<_Const_Link_type> + (this->_M_impl._M_header._M_parent); + } + + _Link_type + _M_end() + { return static_cast<_Link_type>(&this->_M_impl._M_header); } + + _Const_Link_type + _M_end() const + { return static_cast<_Const_Link_type>(&this->_M_impl._M_header); } + + static const_reference + _S_value(_Const_Link_type __x) + { return __x->_M_value_field; } + + static const _Key& + _S_key(_Const_Link_type __x) + { return _KeyOfValue()(_S_value(__x)); } + + static _Link_type + _S_left(_Base_ptr __x) + { return static_cast<_Link_type>(__x->_M_left); } + + static _Const_Link_type + _S_left(_Const_Base_ptr __x) + { return static_cast<_Const_Link_type>(__x->_M_left); } + + static _Link_type + _S_right(_Base_ptr __x) + { return static_cast<_Link_type>(__x->_M_right); } + + static _Const_Link_type + _S_right(_Const_Base_ptr __x) + { return static_cast<_Const_Link_type>(__x->_M_right); } + + static const_reference + _S_value(_Const_Base_ptr __x) + { return static_cast<_Const_Link_type>(__x)->_M_value_field; } + + static const _Key& + _S_key(_Const_Base_ptr __x) + { return _KeyOfValue()(_S_value(__x)); } + + static _Base_ptr + _S_minimum(_Base_ptr __x) + { return _Rb_tree_node_base::_S_minimum(__x); } + + static _Const_Base_ptr + _S_minimum(_Const_Base_ptr __x) + { return _Rb_tree_node_base::_S_minimum(__x); } + + static _Base_ptr + _S_maximum(_Base_ptr __x) + { return _Rb_tree_node_base::_S_maximum(__x); } + + static _Const_Base_ptr + _S_maximum(_Const_Base_ptr __x) + { return _Rb_tree_node_base::_S_maximum(__x); } + + public: + typedef _Rb_tree_iterator iterator; + typedef _Rb_tree_const_iterator const_iterator; + + typedef std::reverse_iterator reverse_iterator; + typedef std::reverse_iterator const_reverse_iterator; + + private: + iterator + _M_insert_(_Const_Base_ptr __x, _Const_Base_ptr __y, + const value_type& __v); + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 233. Insertion hints in associative containers. + iterator + _M_insert_lower(_Base_ptr __x, _Base_ptr __y, const value_type& __v); + + iterator + _M_insert_equal_lower(const value_type& __x); + + _Link_type + _M_copy(_Const_Link_type __x, _Link_type __p); + + void + _M_erase(_Link_type __x); + + iterator + _M_lower_bound(_Link_type __x, _Link_type __y, + const _Key& __k); + + const_iterator + _M_lower_bound(_Const_Link_type __x, _Const_Link_type __y, + const _Key& __k) const; + + iterator + _M_upper_bound(_Link_type __x, _Link_type __y, + const _Key& __k); + + const_iterator + _M_upper_bound(_Const_Link_type __x, _Const_Link_type __y, + const _Key& __k) const; + + public: + // allocation/deallocation + _Rb_tree() { } + + _Rb_tree(const _Compare& __comp, + const allocator_type& __a = allocator_type()) + : _M_impl(__comp, __a) { } + + _Rb_tree(const _Rb_tree& __x) + : _M_impl(__x._M_impl._M_key_compare, __x._M_get_Node_allocator()) + { + if (__x._M_root() != 0) + { + _M_root() = _M_copy(__x._M_begin(), _M_end()); + _M_leftmost() = _S_minimum(_M_root()); + _M_rightmost() = _S_maximum(_M_root()); + _M_impl._M_node_count = __x._M_impl._M_node_count; + } + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + _Rb_tree(_Rb_tree&& __x); +#endif + + ~_Rb_tree() + { _M_erase(_M_begin()); } + + _Rb_tree& + operator=(const _Rb_tree& __x); + + // Accessors. + _Compare + key_comp() const + { return _M_impl._M_key_compare; } + + iterator + begin() + { + return iterator(static_cast<_Link_type> + (this->_M_impl._M_header._M_left)); + } + + const_iterator + begin() const + { + return const_iterator(static_cast<_Const_Link_type> + (this->_M_impl._M_header._M_left)); + } + + iterator + end() + { return iterator(static_cast<_Link_type>(&this->_M_impl._M_header)); } + + const_iterator + end() const + { + return const_iterator(static_cast<_Const_Link_type> + (&this->_M_impl._M_header)); + } + + reverse_iterator + rbegin() + { return reverse_iterator(end()); } + + const_reverse_iterator + rbegin() const + { return const_reverse_iterator(end()); } + + reverse_iterator + rend() + { return reverse_iterator(begin()); } + + const_reverse_iterator + rend() const + { return const_reverse_iterator(begin()); } + + bool + empty() const + { return _M_impl._M_node_count == 0; } + + size_type + size() const + { return _M_impl._M_node_count; } + + size_type + max_size() const + { return _M_get_Node_allocator().max_size(); } + + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + swap(_Rb_tree&& __t); +#else + swap(_Rb_tree& __t); +#endif + + // Insert/erase. + pair + _M_insert_unique(const value_type& __x); + + iterator + _M_insert_equal(const value_type& __x); + + iterator + _M_insert_unique_(const_iterator __position, const value_type& __x); + + iterator + _M_insert_equal_(const_iterator __position, const value_type& __x); + + template + void + _M_insert_unique(_InputIterator __first, _InputIterator __last); + + template + void + _M_insert_equal(_InputIterator __first, _InputIterator __last); + + void + erase(iterator __position); + + void + erase(const_iterator __position); + + size_type + erase(const key_type& __x); + + void + erase(iterator __first, iterator __last); + + void + erase(const_iterator __first, const_iterator __last); + + void + erase(const key_type* __first, const key_type* __last); + + void + clear() + { + _M_erase(_M_begin()); + _M_leftmost() = _M_end(); + _M_root() = 0; + _M_rightmost() = _M_end(); + _M_impl._M_node_count = 0; + } + + // Set operations. + iterator + find(const key_type& __k); + + const_iterator + find(const key_type& __k) const; + + size_type + count(const key_type& __k) const; + + iterator + lower_bound(const key_type& __k) + { return _M_lower_bound(_M_begin(), _M_end(), __k); } + + const_iterator + lower_bound(const key_type& __k) const + { return _M_lower_bound(_M_begin(), _M_end(), __k); } + + iterator + upper_bound(const key_type& __k) + { return _M_upper_bound(_M_begin(), _M_end(), __k); } + + const_iterator + upper_bound(const key_type& __k) const + { return _M_upper_bound(_M_begin(), _M_end(), __k); } + + pair + equal_range(const key_type& __k); + + pair + equal_range(const key_type& __k) const; + + // Debugging. + bool + __rb_verify() const; + }; + + template + inline bool + operator==(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, + const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) + { + return __x.size() == __y.size() + && std::equal(__x.begin(), __x.end(), __y.begin()); + } + + template + inline bool + operator<(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, + const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) + { + return std::lexicographical_compare(__x.begin(), __x.end(), + __y.begin(), __y.end()); + } + + template + inline bool + operator!=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, + const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) + { return !(__x == __y); } + + template + inline bool + operator>(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, + const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) + { return __y < __x; } + + template + inline bool + operator<=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, + const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) + { return !(__y < __x); } + + template + inline bool + operator>=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, + const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) + { return !(__x < __y); } + + template + inline void + swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) + { __x.swap(__y); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + _Rb_tree(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&& __x) + : _M_impl(__x._M_impl._M_key_compare, __x._M_get_Node_allocator()) + { + if (__x._M_root() != 0) + { + _M_root() = __x._M_root(); + _M_leftmost() = __x._M_leftmost(); + _M_rightmost() = __x._M_rightmost(); + _M_root()->_M_parent = _M_end(); + + __x._M_root() = 0; + __x._M_leftmost() = __x._M_end(); + __x._M_rightmost() = __x._M_end(); + + this->_M_impl._M_node_count = __x._M_impl._M_node_count; + __x._M_impl._M_node_count = 0; + } + } +#endif + + template + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + operator=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x) + { + if (this != &__x) + { + // Note that _Key may be a constant type. + clear(); + _M_impl._M_key_compare = __x._M_impl._M_key_compare; + if (__x._M_root() != 0) + { + _M_root() = _M_copy(__x._M_begin(), _M_end()); + _M_leftmost() = _S_minimum(_M_root()); + _M_rightmost() = _S_maximum(_M_root()); + _M_impl._M_node_count = __x._M_impl._M_node_count; + } + } + return *this; + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + _M_insert_(_Const_Base_ptr __x, _Const_Base_ptr __p, const _Val& __v) + { + bool __insert_left = (__x != 0 || __p == _M_end() + || _M_impl._M_key_compare(_KeyOfValue()(__v), + _S_key(__p))); + + _Link_type __z = _M_create_node(__v); + + _Rb_tree_insert_and_rebalance(__insert_left, __z, + const_cast<_Base_ptr>(__p), + this->_M_impl._M_header); + ++_M_impl._M_node_count; + return iterator(__z); + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + _M_insert_lower(_Base_ptr __x, _Base_ptr __p, const _Val& __v) + { + bool __insert_left = (__x != 0 || __p == _M_end() + || !_M_impl._M_key_compare(_S_key(__p), + _KeyOfValue()(__v))); + + _Link_type __z = _M_create_node(__v); + + _Rb_tree_insert_and_rebalance(__insert_left, __z, __p, + this->_M_impl._M_header); + ++_M_impl._M_node_count; + return iterator(__z); + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + _M_insert_equal_lower(const _Val& __v) + { + _Link_type __x = _M_begin(); + _Link_type __y = _M_end(); + while (__x != 0) + { + __y = __x; + __x = !_M_impl._M_key_compare(_S_key(__x), _KeyOfValue()(__v)) ? + _S_left(__x) : _S_right(__x); + } + return _M_insert_lower(__x, __y, __v); + } + + template + typename _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::_Link_type + _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>:: + _M_copy(_Const_Link_type __x, _Link_type __p) + { + // Structural copy. __x and __p must be non-null. + _Link_type __top = _M_clone_node(__x); + __top->_M_parent = __p; + + __try + { + if (__x->_M_right) + __top->_M_right = _M_copy(_S_right(__x), __top); + __p = __top; + __x = _S_left(__x); + + while (__x != 0) + { + _Link_type __y = _M_clone_node(__x); + __p->_M_left = __y; + __y->_M_parent = __p; + if (__x->_M_right) + __y->_M_right = _M_copy(_S_right(__x), __y); + __p = __y; + __x = _S_left(__x); + } + } + __catch(...) + { + _M_erase(__top); + __throw_exception_again; + } + return __top; + } + + template + void + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + _M_erase(_Link_type __x) + { + // Erase without rebalancing. + while (__x != 0) + { + _M_erase(_S_right(__x)); + _Link_type __y = _S_left(__x); + _M_destroy_node(__x); + __x = __y; + } + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, + _Compare, _Alloc>::iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + _M_lower_bound(_Link_type __x, _Link_type __y, + const _Key& __k) + { + while (__x != 0) + if (!_M_impl._M_key_compare(_S_key(__x), __k)) + __y = __x, __x = _S_left(__x); + else + __x = _S_right(__x); + return iterator(__y); + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, + _Compare, _Alloc>::const_iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + _M_lower_bound(_Const_Link_type __x, _Const_Link_type __y, + const _Key& __k) const + { + while (__x != 0) + if (!_M_impl._M_key_compare(_S_key(__x), __k)) + __y = __x, __x = _S_left(__x); + else + __x = _S_right(__x); + return const_iterator(__y); + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, + _Compare, _Alloc>::iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + _M_upper_bound(_Link_type __x, _Link_type __y, + const _Key& __k) + { + while (__x != 0) + if (_M_impl._M_key_compare(__k, _S_key(__x))) + __y = __x, __x = _S_left(__x); + else + __x = _S_right(__x); + return iterator(__y); + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, + _Compare, _Alloc>::const_iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + _M_upper_bound(_Const_Link_type __x, _Const_Link_type __y, + const _Key& __k) const + { + while (__x != 0) + if (_M_impl._M_key_compare(__k, _S_key(__x))) + __y = __x, __x = _S_left(__x); + else + __x = _S_right(__x); + return const_iterator(__y); + } + + template + pair::iterator, + typename _Rb_tree<_Key, _Val, _KeyOfValue, + _Compare, _Alloc>::iterator> + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + equal_range(const _Key& __k) + { + _Link_type __x = _M_begin(); + _Link_type __y = _M_end(); + while (__x != 0) + { + if (_M_impl._M_key_compare(_S_key(__x), __k)) + __x = _S_right(__x); + else if (_M_impl._M_key_compare(__k, _S_key(__x))) + __y = __x, __x = _S_left(__x); + else + { + _Link_type __xu(__x), __yu(__y); + __y = __x, __x = _S_left(__x); + __xu = _S_right(__xu); + return pair(_M_lower_bound(__x, __y, __k), + _M_upper_bound(__xu, __yu, __k)); + } + } + return pair(iterator(__y), + iterator(__y)); + } + + template + pair::const_iterator, + typename _Rb_tree<_Key, _Val, _KeyOfValue, + _Compare, _Alloc>::const_iterator> + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + equal_range(const _Key& __k) const + { + _Const_Link_type __x = _M_begin(); + _Const_Link_type __y = _M_end(); + while (__x != 0) + { + if (_M_impl._M_key_compare(_S_key(__x), __k)) + __x = _S_right(__x); + else if (_M_impl._M_key_compare(__k, _S_key(__x))) + __y = __x, __x = _S_left(__x); + else + { + _Const_Link_type __xu(__x), __yu(__y); + __y = __x, __x = _S_left(__x); + __xu = _S_right(__xu); + return pair(_M_lower_bound(__x, __y, __k), + _M_upper_bound(__xu, __yu, __k)); + } + } + return pair(const_iterator(__y), + const_iterator(__y)); + } + + template + void + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&& __t) +#else + swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __t) +#endif + { + if (_M_root() == 0) + { + if (__t._M_root() != 0) + { + _M_root() = __t._M_root(); + _M_leftmost() = __t._M_leftmost(); + _M_rightmost() = __t._M_rightmost(); + _M_root()->_M_parent = _M_end(); + + __t._M_root() = 0; + __t._M_leftmost() = __t._M_end(); + __t._M_rightmost() = __t._M_end(); + } + } + else if (__t._M_root() == 0) + { + __t._M_root() = _M_root(); + __t._M_leftmost() = _M_leftmost(); + __t._M_rightmost() = _M_rightmost(); + __t._M_root()->_M_parent = __t._M_end(); + + _M_root() = 0; + _M_leftmost() = _M_end(); + _M_rightmost() = _M_end(); + } + else + { + std::swap(_M_root(),__t._M_root()); + std::swap(_M_leftmost(),__t._M_leftmost()); + std::swap(_M_rightmost(),__t._M_rightmost()); + + _M_root()->_M_parent = _M_end(); + __t._M_root()->_M_parent = __t._M_end(); + } + // No need to swap header's color as it does not change. + std::swap(this->_M_impl._M_node_count, __t._M_impl._M_node_count); + std::swap(this->_M_impl._M_key_compare, __t._M_impl._M_key_compare); + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 431. Swapping containers with unequal allocators. + std::__alloc_swap<_Node_allocator>:: + _S_do_it(_M_get_Node_allocator(), __t._M_get_Node_allocator()); + } + + template + pair::iterator, bool> + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + _M_insert_unique(const _Val& __v) + { + _Link_type __x = _M_begin(); + _Link_type __y = _M_end(); + bool __comp = true; + while (__x != 0) + { + __y = __x; + __comp = _M_impl._M_key_compare(_KeyOfValue()(__v), _S_key(__x)); + __x = __comp ? _S_left(__x) : _S_right(__x); + } + iterator __j = iterator(__y); + if (__comp) + { + if (__j == begin()) + return pair(_M_insert_(__x, __y, __v), true); + else + --__j; + } + if (_M_impl._M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__v))) + return pair(_M_insert_(__x, __y, __v), true); + return pair(__j, false); + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + _M_insert_equal(const _Val& __v) + { + _Link_type __x = _M_begin(); + _Link_type __y = _M_end(); + while (__x != 0) + { + __y = __x; + __x = _M_impl._M_key_compare(_KeyOfValue()(__v), _S_key(__x)) ? + _S_left(__x) : _S_right(__x); + } + return _M_insert_(__x, __y, __v); + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + _M_insert_unique_(const_iterator __position, const _Val& __v) + { + // end() + if (__position._M_node == _M_end()) + { + if (size() > 0 + && _M_impl._M_key_compare(_S_key(_M_rightmost()), + _KeyOfValue()(__v))) + return _M_insert_(0, _M_rightmost(), __v); + else + return _M_insert_unique(__v).first; + } + else if (_M_impl._M_key_compare(_KeyOfValue()(__v), + _S_key(__position._M_node))) + { + // First, try before... + const_iterator __before = __position; + if (__position._M_node == _M_leftmost()) // begin() + return _M_insert_(_M_leftmost(), _M_leftmost(), __v); + else if (_M_impl._M_key_compare(_S_key((--__before)._M_node), + _KeyOfValue()(__v))) + { + if (_S_right(__before._M_node) == 0) + return _M_insert_(0, __before._M_node, __v); + else + return _M_insert_(__position._M_node, + __position._M_node, __v); + } + else + return _M_insert_unique(__v).first; + } + else if (_M_impl._M_key_compare(_S_key(__position._M_node), + _KeyOfValue()(__v))) + { + // ... then try after. + const_iterator __after = __position; + if (__position._M_node == _M_rightmost()) + return _M_insert_(0, _M_rightmost(), __v); + else if (_M_impl._M_key_compare(_KeyOfValue()(__v), + _S_key((++__after)._M_node))) + { + if (_S_right(__position._M_node) == 0) + return _M_insert_(0, __position._M_node, __v); + else + return _M_insert_(__after._M_node, __after._M_node, __v); + } + else + return _M_insert_unique(__v).first; + } + else + // Equivalent keys. + return iterator(static_cast<_Link_type> + (const_cast<_Base_ptr>(__position._M_node))); + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + _M_insert_equal_(const_iterator __position, const _Val& __v) + { + // end() + if (__position._M_node == _M_end()) + { + if (size() > 0 + && !_M_impl._M_key_compare(_KeyOfValue()(__v), + _S_key(_M_rightmost()))) + return _M_insert_(0, _M_rightmost(), __v); + else + return _M_insert_equal(__v); + } + else if (!_M_impl._M_key_compare(_S_key(__position._M_node), + _KeyOfValue()(__v))) + { + // First, try before... + const_iterator __before = __position; + if (__position._M_node == _M_leftmost()) // begin() + return _M_insert_(_M_leftmost(), _M_leftmost(), __v); + else if (!_M_impl._M_key_compare(_KeyOfValue()(__v), + _S_key((--__before)._M_node))) + { + if (_S_right(__before._M_node) == 0) + return _M_insert_(0, __before._M_node, __v); + else + return _M_insert_(__position._M_node, + __position._M_node, __v); + } + else + return _M_insert_equal(__v); + } + else + { + // ... then try after. + const_iterator __after = __position; + if (__position._M_node == _M_rightmost()) + return _M_insert_(0, _M_rightmost(), __v); + else if (!_M_impl._M_key_compare(_S_key((++__after)._M_node), + _KeyOfValue()(__v))) + { + if (_S_right(__position._M_node) == 0) + return _M_insert_(0, __position._M_node, __v); + else + return _M_insert_(__after._M_node, __after._M_node, __v); + } + else + return _M_insert_equal_lower(__v); + } + } + + template + template + void + _Rb_tree<_Key, _Val, _KoV, _Cmp, _Alloc>:: + _M_insert_unique(_II __first, _II __last) + { + for (; __first != __last; ++__first) + _M_insert_unique_(end(), *__first); + } + + template + template + void + _Rb_tree<_Key, _Val, _KoV, _Cmp, _Alloc>:: + _M_insert_equal(_II __first, _II __last) + { + for (; __first != __last; ++__first) + _M_insert_equal_(end(), *__first); + } + + template + inline void + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + erase(iterator __position) + { + _Link_type __y = + static_cast<_Link_type>(_Rb_tree_rebalance_for_erase + (__position._M_node, + this->_M_impl._M_header)); + _M_destroy_node(__y); + --_M_impl._M_node_count; + } + + template + inline void + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + erase(const_iterator __position) + { + _Link_type __y = + static_cast<_Link_type>(_Rb_tree_rebalance_for_erase + (const_cast<_Base_ptr>(__position._M_node), + this->_M_impl._M_header)); + _M_destroy_node(__y); + --_M_impl._M_node_count; + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::size_type + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + erase(const _Key& __x) + { + pair __p = equal_range(__x); + const size_type __old_size = size(); + erase(__p.first, __p.second); + return __old_size - size(); + } + + template + void + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + erase(iterator __first, iterator __last) + { + if (__first == begin() && __last == end()) + clear(); + else + while (__first != __last) + erase(__first++); + } + + template + void + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + erase(const_iterator __first, const_iterator __last) + { + if (__first == begin() && __last == end()) + clear(); + else + while (__first != __last) + erase(__first++); + } + + template + void + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + erase(const _Key* __first, const _Key* __last) + { + while (__first != __last) + erase(*__first++); + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, + _Compare, _Alloc>::iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + find(const _Key& __k) + { + iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k); + return (__j == end() + || _M_impl._M_key_compare(__k, + _S_key(__j._M_node))) ? end() : __j; + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, + _Compare, _Alloc>::const_iterator + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + find(const _Key& __k) const + { + const_iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k); + return (__j == end() + || _M_impl._M_key_compare(__k, + _S_key(__j._M_node))) ? end() : __j; + } + + template + typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::size_type + _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: + count(const _Key& __k) const + { + pair __p = equal_range(__k); + const size_type __n = std::distance(__p.first, __p.second); + return __n; + } + + unsigned int + _Rb_tree_black_count(const _Rb_tree_node_base* __node, + const _Rb_tree_node_base* __root); + + template + bool + _Rb_tree<_Key,_Val,_KeyOfValue,_Compare,_Alloc>::__rb_verify() const + { + if (_M_impl._M_node_count == 0 || begin() == end()) + return _M_impl._M_node_count == 0 && begin() == end() + && this->_M_impl._M_header._M_left == _M_end() + && this->_M_impl._M_header._M_right == _M_end(); + + unsigned int __len = _Rb_tree_black_count(_M_leftmost(), _M_root()); + for (const_iterator __it = begin(); __it != end(); ++__it) + { + _Const_Link_type __x = static_cast<_Const_Link_type>(__it._M_node); + _Const_Link_type __L = _S_left(__x); + _Const_Link_type __R = _S_right(__x); + + if (__x->_M_color == _S_red) + if ((__L && __L->_M_color == _S_red) + || (__R && __R->_M_color == _S_red)) + return false; + + if (__L && _M_impl._M_key_compare(_S_key(__x), _S_key(__L))) + return false; + if (__R && _M_impl._M_key_compare(_S_key(__R), _S_key(__x))) + return false; + + if (!__L && !__R && _Rb_tree_black_count(__x, _M_root()) != __len) + return false; + } + + if (_M_leftmost() != _Rb_tree_node_base::_S_minimum(_M_root())) + return false; + if (_M_rightmost() != _Rb_tree_node_base::_S_maximum(_M_root())) + return false; + return true; + } + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_uninitialized.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_uninitialized.h new file mode 100644 index 00000000..11a66c7a --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_uninitialized.h @@ -0,0 +1,478 @@ +// Raw memory manipulators -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996,1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_uninitialized.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_UNINITIALIZED_H +#define _STL_UNINITIALIZED_H 1 + +_GLIBCXX_BEGIN_NAMESPACE(std) + + template + struct __uninitialized_copy + { + template + static _ForwardIterator + uninitialized_copy(_InputIterator __first, _InputIterator __last, + _ForwardIterator __result) + { + _ForwardIterator __cur = __result; + __try + { + for (; __first != __last; ++__first, ++__cur) + ::new(static_cast(&*__cur)) typename + iterator_traits<_ForwardIterator>::value_type(*__first); + return __cur; + } + __catch(...) + { + std::_Destroy(__result, __cur); + __throw_exception_again; + } + } + }; + + template<> + struct __uninitialized_copy + { + template + static _ForwardIterator + uninitialized_copy(_InputIterator __first, _InputIterator __last, + _ForwardIterator __result) + { return std::copy(__first, __last, __result); } + }; + + /** + * @brief Copies the range [first,last) into result. + * @param first An input iterator. + * @param last An input iterator. + * @param result An output iterator. + * @return result + (first - last) + * + * Like copy(), but does not require an initialized output range. + */ + template + inline _ForwardIterator + uninitialized_copy(_InputIterator __first, _InputIterator __last, + _ForwardIterator __result) + { + typedef typename iterator_traits<_InputIterator>::value_type + _ValueType1; + typedef typename iterator_traits<_ForwardIterator>::value_type + _ValueType2; + + return std::__uninitialized_copy<(__is_pod(_ValueType1) + && __is_pod(_ValueType2))>:: + uninitialized_copy(__first, __last, __result); + } + + + template + struct __uninitialized_fill + { + template + static void + uninitialized_fill(_ForwardIterator __first, + _ForwardIterator __last, const _Tp& __x) + { + _ForwardIterator __cur = __first; + __try + { + for (; __cur != __last; ++__cur) + std::_Construct(&*__cur, __x); + } + __catch(...) + { + std::_Destroy(__first, __cur); + __throw_exception_again; + } + } + }; + + template<> + struct __uninitialized_fill + { + template + static void + uninitialized_fill(_ForwardIterator __first, + _ForwardIterator __last, const _Tp& __x) + { std::fill(__first, __last, __x); } + }; + + /** + * @brief Copies the value x into the range [first,last). + * @param first An input iterator. + * @param last An input iterator. + * @param x The source value. + * @return Nothing. + * + * Like fill(), but does not require an initialized output range. + */ + template + inline void + uninitialized_fill(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __x) + { + typedef typename iterator_traits<_ForwardIterator>::value_type + _ValueType; + + std::__uninitialized_fill<__is_pod(_ValueType)>:: + uninitialized_fill(__first, __last, __x); + } + + + template + struct __uninitialized_fill_n + { + template + static void + uninitialized_fill_n(_ForwardIterator __first, _Size __n, + const _Tp& __x) + { + _ForwardIterator __cur = __first; + __try + { + for (; __n > 0; --__n, ++__cur) + std::_Construct(&*__cur, __x); + } + __catch(...) + { + std::_Destroy(__first, __cur); + __throw_exception_again; + } + } + }; + + template<> + struct __uninitialized_fill_n + { + template + static void + uninitialized_fill_n(_ForwardIterator __first, _Size __n, + const _Tp& __x) + { std::fill_n(__first, __n, __x); } + }; + + /** + * @brief Copies the value x into the range [first,first+n). + * @param first An input iterator. + * @param n The number of copies to make. + * @param x The source value. + * @return Nothing. + * + * Like fill_n(), but does not require an initialized output range. + */ + template + inline void + uninitialized_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x) + { + typedef typename iterator_traits<_ForwardIterator>::value_type + _ValueType; + + std::__uninitialized_fill_n<__is_pod(_ValueType)>:: + uninitialized_fill_n(__first, __n, __x); + } + + // Extensions: versions of uninitialized_copy, uninitialized_fill, + // and uninitialized_fill_n that take an allocator parameter. + // We dispatch back to the standard versions when we're given the + // default allocator. For nondefault allocators we do not use + // any of the POD optimizations. + + template + _ForwardIterator + __uninitialized_copy_a(_InputIterator __first, _InputIterator __last, + _ForwardIterator __result, _Allocator& __alloc) + { + _ForwardIterator __cur = __result; + __try + { + for (; __first != __last; ++__first, ++__cur) + __alloc.construct(&*__cur, *__first); + return __cur; + } + __catch(...) + { + std::_Destroy(__result, __cur, __alloc); + __throw_exception_again; + } + } + + template + inline _ForwardIterator + __uninitialized_copy_a(_InputIterator __first, _InputIterator __last, + _ForwardIterator __result, allocator<_Tp>&) + { return std::uninitialized_copy(__first, __last, __result); } + + template + inline _ForwardIterator + __uninitialized_move_a(_InputIterator __first, _InputIterator __last, + _ForwardIterator __result, _Allocator& __alloc) + { + return std::__uninitialized_copy_a(_GLIBCXX_MAKE_MOVE_ITERATOR(__first), + _GLIBCXX_MAKE_MOVE_ITERATOR(__last), + __result, __alloc); + } + + template + void + __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __x, _Allocator& __alloc) + { + _ForwardIterator __cur = __first; + __try + { + for (; __cur != __last; ++__cur) + __alloc.construct(&*__cur, __x); + } + __catch(...) + { + std::_Destroy(__first, __cur, __alloc); + __throw_exception_again; + } + } + + template + inline void + __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __x, allocator<_Tp2>&) + { std::uninitialized_fill(__first, __last, __x); } + + template + void + __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n, + const _Tp& __x, _Allocator& __alloc) + { + _ForwardIterator __cur = __first; + __try + { + for (; __n > 0; --__n, ++__cur) + __alloc.construct(&*__cur, __x); + } + __catch(...) + { + std::_Destroy(__first, __cur, __alloc); + __throw_exception_again; + } + } + + template + inline void + __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n, + const _Tp& __x, allocator<_Tp2>&) + { std::uninitialized_fill_n(__first, __n, __x); } + + + // Extensions: __uninitialized_copy_move, __uninitialized_move_copy, + // __uninitialized_fill_move, __uninitialized_move_fill. + // All of these algorithms take a user-supplied allocator, which is used + // for construction and destruction. + + // __uninitialized_copy_move + // Copies [first1, last1) into [result, result + (last1 - first1)), and + // move [first2, last2) into + // [result, result + (last1 - first1) + (last2 - first2)). + template + inline _ForwardIterator + __uninitialized_copy_move(_InputIterator1 __first1, + _InputIterator1 __last1, + _InputIterator2 __first2, + _InputIterator2 __last2, + _ForwardIterator __result, + _Allocator& __alloc) + { + _ForwardIterator __mid = std::__uninitialized_copy_a(__first1, __last1, + __result, + __alloc); + __try + { + return std::__uninitialized_move_a(__first2, __last2, __mid, __alloc); + } + __catch(...) + { + std::_Destroy(__result, __mid, __alloc); + __throw_exception_again; + } + } + + // __uninitialized_move_copy + // Moves [first1, last1) into [result, result + (last1 - first1)), and + // copies [first2, last2) into + // [result, result + (last1 - first1) + (last2 - first2)). + template + inline _ForwardIterator + __uninitialized_move_copy(_InputIterator1 __first1, + _InputIterator1 __last1, + _InputIterator2 __first2, + _InputIterator2 __last2, + _ForwardIterator __result, + _Allocator& __alloc) + { + _ForwardIterator __mid = std::__uninitialized_move_a(__first1, __last1, + __result, + __alloc); + __try + { + return std::__uninitialized_copy_a(__first2, __last2, __mid, __alloc); + } + __catch(...) + { + std::_Destroy(__result, __mid, __alloc); + __throw_exception_again; + } + } + + // __uninitialized_fill_move + // Fills [result, mid) with x, and moves [first, last) into + // [mid, mid + (last - first)). + template + inline _ForwardIterator + __uninitialized_fill_move(_ForwardIterator __result, _ForwardIterator __mid, + const _Tp& __x, _InputIterator __first, + _InputIterator __last, _Allocator& __alloc) + { + std::__uninitialized_fill_a(__result, __mid, __x, __alloc); + __try + { + return std::__uninitialized_move_a(__first, __last, __mid, __alloc); + } + __catch(...) + { + std::_Destroy(__result, __mid, __alloc); + __throw_exception_again; + } + } + + // __uninitialized_move_fill + // Moves [first1, last1) into [first2, first2 + (last1 - first1)), and + // fills [first2 + (last1 - first1), last2) with x. + template + inline void + __uninitialized_move_fill(_InputIterator __first1, _InputIterator __last1, + _ForwardIterator __first2, + _ForwardIterator __last2, const _Tp& __x, + _Allocator& __alloc) + { + _ForwardIterator __mid2 = std::__uninitialized_move_a(__first1, __last1, + __first2, + __alloc); + __try + { + std::__uninitialized_fill_a(__mid2, __last2, __x, __alloc); + } + __catch(...) + { + std::_Destroy(__first2, __mid2, __alloc); + __throw_exception_again; + } + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + _ForwardIterator + __uninitialized_copy_n(_InputIterator __first, _Size __n, + _ForwardIterator __result, input_iterator_tag) + { + _ForwardIterator __cur = __result; + __try + { + for (; __n > 0; --__n, ++__first, ++__cur) + ::new(static_cast(&*__cur)) typename + iterator_traits<_ForwardIterator>::value_type(*__first); + return __cur; + } + __catch(...) + { + std::_Destroy(__result, __cur); + __throw_exception_again; + } + } + + template + inline _ForwardIterator + __uninitialized_copy_n(_RandomAccessIterator __first, _Size __n, + _ForwardIterator __result, + random_access_iterator_tag) + { return std::uninitialized_copy(__first, __first + __n, __result); } + + /** + * @brief Copies the range [first,first+n) into result. + * @param first An input iterator. + * @param n The number of elements to copy. + * @param result An output iterator. + * @return result + n + * + * Like copy_n(), but does not require an initialized output range. + */ + template + inline _ForwardIterator + uninitialized_copy_n(_InputIterator __first, _Size __n, + _ForwardIterator __result) + { return std::__uninitialized_copy_n(__first, __n, __result, + std::__iterator_category(__first)); } +#endif + +_GLIBCXX_END_NAMESPACE + +#endif /* _STL_UNINITIALIZED_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_vector.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_vector.h new file mode 100644 index 00000000..9af983d4 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stl_vector.h @@ -0,0 +1,1233 @@ +// Vector implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file stl_vector.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STL_VECTOR_H +#define _STL_VECTOR_H 1 + +#include +#include +#include +#include + +_GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D) + + /// See bits/stl_deque.h's _Deque_base for an explanation. + template + struct _Vector_base + { + typedef typename _Alloc::template rebind<_Tp>::other _Tp_alloc_type; + + struct _Vector_impl + : public _Tp_alloc_type + { + typename _Tp_alloc_type::pointer _M_start; + typename _Tp_alloc_type::pointer _M_finish; + typename _Tp_alloc_type::pointer _M_end_of_storage; + + _Vector_impl() + : _Tp_alloc_type(), _M_start(0), _M_finish(0), _M_end_of_storage(0) + { } + + _Vector_impl(_Tp_alloc_type const& __a) + : _Tp_alloc_type(__a), _M_start(0), _M_finish(0), _M_end_of_storage(0) + { } + }; + + public: + typedef _Alloc allocator_type; + + _Tp_alloc_type& + _M_get_Tp_allocator() + { return *static_cast<_Tp_alloc_type*>(&this->_M_impl); } + + const _Tp_alloc_type& + _M_get_Tp_allocator() const + { return *static_cast(&this->_M_impl); } + + allocator_type + get_allocator() const + { return allocator_type(_M_get_Tp_allocator()); } + + _Vector_base() + : _M_impl() { } + + _Vector_base(const allocator_type& __a) + : _M_impl(__a) { } + + _Vector_base(size_t __n, const allocator_type& __a) + : _M_impl(__a) + { + this->_M_impl._M_start = this->_M_allocate(__n); + this->_M_impl._M_finish = this->_M_impl._M_start; + this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n; + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + _Vector_base(_Vector_base&& __x) + : _M_impl(__x._M_get_Tp_allocator()) + { + this->_M_impl._M_start = __x._M_impl._M_start; + this->_M_impl._M_finish = __x._M_impl._M_finish; + this->_M_impl._M_end_of_storage = __x._M_impl._M_end_of_storage; + __x._M_impl._M_start = 0; + __x._M_impl._M_finish = 0; + __x._M_impl._M_end_of_storage = 0; + } +#endif + + ~_Vector_base() + { _M_deallocate(this->_M_impl._M_start, this->_M_impl._M_end_of_storage + - this->_M_impl._M_start); } + + public: + _Vector_impl _M_impl; + + typename _Tp_alloc_type::pointer + _M_allocate(size_t __n) + { return __n != 0 ? _M_impl.allocate(__n) : 0; } + + void + _M_deallocate(typename _Tp_alloc_type::pointer __p, size_t __n) + { + if (__p) + _M_impl.deallocate(__p, __n); + } + }; + + + /** + * @brief A standard container which offers fixed time access to + * individual elements in any order. + * + * @ingroup sequences + * + * Meets the requirements of a container, a + * reversible container, and a + * sequence, including the + * optional sequence requirements with the + * %exception of @c push_front and @c pop_front. + * + * In some terminology a %vector can be described as a dynamic + * C-style array, it offers fast and efficient access to individual + * elements in any order and saves the user from worrying about + * memory and size allocation. Subscripting ( @c [] ) access is + * also provided as with C-style arrays. + */ + template > + class vector : protected _Vector_base<_Tp, _Alloc> + { + // Concept requirements. + typedef typename _Alloc::value_type _Alloc_value_type; + __glibcxx_class_requires(_Tp, _SGIAssignableConcept) + __glibcxx_class_requires2(_Tp, _Alloc_value_type, _SameTypeConcept) + + typedef _Vector_base<_Tp, _Alloc> _Base; + typedef typename _Base::_Tp_alloc_type _Tp_alloc_type; + + public: + typedef _Tp value_type; + typedef typename _Tp_alloc_type::pointer pointer; + typedef typename _Tp_alloc_type::const_pointer const_pointer; + typedef typename _Tp_alloc_type::reference reference; + typedef typename _Tp_alloc_type::const_reference const_reference; + typedef __gnu_cxx::__normal_iterator iterator; + typedef __gnu_cxx::__normal_iterator + const_iterator; + typedef std::reverse_iterator const_reverse_iterator; + typedef std::reverse_iterator reverse_iterator; + typedef size_t size_type; + typedef ptrdiff_t difference_type; + typedef _Alloc allocator_type; + + protected: + using _Base::_M_allocate; + using _Base::_M_deallocate; + using _Base::_M_impl; + using _Base::_M_get_Tp_allocator; + + public: + // [23.2.4.1] construct/copy/destroy + // (assign() and get_allocator() are also listed in this section) + /** + * @brief Default constructor creates no elements. + */ + vector() + : _Base() { } + + /** + * @brief Creates a %vector with no elements. + * @param a An allocator object. + */ + explicit + vector(const allocator_type& __a) + : _Base(__a) { } + + /** + * @brief Creates a %vector with copies of an exemplar element. + * @param n The number of elements to initially create. + * @param value An element to copy. + * @param a An allocator. + * + * This constructor fills the %vector with @a n copies of @a value. + */ + explicit + vector(size_type __n, const value_type& __value = value_type(), + const allocator_type& __a = allocator_type()) + : _Base(__n, __a) + { _M_fill_initialize(__n, __value); } + + /** + * @brief %Vector copy constructor. + * @param x A %vector of identical element and allocator types. + * + * The newly-created %vector uses a copy of the allocation + * object used by @a x. All the elements of @a x are copied, + * but any extra memory in + * @a x (for fast expansion) will not be copied. + */ + vector(const vector& __x) + : _Base(__x.size(), __x._M_get_Tp_allocator()) + { this->_M_impl._M_finish = + std::__uninitialized_copy_a(__x.begin(), __x.end(), + this->_M_impl._M_start, + _M_get_Tp_allocator()); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief %Vector move constructor. + * @param x A %vector of identical element and allocator types. + * + * The newly-created %vector contains the exact contents of @a x. + * The contents of @a x are a valid, but unspecified %vector. + */ + vector(vector&& __x) + : _Base(std::forward<_Base>(__x)) { } + + /** + * @brief Builds a %vector from an initializer list. + * @param l An initializer_list. + * @param a An allocator. + * + * Create a %vector consisting of copies of the elements in the + * initializer_list @a l. + * + * This will call the element type's copy constructor N times + * (where N is @a l.size()) and do no memory reallocation. + */ + vector(initializer_list __l, + const allocator_type& __a = allocator_type()) + : _Base(__a) + { + _M_range_initialize(__l.begin(), __l.end(), + random_access_iterator_tag()); + } +#endif + + /** + * @brief Builds a %vector from a range. + * @param first An input iterator. + * @param last An input iterator. + * @param a An allocator. + * + * Create a %vector consisting of copies of the elements from + * [first,last). + * + * If the iterators are forward, bidirectional, or + * random-access, then this will call the elements' copy + * constructor N times (where N is distance(first,last)) and do + * no memory reallocation. But if only input iterators are + * used, then this will do at most 2N calls to the copy + * constructor, and logN memory reallocations. + */ + template + vector(_InputIterator __first, _InputIterator __last, + const allocator_type& __a = allocator_type()) + : _Base(__a) + { + // Check whether it's an integral type. If so, it's not an iterator. + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + _M_initialize_dispatch(__first, __last, _Integral()); + } + + /** + * The dtor only erases the elements, and note that if the + * elements themselves are pointers, the pointed-to memory is + * not touched in any way. Managing the pointer is the user's + * responsibility. + */ + ~vector() + { std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish, + _M_get_Tp_allocator()); } + + /** + * @brief %Vector assignment operator. + * @param x A %vector of identical element and allocator types. + * + * All the elements of @a x are copied, but any extra memory in + * @a x (for fast expansion) will not be copied. Unlike the + * copy constructor, the allocator object is not copied. + */ + vector& + operator=(const vector& __x); + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief %Vector move assignment operator. + * @param x A %vector of identical element and allocator types. + * + * The contents of @a x are moved into this %vector (without copying). + * @a x is a valid, but unspecified %vector. + */ + vector& + operator=(vector&& __x) + { + // NB: DR 675. + this->clear(); + this->swap(__x); + return *this; + } + + /** + * @brief %Vector list assignment operator. + * @param l An initializer_list. + * + * This function fills a %vector with copies of the elements in the + * initializer list @a l. + * + * Note that the assignment completely changes the %vector and + * that the resulting %vector's size is the same as the number + * of elements assigned. Old data may be lost. + */ + vector& + operator=(initializer_list __l) + { + this->assign(__l.begin(), __l.end()); + return *this; + } +#endif + + /** + * @brief Assigns a given value to a %vector. + * @param n Number of elements to be assigned. + * @param val Value to be assigned. + * + * This function fills a %vector with @a n copies of the given + * value. Note that the assignment completely changes the + * %vector and that the resulting %vector's size is the same as + * the number of elements assigned. Old data may be lost. + */ + void + assign(size_type __n, const value_type& __val) + { _M_fill_assign(__n, __val); } + + /** + * @brief Assigns a range to a %vector. + * @param first An input iterator. + * @param last An input iterator. + * + * This function fills a %vector with copies of the elements in the + * range [first,last). + * + * Note that the assignment completely changes the %vector and + * that the resulting %vector's size is the same as the number + * of elements assigned. Old data may be lost. + */ + template + void + assign(_InputIterator __first, _InputIterator __last) + { + // Check whether it's an integral type. If so, it's not an iterator. + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + _M_assign_dispatch(__first, __last, _Integral()); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Assigns an initializer list to a %vector. + * @param l An initializer_list. + * + * This function fills a %vector with copies of the elements in the + * initializer list @a l. + * + * Note that the assignment completely changes the %vector and + * that the resulting %vector's size is the same as the number + * of elements assigned. Old data may be lost. + */ + void + assign(initializer_list __l) + { this->assign(__l.begin(), __l.end()); } +#endif + + /// Get a copy of the memory allocation object. + using _Base::get_allocator; + + // iterators + /** + * Returns a read/write iterator that points to the first + * element in the %vector. Iteration is done in ordinary + * element order. + */ + iterator + begin() + { return iterator(this->_M_impl._M_start); } + + /** + * Returns a read-only (constant) iterator that points to the + * first element in the %vector. Iteration is done in ordinary + * element order. + */ + const_iterator + begin() const + { return const_iterator(this->_M_impl._M_start); } + + /** + * Returns a read/write iterator that points one past the last + * element in the %vector. Iteration is done in ordinary + * element order. + */ + iterator + end() + { return iterator(this->_M_impl._M_finish); } + + /** + * Returns a read-only (constant) iterator that points one past + * the last element in the %vector. Iteration is done in + * ordinary element order. + */ + const_iterator + end() const + { return const_iterator(this->_M_impl._M_finish); } + + /** + * Returns a read/write reverse iterator that points to the + * last element in the %vector. Iteration is done in reverse + * element order. + */ + reverse_iterator + rbegin() + { return reverse_iterator(end()); } + + /** + * Returns a read-only (constant) reverse iterator that points + * to the last element in the %vector. Iteration is done in + * reverse element order. + */ + const_reverse_iterator + rbegin() const + { return const_reverse_iterator(end()); } + + /** + * Returns a read/write reverse iterator that points to one + * before the first element in the %vector. Iteration is done + * in reverse element order. + */ + reverse_iterator + rend() + { return reverse_iterator(begin()); } + + /** + * Returns a read-only (constant) reverse iterator that points + * to one before the first element in the %vector. Iteration + * is done in reverse element order. + */ + const_reverse_iterator + rend() const + { return const_reverse_iterator(begin()); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * Returns a read-only (constant) iterator that points to the + * first element in the %vector. Iteration is done in ordinary + * element order. + */ + const_iterator + cbegin() const + { return const_iterator(this->_M_impl._M_start); } + + /** + * Returns a read-only (constant) iterator that points one past + * the last element in the %vector. Iteration is done in + * ordinary element order. + */ + const_iterator + cend() const + { return const_iterator(this->_M_impl._M_finish); } + + /** + * Returns a read-only (constant) reverse iterator that points + * to the last element in the %vector. Iteration is done in + * reverse element order. + */ + const_reverse_iterator + crbegin() const + { return const_reverse_iterator(end()); } + + /** + * Returns a read-only (constant) reverse iterator that points + * to one before the first element in the %vector. Iteration + * is done in reverse element order. + */ + const_reverse_iterator + crend() const + { return const_reverse_iterator(begin()); } +#endif + + // [23.2.4.2] capacity + /** Returns the number of elements in the %vector. */ + size_type + size() const + { return size_type(this->_M_impl._M_finish - this->_M_impl._M_start); } + + /** Returns the size() of the largest possible %vector. */ + size_type + max_size() const + { return _M_get_Tp_allocator().max_size(); } + + /** + * @brief Resizes the %vector to the specified number of elements. + * @param new_size Number of elements the %vector should contain. + * @param x Data with which new elements should be populated. + * + * This function will %resize the %vector to the specified + * number of elements. If the number is smaller than the + * %vector's current size the %vector is truncated, otherwise + * the %vector is extended and new elements are populated with + * given data. + */ + void + resize(size_type __new_size, value_type __x = value_type()) + { + if (__new_size < size()) + _M_erase_at_end(this->_M_impl._M_start + __new_size); + else + insert(end(), __new_size - size(), __x); + } + + /** + * Returns the total number of elements that the %vector can + * hold before needing to allocate more memory. + */ + size_type + capacity() const + { return size_type(this->_M_impl._M_end_of_storage + - this->_M_impl._M_start); } + + /** + * Returns true if the %vector is empty. (Thus begin() would + * equal end().) + */ + bool + empty() const + { return begin() == end(); } + + /** + * @brief Attempt to preallocate enough memory for specified number of + * elements. + * @param n Number of elements required. + * @throw std::length_error If @a n exceeds @c max_size(). + * + * This function attempts to reserve enough memory for the + * %vector to hold the specified number of elements. If the + * number requested is more than max_size(), length_error is + * thrown. + * + * The advantage of this function is that if optimal code is a + * necessity and the user can determine the number of elements + * that will be required, the user can reserve the memory in + * %advance, and thus prevent a possible reallocation of memory + * and copying of %vector data. + */ + void + reserve(size_type __n); + + // element access + /** + * @brief Subscript access to the data contained in the %vector. + * @param n The index of the element for which data should be + * accessed. + * @return Read/write reference to data. + * + * This operator allows for easy, array-style, data access. + * Note that data access with this operator is unchecked and + * out_of_range lookups are not defined. (For checked lookups + * see at().) + */ + reference + operator[](size_type __n) + { return *(this->_M_impl._M_start + __n); } + + /** + * @brief Subscript access to the data contained in the %vector. + * @param n The index of the element for which data should be + * accessed. + * @return Read-only (constant) reference to data. + * + * This operator allows for easy, array-style, data access. + * Note that data access with this operator is unchecked and + * out_of_range lookups are not defined. (For checked lookups + * see at().) + */ + const_reference + operator[](size_type __n) const + { return *(this->_M_impl._M_start + __n); } + + protected: + /// Safety check used only from at(). + void + _M_range_check(size_type __n) const + { + if (__n >= this->size()) + __throw_out_of_range(__N("vector::_M_range_check")); + } + + public: + /** + * @brief Provides access to the data contained in the %vector. + * @param n The index of the element for which data should be + * accessed. + * @return Read/write reference to data. + * @throw std::out_of_range If @a n is an invalid index. + * + * This function provides for safer data access. The parameter + * is first checked that it is in the range of the vector. The + * function throws out_of_range if the check fails. + */ + reference + at(size_type __n) + { + _M_range_check(__n); + return (*this)[__n]; + } + + /** + * @brief Provides access to the data contained in the %vector. + * @param n The index of the element for which data should be + * accessed. + * @return Read-only (constant) reference to data. + * @throw std::out_of_range If @a n is an invalid index. + * + * This function provides for safer data access. The parameter + * is first checked that it is in the range of the vector. The + * function throws out_of_range if the check fails. + */ + const_reference + at(size_type __n) const + { + _M_range_check(__n); + return (*this)[__n]; + } + + /** + * Returns a read/write reference to the data at the first + * element of the %vector. + */ + reference + front() + { return *begin(); } + + /** + * Returns a read-only (constant) reference to the data at the first + * element of the %vector. + */ + const_reference + front() const + { return *begin(); } + + /** + * Returns a read/write reference to the data at the last + * element of the %vector. + */ + reference + back() + { return *(end() - 1); } + + /** + * Returns a read-only (constant) reference to the data at the + * last element of the %vector. + */ + const_reference + back() const + { return *(end() - 1); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 464. Suggestion for new member functions in standard containers. + // data access + /** + * Returns a pointer such that [data(), data() + size()) is a valid + * range. For a non-empty %vector, data() == &front(). + */ + pointer + data() + { return pointer(this->_M_impl._M_start); } + + const_pointer + data() const + { return const_pointer(this->_M_impl._M_start); } + + // [23.2.4.3] modifiers + /** + * @brief Add data to the end of the %vector. + * @param x Data to be added. + * + * This is a typical stack operation. The function creates an + * element at the end of the %vector and assigns the given data + * to it. Due to the nature of a %vector this operation can be + * done in constant time if the %vector has preallocated space + * available. + */ + void + push_back(const value_type& __x) + { + if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage) + { + this->_M_impl.construct(this->_M_impl._M_finish, __x); + ++this->_M_impl._M_finish; + } + else + _M_insert_aux(end(), __x); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + void + push_back(value_type&& __x) + { emplace_back(std::move(__x)); } + + template + void + emplace_back(_Args&&... __args); +#endif + + /** + * @brief Removes last element. + * + * This is a typical stack operation. It shrinks the %vector by one. + * + * Note that no data is returned, and if the last element's + * data is needed, it should be retrieved before pop_back() is + * called. + */ + void + pop_back() + { + --this->_M_impl._M_finish; + this->_M_impl.destroy(this->_M_impl._M_finish); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Inserts an object in %vector before specified iterator. + * @param position An iterator into the %vector. + * @param args Arguments. + * @return An iterator that points to the inserted data. + * + * This function will insert an object of type T constructed + * with T(std::forward(args)...) before the specified location. + * Note that this kind of operation could be expensive for a %vector + * and if it is frequently used the user should consider using + * std::list. + */ + template + iterator + emplace(iterator __position, _Args&&... __args); +#endif + + /** + * @brief Inserts given value into %vector before specified iterator. + * @param position An iterator into the %vector. + * @param x Data to be inserted. + * @return An iterator that points to the inserted data. + * + * This function will insert a copy of the given value before + * the specified location. Note that this kind of operation + * could be expensive for a %vector and if it is frequently + * used the user should consider using std::list. + */ + iterator + insert(iterator __position, const value_type& __x); + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + /** + * @brief Inserts given rvalue into %vector before specified iterator. + * @param position An iterator into the %vector. + * @param x Data to be inserted. + * @return An iterator that points to the inserted data. + * + * This function will insert a copy of the given rvalue before + * the specified location. Note that this kind of operation + * could be expensive for a %vector and if it is frequently + * used the user should consider using std::list. + */ + iterator + insert(iterator __position, value_type&& __x) + { return emplace(__position, std::move(__x)); } + + /** + * @brief Inserts an initializer_list into the %vector. + * @param position An iterator into the %vector. + * @param l An initializer_list. + * + * This function will insert copies of the data in the + * initializer_list @a l into the %vector before the location + * specified by @a position. + * + * Note that this kind of operation could be expensive for a + * %vector and if it is frequently used the user should + * consider using std::list. + */ + void + insert(iterator __position, initializer_list __l) + { this->insert(__position, __l.begin(), __l.end()); } +#endif + + /** + * @brief Inserts a number of copies of given data into the %vector. + * @param position An iterator into the %vector. + * @param n Number of elements to be inserted. + * @param x Data to be inserted. + * + * This function will insert a specified number of copies of + * the given data before the location specified by @a position. + * + * Note that this kind of operation could be expensive for a + * %vector and if it is frequently used the user should + * consider using std::list. + */ + void + insert(iterator __position, size_type __n, const value_type& __x) + { _M_fill_insert(__position, __n, __x); } + + /** + * @brief Inserts a range into the %vector. + * @param position An iterator into the %vector. + * @param first An input iterator. + * @param last An input iterator. + * + * This function will insert copies of the data in the range + * [first,last) into the %vector before the location specified + * by @a pos. + * + * Note that this kind of operation could be expensive for a + * %vector and if it is frequently used the user should + * consider using std::list. + */ + template + void + insert(iterator __position, _InputIterator __first, + _InputIterator __last) + { + // Check whether it's an integral type. If so, it's not an iterator. + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + _M_insert_dispatch(__position, __first, __last, _Integral()); + } + + /** + * @brief Remove element at given position. + * @param position Iterator pointing to element to be erased. + * @return An iterator pointing to the next element (or end()). + * + * This function will erase the element at the given position and thus + * shorten the %vector by one. + * + * Note This operation could be expensive and if it is + * frequently used the user should consider using std::list. + * The user is also cautioned that this function only erases + * the element, and that if the element is itself a pointer, + * the pointed-to memory is not touched in any way. Managing + * the pointer is the user's responsibility. + */ + iterator + erase(iterator __position); + + /** + * @brief Remove a range of elements. + * @param first Iterator pointing to the first element to be erased. + * @param last Iterator pointing to one past the last element to be + * erased. + * @return An iterator pointing to the element pointed to by @a last + * prior to erasing (or end()). + * + * This function will erase the elements in the range [first,last) and + * shorten the %vector accordingly. + * + * Note This operation could be expensive and if it is + * frequently used the user should consider using std::list. + * The user is also cautioned that this function only erases + * the elements, and that if the elements themselves are + * pointers, the pointed-to memory is not touched in any way. + * Managing the pointer is the user's responsibility. + */ + iterator + erase(iterator __first, iterator __last); + + /** + * @brief Swaps data with another %vector. + * @param x A %vector of the same element and allocator types. + * + * This exchanges the elements between two vectors in constant time. + * (Three pointers, so it should be quite fast.) + * Note that the global std::swap() function is specialized such that + * std::swap(v1,v2) will feed to this function. + */ + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + swap(vector&& __x) +#else + swap(vector& __x) +#endif + { + std::swap(this->_M_impl._M_start, __x._M_impl._M_start); + std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish); + std::swap(this->_M_impl._M_end_of_storage, + __x._M_impl._M_end_of_storage); + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 431. Swapping containers with unequal allocators. + std::__alloc_swap<_Tp_alloc_type>::_S_do_it(_M_get_Tp_allocator(), + __x._M_get_Tp_allocator()); + } + + /** + * Erases all the elements. Note that this function only erases the + * elements, and that if the elements themselves are pointers, the + * pointed-to memory is not touched in any way. Managing the pointer is + * the user's responsibility. + */ + void + clear() + { _M_erase_at_end(this->_M_impl._M_start); } + + protected: + /** + * Memory expansion handler. Uses the member allocation function to + * obtain @a n bytes of memory, and then copies [first,last) into it. + */ + template + pointer + _M_allocate_and_copy(size_type __n, + _ForwardIterator __first, _ForwardIterator __last) + { + pointer __result = this->_M_allocate(__n); + __try + { + std::__uninitialized_copy_a(__first, __last, __result, + _M_get_Tp_allocator()); + return __result; + } + __catch(...) + { + _M_deallocate(__result, __n); + __throw_exception_again; + } + } + + + // Internal constructor functions follow. + + // Called by the range constructor to implement [23.1.1]/9 + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 438. Ambiguity in the "do the right thing" clause + template + void + _M_initialize_dispatch(_Integer __n, _Integer __value, __true_type) + { + this->_M_impl._M_start = _M_allocate(static_cast(__n)); + this->_M_impl._M_end_of_storage = + this->_M_impl._M_start + static_cast(__n); + _M_fill_initialize(static_cast(__n), __value); + } + + // Called by the range constructor to implement [23.1.1]/9 + template + void + _M_initialize_dispatch(_InputIterator __first, _InputIterator __last, + __false_type) + { + typedef typename std::iterator_traits<_InputIterator>:: + iterator_category _IterCategory; + _M_range_initialize(__first, __last, _IterCategory()); + } + + // Called by the second initialize_dispatch above + template + void + _M_range_initialize(_InputIterator __first, + _InputIterator __last, std::input_iterator_tag) + { + for (; __first != __last; ++__first) + push_back(*__first); + } + + // Called by the second initialize_dispatch above + template + void + _M_range_initialize(_ForwardIterator __first, + _ForwardIterator __last, std::forward_iterator_tag) + { + const size_type __n = std::distance(__first, __last); + this->_M_impl._M_start = this->_M_allocate(__n); + this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n; + this->_M_impl._M_finish = + std::__uninitialized_copy_a(__first, __last, + this->_M_impl._M_start, + _M_get_Tp_allocator()); + } + + // Called by the first initialize_dispatch above and by the + // vector(n,value,a) constructor. + void + _M_fill_initialize(size_type __n, const value_type& __value) + { + std::__uninitialized_fill_n_a(this->_M_impl._M_start, __n, __value, + _M_get_Tp_allocator()); + this->_M_impl._M_finish = this->_M_impl._M_end_of_storage; + } + + + // Internal assign functions follow. The *_aux functions do the actual + // assignment work for the range versions. + + // Called by the range assign to implement [23.1.1]/9 + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 438. Ambiguity in the "do the right thing" clause + template + void + _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) + { _M_fill_assign(__n, __val); } + + // Called by the range assign to implement [23.1.1]/9 + template + void + _M_assign_dispatch(_InputIterator __first, _InputIterator __last, + __false_type) + { + typedef typename std::iterator_traits<_InputIterator>:: + iterator_category _IterCategory; + _M_assign_aux(__first, __last, _IterCategory()); + } + + // Called by the second assign_dispatch above + template + void + _M_assign_aux(_InputIterator __first, _InputIterator __last, + std::input_iterator_tag); + + // Called by the second assign_dispatch above + template + void + _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last, + std::forward_iterator_tag); + + // Called by assign(n,t), and the range assign when it turns out + // to be the same thing. + void + _M_fill_assign(size_type __n, const value_type& __val); + + + // Internal insert functions follow. + + // Called by the range insert to implement [23.1.1]/9 + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 438. Ambiguity in the "do the right thing" clause + template + void + _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val, + __true_type) + { _M_fill_insert(__pos, __n, __val); } + + // Called by the range insert to implement [23.1.1]/9 + template + void + _M_insert_dispatch(iterator __pos, _InputIterator __first, + _InputIterator __last, __false_type) + { + typedef typename std::iterator_traits<_InputIterator>:: + iterator_category _IterCategory; + _M_range_insert(__pos, __first, __last, _IterCategory()); + } + + // Called by the second insert_dispatch above + template + void + _M_range_insert(iterator __pos, _InputIterator __first, + _InputIterator __last, std::input_iterator_tag); + + // Called by the second insert_dispatch above + template + void + _M_range_insert(iterator __pos, _ForwardIterator __first, + _ForwardIterator __last, std::forward_iterator_tag); + + // Called by insert(p,n,x), and the range insert when it turns out to be + // the same thing. + void + _M_fill_insert(iterator __pos, size_type __n, const value_type& __x); + + // Called by insert(p,x) +#ifndef __GXX_EXPERIMENTAL_CXX0X__ + void + _M_insert_aux(iterator __position, const value_type& __x); +#else + template + void + _M_insert_aux(iterator __position, _Args&&... __args); +#endif + + // Called by the latter. + size_type + _M_check_len(size_type __n, const char* __s) const + { + if (max_size() - size() < __n) + __throw_length_error(__N(__s)); + + const size_type __len = size() + std::max(size(), __n); + return (__len < size() || __len > max_size()) ? max_size() : __len; + } + + // Internal erase functions follow. + + // Called by erase(q1,q2), clear(), resize(), _M_fill_assign, + // _M_assign_aux. + void + _M_erase_at_end(pointer __pos) + { + std::_Destroy(__pos, this->_M_impl._M_finish, _M_get_Tp_allocator()); + this->_M_impl._M_finish = __pos; + } + }; + + + /** + * @brief Vector equality comparison. + * @param x A %vector. + * @param y A %vector of the same type as @a x. + * @return True iff the size and elements of the vectors are equal. + * + * This is an equivalence relation. It is linear in the size of the + * vectors. Vectors are considered equivalent if their sizes are equal, + * and if corresponding elements compare equal. + */ + template + inline bool + operator==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) + { return (__x.size() == __y.size() + && std::equal(__x.begin(), __x.end(), __y.begin())); } + + /** + * @brief Vector ordering relation. + * @param x A %vector. + * @param y A %vector of the same type as @a x. + * @return True iff @a x is lexicographically less than @a y. + * + * This is a total ordering relation. It is linear in the size of the + * vectors. The elements must be comparable with @c <. + * + * See std::lexicographical_compare() for how the determination is made. + */ + template + inline bool + operator<(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) + { return std::lexicographical_compare(__x.begin(), __x.end(), + __y.begin(), __y.end()); } + + /// Based on operator== + template + inline bool + operator!=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) + { return !(__x == __y); } + + /// Based on operator< + template + inline bool + operator>(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) + { return __y < __x; } + + /// Based on operator< + template + inline bool + operator<=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) + { return !(__y < __x); } + + /// Based on operator< + template + inline bool + operator>=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) + { return !(__x < __y); } + + /// See std::vector::swap(). + template + inline void + swap(vector<_Tp, _Alloc>& __x, vector<_Tp, _Alloc>& __y) + { __x.swap(__y); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + inline void + swap(vector<_Tp, _Alloc>&& __x, vector<_Tp, _Alloc>& __y) + { __x.swap(__y); } + + template + inline void + swap(vector<_Tp, _Alloc>& __x, vector<_Tp, _Alloc>&& __y) + { __x.swap(__y); } +#endif + +_GLIBCXX_END_NESTED_NAMESPACE + +#endif /* _STL_VECTOR_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stream_iterator.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stream_iterator.h new file mode 100644 index 00000000..fce6c26d --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stream_iterator.h @@ -0,0 +1,211 @@ +// Stream iterators + +// Copyright (C) 2001, 2004, 2005, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file stream_iterator.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STREAM_ITERATOR_H +#define _STREAM_ITERATOR_H 1 + +#pragma GCC system_header + +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /// Provides input iterator semantics for streams. + template, typename _Dist = ptrdiff_t> + class istream_iterator + : public iterator + { + public: + typedef _CharT char_type; + typedef _Traits traits_type; + typedef basic_istream<_CharT, _Traits> istream_type; + + private: + istream_type* _M_stream; + _Tp _M_value; + bool _M_ok; + + public: + /// Construct end of input stream iterator. + istream_iterator() + : _M_stream(0), _M_value(), _M_ok(false) {} + + /// Construct start of input stream iterator. + istream_iterator(istream_type& __s) + : _M_stream(&__s) + { _M_read(); } + + istream_iterator(const istream_iterator& __obj) + : _M_stream(__obj._M_stream), _M_value(__obj._M_value), + _M_ok(__obj._M_ok) + { } + + const _Tp& + operator*() const + { + __glibcxx_requires_cond(_M_ok, + _M_message(__gnu_debug::__msg_deref_istream) + ._M_iterator(*this)); + return _M_value; + } + + const _Tp* + operator->() const { return &(operator*()); } + + istream_iterator& + operator++() + { + __glibcxx_requires_cond(_M_ok, + _M_message(__gnu_debug::__msg_inc_istream) + ._M_iterator(*this)); + _M_read(); + return *this; + } + + istream_iterator + operator++(int) + { + __glibcxx_requires_cond(_M_ok, + _M_message(__gnu_debug::__msg_inc_istream) + ._M_iterator(*this)); + istream_iterator __tmp = *this; + _M_read(); + return __tmp; + } + + bool + _M_equal(const istream_iterator& __x) const + { return (_M_ok == __x._M_ok) && (!_M_ok || _M_stream == __x._M_stream); } + + private: + void + _M_read() + { + _M_ok = (_M_stream && *_M_stream) ? true : false; + if (_M_ok) + { + *_M_stream >> _M_value; + _M_ok = *_M_stream ? true : false; + } + } + }; + + /// Return true if x and y are both end or not end, or x and y are the same. + template + inline bool + operator==(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x, + const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y) + { return __x._M_equal(__y); } + + /// Return false if x and y are both end or not end, or x and y are the same. + template + inline bool + operator!=(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x, + const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y) + { return !__x._M_equal(__y); } + + /** + * @brief Provides output iterator semantics for streams. + * + * This class provides an iterator to write to an ostream. The type Tp is + * the only type written by this iterator and there must be an + * operator<<(Tp) defined. + * + * @param Tp The type to write to the ostream. + * @param CharT The ostream char_type. + * @param Traits The ostream char_traits. + */ + template > + class ostream_iterator + : public iterator + { + public: + //@{ + /// Public typedef + typedef _CharT char_type; + typedef _Traits traits_type; + typedef basic_ostream<_CharT, _Traits> ostream_type; + //@} + + private: + ostream_type* _M_stream; + const _CharT* _M_string; + + public: + /// Construct from an ostream. + ostream_iterator(ostream_type& __s) : _M_stream(&__s), _M_string(0) {} + + /** + * Construct from an ostream. + * + * The delimiter string @a c is written to the stream after every Tp + * written to the stream. The delimiter is not copied, and thus must + * not be destroyed while this iterator is in use. + * + * @param s Underlying ostream to write to. + * @param c CharT delimiter string to insert. + */ + ostream_iterator(ostream_type& __s, const _CharT* __c) + : _M_stream(&__s), _M_string(__c) { } + + /// Copy constructor. + ostream_iterator(const ostream_iterator& __obj) + : _M_stream(__obj._M_stream), _M_string(__obj._M_string) { } + + /// Writes @a value to underlying ostream using operator<<. If + /// constructed with delimiter string, writes delimiter to ostream. + ostream_iterator& + operator=(const _Tp& __value) + { + __glibcxx_requires_cond(_M_stream != 0, + _M_message(__gnu_debug::__msg_output_ostream) + ._M_iterator(*this)); + *_M_stream << __value; + if (_M_string) *_M_stream << _M_string; + return *this; + } + + ostream_iterator& + operator*() + { return *this; } + + ostream_iterator& + operator++() + { return *this; } + + ostream_iterator& + operator++(int) + { return *this; } + }; + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/streambuf.tcc b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/streambuf.tcc new file mode 100644 index 00000000..f3e6ce74 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/streambuf.tcc @@ -0,0 +1,174 @@ +// Stream buffer classes -*- C++ -*- + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file streambuf.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 27.5 Stream buffers +// + +#ifndef _STREAMBUF_TCC +#define _STREAMBUF_TCC 1 + +#pragma GCC system_header + +_GLIBCXX_BEGIN_NAMESPACE(std) + + template + streamsize + basic_streambuf<_CharT, _Traits>:: + xsgetn(char_type* __s, streamsize __n) + { + streamsize __ret = 0; + while (__ret < __n) + { + const streamsize __buf_len = this->egptr() - this->gptr(); + if (__buf_len) + { + const streamsize __remaining = __n - __ret; + const streamsize __len = std::min(__buf_len, __remaining); + traits_type::copy(__s, this->gptr(), __len); + __ret += __len; + __s += __len; + this->gbump(__len); + } + + if (__ret < __n) + { + const int_type __c = this->uflow(); + if (!traits_type::eq_int_type(__c, traits_type::eof())) + { + traits_type::assign(*__s++, traits_type::to_char_type(__c)); + ++__ret; + } + else + break; + } + } + return __ret; + } + + template + streamsize + basic_streambuf<_CharT, _Traits>:: + xsputn(const char_type* __s, streamsize __n) + { + streamsize __ret = 0; + while (__ret < __n) + { + const streamsize __buf_len = this->epptr() - this->pptr(); + if (__buf_len) + { + const streamsize __remaining = __n - __ret; + const streamsize __len = std::min(__buf_len, __remaining); + traits_type::copy(this->pptr(), __s, __len); + __ret += __len; + __s += __len; + this->pbump(__len); + } + + if (__ret < __n) + { + int_type __c = this->overflow(traits_type::to_int_type(*__s)); + if (!traits_type::eq_int_type(__c, traits_type::eof())) + { + ++__ret; + ++__s; + } + else + break; + } + } + return __ret; + } + + // Conceivably, this could be used to implement buffer-to-buffer + // copies, if this was ever desired in an un-ambiguous way by the + // standard. + template + streamsize + __copy_streambufs_eof(basic_streambuf<_CharT, _Traits>* __sbin, + basic_streambuf<_CharT, _Traits>* __sbout, + bool& __ineof) + { + streamsize __ret = 0; + __ineof = true; + typename _Traits::int_type __c = __sbin->sgetc(); + while (!_Traits::eq_int_type(__c, _Traits::eof())) + { + __c = __sbout->sputc(_Traits::to_char_type(__c)); + if (_Traits::eq_int_type(__c, _Traits::eof())) + { + __ineof = false; + break; + } + ++__ret; + __c = __sbin->snextc(); + } + return __ret; + } + + template + inline streamsize + __copy_streambufs(basic_streambuf<_CharT, _Traits>* __sbin, + basic_streambuf<_CharT, _Traits>* __sbout) + { + bool __ineof; + return __copy_streambufs_eof(__sbin, __sbout, __ineof); + } + + // Inhibit implicit instantiations for required instantiations, + // which are defined via explicit instantiations elsewhere. + // NB: This syntax is a GNU extension. +#if _GLIBCXX_EXTERN_TEMPLATE + extern template class basic_streambuf; + extern template + streamsize + __copy_streambufs(basic_streambuf*, + basic_streambuf*); + extern template + streamsize + __copy_streambufs_eof(basic_streambuf*, + basic_streambuf*, bool&); + +#ifdef _GLIBCXX_USE_WCHAR_T + extern template class basic_streambuf; + extern template + streamsize + __copy_streambufs(basic_streambuf*, + basic_streambuf*); + extern template + streamsize + __copy_streambufs_eof(basic_streambuf*, + basic_streambuf*, bool&); +#endif +#endif + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/streambuf_iterator.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/streambuf_iterator.h new file mode 100644 index 00000000..d02b5553 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/streambuf_iterator.h @@ -0,0 +1,392 @@ +// Streambuf iterators + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file streambuf_iterator.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _STREAMBUF_ITERATOR_H +#define _STREAMBUF_ITERATOR_H 1 + +#pragma GCC system_header + +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // 24.5.3 Template class istreambuf_iterator + /// Provides input iterator semantics for streambufs. + template + class istreambuf_iterator + : public iterator + { + public: + // Types: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef _Traits traits_type; + typedef typename _Traits::int_type int_type; + typedef basic_streambuf<_CharT, _Traits> streambuf_type; + typedef basic_istream<_CharT, _Traits> istream_type; + //@} + + template + friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, + ostreambuf_iterator<_CharT2> >::__type + copy(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, + ostreambuf_iterator<_CharT2>); + + template + friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, + _CharT2*>::__type + __copy_move_a2(istreambuf_iterator<_CharT2>, + istreambuf_iterator<_CharT2>, _CharT2*); + + template + friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, + istreambuf_iterator<_CharT2> >::__type + find(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, + const _CharT2&); + + private: + // 24.5.3 istreambuf_iterator + // p 1 + // If the end of stream is reached (streambuf_type::sgetc() + // returns traits_type::eof()), the iterator becomes equal to + // the "end of stream" iterator value. + // NB: This implementation assumes the "end of stream" value + // is EOF, or -1. + mutable streambuf_type* _M_sbuf; + mutable int_type _M_c; + + public: + /// Construct end of input stream iterator. + istreambuf_iterator() throw() + : _M_sbuf(0), _M_c(traits_type::eof()) { } + + /// Construct start of input stream iterator. + istreambuf_iterator(istream_type& __s) throw() + : _M_sbuf(__s.rdbuf()), _M_c(traits_type::eof()) { } + + /// Construct start of streambuf iterator. + istreambuf_iterator(streambuf_type* __s) throw() + : _M_sbuf(__s), _M_c(traits_type::eof()) { } + + /// Return the current character pointed to by iterator. This returns + /// streambuf.sgetc(). It cannot be assigned. NB: The result of + /// operator*() on an end of stream is undefined. + char_type + operator*() const + { +#ifdef _GLIBCXX_DEBUG_PEDANTIC + // Dereferencing a past-the-end istreambuf_iterator is a + // libstdc++ extension + __glibcxx_requires_cond(!_M_at_eof(), + _M_message(__gnu_debug::__msg_deref_istreambuf) + ._M_iterator(*this)); +#endif + return traits_type::to_char_type(_M_get()); + } + + /// Advance the iterator. Calls streambuf.sbumpc(). + istreambuf_iterator& + operator++() + { + __glibcxx_requires_cond(!_M_at_eof(), + _M_message(__gnu_debug::__msg_inc_istreambuf) + ._M_iterator(*this)); + if (_M_sbuf) + { + _M_sbuf->sbumpc(); + _M_c = traits_type::eof(); + } + return *this; + } + + /// Advance the iterator. Calls streambuf.sbumpc(). + istreambuf_iterator + operator++(int) + { + __glibcxx_requires_cond(!_M_at_eof(), + _M_message(__gnu_debug::__msg_inc_istreambuf) + ._M_iterator(*this)); + + istreambuf_iterator __old = *this; + if (_M_sbuf) + { + __old._M_c = _M_sbuf->sbumpc(); + _M_c = traits_type::eof(); + } + return __old; + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 110 istreambuf_iterator::equal not const + // NB: there is also number 111 (NAD, Future) pending on this function. + /// Return true both iterators are end or both are not end. + bool + equal(const istreambuf_iterator& __b) const + { return _M_at_eof() == __b._M_at_eof(); } + + private: + int_type + _M_get() const + { + const int_type __eof = traits_type::eof(); + int_type __ret = __eof; + if (_M_sbuf) + { + if (!traits_type::eq_int_type(_M_c, __eof)) + __ret = _M_c; + else if (!traits_type::eq_int_type((__ret = _M_sbuf->sgetc()), + __eof)) + _M_c = __ret; + else + _M_sbuf = 0; + } + return __ret; + } + + bool + _M_at_eof() const + { + const int_type __eof = traits_type::eof(); + return traits_type::eq_int_type(_M_get(), __eof); + } + }; + + template + inline bool + operator==(const istreambuf_iterator<_CharT, _Traits>& __a, + const istreambuf_iterator<_CharT, _Traits>& __b) + { return __a.equal(__b); } + + template + inline bool + operator!=(const istreambuf_iterator<_CharT, _Traits>& __a, + const istreambuf_iterator<_CharT, _Traits>& __b) + { return !__a.equal(__b); } + + /// Provides output iterator semantics for streambufs. + template + class ostreambuf_iterator + : public iterator + { + public: + // Types: + //@{ + /// Public typedefs + typedef _CharT char_type; + typedef _Traits traits_type; + typedef basic_streambuf<_CharT, _Traits> streambuf_type; + typedef basic_ostream<_CharT, _Traits> ostream_type; + //@} + + template + friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, + ostreambuf_iterator<_CharT2> >::__type + copy(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, + ostreambuf_iterator<_CharT2>); + + private: + streambuf_type* _M_sbuf; + bool _M_failed; + + public: + /// Construct output iterator from ostream. + ostreambuf_iterator(ostream_type& __s) throw () + : _M_sbuf(__s.rdbuf()), _M_failed(!_M_sbuf) { } + + /// Construct output iterator from streambuf. + ostreambuf_iterator(streambuf_type* __s) throw () + : _M_sbuf(__s), _M_failed(!_M_sbuf) { } + + /// Write character to streambuf. Calls streambuf.sputc(). + ostreambuf_iterator& + operator=(_CharT __c) + { + if (!_M_failed && + _Traits::eq_int_type(_M_sbuf->sputc(__c), _Traits::eof())) + _M_failed = true; + return *this; + } + + /// Return *this. + ostreambuf_iterator& + operator*() + { return *this; } + + /// Return *this. + ostreambuf_iterator& + operator++(int) + { return *this; } + + /// Return *this. + ostreambuf_iterator& + operator++() + { return *this; } + + /// Return true if previous operator=() failed. + bool + failed() const throw() + { return _M_failed; } + + ostreambuf_iterator& + _M_put(const _CharT* __ws, streamsize __len) + { + if (__builtin_expect(!_M_failed, true) + && __builtin_expect(this->_M_sbuf->sputn(__ws, __len) != __len, + false)) + _M_failed = true; + return *this; + } + }; + + // Overloads for streambuf iterators. + template + typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, + ostreambuf_iterator<_CharT> >::__type + copy(istreambuf_iterator<_CharT> __first, + istreambuf_iterator<_CharT> __last, + ostreambuf_iterator<_CharT> __result) + { + if (__first._M_sbuf && !__last._M_sbuf && !__result._M_failed) + { + bool __ineof; + __copy_streambufs_eof(__first._M_sbuf, __result._M_sbuf, __ineof); + if (!__ineof) + __result._M_failed = true; + } + return __result; + } + + template + typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, + ostreambuf_iterator<_CharT> >::__type + __copy_move_a2(_CharT* __first, _CharT* __last, + ostreambuf_iterator<_CharT> __result) + { + const streamsize __num = __last - __first; + if (__num > 0) + __result._M_put(__first, __num); + return __result; + } + + template + typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, + ostreambuf_iterator<_CharT> >::__type + __copy_move_a2(const _CharT* __first, const _CharT* __last, + ostreambuf_iterator<_CharT> __result) + { + const streamsize __num = __last - __first; + if (__num > 0) + __result._M_put(__first, __num); + return __result; + } + + template + typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, + _CharT*>::__type + __copy_move_a2(istreambuf_iterator<_CharT> __first, + istreambuf_iterator<_CharT> __last, _CharT* __result) + { + typedef istreambuf_iterator<_CharT> __is_iterator_type; + typedef typename __is_iterator_type::traits_type traits_type; + typedef typename __is_iterator_type::streambuf_type streambuf_type; + typedef typename traits_type::int_type int_type; + + if (__first._M_sbuf && !__last._M_sbuf) + { + streambuf_type* __sb = __first._M_sbuf; + int_type __c = __sb->sgetc(); + while (!traits_type::eq_int_type(__c, traits_type::eof())) + { + const streamsize __n = __sb->egptr() - __sb->gptr(); + if (__n > 1) + { + traits_type::copy(__result, __sb->gptr(), __n); + __sb->gbump(__n); + __result += __n; + __c = __sb->underflow(); + } + else + { + *__result++ = traits_type::to_char_type(__c); + __c = __sb->snextc(); + } + } + } + return __result; + } + + template + typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, + istreambuf_iterator<_CharT> >::__type + find(istreambuf_iterator<_CharT> __first, + istreambuf_iterator<_CharT> __last, const _CharT& __val) + { + typedef istreambuf_iterator<_CharT> __is_iterator_type; + typedef typename __is_iterator_type::traits_type traits_type; + typedef typename __is_iterator_type::streambuf_type streambuf_type; + typedef typename traits_type::int_type int_type; + + if (__first._M_sbuf && !__last._M_sbuf) + { + const int_type __ival = traits_type::to_int_type(__val); + streambuf_type* __sb = __first._M_sbuf; + int_type __c = __sb->sgetc(); + while (!traits_type::eq_int_type(__c, traits_type::eof()) + && !traits_type::eq_int_type(__c, __ival)) + { + streamsize __n = __sb->egptr() - __sb->gptr(); + if (__n > 1) + { + const _CharT* __p = traits_type::find(__sb->gptr(), + __n, __val); + if (__p) + __n = __p - __sb->gptr(); + __sb->gbump(__n); + __c = __sb->sgetc(); + } + else + __c = __sb->snextc(); + } + + if (!traits_type::eq_int_type(__c, traits_type::eof())) + __first._M_c = __c; + else + __first._M_sbuf = 0; + } + return __first; + } + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stringfwd.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stringfwd.h new file mode 100644 index 00000000..c63e777b --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/stringfwd.h @@ -0,0 +1,77 @@ +// String support -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file stringfwd.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// +// ISO C++ 14882: 21 Strings library +// + +#ifndef _STRINGFWD_H +#define _STRINGFWD_H 1 + +#pragma GCC system_header + +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + template + class allocator; + + template + struct char_traits; + + template, + typename _Alloc = allocator<_CharT> > + class basic_string; + + template<> struct char_traits; + + typedef basic_string string; + +#ifdef _GLIBCXX_USE_WCHAR_T + template<> struct char_traits; + + typedef basic_string wstring; +#endif + +#if (defined(__GXX_EXPERIMENTAL_CXX0X__) \ + && defined(_GLIBCXX_USE_C99_STDINT_TR1)) + + template<> struct char_traits; + template<> struct char_traits; + + typedef basic_string u16string; + typedef basic_string u32string; + +#endif + +_GLIBCXX_END_NAMESPACE + +#endif // _STRINGFWD_H diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/unique_ptr.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/unique_ptr.h new file mode 100644 index 00000000..b686d11f --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/unique_ptr.h @@ -0,0 +1,450 @@ +// unique_ptr implementation -*- C++ -*- + +// Copyright (C) 2008, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file unique_ptr.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _UNIQUE_PTR_H +#define _UNIQUE_PTR_H 1 + +#ifndef __GXX_EXPERIMENTAL_CXX0X__ +# include +#endif + +#include +#include +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /** + * @addtogroup pointer_abstractions + * @{ + */ + + /// Primary template, default_delete. + template + struct default_delete + { + default_delete() { } + + template + default_delete(const default_delete<_Up>&) { } + + void + operator()(_Tp* __ptr) const + { + static_assert(sizeof(_Tp)>0, + "can't delete pointer to incomplete type"); + delete __ptr; + } + }; + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 740 - omit specialization for array objects with a compile time length + /// Specialization, default_delete. + template + struct default_delete<_Tp[]> + { + void + operator()(_Tp* __ptr) const + { + static_assert(sizeof(_Tp)>0, + "can't delete pointer to incomplete type"); + delete [] __ptr; + } + }; + + /// 20.7.12.2 unique_ptr for single objects. + template > + class unique_ptr + { + typedef std::tuple<_Tp*, _Tp_Deleter> __tuple_type; + typedef __tuple_type unique_ptr::* __unspecified_bool_type; + typedef _Tp* unique_ptr::* __unspecified_pointer_type; + + public: + typedef _Tp* pointer; + typedef _Tp element_type; + typedef _Tp_Deleter deleter_type; + + // Constructors. + unique_ptr() + : _M_t(pointer(), deleter_type()) + { static_assert(!std::is_pointer::value, + "constructed with null function pointer deleter"); } + + explicit + unique_ptr(pointer __p) + : _M_t(__p, deleter_type()) + { static_assert(!std::is_pointer::value, + "constructed with null function pointer deleter"); } + + unique_ptr(pointer __p, + typename std::conditional::value, + deleter_type, const deleter_type&>::type __d) + : _M_t(__p, __d) { } + + unique_ptr(pointer __p, + typename std::remove_reference::type&& __d) + : _M_t(std::move(__p), std::move(__d)) + { static_assert(!std::is_reference::value, + "rvalue deleter bound to reference"); } + + // Move constructors. + unique_ptr(unique_ptr&& __u) + : _M_t(__u.release(), std::forward(__u.get_deleter())) { } + + template + unique_ptr(unique_ptr<_Up, _Up_Deleter>&& __u) + : _M_t(__u.release(), std::forward(__u.get_deleter())) + { } + + // Destructor. + ~unique_ptr() { reset(); } + + // Assignment. + unique_ptr& + operator=(unique_ptr&& __u) + { + reset(__u.release()); + get_deleter() = std::move(__u.get_deleter()); + return *this; + } + + template + unique_ptr& + operator=(unique_ptr<_Up, _Up_Deleter>&& __u) + { + reset(__u.release()); + get_deleter() = std::move(__u.get_deleter()); + return *this; + } + + unique_ptr& + operator=(__unspecified_pointer_type) + { + reset(); + return *this; + } + + // Observers. + typename std::add_lvalue_reference::type operator*() const + { + _GLIBCXX_DEBUG_ASSERT(get() != 0); + return *get(); + } + + pointer + operator->() const + { + _GLIBCXX_DEBUG_ASSERT(get() != 0); + return get(); + } + + pointer + get() const + { return std::get<0>(_M_t); } + + typename std::add_lvalue_reference::type + get_deleter() + { return std::get<1>(_M_t); } + + typename std::add_lvalue_reference< + typename std::add_const::type + >::type + get_deleter() const + { return std::get<1>(_M_t); } + + operator __unspecified_bool_type () const + { return get() == 0 ? 0 : &unique_ptr::_M_t; } + + // Modifiers. + pointer + release() + { + pointer __p = get(); + std::get<0>(_M_t) = 0; + return __p; + } + + void + reset(pointer __p = pointer()) + { + if (__p != get()) + { + get_deleter()(get()); + std::get<0>(_M_t) = __p; + } + } + + void + swap(unique_ptr&& __u) + { + using std::swap; + swap(_M_t, __u._M_t); + } + + // Disable copy from lvalue. + unique_ptr(const unique_ptr&) = delete; + + template + unique_ptr(const unique_ptr<_Up, _Up_Deleter>&) = delete; + + unique_ptr& operator=(const unique_ptr&) = delete; + + template + unique_ptr& operator=(const unique_ptr<_Up, _Up_Deleter>&) = delete; + + private: + __tuple_type _M_t; + }; + + /// 20.7.12.3 unique_ptr for array objects with a runtime length + // [unique.ptr.runtime] + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 740 - omit specialization for array objects with a compile time length + template + class unique_ptr<_Tp[], _Tp_Deleter> + { + typedef std::tuple<_Tp*, _Tp_Deleter> __tuple_type; + typedef __tuple_type unique_ptr::* __unspecified_bool_type; + typedef _Tp* unique_ptr::* __unspecified_pointer_type; + + public: + typedef _Tp* pointer; + typedef _Tp element_type; + typedef _Tp_Deleter deleter_type; + + // Constructors. + unique_ptr() + : _M_t(pointer(), deleter_type()) + { static_assert(!std::is_pointer::value, + "constructed with null function pointer deleter"); } + + explicit + unique_ptr(pointer __p) + : _M_t(__p, deleter_type()) + { static_assert(!std::is_pointer::value, + "constructed with null function pointer deleter"); } + + unique_ptr(pointer __p, + typename std::conditional::value, + deleter_type, const deleter_type&>::type __d) + : _M_t(__p, __d) { } + + unique_ptr(pointer __p, + typename std::remove_reference::type && __d) + : _M_t(std::move(__p), std::move(__d)) + { static_assert(!std::is_reference::value, + "rvalue deleter bound to reference"); } + + // Move constructors. + unique_ptr(unique_ptr&& __u) + : _M_t(__u.release(), std::forward(__u.get_deleter())) { } + + template + unique_ptr(unique_ptr<_Up, _Up_Deleter>&& __u) + : _M_t(__u.release(), std::forward(__u.get_deleter())) + { } + + // Destructor. + ~unique_ptr() { reset(); } + + // Assignment. + unique_ptr& + operator=(unique_ptr&& __u) + { + reset(__u.release()); + get_deleter() = std::move(__u.get_deleter()); + return *this; + } + + template + unique_ptr& + operator=(unique_ptr<_Up, _Up_Deleter>&& __u) + { + reset(__u.release()); + get_deleter() = std::move(__u.get_deleter()); + return *this; + } + + unique_ptr& + operator=(__unspecified_pointer_type) + { + reset(); + return *this; + } + + // Observers. + typename std::add_lvalue_reference::type + operator[](size_t __i) const + { + _GLIBCXX_DEBUG_ASSERT(get() != 0); + return get()[__i]; + } + + pointer + get() const + { return std::get<0>(_M_t); } + + typename std::add_lvalue_reference::type + get_deleter() + { return std::get<1>(_M_t); } + + typename std::add_lvalue_reference< + typename std::add_const::type + >::type + get_deleter() const + { return std::get<1>(_M_t); } + + operator __unspecified_bool_type () const + { return get() == 0 ? 0 : &unique_ptr::_M_t; } + + // Modifiers. + pointer + release() + { + pointer __p = get(); + std::get<0>(_M_t) = 0; + return __p; + } + + void + reset(pointer __p = pointer()) + { + if (__p != get()) + { + get_deleter()(get()); + std::get<0>(_M_t) = __p; + } + } + + // DR 821. + template + void reset(_Up) = delete; + + void + swap(unique_ptr&& __u) + { + using std::swap; + swap(_M_t, __u._M_t); + } + + // Disable copy from lvalue. + unique_ptr(const unique_ptr&) = delete; + unique_ptr& operator=(const unique_ptr&) = delete; + + // Disable construction from convertible pointer types. + // (N2315 - 20.6.5.3.1) + template + unique_ptr(_Up*, typename + std::conditional::value, + deleter_type, const deleter_type&>::type, + typename std::enable_if::value>::type* = 0) = delete; + + template + unique_ptr(_Up*, typename std::remove_reference::type&&, + typename std::enable_if::value>::type* = 0) = delete; + + template + explicit + unique_ptr(_Up*, typename std::enable_if::value>::type* = 0) = delete; + + private: + __tuple_type _M_t; + }; + + template + inline void + swap(unique_ptr<_Tp, _Tp_Deleter>& __x, + unique_ptr<_Tp, _Tp_Deleter>& __y) + { __x.swap(__y); } + + template + inline void + swap(unique_ptr<_Tp, _Tp_Deleter>&& __x, + unique_ptr<_Tp, _Tp_Deleter>& __y) + { __x.swap(__y); } + + template + inline void + swap(unique_ptr<_Tp, _Tp_Deleter>& __x, + unique_ptr<_Tp, _Tp_Deleter>&& __y) + { __x.swap(__y); } + + template + inline bool + operator==(const unique_ptr<_Tp, _Tp_Deleter>& __x, + const unique_ptr<_Up, _Up_Deleter>& __y) + { return __x.get() == __y.get(); } + + template + inline bool + operator!=(const unique_ptr<_Tp, _Tp_Deleter>& __x, + const unique_ptr<_Up, _Up_Deleter>& __y) + { return !(__x.get() == __y.get()); } + + template + inline bool + operator<(const unique_ptr<_Tp, _Tp_Deleter>& __x, + const unique_ptr<_Up, _Up_Deleter>& __y) + { return __x.get() < __y.get(); } + + template + inline bool + operator<=(const unique_ptr<_Tp, _Tp_Deleter>& __x, + const unique_ptr<_Up, _Up_Deleter>& __y) + { return !(__y.get() < __x.get()); } + + template + inline bool + operator>(const unique_ptr<_Tp, _Tp_Deleter>& __x, + const unique_ptr<_Up, _Up_Deleter>& __y) + { return __y.get() < __x.get(); } + + template + inline bool + operator>=(const unique_ptr<_Tp, _Tp_Deleter>& __x, + const unique_ptr<_Up, _Up_Deleter>& __y) + { return !(__x.get() < __y.get()); } + + // @} group pointer_abstractions + +_GLIBCXX_END_NAMESPACE + +#endif /* _UNIQUE_PTR_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/valarray_after.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/valarray_after.h new file mode 100644 index 00000000..8a6a2568 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/valarray_after.h @@ -0,0 +1,549 @@ +// The template and inlines for the -*- C++ -*- internal _Meta class. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file valarray_after.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// Written by Gabriel Dos Reis + +#ifndef _VALARRAY_AFTER_H +#define _VALARRAY_AFTER_H 1 + +#pragma GCC system_header + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // + // gslice_array closure. + // + template + class _GBase + { + public: + typedef typename _Dom::value_type value_type; + + _GBase (const _Dom& __e, const valarray& __i) + : _M_expr (__e), _M_index(__i) {} + + value_type + operator[] (size_t __i) const + { return _M_expr[_M_index[__i]]; } + + size_t + size () const + { return _M_index.size(); } + + private: + const _Dom& _M_expr; + const valarray& _M_index; + }; + + template + class _GBase<_Array<_Tp> > + { + public: + typedef _Tp value_type; + + _GBase (_Array<_Tp> __a, const valarray& __i) + : _M_array (__a), _M_index(__i) {} + + value_type + operator[] (size_t __i) const + { return _M_array._M_data[_M_index[__i]]; } + + size_t + size () const + { return _M_index.size(); } + + private: + const _Array<_Tp> _M_array; + const valarray& _M_index; + }; + + template + struct _GClos<_Expr, _Dom> + : _GBase<_Dom> + { + typedef _GBase<_Dom> _Base; + typedef typename _Base::value_type value_type; + + _GClos (const _Dom& __e, const valarray& __i) + : _Base (__e, __i) {} + }; + + template + struct _GClos<_ValArray, _Tp> + : _GBase<_Array<_Tp> > + { + typedef _GBase<_Array<_Tp> > _Base; + typedef typename _Base::value_type value_type; + + _GClos (_Array<_Tp> __a, const valarray& __i) + : _Base (__a, __i) {} + }; + + // + // indirect_array closure + // + template + class _IBase + { + public: + typedef typename _Dom::value_type value_type; + + _IBase (const _Dom& __e, const valarray& __i) + : _M_expr (__e), _M_index (__i) {} + + value_type + operator[] (size_t __i) const + { return _M_expr[_M_index[__i]]; } + + size_t + size() const + { return _M_index.size(); } + + private: + const _Dom& _M_expr; + const valarray& _M_index; + }; + + template + struct _IClos<_Expr, _Dom> + : _IBase<_Dom> + { + typedef _IBase<_Dom> _Base; + typedef typename _Base::value_type value_type; + + _IClos (const _Dom& __e, const valarray& __i) + : _Base (__e, __i) {} + }; + + template + struct _IClos<_ValArray, _Tp> + : _IBase > + { + typedef _IBase > _Base; + typedef _Tp value_type; + + _IClos (const valarray<_Tp>& __a, const valarray& __i) + : _Base (__a, __i) {} + }; + + // + // class _Expr + // + template + class _Expr + { + public: + typedef _Tp value_type; + + _Expr(const _Clos&); + + const _Clos& operator()() const; + + value_type operator[](size_t) const; + valarray operator[](slice) const; + valarray operator[](const gslice&) const; + valarray operator[](const valarray&) const; + valarray operator[](const valarray&) const; + + _Expr<_UnClos<__unary_plus, std::_Expr, _Clos>, value_type> + operator+() const; + + _Expr<_UnClos<__negate, std::_Expr, _Clos>, value_type> + operator-() const; + + _Expr<_UnClos<__bitwise_not, std::_Expr, _Clos>, value_type> + operator~() const; + + _Expr<_UnClos<__logical_not, std::_Expr, _Clos>, bool> + operator!() const; + + size_t size() const; + value_type sum() const; + + valarray shift(int) const; + valarray cshift(int) const; + + value_type min() const; + value_type max() const; + + valarray apply(value_type (*)(const value_type&)) const; + valarray apply(value_type (*)(value_type)) const; + + private: + const _Clos _M_closure; + }; + + template + inline + _Expr<_Clos, _Tp>::_Expr(const _Clos& __c) : _M_closure(__c) {} + + template + inline const _Clos& + _Expr<_Clos, _Tp>::operator()() const + { return _M_closure; } + + template + inline _Tp + _Expr<_Clos, _Tp>::operator[](size_t __i) const + { return _M_closure[__i]; } + + template + inline valarray<_Tp> + _Expr<_Clos, _Tp>::operator[](slice __s) const + { + valarray<_Tp> __v = valarray<_Tp>(*this)[__s]; + return __v; + } + + template + inline valarray<_Tp> + _Expr<_Clos, _Tp>::operator[](const gslice& __gs) const + { + valarray<_Tp> __v = valarray<_Tp>(*this)[__gs]; + return __v; + } + + template + inline valarray<_Tp> + _Expr<_Clos, _Tp>::operator[](const valarray& __m) const + { + valarray<_Tp> __v = valarray<_Tp>(*this)[__m]; + return __v; + } + + template + inline valarray<_Tp> + _Expr<_Clos, _Tp>::operator[](const valarray& __i) const + { + valarray<_Tp> __v = valarray<_Tp>(*this)[__i]; + return __v; + } + + template + inline size_t + _Expr<_Clos, _Tp>::size() const + { return _M_closure.size(); } + + template + inline valarray<_Tp> + _Expr<_Clos, _Tp>::shift(int __n) const + { + valarray<_Tp> __v = valarray<_Tp>(*this).shift(__n); + return __v; + } + + template + inline valarray<_Tp> + _Expr<_Clos, _Tp>::cshift(int __n) const + { + valarray<_Tp> __v = valarray<_Tp>(*this).cshift(__n); + return __v; + } + + template + inline valarray<_Tp> + _Expr<_Clos, _Tp>::apply(_Tp __f(const _Tp&)) const + { + valarray<_Tp> __v = valarray<_Tp>(*this).apply(__f); + return __v; + } + + template + inline valarray<_Tp> + _Expr<_Clos, _Tp>::apply(_Tp __f(_Tp)) const + { + valarray<_Tp> __v = valarray<_Tp>(*this).apply(__f); + return __v; + } + + // XXX: replace this with a more robust summation algorithm. + template + inline _Tp + _Expr<_Clos, _Tp>::sum() const + { + size_t __n = _M_closure.size(); + if (__n == 0) + return _Tp(); + else + { + _Tp __s = _M_closure[--__n]; + while (__n != 0) + __s += _M_closure[--__n]; + return __s; + } + } + + template + inline _Tp + _Expr<_Clos, _Tp>::min() const + { return __valarray_min(_M_closure); } + + template + inline _Tp + _Expr<_Clos, _Tp>::max() const + { return __valarray_max(_M_closure); } + + template + inline _Expr<_UnClos<__logical_not, _Expr, _Dom>, bool> + _Expr<_Dom, _Tp>::operator!() const + { + typedef _UnClos<__logical_not, std::_Expr, _Dom> _Closure; + return _Expr<_Closure, _Tp>(_Closure(this->_M_closure)); + } + +#define _DEFINE_EXPR_UNARY_OPERATOR(_Op, _Name) \ + template \ + inline _Expr<_UnClos<_Name, std::_Expr, _Dom>, _Tp> \ + _Expr<_Dom, _Tp>::operator _Op() const \ + { \ + typedef _UnClos<_Name, std::_Expr, _Dom> _Closure; \ + return _Expr<_Closure, _Tp>(_Closure(this->_M_closure)); \ + } + + _DEFINE_EXPR_UNARY_OPERATOR(+, __unary_plus) + _DEFINE_EXPR_UNARY_OPERATOR(-, __negate) + _DEFINE_EXPR_UNARY_OPERATOR(~, __bitwise_not) + +#undef _DEFINE_EXPR_UNARY_OPERATOR + +#define _DEFINE_EXPR_BINARY_OPERATOR(_Op, _Name) \ + template \ + inline _Expr<_BinClos<_Name, _Expr, _Expr, _Dom1, _Dom2>, \ + typename __fun<_Name, typename _Dom1::value_type>::result_type> \ + operator _Op(const _Expr<_Dom1, typename _Dom1::value_type>& __v, \ + const _Expr<_Dom2, typename _Dom2::value_type>& __w) \ + { \ + typedef typename _Dom1::value_type _Arg; \ + typedef typename __fun<_Name, _Arg>::result_type _Value; \ + typedef _BinClos<_Name, _Expr, _Expr, _Dom1, _Dom2> _Closure; \ + return _Expr<_Closure, _Value>(_Closure(__v(), __w())); \ + } \ + \ + template \ + inline _Expr<_BinClos<_Name, _Expr, _Constant, _Dom, \ + typename _Dom::value_type>, \ + typename __fun<_Name, typename _Dom::value_type>::result_type> \ + operator _Op(const _Expr<_Dom, typename _Dom::value_type>& __v, \ + const typename _Dom::value_type& __t) \ + { \ + typedef typename _Dom::value_type _Arg; \ + typedef typename __fun<_Name, _Arg>::result_type _Value; \ + typedef _BinClos<_Name, _Expr, _Constant, _Dom, _Arg> _Closure; \ + return _Expr<_Closure, _Value>(_Closure(__v(), __t)); \ + } \ + \ + template \ + inline _Expr<_BinClos<_Name, _Constant, _Expr, \ + typename _Dom::value_type, _Dom>, \ + typename __fun<_Name, typename _Dom::value_type>::result_type> \ + operator _Op(const typename _Dom::value_type& __t, \ + const _Expr<_Dom, typename _Dom::value_type>& __v) \ + { \ + typedef typename _Dom::value_type _Arg; \ + typedef typename __fun<_Name, _Arg>::result_type _Value; \ + typedef _BinClos<_Name, _Constant, _Expr, _Arg, _Dom> _Closure; \ + return _Expr<_Closure, _Value>(_Closure(__t, __v())); \ + } \ + \ + template \ + inline _Expr<_BinClos<_Name, _Expr, _ValArray, \ + _Dom, typename _Dom::value_type>, \ + typename __fun<_Name, typename _Dom::value_type>::result_type> \ + operator _Op(const _Expr<_Dom,typename _Dom::value_type>& __e, \ + const valarray& __v) \ + { \ + typedef typename _Dom::value_type _Arg; \ + typedef typename __fun<_Name, _Arg>::result_type _Value; \ + typedef _BinClos<_Name, _Expr, _ValArray, _Dom, _Arg> _Closure; \ + return _Expr<_Closure, _Value>(_Closure(__e(), __v)); \ + } \ + \ + template \ + inline _Expr<_BinClos<_Name, _ValArray, _Expr, \ + typename _Dom::value_type, _Dom>, \ + typename __fun<_Name, typename _Dom::value_type>::result_type> \ + operator _Op(const valarray& __v, \ + const _Expr<_Dom, typename _Dom::value_type>& __e) \ + { \ + typedef typename _Dom::value_type _Tp; \ + typedef typename __fun<_Name, _Tp>::result_type _Value; \ + typedef _BinClos<_Name, _ValArray, _Expr, _Tp, _Dom> _Closure; \ + return _Expr<_Closure, _Value>(_Closure(__v, __e ())); \ + } + + _DEFINE_EXPR_BINARY_OPERATOR(+, __plus) + _DEFINE_EXPR_BINARY_OPERATOR(-, __minus) + _DEFINE_EXPR_BINARY_OPERATOR(*, __multiplies) + _DEFINE_EXPR_BINARY_OPERATOR(/, __divides) + _DEFINE_EXPR_BINARY_OPERATOR(%, __modulus) + _DEFINE_EXPR_BINARY_OPERATOR(^, __bitwise_xor) + _DEFINE_EXPR_BINARY_OPERATOR(&, __bitwise_and) + _DEFINE_EXPR_BINARY_OPERATOR(|, __bitwise_or) + _DEFINE_EXPR_BINARY_OPERATOR(<<, __shift_left) + _DEFINE_EXPR_BINARY_OPERATOR(>>, __shift_right) + _DEFINE_EXPR_BINARY_OPERATOR(&&, __logical_and) + _DEFINE_EXPR_BINARY_OPERATOR(||, __logical_or) + _DEFINE_EXPR_BINARY_OPERATOR(==, __equal_to) + _DEFINE_EXPR_BINARY_OPERATOR(!=, __not_equal_to) + _DEFINE_EXPR_BINARY_OPERATOR(<, __less) + _DEFINE_EXPR_BINARY_OPERATOR(>, __greater) + _DEFINE_EXPR_BINARY_OPERATOR(<=, __less_equal) + _DEFINE_EXPR_BINARY_OPERATOR(>=, __greater_equal) + +#undef _DEFINE_EXPR_BINARY_OPERATOR + +#define _DEFINE_EXPR_UNARY_FUNCTION(_Name) \ + template \ + inline _Expr<_UnClos<__##_Name, _Expr, _Dom>, \ + typename _Dom::value_type> \ + _Name(const _Expr<_Dom, typename _Dom::value_type>& __e) \ + { \ + typedef typename _Dom::value_type _Tp; \ + typedef _UnClos<__##_Name, _Expr, _Dom> _Closure; \ + return _Expr<_Closure, _Tp>(_Closure(__e())); \ + } \ + \ + template \ + inline _Expr<_UnClos<__##_Name, _ValArray, _Tp>, _Tp> \ + _Name(const valarray<_Tp>& __v) \ + { \ + typedef _UnClos<__##_Name, _ValArray, _Tp> _Closure; \ + return _Expr<_Closure, _Tp>(_Closure(__v)); \ + } + + _DEFINE_EXPR_UNARY_FUNCTION(abs) + _DEFINE_EXPR_UNARY_FUNCTION(cos) + _DEFINE_EXPR_UNARY_FUNCTION(acos) + _DEFINE_EXPR_UNARY_FUNCTION(cosh) + _DEFINE_EXPR_UNARY_FUNCTION(sin) + _DEFINE_EXPR_UNARY_FUNCTION(asin) + _DEFINE_EXPR_UNARY_FUNCTION(sinh) + _DEFINE_EXPR_UNARY_FUNCTION(tan) + _DEFINE_EXPR_UNARY_FUNCTION(tanh) + _DEFINE_EXPR_UNARY_FUNCTION(atan) + _DEFINE_EXPR_UNARY_FUNCTION(exp) + _DEFINE_EXPR_UNARY_FUNCTION(log) + _DEFINE_EXPR_UNARY_FUNCTION(log10) + _DEFINE_EXPR_UNARY_FUNCTION(sqrt) + +#undef _DEFINE_EXPR_UNARY_FUNCTION + +#define _DEFINE_EXPR_BINARY_FUNCTION(_Fun) \ + template \ + inline _Expr<_BinClos<__##_Fun, _Expr, _Expr, _Dom1, _Dom2>, \ + typename _Dom1::value_type> \ + _Fun(const _Expr<_Dom1, typename _Dom1::value_type>& __e1, \ + const _Expr<_Dom2, typename _Dom2::value_type>& __e2) \ + { \ + typedef typename _Dom1::value_type _Tp; \ + typedef _BinClos<__##_Fun, _Expr, _Expr, _Dom1, _Dom2> _Closure; \ + return _Expr<_Closure, _Tp>(_Closure(__e1(), __e2())); \ + } \ + \ + template \ + inline _Expr<_BinClos<__##_Fun, _Expr, _ValArray, _Dom, \ + typename _Dom::value_type>, \ + typename _Dom::value_type> \ + _Fun(const _Expr<_Dom, typename _Dom::value_type>& __e, \ + const valarray& __v) \ + { \ + typedef typename _Dom::value_type _Tp; \ + typedef _BinClos<__##_Fun, _Expr, _ValArray, _Dom, _Tp> _Closure; \ + return _Expr<_Closure, _Tp>(_Closure(__e(), __v)); \ + } \ + \ + template \ + inline _Expr<_BinClos<__##_Fun, _ValArray, _Expr, \ + typename _Dom::value_type, _Dom>, \ + typename _Dom::value_type> \ + _Fun(const valarray& __v, \ + const _Expr<_Dom, typename _Dom::value_type>& __e) \ + { \ + typedef typename _Dom::value_type _Tp; \ + typedef _BinClos<__##_Fun, _ValArray, _Expr, _Tp, _Dom> _Closure; \ + return _Expr<_Closure, _Tp>(_Closure(__v, __e())); \ + } \ + \ + template \ + inline _Expr<_BinClos<__##_Fun, _Expr, _Constant, _Dom, \ + typename _Dom::value_type>, \ + typename _Dom::value_type> \ + _Fun(const _Expr<_Dom, typename _Dom::value_type>& __e, \ + const typename _Dom::value_type& __t) \ + { \ + typedef typename _Dom::value_type _Tp; \ + typedef _BinClos<__##_Fun, _Expr, _Constant, _Dom, _Tp> _Closure;\ + return _Expr<_Closure, _Tp>(_Closure(__e(), __t)); \ + } \ + \ + template \ + inline _Expr<_BinClos<__##_Fun, _Constant, _Expr, \ + typename _Dom::value_type, _Dom>, \ + typename _Dom::value_type> \ + _Fun(const typename _Dom::value_type& __t, \ + const _Expr<_Dom, typename _Dom::value_type>& __e) \ + { \ + typedef typename _Dom::value_type _Tp; \ + typedef _BinClos<__##_Fun, _Constant, _Expr, _Tp, _Dom> _Closure; \ + return _Expr<_Closure, _Tp>(_Closure(__t, __e())); \ + } \ + \ + template \ + inline _Expr<_BinClos<__##_Fun, _ValArray, _ValArray, _Tp, _Tp>, _Tp> \ + _Fun(const valarray<_Tp>& __v, const valarray<_Tp>& __w) \ + { \ + typedef _BinClos<__##_Fun, _ValArray, _ValArray, _Tp, _Tp> _Closure; \ + return _Expr<_Closure, _Tp>(_Closure(__v, __w)); \ + } \ + \ + template \ + inline _Expr<_BinClos<__##_Fun, _ValArray, _Constant, _Tp, _Tp>, _Tp> \ + _Fun(const valarray<_Tp>& __v, const _Tp& __t) \ + { \ + typedef _BinClos<__##_Fun, _ValArray, _Constant, _Tp, _Tp> _Closure; \ + return _Expr<_Closure, _Tp>(_Closure(__v, __t)); \ + } \ + \ + template \ + inline _Expr<_BinClos<__##_Fun, _Constant, _ValArray, _Tp, _Tp>, _Tp> \ + _Fun(const _Tp& __t, const valarray<_Tp>& __v) \ + { \ + typedef _BinClos<__##_Fun, _Constant, _ValArray, _Tp, _Tp> _Closure; \ + return _Expr<_Closure, _Tp>(_Closure(__t, __v)); \ + } + +_DEFINE_EXPR_BINARY_FUNCTION(atan2) +_DEFINE_EXPR_BINARY_FUNCTION(pow) + +#undef _DEFINE_EXPR_BINARY_FUNCTION + +_GLIBCXX_END_NAMESPACE + +#endif /* _CPP_VALARRAY_AFTER_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/valarray_array.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/valarray_array.h new file mode 100644 index 00000000..492891bc --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/valarray_array.h @@ -0,0 +1,699 @@ +// The template and inlines for the -*- C++ -*- internal _Array helper class. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file valarray_array.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// Written by Gabriel Dos Reis + +#ifndef _VALARRAY_ARRAY_H +#define _VALARRAY_ARRAY_H 1 + +#pragma GCC system_header + +#include +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // + // Helper functions on raw pointers + // + + // We get memory by the old fashion way + inline void* + __valarray_get_memory(size_t __n) + { return operator new(__n); } + + template + inline _Tp*__restrict__ + __valarray_get_storage(size_t __n) + { + return static_cast<_Tp*__restrict__> + (std::__valarray_get_memory(__n * sizeof(_Tp))); + } + + // Return memory to the system + inline void + __valarray_release_memory(void* __p) + { operator delete(__p); } + + // Turn a raw-memory into an array of _Tp filled with _Tp() + // This is required in 'valarray v(n);' + template + struct _Array_default_ctor + { + // Please note that this isn't exception safe. But + // valarrays aren't required to be exception safe. + inline static void + _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e) + { + while (__b != __e) + new(__b++) _Tp(); + } + }; + + template + struct _Array_default_ctor<_Tp, true> + { + // For fundamental types, it suffices to say 'memset()' + inline static void + _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e) + { __builtin_memset(__b, 0, (__e - __b) * sizeof(_Tp)); } + }; + + template + inline void + __valarray_default_construct(_Tp* __restrict__ __b, _Tp* __restrict__ __e) + { + _Array_default_ctor<_Tp, __is_scalar<_Tp>::__value>::_S_do_it(__b, __e); + } + + // Turn a raw-memory into an array of _Tp filled with __t + // This is the required in valarray v(n, t). Also + // used in valarray<>::resize(). + template + struct _Array_init_ctor + { + // Please note that this isn't exception safe. But + // valarrays aren't required to be exception safe. + inline static void + _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t) + { + while (__b != __e) + new(__b++) _Tp(__t); + } + }; + + template + struct _Array_init_ctor<_Tp, true> + { + inline static void + _S_do_it(_Tp* __restrict__ __b, _Tp* __restrict__ __e, const _Tp __t) + { + while (__b != __e) + *__b++ = __t; + } + }; + + template + inline void + __valarray_fill_construct(_Tp* __restrict__ __b, _Tp* __restrict__ __e, + const _Tp __t) + { + _Array_init_ctor<_Tp, __is_pod(_Tp)>::_S_do_it(__b, __e, __t); + } + + // + // copy-construct raw array [__o, *) from plain array [__b, __e) + // We can't just say 'memcpy()' + // + template + struct _Array_copy_ctor + { + // Please note that this isn't exception safe. But + // valarrays aren't required to be exception safe. + inline static void + _S_do_it(const _Tp* __restrict__ __b, const _Tp* __restrict__ __e, + _Tp* __restrict__ __o) + { + while (__b != __e) + new(__o++) _Tp(*__b++); + } + }; + + template + struct _Array_copy_ctor<_Tp, true> + { + inline static void + _S_do_it(const _Tp* __restrict__ __b, const _Tp* __restrict__ __e, + _Tp* __restrict__ __o) + { __builtin_memcpy(__o, __b, (__e - __b) * sizeof(_Tp)); } + }; + + template + inline void + __valarray_copy_construct(const _Tp* __restrict__ __b, + const _Tp* __restrict__ __e, + _Tp* __restrict__ __o) + { + _Array_copy_ctor<_Tp, __is_pod(_Tp)>::_S_do_it(__b, __e, __o); + } + + // copy-construct raw array [__o, *) from strided array __a[<__n : __s>] + template + inline void + __valarray_copy_construct (const _Tp* __restrict__ __a, size_t __n, + size_t __s, _Tp* __restrict__ __o) + { + if (__is_pod(_Tp)) + while (__n--) + { + *__o++ = *__a; + __a += __s; + } + else + while (__n--) + { + new(__o++) _Tp(*__a); + __a += __s; + } + } + + // copy-construct raw array [__o, *) from indexed array __a[__i[<__n>]] + template + inline void + __valarray_copy_construct (const _Tp* __restrict__ __a, + const size_t* __restrict__ __i, + _Tp* __restrict__ __o, size_t __n) + { + if (__is_pod(_Tp)) + while (__n--) + *__o++ = __a[*__i++]; + else + while (__n--) + new (__o++) _Tp(__a[*__i++]); + } + + // Do the necessary cleanup when we're done with arrays. + template + inline void + __valarray_destroy_elements(_Tp* __restrict__ __b, _Tp* __restrict__ __e) + { + if (!__is_pod(_Tp)) + while (__b != __e) + { + __b->~_Tp(); + ++__b; + } + } + + // Fill a plain array __a[<__n>] with __t + template + inline void + __valarray_fill(_Tp* __restrict__ __a, size_t __n, const _Tp& __t) + { + while (__n--) + *__a++ = __t; + } + + // fill strided array __a[<__n-1 : __s>] with __t + template + inline void + __valarray_fill(_Tp* __restrict__ __a, size_t __n, + size_t __s, const _Tp& __t) + { + for (size_t __i = 0; __i < __n; ++__i, __a += __s) + *__a = __t; + } + + // fill indirect array __a[__i[<__n>]] with __i + template + inline void + __valarray_fill(_Tp* __restrict__ __a, const size_t* __restrict__ __i, + size_t __n, const _Tp& __t) + { + for (size_t __j = 0; __j < __n; ++__j, ++__i) + __a[*__i] = __t; + } + + // copy plain array __a[<__n>] in __b[<__n>] + // For non-fundamental types, it is wrong to say 'memcpy()' + template + struct _Array_copier + { + inline static void + _S_do_it(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b) + { + while(__n--) + *__b++ = *__a++; + } + }; + + template + struct _Array_copier<_Tp, true> + { + inline static void + _S_do_it(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b) + { __builtin_memcpy(__b, __a, __n * sizeof (_Tp)); } + }; + + // Copy a plain array __a[<__n>] into a play array __b[<>] + template + inline void + __valarray_copy(const _Tp* __restrict__ __a, size_t __n, + _Tp* __restrict__ __b) + { + _Array_copier<_Tp, __is_pod(_Tp)>::_S_do_it(__a, __n, __b); + } + + // Copy strided array __a[<__n : __s>] in plain __b[<__n>] + template + inline void + __valarray_copy(const _Tp* __restrict__ __a, size_t __n, size_t __s, + _Tp* __restrict__ __b) + { + for (size_t __i = 0; __i < __n; ++__i, ++__b, __a += __s) + *__b = *__a; + } + + // Copy a plain array __a[<__n>] into a strided array __b[<__n : __s>] + template + inline void + __valarray_copy(const _Tp* __restrict__ __a, _Tp* __restrict__ __b, + size_t __n, size_t __s) + { + for (size_t __i = 0; __i < __n; ++__i, ++__a, __b += __s) + *__b = *__a; + } + + // Copy strided array __src[<__n : __s1>] into another + // strided array __dst[< : __s2>]. Their sizes must match. + template + inline void + __valarray_copy(const _Tp* __restrict__ __src, size_t __n, size_t __s1, + _Tp* __restrict__ __dst, size_t __s2) + { + for (size_t __i = 0; __i < __n; ++__i) + __dst[__i * __s2] = __src[__i * __s1]; + } + + // Copy an indexed array __a[__i[<__n>]] in plain array __b[<__n>] + template + inline void + __valarray_copy(const _Tp* __restrict__ __a, + const size_t* __restrict__ __i, + _Tp* __restrict__ __b, size_t __n) + { + for (size_t __j = 0; __j < __n; ++__j, ++__b, ++__i) + *__b = __a[*__i]; + } + + // Copy a plain array __a[<__n>] in an indexed array __b[__i[<__n>]] + template + inline void + __valarray_copy(const _Tp* __restrict__ __a, size_t __n, + _Tp* __restrict__ __b, const size_t* __restrict__ __i) + { + for (size_t __j = 0; __j < __n; ++__j, ++__a, ++__i) + __b[*__i] = *__a; + } + + // Copy the __n first elements of an indexed array __src[<__i>] into + // another indexed array __dst[<__j>]. + template + inline void + __valarray_copy(const _Tp* __restrict__ __src, size_t __n, + const size_t* __restrict__ __i, + _Tp* __restrict__ __dst, const size_t* __restrict__ __j) + { + for (size_t __k = 0; __k < __n; ++__k) + __dst[*__j++] = __src[*__i++]; + } + + // + // Compute the sum of elements in range [__f, __l) + // This is a naive algorithm. It suffers from cancelling. + // In the future try to specialize + // for _Tp = float, double, long double using a more accurate + // algorithm. + // + template + inline _Tp + __valarray_sum(const _Tp* __restrict__ __f, const _Tp* __restrict__ __l) + { + _Tp __r = _Tp(); + while (__f != __l) + __r += *__f++; + return __r; + } + + // Compute the product of all elements in range [__f, __l) + template + inline _Tp + __valarray_product(const _Tp* __restrict__ __f, + const _Tp* __restrict__ __l) + { + _Tp __r = _Tp(1); + while (__f != __l) + __r = __r * *__f++; + return __r; + } + + // Compute the min/max of an array-expression + template + inline typename _Ta::value_type + __valarray_min(const _Ta& __a) + { + size_t __s = __a.size(); + typedef typename _Ta::value_type _Value_type; + _Value_type __r = __s == 0 ? _Value_type() : __a[0]; + for (size_t __i = 1; __i < __s; ++__i) + { + _Value_type __t = __a[__i]; + if (__t < __r) + __r = __t; + } + return __r; + } + + template + inline typename _Ta::value_type + __valarray_max(const _Ta& __a) + { + size_t __s = __a.size(); + typedef typename _Ta::value_type _Value_type; + _Value_type __r = __s == 0 ? _Value_type() : __a[0]; + for (size_t __i = 1; __i < __s; ++__i) + { + _Value_type __t = __a[__i]; + if (__t > __r) + __r = __t; + } + return __r; + } + + // + // Helper class _Array, first layer of valarray abstraction. + // All operations on valarray should be forwarded to this class + // whenever possible. -- gdr + // + + template + struct _Array + { + explicit _Array(size_t); + explicit _Array(_Tp* const __restrict__); + explicit _Array(const valarray<_Tp>&); + _Array(const _Tp* __restrict__, size_t); + + _Tp* begin() const; + + _Tp* const __restrict__ _M_data; + }; + + + // Copy-construct plain array __b[<__n>] from indexed array __a[__i[<__n>]] + template + inline void + __valarray_copy_construct(_Array<_Tp> __a, _Array __i, + _Array<_Tp> __b, size_t __n) + { std::__valarray_copy_construct(__a._M_data, __i._M_data, + __b._M_data, __n); } + + // Copy-construct plain array __b[<__n>] from strided array __a[<__n : __s>] + template + inline void + __valarray_copy_construct(_Array<_Tp> __a, size_t __n, size_t __s, + _Array<_Tp> __b) + { std::__valarray_copy_construct(__a._M_data, __n, __s, __b._M_data); } + + template + inline void + __valarray_fill (_Array<_Tp> __a, size_t __n, const _Tp& __t) + { std::__valarray_fill(__a._M_data, __n, __t); } + + template + inline void + __valarray_fill(_Array<_Tp> __a, size_t __n, size_t __s, const _Tp& __t) + { std::__valarray_fill(__a._M_data, __n, __s, __t); } + + template + inline void + __valarray_fill(_Array<_Tp> __a, _Array __i, + size_t __n, const _Tp& __t) + { std::__valarray_fill(__a._M_data, __i._M_data, __n, __t); } + + // Copy a plain array __a[<__n>] into a play array __b[<>] + template + inline void + __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b) + { std::__valarray_copy(__a._M_data, __n, __b._M_data); } + + // Copy strided array __a[<__n : __s>] in plain __b[<__n>] + template + inline void + __valarray_copy(_Array<_Tp> __a, size_t __n, size_t __s, _Array<_Tp> __b) + { std::__valarray_copy(__a._M_data, __n, __s, __b._M_data); } + + // Copy a plain array __a[<__n>] into a strided array __b[<__n : __s>] + template + inline void + __valarray_copy(_Array<_Tp> __a, _Array<_Tp> __b, size_t __n, size_t __s) + { __valarray_copy(__a._M_data, __b._M_data, __n, __s); } + + // Copy strided array __src[<__n : __s1>] into another + // strided array __dst[< : __s2>]. Their sizes must match. + template + inline void + __valarray_copy(_Array<_Tp> __a, size_t __n, size_t __s1, + _Array<_Tp> __b, size_t __s2) + { std::__valarray_copy(__a._M_data, __n, __s1, __b._M_data, __s2); } + + // Copy an indexed array __a[__i[<__n>]] in plain array __b[<__n>] + template + inline void + __valarray_copy(_Array<_Tp> __a, _Array __i, + _Array<_Tp> __b, size_t __n) + { std::__valarray_copy(__a._M_data, __i._M_data, __b._M_data, __n); } + + // Copy a plain array __a[<__n>] in an indexed array __b[__i[<__n>]] + template + inline void + __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b, + _Array __i) + { std::__valarray_copy(__a._M_data, __n, __b._M_data, __i._M_data); } + + // Copy the __n first elements of an indexed array __src[<__i>] into + // another indexed array __dst[<__j>]. + template + inline void + __valarray_copy(_Array<_Tp> __src, size_t __n, _Array __i, + _Array<_Tp> __dst, _Array __j) + { + std::__valarray_copy(__src._M_data, __n, __i._M_data, + __dst._M_data, __j._M_data); + } + + template + inline + _Array<_Tp>::_Array(size_t __n) + : _M_data(__valarray_get_storage<_Tp>(__n)) + { std::__valarray_default_construct(_M_data, _M_data + __n); } + + template + inline + _Array<_Tp>::_Array(_Tp* const __restrict__ __p) + : _M_data (__p) {} + + template + inline + _Array<_Tp>::_Array(const valarray<_Tp>& __v) + : _M_data (__v._M_data) {} + + template + inline + _Array<_Tp>::_Array(const _Tp* __restrict__ __b, size_t __s) + : _M_data(__valarray_get_storage<_Tp>(__s)) + { std::__valarray_copy_construct(__b, __s, _M_data); } + + template + inline _Tp* + _Array<_Tp>::begin () const + { return _M_data; } + +#define _DEFINE_ARRAY_FUNCTION(_Op, _Name) \ + template \ + inline void \ + _Array_augmented_##_Name(_Array<_Tp> __a, size_t __n, const _Tp& __t) \ + { \ + for (_Tp* __p = __a._M_data; __p < __a._M_data + __n; ++__p) \ + *__p _Op##= __t; \ + } \ + \ + template \ + inline void \ + _Array_augmented_##_Name(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b) \ + { \ + _Tp* __p = __a._M_data; \ + for (_Tp* __q = __b._M_data; __q < __b._M_data + __n; ++__p, ++__q) \ + *__p _Op##= *__q; \ + } \ + \ + template \ + void \ + _Array_augmented_##_Name(_Array<_Tp> __a, \ + const _Expr<_Dom, _Tp>& __e, size_t __n) \ + { \ + _Tp* __p(__a._M_data); \ + for (size_t __i = 0; __i < __n; ++__i, ++__p) \ + *__p _Op##= __e[__i]; \ + } \ + \ + template \ + inline void \ + _Array_augmented_##_Name(_Array<_Tp> __a, size_t __n, size_t __s, \ + _Array<_Tp> __b) \ + { \ + _Tp* __q(__b._M_data); \ + for (_Tp* __p = __a._M_data; __p < __a._M_data + __s * __n; \ + __p += __s, ++__q) \ + *__p _Op##= *__q; \ + } \ + \ + template \ + inline void \ + _Array_augmented_##_Name(_Array<_Tp> __a, _Array<_Tp> __b, \ + size_t __n, size_t __s) \ + { \ + _Tp* __q(__b._M_data); \ + for (_Tp* __p = __a._M_data; __p < __a._M_data + __n; \ + ++__p, __q += __s) \ + *__p _Op##= *__q; \ + } \ + \ + template \ + void \ + _Array_augmented_##_Name(_Array<_Tp> __a, size_t __s, \ + const _Expr<_Dom, _Tp>& __e, size_t __n) \ + { \ + _Tp* __p(__a._M_data); \ + for (size_t __i = 0; __i < __n; ++__i, __p += __s) \ + *__p _Op##= __e[__i]; \ + } \ + \ + template \ + inline void \ + _Array_augmented_##_Name(_Array<_Tp> __a, _Array __i, \ + _Array<_Tp> __b, size_t __n) \ + { \ + _Tp* __q(__b._M_data); \ + for (size_t* __j = __i._M_data; __j < __i._M_data + __n; \ + ++__j, ++__q) \ + __a._M_data[*__j] _Op##= *__q; \ + } \ + \ + template \ + inline void \ + _Array_augmented_##_Name(_Array<_Tp> __a, size_t __n, \ + _Array<_Tp> __b, _Array __i) \ + { \ + _Tp* __p(__a._M_data); \ + for (size_t* __j = __i._M_data; __j<__i._M_data + __n; \ + ++__j, ++__p) \ + *__p _Op##= __b._M_data[*__j]; \ + } \ + \ + template \ + void \ + _Array_augmented_##_Name(_Array<_Tp> __a, _Array __i, \ + const _Expr<_Dom, _Tp>& __e, size_t __n) \ + { \ + size_t* __j(__i._M_data); \ + for (size_t __k = 0; __k<__n; ++__k, ++__j) \ + __a._M_data[*__j] _Op##= __e[__k]; \ + } \ + \ + template \ + void \ + _Array_augmented_##_Name(_Array<_Tp> __a, _Array __m, \ + _Array<_Tp> __b, size_t __n) \ + { \ + bool* __ok(__m._M_data); \ + _Tp* __p(__a._M_data); \ + for (_Tp* __q = __b._M_data; __q < __b._M_data + __n; \ + ++__q, ++__ok, ++__p) \ + { \ + while (! *__ok) \ + { \ + ++__ok; \ + ++__p; \ + } \ + *__p _Op##= *__q; \ + } \ + } \ + \ + template \ + void \ + _Array_augmented_##_Name(_Array<_Tp> __a, size_t __n, \ + _Array<_Tp> __b, _Array __m) \ + { \ + bool* __ok(__m._M_data); \ + _Tp* __q(__b._M_data); \ + for (_Tp* __p = __a._M_data; __p < __a._M_data + __n; \ + ++__p, ++__ok, ++__q) \ + { \ + while (! *__ok) \ + { \ + ++__ok; \ + ++__q; \ + } \ + *__p _Op##= *__q; \ + } \ + } \ + \ + template \ + void \ + _Array_augmented_##_Name(_Array<_Tp> __a, _Array __m, \ + const _Expr<_Dom, _Tp>& __e, size_t __n) \ + { \ + bool* __ok(__m._M_data); \ + _Tp* __p(__a._M_data); \ + for (size_t __i = 0; __i < __n; ++__i, ++__ok, ++__p) \ + { \ + while (! *__ok) \ + { \ + ++__ok; \ + ++__p; \ + } \ + *__p _Op##= __e[__i]; \ + } \ + } + + _DEFINE_ARRAY_FUNCTION(+, __plus) + _DEFINE_ARRAY_FUNCTION(-, __minus) + _DEFINE_ARRAY_FUNCTION(*, __multiplies) + _DEFINE_ARRAY_FUNCTION(/, __divides) + _DEFINE_ARRAY_FUNCTION(%, __modulus) + _DEFINE_ARRAY_FUNCTION(^, __bitwise_xor) + _DEFINE_ARRAY_FUNCTION(|, __bitwise_or) + _DEFINE_ARRAY_FUNCTION(&, __bitwise_and) + _DEFINE_ARRAY_FUNCTION(<<, __shift_left) + _DEFINE_ARRAY_FUNCTION(>>, __shift_right) + +#undef _DEFINE_ARRAY_FUNCTION + +_GLIBCXX_END_NAMESPACE + +#ifndef _GLIBCXX_EXPORT_TEMPLATE +# include +#endif + +#endif /* _ARRAY_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/valarray_array.tcc b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/valarray_array.tcc new file mode 100644 index 00000000..15cb7b1e --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/valarray_array.tcc @@ -0,0 +1,241 @@ +// The template and inlines for the -*- C++ -*- internal _Array helper class. + +// Copyright (C) 1997, 1998, 1999, 2003, 2005, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file valarray_array.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// Written by Gabriel Dos Reis + +#ifndef _VALARRAY_ARRAY_TCC +#define _VALARRAY_ARRAY_TCC 1 + +_GLIBCXX_BEGIN_NAMESPACE(std) + + template + void + __valarray_fill(_Array<_Tp> __a, size_t __n, _Array __m, + const _Tp& __t) + { + _Tp* __p = __a._M_data; + bool* __ok (__m._M_data); + for (size_t __i=0; __i < __n; ++__i, ++__ok, ++__p) + { + while (!*__ok) + { + ++__ok; + ++__p; + } + *__p = __t; + } + } + + // Copy n elements of a into consecutive elements of b. When m is + // false, the corresponding element of a is skipped. m must contain + // at least n true elements. a must contain at least n elements and + // enough elements to match up with m through the nth true element + // of m. I.e. if n is 10, m has 15 elements with 5 false followed + // by 10 true, a must have 15 elements. + template + void + __valarray_copy(_Array<_Tp> __a, _Array __m, _Array<_Tp> __b, + size_t __n) + { + _Tp* __p (__a._M_data); + bool* __ok (__m._M_data); + for (_Tp* __q = __b._M_data; __q < __b._M_data + __n; + ++__q, ++__ok, ++__p) + { + while (! *__ok) + { + ++__ok; + ++__p; + } + *__q = *__p; + } + } + + // Copy n consecutive elements from a into elements of b. Elements + // of b are skipped if the corresponding element of m is false. m + // must contain at least n true elements. b must have at least as + // many elements as the index of the nth true element of m. I.e. if + // m has 15 elements with 5 false followed by 10 true, b must have + // at least 15 elements. + template + void + __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b, + _Array __m) + { + _Tp* __q (__b._M_data); + bool* __ok (__m._M_data); + for (_Tp* __p = __a._M_data; __p < __a._M_data+__n; + ++__p, ++__ok, ++__q) + { + while (! *__ok) + { + ++__ok; + ++__q; + } + *__q = *__p; + } + } + + // Copy n elements from a into elements of b. Elements of a are + // skipped if the corresponding element of m is false. Elements of + // b are skipped if the corresponding element of k is false. m and + // k must contain at least n true elements. a and b must have at + // least as many elements as the index of the nth true element of m. + template + void + __valarray_copy(_Array<_Tp> __a, _Array __m, size_t __n, + _Array<_Tp> __b, _Array __k) + { + _Tp* __p (__a._M_data); + _Tp* __q (__b._M_data); + bool* __srcok (__m._M_data); + bool* __dstok (__k._M_data); + for (size_t __i = 0; __i < __n; + ++__srcok, ++__p, ++__dstok, ++__q, ++__i) + { + while (! *__srcok) + { + ++__srcok; + ++__p; + } + while (! *__dstok) + { + ++__dstok; + ++__q; + } + *__q = *__p; + } + } + + // Copy n consecutive elements of e into consecutive elements of a. + // I.e. a[i] = e[i]. + template + void + __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a) + { + _Tp* __p (__a._M_data); + for (size_t __i = 0; __i < __n; ++__i, ++__p) + *__p = __e[__i]; + } + + // Copy n consecutive elements of e into elements of a using stride + // s. I.e., a[0] = e[0], a[s] = e[1], a[2*s] = e[2]. + template + void + __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n, + _Array<_Tp> __a, size_t __s) + { + _Tp* __p (__a._M_data); + for (size_t __i = 0; __i < __n; ++__i, __p += __s) + *__p = __e[__i]; + } + + // Copy n consecutive elements of e into elements of a indexed by + // contents of i. I.e., a[i[0]] = e[0]. + template + void + __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n, + _Array<_Tp> __a, _Array __i) + { + size_t* __j (__i._M_data); + for (size_t __k = 0; __k < __n; ++__k, ++__j) + __a._M_data[*__j] = __e[__k]; + } + + // Copy n elements of e indexed by contents of f into elements of a + // indexed by contents of i. I.e., a[i[0]] = e[f[0]]. + template + void + __valarray_copy(_Array<_Tp> __e, _Array __f, + size_t __n, + _Array<_Tp> __a, _Array __i) + { + size_t* __g (__f._M_data); + size_t* __j (__i._M_data); + for (size_t __k = 0; __k < __n; ++__k, ++__j, ++__g) + __a._M_data[*__j] = __e._M_data[*__g]; + } + + // Copy n consecutive elements of e into elements of a. Elements of + // a are skipped if the corresponding element of m is false. m must + // have at least n true elements and a must have at least as many + // elements as the index of the nth true element of m. I.e. if m + // has 5 false followed by 10 true elements and n == 10, a must have + // at least 15 elements. + template + void + __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n, + _Array<_Tp> __a, _Array __m) + { + bool* __ok (__m._M_data); + _Tp* __p (__a._M_data); + for (size_t __i = 0; __i < __n; ++__i, ++__ok, ++__p) + { + while (! *__ok) + { + ++__ok; + ++__p; + } + *__p = __e[__i]; + } + } + + + template + void + __valarray_copy_construct(const _Expr<_Dom, _Tp>& __e, size_t __n, + _Array<_Tp> __a) + { + _Tp* __p (__a._M_data); + for (size_t __i = 0; __i < __n; ++__i, ++__p) + new (__p) _Tp(__e[__i]); + } + + + template + void + __valarray_copy_construct(_Array<_Tp> __a, _Array __m, + _Array<_Tp> __b, size_t __n) + { + _Tp* __p (__a._M_data); + bool* __ok (__m._M_data); + for (_Tp* __q = __b._M_data; __q < __b._M_data+__n; ++__q, ++__ok, ++__p) + { + while (! *__ok) + { + ++__ok; + ++__p; + } + new (__q) _Tp(*__p); + } + } + +_GLIBCXX_END_NAMESPACE + +#endif /* _VALARRAY_ARRAY_TCC */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/valarray_before.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/valarray_before.h new file mode 100644 index 00000000..444129be --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/valarray_before.h @@ -0,0 +1,730 @@ +// The template and inlines for the -*- C++ -*- internal _Meta class. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file valarray_before.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +// Written by Gabriel Dos Reis + +#ifndef _VALARRAY_BEFORE_H +#define _VALARRAY_BEFORE_H 1 + +#pragma GCC system_header + +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // + // Implementing a loosened valarray return value is tricky. + // First we need to meet 26.3.1/3: we should not add more than + // two levels of template nesting. Therefore we resort to template + // template to "flatten" loosened return value types. + // At some point we use partial specialization to remove one level + // template nesting due to _Expr<> + // + + // This class is NOT defined. It doesn't need to. + template class _Constant; + + // Implementations of unary functions applied to valarray<>s. + // I use hard-coded object functions here instead of a generic + // approach like pointers to function: + // 1) correctness: some functions take references, others values. + // we can't deduce the correct type afterwards. + // 2) efficiency -- object functions can be easily inlined + // 3) be Koenig-lookup-friendly + + struct __abs + { + template + _Tp operator()(const _Tp& __t) const + { return abs(__t); } + }; + + struct __cos + { + template + _Tp operator()(const _Tp& __t) const + { return cos(__t); } + }; + + struct __acos + { + template + _Tp operator()(const _Tp& __t) const + { return acos(__t); } + }; + + struct __cosh + { + template + _Tp operator()(const _Tp& __t) const + { return cosh(__t); } + }; + + struct __sin + { + template + _Tp operator()(const _Tp& __t) const + { return sin(__t); } + }; + + struct __asin + { + template + _Tp operator()(const _Tp& __t) const + { return asin(__t); } + }; + + struct __sinh + { + template + _Tp operator()(const _Tp& __t) const + { return sinh(__t); } + }; + + struct __tan + { + template + _Tp operator()(const _Tp& __t) const + { return tan(__t); } + }; + + struct __atan + { + template + _Tp operator()(const _Tp& __t) const + { return atan(__t); } + }; + + struct __tanh + { + template + _Tp operator()(const _Tp& __t) const + { return tanh(__t); } + }; + + struct __exp + { + template + _Tp operator()(const _Tp& __t) const + { return exp(__t); } + }; + + struct __log + { + template + _Tp operator()(const _Tp& __t) const + { return log(__t); } + }; + + struct __log10 + { + template + _Tp operator()(const _Tp& __t) const + { return log10(__t); } + }; + + struct __sqrt + { + template + _Tp operator()(const _Tp& __t) const + { return sqrt(__t); } + }; + + // In the past, we used to tailor operator applications semantics + // to the specialization of standard function objects (i.e. plus<>, etc.) + // That is incorrect. Therefore we provide our own surrogates. + + struct __unary_plus + { + template + _Tp operator()(const _Tp& __t) const + { return +__t; } + }; + + struct __negate + { + template + _Tp operator()(const _Tp& __t) const + { return -__t; } + }; + + struct __bitwise_not + { + template + _Tp operator()(const _Tp& __t) const + { return ~__t; } + }; + + struct __plus + { + template + _Tp operator()(const _Tp& __x, const _Tp& __y) const + { return __x + __y; } + }; + + struct __minus + { + template + _Tp operator()(const _Tp& __x, const _Tp& __y) const + { return __x - __y; } + }; + + struct __multiplies + { + template + _Tp operator()(const _Tp& __x, const _Tp& __y) const + { return __x * __y; } + }; + + struct __divides + { + template + _Tp operator()(const _Tp& __x, const _Tp& __y) const + { return __x / __y; } + }; + + struct __modulus + { + template + _Tp operator()(const _Tp& __x, const _Tp& __y) const + { return __x % __y; } + }; + + struct __bitwise_xor + { + template + _Tp operator()(const _Tp& __x, const _Tp& __y) const + { return __x ^ __y; } + }; + + struct __bitwise_and + { + template + _Tp operator()(const _Tp& __x, const _Tp& __y) const + { return __x & __y; } + }; + + struct __bitwise_or + { + template + _Tp operator()(const _Tp& __x, const _Tp& __y) const + { return __x | __y; } + }; + + struct __shift_left + { + template + _Tp operator()(const _Tp& __x, const _Tp& __y) const + { return __x << __y; } + }; + + struct __shift_right + { + template + _Tp operator()(const _Tp& __x, const _Tp& __y) const + { return __x >> __y; } + }; + + struct __logical_and + { + template + bool operator()(const _Tp& __x, const _Tp& __y) const + { return __x && __y; } + }; + + struct __logical_or + { + template + bool operator()(const _Tp& __x, const _Tp& __y) const + { return __x || __y; } + }; + + struct __logical_not + { + template + bool operator()(const _Tp& __x) const { return !__x; } + }; + + struct __equal_to + { + template + bool operator()(const _Tp& __x, const _Tp& __y) const + { return __x == __y; } + }; + + struct __not_equal_to + { + template + bool operator()(const _Tp& __x, const _Tp& __y) const + { return __x != __y; } + }; + + struct __less + { + template + bool operator()(const _Tp& __x, const _Tp& __y) const + { return __x < __y; } + }; + + struct __greater + { + template + bool operator()(const _Tp& __x, const _Tp& __y) const + { return __x > __y; } + }; + + struct __less_equal + { + template + bool operator()(const _Tp& __x, const _Tp& __y) const + { return __x <= __y; } + }; + + struct __greater_equal + { + template + bool operator()(const _Tp& __x, const _Tp& __y) const + { return __x >= __y; } + }; + + // The few binary functions we miss. + struct __atan2 + { + template + _Tp operator()(const _Tp& __x, const _Tp& __y) const + { return atan2(__x, __y); } + }; + + struct __pow + { + template + _Tp operator()(const _Tp& __x, const _Tp& __y) const + { return pow(__x, __y); } + }; + + + // We need these bits in order to recover the return type of + // some functions/operators now that we're no longer using + // function templates. + template + struct __fun + { + typedef _Tp result_type; + }; + + // several specializations for relational operators. + template + struct __fun<__logical_not, _Tp> + { + typedef bool result_type; + }; + + template + struct __fun<__logical_and, _Tp> + { + typedef bool result_type; + }; + + template + struct __fun<__logical_or, _Tp> + { + typedef bool result_type; + }; + + template + struct __fun<__less, _Tp> + { + typedef bool result_type; + }; + + template + struct __fun<__greater, _Tp> + { + typedef bool result_type; + }; + + template + struct __fun<__less_equal, _Tp> + { + typedef bool result_type; + }; + + template + struct __fun<__greater_equal, _Tp> + { + typedef bool result_type; + }; + + template + struct __fun<__equal_to, _Tp> + { + typedef bool result_type; + }; + + template + struct __fun<__not_equal_to, _Tp> + { + typedef bool result_type; + }; + + // + // Apply function taking a value/const reference closure + // + + template + class _FunBase + { + public: + typedef typename _Dom::value_type value_type; + + _FunBase(const _Dom& __e, value_type __f(_Arg)) + : _M_expr(__e), _M_func(__f) {} + + value_type operator[](size_t __i) const + { return _M_func (_M_expr[__i]); } + + size_t size() const { return _M_expr.size ();} + + private: + const _Dom& _M_expr; + value_type (*_M_func)(_Arg); + }; + + template + struct _ValFunClos<_Expr,_Dom> : _FunBase<_Dom, typename _Dom::value_type> + { + typedef _FunBase<_Dom, typename _Dom::value_type> _Base; + typedef typename _Base::value_type value_type; + typedef value_type _Tp; + + _ValFunClos(const _Dom& __e, _Tp __f(_Tp)) : _Base(__e, __f) {} + }; + + template + struct _ValFunClos<_ValArray,_Tp> : _FunBase, _Tp> + { + typedef _FunBase, _Tp> _Base; + typedef _Tp value_type; + + _ValFunClos(const valarray<_Tp>& __v, _Tp __f(_Tp)) : _Base(__v, __f) {} + }; + + template + struct _RefFunClos<_Expr, _Dom> + : _FunBase<_Dom, const typename _Dom::value_type&> + { + typedef _FunBase<_Dom, const typename _Dom::value_type&> _Base; + typedef typename _Base::value_type value_type; + typedef value_type _Tp; + + _RefFunClos(const _Dom& __e, _Tp __f(const _Tp&)) + : _Base(__e, __f) {} + }; + + template + struct _RefFunClos<_ValArray, _Tp> + : _FunBase, const _Tp&> + { + typedef _FunBase, const _Tp&> _Base; + typedef _Tp value_type; + + _RefFunClos(const valarray<_Tp>& __v, _Tp __f(const _Tp&)) + : _Base(__v, __f) {} + }; + + // + // Unary expression closure. + // + + template + class _UnBase + { + public: + typedef typename _Arg::value_type _Vt; + typedef typename __fun<_Oper, _Vt>::result_type value_type; + + _UnBase(const _Arg& __e) : _M_expr(__e) {} + + value_type operator[](size_t __i) const + { return _Oper()(_M_expr[__i]); } + + size_t size() const { return _M_expr.size(); } + + private: + const _Arg& _M_expr; + }; + + template + struct _UnClos<_Oper, _Expr, _Dom> + : _UnBase<_Oper, _Dom> + { + typedef _Dom _Arg; + typedef _UnBase<_Oper, _Dom> _Base; + typedef typename _Base::value_type value_type; + + _UnClos(const _Arg& __e) : _Base(__e) {} + }; + + template + struct _UnClos<_Oper, _ValArray, _Tp> + : _UnBase<_Oper, valarray<_Tp> > + { + typedef valarray<_Tp> _Arg; + typedef _UnBase<_Oper, valarray<_Tp> > _Base; + typedef typename _Base::value_type value_type; + + _UnClos(const _Arg& __e) : _Base(__e) {} + }; + + + // + // Binary expression closure. + // + + template + class _BinBase + { + public: + typedef typename _FirstArg::value_type _Vt; + typedef typename __fun<_Oper, _Vt>::result_type value_type; + + _BinBase(const _FirstArg& __e1, const _SecondArg& __e2) + : _M_expr1(__e1), _M_expr2(__e2) {} + + value_type operator[](size_t __i) const + { return _Oper()(_M_expr1[__i], _M_expr2[__i]); } + + size_t size() const { return _M_expr1.size(); } + + private: + const _FirstArg& _M_expr1; + const _SecondArg& _M_expr2; + }; + + + template + class _BinBase2 + { + public: + typedef typename _Clos::value_type _Vt; + typedef typename __fun<_Oper, _Vt>::result_type value_type; + + _BinBase2(const _Clos& __e, const _Vt& __t) + : _M_expr1(__e), _M_expr2(__t) {} + + value_type operator[](size_t __i) const + { return _Oper()(_M_expr1[__i], _M_expr2); } + + size_t size() const { return _M_expr1.size(); } + + private: + const _Clos& _M_expr1; + const _Vt& _M_expr2; + }; + + template + class _BinBase1 + { + public: + typedef typename _Clos::value_type _Vt; + typedef typename __fun<_Oper, _Vt>::result_type value_type; + + _BinBase1(const _Vt& __t, const _Clos& __e) + : _M_expr1(__t), _M_expr2(__e) {} + + value_type operator[](size_t __i) const + { return _Oper()(_M_expr1, _M_expr2[__i]); } + + size_t size() const { return _M_expr2.size(); } + + private: + const _Vt& _M_expr1; + const _Clos& _M_expr2; + }; + + template + struct _BinClos<_Oper, _Expr, _Expr, _Dom1, _Dom2> + : _BinBase<_Oper, _Dom1, _Dom2> + { + typedef _BinBase<_Oper, _Dom1, _Dom2> _Base; + typedef typename _Base::value_type value_type; + + _BinClos(const _Dom1& __e1, const _Dom2& __e2) : _Base(__e1, __e2) {} + }; + + template + struct _BinClos<_Oper,_ValArray, _ValArray, _Tp, _Tp> + : _BinBase<_Oper, valarray<_Tp>, valarray<_Tp> > + { + typedef _BinBase<_Oper, valarray<_Tp>, valarray<_Tp> > _Base; + typedef typename _Base::value_type value_type; + + _BinClos(const valarray<_Tp>& __v, const valarray<_Tp>& __w) + : _Base(__v, __w) {} + }; + + template + struct _BinClos<_Oper, _Expr, _ValArray, _Dom, typename _Dom::value_type> + : _BinBase<_Oper, _Dom, valarray > + { + typedef typename _Dom::value_type _Tp; + typedef _BinBase<_Oper,_Dom,valarray<_Tp> > _Base; + typedef typename _Base::value_type value_type; + + _BinClos(const _Dom& __e1, const valarray<_Tp>& __e2) + : _Base(__e1, __e2) {} + }; + + template + struct _BinClos<_Oper, _ValArray, _Expr, typename _Dom::value_type, _Dom> + : _BinBase<_Oper, valarray,_Dom> + { + typedef typename _Dom::value_type _Tp; + typedef _BinBase<_Oper, valarray<_Tp>, _Dom> _Base; + typedef typename _Base::value_type value_type; + + _BinClos(const valarray<_Tp>& __e1, const _Dom& __e2) + : _Base(__e1, __e2) {} + }; + + template + struct _BinClos<_Oper, _Expr, _Constant, _Dom, typename _Dom::value_type> + : _BinBase2<_Oper, _Dom> + { + typedef typename _Dom::value_type _Tp; + typedef _BinBase2<_Oper,_Dom> _Base; + typedef typename _Base::value_type value_type; + + _BinClos(const _Dom& __e1, const _Tp& __e2) : _Base(__e1, __e2) {} + }; + + template + struct _BinClos<_Oper, _Constant, _Expr, typename _Dom::value_type, _Dom> + : _BinBase1<_Oper, _Dom> + { + typedef typename _Dom::value_type _Tp; + typedef _BinBase1<_Oper, _Dom> _Base; + typedef typename _Base::value_type value_type; + + _BinClos(const _Tp& __e1, const _Dom& __e2) : _Base(__e1, __e2) {} + }; + + template + struct _BinClos<_Oper, _ValArray, _Constant, _Tp, _Tp> + : _BinBase2<_Oper, valarray<_Tp> > + { + typedef _BinBase2<_Oper,valarray<_Tp> > _Base; + typedef typename _Base::value_type value_type; + + _BinClos(const valarray<_Tp>& __v, const _Tp& __t) : _Base(__v, __t) {} + }; + + template + struct _BinClos<_Oper, _Constant, _ValArray, _Tp, _Tp> + : _BinBase1<_Oper, valarray<_Tp> > + { + typedef _BinBase1<_Oper, valarray<_Tp> > _Base; + typedef typename _Base::value_type value_type; + + _BinClos(const _Tp& __t, const valarray<_Tp>& __v) : _Base(__t, __v) {} + }; + + // + // slice_array closure. + // + template + class _SBase + { + public: + typedef typename _Dom::value_type value_type; + + _SBase (const _Dom& __e, const slice& __s) + : _M_expr (__e), _M_slice (__s) {} + + value_type + operator[] (size_t __i) const + { return _M_expr[_M_slice.start () + __i * _M_slice.stride ()]; } + + size_t + size() const + { return _M_slice.size (); } + + private: + const _Dom& _M_expr; + const slice& _M_slice; + }; + + template + class _SBase<_Array<_Tp> > + { + public: + typedef _Tp value_type; + + _SBase (_Array<_Tp> __a, const slice& __s) + : _M_array (__a._M_data+__s.start()), _M_size (__s.size()), + _M_stride (__s.stride()) {} + + value_type + operator[] (size_t __i) const + { return _M_array._M_data[__i * _M_stride]; } + + size_t + size() const + { return _M_size; } + + private: + const _Array<_Tp> _M_array; + const size_t _M_size; + const size_t _M_stride; + }; + + template + struct _SClos<_Expr, _Dom> + : _SBase<_Dom> + { + typedef _SBase<_Dom> _Base; + typedef typename _Base::value_type value_type; + + _SClos (const _Dom& __e, const slice& __s) : _Base (__e, __s) {} + }; + + template + struct _SClos<_ValArray, _Tp> + : _SBase<_Array<_Tp> > + { + typedef _SBase<_Array<_Tp> > _Base; + typedef _Tp value_type; + + _SClos (_Array<_Tp> __a, const slice& __s) : _Base (__a, __s) {} + }; + +_GLIBCXX_END_NAMESPACE + +#endif /* _CPP_VALARRAY_BEFORE_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/vector.tcc b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/vector.tcc new file mode 100644 index 00000000..8f674931 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bits/vector.tcc @@ -0,0 +1,681 @@ +// Vector implementation (out of line) -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file vector.tcc + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _VECTOR_TCC +#define _VECTOR_TCC 1 + +_GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D) + + template + void + vector<_Tp, _Alloc>:: + reserve(size_type __n) + { + if (__n > this->max_size()) + __throw_length_error(__N("vector::reserve")); + if (this->capacity() < __n) + { + const size_type __old_size = size(); + pointer __tmp = _M_allocate_and_copy(__n, + _GLIBCXX_MAKE_MOVE_ITERATOR(this->_M_impl._M_start), + _GLIBCXX_MAKE_MOVE_ITERATOR(this->_M_impl._M_finish)); + std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish, + _M_get_Tp_allocator()); + _M_deallocate(this->_M_impl._M_start, + this->_M_impl._M_end_of_storage + - this->_M_impl._M_start); + this->_M_impl._M_start = __tmp; + this->_M_impl._M_finish = __tmp + __old_size; + this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n; + } + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + template + void + vector<_Tp, _Alloc>:: + emplace_back(_Args&&... __args) + { + if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage) + { + this->_M_impl.construct(this->_M_impl._M_finish, + std::forward<_Args>(__args)...); + ++this->_M_impl._M_finish; + } + else + _M_insert_aux(end(), std::forward<_Args>(__args)...); + } +#endif + + template + typename vector<_Tp, _Alloc>::iterator + vector<_Tp, _Alloc>:: + insert(iterator __position, const value_type& __x) + { + const size_type __n = __position - begin(); + if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage + && __position == end()) + { + this->_M_impl.construct(this->_M_impl._M_finish, __x); + ++this->_M_impl._M_finish; + } + else + { +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage) + { + _Tp __x_copy = __x; + _M_insert_aux(__position, std::move(__x_copy)); + } + else +#endif + _M_insert_aux(__position, __x); + } + return iterator(this->_M_impl._M_start + __n); + } + + template + typename vector<_Tp, _Alloc>::iterator + vector<_Tp, _Alloc>:: + erase(iterator __position) + { + if (__position + 1 != end()) + _GLIBCXX_MOVE3(__position + 1, end(), __position); + --this->_M_impl._M_finish; + this->_M_impl.destroy(this->_M_impl._M_finish); + return __position; + } + + template + typename vector<_Tp, _Alloc>::iterator + vector<_Tp, _Alloc>:: + erase(iterator __first, iterator __last) + { + if (__last != end()) + _GLIBCXX_MOVE3(__last, end(), __first); + _M_erase_at_end(__first.base() + (end() - __last)); + return __first; + } + + template + vector<_Tp, _Alloc>& + vector<_Tp, _Alloc>:: + operator=(const vector<_Tp, _Alloc>& __x) + { + if (&__x != this) + { + const size_type __xlen = __x.size(); + if (__xlen > capacity()) + { + pointer __tmp = _M_allocate_and_copy(__xlen, __x.begin(), + __x.end()); + std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish, + _M_get_Tp_allocator()); + _M_deallocate(this->_M_impl._M_start, + this->_M_impl._M_end_of_storage + - this->_M_impl._M_start); + this->_M_impl._M_start = __tmp; + this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __xlen; + } + else if (size() >= __xlen) + { + std::_Destroy(std::copy(__x.begin(), __x.end(), begin()), + end(), _M_get_Tp_allocator()); + } + else + { + std::copy(__x._M_impl._M_start, __x._M_impl._M_start + size(), + this->_M_impl._M_start); + std::__uninitialized_copy_a(__x._M_impl._M_start + size(), + __x._M_impl._M_finish, + this->_M_impl._M_finish, + _M_get_Tp_allocator()); + } + this->_M_impl._M_finish = this->_M_impl._M_start + __xlen; + } + return *this; + } + + template + void + vector<_Tp, _Alloc>:: + _M_fill_assign(size_t __n, const value_type& __val) + { + if (__n > capacity()) + { + vector __tmp(__n, __val, _M_get_Tp_allocator()); + __tmp.swap(*this); + } + else if (__n > size()) + { + std::fill(begin(), end(), __val); + std::__uninitialized_fill_n_a(this->_M_impl._M_finish, + __n - size(), __val, + _M_get_Tp_allocator()); + this->_M_impl._M_finish += __n - size(); + } + else + _M_erase_at_end(std::fill_n(this->_M_impl._M_start, __n, __val)); + } + + template + template + void + vector<_Tp, _Alloc>:: + _M_assign_aux(_InputIterator __first, _InputIterator __last, + std::input_iterator_tag) + { + pointer __cur(this->_M_impl._M_start); + for (; __first != __last && __cur != this->_M_impl._M_finish; + ++__cur, ++__first) + *__cur = *__first; + if (__first == __last) + _M_erase_at_end(__cur); + else + insert(end(), __first, __last); + } + + template + template + void + vector<_Tp, _Alloc>:: + _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last, + std::forward_iterator_tag) + { + const size_type __len = std::distance(__first, __last); + + if (__len > capacity()) + { + pointer __tmp(_M_allocate_and_copy(__len, __first, __last)); + std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish, + _M_get_Tp_allocator()); + _M_deallocate(this->_M_impl._M_start, + this->_M_impl._M_end_of_storage + - this->_M_impl._M_start); + this->_M_impl._M_start = __tmp; + this->_M_impl._M_finish = this->_M_impl._M_start + __len; + this->_M_impl._M_end_of_storage = this->_M_impl._M_finish; + } + else if (size() >= __len) + _M_erase_at_end(std::copy(__first, __last, this->_M_impl._M_start)); + else + { + _ForwardIterator __mid = __first; + std::advance(__mid, size()); + std::copy(__first, __mid, this->_M_impl._M_start); + this->_M_impl._M_finish = + std::__uninitialized_copy_a(__mid, __last, + this->_M_impl._M_finish, + _M_get_Tp_allocator()); + } + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + template + typename vector<_Tp, _Alloc>::iterator + vector<_Tp, _Alloc>:: + emplace(iterator __position, _Args&&... __args) + { + const size_type __n = __position - begin(); + if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage + && __position == end()) + { + this->_M_impl.construct(this->_M_impl._M_finish, + std::forward<_Args>(__args)...); + ++this->_M_impl._M_finish; + } + else + _M_insert_aux(__position, std::forward<_Args>(__args)...); + return iterator(this->_M_impl._M_start + __n); + } + + template + template + void + vector<_Tp, _Alloc>:: + _M_insert_aux(iterator __position, _Args&&... __args) +#else + template + void + vector<_Tp, _Alloc>:: + _M_insert_aux(iterator __position, const _Tp& __x) +#endif + { + if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage) + { + this->_M_impl.construct(this->_M_impl._M_finish, + _GLIBCXX_MOVE(*(this->_M_impl._M_finish + - 1))); + ++this->_M_impl._M_finish; +#ifndef __GXX_EXPERIMENTAL_CXX0X__ + _Tp __x_copy = __x; +#endif + _GLIBCXX_MOVE_BACKWARD3(__position.base(), + this->_M_impl._M_finish - 2, + this->_M_impl._M_finish - 1); +#ifndef __GXX_EXPERIMENTAL_CXX0X__ + *__position = __x_copy; +#else + *__position = _Tp(std::forward<_Args>(__args)...); +#endif + } + else + { + const size_type __len = + _M_check_len(size_type(1), "vector::_M_insert_aux"); + const size_type __elems_before = __position - begin(); + pointer __new_start(this->_M_allocate(__len)); + pointer __new_finish(__new_start); + __try + { + // The order of the three operations is dictated by the C++0x + // case, where the moves could alter a new element belonging + // to the existing vector. This is an issue only for callers + // taking the element by const lvalue ref (see 23.1/13). + this->_M_impl.construct(__new_start + __elems_before, +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + std::forward<_Args>(__args)...); +#else + __x); +#endif + __new_finish = 0; + + __new_finish = + std::__uninitialized_move_a(this->_M_impl._M_start, + __position.base(), __new_start, + _M_get_Tp_allocator()); + ++__new_finish; + + __new_finish = + std::__uninitialized_move_a(__position.base(), + this->_M_impl._M_finish, + __new_finish, + _M_get_Tp_allocator()); + } + __catch(...) + { + if (!__new_finish) + this->_M_impl.destroy(__new_start + __elems_before); + else + std::_Destroy(__new_start, __new_finish, _M_get_Tp_allocator()); + _M_deallocate(__new_start, __len); + __throw_exception_again; + } + std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish, + _M_get_Tp_allocator()); + _M_deallocate(this->_M_impl._M_start, + this->_M_impl._M_end_of_storage + - this->_M_impl._M_start); + this->_M_impl._M_start = __new_start; + this->_M_impl._M_finish = __new_finish; + this->_M_impl._M_end_of_storage = __new_start + __len; + } + } + + template + void + vector<_Tp, _Alloc>:: + _M_fill_insert(iterator __position, size_type __n, const value_type& __x) + { + if (__n != 0) + { + if (size_type(this->_M_impl._M_end_of_storage + - this->_M_impl._M_finish) >= __n) + { + value_type __x_copy = __x; + const size_type __elems_after = end() - __position; + pointer __old_finish(this->_M_impl._M_finish); + if (__elems_after > __n) + { + std::__uninitialized_move_a(this->_M_impl._M_finish - __n, + this->_M_impl._M_finish, + this->_M_impl._M_finish, + _M_get_Tp_allocator()); + this->_M_impl._M_finish += __n; + _GLIBCXX_MOVE_BACKWARD3(__position.base(), + __old_finish - __n, __old_finish); + std::fill(__position.base(), __position.base() + __n, + __x_copy); + } + else + { + std::__uninitialized_fill_n_a(this->_M_impl._M_finish, + __n - __elems_after, + __x_copy, + _M_get_Tp_allocator()); + this->_M_impl._M_finish += __n - __elems_after; + std::__uninitialized_move_a(__position.base(), __old_finish, + this->_M_impl._M_finish, + _M_get_Tp_allocator()); + this->_M_impl._M_finish += __elems_after; + std::fill(__position.base(), __old_finish, __x_copy); + } + } + else + { + const size_type __len = + _M_check_len(__n, "vector::_M_fill_insert"); + const size_type __elems_before = __position - begin(); + pointer __new_start(this->_M_allocate(__len)); + pointer __new_finish(__new_start); + __try + { + // See _M_insert_aux above. + std::__uninitialized_fill_n_a(__new_start + __elems_before, + __n, __x, + _M_get_Tp_allocator()); + __new_finish = 0; + + __new_finish = + std::__uninitialized_move_a(this->_M_impl._M_start, + __position.base(), + __new_start, + _M_get_Tp_allocator()); + __new_finish += __n; + + __new_finish = + std::__uninitialized_move_a(__position.base(), + this->_M_impl._M_finish, + __new_finish, + _M_get_Tp_allocator()); + } + __catch(...) + { + if (!__new_finish) + std::_Destroy(__new_start + __elems_before, + __new_start + __elems_before + __n, + _M_get_Tp_allocator()); + else + std::_Destroy(__new_start, __new_finish, + _M_get_Tp_allocator()); + _M_deallocate(__new_start, __len); + __throw_exception_again; + } + std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish, + _M_get_Tp_allocator()); + _M_deallocate(this->_M_impl._M_start, + this->_M_impl._M_end_of_storage + - this->_M_impl._M_start); + this->_M_impl._M_start = __new_start; + this->_M_impl._M_finish = __new_finish; + this->_M_impl._M_end_of_storage = __new_start + __len; + } + } + } + + template + template + void + vector<_Tp, _Alloc>:: + _M_range_insert(iterator __pos, _InputIterator __first, + _InputIterator __last, std::input_iterator_tag) + { + for (; __first != __last; ++__first) + { + __pos = insert(__pos, *__first); + ++__pos; + } + } + + template + template + void + vector<_Tp, _Alloc>:: + _M_range_insert(iterator __position, _ForwardIterator __first, + _ForwardIterator __last, std::forward_iterator_tag) + { + if (__first != __last) + { + const size_type __n = std::distance(__first, __last); + if (size_type(this->_M_impl._M_end_of_storage + - this->_M_impl._M_finish) >= __n) + { + const size_type __elems_after = end() - __position; + pointer __old_finish(this->_M_impl._M_finish); + if (__elems_after > __n) + { + std::__uninitialized_move_a(this->_M_impl._M_finish - __n, + this->_M_impl._M_finish, + this->_M_impl._M_finish, + _M_get_Tp_allocator()); + this->_M_impl._M_finish += __n; + _GLIBCXX_MOVE_BACKWARD3(__position.base(), + __old_finish - __n, __old_finish); + std::copy(__first, __last, __position); + } + else + { + _ForwardIterator __mid = __first; + std::advance(__mid, __elems_after); + std::__uninitialized_copy_a(__mid, __last, + this->_M_impl._M_finish, + _M_get_Tp_allocator()); + this->_M_impl._M_finish += __n - __elems_after; + std::__uninitialized_move_a(__position.base(), + __old_finish, + this->_M_impl._M_finish, + _M_get_Tp_allocator()); + this->_M_impl._M_finish += __elems_after; + std::copy(__first, __mid, __position); + } + } + else + { + const size_type __len = + _M_check_len(__n, "vector::_M_range_insert"); + pointer __new_start(this->_M_allocate(__len)); + pointer __new_finish(__new_start); + __try + { + __new_finish = + std::__uninitialized_move_a(this->_M_impl._M_start, + __position.base(), + __new_start, + _M_get_Tp_allocator()); + __new_finish = + std::__uninitialized_copy_a(__first, __last, + __new_finish, + _M_get_Tp_allocator()); + __new_finish = + std::__uninitialized_move_a(__position.base(), + this->_M_impl._M_finish, + __new_finish, + _M_get_Tp_allocator()); + } + __catch(...) + { + std::_Destroy(__new_start, __new_finish, + _M_get_Tp_allocator()); + _M_deallocate(__new_start, __len); + __throw_exception_again; + } + std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish, + _M_get_Tp_allocator()); + _M_deallocate(this->_M_impl._M_start, + this->_M_impl._M_end_of_storage + - this->_M_impl._M_start); + this->_M_impl._M_start = __new_start; + this->_M_impl._M_finish = __new_finish; + this->_M_impl._M_end_of_storage = __new_start + __len; + } + } + } + + + // vector + + template + void + vector:: + reserve(size_type __n) + { + if (__n > this->max_size()) + __throw_length_error(__N("vector::reserve")); + if (this->capacity() < __n) + { + _Bit_type* __q = this->_M_allocate(__n); + this->_M_impl._M_finish = _M_copy_aligned(begin(), end(), + iterator(__q, 0)); + this->_M_deallocate(); + this->_M_impl._M_start = iterator(__q, 0); + this->_M_impl._M_end_of_storage = (__q + (__n + int(_S_word_bit) - 1) + / int(_S_word_bit)); + } + } + + template + void + vector:: + _M_fill_insert(iterator __position, size_type __n, bool __x) + { + if (__n == 0) + return; + if (capacity() - size() >= __n) + { + std::copy_backward(__position, end(), + this->_M_impl._M_finish + difference_type(__n)); + std::fill(__position, __position + difference_type(__n), __x); + this->_M_impl._M_finish += difference_type(__n); + } + else + { + const size_type __len = + _M_check_len(__n, "vector::_M_fill_insert"); + _Bit_type * __q = this->_M_allocate(__len); + iterator __i = _M_copy_aligned(begin(), __position, + iterator(__q, 0)); + std::fill(__i, __i + difference_type(__n), __x); + this->_M_impl._M_finish = std::copy(__position, end(), + __i + difference_type(__n)); + this->_M_deallocate(); + this->_M_impl._M_end_of_storage = (__q + ((__len + + int(_S_word_bit) - 1) + / int(_S_word_bit))); + this->_M_impl._M_start = iterator(__q, 0); + } + } + + template + template + void + vector:: + _M_insert_range(iterator __position, _ForwardIterator __first, + _ForwardIterator __last, std::forward_iterator_tag) + { + if (__first != __last) + { + size_type __n = std::distance(__first, __last); + if (capacity() - size() >= __n) + { + std::copy_backward(__position, end(), + this->_M_impl._M_finish + + difference_type(__n)); + std::copy(__first, __last, __position); + this->_M_impl._M_finish += difference_type(__n); + } + else + { + const size_type __len = + _M_check_len(__n, "vector::_M_insert_range"); + _Bit_type * __q = this->_M_allocate(__len); + iterator __i = _M_copy_aligned(begin(), __position, + iterator(__q, 0)); + __i = std::copy(__first, __last, __i); + this->_M_impl._M_finish = std::copy(__position, end(), __i); + this->_M_deallocate(); + this->_M_impl._M_end_of_storage = (__q + + ((__len + + int(_S_word_bit) - 1) + / int(_S_word_bit))); + this->_M_impl._M_start = iterator(__q, 0); + } + } + } + + template + void + vector:: + _M_insert_aux(iterator __position, bool __x) + { + if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_of_storage) + { + std::copy_backward(__position, this->_M_impl._M_finish, + this->_M_impl._M_finish + 1); + *__position = __x; + ++this->_M_impl._M_finish; + } + else + { + const size_type __len = + _M_check_len(size_type(1), "vector::_M_insert_aux"); + _Bit_type * __q = this->_M_allocate(__len); + iterator __i = _M_copy_aligned(begin(), __position, + iterator(__q, 0)); + *__i++ = __x; + this->_M_impl._M_finish = std::copy(__position, end(), __i); + this->_M_deallocate(); + this->_M_impl._M_end_of_storage = (__q + ((__len + + int(_S_word_bit) - 1) + / int(_S_word_bit))); + this->_M_impl._M_start = iterator(__q, 0); + } + } + +_GLIBCXX_END_NESTED_NAMESPACE + +#endif /* _VECTOR_TCC */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/bitset b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bitset new file mode 100644 index 00000000..5ca44298 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/bitset @@ -0,0 +1,1396 @@ +// -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * Copyright (c) 1998 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file include/bitset + * This is a Standard C++ Library header. + */ + +#ifndef _GLIBCXX_BITSET +#define _GLIBCXX_BITSET 1 + +#pragma GCC system_header + +#include // For size_t +#include +#include // For invalid_argument, out_of_range, + // overflow_error +#include +#include + +#define _GLIBCXX_BITSET_BITS_PER_WORD (__CHAR_BIT__ * sizeof(unsigned long)) +#define _GLIBCXX_BITSET_WORDS(__n) \ + ((__n) < 1 ? 0 : ((__n) + _GLIBCXX_BITSET_BITS_PER_WORD - 1) \ + / _GLIBCXX_BITSET_BITS_PER_WORD) + +_GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D) + + /** + * Base class, general case. It is a class invariant that _Nw will be + * nonnegative. + * + * See documentation for bitset. + */ + template + struct _Base_bitset + { + typedef unsigned long _WordT; + + /// 0 is the least significant word. + _WordT _M_w[_Nw]; + + _Base_bitset() + { _M_do_reset(); } + + _Base_bitset(unsigned long __val) + { + _M_do_reset(); + _M_w[0] = __val; + } + + static size_t + _S_whichword(size_t __pos ) + { return __pos / _GLIBCXX_BITSET_BITS_PER_WORD; } + + static size_t + _S_whichbyte(size_t __pos ) + { return (__pos % _GLIBCXX_BITSET_BITS_PER_WORD) / __CHAR_BIT__; } + + static size_t + _S_whichbit(size_t __pos ) + { return __pos % _GLIBCXX_BITSET_BITS_PER_WORD; } + + static _WordT + _S_maskbit(size_t __pos ) + { return (static_cast<_WordT>(1)) << _S_whichbit(__pos); } + + _WordT& + _M_getword(size_t __pos) + { return _M_w[_S_whichword(__pos)]; } + + _WordT + _M_getword(size_t __pos) const + { return _M_w[_S_whichword(__pos)]; } + + _WordT& + _M_hiword() + { return _M_w[_Nw - 1]; } + + _WordT + _M_hiword() const + { return _M_w[_Nw - 1]; } + + void + _M_do_and(const _Base_bitset<_Nw>& __x) + { + for (size_t __i = 0; __i < _Nw; __i++) + _M_w[__i] &= __x._M_w[__i]; + } + + void + _M_do_or(const _Base_bitset<_Nw>& __x) + { + for (size_t __i = 0; __i < _Nw; __i++) + _M_w[__i] |= __x._M_w[__i]; + } + + void + _M_do_xor(const _Base_bitset<_Nw>& __x) + { + for (size_t __i = 0; __i < _Nw; __i++) + _M_w[__i] ^= __x._M_w[__i]; + } + + void + _M_do_left_shift(size_t __shift); + + void + _M_do_right_shift(size_t __shift); + + void + _M_do_flip() + { + for (size_t __i = 0; __i < _Nw; __i++) + _M_w[__i] = ~_M_w[__i]; + } + + void + _M_do_set() + { + for (size_t __i = 0; __i < _Nw; __i++) + _M_w[__i] = ~static_cast<_WordT>(0); + } + + void + _M_do_reset() + { __builtin_memset(_M_w, 0, _Nw * sizeof(_WordT)); } + + bool + _M_is_equal(const _Base_bitset<_Nw>& __x) const + { + for (size_t __i = 0; __i < _Nw; ++__i) + if (_M_w[__i] != __x._M_w[__i]) + return false; + return true; + } + + size_t + _M_are_all_aux() const + { + for (size_t __i = 0; __i < _Nw - 1; __i++) + if (_M_w[__i] != ~static_cast<_WordT>(0)) + return 0; + return ((_Nw - 1) * _GLIBCXX_BITSET_BITS_PER_WORD + + __builtin_popcountl(_M_hiword())); + } + + bool + _M_is_any() const + { + for (size_t __i = 0; __i < _Nw; __i++) + if (_M_w[__i] != static_cast<_WordT>(0)) + return true; + return false; + } + + size_t + _M_do_count() const + { + size_t __result = 0; + for (size_t __i = 0; __i < _Nw; __i++) + __result += __builtin_popcountl(_M_w[__i]); + return __result; + } + + unsigned long + _M_do_to_ulong() const; + + // find first "on" bit + size_t + _M_do_find_first(size_t __not_found) const; + + // find the next "on" bit that follows "prev" + size_t + _M_do_find_next(size_t __prev, size_t __not_found) const; + }; + + // Definitions of non-inline functions from _Base_bitset. + template + void + _Base_bitset<_Nw>::_M_do_left_shift(size_t __shift) + { + if (__builtin_expect(__shift != 0, 1)) + { + const size_t __wshift = __shift / _GLIBCXX_BITSET_BITS_PER_WORD; + const size_t __offset = __shift % _GLIBCXX_BITSET_BITS_PER_WORD; + + if (__offset == 0) + for (size_t __n = _Nw - 1; __n >= __wshift; --__n) + _M_w[__n] = _M_w[__n - __wshift]; + else + { + const size_t __sub_offset = (_GLIBCXX_BITSET_BITS_PER_WORD + - __offset); + for (size_t __n = _Nw - 1; __n > __wshift; --__n) + _M_w[__n] = ((_M_w[__n - __wshift] << __offset) + | (_M_w[__n - __wshift - 1] >> __sub_offset)); + _M_w[__wshift] = _M_w[0] << __offset; + } + + std::fill(_M_w + 0, _M_w + __wshift, static_cast<_WordT>(0)); + } + } + + template + void + _Base_bitset<_Nw>::_M_do_right_shift(size_t __shift) + { + if (__builtin_expect(__shift != 0, 1)) + { + const size_t __wshift = __shift / _GLIBCXX_BITSET_BITS_PER_WORD; + const size_t __offset = __shift % _GLIBCXX_BITSET_BITS_PER_WORD; + const size_t __limit = _Nw - __wshift - 1; + + if (__offset == 0) + for (size_t __n = 0; __n <= __limit; ++__n) + _M_w[__n] = _M_w[__n + __wshift]; + else + { + const size_t __sub_offset = (_GLIBCXX_BITSET_BITS_PER_WORD + - __offset); + for (size_t __n = 0; __n < __limit; ++__n) + _M_w[__n] = ((_M_w[__n + __wshift] >> __offset) + | (_M_w[__n + __wshift + 1] << __sub_offset)); + _M_w[__limit] = _M_w[_Nw-1] >> __offset; + } + + std::fill(_M_w + __limit + 1, _M_w + _Nw, static_cast<_WordT>(0)); + } + } + + template + unsigned long + _Base_bitset<_Nw>::_M_do_to_ulong() const + { + for (size_t __i = 1; __i < _Nw; ++__i) + if (_M_w[__i]) + __throw_overflow_error(__N("_Base_bitset::_M_do_to_ulong")); + return _M_w[0]; + } + + template + size_t + _Base_bitset<_Nw>::_M_do_find_first(size_t __not_found) const + { + for (size_t __i = 0; __i < _Nw; __i++) + { + _WordT __thisword = _M_w[__i]; + if (__thisword != static_cast<_WordT>(0)) + return (__i * _GLIBCXX_BITSET_BITS_PER_WORD + + __builtin_ctzl(__thisword)); + } + // not found, so return an indication of failure. + return __not_found; + } + + template + size_t + _Base_bitset<_Nw>::_M_do_find_next(size_t __prev, size_t __not_found) const + { + // make bound inclusive + ++__prev; + + // check out of bounds + if (__prev >= _Nw * _GLIBCXX_BITSET_BITS_PER_WORD) + return __not_found; + + // search first word + size_t __i = _S_whichword(__prev); + _WordT __thisword = _M_w[__i]; + + // mask off bits below bound + __thisword &= (~static_cast<_WordT>(0)) << _S_whichbit(__prev); + + if (__thisword != static_cast<_WordT>(0)) + return (__i * _GLIBCXX_BITSET_BITS_PER_WORD + + __builtin_ctzl(__thisword)); + + // check subsequent words + __i++; + for (; __i < _Nw; __i++) + { + __thisword = _M_w[__i]; + if (__thisword != static_cast<_WordT>(0)) + return (__i * _GLIBCXX_BITSET_BITS_PER_WORD + + __builtin_ctzl(__thisword)); + } + // not found, so return an indication of failure. + return __not_found; + } // end _M_do_find_next + + /** + * Base class, specialization for a single word. + * + * See documentation for bitset. + */ + template<> + struct _Base_bitset<1> + { + typedef unsigned long _WordT; + _WordT _M_w; + + _Base_bitset(void) + : _M_w(0) + { } + + _Base_bitset(unsigned long __val) + : _M_w(__val) + { } + + static size_t + _S_whichword(size_t __pos ) + { return __pos / _GLIBCXX_BITSET_BITS_PER_WORD; } + + static size_t + _S_whichbyte(size_t __pos ) + { return (__pos % _GLIBCXX_BITSET_BITS_PER_WORD) / __CHAR_BIT__; } + + static size_t + _S_whichbit(size_t __pos ) + { return __pos % _GLIBCXX_BITSET_BITS_PER_WORD; } + + static _WordT + _S_maskbit(size_t __pos ) + { return (static_cast<_WordT>(1)) << _S_whichbit(__pos); } + + _WordT& + _M_getword(size_t) + { return _M_w; } + + _WordT + _M_getword(size_t) const + { return _M_w; } + + _WordT& + _M_hiword() + { return _M_w; } + + _WordT + _M_hiword() const + { return _M_w; } + + void + _M_do_and(const _Base_bitset<1>& __x) + { _M_w &= __x._M_w; } + + void + _M_do_or(const _Base_bitset<1>& __x) + { _M_w |= __x._M_w; } + + void + _M_do_xor(const _Base_bitset<1>& __x) + { _M_w ^= __x._M_w; } + + void + _M_do_left_shift(size_t __shift) + { _M_w <<= __shift; } + + void + _M_do_right_shift(size_t __shift) + { _M_w >>= __shift; } + + void + _M_do_flip() + { _M_w = ~_M_w; } + + void + _M_do_set() + { _M_w = ~static_cast<_WordT>(0); } + + void + _M_do_reset() + { _M_w = 0; } + + bool + _M_is_equal(const _Base_bitset<1>& __x) const + { return _M_w == __x._M_w; } + + size_t + _M_are_all_aux() const + { return __builtin_popcountl(_M_w); } + + bool + _M_is_any() const + { return _M_w != 0; } + + size_t + _M_do_count() const + { return __builtin_popcountl(_M_w); } + + unsigned long + _M_do_to_ulong() const + { return _M_w; } + + size_t + _M_do_find_first(size_t __not_found) const + { + if (_M_w != 0) + return __builtin_ctzl(_M_w); + else + return __not_found; + } + + // find the next "on" bit that follows "prev" + size_t + _M_do_find_next(size_t __prev, size_t __not_found) const + { + ++__prev; + if (__prev >= ((size_t) _GLIBCXX_BITSET_BITS_PER_WORD)) + return __not_found; + + _WordT __x = _M_w >> __prev; + if (__x != 0) + return __builtin_ctzl(__x) + __prev; + else + return __not_found; + } + }; + + /** + * Base class, specialization for no storage (zero-length %bitset). + * + * See documentation for bitset. + */ + template<> + struct _Base_bitset<0> + { + typedef unsigned long _WordT; + + _Base_bitset() + { } + + _Base_bitset(unsigned long) + { } + + static size_t + _S_whichword(size_t __pos ) + { return __pos / _GLIBCXX_BITSET_BITS_PER_WORD; } + + static size_t + _S_whichbyte(size_t __pos ) + { return (__pos % _GLIBCXX_BITSET_BITS_PER_WORD) / __CHAR_BIT__; } + + static size_t + _S_whichbit(size_t __pos ) + { return __pos % _GLIBCXX_BITSET_BITS_PER_WORD; } + + static _WordT + _S_maskbit(size_t __pos ) + { return (static_cast<_WordT>(1)) << _S_whichbit(__pos); } + + // This would normally give access to the data. The bounds-checking + // in the bitset class will prevent the user from getting this far, + // but (1) it must still return an lvalue to compile, and (2) the + // user might call _Unchecked_set directly, in which case this /needs/ + // to fail. Let's not penalize zero-length users unless they actually + // make an unchecked call; all the memory ugliness is therefore + // localized to this single should-never-get-this-far function. + _WordT& + _M_getword(size_t) const + { + __throw_out_of_range(__N("_Base_bitset::_M_getword")); + return *new _WordT; + } + + _WordT + _M_hiword() const + { return 0; } + + void + _M_do_and(const _Base_bitset<0>&) + { } + + void + _M_do_or(const _Base_bitset<0>&) + { } + + void + _M_do_xor(const _Base_bitset<0>&) + { } + + void + _M_do_left_shift(size_t) + { } + + void + _M_do_right_shift(size_t) + { } + + void + _M_do_flip() + { } + + void + _M_do_set() + { } + + void + _M_do_reset() + { } + + // Are all empty bitsets equal to each other? Are they equal to + // themselves? How to compare a thing which has no state? What is + // the sound of one zero-length bitset clapping? + bool + _M_is_equal(const _Base_bitset<0>&) const + { return true; } + + size_t + _M_are_all_aux() const + { return 0; } + + bool + _M_is_any() const + { return false; } + + size_t + _M_do_count() const + { return 0; } + + unsigned long + _M_do_to_ulong() const + { return 0; } + + // Normally "not found" is the size, but that could also be + // misinterpreted as an index in this corner case. Oh well. + size_t + _M_do_find_first(size_t) const + { return 0; } + + size_t + _M_do_find_next(size_t, size_t) const + { return 0; } + }; + + + // Helper class to zero out the unused high-order bits in the highest word. + template + struct _Sanitize + { + static void _S_do_sanitize(unsigned long& __val) + { __val &= ~((~static_cast(0)) << _Extrabits); } + }; + + template<> + struct _Sanitize<0> + { static void _S_do_sanitize(unsigned long) {} }; + + /** + * @brief The %bitset class represents a @e fixed-size sequence of bits. + * + * @ingroup containers + * + * (Note that %bitset does @e not meet the formal requirements of a + * container. Mainly, it lacks iterators.) + * + * The template argument, @a Nb, may be any non-negative number, + * specifying the number of bits (e.g., "0", "12", "1024*1024"). + * + * In the general unoptimized case, storage is allocated in word-sized + * blocks. Let B be the number of bits in a word, then (Nb+(B-1))/B + * words will be used for storage. B - Nb%B bits are unused. (They are + * the high-order bits in the highest word.) It is a class invariant + * that those unused bits are always zero. + * + * If you think of %bitset as "a simple array of bits," be aware that + * your mental picture is reversed: a %bitset behaves the same way as + * bits in integers do, with the bit at index 0 in the "least significant + * / right-hand" position, and the bit at index Nb-1 in the "most + * significant / left-hand" position. Thus, unlike other containers, a + * %bitset's index "counts from right to left," to put it very loosely. + * + * This behavior is preserved when translating to and from strings. For + * example, the first line of the following program probably prints + * "b('a') is 0001100001" on a modern ASCII system. + * + * @code + * #include + * #include + * #include + * + * using namespace std; + * + * int main() + * { + * long a = 'a'; + * bitset<10> b(a); + * + * cout << "b('a') is " << b << endl; + * + * ostringstream s; + * s << b; + * string str = s.str(); + * cout << "index 3 in the string is " << str[3] << " but\n" + * << "index 3 in the bitset is " << b[3] << endl; + * } + * @endcode + * + * Also see: + * http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt12ch33s02.html + * for a description of extensions. + * + * Most of the actual code isn't contained in %bitset<> itself, but in the + * base class _Base_bitset. The base class works with whole words, not with + * individual bits. This allows us to specialize _Base_bitset for the + * important special case where the %bitset is only a single word. + * + * Extra confusion can result due to the fact that the storage for + * _Base_bitset @e is a regular array, and is indexed as such. This is + * carefully encapsulated. + */ + template + class bitset + : private _Base_bitset<_GLIBCXX_BITSET_WORDS(_Nb)> + { + private: + typedef _Base_bitset<_GLIBCXX_BITSET_WORDS(_Nb)> _Base; + typedef unsigned long _WordT; + + void + _M_do_sanitize() + { + _Sanitize<_Nb % _GLIBCXX_BITSET_BITS_PER_WORD>:: + _S_do_sanitize(this->_M_hiword()); + } + + public: + /** + * This encapsulates the concept of a single bit. An instance of this + * class is a proxy for an actual bit; this way the individual bit + * operations are done as faster word-size bitwise instructions. + * + * Most users will never need to use this class directly; conversions + * to and from bool are automatic and should be transparent. Overloaded + * operators help to preserve the illusion. + * + * (On a typical system, this "bit %reference" is 64 times the size of + * an actual bit. Ha.) + */ + class reference + { + friend class bitset; + + _WordT *_M_wp; + size_t _M_bpos; + + // left undefined + reference(); + + public: + reference(bitset& __b, size_t __pos) + { + _M_wp = &__b._M_getword(__pos); + _M_bpos = _Base::_S_whichbit(__pos); + } + + ~reference() + { } + + // For b[i] = __x; + reference& + operator=(bool __x) + { + if (__x) + *_M_wp |= _Base::_S_maskbit(_M_bpos); + else + *_M_wp &= ~_Base::_S_maskbit(_M_bpos); + return *this; + } + + // For b[i] = b[__j]; + reference& + operator=(const reference& __j) + { + if ((*(__j._M_wp) & _Base::_S_maskbit(__j._M_bpos))) + *_M_wp |= _Base::_S_maskbit(_M_bpos); + else + *_M_wp &= ~_Base::_S_maskbit(_M_bpos); + return *this; + } + + // Flips the bit + bool + operator~() const + { return (*(_M_wp) & _Base::_S_maskbit(_M_bpos)) == 0; } + + // For __x = b[i]; + operator bool() const + { return (*(_M_wp) & _Base::_S_maskbit(_M_bpos)) != 0; } + + // For b[i].flip(); + reference& + flip() + { + *_M_wp ^= _Base::_S_maskbit(_M_bpos); + return *this; + } + }; + friend class reference; + + // 23.3.5.1 constructors: + /// All bits set to zero. + bitset() + { } + + /// Initial bits bitwise-copied from a single word (others set to zero). + bitset(unsigned long __val) + : _Base(__val) + { _M_do_sanitize(); } + + /** + * @brief Use a subset of a string. + * @param s A string of '0' and '1' characters. + * @param position Index of the first character in @a s to use; + * defaults to zero. + * @throw std::out_of_range If @a pos is bigger the size of @a s. + * @throw std::invalid_argument If a character appears in the string + * which is neither '0' nor '1'. + */ + template + explicit + bitset(const std::basic_string<_CharT, _Traits, _Alloc>& __s, + size_t __position = 0) + : _Base() + { + if (__position > __s.size()) + __throw_out_of_range(__N("bitset::bitset initial position " + "not valid")); + _M_copy_from_string(__s, __position, + std::basic_string<_CharT, _Traits, _Alloc>::npos, + _CharT('0'), _CharT('1')); + } + + /** + * @brief Use a subset of a string. + * @param s A string of '0' and '1' characters. + * @param position Index of the first character in @a s to use. + * @param n The number of characters to copy. + * @throw std::out_of_range If @a pos is bigger the size of @a s. + * @throw std::invalid_argument If a character appears in the string + * which is neither '0' nor '1'. + */ + template + bitset(const std::basic_string<_CharT, _Traits, _Alloc>& __s, + size_t __position, size_t __n) + : _Base() + { + if (__position > __s.size()) + __throw_out_of_range(__N("bitset::bitset initial position " + "not valid")); + _M_copy_from_string(__s, __position, __n, _CharT('0'), _CharT('1')); + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 396. what are characters zero and one. + template + bitset(const std::basic_string<_CharT, _Traits, _Alloc>& __s, + size_t __position, size_t __n, + _CharT __zero, _CharT __one = _CharT('1')) + : _Base() + { + if (__position > __s.size()) + __throw_out_of_range(__N("bitset::bitset initial position " + "not valid")); + _M_copy_from_string(__s, __position, __n, __zero, __one); + } + + // 23.3.5.2 bitset operations: + //@{ + /** + * @brief Operations on bitsets. + * @param rhs A same-sized bitset. + * + * These should be self-explanatory. + */ + bitset<_Nb>& + operator&=(const bitset<_Nb>& __rhs) + { + this->_M_do_and(__rhs); + return *this; + } + + bitset<_Nb>& + operator|=(const bitset<_Nb>& __rhs) + { + this->_M_do_or(__rhs); + return *this; + } + + bitset<_Nb>& + operator^=(const bitset<_Nb>& __rhs) + { + this->_M_do_xor(__rhs); + return *this; + } + //@} + + //@{ + /** + * @brief Operations on bitsets. + * @param position The number of places to shift. + * + * These should be self-explanatory. + */ + bitset<_Nb>& + operator<<=(size_t __position) + { + if (__builtin_expect(__position < _Nb, 1)) + { + this->_M_do_left_shift(__position); + this->_M_do_sanitize(); + } + else + this->_M_do_reset(); + return *this; + } + + bitset<_Nb>& + operator>>=(size_t __position) + { + if (__builtin_expect(__position < _Nb, 1)) + { + this->_M_do_right_shift(__position); + this->_M_do_sanitize(); + } + else + this->_M_do_reset(); + return *this; + } + //@} + + //@{ + /** + * These versions of single-bit set, reset, flip, and test are + * extensions from the SGI version. They do no range checking. + * @ingroup SGIextensions + */ + bitset<_Nb>& + _Unchecked_set(size_t __pos) + { + this->_M_getword(__pos) |= _Base::_S_maskbit(__pos); + return *this; + } + + bitset<_Nb>& + _Unchecked_set(size_t __pos, int __val) + { + if (__val) + this->_M_getword(__pos) |= _Base::_S_maskbit(__pos); + else + this->_M_getword(__pos) &= ~_Base::_S_maskbit(__pos); + return *this; + } + + bitset<_Nb>& + _Unchecked_reset(size_t __pos) + { + this->_M_getword(__pos) &= ~_Base::_S_maskbit(__pos); + return *this; + } + + bitset<_Nb>& + _Unchecked_flip(size_t __pos) + { + this->_M_getword(__pos) ^= _Base::_S_maskbit(__pos); + return *this; + } + + bool + _Unchecked_test(size_t __pos) const + { return ((this->_M_getword(__pos) & _Base::_S_maskbit(__pos)) + != static_cast<_WordT>(0)); } + //@} + + // Set, reset, and flip. + /** + * @brief Sets every bit to true. + */ + bitset<_Nb>& + set() + { + this->_M_do_set(); + this->_M_do_sanitize(); + return *this; + } + + /** + * @brief Sets a given bit to a particular value. + * @param position The index of the bit. + * @param val Either true or false, defaults to true. + * @throw std::out_of_range If @a pos is bigger the size of the %set. + */ + bitset<_Nb>& + set(size_t __position, bool __val = true) + { + if (__position >= _Nb) + __throw_out_of_range(__N("bitset::set")); + return _Unchecked_set(__position, __val); + } + + /** + * @brief Sets every bit to false. + */ + bitset<_Nb>& + reset() + { + this->_M_do_reset(); + return *this; + } + + /** + * @brief Sets a given bit to false. + * @param position The index of the bit. + * @throw std::out_of_range If @a pos is bigger the size of the %set. + * + * Same as writing @c set(pos,false). + */ + bitset<_Nb>& + reset(size_t __position) + { + if (__position >= _Nb) + __throw_out_of_range(__N("bitset::reset")); + return _Unchecked_reset(__position); + } + + /** + * @brief Toggles every bit to its opposite value. + */ + bitset<_Nb>& + flip() + { + this->_M_do_flip(); + this->_M_do_sanitize(); + return *this; + } + + /** + * @brief Toggles a given bit to its opposite value. + * @param position The index of the bit. + * @throw std::out_of_range If @a pos is bigger the size of the %set. + */ + bitset<_Nb>& + flip(size_t __position) + { + if (__position >= _Nb) + __throw_out_of_range(__N("bitset::flip")); + return _Unchecked_flip(__position); + } + + /// See the no-argument flip(). + bitset<_Nb> + operator~() const + { return bitset<_Nb>(*this).flip(); } + + //@{ + /** + * @brief Array-indexing support. + * @param position Index into the %bitset. + * @return A bool for a 'const %bitset'. For non-const bitsets, an + * instance of the reference proxy class. + * @note These operators do no range checking and throw no exceptions, + * as required by DR 11 to the standard. + * + * _GLIBCXX_RESOLVE_LIB_DEFECTS Note that this implementation already + * resolves DR 11 (items 1 and 2), but does not do the range-checking + * required by that DR's resolution. -pme + * The DR has since been changed: range-checking is a precondition + * (users' responsibility), and these functions must not throw. -pme + */ + reference + operator[](size_t __position) + { return reference(*this,__position); } + + bool + operator[](size_t __position) const + { return _Unchecked_test(__position); } + //@} + + /** + * @brief Returns a numerical interpretation of the %bitset. + * @return The integral equivalent of the bits. + * @throw std::overflow_error If there are too many bits to be + * represented in an @c unsigned @c long. + */ + unsigned long + to_ulong() const + { return this->_M_do_to_ulong(); } + + /** + * @brief Returns a character interpretation of the %bitset. + * @return The string equivalent of the bits. + * + * Note the ordering of the bits: decreasing character positions + * correspond to increasing bit positions (see the main class notes for + * an example). + */ + template + std::basic_string<_CharT, _Traits, _Alloc> + to_string() const + { + std::basic_string<_CharT, _Traits, _Alloc> __result; + _M_copy_to_string(__result, _CharT('0'), _CharT('1')); + return __result; + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 396. what are characters zero and one. + template + std::basic_string<_CharT, _Traits, _Alloc> + to_string(_CharT __zero, _CharT __one = _CharT('1')) const + { + std::basic_string<_CharT, _Traits, _Alloc> __result; + _M_copy_to_string(__result, __zero, __one); + return __result; + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 434. bitset::to_string() hard to use. + template + std::basic_string<_CharT, _Traits, std::allocator<_CharT> > + to_string() const + { return to_string<_CharT, _Traits, std::allocator<_CharT> >(); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 853. to_string needs updating with zero and one. + template + std::basic_string<_CharT, _Traits, std::allocator<_CharT> > + to_string(_CharT __zero, _CharT __one = _CharT('1')) const + { return to_string<_CharT, _Traits, + std::allocator<_CharT> >(__zero, __one); } + + template + std::basic_string<_CharT, std::char_traits<_CharT>, + std::allocator<_CharT> > + to_string() const + { + return to_string<_CharT, std::char_traits<_CharT>, + std::allocator<_CharT> >(); + } + + template + std::basic_string<_CharT, std::char_traits<_CharT>, + std::allocator<_CharT> > + to_string(_CharT __zero, _CharT __one = _CharT('1')) const + { + return to_string<_CharT, std::char_traits<_CharT>, + std::allocator<_CharT> >(__zero, __one); + } + + std::basic_string, std::allocator > + to_string() const + { + return to_string, + std::allocator >(); + } + + std::basic_string, std::allocator > + to_string(char __zero, char __one = '1') const + { + return to_string, + std::allocator >(__zero, __one); + } + + // Helper functions for string operations. + template + void + _M_copy_from_ptr(const _CharT*, size_t, size_t, size_t, + _CharT, _CharT); + + template + void + _M_copy_from_string(const std::basic_string<_CharT, + _Traits, _Alloc>& __s, size_t __pos, size_t __n, + _CharT __zero, _CharT __one) + { _M_copy_from_ptr<_CharT, _Traits>(__s.data(), __s.size(), __pos, __n, + __zero, __one); } + + template + void + _M_copy_to_string(std::basic_string<_CharT, _Traits, _Alloc>&, + _CharT, _CharT) const; + + // NB: Backward compat. + template + void + _M_copy_from_string(const std::basic_string<_CharT, + _Traits, _Alloc>& __s, size_t __pos, size_t __n) + { _M_copy_from_string(__s, __pos, __n, _CharT('0'), _CharT('1')); } + + template + void + _M_copy_to_string(std::basic_string<_CharT, _Traits,_Alloc>& __s) const + { _M_copy_to_string(__s, _CharT('0'), _CharT('1')); } + + /// Returns the number of bits which are set. + size_t + count() const + { return this->_M_do_count(); } + + /// Returns the total number of bits. + size_t + size() const + { return _Nb; } + + //@{ + /// These comparisons for equality/inequality are, well, @e bitwise. + bool + operator==(const bitset<_Nb>& __rhs) const + { return this->_M_is_equal(__rhs); } + + bool + operator!=(const bitset<_Nb>& __rhs) const + { return !this->_M_is_equal(__rhs); } + //@} + + /** + * @brief Tests the value of a bit. + * @param position The index of a bit. + * @return The value at @a pos. + * @throw std::out_of_range If @a pos is bigger the size of the %set. + */ + bool + test(size_t __position) const + { + if (__position >= _Nb) + __throw_out_of_range(__N("bitset::test")); + return _Unchecked_test(__position); + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 693. std::bitset::all() missing. + /** + * @brief Tests whether all the bits are on. + * @return True if all the bits are set. + */ + bool + all() const + { return this->_M_are_all_aux() == _Nb; } + + /** + * @brief Tests whether any of the bits are on. + * @return True if at least one bit is set. + */ + bool + any() const + { return this->_M_is_any(); } + + /** + * @brief Tests whether any of the bits are on. + * @return True if none of the bits are set. + */ + bool + none() const + { return !this->_M_is_any(); } + + //@{ + /// Self-explanatory. + bitset<_Nb> + operator<<(size_t __position) const + { return bitset<_Nb>(*this) <<= __position; } + + bitset<_Nb> + operator>>(size_t __position) const + { return bitset<_Nb>(*this) >>= __position; } + //@} + + /** + * @brief Finds the index of the first "on" bit. + * @return The index of the first bit set, or size() if not found. + * @ingroup SGIextensions + * @sa _Find_next + */ + size_t + _Find_first() const + { return this->_M_do_find_first(_Nb); } + + /** + * @brief Finds the index of the next "on" bit after prev. + * @return The index of the next bit set, or size() if not found. + * @param prev Where to start searching. + * @ingroup SGIextensions + * @sa _Find_first + */ + size_t + _Find_next(size_t __prev ) const + { return this->_M_do_find_next(__prev, _Nb); } + }; + + // Definitions of non-inline member functions. + template + template + void + bitset<_Nb>:: + _M_copy_from_ptr(const _CharT* __s, size_t __len, + size_t __pos, size_t __n, _CharT __zero, _CharT __one) + { + reset(); + const size_t __nbits = std::min(_Nb, std::min(__n, __len - __pos)); + for (size_t __i = __nbits; __i > 0; --__i) + { + const _CharT __c = __s[__pos + __nbits - __i]; + if (_Traits::eq(__c, __zero)) + ; + else if (_Traits::eq(__c, __one)) + _Unchecked_set(__i - 1); + else + __throw_invalid_argument(__N("bitset::_M_copy_from_ptr")); + } + } + + template + template + void + bitset<_Nb>:: + _M_copy_to_string(std::basic_string<_CharT, _Traits, _Alloc>& __s, + _CharT __zero, _CharT __one) const + { + __s.assign(_Nb, __zero); + for (size_t __i = _Nb; __i > 0; --__i) + if (_Unchecked_test(__i - 1)) + _Traits::assign(__s[_Nb - __i], __one); + } + + // 23.3.5.3 bitset operations: + //@{ + /** + * @brief Global bitwise operations on bitsets. + * @param x A bitset. + * @param y A bitset of the same size as @a x. + * @return A new bitset. + * + * These should be self-explanatory. + */ + template + inline bitset<_Nb> + operator&(const bitset<_Nb>& __x, const bitset<_Nb>& __y) + { + bitset<_Nb> __result(__x); + __result &= __y; + return __result; + } + + template + inline bitset<_Nb> + operator|(const bitset<_Nb>& __x, const bitset<_Nb>& __y) + { + bitset<_Nb> __result(__x); + __result |= __y; + return __result; + } + + template + inline bitset<_Nb> + operator^(const bitset<_Nb>& __x, const bitset<_Nb>& __y) + { + bitset<_Nb> __result(__x); + __result ^= __y; + return __result; + } + //@} + + //@{ + /** + * @brief Global I/O operators for bitsets. + * + * Direct I/O between streams and bitsets is supported. Output is + * straightforward. Input will skip whitespace, only accept '0' and '1' + * characters, and will only extract as many digits as the %bitset will + * hold. + */ + template + std::basic_istream<_CharT, _Traits>& + operator>>(std::basic_istream<_CharT, _Traits>& __is, bitset<_Nb>& __x) + { + typedef typename _Traits::char_type char_type; + typedef std::basic_istream<_CharT, _Traits> __istream_type; + typedef typename __istream_type::ios_base __ios_base; + + std::basic_string<_CharT, _Traits> __tmp; + __tmp.reserve(_Nb); + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 303. Bitset input operator underspecified + const char_type __zero = __is.widen('0'); + const char_type __one = __is.widen('1'); + + typename __ios_base::iostate __state = __ios_base::goodbit; + typename __istream_type::sentry __sentry(__is); + if (__sentry) + { + __try + { + for (size_t __i = _Nb; __i > 0; --__i) + { + static typename _Traits::int_type __eof = _Traits::eof(); + + typename _Traits::int_type __c1 = __is.rdbuf()->sbumpc(); + if (_Traits::eq_int_type(__c1, __eof)) + { + __state |= __ios_base::eofbit; + break; + } + else + { + const char_type __c2 = _Traits::to_char_type(__c1); + if (_Traits::eq(__c2, __zero)) + __tmp.push_back(__zero); + else if (_Traits::eq(__c2, __one)) + __tmp.push_back(__one); + else if (_Traits:: + eq_int_type(__is.rdbuf()->sputbackc(__c2), + __eof)) + { + __state |= __ios_base::failbit; + break; + } + } + } + } + __catch(__cxxabiv1::__forced_unwind&) + { + __is._M_setstate(__ios_base::badbit); + __throw_exception_again; + } + __catch(...) + { __is._M_setstate(__ios_base::badbit); } + } + + if (__tmp.empty() && _Nb) + __state |= __ios_base::failbit; + else + __x._M_copy_from_string(__tmp, static_cast(0), _Nb, + __zero, __one); + if (__state) + __is.setstate(__state); + return __is; + } + + template + std::basic_ostream<_CharT, _Traits>& + operator<<(std::basic_ostream<_CharT, _Traits>& __os, + const bitset<_Nb>& __x) + { + std::basic_string<_CharT, _Traits> __tmp; + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 396. what are characters zero and one. + const ctype<_CharT>& __ct = use_facet >(__os.getloc()); + __x._M_copy_to_string(__tmp, __ct.widen('0'), __ct.widen('1')); + return __os << __tmp; + } + //@} + +_GLIBCXX_END_NESTED_NAMESPACE + +#undef _GLIBCXX_BITSET_WORDS +#undef _GLIBCXX_BITSET_BITS_PER_WORD + +#ifdef _GLIBCXX_DEBUG +# include +#endif + +#endif /* _GLIBCXX_BITSET */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/c++0x_warning.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/c++0x_warning.h new file mode 100644 index 00000000..b74f3396 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/c++0x_warning.h @@ -0,0 +1,36 @@ +// Copyright (C) 2007, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file include/c++0x_warning.h + * This is a Standard C++ Library header. + */ + +#ifndef _CXX0X_WARNING_H +#define _CXX0X_WARNING_H 1 + +#ifndef __GXX_EXPERIMENTAL_CXX0X__ +#error This file requires compiler and library support for the upcoming \ +ISO C++ standard, C++0x. This support is currently experimental, and must be \ +enabled with the -std=c++0x or -std=gnu++0x compiler options. +#endif + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/cassert b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cassert new file mode 100644 index 00000000..186de0fb --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cassert @@ -0,0 +1,45 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file cassert + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c assert.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 19.2 Assertions +// + +// No include guards on this header... + +#pragma GCC system_header + +#include diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/ccomplex b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ccomplex new file mode 100644 index 00000000..e347e171 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ccomplex @@ -0,0 +1,44 @@ +// -*- C++ -*- + +// Copyright (C) 2007, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file include/ccomplex + * This is a Standard C++ Library header. + */ + +#pragma GCC system_header + +#ifndef _GLIBCXX_CCOMPLEX +#define _GLIBCXX_CCOMPLEX 1 + +#ifndef __GXX_EXPERIMENTAL_CXX0X__ +# include +#endif + +#if defined(_GLIBCXX_INCLUDE_AS_TR1) +# error C++0x header cannot be included from TR1 header +#endif + +#include + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/cctype b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cctype new file mode 100644 index 00000000..44ef4d4a --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cctype @@ -0,0 +1,101 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file include/cctype + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c ctype.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: +// + +#pragma GCC system_header + +#include +#include + +#ifndef _GLIBCXX_CCTYPE +#define _GLIBCXX_CCTYPE 1 + +// Get rid of those macros defined in in lieu of real functions. +#undef isalnum +#undef isalpha +#undef iscntrl +#undef isdigit +#undef isgraph +#undef islower +#undef isprint +#undef ispunct +#undef isspace +#undef isupper +#undef isxdigit +#undef tolower +#undef toupper + +_GLIBCXX_BEGIN_NAMESPACE(std) + + using ::isalnum; + using ::isalpha; + using ::iscntrl; + using ::isdigit; + using ::isgraph; + using ::islower; + using ::isprint; + using ::ispunct; + using ::isspace; + using ::isupper; + using ::isxdigit; + using ::tolower; + using ::toupper; + +_GLIBCXX_END_NAMESPACE + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ +# if defined(_GLIBCXX_INCLUDE_AS_TR1) +# error C++0x header cannot be included from TR1 header +# endif +# if defined(_GLIBCXX_INCLUDE_AS_CXX0X) +# include +# else +# define _GLIBCXX_INCLUDE_AS_CXX0X +# define _GLIBCXX_BEGIN_NAMESPACE_TR1 +# define _GLIBCXX_END_NAMESPACE_TR1 +# define _GLIBCXX_TR1 +# include +# undef _GLIBCXX_TR1 +# undef _GLIBCXX_END_NAMESPACE_TR1 +# undef _GLIBCXX_BEGIN_NAMESPACE_TR1 +# undef _GLIBCXX_INCLUDE_AS_CXX0X +# endif +#endif + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/cerrno b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cerrno new file mode 100644 index 00000000..37164293 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cerrno @@ -0,0 +1,53 @@ +// The -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file cerrno + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c errno.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 19.3 Error numbers +// + +#pragma GCC system_header + +#include + +#ifndef _GLIBCXX_CERRNO +#define _GLIBCXX_CERRNO 1 + +// Adhere to section 17.4.1.2 clause 5 of ISO 14882:1998 +#ifndef errno +#define errno errno +#endif + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/cfenv b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cfenv new file mode 100644 index 00000000..9b02c8cb --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cfenv @@ -0,0 +1,61 @@ +// -*- C++ -*- + +// Copyright (C) 2007, 2008, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file include/cfenv + * This is a Standard C++ Library header. + */ + +#ifndef _GLIBCXX_CFENV +#define _GLIBCXX_CFENV 1 + +#pragma GCC system_header + +#ifndef __GXX_EXPERIMENTAL_CXX0X__ +# include +#endif + +#if defined(_GLIBCXX_INCLUDE_AS_TR1) +# error C++0x header cannot be included from TR1 header +#endif + +#include +#if _GLIBCXX_HAVE_FENV_H +# include +#endif + +#if defined(_GLIBCXX_INCLUDE_AS_CXX0X) +# include +#else +# define _GLIBCXX_INCLUDE_AS_CXX0X +# define _GLIBCXX_BEGIN_NAMESPACE_TR1 +# define _GLIBCXX_END_NAMESPACE_TR1 +# define _GLIBCXX_TR1 +# include +# undef _GLIBCXX_TR1 +# undef _GLIBCXX_END_NAMESPACE_TR1 +# undef _GLIBCXX_BEGIN_NAMESPACE_TR1 +# undef _GLIBCXX_INCLUDE_AS_CXX0X +#endif + +#endif // _GLIBCXX_CFENV diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/cfloat b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cfloat new file mode 100644 index 00000000..54eb7788 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cfloat @@ -0,0 +1,60 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file include/cfloat + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c float.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 18.2.2 Implementation properties: C library +// + +#pragma GCC system_header + +#include + +#ifndef _GLIBCXX_CFLOAT +#define _GLIBCXX_CFLOAT 1 + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ +# if defined(_GLIBCXX_INCLUDE_AS_TR1) +# error C++0x header cannot be included from TR1 header +# endif +# ifndef DECIMAL_DIG +# define DECIMAL_DIG __DECIMAL_DIG__ +# endif +# ifndef FLT_EVAL_METHOD +# define FLT_EVAL_METHOD __FLT_EVAL_METHOD__ +# endif +#endif + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/chrono b/mingw/lib/gcc/mingw32/4.4.0/include/c++/chrono new file mode 100644 index 00000000..aaa9646f --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/chrono @@ -0,0 +1,672 @@ +// -*- C++ -*- + +// Copyright (C) 2008, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file include/chrono + * This is a Standard C++ Library header. + */ + +#ifndef _GLIBCXX_CHRONO +#define _GLIBCXX_CHRONO 1 + +#pragma GCC system_header + +#ifndef __GXX_EXPERIMENTAL_CXX0X__ +# include +#else + +#ifdef _GLIBCXX_INCLUDE_AS_TR1 +# error C++0x header cannot be included from TR1 header +#endif + +#include +#include +#include +#include + +#ifdef _GLIBCXX_USE_C99_STDINT_TR1 + +namespace std +{ + /** + * @defgroup chrono Time + * @ingroup utilities + * + * Classes and functions for time. + * @{ + */ + + /** @namespace std::chrono + * @brief ISO C++ 0x entities sub namespace for time and date. + */ + namespace chrono + { + template> + struct duration; + + template + struct time_point; + } + + // 20.8.2.3 specialization of common_type (for duration) + template + struct common_type, + chrono::duration<_Rep2, _Period2>> + { + typedef chrono::duration::type, + ratio<__static_gcd<_Period1::num, _Period2::num>::value, + (_Period1::den / __static_gcd<_Period1::den, _Period2::den>::value) + * _Period2::den>> type; + }; + + // 20.8.2.3 specialization of common_type (for time_point) + template + struct common_type, + chrono::time_point<_Clock, _Duration2>> + { + typedef chrono::time_point<_Clock, + typename common_type<_Duration1, _Duration2>::type> type; + }; + + namespace chrono + { + // Primary template for duration_cast impl. + template + struct __duration_cast_impl + { + template + static _ToDuration __cast(const duration<_Rep, _Period>& __d) + { + return _ToDuration(static_cast< + typename _ToDuration::rep>(static_cast<_CR>(__d.count()) + * static_cast<_CR>(_CF::num) + / static_cast<_CR>(_CF::den))); + } + }; + + template + struct __duration_cast_impl<_ToDuration, _CF, _CR, true, true> + { + template + static _ToDuration __cast(const duration<_Rep, _Period>& __d) + { + return _ToDuration( + static_cast(__d.count())); + } + }; + + template + struct __duration_cast_impl<_ToDuration, _CF, _CR, true, false> + { + template + static _ToDuration __cast(const duration<_Rep, _Period>& __d) + { + return _ToDuration(static_cast( + static_cast<_CR>(__d.count()) / static_cast<_CR>(_CF::den))); + } + }; + + template + struct __duration_cast_impl<_ToDuration, _CF, _CR, false, true> + { + template + static _ToDuration __cast(const duration<_Rep, _Period>& __d) + { + return _ToDuration(static_cast( + static_cast<_CR>(__d.count()) * static_cast<_CR>(_CF::num))); + } + }; + + /// duration_cast + template + inline _ToDuration + duration_cast(const duration<_Rep, _Period>& __d) + { + typedef typename + ratio_divide<_Period, typename _ToDuration::period>::type __cf; + typedef typename + common_type::type __cr; + + return __duration_cast_impl<_ToDuration, __cf, __cr, + __cf::num == 1, __cf::den == 1>::__cast(__d); + } + + /// treat_as_floating_point + template + struct treat_as_floating_point + : is_floating_point<_Rep> + { }; + + /// duration_values + template + struct duration_values + { + static const _Rep + zero() + { return _Rep(0); } + + static const _Rep + max() + { return numeric_limits<_Rep>::max(); } + + static const _Rep + min() + { return numeric_limits<_Rep>::min(); } + }; + + template + struct __is_duration + : std::false_type + { }; + + template + struct __is_duration> + : std::true_type + { }; + + template + struct __is_ratio + : std::false_type + { }; + + template + struct __is_ratio> + : std::true_type + { }; + + /// duration + template + struct duration + { + static_assert(!__is_duration<_Rep>::value, "rep cannot be a duration"); + static_assert(__is_ratio<_Period>::value, + "period must be a specialization of ratio"); + static_assert(_Period::num > 0, "period must be positive"); + + typedef _Rep rep; + typedef _Period period; + + // 20.8.3.1 construction / copy / destroy + duration() = default; + + template + explicit duration(_Rep2 const& __rep) + : __r(static_cast(__rep)) + { + static_assert(is_convertible<_Rep2,rep>::value + && (treat_as_floating_point::value + || !treat_as_floating_point<_Rep2>::value), + "cannot construct integral duration with floating point type"); + } + + template + duration(const duration<_Rep2, _Period2>& __d) + : __r(duration_cast(__d).count()) + { + static_assert(treat_as_floating_point::value == true + || ratio_divide<_Period2, period>::type::den == 1, + "the resulting duration is not exactly representable"); + } + + ~duration() = default; + duration(const duration&) = default; + duration& operator=(const duration&) = default; + + // 20.8.3.2 observer + rep + count() const + { return __r; } + + // 20.8.3.3 arithmetic + duration + operator+() const + { return *this; } + + duration + operator-() const + { return duration(-__r); } + + duration& + operator++() + { + ++__r; + return *this; + } + + duration + operator++(int) + { return duration(__r++); } + + duration& + operator--() + { + --__r; + return *this; + } + + duration + operator--(int) + { return duration(__r--); } + + duration& + operator+=(const duration& __d) + { + __r += __d.count(); + return *this; + } + + duration& + operator-=(const duration& __d) + { + __r -= __d.count(); + return *this; + } + + duration& + operator*=(const rep& __rhs) + { + __r *= __rhs; + return *this; + } + + duration& + operator/=(const rep& __rhs) + { + __r /= __rhs; + return *this; + } + + // 20.8.3.4 special values + // TODO: These should be constexprs. + static const duration + zero() + { return duration(duration_values::zero()); } + + static const duration + min() + { return duration(duration_values::min()); } + + static const duration + max() + { return duration(duration_values::max()); } + + private: + rep __r; + }; + + template + inline typename common_type, + duration<_Rep2, _Period2>>::type + operator+(const duration<_Rep1, _Period1>& __lhs, + const duration<_Rep2, _Period2>& __rhs) + { + typedef typename common_type, + duration<_Rep2, _Period2>>::type __ct; + return __ct(__lhs) += __rhs; + } + + template + inline typename common_type, + duration<_Rep2, _Period2>>::type + operator-(const duration<_Rep1, _Period1>& __lhs, + const duration<_Rep2, _Period2>& __rhs) + { + typedef typename common_type, + duration<_Rep2, _Period2>>::type __ct; + return __ct(__lhs) -= __rhs; + } + + template + inline duration::type, _Period> + operator*(const duration<_Rep1, _Period>& __d, const _Rep2& __s) + { + typedef typename common_type<_Rep1, _Rep2>::type __cr; + return duration<__cr, _Period>(__d) *= __s; + } + + template + inline duration::type, _Period> + operator*(const _Rep2& __s, const duration<_Rep1, _Period>& __d) + { return __d * __s; } + + template + struct __division_impl; + + template + struct __division_impl, _Rep2, + typename enable_if::value>::type> + { + typedef typename common_type<_Rep1, _Rep2>::type __cr; + typedef + duration::type, _Period> __rt; + + static __rt + __divide(const duration<_Rep1, _Period>& __d, const _Rep2& __s) + { return duration<__cr, _Period>(__d) /= __s; } + }; + + template + struct __division_impl, + duration<_Rep2, _Period2>> + { + typedef typename common_type, + duration<_Rep2, _Period2>>::type __ct; + typedef typename common_type<_Rep1, _Rep2>::type __rt; + + static __rt + __divide(const duration<_Rep1, _Period1>& __lhs, + const duration<_Rep2, _Period2>& __rhs) + { return __ct(__lhs).count() / __ct(__rhs).count(); } + }; + + template + inline typename __division_impl, _Up>::__rt + operator/(const duration<_Rep, _Period>& __d, const _Up& __u) + { + return + __division_impl, _Up>::__divide(__d, __u); + } + + // comparisons + template + inline bool + operator==(const duration<_Rep1, _Period1>& __lhs, + const duration<_Rep2, _Period2>& __rhs) + { + typedef typename common_type, + duration<_Rep2, _Period2>>::type __ct; + return __ct(__lhs).count() == __ct(__rhs).count(); + } + + template + inline bool + operator<(const duration<_Rep1, _Period1>& __lhs, + const duration<_Rep2, _Period2>& __rhs) + { + typedef typename common_type, + duration<_Rep2, _Period2>>::type __ct; + return __ct(__lhs).count() < __ct(__rhs).count(); + } + + template + inline bool + operator!=(const duration<_Rep1, _Period1>& __lhs, + const duration<_Rep2, _Period2>& __rhs) + { return !(__lhs == __rhs); } + + template + inline bool + operator<=(const duration<_Rep1, _Period1>& __lhs, + const duration<_Rep2, _Period2>& __rhs) + { return !(__rhs < __lhs); } + + template + inline bool + operator>(const duration<_Rep1, _Period1>& __lhs, + const duration<_Rep2, _Period2>& __rhs) + { return __rhs < __lhs; } + + template + inline bool + operator>=(const duration<_Rep1, _Period1>& __lhs, + const duration<_Rep2, _Period2>& __rhs) + { return !(__lhs < __rhs); } + + /// nanoseconds + typedef duration nanoseconds; + + /// microseconds + typedef duration microseconds; + + /// milliseconds + typedef duration milliseconds; + + /// seconds + typedef duration seconds; + + /// minutes + typedef duration> minutes; + + /// hours + typedef duration> hours; + + /// time_point + template + struct time_point + { + typedef _Clock clock; + typedef _Duration duration; + typedef typename duration::rep rep; + typedef typename duration::period period; + + time_point() : __d(duration::zero()) + { } + + explicit time_point(const duration& __dur) + : __d(duration::zero() + __dur) + { } + + // conversions + template + time_point(const time_point& __t) + : __d(__t.time_since_epoch()) + { } + + // observer + duration + time_since_epoch() const + { return __d; } + + // arithmetic + time_point& + operator+=(const duration& __dur) + { + __d += __dur; + return *this; + } + + time_point& + operator-=(const duration& __dur) + { + __d -= __dur; + return *this; + } + + // special values + // TODO: These should be constexprs. + static const time_point + min() + { return time_point(duration::min()); } + + static const time_point + max() + { return time_point(duration::max()); } + + private: + duration __d; + }; + + /// time_point_cast + template + inline time_point<_Clock, _ToDuration> + time_point_cast(const time_point<_Clock, _Duration>& __t) + { + return time_point<_Clock, _ToDuration>( + duration_cast<_ToDuration>(__t.time_since_epoch())); + } + + template + inline time_point<_Clock, + typename common_type<_Duration1, duration<_Rep2, _Period2>>::type> + operator+(const time_point<_Clock, _Duration1>& __lhs, + const duration<_Rep2, _Period2>& __rhs) + { + typedef time_point<_Clock, + typename common_type<_Duration1, + duration<_Rep2, _Period2>>::type> __ct; + return __ct(__lhs) += __rhs; + } + + template + inline time_point<_Clock, + typename common_type, _Duration2>::type> + operator+(const duration<_Rep1, _Period1>& __lhs, + const time_point<_Clock, _Duration2>& __rhs) + { return __rhs + __lhs; } + + template + inline time_point<_Clock, + typename common_type<_Duration1, duration<_Rep2, _Period2>>::type> + operator-(const time_point<_Clock, _Duration1>& __lhs, + const duration<_Rep2, _Period2>& __rhs) + { return __lhs + (-__rhs); } + + template + inline typename common_type<_Duration1, _Duration2>::type + operator-(const time_point<_Clock, _Duration1>& __lhs, + const time_point<_Clock, _Duration2>& __rhs) + { return __lhs.time_since_epoch() - __rhs.time_since_epoch(); } + + template + inline bool + operator==(const time_point<_Clock, _Duration1>& __lhs, + const time_point<_Clock, _Duration2>& __rhs) + { return __lhs.time_since_epoch() == __rhs.time_since_epoch(); } + + template + inline bool + operator!=(const time_point<_Clock, _Duration1>& __lhs, + const time_point<_Clock, _Duration2>& __rhs) + { return !(__lhs == __rhs); } + + template + inline bool + operator<(const time_point<_Clock, _Duration1>& __lhs, + const time_point<_Clock, _Duration2>& __rhs) + { return __lhs.time_since_epoch() < __rhs.time_since_epoch(); } + + template + inline bool + operator<=(const time_point<_Clock, _Duration1>& __lhs, + const time_point<_Clock, _Duration2>& __rhs) + { return !(__rhs < __lhs); } + + template + inline bool + operator>(const time_point<_Clock, _Duration1>& __lhs, + const time_point<_Clock, _Duration2>& __rhs) + { return __rhs < __lhs; } + + template + inline bool + operator>=(const time_point<_Clock, _Duration1>& __lhs, + const time_point<_Clock, _Duration2>& __rhs) + { return !(__lhs < __rhs); } + + /// system_clock + struct system_clock + { +#ifdef _GLIBCXX_USE_CLOCK_REALTIME + typedef chrono::nanoseconds duration; +#elif defined(_GLIBCXX_USE_GETTIMEOFDAY) + typedef chrono::microseconds duration; +#else + typedef chrono::seconds duration; +#endif + + typedef duration::rep rep; + typedef duration::period period; + typedef chrono::time_point time_point; + + static const bool is_monotonic = false; + + static time_point + now(); + + // Map to C API + static std::time_t + to_time_t(const time_point& __t) + { + return std::time_t( + duration_cast(__t.time_since_epoch()).count()); + } + + static time_point + from_time_t(std::time_t __t) + { + return time_point_cast( + chrono::time_point( + chrono::seconds(__t))); + } + + // TODO: requires constexpr + /* + static_assert( + system_clock::duration::min() < + system_clock::duration::zero(), + "a clock's minimum duration cannot be less than its epoch"); + */ + }; + +#ifdef _GLIBCXX_USE_CLOCK_MONOTONIC + /// monotonic_clock + struct monotonic_clock + { + typedef chrono::nanoseconds duration; + typedef duration::rep rep; + typedef duration::period period; + typedef chrono::time_point time_point; + + static const bool is_monotonic = true; + + static time_point + now(); + }; +#else + typedef system_clock monotonic_clock; +#endif + + typedef system_clock high_resolution_clock; + } // namespace chrono + + // @} group chrono +} // namespace std + +#endif //_GLIBCXX_USE_C99_STDINT_TR1 + +#endif //__GXX_EXPERIMENTAL_CXX0X__ + +#endif //_GLIBCXX_CHRONO diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/cinttypes b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cinttypes new file mode 100644 index 00000000..5ed1a212 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cinttypes @@ -0,0 +1,71 @@ +// -*- C++ -*- + +// Copyright (C) 2007, 2008, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file include/cinttypes + * This is a Standard C++ Library header. + */ + +#ifndef _GLIBCXX_CINTTYPES +#define _GLIBCXX_CINTTYPES 1 + +#pragma GCC system_header + +#ifndef __GXX_EXPERIMENTAL_CXX0X__ +# include +#endif + +#if defined(_GLIBCXX_INCLUDE_AS_TR1) +# error C++0x header cannot be included from TR1 header +#endif + +#include + +// For 8.11.1/1 (see C99, Note 184) +#if _GLIBCXX_HAVE_INTTYPES_H +# ifndef __STDC_FORMAT_MACROS +# define _UNDEF__STDC_FORMAT_MACROS +# define __STDC_FORMAT_MACROS +# endif +# include +# ifdef _UNDEF__STDC_FORMAT_MACROS +# undef __STDC_FORMAT_MACROS +# undef _UNDEF__STDC_FORMAT_MACROS +# endif +#endif + +#if defined(_GLIBCXX_INCLUDE_AS_CXX0X) +# include +#else +# define _GLIBCXX_INCLUDE_AS_CXX0X +# define _GLIBCXX_BEGIN_NAMESPACE_TR1 +# define _GLIBCXX_END_NAMESPACE_TR1 +# define _GLIBCXX_TR1 +# include +# undef _GLIBCXX_TR1 +# undef _GLIBCXX_END_NAMESPACE_TR1 +# undef _GLIBCXX_BEGIN_NAMESPACE_TR1 +# undef _GLIBCXX_INCLUDE_AS_CXX0X +#endif + +#endif // _GLIBCXX_CINTTYPES diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/ciso646 b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ciso646 new file mode 100644 index 00000000..a3c3f9b7 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ciso646 @@ -0,0 +1,33 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file ciso646 + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c iso646.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/climits b/mingw/lib/gcc/mingw32/4.4.0/include/c++/climits new file mode 100644 index 00000000..943d69e5 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/climits @@ -0,0 +1,60 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file include/climits + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c limits.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 18.2.2 Implementation properties: C library +// + +#pragma GCC system_header + +#include + +#ifndef _GLIBCXX_CLIMITS +#define _GLIBCXX_CLIMITS 1 + +#ifndef LLONG_MIN +#define LLONG_MIN (-__LONG_LONG_MAX__ - 1) +#endif + +#ifndef LLONG_MAX +#define LLONG_MAX __LONG_LONG_MAX__ +#endif + +#ifndef ULLONG_MAX +#define ULLONG_MAX (__LONG_LONG_MAX__ * 2ULL + 1) +#endif + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/clocale b/mingw/lib/gcc/mingw32/4.4.0/include/c++/clocale new file mode 100644 index 00000000..eb955c9b --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/clocale @@ -0,0 +1,61 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file clocale + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c locale.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 18.2.2 Implementation properties: C library +// + +#pragma GCC system_header + +#include +#include + +#ifndef _GLIBCXX_CLOCALE +#define _GLIBCXX_CLOCALE 1 + +// Get rid of those macros defined in in lieu of real functions. +#undef setlocale +#undef localeconv + +_GLIBCXX_BEGIN_NAMESPACE(std) + + using ::lconv; + using ::setlocale; + using ::localeconv; + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/cmath b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cmath new file mode 100644 index 00000000..9a63a011 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cmath @@ -0,0 +1,631 @@ +// -*- C++ -*- C forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file include/cmath + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c math.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 26.5 C library +// + +#pragma GCC system_header + +#include +#include +#include +#include + +#ifndef _GLIBCXX_CMATH +#define _GLIBCXX_CMATH 1 + +// Get rid of those macros defined in in lieu of real functions. +#undef abs +#undef div +#undef acos +#undef asin +#undef atan +#undef atan2 +#undef ceil +#undef cos +#undef cosh +#undef exp +#undef fabs +#undef floor +#undef fmod +#undef frexp +#undef ldexp +#undef log +#undef log10 +#undef modf +#undef pow +#undef sin +#undef sinh +#undef sqrt +#undef tan +#undef tanh + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // Forward declaration of a helper function. This really should be + // an `exported' forward declaration. + template + _Tp __cmath_power(_Tp, unsigned int); + + template + inline _Tp + __pow_helper(_Tp __x, int __n) + { + return __n < 0 + ? _Tp(1)/__cmath_power(__x, -__n) + : __cmath_power(__x, __n); + } + + inline double + abs(double __x) + { return __builtin_fabs(__x); } + + inline float + abs(float __x) + { return __builtin_fabsf(__x); } + + inline long double + abs(long double __x) + { return __builtin_fabsl(__x); } + + using ::acos; + + inline float + acos(float __x) + { return __builtin_acosf(__x); } + + inline long double + acos(long double __x) + { return __builtin_acosl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + acos(_Tp __x) + { return __builtin_acos(__x); } + + using ::asin; + + inline float + asin(float __x) + { return __builtin_asinf(__x); } + + inline long double + asin(long double __x) + { return __builtin_asinl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + asin(_Tp __x) + { return __builtin_asin(__x); } + + using ::atan; + + inline float + atan(float __x) + { return __builtin_atanf(__x); } + + inline long double + atan(long double __x) + { return __builtin_atanl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + atan(_Tp __x) + { return __builtin_atan(__x); } + + using ::atan2; + + inline float + atan2(float __y, float __x) + { return __builtin_atan2f(__y, __x); } + + inline long double + atan2(long double __y, long double __x) + { return __builtin_atan2l(__y, __x); } + + template + inline + typename __gnu_cxx::__promote_2< + typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value + && __is_arithmetic<_Up>::__value, + _Tp>::__type, _Up>::__type + atan2(_Tp __y, _Up __x) + { + typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type; + return atan2(__type(__y), __type(__x)); + } + + using ::ceil; + + inline float + ceil(float __x) + { return __builtin_ceilf(__x); } + + inline long double + ceil(long double __x) + { return __builtin_ceill(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + ceil(_Tp __x) + { return __builtin_ceil(__x); } + + using ::cos; + + inline float + cos(float __x) + { return __builtin_cosf(__x); } + + inline long double + cos(long double __x) + { return __builtin_cosl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + cos(_Tp __x) + { return __builtin_cos(__x); } + + using ::cosh; + + inline float + cosh(float __x) + { return __builtin_coshf(__x); } + + inline long double + cosh(long double __x) + { return __builtin_coshl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + cosh(_Tp __x) + { return __builtin_cosh(__x); } + + using ::exp; + + inline float + exp(float __x) + { return __builtin_expf(__x); } + + inline long double + exp(long double __x) + { return __builtin_expl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + exp(_Tp __x) + { return __builtin_exp(__x); } + + using ::fabs; + + inline float + fabs(float __x) + { return __builtin_fabsf(__x); } + + inline long double + fabs(long double __x) + { return __builtin_fabsl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + fabs(_Tp __x) + { return __builtin_fabs(__x); } + + using ::floor; + + inline float + floor(float __x) + { return __builtin_floorf(__x); } + + inline long double + floor(long double __x) + { return __builtin_floorl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + floor(_Tp __x) + { return __builtin_floor(__x); } + + using ::fmod; + + inline float + fmod(float __x, float __y) + { return __builtin_fmodf(__x, __y); } + + inline long double + fmod(long double __x, long double __y) + { return __builtin_fmodl(__x, __y); } + + using ::frexp; + + inline float + frexp(float __x, int* __exp) + { return __builtin_frexpf(__x, __exp); } + + inline long double + frexp(long double __x, int* __exp) + { return __builtin_frexpl(__x, __exp); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + frexp(_Tp __x, int* __exp) + { return __builtin_frexp(__x, __exp); } + + using ::ldexp; + + inline float + ldexp(float __x, int __exp) + { return __builtin_ldexpf(__x, __exp); } + + inline long double + ldexp(long double __x, int __exp) + { return __builtin_ldexpl(__x, __exp); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + ldexp(_Tp __x, int __exp) + { return __builtin_ldexp(__x, __exp); } + + using ::log; + + inline float + log(float __x) + { return __builtin_logf(__x); } + + inline long double + log(long double __x) + { return __builtin_logl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + log(_Tp __x) + { return __builtin_log(__x); } + + using ::log10; + + inline float + log10(float __x) + { return __builtin_log10f(__x); } + + inline long double + log10(long double __x) + { return __builtin_log10l(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + log10(_Tp __x) + { return __builtin_log10(__x); } + + using ::modf; + + inline float + modf(float __x, float* __iptr) + { return __builtin_modff(__x, __iptr); } + + inline long double + modf(long double __x, long double* __iptr) + { return __builtin_modfl(__x, __iptr); } + + using ::pow; + + inline float + pow(float __x, float __y) + { return __builtin_powf(__x, __y); } + + inline long double + pow(long double __x, long double __y) + { return __builtin_powl(__x, __y); } + +#ifndef __GXX_EXPERIMENTAL_CXX0X__ + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 550. What should the return type of pow(float,int) be? + inline double + pow(double __x, int __i) + { return __builtin_powi(__x, __i); } + + inline float + pow(float __x, int __n) + { return __builtin_powif(__x, __n); } + + inline long double + pow(long double __x, int __n) + { return __builtin_powil(__x, __n); } +#endif + + template + inline + typename __gnu_cxx::__promote_2< + typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value + && __is_arithmetic<_Up>::__value, + _Tp>::__type, _Up>::__type + pow(_Tp __x, _Up __y) + { + typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type; + return pow(__type(__x), __type(__y)); + } + + using ::sin; + + inline float + sin(float __x) + { return __builtin_sinf(__x); } + + inline long double + sin(long double __x) + { return __builtin_sinl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + sin(_Tp __x) + { return __builtin_sin(__x); } + + using ::sinh; + + inline float + sinh(float __x) + { return __builtin_sinhf(__x); } + + inline long double + sinh(long double __x) + { return __builtin_sinhl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + sinh(_Tp __x) + { return __builtin_sinh(__x); } + + using ::sqrt; + + inline float + sqrt(float __x) + { return __builtin_sqrtf(__x); } + + inline long double + sqrt(long double __x) + { return __builtin_sqrtl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + sqrt(_Tp __x) + { return __builtin_sqrt(__x); } + + using ::tan; + + inline float + tan(float __x) + { return __builtin_tanf(__x); } + + inline long double + tan(long double __x) + { return __builtin_tanl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + tan(_Tp __x) + { return __builtin_tan(__x); } + + using ::tanh; + + inline float + tanh(float __x) + { return __builtin_tanhf(__x); } + + inline long double + tanh(long double __x) + { return __builtin_tanhl(__x); } + + template + inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, + double>::__type + tanh(_Tp __x) + { return __builtin_tanh(__x); } + +_GLIBCXX_END_NAMESPACE + +#if _GLIBCXX_USE_C99_MATH +#if !_GLIBCXX_USE_C99_FP_MACROS_DYNAMIC + +// These are possible macros imported from C99-land. +#undef fpclassify +#undef isfinite +#undef isinf +#undef isnan +#undef isnormal +#undef signbit +#undef isgreater +#undef isgreaterequal +#undef isless +#undef islessequal +#undef islessgreater +#undef isunordered + +_GLIBCXX_BEGIN_NAMESPACE(std) + + template + inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, + int>::__type + fpclassify(_Tp __f) + { + typedef typename __gnu_cxx::__promote<_Tp>::__type __type; + return __builtin_fpclassify(FP_NAN, FP_INFINITE, FP_NORMAL, + FP_SUBNORMAL, FP_ZERO, __type(__f)); + } + + template + inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, + int>::__type + isfinite(_Tp __f) + { + typedef typename __gnu_cxx::__promote<_Tp>::__type __type; + return __builtin_isfinite(__type(__f)); + } + + template + inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, + int>::__type + isinf(_Tp __f) + { + typedef typename __gnu_cxx::__promote<_Tp>::__type __type; + return __builtin_isinf(__type(__f)); + } + + template + inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, + int>::__type + isnan(_Tp __f) + { + typedef typename __gnu_cxx::__promote<_Tp>::__type __type; + return __builtin_isnan(__type(__f)); + } + + template + inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, + int>::__type + isnormal(_Tp __f) + { + typedef typename __gnu_cxx::__promote<_Tp>::__type __type; + return __builtin_isnormal(__type(__f)); + } + + template + inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, + int>::__type + signbit(_Tp __f) + { + typedef typename __gnu_cxx::__promote<_Tp>::__type __type; + return __builtin_signbit(__type(__f)); + } + + template + inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, + int>::__type + isgreater(_Tp __f1, _Tp __f2) + { + typedef typename __gnu_cxx::__promote<_Tp>::__type __type; + return __builtin_isgreater(__type(__f1), __type(__f2)); + } + + template + inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, + int>::__type + isgreaterequal(_Tp __f1, _Tp __f2) + { + typedef typename __gnu_cxx::__promote<_Tp>::__type __type; + return __builtin_isgreaterequal(__type(__f1), __type(__f2)); + } + + template + inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, + int>::__type + isless(_Tp __f1, _Tp __f2) + { + typedef typename __gnu_cxx::__promote<_Tp>::__type __type; + return __builtin_isless(__type(__f1), __type(__f2)); + } + + template + inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, + int>::__type + islessequal(_Tp __f1, _Tp __f2) + { + typedef typename __gnu_cxx::__promote<_Tp>::__type __type; + return __builtin_islessequal(__type(__f1), __type(__f2)); + } + + template + inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, + int>::__type + islessgreater(_Tp __f1, _Tp __f2) + { + typedef typename __gnu_cxx::__promote<_Tp>::__type __type; + return __builtin_islessgreater(__type(__f1), __type(__f2)); + } + + template + inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, + int>::__type + isunordered(_Tp __f1, _Tp __f2) + { + typedef typename __gnu_cxx::__promote<_Tp>::__type __type; + return __builtin_isunordered(__type(__f1), __type(__f2)); + } + +_GLIBCXX_END_NAMESPACE + +#endif /* _GLIBCXX_USE_C99_FP_MACROS_DYNAMIC */ +#endif + +#ifndef _GLIBCXX_EXPORT_TEMPLATE +# include +#endif + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ +# if defined(_GLIBCXX_INCLUDE_AS_TR1) +# error C++0x header cannot be included from TR1 header +# endif +# if defined(_GLIBCXX_INCLUDE_AS_CXX0X) +# include +# else +# define _GLIBCXX_INCLUDE_AS_CXX0X +# define _GLIBCXX_BEGIN_NAMESPACE_TR1 +# define _GLIBCXX_END_NAMESPACE_TR1 +# define _GLIBCXX_TR1 +# include +# undef _GLIBCXX_TR1 +# undef _GLIBCXX_END_NAMESPACE_TR1 +# undef _GLIBCXX_BEGIN_NAMESPACE_TR1 +# undef _GLIBCXX_INCLUDE_AS_CXX0X +# endif +#endif + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/complex b/mingw/lib/gcc/mingw32/4.4.0/include/c++/complex new file mode 100644 index 00000000..4c0d3fbe --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/complex @@ -0,0 +1,1587 @@ +// The template and inlines for the -*- C++ -*- complex number classes. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file include/complex + * This is a Standard C++ Library header. + */ + +// +// ISO C++ 14882: 26.2 Complex Numbers +// Note: this is not a conforming implementation. +// Initially implemented by Ulrich Drepper +// Improved by Gabriel Dos Reis +// + +#ifndef _GLIBCXX_COMPLEX +#define _GLIBCXX_COMPLEX 1 + +#pragma GCC system_header + +#include +#include +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /** + * @defgroup complex_numbers Complex Numbers + * @ingroup numerics + * + * Classes and functions for complex numbers. + * @{ + */ + + // Forward declarations. + template class complex; + template<> class complex; + template<> class complex; + template<> class complex; + + /// Return magnitude of @a z. + template _Tp abs(const complex<_Tp>&); + /// Return phase angle of @a z. + template _Tp arg(const complex<_Tp>&); + /// Return @a z magnitude squared. + template _Tp norm(const complex<_Tp>&); + + /// Return complex conjugate of @a z. + template complex<_Tp> conj(const complex<_Tp>&); + /// Return complex with magnitude @a rho and angle @a theta. + template complex<_Tp> polar(const _Tp&, const _Tp& = 0); + + // Transcendentals: + /// Return complex cosine of @a z. + template complex<_Tp> cos(const complex<_Tp>&); + /// Return complex hyperbolic cosine of @a z. + template complex<_Tp> cosh(const complex<_Tp>&); + /// Return complex base e exponential of @a z. + template complex<_Tp> exp(const complex<_Tp>&); + /// Return complex natural logarithm of @a z. + template complex<_Tp> log(const complex<_Tp>&); + /// Return complex base 10 logarithm of @a z. + template complex<_Tp> log10(const complex<_Tp>&); +#ifndef __GXX_EXPERIMENTAL_CXX0X__ + // DR 844. + /// Return @a x to the @a y'th power. + template complex<_Tp> pow(const complex<_Tp>&, int); +#endif + /// Return @a x to the @a y'th power. + template complex<_Tp> pow(const complex<_Tp>&, const _Tp&); + /// Return @a x to the @a y'th power. + template complex<_Tp> pow(const complex<_Tp>&, + const complex<_Tp>&); + /// Return @a x to the @a y'th power. + template complex<_Tp> pow(const _Tp&, const complex<_Tp>&); + /// Return complex sine of @a z. + template complex<_Tp> sin(const complex<_Tp>&); + /// Return complex hyperbolic sine of @a z. + template complex<_Tp> sinh(const complex<_Tp>&); + /// Return complex square root of @a z. + template complex<_Tp> sqrt(const complex<_Tp>&); + /// Return complex tangent of @a z. + template complex<_Tp> tan(const complex<_Tp>&); + /// Return complex hyperbolic tangent of @a z. + template complex<_Tp> tanh(const complex<_Tp>&); + + + // 26.2.2 Primary template class complex + /** + * Template to represent complex numbers. + * + * Specializations for float, double, and long double are part of the + * library. Results with any other type are not guaranteed. + * + * @param Tp Type of real and imaginary values. + */ + template + struct complex + { + /// Value typedef. + typedef _Tp value_type; + + /// Default constructor. First parameter is x, second parameter is y. + /// Unspecified parameters default to 0. + complex(const _Tp& __r = _Tp(), const _Tp& __i = _Tp()) + : _M_real(__r), _M_imag(__i) { } + + // Lets the compiler synthesize the copy constructor + // complex (const complex<_Tp>&); + /// Copy constructor. + template + complex(const complex<_Up>& __z) + : _M_real(__z.real()), _M_imag(__z.imag()) { } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 387. std::complex over-encapsulated. + _Tp real() const + { return _M_real; } + + _Tp imag() const + { return _M_imag; } +#else + /// Return real part of complex number. + _Tp& real() + { return _M_real; } + + /// Return real part of complex number. + const _Tp& real() const + { return _M_real; } + + /// Return imaginary part of complex number. + _Tp& imag() + { return _M_imag; } + + /// Return imaginary part of complex number. + const _Tp& imag() const + { return _M_imag; } +#endif + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 387. std::complex over-encapsulated. + void real(_Tp __val) + { _M_real = __val; } + + void imag(_Tp __val) + { _M_imag = __val; } + + /// Assign this complex number to scalar @a t. + complex<_Tp>& operator=(const _Tp&); + + /// Add @a t to this complex number. + // 26.2.5/1 + complex<_Tp>& + operator+=(const _Tp& __t) + { + _M_real += __t; + return *this; + } + + /// Subtract @a t from this complex number. + // 26.2.5/3 + complex<_Tp>& + operator-=(const _Tp& __t) + { + _M_real -= __t; + return *this; + } + + /// Multiply this complex number by @a t. + complex<_Tp>& operator*=(const _Tp&); + /// Divide this complex number by @a t. + complex<_Tp>& operator/=(const _Tp&); + + // Lets the compiler synthesize the + // copy and assignment operator + // complex<_Tp>& operator= (const complex<_Tp>&); + /// Assign this complex number to complex @a z. + template + complex<_Tp>& operator=(const complex<_Up>&); + /// Add @a z to this complex number. + template + complex<_Tp>& operator+=(const complex<_Up>&); + /// Subtract @a z from this complex number. + template + complex<_Tp>& operator-=(const complex<_Up>&); + /// Multiply this complex number by @a z. + template + complex<_Tp>& operator*=(const complex<_Up>&); + /// Divide this complex number by @a z. + template + complex<_Tp>& operator/=(const complex<_Up>&); + + const complex& __rep() const + { return *this; } + + private: + _Tp _M_real; + _Tp _M_imag; + }; + + template + complex<_Tp>& + complex<_Tp>::operator=(const _Tp& __t) + { + _M_real = __t; + _M_imag = _Tp(); + return *this; + } + + // 26.2.5/5 + template + complex<_Tp>& + complex<_Tp>::operator*=(const _Tp& __t) + { + _M_real *= __t; + _M_imag *= __t; + return *this; + } + + // 26.2.5/7 + template + complex<_Tp>& + complex<_Tp>::operator/=(const _Tp& __t) + { + _M_real /= __t; + _M_imag /= __t; + return *this; + } + + template + template + complex<_Tp>& + complex<_Tp>::operator=(const complex<_Up>& __z) + { + _M_real = __z.real(); + _M_imag = __z.imag(); + return *this; + } + + // 26.2.5/9 + template + template + complex<_Tp>& + complex<_Tp>::operator+=(const complex<_Up>& __z) + { + _M_real += __z.real(); + _M_imag += __z.imag(); + return *this; + } + + // 26.2.5/11 + template + template + complex<_Tp>& + complex<_Tp>::operator-=(const complex<_Up>& __z) + { + _M_real -= __z.real(); + _M_imag -= __z.imag(); + return *this; + } + + // 26.2.5/13 + // XXX: This is a grammar school implementation. + template + template + complex<_Tp>& + complex<_Tp>::operator*=(const complex<_Up>& __z) + { + const _Tp __r = _M_real * __z.real() - _M_imag * __z.imag(); + _M_imag = _M_real * __z.imag() + _M_imag * __z.real(); + _M_real = __r; + return *this; + } + + // 26.2.5/15 + // XXX: This is a grammar school implementation. + template + template + complex<_Tp>& + complex<_Tp>::operator/=(const complex<_Up>& __z) + { + const _Tp __r = _M_real * __z.real() + _M_imag * __z.imag(); + const _Tp __n = std::norm(__z); + _M_imag = (_M_imag * __z.real() - _M_real * __z.imag()) / __n; + _M_real = __r / __n; + return *this; + } + + // Operators: + //@{ + /// Return new complex value @a x plus @a y. + template + inline complex<_Tp> + operator+(const complex<_Tp>& __x, const complex<_Tp>& __y) + { + complex<_Tp> __r = __x; + __r += __y; + return __r; + } + + template + inline complex<_Tp> + operator+(const complex<_Tp>& __x, const _Tp& __y) + { + complex<_Tp> __r = __x; + __r += __y; + return __r; + } + + template + inline complex<_Tp> + operator+(const _Tp& __x, const complex<_Tp>& __y) + { + complex<_Tp> __r = __y; + __r += __x; + return __r; + } + //@} + + //@{ + /// Return new complex value @a x minus @a y. + template + inline complex<_Tp> + operator-(const complex<_Tp>& __x, const complex<_Tp>& __y) + { + complex<_Tp> __r = __x; + __r -= __y; + return __r; + } + + template + inline complex<_Tp> + operator-(const complex<_Tp>& __x, const _Tp& __y) + { + complex<_Tp> __r = __x; + __r -= __y; + return __r; + } + + template + inline complex<_Tp> + operator-(const _Tp& __x, const complex<_Tp>& __y) + { + complex<_Tp> __r(__x, -__y.imag()); + __r -= __y.real(); + return __r; + } + //@} + + //@{ + /// Return new complex value @a x times @a y. + template + inline complex<_Tp> + operator*(const complex<_Tp>& __x, const complex<_Tp>& __y) + { + complex<_Tp> __r = __x; + __r *= __y; + return __r; + } + + template + inline complex<_Tp> + operator*(const complex<_Tp>& __x, const _Tp& __y) + { + complex<_Tp> __r = __x; + __r *= __y; + return __r; + } + + template + inline complex<_Tp> + operator*(const _Tp& __x, const complex<_Tp>& __y) + { + complex<_Tp> __r = __y; + __r *= __x; + return __r; + } + //@} + + //@{ + /// Return new complex value @a x divided by @a y. + template + inline complex<_Tp> + operator/(const complex<_Tp>& __x, const complex<_Tp>& __y) + { + complex<_Tp> __r = __x; + __r /= __y; + return __r; + } + + template + inline complex<_Tp> + operator/(const complex<_Tp>& __x, const _Tp& __y) + { + complex<_Tp> __r = __x; + __r /= __y; + return __r; + } + + template + inline complex<_Tp> + operator/(const _Tp& __x, const complex<_Tp>& __y) + { + complex<_Tp> __r = __x; + __r /= __y; + return __r; + } + //@} + + /// Return @a x. + template + inline complex<_Tp> + operator+(const complex<_Tp>& __x) + { return __x; } + + /// Return complex negation of @a x. + template + inline complex<_Tp> + operator-(const complex<_Tp>& __x) + { return complex<_Tp>(-__x.real(), -__x.imag()); } + + //@{ + /// Return true if @a x is equal to @a y. + template + inline bool + operator==(const complex<_Tp>& __x, const complex<_Tp>& __y) + { return __x.real() == __y.real() && __x.imag() == __y.imag(); } + + template + inline bool + operator==(const complex<_Tp>& __x, const _Tp& __y) + { return __x.real() == __y && __x.imag() == _Tp(); } + + template + inline bool + operator==(const _Tp& __x, const complex<_Tp>& __y) + { return __x == __y.real() && _Tp() == __y.imag(); } + //@} + + //@{ + /// Return false if @a x is equal to @a y. + template + inline bool + operator!=(const complex<_Tp>& __x, const complex<_Tp>& __y) + { return __x.real() != __y.real() || __x.imag() != __y.imag(); } + + template + inline bool + operator!=(const complex<_Tp>& __x, const _Tp& __y) + { return __x.real() != __y || __x.imag() != _Tp(); } + + template + inline bool + operator!=(const _Tp& __x, const complex<_Tp>& __y) + { return __x != __y.real() || _Tp() != __y.imag(); } + //@} + + /// Extraction operator for complex values. + template + basic_istream<_CharT, _Traits>& + operator>>(basic_istream<_CharT, _Traits>& __is, complex<_Tp>& __x) + { + _Tp __re_x, __im_x; + _CharT __ch; + __is >> __ch; + if (__ch == '(') + { + __is >> __re_x >> __ch; + if (__ch == ',') + { + __is >> __im_x >> __ch; + if (__ch == ')') + __x = complex<_Tp>(__re_x, __im_x); + else + __is.setstate(ios_base::failbit); + } + else if (__ch == ')') + __x = __re_x; + else + __is.setstate(ios_base::failbit); + } + else + { + __is.putback(__ch); + __is >> __re_x; + __x = __re_x; + } + return __is; + } + + /// Insertion operator for complex values. + template + basic_ostream<_CharT, _Traits>& + operator<<(basic_ostream<_CharT, _Traits>& __os, const complex<_Tp>& __x) + { + basic_ostringstream<_CharT, _Traits> __s; + __s.flags(__os.flags()); + __s.imbue(__os.getloc()); + __s.precision(__os.precision()); + __s << '(' << __x.real() << ',' << __x.imag() << ')'; + return __os << __s.str(); + } + + // Values +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + inline _Tp + real(const complex<_Tp>& __z) + { return __z.real(); } + + template + inline _Tp + imag(const complex<_Tp>& __z) + { return __z.imag(); } +#else + template + inline _Tp& + real(complex<_Tp>& __z) + { return __z.real(); } + + template + inline const _Tp& + real(const complex<_Tp>& __z) + { return __z.real(); } + + template + inline _Tp& + imag(complex<_Tp>& __z) + { return __z.imag(); } + + template + inline const _Tp& + imag(const complex<_Tp>& __z) + { return __z.imag(); } +#endif + + // 26.2.7/3 abs(__z): Returns the magnitude of __z. + template + inline _Tp + __complex_abs(const complex<_Tp>& __z) + { + _Tp __x = __z.real(); + _Tp __y = __z.imag(); + const _Tp __s = std::max(abs(__x), abs(__y)); + if (__s == _Tp()) // well ... + return __s; + __x /= __s; + __y /= __s; + return __s * sqrt(__x * __x + __y * __y); + } + +#if _GLIBCXX_USE_C99_COMPLEX + inline float + __complex_abs(__complex__ float __z) { return __builtin_cabsf(__z); } + + inline double + __complex_abs(__complex__ double __z) { return __builtin_cabs(__z); } + + inline long double + __complex_abs(const __complex__ long double& __z) + { return __builtin_cabsl(__z); } + + template + inline _Tp + abs(const complex<_Tp>& __z) { return __complex_abs(__z.__rep()); } +#else + template + inline _Tp + abs(const complex<_Tp>& __z) { return __complex_abs(__z); } +#endif + + + // 26.2.7/4: arg(__z): Returns the phase angle of __z. + template + inline _Tp + __complex_arg(const complex<_Tp>& __z) + { return atan2(__z.imag(), __z.real()); } + +#if _GLIBCXX_USE_C99_COMPLEX + inline float + __complex_arg(__complex__ float __z) { return __builtin_cargf(__z); } + + inline double + __complex_arg(__complex__ double __z) { return __builtin_carg(__z); } + + inline long double + __complex_arg(const __complex__ long double& __z) + { return __builtin_cargl(__z); } + + template + inline _Tp + arg(const complex<_Tp>& __z) { return __complex_arg(__z.__rep()); } +#else + template + inline _Tp + arg(const complex<_Tp>& __z) { return __complex_arg(__z); } +#endif + + // 26.2.7/5: norm(__z) returns the squared magnitude of __z. + // As defined, norm() is -not- a norm is the common mathematical + // sens used in numerics. The helper class _Norm_helper<> tries to + // distinguish between builtin floating point and the rest, so as + // to deliver an answer as close as possible to the real value. + template + struct _Norm_helper + { + template + static inline _Tp _S_do_it(const complex<_Tp>& __z) + { + const _Tp __x = __z.real(); + const _Tp __y = __z.imag(); + return __x * __x + __y * __y; + } + }; + + template<> + struct _Norm_helper + { + template + static inline _Tp _S_do_it(const complex<_Tp>& __z) + { + _Tp __res = std::abs(__z); + return __res * __res; + } + }; + + template + inline _Tp + norm(const complex<_Tp>& __z) + { + return _Norm_helper<__is_floating<_Tp>::__value + && !_GLIBCXX_FAST_MATH>::_S_do_it(__z); + } + + template + inline complex<_Tp> + polar(const _Tp& __rho, const _Tp& __theta) + { return complex<_Tp>(__rho * cos(__theta), __rho * sin(__theta)); } + + template + inline complex<_Tp> + conj(const complex<_Tp>& __z) + { return complex<_Tp>(__z.real(), -__z.imag()); } + + // Transcendentals + + // 26.2.8/1 cos(__z): Returns the cosine of __z. + template + inline complex<_Tp> + __complex_cos(const complex<_Tp>& __z) + { + const _Tp __x = __z.real(); + const _Tp __y = __z.imag(); + return complex<_Tp>(cos(__x) * cosh(__y), -sin(__x) * sinh(__y)); + } + +#if _GLIBCXX_USE_C99_COMPLEX + inline __complex__ float + __complex_cos(__complex__ float __z) { return __builtin_ccosf(__z); } + + inline __complex__ double + __complex_cos(__complex__ double __z) { return __builtin_ccos(__z); } + + inline __complex__ long double + __complex_cos(const __complex__ long double& __z) + { return __builtin_ccosl(__z); } + + template + inline complex<_Tp> + cos(const complex<_Tp>& __z) { return __complex_cos(__z.__rep()); } +#else + template + inline complex<_Tp> + cos(const complex<_Tp>& __z) { return __complex_cos(__z); } +#endif + + // 26.2.8/2 cosh(__z): Returns the hyperbolic cosine of __z. + template + inline complex<_Tp> + __complex_cosh(const complex<_Tp>& __z) + { + const _Tp __x = __z.real(); + const _Tp __y = __z.imag(); + return complex<_Tp>(cosh(__x) * cos(__y), sinh(__x) * sin(__y)); + } + +#if _GLIBCXX_USE_C99_COMPLEX + inline __complex__ float + __complex_cosh(__complex__ float __z) { return __builtin_ccoshf(__z); } + + inline __complex__ double + __complex_cosh(__complex__ double __z) { return __builtin_ccosh(__z); } + + inline __complex__ long double + __complex_cosh(const __complex__ long double& __z) + { return __builtin_ccoshl(__z); } + + template + inline complex<_Tp> + cosh(const complex<_Tp>& __z) { return __complex_cosh(__z.__rep()); } +#else + template + inline complex<_Tp> + cosh(const complex<_Tp>& __z) { return __complex_cosh(__z); } +#endif + + // 26.2.8/3 exp(__z): Returns the complex base e exponential of x + template + inline complex<_Tp> + __complex_exp(const complex<_Tp>& __z) + { return std::polar(exp(__z.real()), __z.imag()); } + +#if _GLIBCXX_USE_C99_COMPLEX + inline __complex__ float + __complex_exp(__complex__ float __z) { return __builtin_cexpf(__z); } + + inline __complex__ double + __complex_exp(__complex__ double __z) { return __builtin_cexp(__z); } + + inline __complex__ long double + __complex_exp(const __complex__ long double& __z) + { return __builtin_cexpl(__z); } + + template + inline complex<_Tp> + exp(const complex<_Tp>& __z) { return __complex_exp(__z.__rep()); } +#else + template + inline complex<_Tp> + exp(const complex<_Tp>& __z) { return __complex_exp(__z); } +#endif + + // 26.2.8/5 log(__z): Returns the natural complex logarithm of __z. + // The branch cut is along the negative axis. + template + inline complex<_Tp> + __complex_log(const complex<_Tp>& __z) + { return complex<_Tp>(log(std::abs(__z)), std::arg(__z)); } + +#if _GLIBCXX_USE_C99_COMPLEX + inline __complex__ float + __complex_log(__complex__ float __z) { return __builtin_clogf(__z); } + + inline __complex__ double + __complex_log(__complex__ double __z) { return __builtin_clog(__z); } + + inline __complex__ long double + __complex_log(const __complex__ long double& __z) + { return __builtin_clogl(__z); } + + template + inline complex<_Tp> + log(const complex<_Tp>& __z) { return __complex_log(__z.__rep()); } +#else + template + inline complex<_Tp> + log(const complex<_Tp>& __z) { return __complex_log(__z); } +#endif + + template + inline complex<_Tp> + log10(const complex<_Tp>& __z) + { return std::log(__z) / log(_Tp(10.0)); } + + // 26.2.8/10 sin(__z): Returns the sine of __z. + template + inline complex<_Tp> + __complex_sin(const complex<_Tp>& __z) + { + const _Tp __x = __z.real(); + const _Tp __y = __z.imag(); + return complex<_Tp>(sin(__x) * cosh(__y), cos(__x) * sinh(__y)); + } + +#if _GLIBCXX_USE_C99_COMPLEX + inline __complex__ float + __complex_sin(__complex__ float __z) { return __builtin_csinf(__z); } + + inline __complex__ double + __complex_sin(__complex__ double __z) { return __builtin_csin(__z); } + + inline __complex__ long double + __complex_sin(const __complex__ long double& __z) + { return __builtin_csinl(__z); } + + template + inline complex<_Tp> + sin(const complex<_Tp>& __z) { return __complex_sin(__z.__rep()); } +#else + template + inline complex<_Tp> + sin(const complex<_Tp>& __z) { return __complex_sin(__z); } +#endif + + // 26.2.8/11 sinh(__z): Returns the hyperbolic sine of __z. + template + inline complex<_Tp> + __complex_sinh(const complex<_Tp>& __z) + { + const _Tp __x = __z.real(); + const _Tp __y = __z.imag(); + return complex<_Tp>(sinh(__x) * cos(__y), cosh(__x) * sin(__y)); + } + +#if _GLIBCXX_USE_C99_COMPLEX + inline __complex__ float + __complex_sinh(__complex__ float __z) { return __builtin_csinhf(__z); } + + inline __complex__ double + __complex_sinh(__complex__ double __z) { return __builtin_csinh(__z); } + + inline __complex__ long double + __complex_sinh(const __complex__ long double& __z) + { return __builtin_csinhl(__z); } + + template + inline complex<_Tp> + sinh(const complex<_Tp>& __z) { return __complex_sinh(__z.__rep()); } +#else + template + inline complex<_Tp> + sinh(const complex<_Tp>& __z) { return __complex_sinh(__z); } +#endif + + // 26.2.8/13 sqrt(__z): Returns the complex square root of __z. + // The branch cut is on the negative axis. + template + complex<_Tp> + __complex_sqrt(const complex<_Tp>& __z) + { + _Tp __x = __z.real(); + _Tp __y = __z.imag(); + + if (__x == _Tp()) + { + _Tp __t = sqrt(abs(__y) / 2); + return complex<_Tp>(__t, __y < _Tp() ? -__t : __t); + } + else + { + _Tp __t = sqrt(2 * (std::abs(__z) + abs(__x))); + _Tp __u = __t / 2; + return __x > _Tp() + ? complex<_Tp>(__u, __y / __t) + : complex<_Tp>(abs(__y) / __t, __y < _Tp() ? -__u : __u); + } + } + +#if _GLIBCXX_USE_C99_COMPLEX + inline __complex__ float + __complex_sqrt(__complex__ float __z) { return __builtin_csqrtf(__z); } + + inline __complex__ double + __complex_sqrt(__complex__ double __z) { return __builtin_csqrt(__z); } + + inline __complex__ long double + __complex_sqrt(const __complex__ long double& __z) + { return __builtin_csqrtl(__z); } + + template + inline complex<_Tp> + sqrt(const complex<_Tp>& __z) { return __complex_sqrt(__z.__rep()); } +#else + template + inline complex<_Tp> + sqrt(const complex<_Tp>& __z) { return __complex_sqrt(__z); } +#endif + + // 26.2.8/14 tan(__z): Return the complex tangent of __z. + + template + inline complex<_Tp> + __complex_tan(const complex<_Tp>& __z) + { return std::sin(__z) / std::cos(__z); } + +#if _GLIBCXX_USE_C99_COMPLEX + inline __complex__ float + __complex_tan(__complex__ float __z) { return __builtin_ctanf(__z); } + + inline __complex__ double + __complex_tan(__complex__ double __z) { return __builtin_ctan(__z); } + + inline __complex__ long double + __complex_tan(const __complex__ long double& __z) + { return __builtin_ctanl(__z); } + + template + inline complex<_Tp> + tan(const complex<_Tp>& __z) { return __complex_tan(__z.__rep()); } +#else + template + inline complex<_Tp> + tan(const complex<_Tp>& __z) { return __complex_tan(__z); } +#endif + + + // 26.2.8/15 tanh(__z): Returns the hyperbolic tangent of __z. + + template + inline complex<_Tp> + __complex_tanh(const complex<_Tp>& __z) + { return std::sinh(__z) / std::cosh(__z); } + +#if _GLIBCXX_USE_C99_COMPLEX + inline __complex__ float + __complex_tanh(__complex__ float __z) { return __builtin_ctanhf(__z); } + + inline __complex__ double + __complex_tanh(__complex__ double __z) { return __builtin_ctanh(__z); } + + inline __complex__ long double + __complex_tanh(const __complex__ long double& __z) + { return __builtin_ctanhl(__z); } + + template + inline complex<_Tp> + tanh(const complex<_Tp>& __z) { return __complex_tanh(__z.__rep()); } +#else + template + inline complex<_Tp> + tanh(const complex<_Tp>& __z) { return __complex_tanh(__z); } +#endif + + + // 26.2.8/9 pow(__x, __y): Returns the complex power base of __x + // raised to the __y-th power. The branch + // cut is on the negative axis. +#ifndef __GXX_EXPERIMENTAL_CXX0X__ + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 844. complex pow return type is ambiguous. + template + inline complex<_Tp> + pow(const complex<_Tp>& __z, int __n) + { return std::__pow_helper(__z, __n); } +#endif + + template + complex<_Tp> + pow(const complex<_Tp>& __x, const _Tp& __y) + { +#ifndef _GLIBCXX_USE_C99_COMPLEX + if (__x == _Tp()) + return _Tp(); +#endif + if (__x.imag() == _Tp() && __x.real() > _Tp()) + return pow(__x.real(), __y); + + complex<_Tp> __t = std::log(__x); + return std::polar(exp(__y * __t.real()), __y * __t.imag()); + } + + template + inline complex<_Tp> + __complex_pow(const complex<_Tp>& __x, const complex<_Tp>& __y) + { return __x == _Tp() ? _Tp() : std::exp(__y * std::log(__x)); } + +#if _GLIBCXX_USE_C99_COMPLEX + inline __complex__ float + __complex_pow(__complex__ float __x, __complex__ float __y) + { return __builtin_cpowf(__x, __y); } + + inline __complex__ double + __complex_pow(__complex__ double __x, __complex__ double __y) + { return __builtin_cpow(__x, __y); } + + inline __complex__ long double + __complex_pow(const __complex__ long double& __x, + const __complex__ long double& __y) + { return __builtin_cpowl(__x, __y); } + + template + inline complex<_Tp> + pow(const complex<_Tp>& __x, const complex<_Tp>& __y) + { return __complex_pow(__x.__rep(), __y.__rep()); } +#else + template + inline complex<_Tp> + pow(const complex<_Tp>& __x, const complex<_Tp>& __y) + { return __complex_pow(__x, __y); } +#endif + + template + inline complex<_Tp> + pow(const _Tp& __x, const complex<_Tp>& __y) + { + return __x > _Tp() ? std::polar(pow(__x, __y.real()), + __y.imag() * log(__x)) + : std::pow(complex<_Tp>(__x), __y); + } + + // 26.2.3 complex specializations + // complex specialization + template<> + struct complex + { + typedef float value_type; + typedef __complex__ float _ComplexT; + + complex(_ComplexT __z) : _M_value(__z) { } + + complex(float __r = 0.0f, float __i = 0.0f) + { + __real__ _M_value = __r; + __imag__ _M_value = __i; + } + + explicit complex(const complex&); + explicit complex(const complex&); + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 387. std::complex over-encapsulated. + float real() const + { return __real__ _M_value; } + + float imag() const + { return __imag__ _M_value; } +#else + float& real() + { return __real__ _M_value; } + + const float& real() const + { return __real__ _M_value; } + + float& imag() + { return __imag__ _M_value; } + + const float& imag() const + { return __imag__ _M_value; } +#endif + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 387. std::complex over-encapsulated. + void real(float __val) + { __real__ _M_value = __val; } + + void imag(float __val) + { __imag__ _M_value = __val; } + + complex& + operator=(float __f) + { + __real__ _M_value = __f; + __imag__ _M_value = 0.0f; + return *this; + } + + complex& + operator+=(float __f) + { + __real__ _M_value += __f; + return *this; + } + + complex& + operator-=(float __f) + { + __real__ _M_value -= __f; + return *this; + } + + complex& + operator*=(float __f) + { + _M_value *= __f; + return *this; + } + + complex& + operator/=(float __f) + { + _M_value /= __f; + return *this; + } + + // Let the compiler synthesize the copy and assignment + // operator. It always does a pretty good job. + // complex& operator=(const complex&); + + template + complex& + operator=(const complex<_Tp>& __z) + { + __real__ _M_value = __z.real(); + __imag__ _M_value = __z.imag(); + return *this; + } + + template + complex& + operator+=(const complex<_Tp>& __z) + { + __real__ _M_value += __z.real(); + __imag__ _M_value += __z.imag(); + return *this; + } + + template + complex& + operator-=(const complex<_Tp>& __z) + { + __real__ _M_value -= __z.real(); + __imag__ _M_value -= __z.imag(); + return *this; + } + + template + complex& + operator*=(const complex<_Tp>& __z) + { + _ComplexT __t; + __real__ __t = __z.real(); + __imag__ __t = __z.imag(); + _M_value *= __t; + return *this; + } + + template + complex& + operator/=(const complex<_Tp>& __z) + { + _ComplexT __t; + __real__ __t = __z.real(); + __imag__ __t = __z.imag(); + _M_value /= __t; + return *this; + } + + const _ComplexT& __rep() const { return _M_value; } + + private: + _ComplexT _M_value; + }; + + // 26.2.3 complex specializations + // complex specialization + template<> + struct complex + { + typedef double value_type; + typedef __complex__ double _ComplexT; + + complex(_ComplexT __z) : _M_value(__z) { } + + complex(double __r = 0.0, double __i = 0.0) + { + __real__ _M_value = __r; + __imag__ _M_value = __i; + } + + complex(const complex& __z) + : _M_value(__z.__rep()) { } + + explicit complex(const complex&); + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 387. std::complex over-encapsulated. + double real() const + { return __real__ _M_value; } + + double imag() const + { return __imag__ _M_value; } +#else + double& real() + { return __real__ _M_value; } + + const double& real() const + { return __real__ _M_value; } + + double& imag() + { return __imag__ _M_value; } + + const double& imag() const + { return __imag__ _M_value; } +#endif + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 387. std::complex over-encapsulated. + void real(double __val) + { __real__ _M_value = __val; } + + void imag(double __val) + { __imag__ _M_value = __val; } + + complex& + operator=(double __d) + { + __real__ _M_value = __d; + __imag__ _M_value = 0.0; + return *this; + } + + complex& + operator+=(double __d) + { + __real__ _M_value += __d; + return *this; + } + + complex& + operator-=(double __d) + { + __real__ _M_value -= __d; + return *this; + } + + complex& + operator*=(double __d) + { + _M_value *= __d; + return *this; + } + + complex& + operator/=(double __d) + { + _M_value /= __d; + return *this; + } + + // The compiler will synthesize this, efficiently. + // complex& operator=(const complex&); + + template + complex& + operator=(const complex<_Tp>& __z) + { + __real__ _M_value = __z.real(); + __imag__ _M_value = __z.imag(); + return *this; + } + + template + complex& + operator+=(const complex<_Tp>& __z) + { + __real__ _M_value += __z.real(); + __imag__ _M_value += __z.imag(); + return *this; + } + + template + complex& + operator-=(const complex<_Tp>& __z) + { + __real__ _M_value -= __z.real(); + __imag__ _M_value -= __z.imag(); + return *this; + } + + template + complex& + operator*=(const complex<_Tp>& __z) + { + _ComplexT __t; + __real__ __t = __z.real(); + __imag__ __t = __z.imag(); + _M_value *= __t; + return *this; + } + + template + complex& + operator/=(const complex<_Tp>& __z) + { + _ComplexT __t; + __real__ __t = __z.real(); + __imag__ __t = __z.imag(); + _M_value /= __t; + return *this; + } + + const _ComplexT& __rep() const { return _M_value; } + + private: + _ComplexT _M_value; + }; + + // 26.2.3 complex specializations + // complex specialization + template<> + struct complex + { + typedef long double value_type; + typedef __complex__ long double _ComplexT; + + complex(_ComplexT __z) : _M_value(__z) { } + + complex(long double __r = 0.0L, long double __i = 0.0L) + { + __real__ _M_value = __r; + __imag__ _M_value = __i; + } + + complex(const complex& __z) + : _M_value(__z.__rep()) { } + + complex(const complex& __z) + : _M_value(__z.__rep()) { } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 387. std::complex over-encapsulated. + long double real() const + { return __real__ _M_value; } + + long double imag() const + { return __imag__ _M_value; } +#else + long double& real() + { return __real__ _M_value; } + + const long double& real() const + { return __real__ _M_value; } + + long double& imag() + { return __imag__ _M_value; } + + const long double& imag() const + { return __imag__ _M_value; } +#endif + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 387. std::complex over-encapsulated. + void real(long double __val) + { __real__ _M_value = __val; } + + void imag(long double __val) + { __imag__ _M_value = __val; } + + complex& + operator=(long double __r) + { + __real__ _M_value = __r; + __imag__ _M_value = 0.0L; + return *this; + } + + complex& + operator+=(long double __r) + { + __real__ _M_value += __r; + return *this; + } + + complex& + operator-=(long double __r) + { + __real__ _M_value -= __r; + return *this; + } + + complex& + operator*=(long double __r) + { + _M_value *= __r; + return *this; + } + + complex& + operator/=(long double __r) + { + _M_value /= __r; + return *this; + } + + // The compiler knows how to do this efficiently + // complex& operator=(const complex&); + + template + complex& + operator=(const complex<_Tp>& __z) + { + __real__ _M_value = __z.real(); + __imag__ _M_value = __z.imag(); + return *this; + } + + template + complex& + operator+=(const complex<_Tp>& __z) + { + __real__ _M_value += __z.real(); + __imag__ _M_value += __z.imag(); + return *this; + } + + template + complex& + operator-=(const complex<_Tp>& __z) + { + __real__ _M_value -= __z.real(); + __imag__ _M_value -= __z.imag(); + return *this; + } + + template + complex& + operator*=(const complex<_Tp>& __z) + { + _ComplexT __t; + __real__ __t = __z.real(); + __imag__ __t = __z.imag(); + _M_value *= __t; + return *this; + } + + template + complex& + operator/=(const complex<_Tp>& __z) + { + _ComplexT __t; + __real__ __t = __z.real(); + __imag__ __t = __z.imag(); + _M_value /= __t; + return *this; + } + + const _ComplexT& __rep() const { return _M_value; } + + private: + _ComplexT _M_value; + }; + + // These bits have to be at the end of this file, so that the + // specializations have all been defined. + inline + complex::complex(const complex& __z) + : _M_value(__z.__rep()) { } + + inline + complex::complex(const complex& __z) + : _M_value(__z.__rep()) { } + + inline + complex::complex(const complex& __z) + : _M_value(__z.__rep()) { } + + // Inhibit implicit instantiations for required instantiations, + // which are defined via explicit instantiations elsewhere. + // NB: This syntax is a GNU extension. +#if _GLIBCXX_EXTERN_TEMPLATE + extern template istream& operator>>(istream&, complex&); + extern template ostream& operator<<(ostream&, const complex&); + extern template istream& operator>>(istream&, complex&); + extern template ostream& operator<<(ostream&, const complex&); + extern template istream& operator>>(istream&, complex&); + extern template ostream& operator<<(ostream&, const complex&); + +#ifdef _GLIBCXX_USE_WCHAR_T + extern template wistream& operator>>(wistream&, complex&); + extern template wostream& operator<<(wostream&, const complex&); + extern template wistream& operator>>(wistream&, complex&); + extern template wostream& operator<<(wostream&, const complex&); + extern template wistream& operator>>(wistream&, complex&); + extern template wostream& operator<<(wostream&, const complex&); +#endif +#endif + + // @} group complex_numbers + +_GLIBCXX_END_NAMESPACE + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + // See ext/type_traits.h for the primary template. + template + struct __promote_2, _Up> + { + public: + typedef std::complex::__type> __type; + }; + + template + struct __promote_2<_Tp, std::complex<_Up> > + { + public: + typedef std::complex::__type> __type; + }; + + template + struct __promote_2, std::complex<_Up> > + { + public: + typedef std::complex::__type> __type; + }; + +_GLIBCXX_END_NAMESPACE + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ +# if defined(_GLIBCXX_INCLUDE_AS_TR1) +# error C++0x header cannot be included from TR1 header +# endif +# if defined(_GLIBCXX_INCLUDE_AS_CXX0X) +# include +# else +# define _GLIBCXX_INCLUDE_AS_CXX0X +# define _GLIBCXX_BEGIN_NAMESPACE_TR1 +# define _GLIBCXX_END_NAMESPACE_TR1 +# define _GLIBCXX_TR1 +# include +# undef _GLIBCXX_TR1 +# undef _GLIBCXX_END_NAMESPACE_TR1 +# undef _GLIBCXX_BEGIN_NAMESPACE_TR1 +# undef _GLIBCXX_INCLUDE_AS_CXX0X +# endif + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // Forward declarations. + // DR 781. + template std::complex<_Tp> proj(const std::complex<_Tp>&); + + template + std::complex<_Tp> + __complex_proj(const std::complex<_Tp>& __z) + { + const _Tp __den = (__z.real() * __z.real() + + __z.imag() * __z.imag() + _Tp(1.0)); + + return std::complex<_Tp>((_Tp(2.0) * __z.real()) / __den, + (_Tp(2.0) * __z.imag()) / __den); + } + +#if _GLIBCXX_USE_C99_COMPLEX + inline __complex__ float + __complex_proj(__complex__ float __z) + { return __builtin_cprojf(__z); } + + inline __complex__ double + __complex_proj(__complex__ double __z) + { return __builtin_cproj(__z); } + + inline __complex__ long double + __complex_proj(const __complex__ long double& __z) + { return __builtin_cprojl(__z); } + + template + inline std::complex<_Tp> + proj(const std::complex<_Tp>& __z) + { return __complex_proj(__z.__rep()); } +#else + template + inline std::complex<_Tp> + proj(const std::complex<_Tp>& __z) + { return __complex_proj(__z); } +#endif + + template + inline std::complex::__type> + proj(_Tp __x) + { + typedef typename __gnu_cxx::__promote<_Tp>::__type __type; + return std::proj(std::complex<__type>(__x)); + } + +_GLIBCXX_END_NAMESPACE + +#endif + +#endif /* _GLIBCXX_COMPLEX */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/complex.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/complex.h new file mode 100644 index 00000000..7dc5926f --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/complex.h @@ -0,0 +1,42 @@ +// -*- C++ -*- compatibility header. + +// Copyright (C) 2007, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file complex.h + * This is a Standard C++ Library header. + */ + +#include + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ +# include +#else +# if _GLIBCXX_HAVE_COMPLEX_H +# include_next +# endif +#endif + +#ifndef _GLIBCXX_COMPLEX_H +#define _GLIBCXX_COMPLEX_H 1 + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/condition_variable b/mingw/lib/gcc/mingw32/4.4.0/include/c++/condition_variable new file mode 100644 index 00000000..64f2bb77 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/condition_variable @@ -0,0 +1,225 @@ +// -*- C++ -*- + +// Copyright (C) 2008, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file condition_variable + * This is a Standard C++ Library header. + */ + +#ifndef _GLIBCXX_CONDITION_VARIABLE +#define _GLIBCXX_CONDITION_VARIABLE 1 + +#pragma GCC system_header + +#ifndef __GXX_EXPERIMENTAL_CXX0X__ +# include +#else + +#include +#include // unique_lock + +#if defined(_GLIBCXX_HAS_GTHREADS) && defined(_GLIBCXX_USE_C99_STDINT_TR1) + +namespace std +{ + /** + * @defgroup condition_variables Condition Variables + * @ingroup concurrency + * + * Classes for condition_variable support. + * @{ + */ + + /// condition_variable + class condition_variable + { + typedef chrono::system_clock __clock_t; + typedef __gthread_cond_t __native_type; + __native_type _M_cond; + + public: + typedef __native_type* native_handle_type; + + condition_variable(); + ~condition_variable(); + + condition_variable(const condition_variable&) = delete; + condition_variable& operator=(const condition_variable&) = delete; + + void + notify_one(); + + void + notify_all(); + + void + wait(unique_lock& __lock); + + template + void + wait(unique_lock& __lock, _Predicate __p) + { + while (!__p()) + wait(__lock); + } + + template + bool + wait_until(unique_lock& __lock, + const chrono::time_point<__clock_t, _Duration>& __atime) + { return __wait_until_impl(__lock, __atime); } + + template + bool + wait_until(unique_lock& __lock, + const chrono::time_point<_Clock, _Duration>& __atime) + { + // DR 887 - Sync unknown clock to known clock. + typename _Clock::time_point __c_entry = _Clock::now(); + __clock_t::time_point __s_entry = __clock_t::now(); + chrono::nanoseconds __delta = __atime - __c_entry; + __clock_t::time_point __s_atime = __s_entry + __delta; + + return __wait_until_impl(__lock, __s_atime); + } + + template + bool + wait_until(unique_lock& __lock, + const chrono::time_point<_Clock, _Duration>& __atime, + _Predicate __p) + { + while (!__p()) + if (!wait_until(__lock, __atime)) + return __p(); + + return true; + } + + template + bool + wait_for(unique_lock& __lock, + const chrono::duration<_Rep, _Period>& __rtime) + { return wait_until(__lock, __clock_t::now() + __rtime); } + + template + bool + wait_for(unique_lock& __lock, + const chrono::duration<_Rep, _Period>& __rtime, + _Predicate __p) + { return wait_until(__lock, __clock_t::now() + __rtime, std::move(__p)); } + + native_handle_type + native_handle() + { return &_M_cond; } + + private: + template + bool + __wait_until_impl(unique_lock& __lock, + const chrono::time_point<_Clock, _Duration>& __atime) + { + chrono::time_point<__clock_t, chrono::seconds> __s = + chrono::time_point_cast(__atime); + + chrono::nanoseconds __ns = + chrono::duration_cast(__atime - __s); + + __gthread_time_t __ts = + { + static_cast(__s.time_since_epoch().count()), + static_cast(__ns.count()) + }; + + __gthread_cond_timedwait(&_M_cond, __lock.mutex()->native_handle(), + &__ts); + + return _Clock::now() < __atime; + } + }; + + /// condition_variable_any + // Like above, only mutex may not have try_lock. + class condition_variable_any + { + typedef __gthread_cond_t __native_type; + __native_type _M_cond; + + public: + typedef __native_type* native_handle_type; + + condition_variable_any(); + ~condition_variable_any(); + + condition_variable_any(const condition_variable_any&) = delete; + condition_variable_any& operator=(const condition_variable_any&) = delete; + + void + notify_one(); + + void + notify_all(); + + template + void + wait(_Lock& __lock); + + template + void + wait(_Lock& __lock, _Predicate __p); + + template + bool + wait_until(_Lock& __lock, + const chrono::time_point<_Clock, _Duration>& __atime); + + template + bool + wait_until(_Lock& __lock, + const chrono::time_point<_Clock, _Duration>& __atime, + _Predicate __p); + + template + bool + wait_for(_Lock& __lock, const chrono::duration<_Rep, _Period>& __rtime); + + template + bool + wait_for(_Lock& __lock, + const chrono::duration<_Rep, _Period>& __rtime, _Predicate __p); + + native_handle_type + native_handle() + { return &_M_cond; } + }; + + // @} group condition_variables +} + +#endif // _GLIBCXX_HAS_GTHREADS && _GLIBCXX_USE_C99_STDINT_TR1 + +#endif // __GXX_EXPERIMENTAL_CXX0X__ + +#endif // _GLIBCXX_CONDITION_VARIABLE diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/csetjmp b/mingw/lib/gcc/mingw32/4.4.0/include/c++/csetjmp new file mode 100644 index 00000000..6d7ecab4 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/csetjmp @@ -0,0 +1,64 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file csetjmp + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c setjmp.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 20.4.6 C library +// + +#pragma GCC system_header + +#include +#include + +#ifndef _GLIBCXX_CSETJMP +#define _GLIBCXX_CSETJMP 1 + +// Get rid of those macros defined in in lieu of real functions. +#undef longjmp + +// Adhere to section 17.4.1.2 clause 5 of ISO 14882:1998 +#ifndef setjmp +#define setjmp(env) setjmp (env) +#endif + +_GLIBCXX_BEGIN_NAMESPACE(std) + + using ::jmp_buf; + using ::longjmp; + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/csignal b/mingw/lib/gcc/mingw32/4.4.0/include/c++/csignal new file mode 100644 index 00000000..41af5e69 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/csignal @@ -0,0 +1,60 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file csignal + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c signal.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 20.4.6 C library +// + +#pragma GCC system_header + +#include +#include + +#ifndef _GLIBCXX_CSIGNAL +#define _GLIBCXX_CSIGNAL 1 + +// Get rid of those macros defined in in lieu of real functions. +#undef raise + +_GLIBCXX_BEGIN_NAMESPACE(std) + + using ::sig_atomic_t; + using ::signal; + using ::raise; + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdarg b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdarg new file mode 100644 index 00000000..73327b1a --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdarg @@ -0,0 +1,60 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file include/cstdarg + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c stdarg.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 20.4.6 C library +// + +#pragma GCC system_header + +#include +#include + +#ifndef _GLIBCXX_CSTDARG +#define _GLIBCXX_CSTDARG 1 + +// Adhere to section 17.4.1.2 clause 5 of ISO 14882:1998 +#ifndef va_end +#define va_end(ap) va_end (ap) +#endif + +_GLIBCXX_BEGIN_NAMESPACE(std) + + using ::va_list; + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdatomic b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdatomic new file mode 100644 index 00000000..7489d97c --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdatomic @@ -0,0 +1,848 @@ +// -*- C++ -*- header. + +// Copyright (C) 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file cstdatomic + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c stdatomic.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// Based on "C++ Atomic Types and Operations" by Hans Boehm and Lawrence Crowl. +// http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2427.html + +#ifndef _GLIBCXX_STDATOMIC +#define _GLIBCXX_STDATOMIC 1 + +#pragma GCC system_header + +#ifndef __GXX_EXPERIMENTAL_CXX0X__ +# include +#endif + +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(std) + + /** + * @addtogroup atomics + * @{ + */ + + /// kill_dependency + template + inline _Tp + kill_dependency(_Tp __y) + { + _Tp ret(__y); + return ret; + } + + inline memory_order + __calculate_memory_order(memory_order __m) + { + const bool __cond1 = __m == memory_order_release; + const bool __cond2 = __m == memory_order_acq_rel; + memory_order __mo1(__cond1 ? memory_order_relaxed : __m); + memory_order __mo2(__cond2 ? memory_order_acquire : __mo1); + return __mo2; + } + + // + // Three nested namespaces for atomic implementation details. + // + // The nested namespace inlined into std:: is determined by the value + // of the _GLIBCXX_ATOMIC_PROPERTY macro and the resulting + // ATOMIC_*_LOCK_FREE macros. See file stdatomic.h. + // + // 0 == __atomic0 == Never lock-free + // 1 == __atomic1 == Best available, sometimes lock-free + // 2 == __atomic2 == Always lock-free +#include +#include + + /// atomic + /// 29.4.3, Generic atomic type, primary class template. + template + struct atomic + { + private: + _Tp _M_i; + + public: + atomic() = default; + ~atomic() = default; + atomic(const atomic&) = delete; + atomic& operator=(const atomic&) = delete; + + atomic(_Tp __i) : _M_i(__i) { } + + operator _Tp() const volatile; + + _Tp + operator=(_Tp __i) volatile { store(__i); return __i; } + + bool + is_lock_free() const volatile; + + void + store(_Tp, memory_order = memory_order_seq_cst) volatile; + + _Tp + load(memory_order = memory_order_seq_cst) const volatile; + + _Tp + exchange(_Tp __i, memory_order = memory_order_seq_cst) volatile; + + bool + compare_exchange_weak(_Tp&, _Tp, memory_order, memory_order) volatile; + + bool + compare_exchange_strong(_Tp&, _Tp, memory_order, memory_order) volatile; + + bool + compare_exchange_weak(_Tp&, _Tp, + memory_order = memory_order_seq_cst) volatile; + + bool + compare_exchange_strong(_Tp&, _Tp, + memory_order = memory_order_seq_cst) volatile; + }; + + + /// Partial specialization for pointer types. + template + struct atomic<_Tp*> : atomic_address + { + atomic() = default; + ~atomic() = default; + atomic(const atomic&) = delete; + atomic& operator=(const atomic&) = delete; + + atomic(_Tp* __v) : atomic_address(__v) { } + + void + store(_Tp*, memory_order = memory_order_seq_cst) volatile; + + _Tp* + load(memory_order = memory_order_seq_cst) const volatile; + + _Tp* + exchange(_Tp*, memory_order = memory_order_seq_cst) volatile; + + bool + compare_exchange_weak(_Tp*&, _Tp*, memory_order, memory_order) volatile; + + bool + compare_exchange_strong(_Tp*&, _Tp*, memory_order, memory_order) volatile; + + bool + compare_exchange_weak(_Tp*&, _Tp*, + memory_order = memory_order_seq_cst) volatile; + + bool + compare_exchange_strong(_Tp*&, _Tp*, + memory_order = memory_order_seq_cst) volatile; + + _Tp* + fetch_add(ptrdiff_t, memory_order = memory_order_seq_cst) volatile; + + _Tp* + fetch_sub(ptrdiff_t, memory_order = memory_order_seq_cst) volatile; + + operator _Tp*() const volatile + { return load(); } + + _Tp* + operator=(_Tp* __v) volatile + { + store(__v); + return __v; + } + + _Tp* + operator++(int) volatile { return fetch_add(1); } + + _Tp* + operator--(int) volatile { return fetch_sub(1); } + + _Tp* + operator++() volatile { return fetch_add(1) + 1; } + + _Tp* + operator--() volatile { return fetch_sub(1) - 1; } + + _Tp* + operator+=(ptrdiff_t __d) volatile + { return fetch_add(__d) + __d; } + + _Tp* + operator-=(ptrdiff_t __d) volatile + { return fetch_sub(__d) - __d; } + }; + + + /// Explicit specialization for void* + template<> + struct atomic : public atomic_address + { + typedef void* __integral_type; + typedef atomic_address __base_type; + + atomic() = default; + ~atomic() = default; + atomic(const atomic&) = delete; + atomic& operator=(const atomic&) = delete; + + atomic(__integral_type __i) : __base_type(__i) { } + + using __base_type::operator __integral_type; + using __base_type::operator=; + }; + + /// Explicit specialization for bool. + template<> + struct atomic : public atomic_bool + { + typedef bool __integral_type; + typedef atomic_bool __base_type; + + atomic() = default; + ~atomic() = default; + atomic(const atomic&) = delete; + atomic& operator=(const atomic&) = delete; + + atomic(__integral_type __i) : __base_type(__i) { } + + using __base_type::operator __integral_type; + using __base_type::operator=; + }; + + /// Explicit specialization for char. + template<> + struct atomic : public atomic_char + { + typedef char __integral_type; + typedef atomic_char __base_type; + + atomic() = default; + ~atomic() = default; + atomic(const atomic&) = delete; + atomic& operator=(const atomic&) = delete; + + atomic(__integral_type __i) : __base_type(__i) { } + + using __base_type::operator __integral_type; + using __base_type::operator=; + }; + + /// Explicit specialization for signed char. + template<> + struct atomic : public atomic_schar + { + typedef signed char __integral_type; + typedef atomic_schar __base_type; + + atomic() = default; + ~atomic() = default; + atomic(const atomic&) = delete; + atomic& operator=(const atomic&) = delete; + + atomic(__integral_type __i) : __base_type(__i) { } + + using __base_type::operator __integral_type; + using __base_type::operator=; + }; + + /// Explicit specialization for unsigned char. + template<> + struct atomic : public atomic_uchar + { + typedef unsigned char __integral_type; + typedef atomic_uchar __base_type; + + atomic() = default; + ~atomic() = default; + atomic(const atomic&) = delete; + atomic& operator=(const atomic&) = delete; + + atomic(__integral_type __i) : __base_type(__i) { } + + using __base_type::operator __integral_type; + using __base_type::operator=; + }; + + /// Explicit specialization for short. + template<> + struct atomic : public atomic_short + { + typedef short __integral_type; + typedef atomic_short __base_type; + + atomic() = default; + ~atomic() = default; + atomic(const atomic&) = delete; + atomic& operator=(const atomic&) = delete; + + atomic(__integral_type __i) : __base_type(__i) { } + + using __base_type::operator __integral_type; + using __base_type::operator=; + }; + + /// Explicit specialization for unsigned short. + template<> + struct atomic : public atomic_ushort + { + typedef unsigned short __integral_type; + typedef atomic_ushort __base_type; + + atomic() = default; + ~atomic() = default; + atomic(const atomic&) = delete; + atomic& operator=(const atomic&) = delete; + + atomic(__integral_type __i) : __base_type(__i) { } + + using __base_type::operator __integral_type; + using __base_type::operator=; + }; + + /// Explicit specialization for int. + template<> + struct atomic : atomic_int + { + typedef int __integral_type; + typedef atomic_int __base_type; + + atomic() = default; + ~atomic() = default; + atomic(const atomic&) = delete; + atomic& operator=(const atomic&) = delete; + + atomic(__integral_type __i) : __base_type(__i) { } + + using __base_type::operator __integral_type; + using __base_type::operator=; + }; + + /// Explicit specialization for unsigned int. + template<> + struct atomic : public atomic_uint + { + typedef unsigned int __integral_type; + typedef atomic_uint __base_type; + + atomic() = default; + ~atomic() = default; + atomic(const atomic&) = delete; + atomic& operator=(const atomic&) = delete; + + atomic(__integral_type __i) : __base_type(__i) { } + + using __base_type::operator __integral_type; + using __base_type::operator=; + }; + + /// Explicit specialization for long. + template<> + struct atomic : public atomic_long + { + typedef long __integral_type; + typedef atomic_long __base_type; + + atomic() = default; + ~atomic() = default; + atomic(const atomic&) = delete; + atomic& operator=(const atomic&) = delete; + + atomic(__integral_type __i) : __base_type(__i) { } + + using __base_type::operator __integral_type; + using __base_type::operator=; + }; + + /// Explicit specialization for unsigned long. + template<> + struct atomic : public atomic_ulong + { + typedef unsigned long __integral_type; + typedef atomic_ulong __base_type; + + atomic() = default; + ~atomic() = default; + atomic(const atomic&) = delete; + atomic& operator=(const atomic&) = delete; + + atomic(__integral_type __i) : __base_type(__i) { } + + using __base_type::operator __integral_type; + using __base_type::operator=; + }; + + /// Explicit specialization for long long. + template<> + struct atomic : public atomic_llong + { + typedef long long __integral_type; + typedef atomic_llong __base_type; + + atomic() = default; + ~atomic() = default; + atomic(const atomic&) = delete; + atomic& operator=(const atomic&) = delete; + + atomic(__integral_type __i) : __base_type(__i) { } + + using __base_type::operator __integral_type; + using __base_type::operator=; + }; + + /// Explicit specialization for unsigned long long. + template<> + struct atomic : public atomic_ullong + { + typedef unsigned long long __integral_type; + typedef atomic_ullong __base_type; + + atomic() = default; + ~atomic() = default; + atomic(const atomic&) = delete; + atomic& operator=(const atomic&) = delete; + + atomic(__integral_type __i) : __base_type(__i) { } + + using __base_type::operator __integral_type; + using __base_type::operator=; + }; + + /// Explicit specialization for wchar_t. + template<> + struct atomic : public atomic_wchar_t + { + typedef wchar_t __integral_type; + typedef atomic_wchar_t __base_type; + + atomic() = default; + ~atomic() = default; + atomic(const atomic&) = delete; + atomic& operator=(const atomic&) = delete; + + atomic(__integral_type __i) : __base_type(__i) { } + + using __base_type::operator __integral_type; + using __base_type::operator=; + }; + + /// Explicit specialization for char16_t. + template<> + struct atomic : public atomic_char16_t + { + typedef char16_t __integral_type; + typedef atomic_char16_t __base_type; + + atomic() = default; + ~atomic() = default; + atomic(const atomic&) = delete; + atomic& operator=(const atomic&) = delete; + + atomic(__integral_type __i) : __base_type(__i) { } + + using __base_type::operator __integral_type; + using __base_type::operator=; + }; + + /// Explicit specialization for char32_t. + template<> + struct atomic : public atomic_char32_t + { + typedef char32_t __integral_type; + typedef atomic_char32_t __base_type; + + atomic() = default; + ~atomic() = default; + atomic(const atomic&) = delete; + atomic& operator=(const atomic&) = delete; + + atomic(__integral_type __i) : __base_type(__i) { } + + using __base_type::operator __integral_type; + using __base_type::operator=; + }; + + + template + _Tp* + atomic<_Tp*>::load(memory_order __m) const volatile + { return static_cast<_Tp*>(atomic_address::load(__m)); } + + template + _Tp* + atomic<_Tp*>::exchange(_Tp* __v, memory_order __m) volatile + { return static_cast<_Tp*>(atomic_address::exchange(__v, __m)); } + + template + bool + atomic<_Tp*>::compare_exchange_weak(_Tp*& __r, _Tp* __v, memory_order __m1, + memory_order __m2) volatile + { + void** __vr = reinterpret_cast(&__r); + void* __vv = static_cast(__v); + return atomic_address::compare_exchange_weak(*__vr, __vv, __m1, __m2); + } + + template + bool + atomic<_Tp*>::compare_exchange_strong(_Tp*& __r, _Tp* __v, + memory_order __m1, + memory_order __m2) volatile + { + void** __vr = reinterpret_cast(&__r); + void* __vv = static_cast(__v); + return atomic_address::compare_exchange_strong(*__vr, __vv, __m1, __m2); + } + + template + bool + atomic<_Tp*>::compare_exchange_weak(_Tp*& __r, _Tp* __v, + memory_order __m) volatile + { + return compare_exchange_weak(__r, __v, __m, + __calculate_memory_order(__m)); + } + + template + bool + atomic<_Tp*>::compare_exchange_strong(_Tp*& __r, _Tp* __v, + memory_order __m) volatile + { + return compare_exchange_strong(__r, __v, __m, + __calculate_memory_order(__m)); + } + + template + _Tp* + atomic<_Tp*>::fetch_add(ptrdiff_t __d, memory_order __m) volatile + { + void* __p = atomic_fetch_add_explicit(this, sizeof(_Tp) * __d, __m); + return static_cast<_Tp*>(__p); + } + + template + _Tp* + atomic<_Tp*>::fetch_sub(ptrdiff_t __d, memory_order __m) volatile + { + void* __p = atomic_fetch_sub_explicit(this, sizeof(_Tp) * __d, __m); + return static_cast<_Tp*>(__p); + } + + // Convenience function definitions, atomic_flag. + inline bool + atomic_flag_test_and_set_explicit(volatile atomic_flag* __a, memory_order __m) + { return __a->test_and_set(__m); } + + inline void + atomic_flag_clear_explicit(volatile atomic_flag* __a, memory_order __m) + { return __a->clear(__m); } + + + // Convenience function definitions, atomic_address. + inline bool + atomic_is_lock_free(const volatile atomic_address* __a) + { return __a->is_lock_free(); } + + inline void + atomic_store(volatile atomic_address* __a, void* __v) + { __a->store(__v); } + + inline void + atomic_store_explicit(volatile atomic_address* __a, void* __v, + memory_order __m) + { __a->store(__v, __m); } + + inline void* + atomic_load(const volatile atomic_address* __a) + { return __a->load(); } + + inline void* + atomic_load_explicit(const volatile atomic_address* __a, memory_order __m) + { return __a->load(__m); } + + inline void* + atomic_exchange(volatile atomic_address* __a, void* __v) + { return __a->exchange(__v); } + + inline void* + atomic_exchange_explicit(volatile atomic_address* __a, void* __v, + memory_order __m) + { return __a->exchange(__v, __m); } + + inline bool + atomic_compare_exchange_weak(volatile atomic_address* __a, + void** __v1, void* __v2) + { + return __a->compare_exchange_weak(*__v1, __v2, memory_order_seq_cst, + memory_order_seq_cst); + } + + inline bool + atomic_compare_exchange_strong(volatile atomic_address* __a, + void** __v1, void* __v2) + { + return __a->compare_exchange_strong(*__v1, __v2, memory_order_seq_cst, + memory_order_seq_cst); + } + + inline bool + atomic_compare_exchange_weak_explicit(volatile atomic_address* __a, + void** __v1, void* __v2, + memory_order __m1, memory_order __m2) + { return __a->compare_exchange_weak(*__v1, __v2, __m1, __m2); } + + inline bool + atomic_compare_exchange_strong_explicit(volatile atomic_address* __a, + void** __v1, void* __v2, + memory_order __m1, memory_order __m2) + { return __a->compare_exchange_strong(*__v1, __v2, __m1, __m2); } + + inline void* + atomic_fetch_add_explicit(volatile atomic_address* __a, ptrdiff_t __d, + memory_order __m) + { return __a->fetch_add(__d, __m); } + + inline void* + atomic_fetch_add(volatile atomic_address* __a, ptrdiff_t __d) + { return __a->fetch_add(__d); } + + inline void* + atomic_fetch_sub_explicit(volatile atomic_address* __a, ptrdiff_t __d, + memory_order __m) + { return __a->fetch_sub(__d, __m); } + + inline void* + atomic_fetch_sub(volatile atomic_address* __a, ptrdiff_t __d) + { return __a->fetch_sub(__d); } + + + // Convenience function definitions, atomic_bool. + inline bool + atomic_is_lock_free(const volatile atomic_bool* __a) + { return __a->is_lock_free(); } + + inline void + atomic_store(volatile atomic_bool* __a, bool __i) + { __a->store(__i); } + + inline void + atomic_store_explicit(volatile atomic_bool* __a, bool __i, memory_order __m) + { __a->store(__i, __m); } + + inline bool + atomic_load(const volatile atomic_bool* __a) + { return __a->load(); } + + inline bool + atomic_load_explicit(const volatile atomic_bool* __a, memory_order __m) + { return __a->load(__m); } + + inline bool + atomic_exchange(volatile atomic_bool* __a, bool __i) + { return __a->exchange(__i); } + + inline bool + atomic_exchange_explicit(volatile atomic_bool* __a, bool __i, + memory_order __m) + { return __a->exchange(__i, __m); } + + inline bool + atomic_compare_exchange_weak(volatile atomic_bool* __a, bool* __i1, bool __i2) + { + return __a->compare_exchange_weak(*__i1, __i2, memory_order_seq_cst, + memory_order_seq_cst); + } + + inline bool + atomic_compare_exchange_strong(volatile atomic_bool* __a, + bool* __i1, bool __i2) + { + return __a->compare_exchange_strong(*__i1, __i2, memory_order_seq_cst, + memory_order_seq_cst); + } + + inline bool + atomic_compare_exchange_weak_explicit(volatile atomic_bool* __a, bool* __i1, + bool __i2, memory_order __m1, + memory_order __m2) + { return __a->compare_exchange_weak(*__i1, __i2, __m1, __m2); } + + inline bool + atomic_compare_exchange_strong_explicit(volatile atomic_bool* __a, + bool* __i1, bool __i2, + memory_order __m1, memory_order __m2) + { return __a->compare_exchange_strong(*__i1, __i2, __m1, __m2); } + + + + // Free standing functions. Template argument should be constricted + // to intergral types as specified in the standard. + template + inline void + atomic_store_explicit(volatile __atomic_base<_ITp>* __a, _ITp __i, + memory_order __m) + { __a->store(__i, __m); } + + template + inline _ITp + atomic_load_explicit(const volatile __atomic_base<_ITp>* __a, + memory_order __m) + { return __a->load(__m); } + + template + inline _ITp + atomic_exchange_explicit(volatile __atomic_base<_ITp>* __a, + _ITp __i, memory_order __m) + { return __a->exchange(__i, __m); } + + template + inline bool + atomic_compare_exchange_weak_explicit(volatile __atomic_base<_ITp>* __a, + _ITp* __i1, _ITp __i2, + memory_order __m1, memory_order __m2) + { return __a->compare_exchange_weak(*__i1, __i2, __m1, __m2); } + + template + inline bool + atomic_compare_exchange_strong_explicit(volatile __atomic_base<_ITp>* __a, + _ITp* __i1, _ITp __i2, + memory_order __m1, + memory_order __m2) + { return __a->compare_exchange_strong(*__i1, __i2, __m1, __m2); } + + template + inline _ITp + atomic_fetch_add_explicit(volatile __atomic_base<_ITp>* __a, _ITp __i, + memory_order __m) + { return __a->fetch_add(__i, __m); } + + template + inline _ITp + atomic_fetch_sub_explicit(volatile __atomic_base<_ITp>* __a, _ITp __i, + memory_order __m) + { return __a->fetch_sub(__i, __m); } + + template + inline _ITp + atomic_fetch_and_explicit(volatile __atomic_base<_ITp>* __a, _ITp __i, + memory_order __m) + { return __a->fetch_and(__i, __m); } + + template + inline _ITp + atomic_fetch_or_explicit(volatile __atomic_base<_ITp>* __a, _ITp __i, + memory_order __m) + { return __a->fetch_or(__i, __m); } + + template + inline _ITp + atomic_fetch_xor_explicit(volatile __atomic_base<_ITp>* __a, _ITp __i, + memory_order __m) + { return __a->fetch_xor(__i, __m); } + + template + inline bool + atomic_is_lock_free(const volatile __atomic_base<_ITp>* __a) + { return __a->is_lock_free(); } + + template + inline void + atomic_store(volatile __atomic_base<_ITp>* __a, _ITp __i) + { atomic_store_explicit(__a, __i, memory_order_seq_cst); } + + template + inline _ITp + atomic_load(const volatile __atomic_base<_ITp>* __a) + { return atomic_load_explicit(__a, memory_order_seq_cst); } + + template + inline _ITp + atomic_exchange(volatile __atomic_base<_ITp>* __a, _ITp __i) + { return atomic_exchange_explicit(__a, __i, memory_order_seq_cst); } + + template + inline bool + atomic_compare_exchange_weak(volatile __atomic_base<_ITp>* __a, + _ITp* __i1, _ITp __i2) + { + return atomic_compare_exchange_weak_explicit(__a, __i1, __i2, + memory_order_seq_cst, + memory_order_seq_cst); + } + + template + inline bool + atomic_compare_exchange_strong(volatile __atomic_base<_ITp>* __a, + _ITp* __i1, _ITp __i2) + { + return atomic_compare_exchange_strong_explicit(__a, __i1, __i2, + memory_order_seq_cst, + memory_order_seq_cst); + } + + template + inline _ITp + atomic_fetch_add(volatile __atomic_base<_ITp>* __a, _ITp __i) + { return atomic_fetch_add_explicit(__a, __i, memory_order_seq_cst); } + + template + inline _ITp + atomic_fetch_sub(volatile __atomic_base<_ITp>* __a, _ITp __i) + { return atomic_fetch_sub_explicit(__a, __i, memory_order_seq_cst); } + + template + inline _ITp + atomic_fetch_and(volatile __atomic_base<_ITp>* __a, _ITp __i) + { return atomic_fetch_and_explicit(__a, __i, memory_order_seq_cst); } + + template + inline _ITp + atomic_fetch_or(volatile __atomic_base<_ITp>* __a, _ITp __i) + { return atomic_fetch_or_explicit(__a, __i, memory_order_seq_cst); } + + template + inline _ITp + atomic_fetch_xor(volatile __atomic_base<_ITp>* __a, _ITp __i) + { return atomic_fetch_xor_explicit(__a, __i, memory_order_seq_cst); } + + // @} group atomics + +_GLIBCXX_END_NAMESPACE + +#endif + + diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdbool b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdbool new file mode 100644 index 00000000..3012c46b --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdbool @@ -0,0 +1,44 @@ +// -*- C++ -*- + +// Copyright (C) 2007, 2008, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file include/cstdbool + * This is a Standard C++ Library header. + */ + +#pragma GCC system_header + +#ifndef _GLIBCXX_CSTDBOOL +#define _GLIBCXX_CSTDBOOL 1 + +#ifndef __GXX_EXPERIMENTAL_CXX0X__ +# include +#else +# include +# if _GLIBCXX_HAVE_STDBOOL_H +# include +# endif +#endif + +#endif + diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/cstddef b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cstddef new file mode 100644 index 00000000..bb16e75e --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cstddef @@ -0,0 +1,56 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file cstddef + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c stddef.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 18.1 Types +// + +#pragma GCC system_header + +#include +#include + +#ifndef _GLIBCXX_CSTDDEF +#define _GLIBCXX_CSTDDEF 1 + +_GLIBCXX_BEGIN_NAMESPACE(std) + + using ::ptrdiff_t; + using ::size_t; + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdint b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdint new file mode 100644 index 00000000..0927f8aa --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdint @@ -0,0 +1,79 @@ +// -*- C++ -*- + +// Copyright (C) 2007, 2008, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file include/cstdint + * This is a Standard C++ Library header. + */ + +#ifndef _GLIBCXX_CSTDINT +#define _GLIBCXX_CSTDINT 1 + +#pragma GCC system_header + +#ifndef __GXX_EXPERIMENTAL_CXX0X__ +# include +#endif + +#if defined(_GLIBCXX_INCLUDE_AS_TR1) +# error C++0x header cannot be included from TR1 header +#endif + +#include + +// For 8.22.1/1 (see C99, Notes 219, 220, 222) +#if _GLIBCXX_HAVE_STDINT_H +# ifndef __STDC_LIMIT_MACROS +# define _UNDEF__STDC_LIMIT_MACROS +# define __STDC_LIMIT_MACROS +# endif +# ifndef __STDC_CONSTANT_MACROS +# define _UNDEF__STDC_CONSTANT_MACROS +# define __STDC_CONSTANT_MACROS +# endif +# include +# ifdef _UNDEF__STDC_LIMIT_MACROS +# undef __STDC_LIMIT_MACROS +# undef _UNDEF__STDC_LIMIT_MACROS +# endif +# ifdef _UNDEF__STDC_CONSTANT_MACROS +# undef __STDC_CONSTANT_MACROS +# undef _UNDEF__STDC_CONSTANT_MACROS +# endif +#endif + +#if defined(_GLIBCXX_INCLUDE_AS_CXX0X) +# include +#else +# define _GLIBCXX_INCLUDE_AS_CXX0X +# define _GLIBCXX_BEGIN_NAMESPACE_TR1 +# define _GLIBCXX_END_NAMESPACE_TR1 +# define _GLIBCXX_TR1 +# include +# undef _GLIBCXX_TR1 +# undef _GLIBCXX_END_NAMESPACE_TR1 +# undef _GLIBCXX_BEGIN_NAMESPACE_TR1 +# undef _GLIBCXX_INCLUDE_AS_CXX0X +#endif + +#endif // _GLIBCXX_CSTDINT diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdio b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdio new file mode 100644 index 00000000..b4826e21 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdio @@ -0,0 +1,205 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file include/cstdio + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c stdio.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 27.8.2 C Library files +// + +#pragma GCC system_header + +#include +#include +#include + +#ifndef _GLIBCXX_CSTDIO +#define _GLIBCXX_CSTDIO 1 + +// Get rid of those macros defined in in lieu of real functions. +#undef clearerr +#undef fclose +#undef feof +#undef ferror +#undef fflush +#undef fgetc +#undef fgetpos +#undef fgets +#undef fopen +#undef fprintf +#undef fputc +#undef fputs +#undef fread +#undef freopen +#undef fscanf +#undef fseek +#undef fsetpos +#undef ftell +#undef fwrite +#undef getc +#undef getchar +#undef gets +#undef perror +#undef printf +#undef putc +#undef putchar +#undef puts +#undef remove +#undef rename +#undef rewind +#undef scanf +#undef setbuf +#undef setvbuf +#undef sprintf +#undef sscanf +#undef tmpfile +#undef tmpnam +#undef ungetc +#undef vfprintf +#undef vprintf +#undef vsprintf + +_GLIBCXX_BEGIN_NAMESPACE(std) + + using ::FILE; + using ::fpos_t; + + using ::clearerr; + using ::fclose; + using ::feof; + using ::ferror; + using ::fflush; + using ::fgetc; + using ::fgetpos; + using ::fgets; + using ::fopen; + using ::fprintf; + using ::fputc; + using ::fputs; + using ::fread; + using ::freopen; + using ::fscanf; + using ::fseek; + using ::fsetpos; + using ::ftell; + using ::fwrite; + using ::getc; + using ::getchar; + using ::gets; + using ::perror; + using ::printf; + using ::putc; + using ::putchar; + using ::puts; + using ::remove; + using ::rename; + using ::rewind; + using ::scanf; + using ::setbuf; + using ::setvbuf; + using ::sprintf; + using ::sscanf; + using ::tmpfile; + using ::tmpnam; + using ::ungetc; + using ::vfprintf; + using ::vprintf; + using ::vsprintf; + +_GLIBCXX_END_NAMESPACE + +#if _GLIBCXX_USE_C99 + +#undef snprintf +#undef vfscanf +#undef vscanf +#undef vsnprintf +#undef vsscanf + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + +#if _GLIBCXX_USE_C99_CHECK || _GLIBCXX_USE_C99_DYNAMIC + extern "C" int + (snprintf)(char * restrict, size_t, const char * restrict, ...); + extern "C" int + (vfscanf)(FILE * restrict, const char * restrict, __gnuc_va_list); + extern "C" int (vscanf)(const char * restrict, __gnuc_va_list); + extern "C" int + (vsnprintf)(char * restrict, size_t, const char * restrict, __gnuc_va_list); + extern "C" int + (vsscanf)(const char * restrict, const char * restrict, __gnuc_va_list); +#endif + +#if !_GLIBCXX_USE_C99_DYNAMIC + using ::snprintf; + using ::vfscanf; + using ::vscanf; + using ::vsnprintf; + using ::vsscanf; +#endif + +_GLIBCXX_END_NAMESPACE + +_GLIBCXX_BEGIN_NAMESPACE(std) + + using ::__gnu_cxx::snprintf; + using ::__gnu_cxx::vfscanf; + using ::__gnu_cxx::vscanf; + using ::__gnu_cxx::vsnprintf; + using ::__gnu_cxx::vsscanf; + +_GLIBCXX_END_NAMESPACE + +#endif // _GLIBCXX_USE_C99 + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ +# if defined(_GLIBCXX_INCLUDE_AS_TR1) +# error C++0x header cannot be included from TR1 header +# endif +# if defined(_GLIBCXX_INCLUDE_AS_CXX0X) +# include +# else +# define _GLIBCXX_INCLUDE_AS_CXX0X +# define _GLIBCXX_BEGIN_NAMESPACE_TR1 +# define _GLIBCXX_END_NAMESPACE_TR1 +# define _GLIBCXX_TR1 +# include +# undef _GLIBCXX_TR1 +# undef _GLIBCXX_END_NAMESPACE_TR1 +# undef _GLIBCXX_BEGIN_NAMESPACE_TR1 +# undef _GLIBCXX_INCLUDE_AS_CXX0X +# endif +#endif + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdlib b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdlib new file mode 100644 index 00000000..a29031eb --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cstdlib @@ -0,0 +1,242 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file include/cstdlib + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c stdlib.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 20.4.6 C library +// + +#pragma GCC system_header + +#include +#include + +#ifndef _GLIBCXX_CSTDLIB +#define _GLIBCXX_CSTDLIB 1 + +#if !_GLIBCXX_HOSTED +// The C standard does not require a freestanding implementation to +// provide . However, the C++ standard does still require +// -- but only the functionality mentioned in +// [lib.support.start.term]. + +#define EXIT_SUCCESS 0 +#define EXIT_FAILURE 1 + +_GLIBCXX_BEGIN_NAMESPACE(std) + + extern "C" void abort(void); + extern "C" int atexit(void (*)()); + extern "C" void exit(int); + +_GLIBCXX_END_NAMESPACE + +#else + +#include + +// Get rid of those macros defined in in lieu of real functions. +#undef abort +#undef abs +#undef atexit +#undef atof +#undef atoi +#undef atol +#undef bsearch +#undef calloc +#undef div +#undef exit +#undef free +#undef getenv +#undef labs +#undef ldiv +#undef malloc +#undef mblen +#undef mbstowcs +#undef mbtowc +#undef qsort +#undef rand +#undef realloc +#undef srand +#undef strtod +#undef strtol +#undef strtoul +#undef system +#undef wcstombs +#undef wctomb + +_GLIBCXX_BEGIN_NAMESPACE(std) + + using ::div_t; + using ::ldiv_t; + + using ::abort; + using ::abs; + using ::atexit; + using ::atof; + using ::atoi; + using ::atol; + using ::bsearch; + using ::calloc; + using ::div; + using ::exit; + using ::free; + using ::getenv; + using ::labs; + using ::ldiv; + using ::malloc; +#ifdef _GLIBCXX_HAVE_MBSTATE_T + using ::mblen; + using ::mbstowcs; + using ::mbtowc; +#endif // _GLIBCXX_HAVE_MBSTATE_T + using ::qsort; + using ::rand; + using ::realloc; + using ::srand; + using ::strtod; + using ::strtol; + using ::strtoul; + using ::system; +#ifdef _GLIBCXX_USE_WCHAR_T + using ::wcstombs; + using ::wctomb; +#endif // _GLIBCXX_USE_WCHAR_T + + inline long + abs(long __i) { return labs(__i); } + + inline ldiv_t + div(long __i, long __j) { return ldiv(__i, __j); } + +_GLIBCXX_END_NAMESPACE + +#if _GLIBCXX_USE_C99 + +#undef _Exit +#undef llabs +#undef lldiv +#undef atoll +#undef strtoll +#undef strtoull +#undef strtof +#undef strtold + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + +#if !_GLIBCXX_USE_C99_LONG_LONG_DYNAMIC + using ::lldiv_t; +#endif +#if _GLIBCXX_USE_C99_CHECK || _GLIBCXX_USE_C99_DYNAMIC + extern "C" void (_Exit)(int); +#endif +#if !_GLIBCXX_USE_C99_DYNAMIC + using ::_Exit; +#endif + + inline long long + abs(long long __x) { return __x >= 0 ? __x : -__x; } + +#if !_GLIBCXX_USE_C99_LONG_LONG_DYNAMIC + using ::llabs; + + inline lldiv_t + div(long long __n, long long __d) + { lldiv_t __q; __q.quot = __n / __d; __q.rem = __n % __d; return __q; } + + using ::lldiv; +#endif + +#if _GLIBCXX_USE_C99_LONG_LONG_CHECK || _GLIBCXX_USE_C99_LONG_LONG_DYNAMIC + extern "C" long long int (atoll)(const char *); + extern "C" long long int + (strtoll)(const char * restrict, char ** restrict, int); + extern "C" unsigned long long int + (strtoull)(const char * restrict, char ** restrict, int); +#endif +#if !_GLIBCXX_USE_C99_LONG_LONG_DYNAMIC + using ::atoll; + using ::strtoll; + using ::strtoull; +#endif + using ::strtof; + using ::strtold; + +_GLIBCXX_END_NAMESPACE + +_GLIBCXX_BEGIN_NAMESPACE(std) + +#if !_GLIBCXX_USE_C99_LONG_LONG_DYNAMIC + using ::__gnu_cxx::lldiv_t; +#endif + using ::__gnu_cxx::_Exit; + using ::__gnu_cxx::abs; +#if !_GLIBCXX_USE_C99_LONG_LONG_DYNAMIC + using ::__gnu_cxx::llabs; + using ::__gnu_cxx::div; + using ::__gnu_cxx::lldiv; +#endif + using ::__gnu_cxx::atoll; + using ::__gnu_cxx::strtof; + using ::__gnu_cxx::strtoll; + using ::__gnu_cxx::strtoull; + using ::__gnu_cxx::strtold; + +_GLIBCXX_END_NAMESPACE + +#endif // _GLIBCXX_USE_C99 + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ +# if defined(_GLIBCXX_INCLUDE_AS_TR1) +# error C++0x header cannot be included from TR1 header +# endif +# if defined(_GLIBCXX_INCLUDE_AS_CXX0X) +# include +# else +# define _GLIBCXX_INCLUDE_AS_CXX0X +# define _GLIBCXX_BEGIN_NAMESPACE_TR1 +# define _GLIBCXX_END_NAMESPACE_TR1 +# define _GLIBCXX_TR1 +# include +# undef _GLIBCXX_TR1 +# undef _GLIBCXX_END_NAMESPACE_TR1 +# undef _GLIBCXX_BEGIN_NAMESPACE_TR1 +# undef _GLIBCXX_INCLUDE_AS_CXX0X +# endif +#endif + +#endif // !_GLIBCXX_HOSTED + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/cstring b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cstring new file mode 100644 index 00000000..de0ce242 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cstring @@ -0,0 +1,123 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file cstring + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c string.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 20.4.6 C library +// + +#pragma GCC system_header + +#include +#include +#include + +#ifndef _GLIBCXX_CSTRING +#define _GLIBCXX_CSTRING 1 + +// Get rid of those macros defined in in lieu of real functions. +#undef memchr +#undef memcmp +#undef memcpy +#undef memmove +#undef memset +#undef strcat +#undef strchr +#undef strcmp +#undef strcoll +#undef strcpy +#undef strcspn +#undef strerror +#undef strlen +#undef strncat +#undef strncmp +#undef strncpy +#undef strpbrk +#undef strrchr +#undef strspn +#undef strstr +#undef strtok +#undef strxfrm + +_GLIBCXX_BEGIN_NAMESPACE(std) + + using ::memchr; + using ::memcmp; + using ::memcpy; + using ::memmove; + using ::memset; + using ::strcat; + using ::strcmp; + using ::strcoll; + using ::strcpy; + using ::strcspn; + using ::strerror; + using ::strlen; + using ::strncat; + using ::strncmp; + using ::strncpy; + using ::strspn; + using ::strtok; + using ::strxfrm; + using ::strchr; + using ::strpbrk; + using ::strrchr; + using ::strstr; + +#ifndef __CORRECT_ISO_CPP_STRING_H_PROTO + inline void* + memchr(void* __p, int __c, size_t __n) + { return memchr(const_cast(__p), __c, __n); } + + inline char* + strchr(char* __s1, int __n) + { return __builtin_strchr(const_cast(__s1), __n); } + + inline char* + strpbrk(char* __s1, const char* __s2) + { return __builtin_strpbrk(const_cast(__s1), __s2); } + + inline char* + strrchr(char* __s1, int __n) + { return __builtin_strrchr(const_cast(__s1), __n); } + + inline char* + strstr(char* __s1, const char* __s2) + { return __builtin_strstr(const_cast(__s1), __s2); } +#endif + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/ctgmath b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ctgmath new file mode 100644 index 00000000..3c6fcf73 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ctgmath @@ -0,0 +1,41 @@ +// -*- C++ -*- + +// Copyright (C) 2007, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file include/ctgmath + * This is a Standard C++ Library header. + */ + +#pragma GCC system_header + +#ifndef _GLIBCXX_CTGMATH +#define _GLIBCXX_CTGMATH 1 + +#ifndef __GXX_EXPERIMENTAL_CXX0X__ +# include +#else +# include +#endif + +#endif + diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/ctime b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ctime new file mode 100644 index 00000000..e236cf48 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ctime @@ -0,0 +1,78 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file include/ctime + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c time.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 20.5 Date and time +// + +#pragma GCC system_header + +#include +#include + +#ifndef _GLIBCXX_CTIME +#define _GLIBCXX_CTIME 1 + +// Get rid of those macros defined in in lieu of real functions. +#undef clock +#undef difftime +#undef mktime +#undef time +#undef asctime +#undef ctime +#undef gmtime +#undef localtime +#undef strftime + +_GLIBCXX_BEGIN_NAMESPACE(std) + + using ::clock_t; + using ::time_t; + using ::tm; + + using ::clock; + using ::difftime; + using ::mktime; + using ::time; + using ::asctime; + using ::ctime; + using ::gmtime; + using ::localtime; + using ::strftime; + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/cwchar b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cwchar new file mode 100644 index 00000000..e5ea07e7 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cwchar @@ -0,0 +1,291 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file include/cwchar + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c wchar.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: 21.4 +// + +#pragma GCC system_header + +#include +#include + +#if _GLIBCXX_HAVE_WCHAR_H +#include +#endif + +#ifndef _GLIBCXX_CWCHAR +#define _GLIBCXX_CWCHAR 1 + +// Need to do a bit of trickery here with mbstate_t as char_traits +// assumes it is in wchar.h, regardless of wchar_t specializations. +#ifndef _GLIBCXX_HAVE_MBSTATE_T +extern "C" +{ + typedef struct + { + int __fill[6]; + } mbstate_t; +} +#endif + +_GLIBCXX_BEGIN_NAMESPACE(std) + + using ::mbstate_t; + +_GLIBCXX_END_NAMESPACE + +// Get rid of those macros defined in in lieu of real functions. +#undef btowc +#undef fgetwc +#undef fgetws +#undef fputwc +#undef fputws +#undef fwide +#undef fwprintf +#undef fwscanf +#undef getwc +#undef getwchar +#undef mbrlen +#undef mbrtowc +#undef mbsinit +#undef mbsrtowcs +#undef putwc +#undef putwchar +#undef swprintf +#undef swscanf +#undef ungetwc +#undef vfwprintf +#if _GLIBCXX_HAVE_VFWSCANF +# undef vfwscanf +#endif +#undef vswprintf +#if _GLIBCXX_HAVE_VSWSCANF +# undef vswscanf +#endif +#undef vwprintf +#if _GLIBCXX_HAVE_VWSCANF +# undef vwscanf +#endif +#undef wcrtomb +#undef wcscat +#undef wcschr +#undef wcscmp +#undef wcscoll +#undef wcscpy +#undef wcscspn +#undef wcsftime +#undef wcslen +#undef wcsncat +#undef wcsncmp +#undef wcsncpy +#undef wcspbrk +#undef wcsrchr +#undef wcsrtombs +#undef wcsspn +#undef wcsstr +#undef wcstod +#if _GLIBCXX_HAVE_WCSTOF +# undef wcstof +#endif +#undef wcstok +#undef wcstol +#undef wcstoul +#undef wcsxfrm +#undef wctob +#undef wmemchr +#undef wmemcmp +#undef wmemcpy +#undef wmemmove +#undef wmemset +#undef wprintf +#undef wscanf + +#if _GLIBCXX_USE_WCHAR_T + +_GLIBCXX_BEGIN_NAMESPACE(std) + + using ::wint_t; + + using ::btowc; + using ::fgetwc; + using ::fgetws; + using ::fputwc; + using ::fputws; + using ::fwide; + using ::fwprintf; + using ::fwscanf; + using ::getwc; + using ::getwchar; + using ::mbrlen; + using ::mbrtowc; + using ::mbsinit; + using ::mbsrtowcs; + using ::putwc; + using ::putwchar; + using ::swprintf; + using ::swscanf; + using ::ungetwc; + using ::vfwprintf; +#if _GLIBCXX_HAVE_VFWSCANF + using ::vfwscanf; +#endif + using ::vswprintf; +#if _GLIBCXX_HAVE_VSWSCANF + using ::vswscanf; +#endif + using ::vwprintf; +#if _GLIBCXX_HAVE_VWSCANF + using ::vwscanf; +#endif + using ::wcrtomb; + using ::wcscat; + using ::wcscmp; + using ::wcscoll; + using ::wcscpy; + using ::wcscspn; + using ::wcsftime; + using ::wcslen; + using ::wcsncat; + using ::wcsncmp; + using ::wcsncpy; + using ::wcsrtombs; + using ::wcsspn; + using ::wcstod; +#if _GLIBCXX_HAVE_WCSTOF + using ::wcstof; +#endif + using ::wcstok; + using ::wcstol; + using ::wcstoul; + using ::wcsxfrm; + using ::wctob; + using ::wmemcmp; + using ::wmemcpy; + using ::wmemmove; + using ::wmemset; + using ::wprintf; + using ::wscanf; + using ::wcschr; + using ::wcspbrk; + using ::wcsrchr; + using ::wcsstr; + using ::wmemchr; + +#ifndef __CORRECT_ISO_CPP_WCHAR_H_PROTO + inline wchar_t* + wcschr(wchar_t* __p, wchar_t __c) + { return wcschr(const_cast(__p), __c); } + + inline wchar_t* + wcspbrk(wchar_t* __s1, const wchar_t* __s2) + { return wcspbrk(const_cast(__s1), __s2); } + + inline wchar_t* + wcsrchr(wchar_t* __p, wchar_t __c) + { return wcsrchr(const_cast(__p), __c); } + + inline wchar_t* + wcsstr(wchar_t* __s1, const wchar_t* __s2) + { return wcsstr(const_cast(__s1), __s2); } + + inline wchar_t* + wmemchr(wchar_t* __p, wchar_t __c, size_t __n) + { return wmemchr(const_cast(__p), __c, __n); } +#endif + +_GLIBCXX_END_NAMESPACE + +#if _GLIBCXX_USE_C99 + +#undef wcstold +#undef wcstoll +#undef wcstoull + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + +#if _GLIBCXX_USE_C99_CHECK || _GLIBCXX_USE_C99_DYNAMIC + extern "C" long double + (wcstold)(const wchar_t * restrict, wchar_t ** restrict); +#endif +#if !_GLIBCXX_USE_C99_DYNAMIC + using ::wcstold; +#endif +#if _GLIBCXX_USE_C99_LONG_LONG_CHECK || _GLIBCXX_USE_C99_LONG_LONG_DYNAMIC + extern "C" long long int + (wcstoll)(const wchar_t * restrict, wchar_t ** restrict, int); + extern "C" unsigned long long int + (wcstoull)(const wchar_t * restrict, wchar_t ** restrict, int); +#endif +#if !_GLIBCXX_USE_C99_LONG_LONG_DYNAMIC + using ::wcstoll; + using ::wcstoull; +#endif + +_GLIBCXX_END_NAMESPACE + +_GLIBCXX_BEGIN_NAMESPACE(std) + + using ::__gnu_cxx::wcstold; + using ::__gnu_cxx::wcstoll; + using ::__gnu_cxx::wcstoull; + +_GLIBCXX_END_NAMESPACE + +#endif + +#endif //_GLIBCXX_USE_WCHAR_T + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ +# if defined(_GLIBCXX_INCLUDE_AS_TR1) +# error C++0x header cannot be included from TR1 header +# endif +# if defined(_GLIBCXX_INCLUDE_AS_CXX0X) +# include +# else +# define _GLIBCXX_INCLUDE_AS_CXX0X +# define _GLIBCXX_BEGIN_NAMESPACE_TR1 +# define _GLIBCXX_END_NAMESPACE_TR1 +# define _GLIBCXX_TR1 +# include +# undef _GLIBCXX_TR1 +# undef _GLIBCXX_END_NAMESPACE_TR1 +# undef _GLIBCXX_BEGIN_NAMESPACE_TR1 +# undef _GLIBCXX_INCLUDE_AS_CXX0X +# endif +#endif + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/cwctype b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cwctype new file mode 100644 index 00000000..4e94fec3 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cwctype @@ -0,0 +1,126 @@ +// -*- C++ -*- forwarding header. + +// Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, +// 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file include/cwctype + * This is a Standard C++ Library file. You should @c #include this file + * in your programs, rather than any of the "*.h" implementation files. + * + * This is the C++ version of the Standard C Library header @c wctype.h, + * and its contents are (mostly) the same as that header, but are all + * contained in the namespace @c std (except for names which are defined + * as macros in C). + */ + +// +// ISO C++ 14882: +// + +#pragma GCC system_header + +#include + +#if _GLIBCXX_HAVE_WCTYPE_H +#include +#endif + +#ifndef _GLIBCXX_CWCTYPE +#define _GLIBCXX_CWCTYPE 1 + +// Get rid of those macros defined in in lieu of real functions. +#undef iswalnum +#undef iswalpha +#if _GLIBCXX_HAVE_ISWBLANK +# undef iswblank +#endif +#undef iswcntrl +#undef iswctype +#undef iswdigit +#undef iswgraph +#undef iswlower +#undef iswprint +#undef iswpunct +#undef iswspace +#undef iswupper +#undef iswxdigit +#undef towctrans +#undef towlower +#undef towupper +#undef wctrans +#undef wctype + +#if _GLIBCXX_USE_WCHAR_T + +_GLIBCXX_BEGIN_NAMESPACE(std) + + using ::wctrans_t; + using ::wctype_t; + using ::wint_t; + + using ::iswalnum; + using ::iswalpha; +#if _GLIBCXX_HAVE_ISWBLANK + using ::iswblank; +#endif + using ::iswcntrl; + using ::iswctype; + using ::iswdigit; + using ::iswgraph; + using ::iswlower; + using ::iswprint; + using ::iswpunct; + using ::iswspace; + using ::iswupper; + using ::iswxdigit; + using ::towctrans; + using ::towlower; + using ::towupper; + using ::wctrans; + using ::wctype; + +_GLIBCXX_END_NAMESPACE + +#endif //_GLIBCXX_USE_WCHAR_T + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ +# if defined(_GLIBCXX_INCLUDE_AS_TR1) +# error C++0x header cannot be included from TR1 header +# endif +# if defined(_GLIBCXX_INCLUDE_AS_CXX0X) +# include +# else +# define _GLIBCXX_INCLUDE_AS_CXX0X +# define _GLIBCXX_BEGIN_NAMESPACE_TR1 +# define _GLIBCXX_END_NAMESPACE_TR1 +# define _GLIBCXX_TR1 +# include +# undef _GLIBCXX_TR1 +# undef _GLIBCXX_END_NAMESPACE_TR1 +# undef _GLIBCXX_BEGIN_NAMESPACE_TR1 +# undef _GLIBCXX_INCLUDE_AS_CXX0X +# endif +#endif + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/cxxabi-forced.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cxxabi-forced.h new file mode 100644 index 00000000..e0cf1d05 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cxxabi-forced.h @@ -0,0 +1,51 @@ +// cxxabi.h subset for inclusion by other library headers -*- C++ -*- + +// Copyright (C) 2007, 2009 Free Software Foundation, Inc. +// +// This file is part of GCC. +// +// GCC is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation; either version 3, or (at your option) +// any later version. +// +// GCC is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. +// +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +#ifndef _CXXABI_FORCED_H +#define _CXXABI_FORCED_H 1 + +#pragma GCC visibility push(default) + +#ifdef __cplusplus +namespace __cxxabiv1 +{ + /** + * @brief Thrown as part of forced unwinding. + * @ingroup exceptions + * + * A magic placeholder class that can be caught by reference to + * recognize forced unwinding. + */ + class __forced_unwind + { + virtual ~__forced_unwind() throw(); + virtual void __pure_dummy() = 0; // prevent catch by value + }; +} +#endif // __cplusplus + +#pragma GCC visibility pop + +#endif // __CXXABI_FORCED_H diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/cxxabi.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cxxabi.h new file mode 100644 index 00000000..bfdd8e58 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/cxxabi.h @@ -0,0 +1,608 @@ +// new abi support -*- C++ -*- + +// Copyright (C) 2000, 2002, 2003, 2004, 2006, 2007, 2009 +// Free Software Foundation, Inc. +// +// This file is part of GCC. +// +// GCC is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation; either version 3, or (at your option) +// any later version. +// +// GCC is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. +// +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +// Written by Nathan Sidwell, Codesourcery LLC, + +/* This file declares the new abi entry points into the runtime. It is not + normally necessary for user programs to include this header, or use the + entry points directly. However, this header is available should that be + needed. + + Some of the entry points are intended for both C and C++, thus this header + is includable from both C and C++. Though the C++ specific parts are not + available in C, naturally enough. */ + +/** @file cxxabi.h + * The header provides an interface to the C++ ABI. + */ + +#ifndef _CXXABI_H +#define _CXXABI_H 1 + +#pragma GCC visibility push(default) + +#include +#include +#include + +#ifdef __cplusplus +#define _GLIBCXX_NOTHROW throw() +#else +#define _GLIBCXX_NOTHROW __attribute__((nothrow)) +#endif + +#ifdef __cplusplus +namespace __cxxabiv1 +{ + extern "C" + { +#endif + + typedef __cxa_cdtor_return_type (*__cxa_cdtor_type)(void *); + + // Allocate array. + void* + __cxa_vec_new(size_t __element_count, size_t __element_size, + size_t __padding_size, __cxa_cdtor_type constructor, + __cxa_cdtor_type destructor); + + void* + __cxa_vec_new2(size_t __element_count, size_t __element_size, + size_t __padding_size, __cxa_cdtor_type constructor, + __cxa_cdtor_type destructor, void *(*__alloc) (size_t), + void (*__dealloc) (void*)); + + void* + __cxa_vec_new3(size_t __element_count, size_t __element_size, + size_t __padding_size, __cxa_cdtor_type constructor, + __cxa_cdtor_type destructor, void *(*__alloc) (size_t), + void (*__dealloc) (void*, size_t)); + + // Construct array. + __cxa_vec_ctor_return_type + __cxa_vec_ctor(void* __array_address, size_t __element_count, + size_t __element_size, __cxa_cdtor_type constructor, + __cxa_cdtor_type destructor); + + __cxa_vec_ctor_return_type + __cxa_vec_cctor(void* dest_array, void* src_array, size_t element_count, + size_t element_size, + __cxa_cdtor_return_type (*constructor) (void*, void*), + __cxa_cdtor_type destructor); + + // Destruct array. + void + __cxa_vec_dtor(void* __array_address, size_t __element_count, + size_t __element_size, __cxa_cdtor_type destructor); + + void + __cxa_vec_cleanup(void* __array_address, size_t __element_count, + size_t __element_size, __cxa_cdtor_type destructor); + + // Destruct and release array. + void + __cxa_vec_delete(void* __array_address, size_t __element_size, + size_t __padding_size, __cxa_cdtor_type destructor); + + void + __cxa_vec_delete2(void* __array_address, size_t __element_size, + size_t __padding_size, __cxa_cdtor_type destructor, + void (*__dealloc) (void*)); + + void + __cxa_vec_delete3(void* __array_address, size_t __element_size, + size_t __padding_size, __cxa_cdtor_type destructor, + void (*__dealloc) (void*, size_t)); + + int + __cxa_guard_acquire(__guard*); + + void + __cxa_guard_release(__guard*); + + void + __cxa_guard_abort(__guard*); + + // Pure virtual functions. + void + __cxa_pure_virtual(void); + + // Exception handling. + void + __cxa_bad_cast(); + + void + __cxa_bad_typeid(); + + // DSO destruction. + int + __cxa_atexit(void (*)(void*), void*, void*) _GLIBCXX_NOTHROW; + + int + __cxa_finalize(void*); + + + /** + * @brief Demangling routine. + * ABI-mandated entry point in the C++ runtime library for demangling. + * + * @param __mangled_name A NUL-terminated character string + * containing the name to be demangled. + * + * @param __output_buffer A region of memory, allocated with + * malloc, of @a *__length bytes, into which the demangled name is + * stored. If @a __output_buffer is not long enough, it is + * expanded using realloc. @a __output_buffer may instead be NULL; + * in that case, the demangled name is placed in a region of memory + * allocated with malloc. + * + * @param __length If @a __length is non-NULL, the length of the + * buffer containing the demangled name is placed in @a *__length. + * + * @param __status @a *__status is set to one of the following values: + * 0: The demangling operation succeeded. + * -1: A memory allocation failiure occurred. + * -2: @a mangled_name is not a valid name under the C++ ABI mangling rules. + * -3: One of the arguments is invalid. + * + * @return A pointer to the start of the NUL-terminated demangled + * name, or NULL if the demangling fails. The caller is + * responsible for deallocating this memory using @c free. + * + * The demangling is performed using the C++ ABI mangling rules, + * with GNU extensions. For example, this function is used in + * __gnu_cxx::__verbose_terminate_handler. + * + * See http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt12ch39.html + * for other examples of use. + * + * @note The same demangling functionality is available via + * libiberty (@c and @c libiberty.a) in GCC + * 3.1 and later, but that requires explicit installation (@c + * --enable-install-libiberty) and uses a different API, although + * the ABI is unchanged. + */ + char* + __cxa_demangle(const char* __mangled_name, char* __output_buffer, + size_t* __length, int* __status); +#ifdef __cplusplus + } +} // namespace __cxxabiv1 +#endif + +#ifdef __cplusplus + +#include + +namespace __cxxabiv1 +{ + // Type information for int, float etc. + class __fundamental_type_info : public std::type_info + { + public: + explicit + __fundamental_type_info(const char* __n) : std::type_info(__n) { } + + virtual + ~__fundamental_type_info(); + }; + + // Type information for array objects. + class __array_type_info : public std::type_info + { + public: + explicit + __array_type_info(const char* __n) : std::type_info(__n) { } + + virtual + ~__array_type_info(); + }; + + // Type information for functions (both member and non-member). + class __function_type_info : public std::type_info + { + public: + explicit + __function_type_info(const char* __n) : std::type_info(__n) { } + + virtual + ~__function_type_info(); + + protected: + // Implementation defined member function. + virtual bool + __is_function_p() const; + }; + + // Type information for enumerations. + class __enum_type_info : public std::type_info + { + public: + explicit + __enum_type_info(const char* __n) : std::type_info(__n) { } + + virtual + ~__enum_type_info(); + }; + + // Common type information for simple pointers and pointers to member. + class __pbase_type_info : public std::type_info + { + public: + unsigned int __flags; // Qualification of the target object. + const std::type_info* __pointee; // Type of pointed to object. + + explicit + __pbase_type_info(const char* __n, int __quals, + const std::type_info* __type) + : std::type_info(__n), __flags(__quals), __pointee(__type) + { } + + virtual + ~__pbase_type_info(); + + // Implementation defined type. + enum __masks + { + __const_mask = 0x1, + __volatile_mask = 0x2, + __restrict_mask = 0x4, + __incomplete_mask = 0x8, + __incomplete_class_mask = 0x10 + }; + + protected: + __pbase_type_info(const __pbase_type_info&); + + __pbase_type_info& + operator=(const __pbase_type_info&); + + // Implementation defined member functions. + virtual bool + __do_catch(const std::type_info* __thr_type, void** __thr_obj, + unsigned int __outer) const; + + inline virtual bool + __pointer_catch(const __pbase_type_info* __thr_type, void** __thr_obj, + unsigned __outer) const; + }; + + // Type information for simple pointers. + class __pointer_type_info : public __pbase_type_info + { + public: + explicit + __pointer_type_info(const char* __n, int __quals, + const std::type_info* __type) + : __pbase_type_info (__n, __quals, __type) { } + + + virtual + ~__pointer_type_info(); + + protected: + // Implementation defined member functions. + virtual bool + __is_pointer_p() const; + + virtual bool + __pointer_catch(const __pbase_type_info* __thr_type, void** __thr_obj, + unsigned __outer) const; + }; + + class __class_type_info; + + // Type information for a pointer to member variable. + class __pointer_to_member_type_info : public __pbase_type_info + { + public: + __class_type_info* __context; // Class of the member. + + explicit + __pointer_to_member_type_info(const char* __n, int __quals, + const std::type_info* __type, + __class_type_info* __klass) + : __pbase_type_info(__n, __quals, __type), __context(__klass) { } + + virtual + ~__pointer_to_member_type_info(); + + protected: + __pointer_to_member_type_info(const __pointer_to_member_type_info&); + + __pointer_to_member_type_info& + operator=(const __pointer_to_member_type_info&); + + // Implementation defined member function. + virtual bool + __pointer_catch(const __pbase_type_info* __thr_type, void** __thr_obj, + unsigned __outer) const; + }; + + // Helper class for __vmi_class_type. + class __base_class_type_info + { + public: + const __class_type_info* __base_type; // Base class type. + long __offset_flags; // Offset and info. + + enum __offset_flags_masks + { + __virtual_mask = 0x1, + __public_mask = 0x2, + __hwm_bit = 2, + __offset_shift = 8 // Bits to shift offset. + }; + + // Implementation defined member functions. + bool + __is_virtual_p() const + { return __offset_flags & __virtual_mask; } + + bool + __is_public_p() const + { return __offset_flags & __public_mask; } + + ptrdiff_t + __offset() const + { + // This shift, being of a signed type, is implementation + // defined. GCC implements such shifts as arithmetic, which is + // what we want. + return static_cast(__offset_flags) >> __offset_shift; + } + }; + + // Type information for a class. + class __class_type_info : public std::type_info + { + public: + explicit + __class_type_info (const char *__n) : type_info(__n) { } + + virtual + ~__class_type_info (); + + // Implementation defined types. + // The type sub_kind tells us about how a base object is contained + // within a derived object. We often do this lazily, hence the + // UNKNOWN value. At other times we may use NOT_CONTAINED to mean + // not publicly contained. + enum __sub_kind + { + // We have no idea. + __unknown = 0, + + // Not contained within us (in some circumstances this might + // mean not contained publicly) + __not_contained, + + // Contained ambiguously. + __contained_ambig, + + // Via a virtual path. + __contained_virtual_mask = __base_class_type_info::__virtual_mask, + + // Via a public path. + __contained_public_mask = __base_class_type_info::__public_mask, + + // Contained within us. + __contained_mask = 1 << __base_class_type_info::__hwm_bit, + + __contained_private = __contained_mask, + __contained_public = __contained_mask | __contained_public_mask + }; + + struct __upcast_result; + struct __dyncast_result; + + protected: + // Implementation defined member functions. + virtual bool + __do_upcast(const __class_type_info* __dst_type, void**__obj_ptr) const; + + virtual bool + __do_catch(const type_info* __thr_type, void** __thr_obj, + unsigned __outer) const; + + public: + // Helper for upcast. See if DST is us, or one of our bases. + // Return false if not found, true if found. + virtual bool + __do_upcast(const __class_type_info* __dst, const void* __obj, + __upcast_result& __restrict __result) const; + + // Indicate whether SRC_PTR of type SRC_TYPE is contained publicly + // within OBJ_PTR. OBJ_PTR points to a base object of our type, + // which is the destination type. SRC2DST indicates how SRC + // objects might be contained within this type. If SRC_PTR is one + // of our SRC_TYPE bases, indicate the virtuality. Returns + // not_contained for non containment or private containment. + inline __sub_kind + __find_public_src(ptrdiff_t __src2dst, const void* __obj_ptr, + const __class_type_info* __src_type, + const void* __src_ptr) const; + + // Helper for dynamic cast. ACCESS_PATH gives the access from the + // most derived object to this base. DST_TYPE indicates the + // desired type we want. OBJ_PTR points to a base of our type + // within the complete object. SRC_TYPE indicates the static type + // started from and SRC_PTR points to that base within the most + // derived object. Fill in RESULT with what we find. Return true + // if we have located an ambiguous match. + virtual bool + __do_dyncast(ptrdiff_t __src2dst, __sub_kind __access_path, + const __class_type_info* __dst_type, const void* __obj_ptr, + const __class_type_info* __src_type, const void* __src_ptr, + __dyncast_result& __result) const; + + // Helper for find_public_subobj. SRC2DST indicates how SRC_TYPE + // bases are inherited by the type started from -- which is not + // necessarily the current type. The current type will be a base + // of the destination type. OBJ_PTR points to the current base. + virtual __sub_kind + __do_find_public_src(ptrdiff_t __src2dst, const void* __obj_ptr, + const __class_type_info* __src_type, + const void* __src_ptr) const; + }; + + // Type information for a class with a single non-virtual base. + class __si_class_type_info : public __class_type_info + { + public: + const __class_type_info* __base_type; + + explicit + __si_class_type_info(const char *__n, const __class_type_info *__base) + : __class_type_info(__n), __base_type(__base) { } + + virtual + ~__si_class_type_info(); + + protected: + __si_class_type_info(const __si_class_type_info&); + + __si_class_type_info& + operator=(const __si_class_type_info&); + + // Implementation defined member functions. + virtual bool + __do_dyncast(ptrdiff_t __src2dst, __sub_kind __access_path, + const __class_type_info* __dst_type, const void* __obj_ptr, + const __class_type_info* __src_type, const void* __src_ptr, + __dyncast_result& __result) const; + + virtual __sub_kind + __do_find_public_src(ptrdiff_t __src2dst, const void* __obj_ptr, + const __class_type_info* __src_type, + const void* __sub_ptr) const; + + virtual bool + __do_upcast(const __class_type_info*__dst, const void*__obj, + __upcast_result& __restrict __result) const; + }; + + // Type information for a class with multiple and/or virtual bases. + class __vmi_class_type_info : public __class_type_info + { + public: + unsigned int __flags; // Details about the class hierarchy. + unsigned int __base_count; // Number of direct bases. + + // The array of bases uses the trailing array struct hack so this + // class is not constructable with a normal constructor. It is + // internally generated by the compiler. + __base_class_type_info __base_info[1]; // Array of bases. + + explicit + __vmi_class_type_info(const char* __n, int ___flags) + : __class_type_info(__n), __flags(___flags), __base_count(0) { } + + virtual + ~__vmi_class_type_info(); + + // Implementation defined types. + enum __flags_masks + { + __non_diamond_repeat_mask = 0x1, // Distinct instance of repeated base. + __diamond_shaped_mask = 0x2, // Diamond shaped multiple inheritance. + __flags_unknown_mask = 0x10 + }; + + protected: + // Implementation defined member functions. + virtual bool + __do_dyncast(ptrdiff_t __src2dst, __sub_kind __access_path, + const __class_type_info* __dst_type, const void* __obj_ptr, + const __class_type_info* __src_type, const void* __src_ptr, + __dyncast_result& __result) const; + + virtual __sub_kind + __do_find_public_src(ptrdiff_t __src2dst, const void* __obj_ptr, + const __class_type_info* __src_type, + const void* __src_ptr) const; + + virtual bool + __do_upcast(const __class_type_info* __dst, const void* __obj, + __upcast_result& __restrict __result) const; + }; + + // Dynamic cast runtime. + // src2dst has the following possible values + // >-1: src_type is a unique public non-virtual base of dst_type + // dst_ptr + src2dst == src_ptr + // -1: unspecified relationship + // -2: src_type is not a public base of dst_type + // -3: src_type is a multiple public non-virtual base of dst_type + extern "C" void* + __dynamic_cast(const void* __src_ptr, // Starting object. + const __class_type_info* __src_type, // Static type of object. + const __class_type_info* __dst_type, // Desired target type. + ptrdiff_t __src2dst); // How src and dst are related. + + + // Returns the type_info for the currently handled exception [15.3/8], or + // null if there is none. + extern "C" std::type_info* + __cxa_current_exception_type(); + + // A magic placeholder class that can be caught by reference + // to recognize foreign exceptions. + class __foreign_exception + { + virtual ~__foreign_exception() throw(); + virtual void __pure_dummy() = 0; // prevent catch by value + }; + +} // namespace __cxxabiv1 + +/** @namespace abi + * @brief The cross-vendor C++ Application Binary Interface. A + * namespace alias to __cxxabiv1, but user programs should use the + * alias `abi'. + * + * A brief overview of an ABI is given in the libstdc++ FAQ, question + * 5.8 (you may have a copy of the FAQ locally, or you can view the online + * version at http://gcc.gnu.org/onlinedocs/libstdc++/faq/index.html#5_8). + * + * GCC subscribes to a cross-vendor ABI for C++, sometimes + * called the IA64 ABI because it happens to be the native ABI for that + * platform. It is summarized at http://www.codesourcery.com/cxx-abi/ + * along with the current specification. + * + * For users of GCC greater than or equal to 3.x, entry points are + * available in , which notes, "It is not normally + * necessary for user programs to include this header, or use the + * entry points directly. However, this header is available should + * that be needed." +*/ +namespace abi = __cxxabiv1; + +#endif // __cplusplus + +#pragma GCC visibility pop + +#endif // __CXXABI_H diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/bitset b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/bitset new file mode 100644 index 00000000..b4934423 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/bitset @@ -0,0 +1,369 @@ +// Debugging bitset implementation -*- C++ -*- + +// Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file debug/bitset + * This file is a GNU debug extension to the Standard C++ Library. + */ + +#ifndef _GLIBCXX_DEBUG_BITSET +#define _GLIBCXX_DEBUG_BITSET + +#include +#include +#include + +namespace std +{ +namespace __debug +{ + template + class bitset + : public _GLIBCXX_STD_D::bitset<_Nb>, + public __gnu_debug::_Safe_sequence_base + { + typedef _GLIBCXX_STD_D::bitset<_Nb> _Base; + typedef __gnu_debug::_Safe_sequence_base _Safe_base; + + public: + // bit reference: + class reference + : private _Base::reference, public __gnu_debug::_Safe_iterator_base + { + typedef typename _Base::reference _Base_ref; + + friend class bitset; + reference(); + + reference(const _Base_ref& __base, bitset* __seq) + : _Base_ref(__base), _Safe_iterator_base(__seq, false) + { } + + public: + reference(const reference& __x) + : _Base_ref(__x), _Safe_iterator_base(__x, false) + { } + + reference& + operator=(bool __x) + { + _GLIBCXX_DEBUG_VERIFY(! this->_M_singular(), + _M_message(__gnu_debug::__msg_bad_bitset_write) + ._M_iterator(*this)); + *static_cast<_Base_ref*>(this) = __x; + return *this; + } + + reference& + operator=(const reference& __x) + { + _GLIBCXX_DEBUG_VERIFY(! __x._M_singular(), + _M_message(__gnu_debug::__msg_bad_bitset_read) + ._M_iterator(__x)); + _GLIBCXX_DEBUG_VERIFY(! this->_M_singular(), + _M_message(__gnu_debug::__msg_bad_bitset_write) + ._M_iterator(*this)); + *static_cast<_Base_ref*>(this) = __x; + return *this; + } + + bool + operator~() const + { + _GLIBCXX_DEBUG_VERIFY(! this->_M_singular(), + _M_message(__gnu_debug::__msg_bad_bitset_read) + ._M_iterator(*this)); + return ~(*static_cast(this)); + } + + operator bool() const + { + _GLIBCXX_DEBUG_VERIFY(! this->_M_singular(), + _M_message(__gnu_debug::__msg_bad_bitset_read) + ._M_iterator(*this)); + return *static_cast(this); + } + + reference& + flip() + { + _GLIBCXX_DEBUG_VERIFY(! this->_M_singular(), + _M_message(__gnu_debug::__msg_bad_bitset_flip) + ._M_iterator(*this)); + _Base_ref::flip(); + return *this; + } + }; + + // 23.3.5.1 constructors: + bitset() : _Base() { } + + bitset(unsigned long __val) : _Base(__val) { } + + template + explicit + bitset(const std::basic_string<_CharT, _Traits, _Alloc>& __str, + typename std::basic_string<_CharT, _Traits, _Alloc>::size_type + __pos = 0, + typename std::basic_string<_CharT, _Traits, _Alloc>::size_type + __n = (std::basic_string<_CharT, _Traits, _Alloc>::npos)) + : _Base(__str, __pos, __n) { } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 396. what are characters zero and one. + template + bitset(const std::basic_string<_CharT, _Traits, _Alloc>& __str, + typename std::basic_string<_CharT, _Traits, _Alloc>::size_type + __pos, + typename std::basic_string<_CharT, _Traits, _Alloc>::size_type + __n, + _CharT __zero, _CharT __one = _CharT('1')) + : _Base(__str, __pos, __n, __zero, __one) { } + + bitset(const _Base& __x) : _Base(__x), _Safe_base() { } + + // 23.3.5.2 bitset operations: + bitset<_Nb>& + operator&=(const bitset<_Nb>& __rhs) + { + _M_base() &= __rhs; + return *this; + } + + bitset<_Nb>& + operator|=(const bitset<_Nb>& __rhs) + { + _M_base() |= __rhs; + return *this; + } + + bitset<_Nb>& + operator^=(const bitset<_Nb>& __rhs) + { + _M_base() ^= __rhs; + return *this; + } + + bitset<_Nb>& + operator<<=(size_t __pos) + { + _M_base() <<= __pos; + return *this; + } + + bitset<_Nb>& + operator>>=(size_t __pos) + { + _M_base() >>= __pos; + return *this; + } + + bitset<_Nb>& + set() + { + _Base::set(); + return *this; + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 186. bitset::set() second parameter should be bool + bitset<_Nb>& + set(size_t __pos, bool __val = true) + { + _Base::set(__pos, __val); + return *this; + } + + bitset<_Nb>& + reset() + { + _Base::reset(); + return *this; + } + + bitset<_Nb>& + reset(size_t __pos) + { + _Base::reset(__pos); + return *this; + } + + bitset<_Nb> operator~() const { return bitset(~_M_base()); } + + bitset<_Nb>& + flip() + { + _Base::flip(); + return *this; + } + + bitset<_Nb>& + flip(size_t __pos) + { + _Base::flip(__pos); + return *this; + } + + // element access: + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 11. Bitset minor problems + reference + operator[](size_t __pos) + { + __glibcxx_check_subscript(__pos); + return reference(_M_base()[__pos], this); + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 11. Bitset minor problems + bool + operator[](size_t __pos) const + { + __glibcxx_check_subscript(__pos); + return _M_base()[__pos]; + } + + using _Base::to_ulong; + + template + std::basic_string<_CharT, _Traits, _Alloc> + to_string() const + { return _M_base().template to_string<_CharT, _Traits, _Alloc>(); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 396. what are characters zero and one. + template + std::basic_string<_CharT, _Traits, _Alloc> + to_string(_CharT __zero, _CharT __one = _CharT('1')) const + { + return _M_base().template + to_string<_CharT, _Traits, _Alloc>(__zero, __one); + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 434. bitset::to_string() hard to use. + template + std::basic_string<_CharT, _Traits, std::allocator<_CharT> > + to_string() const + { return to_string<_CharT, _Traits, std::allocator<_CharT> >(); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 853. to_string needs updating with zero and one. + template + std::basic_string<_CharT, _Traits, std::allocator<_CharT> > + to_string(_CharT __zero, _CharT __one = _CharT('1')) const + { return to_string<_CharT, _Traits, + std::allocator<_CharT> >(__zero, __one); } + + template + std::basic_string<_CharT, std::char_traits<_CharT>, + std::allocator<_CharT> > + to_string() const + { + return to_string<_CharT, std::char_traits<_CharT>, + std::allocator<_CharT> >(); + } + + template + std::basic_string<_CharT, std::char_traits<_CharT>, + std::allocator<_CharT> > + to_string(_CharT __zero, _CharT __one = _CharT('1')) const + { + return to_string<_CharT, std::char_traits<_CharT>, + std::allocator<_CharT> >(__zero, __one); + } + + std::basic_string, std::allocator > + to_string() const + { + return to_string,std::allocator >(); + } + + std::basic_string, std::allocator > + to_string(char __zero, char __one = '1') const + { + return to_string, + std::allocator >(__zero, __one); + } + + using _Base::count; + using _Base::size; + + bool + operator==(const bitset<_Nb>& __rhs) const + { return _M_base() == __rhs; } + + bool + operator!=(const bitset<_Nb>& __rhs) const + { return _M_base() != __rhs; } + + using _Base::test; + using _Base::all; + using _Base::any; + using _Base::none; + + bitset<_Nb> + operator<<(size_t __pos) const + { return bitset<_Nb>(_M_base() << __pos); } + + bitset<_Nb> + operator>>(size_t __pos) const + { return bitset<_Nb>(_M_base() >> __pos); } + + _Base& + _M_base() { return *this; } + + const _Base& + _M_base() const { return *this; } + }; + + template + bitset<_Nb> + operator&(const bitset<_Nb>& __x, const bitset<_Nb>& __y) + { return bitset<_Nb>(__x) &= __y; } + + template + bitset<_Nb> + operator|(const bitset<_Nb>& __x, const bitset<_Nb>& __y) + { return bitset<_Nb>(__x) |= __y; } + + template + bitset<_Nb> + operator^(const bitset<_Nb>& __x, const bitset<_Nb>& __y) + { return bitset<_Nb>(__x) ^= __y; } + + template + std::basic_istream<_CharT, _Traits>& + operator>>(std::basic_istream<_CharT, _Traits>& __is, bitset<_Nb>& __x) + { return __is >> __x._M_base(); } + + template + std::basic_ostream<_CharT, _Traits>& + operator<<(std::basic_ostream<_CharT, _Traits>& __os, + const bitset<_Nb>& __x) + { return __os << __x._M_base(); } +} // namespace __debug +} // namespace std + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/debug.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/debug.h new file mode 100644 index 00000000..305299b2 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/debug.h @@ -0,0 +1,130 @@ +// Debugging support implementation -*- C++ -*- + +// Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file debug/debug.h + * This file is a GNU debug extension to the Standard C++ Library. + */ + +#ifndef _GLIBCXX_DEBUG_MACRO_SWITCH_H +#define _GLIBCXX_DEBUG_MACRO_SWITCH_H 1 + +/** Macros and namespaces used by the implementation outside of debug + * wrappers to verify certain properties. The __glibcxx_requires_xxx + * macros are merely wrappers around the __glibcxx_check_xxx wrappers + * when we are compiling with debug mode, but disappear when we are + * in release mode so that there is no checking performed in, e.g., + * the standard library algorithms. +*/ + +// Debug mode namespaces. + +/** + * @namespace std::__debug + * @brief GNU debug code, replaces standard behavior with debug behavior. + */ +namespace std +{ + namespace __debug { } +} + +/** @namespace __gnu_debug + * @brief GNU debug classes for public use. +*/ +namespace __gnu_debug +{ + using namespace std::__debug; +} + +#ifndef _GLIBCXX_DEBUG + +# define _GLIBCXX_DEBUG_ASSERT(_Condition) +# define _GLIBCXX_DEBUG_PEDASSERT(_Condition) +# define _GLIBCXX_DEBUG_ONLY(_Statement) ; +# define __glibcxx_requires_cond(_Cond,_Msg) +# define __glibcxx_requires_valid_range(_First,_Last) +# define __glibcxx_requires_sorted(_First,_Last) +# define __glibcxx_requires_sorted_pred(_First,_Last,_Pred) +# define __glibcxx_requires_sorted_set(_First1,_Last1,_First2) +# define __glibcxx_requires_sorted_set_pred(_First1,_Last1,_First2,_Pred) +# define __glibcxx_requires_partitioned_lower(_First,_Last,_Value) +# define __glibcxx_requires_partitioned_upper(_First,_Last,_Value) +# define __glibcxx_requires_partitioned_lower_pred(_First,_Last,_Value,_Pred) +# define __glibcxx_requires_partitioned_upper_pred(_First,_Last,_Value,_Pred) +# define __glibcxx_requires_heap(_First,_Last) +# define __glibcxx_requires_heap_pred(_First,_Last,_Pred) +# define __glibcxx_requires_nonempty() +# define __glibcxx_requires_string(_String) +# define __glibcxx_requires_string_len(_String,_Len) +# define __glibcxx_requires_subscript(_N) + +#else + +# include + +#define _GLIBCXX_DEBUG_ASSERT(_Condition) __glibcxx_assert(_Condition) + +#ifdef _GLIBCXX_DEBUG_PEDANTIC +# define _GLIBCXX_DEBUG_PEDASSERT(_Condition) _GLIBCXX_DEBUG_ASSERT(_Condition) +#else +# define _GLIBCXX_DEBUG_PEDASSERT(_Condition) +#endif + +# define _GLIBCXX_DEBUG_ONLY(_Statement) _Statement + +# define __glibcxx_requires_cond(_Cond,_Msg) _GLIBCXX_DEBUG_VERIFY(_Cond,_Msg) +# define __glibcxx_requires_valid_range(_First,_Last) \ + __glibcxx_check_valid_range(_First,_Last) +# define __glibcxx_requires_sorted(_First,_Last) \ + __glibcxx_check_sorted(_First,_Last) +# define __glibcxx_requires_sorted_pred(_First,_Last,_Pred) \ + __glibcxx_check_sorted_pred(_First,_Last,_Pred) +# define __glibcxx_requires_sorted_set(_First1,_Last1,_First2) \ + __glibcxx_check_sorted_set(_First1,_Last1,_First2) +# define __glibcxx_requires_sorted_set_pred(_First1,_Last1,_First2,_Pred) \ + __glibcxx_check_sorted_set_pred(_First1,_Last1,_First2,_Pred) +# define __glibcxx_requires_partitioned_lower(_First,_Last,_Value) \ + __glibcxx_check_partitioned_lower(_First,_Last,_Value) +# define __glibcxx_requires_partitioned_upper(_First,_Last,_Value) \ + __glibcxx_check_partitioned_upper(_First,_Last,_Value) +# define __glibcxx_requires_partitioned_lower_pred(_First,_Last,_Value,_Pred) \ + __glibcxx_check_partitioned_lower_pred(_First,_Last,_Value,_Pred) +# define __glibcxx_requires_partitioned_upper_pred(_First,_Last,_Value,_Pred) \ + __glibcxx_check_partitioned_upper_pred(_First,_Last,_Value,_Pred) +# define __glibcxx_requires_heap(_First,_Last) \ + __glibcxx_check_heap(_First,_Last) +# define __glibcxx_requires_heap_pred(_First,_Last,_Pred) \ + __glibcxx_check_heap_pred(_First,_Last,_Pred) +# define __glibcxx_requires_nonempty() __glibcxx_check_nonempty() +# define __glibcxx_requires_string(_String) __glibcxx_check_string(_String) +# define __glibcxx_requires_string_len(_String,_Len) \ + __glibcxx_check_string_len(_String,_Len) +# define __glibcxx_requires_subscript(_N) __glibcxx_check_subscript(_N) + +# include +# include + +#endif + +#endif // _GLIBCXX_DEBUG_MACRO_SWITCH_H diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/deque b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/deque new file mode 100644 index 00000000..b481fd14 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/deque @@ -0,0 +1,515 @@ +// Debugging deque implementation -*- C++ -*- + +// Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file debug/deque + * This file is a GNU debug extension to the Standard C++ Library. + */ + +#ifndef _GLIBCXX_DEBUG_DEQUE +#define _GLIBCXX_DEBUG_DEQUE 1 + +#include +#include +#include + +namespace std +{ +namespace __debug +{ + template > + class deque + : public _GLIBCXX_STD_D::deque<_Tp, _Allocator>, + public __gnu_debug::_Safe_sequence > + { + typedef _GLIBCXX_STD_D::deque<_Tp, _Allocator> _Base; + typedef __gnu_debug::_Safe_sequence _Safe_base; + + public: + typedef typename _Base::reference reference; + typedef typename _Base::const_reference const_reference; + + typedef __gnu_debug::_Safe_iterator + iterator; + typedef __gnu_debug::_Safe_iterator + const_iterator; + + typedef typename _Base::size_type size_type; + typedef typename _Base::difference_type difference_type; + + typedef _Tp value_type; + typedef _Allocator allocator_type; + typedef typename _Base::pointer pointer; + typedef typename _Base::const_pointer const_pointer; + typedef std::reverse_iterator reverse_iterator; + typedef std::reverse_iterator const_reverse_iterator; + + // 23.2.1.1 construct/copy/destroy: + explicit deque(const _Allocator& __a = _Allocator()) + : _Base(__a) { } + + explicit deque(size_type __n, const _Tp& __value = _Tp(), + const _Allocator& __a = _Allocator()) + : _Base(__n, __value, __a) { } + + template + deque(_InputIterator __first, _InputIterator __last, + const _Allocator& __a = _Allocator()) + : _Base(__gnu_debug::__check_valid_range(__first, __last), __last, __a) + { } + + deque(const deque& __x) + : _Base(__x), _Safe_base() { } + + deque(const _Base& __x) + : _Base(__x), _Safe_base() { } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + deque(deque&& __x) + : _Base(std::forward(__x)), _Safe_base() + { this->_M_swap(__x); } + + deque(initializer_list __l, + const allocator_type& __a = allocator_type()) + : _Base(__l, __a), _Safe_base() { } +#endif + + ~deque() { } + + deque& + operator=(const deque& __x) + { + *static_cast<_Base*>(this) = __x; + this->_M_invalidate_all(); + return *this; + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + deque& + operator=(deque&& __x) + { + // NB: DR 675. + clear(); + swap(__x); + return *this; + } + + deque& + operator=(initializer_list __l) + { + *static_cast<_Base*>(this) = __l; + this->_M_invalidate_all(); + return *this; + } +#endif + + template + void + assign(_InputIterator __first, _InputIterator __last) + { + __glibcxx_check_valid_range(__first, __last); + _Base::assign(__first, __last); + this->_M_invalidate_all(); + } + + void + assign(size_type __n, const _Tp& __t) + { + _Base::assign(__n, __t); + this->_M_invalidate_all(); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + void + assign(initializer_list __l) + { + _Base::assign(__l); + this->_M_invalidate_all(); + } +#endif + + using _Base::get_allocator; + + // iterators: + iterator + begin() + { return iterator(_Base::begin(), this); } + + const_iterator + begin() const + { return const_iterator(_Base::begin(), this); } + + iterator + end() + { return iterator(_Base::end(), this); } + + const_iterator + end() const + { return const_iterator(_Base::end(), this); } + + reverse_iterator + rbegin() + { return reverse_iterator(end()); } + + const_reverse_iterator + rbegin() const + { return const_reverse_iterator(end()); } + + reverse_iterator + rend() + { return reverse_iterator(begin()); } + + const_reverse_iterator + rend() const + { return const_reverse_iterator(begin()); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + const_iterator + cbegin() const + { return const_iterator(_Base::begin(), this); } + + const_iterator + cend() const + { return const_iterator(_Base::end(), this); } + + const_reverse_iterator + crbegin() const + { return const_reverse_iterator(end()); } + + const_reverse_iterator + crend() const + { return const_reverse_iterator(begin()); } +#endif + + // 23.2.1.2 capacity: + using _Base::size; + using _Base::max_size; + + void + resize(size_type __sz, _Tp __c = _Tp()) + { + typedef typename _Base::const_iterator _Base_const_iterator; + typedef __gnu_debug::_After_nth_from<_Base_const_iterator> _After_nth; + + bool __invalidate_all = __sz > this->size(); + if (__sz < this->size()) + this->_M_invalidate_if(_After_nth(__sz, _M_base().begin())); + + _Base::resize(__sz, __c); + + if (__invalidate_all) + this->_M_invalidate_all(); + } + + using _Base::empty; + + // element access: + reference + operator[](size_type __n) + { + __glibcxx_check_subscript(__n); + return _M_base()[__n]; + } + + const_reference + operator[](size_type __n) const + { + __glibcxx_check_subscript(__n); + return _M_base()[__n]; + } + + using _Base::at; + + reference + front() + { + __glibcxx_check_nonempty(); + return _Base::front(); + } + + const_reference + front() const + { + __glibcxx_check_nonempty(); + return _Base::front(); + } + + reference + back() + { + __glibcxx_check_nonempty(); + return _Base::back(); + } + + const_reference + back() const + { + __glibcxx_check_nonempty(); + return _Base::back(); + } + + // 23.2.1.3 modifiers: + void + push_front(const _Tp& __x) + { + _Base::push_front(__x); + this->_M_invalidate_all(); + } + + void + push_back(const _Tp& __x) + { + _Base::push_back(__x); + this->_M_invalidate_all(); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + void + push_front(_Tp&& __x) + { emplace_front(std::move(__x)); } + + void + push_back(_Tp&& __x) + { emplace_back(std::move(__x)); } + + template + void + emplace_front(_Args&&... __args) + { + _Base::emplace_front(std::forward<_Args>(__args)...); + this->_M_invalidate_all(); + } + + template + void + emplace_back(_Args&&... __args) + { + _Base::emplace_back(std::forward<_Args>(__args)...); + this->_M_invalidate_all(); + } + + template + iterator + emplace(iterator __position, _Args&&... __args) + { + __glibcxx_check_insert(__position); + typename _Base::iterator __res = _Base::emplace(__position.base(), + std::forward<_Args>(__args)...); + this->_M_invalidate_all(); + return iterator(__res, this); + } +#endif + + iterator + insert(iterator __position, const _Tp& __x) + { + __glibcxx_check_insert(__position); + typename _Base::iterator __res = _Base::insert(__position.base(), __x); + this->_M_invalidate_all(); + return iterator(__res, this); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + iterator + insert(iterator __position, _Tp&& __x) + { return emplace(__position, std::move(__x)); } + + void + insert(iterator __p, initializer_list __l) + { + _Base::insert(__p, __l); + this->_M_invalidate_all(); + } +#endif + + void + insert(iterator __position, size_type __n, const _Tp& __x) + { + __glibcxx_check_insert(__position); + _Base::insert(__position.base(), __n, __x); + this->_M_invalidate_all(); + } + + template + void + insert(iterator __position, + _InputIterator __first, _InputIterator __last) + { + __glibcxx_check_insert_range(__position, __first, __last); + _Base::insert(__position.base(), __first, __last); + this->_M_invalidate_all(); + } + + void + pop_front() + { + __glibcxx_check_nonempty(); + iterator __victim = begin(); + __victim._M_invalidate(); + _Base::pop_front(); + } + + void + pop_back() + { + __glibcxx_check_nonempty(); + iterator __victim = end(); + --__victim; + __victim._M_invalidate(); + _Base::pop_back(); + } + + iterator + erase(iterator __position) + { + __glibcxx_check_erase(__position); + if (__position == begin() || __position == end()-1) + { + __position._M_invalidate(); + return iterator(_Base::erase(__position.base()), this); + } + else + { + typename _Base::iterator __res = _Base::erase(__position.base()); + this->_M_invalidate_all(); + return iterator(__res, this); + } + } + + iterator + erase(iterator __first, iterator __last) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 151. can't currently clear() empty container + __glibcxx_check_erase_range(__first, __last); + if (__first == begin() || __last == end()) + { + this->_M_detach_singular(); + for (iterator __position = __first; __position != __last; ) + { + iterator __victim = __position++; + __victim._M_invalidate(); + } + __try + { + return iterator(_Base::erase(__first.base(), __last.base()), + this); + } + __catch(...) + { + this->_M_revalidate_singular(); + __throw_exception_again; + } + } + else + { + typename _Base::iterator __res = _Base::erase(__first.base(), + __last.base()); + this->_M_invalidate_all(); + return iterator(__res, this); + } + } + + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + swap(deque&& __x) +#else + swap(deque& __x) +#endif + { + _Base::swap(__x); + this->_M_swap(__x); + } + + void + clear() + { + _Base::clear(); + this->_M_invalidate_all(); + } + + _Base& + _M_base() { return *this; } + + const _Base& + _M_base() const { return *this; } + }; + + template + inline bool + operator==(const deque<_Tp, _Alloc>& __lhs, + const deque<_Tp, _Alloc>& __rhs) + { return __lhs._M_base() == __rhs._M_base(); } + + template + inline bool + operator!=(const deque<_Tp, _Alloc>& __lhs, + const deque<_Tp, _Alloc>& __rhs) + { return __lhs._M_base() != __rhs._M_base(); } + + template + inline bool + operator<(const deque<_Tp, _Alloc>& __lhs, + const deque<_Tp, _Alloc>& __rhs) + { return __lhs._M_base() < __rhs._M_base(); } + + template + inline bool + operator<=(const deque<_Tp, _Alloc>& __lhs, + const deque<_Tp, _Alloc>& __rhs) + { return __lhs._M_base() <= __rhs._M_base(); } + + template + inline bool + operator>=(const deque<_Tp, _Alloc>& __lhs, + const deque<_Tp, _Alloc>& __rhs) + { return __lhs._M_base() >= __rhs._M_base(); } + + template + inline bool + operator>(const deque<_Tp, _Alloc>& __lhs, + const deque<_Tp, _Alloc>& __rhs) + { return __lhs._M_base() > __rhs._M_base(); } + + template + inline void + swap(deque<_Tp, _Alloc>& __lhs, deque<_Tp, _Alloc>& __rhs) + { __lhs.swap(__rhs); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + inline void + swap(deque<_Tp, _Alloc>&& __lhs, deque<_Tp, _Alloc>& __rhs) + { __lhs.swap(__rhs); } + + template + inline void + swap(deque<_Tp, _Alloc>& __lhs, deque<_Tp, _Alloc>&& __rhs) + { __lhs.swap(__rhs); } +#endif + +} // namespace __debug +} // namespace std + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/formatter.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/formatter.h new file mode 100644 index 00000000..0538edb1 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/formatter.h @@ -0,0 +1,392 @@ +// Debug-mode error formatting implementation -*- C++ -*- + +// Copyright (C) 2003, 2004, 2005, 2006, 2007, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file debug/formatter.h + * This file is a GNU debug extension to the Standard C++ Library. + */ + +#ifndef _GLIBCXX_DEBUG_FORMATTER_H +#define _GLIBCXX_DEBUG_FORMATTER_H 1 + +#include +#include + +namespace __gnu_debug +{ + using std::type_info; + + /** Determine if the two types are the same. */ + template + struct __is_same + { + static const bool value = false; + }; + + template + struct __is_same<_Type, _Type> + { + static const bool value = true; + }; + + template struct __truth { }; + + class _Safe_sequence_base; + + template + class _Safe_iterator; + + template + class _Safe_sequence; + + enum _Debug_msg_id + { + // General checks + __msg_valid_range, + __msg_insert_singular, + __msg_insert_different, + __msg_erase_bad, + __msg_erase_different, + __msg_subscript_oob, + __msg_empty, + __msg_unpartitioned, + __msg_unpartitioned_pred, + __msg_unsorted, + __msg_unsorted_pred, + __msg_not_heap, + __msg_not_heap_pred, + // std::bitset checks + __msg_bad_bitset_write, + __msg_bad_bitset_read, + __msg_bad_bitset_flip, + // std::list checks + __msg_self_splice, + __msg_splice_alloc, + __msg_splice_bad, + __msg_splice_other, + __msg_splice_overlap, + // iterator checks + __msg_init_singular, + __msg_init_copy_singular, + __msg_init_const_singular, + __msg_copy_singular, + __msg_bad_deref, + __msg_bad_inc, + __msg_bad_dec, + __msg_iter_subscript_oob, + __msg_advance_oob, + __msg_retreat_oob, + __msg_iter_compare_bad, + __msg_compare_different, + __msg_iter_order_bad, + __msg_order_different, + __msg_distance_bad, + __msg_distance_different, + // istream_iterator + __msg_deref_istream, + __msg_inc_istream, + // ostream_iterator + __msg_output_ostream, + // istreambuf_iterator + __msg_deref_istreambuf, + __msg_inc_istreambuf + }; + + class _Error_formatter + { + /// Whether an iterator is constant, mutable, or unknown + enum _Constness + { + __unknown_constness, + __const_iterator, + __mutable_iterator, + __last_constness + }; + + // The state of the iterator (fine-grained), if we know it. + enum _Iterator_state + { + __unknown_state, + __singular, // singular, may still be attached to a sequence + __begin, // dereferenceable, and at the beginning + __middle, // dereferenceable, not at the beginning + __end, // past-the-end, may be at beginning if sequence empty + __last_state + }; + + // Tags denoting the type of parameter for construction + struct _Is_iterator { }; + struct _Is_sequence { }; + + // A parameter that may be referenced by an error message + struct _Parameter + { + enum + { + __unused_param, + __iterator, + __sequence, + __integer, + __string + } _M_kind; + + union + { + // When _M_kind == __iterator + struct + { + const char* _M_name; + const void* _M_address; + const type_info* _M_type; + _Constness _M_constness; + _Iterator_state _M_state; + const void* _M_sequence; + const type_info* _M_seq_type; + } _M_iterator; + + // When _M_kind == __sequence + struct + { + const char* _M_name; + const void* _M_address; + const type_info* _M_type; + } _M_sequence; + + // When _M_kind == __integer + struct + { + const char* _M_name; + long _M_value; + } _M_integer; + + // When _M_kind == __string + struct + { + const char* _M_name; + const char* _M_value; + } _M_string; + } _M_variant; + + _Parameter() : _M_kind(__unused_param), _M_variant() { } + + _Parameter(long __value, const char* __name) + : _M_kind(__integer), _M_variant() + { + _M_variant._M_integer._M_name = __name; + _M_variant._M_integer._M_value = __value; + } + + _Parameter(const char* __value, const char* __name) + : _M_kind(__string), _M_variant() + { + _M_variant._M_string._M_name = __name; + _M_variant._M_string._M_value = __value; + } + + template + _Parameter(const _Safe_iterator<_Iterator, _Sequence>& __it, + const char* __name, _Is_iterator) + : _M_kind(__iterator), _M_variant() + { + _M_variant._M_iterator._M_name = __name; + _M_variant._M_iterator._M_address = &__it; + _M_variant._M_iterator._M_type = &typeid(__it); + _M_variant._M_iterator._M_constness = + __is_same<_Safe_iterator<_Iterator, _Sequence>, + typename _Sequence::iterator>:: + value? __mutable_iterator : __const_iterator; + _M_variant._M_iterator._M_sequence = __it._M_get_sequence(); + _M_variant._M_iterator._M_seq_type = &typeid(_Sequence); + + if (__it._M_singular()) + _M_variant._M_iterator._M_state = __singular; + else + { + bool __is_begin = __it._M_is_begin(); + bool __is_end = __it._M_is_end(); + if (__is_end) + _M_variant._M_iterator._M_state = __end; + else if (__is_begin) + _M_variant._M_iterator._M_state = __begin; + else + _M_variant._M_iterator._M_state = __middle; + } + } + + template + _Parameter(const _Type*& __it, const char* __name, _Is_iterator) + : _M_kind(__iterator), _M_variant() + { + _M_variant._M_iterator._M_name = __name; + _M_variant._M_iterator._M_address = &__it; + _M_variant._M_iterator._M_type = &typeid(__it); + _M_variant._M_iterator._M_constness = __mutable_iterator; + _M_variant._M_iterator._M_state = __it? __unknown_state : __singular; + _M_variant._M_iterator._M_sequence = 0; + _M_variant._M_iterator._M_seq_type = 0; + } + + template + _Parameter(_Type*& __it, const char* __name, _Is_iterator) + : _M_kind(__iterator), _M_variant() + { + _M_variant._M_iterator._M_name = __name; + _M_variant._M_iterator._M_address = &__it; + _M_variant._M_iterator._M_type = &typeid(__it); + _M_variant._M_iterator._M_constness = __const_iterator; + _M_variant._M_iterator._M_state = __it? __unknown_state : __singular; + _M_variant._M_iterator._M_sequence = 0; + _M_variant._M_iterator._M_seq_type = 0; + } + + template + _Parameter(const _Iterator& __it, const char* __name, _Is_iterator) + : _M_kind(__iterator), _M_variant() + { + _M_variant._M_iterator._M_name = __name; + _M_variant._M_iterator._M_address = &__it; + _M_variant._M_iterator._M_type = &typeid(__it); + _M_variant._M_iterator._M_constness = __unknown_constness; + _M_variant._M_iterator._M_state = + __gnu_debug::__check_singular(__it)? __singular : __unknown_state; + _M_variant._M_iterator._M_sequence = 0; + _M_variant._M_iterator._M_seq_type = 0; + } + + template + _Parameter(const _Safe_sequence<_Sequence>& __seq, + const char* __name, _Is_sequence) + : _M_kind(__sequence), _M_variant() + { + _M_variant._M_sequence._M_name = __name; + _M_variant._M_sequence._M_address = + static_cast(&__seq); + _M_variant._M_sequence._M_type = &typeid(_Sequence); + } + + template + _Parameter(const _Sequence& __seq, const char* __name, _Is_sequence) + : _M_kind(__sequence), _M_variant() + { + _M_variant._M_sequence._M_name = __name; + _M_variant._M_sequence._M_address = &__seq; + _M_variant._M_sequence._M_type = &typeid(_Sequence); + } + + void + _M_print_field(const _Error_formatter* __formatter, + const char* __name) const; + + void + _M_print_description(const _Error_formatter* __formatter) const; + }; + + friend struct _Parameter; + + public: + template + const _Error_formatter& + _M_iterator(const _Iterator& __it, const char* __name = 0) const + { + if (_M_num_parameters < size_t(__max_parameters)) + _M_parameters[_M_num_parameters++] = _Parameter(__it, __name, + _Is_iterator()); + return *this; + } + + const _Error_formatter& + _M_integer(long __value, const char* __name = 0) const + { + if (_M_num_parameters < size_t(__max_parameters)) + _M_parameters[_M_num_parameters++] = _Parameter(__value, __name); + return *this; + } + + const _Error_formatter& + _M_string(const char* __value, const char* __name = 0) const + { + if (_M_num_parameters < size_t(__max_parameters)) + _M_parameters[_M_num_parameters++] = _Parameter(__value, __name); + return *this; + } + + template + const _Error_formatter& + _M_sequence(const _Sequence& __seq, const char* __name = 0) const + { + if (_M_num_parameters < size_t(__max_parameters)) + _M_parameters[_M_num_parameters++] = _Parameter(__seq, __name, + _Is_sequence()); + return *this; + } + + const _Error_formatter& + _M_message(const char* __text) const + { _M_text = __text; return *this; } + + const _Error_formatter& + _M_message(_Debug_msg_id __id) const; + + void + _M_error() const; + + private: + _Error_formatter(const char* __file, size_t __line) + : _M_file(__file), _M_line(__line), _M_num_parameters(0), _M_text(0), + _M_max_length(78), _M_column(1), _M_first_line(true), _M_wordwrap(false) + { _M_get_max_length(); } + + template + void + _M_format_word(char*, int, const char*, _Tp) const; + + void + _M_print_word(const char* __word) const; + + void + _M_print_string(const char* __string) const; + + void + _M_get_max_length() const; + + enum { __max_parameters = 9 }; + + const char* _M_file; + size_t _M_line; + mutable _Parameter _M_parameters[__max_parameters]; + mutable size_t _M_num_parameters; + mutable const char* _M_text; + mutable size_t _M_max_length; + enum { _M_indent = 4 } ; + mutable size_t _M_column; + mutable bool _M_first_line; + mutable bool _M_wordwrap; + + public: + static _Error_formatter + _M_at(const char* __file, size_t __line) + { return _Error_formatter(__file, __line); } + }; +} // namespace __gnu_debug + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/functions.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/functions.h new file mode 100644 index 00000000..a4b1d785 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/functions.h @@ -0,0 +1,383 @@ +// Debugging support implementation -*- C++ -*- + +// Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file debug/functions.h + * This file is a GNU debug extension to the Standard C++ Library. + */ + +#ifndef _GLIBCXX_DEBUG_FUNCTIONS_H +#define _GLIBCXX_DEBUG_FUNCTIONS_H 1 + +#include +#include // for ptrdiff_t +#include // for iterator_traits, categories +#include // for __is_integer + +namespace __gnu_debug +{ + template + class _Safe_iterator; + + // An arbitrary iterator pointer is not singular. + inline bool + __check_singular_aux(const void*) { return false; } + + // We may have an iterator that derives from _Safe_iterator_base but isn't + // a _Safe_iterator. + template + inline bool + __check_singular(_Iterator& __x) + { return __check_singular_aux(&__x); } + + /** Non-NULL pointers are nonsingular. */ + template + inline bool + __check_singular(const _Tp* __ptr) + { return __ptr == 0; } + + /** Safe iterators know if they are singular. */ + template + inline bool + __check_singular(const _Safe_iterator<_Iterator, _Sequence>& __x) + { return __x._M_singular(); } + + /** Assume that some arbitrary iterator is dereferenceable, because we + can't prove that it isn't. */ + template + inline bool + __check_dereferenceable(_Iterator&) + { return true; } + + /** Non-NULL pointers are dereferenceable. */ + template + inline bool + __check_dereferenceable(const _Tp* __ptr) + { return __ptr; } + + /** Safe iterators know if they are singular. */ + template + inline bool + __check_dereferenceable(const _Safe_iterator<_Iterator, _Sequence>& __x) + { return __x._M_dereferenceable(); } + + /** If the distance between two random access iterators is + * nonnegative, assume the range is valid. + */ + template + inline bool + __valid_range_aux2(const _RandomAccessIterator& __first, + const _RandomAccessIterator& __last, + std::random_access_iterator_tag) + { return __last - __first >= 0; } + + /** Can't test for a valid range with input iterators, because + * iteration may be destructive. So we just assume that the range + * is valid. + */ + template + inline bool + __valid_range_aux2(const _InputIterator&, const _InputIterator&, + std::input_iterator_tag) + { return true; } + + /** We say that integral types for a valid range, and defer to other + * routines to realize what to do with integral types instead of + * iterators. + */ + template + inline bool + __valid_range_aux(const _Integral&, const _Integral&, std::__true_type) + { return true; } + + /** We have iterators, so figure out what kind of iterators that are + * to see if we can check the range ahead of time. + */ + template + inline bool + __valid_range_aux(const _InputIterator& __first, + const _InputIterator& __last, std::__false_type) + { + typedef typename std::iterator_traits<_InputIterator>::iterator_category + _Category; + return __valid_range_aux2(__first, __last, _Category()); + } + + /** Don't know what these iterators are, or if they are even + * iterators (we may get an integral type for InputIterator), so + * see if they are integral and pass them on to the next phase + * otherwise. + */ + template + inline bool + __valid_range(const _InputIterator& __first, const _InputIterator& __last) + { + typedef typename std::__is_integer<_InputIterator>::__type _Integral; + return __valid_range_aux(__first, __last, _Integral()); + } + + /** Safe iterators know how to check if they form a valid range. */ + template + inline bool + __valid_range(const _Safe_iterator<_Iterator, _Sequence>& __first, + const _Safe_iterator<_Iterator, _Sequence>& __last) + { return __first._M_valid_range(__last); } + + /* Checks that [first, last) is a valid range, and then returns + * __first. This routine is useful when we can't use a separate + * assertion statement because, e.g., we are in a constructor. + */ + template + inline _InputIterator + __check_valid_range(const _InputIterator& __first, + const _InputIterator& __last + __attribute__((__unused__))) + { + _GLIBCXX_DEBUG_ASSERT(__valid_range(__first, __last)); + return __first; + } + + /** Checks that __s is non-NULL or __n == 0, and then returns __s. */ + template + inline const _CharT* + __check_string(const _CharT* __s, + const _Integer& __n __attribute__((__unused__))) + { +#ifdef _GLIBCXX_DEBUG_PEDANTIC + _GLIBCXX_DEBUG_ASSERT(__s != 0 || __n == 0); +#endif + return __s; + } + + /** Checks that __s is non-NULL and then returns __s. */ + template + inline const _CharT* + __check_string(const _CharT* __s) + { +#ifdef _GLIBCXX_DEBUG_PEDANTIC + _GLIBCXX_DEBUG_ASSERT(__s != 0); +#endif + return __s; + } + + // Can't check if an input iterator sequence is sorted, because we + // can't step through the sequence. + template + inline bool + __check_sorted_aux(const _InputIterator&, const _InputIterator&, + std::input_iterator_tag) + { return true; } + + // Can verify if a forward iterator sequence is in fact sorted using + // std::__is_sorted + template + inline bool + __check_sorted_aux(_ForwardIterator __first, _ForwardIterator __last, + std::forward_iterator_tag) + { + if (__first == __last) + return true; + + _ForwardIterator __next = __first; + for (++__next; __next != __last; __first = __next, ++__next) + if (*__next < *__first) + return false; + + return true; + } + + // Can't check if an input iterator sequence is sorted, because we can't step + // through the sequence. + template + inline bool + __check_sorted_aux(const _InputIterator&, const _InputIterator&, + _Predicate, std::input_iterator_tag) + { return true; } + + // Can verify if a forward iterator sequence is in fact sorted using + // std::__is_sorted + template + inline bool + __check_sorted_aux(_ForwardIterator __first, _ForwardIterator __last, + _Predicate __pred, std::forward_iterator_tag) + { + if (__first == __last) + return true; + + _ForwardIterator __next = __first; + for (++__next; __next != __last; __first = __next, ++__next) + if (__pred(*__next, *__first)) + return false; + + return true; + } + + // Determine if a sequence is sorted. + template + inline bool + __check_sorted(const _InputIterator& __first, const _InputIterator& __last) + { + typedef typename std::iterator_traits<_InputIterator>::iterator_category + _Category; + + // Verify that the < operator for elements in the sequence is a + // StrictWeakOrdering by checking that it is irreflexive. + _GLIBCXX_DEBUG_ASSERT(__first == __last || !(*__first < *__first)); + + return __check_sorted_aux(__first, __last, _Category()); + } + + template + inline bool + __check_sorted(const _InputIterator& __first, const _InputIterator& __last, + _Predicate __pred) + { + typedef typename std::iterator_traits<_InputIterator>::iterator_category + _Category; + + // Verify that the predicate is StrictWeakOrdering by checking that it + // is irreflexive. + _GLIBCXX_DEBUG_ASSERT(__first == __last || !__pred(*__first, *__first)); + + return __check_sorted_aux(__first, __last, __pred, _Category()); + } + + template + inline bool + __check_sorted_set_aux(const _InputIterator& __first, + const _InputIterator& __last, + std::__true_type) + { return __check_sorted(__first, __last); } + + template + inline bool + __check_sorted_set_aux(const _InputIterator&, + const _InputIterator&, + std::__false_type) + { return true; } + + template + inline bool + __check_sorted_set_aux(const _InputIterator& __first, + const _InputIterator& __last, + _Predicate __pred, std::__true_type) + { return __check_sorted(__first, __last, __pred); } + + template + inline bool + __check_sorted_set_aux(const _InputIterator&, + const _InputIterator&, _Predicate, + std::__false_type) + { return true; } + + // ... special variant used in std::merge, std::includes, std::set_*. + template + inline bool + __check_sorted_set(const _InputIterator1& __first, + const _InputIterator1& __last, + const _InputIterator2&) + { + typedef typename std::iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename std::iterator_traits<_InputIterator2>::value_type + _ValueType2; + + typedef typename std::__are_same<_ValueType1, _ValueType2>::__type + _SameType; + return __check_sorted_set_aux(__first, __last, _SameType()); + } + + template + inline bool + __check_sorted_set(const _InputIterator1& __first, + const _InputIterator1& __last, + const _InputIterator2&, _Predicate __pred) + { + typedef typename std::iterator_traits<_InputIterator1>::value_type + _ValueType1; + typedef typename std::iterator_traits<_InputIterator2>::value_type + _ValueType2; + + typedef typename std::__are_same<_ValueType1, _ValueType2>::__type + _SameType; + return __check_sorted_set_aux(__first, __last, __pred, _SameType()); + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 270. Binary search requirements overly strict + // Determine if a sequence is partitioned w.r.t. this element. + template + inline bool + __check_partitioned_lower(_ForwardIterator __first, + _ForwardIterator __last, const _Tp& __value) + { + while (__first != __last && *__first < __value) + ++__first; + while (__first != __last && !(*__first < __value)) + ++__first; + return __first == __last; + } + + template + inline bool + __check_partitioned_upper(_ForwardIterator __first, + _ForwardIterator __last, const _Tp& __value) + { + while (__first != __last && !(__value < *__first)) + ++__first; + while (__first != __last && __value < *__first) + ++__first; + return __first == __last; + } + + // Determine if a sequence is partitioned w.r.t. this element. + template + inline bool + __check_partitioned_lower(_ForwardIterator __first, + _ForwardIterator __last, const _Tp& __value, + _Pred __pred) + { + while (__first != __last && bool(__pred(*__first, __value))) + ++__first; + while (__first != __last && !bool(__pred(*__first, __value))) + ++__first; + return __first == __last; + } + + template + inline bool + __check_partitioned_upper(_ForwardIterator __first, + _ForwardIterator __last, const _Tp& __value, + _Pred __pred) + { + while (__first != __last && !bool(__pred(__value, *__first))) + ++__first; + while (__first != __last && bool(__pred(__value, *__first))) + ++__first; + return __first == __last; + } +} // namespace __gnu_debug + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/list b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/list new file mode 100644 index 00000000..39f763a3 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/list @@ -0,0 +1,653 @@ +// Debugging list implementation -*- C++ -*- + +// Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file debug/list + * This file is a GNU debug extension to the Standard C++ Library. + */ + +#ifndef _GLIBCXX_DEBUG_LIST +#define _GLIBCXX_DEBUG_LIST 1 + +#include +#include +#include +#include + +namespace std +{ +namespace __debug +{ + template > + class list + : public _GLIBCXX_STD_D::list<_Tp, _Allocator>, + public __gnu_debug::_Safe_sequence > + { + typedef _GLIBCXX_STD_D::list<_Tp, _Allocator> _Base; + typedef __gnu_debug::_Safe_sequence _Safe_base; + + public: + typedef typename _Base::reference reference; + typedef typename _Base::const_reference const_reference; + + typedef __gnu_debug::_Safe_iterator + iterator; + typedef __gnu_debug::_Safe_iterator + const_iterator; + + typedef typename _Base::size_type size_type; + typedef typename _Base::difference_type difference_type; + + typedef _Tp value_type; + typedef _Allocator allocator_type; + typedef typename _Base::pointer pointer; + typedef typename _Base::const_pointer const_pointer; + typedef std::reverse_iterator reverse_iterator; + typedef std::reverse_iterator const_reverse_iterator; + + // 23.2.2.1 construct/copy/destroy: + explicit list(const _Allocator& __a = _Allocator()) + : _Base(__a) { } + + explicit list(size_type __n, const _Tp& __value = _Tp(), + const _Allocator& __a = _Allocator()) + : _Base(__n, __value, __a) { } + + template + list(_InputIterator __first, _InputIterator __last, + const _Allocator& __a = _Allocator()) + : _Base(__gnu_debug::__check_valid_range(__first, __last), __last, __a) + { } + + + list(const list& __x) + : _Base(__x), _Safe_base() { } + + list(const _Base& __x) + : _Base(__x), _Safe_base() { } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + list(list&& __x) + : _Base(std::forward(__x)), _Safe_base() + { this->_M_swap(__x); } + + list(initializer_list __l, + const allocator_type& __a = allocator_type()) + : _Base(__l, __a), _Safe_base() { } +#endif + + ~list() { } + + list& + operator=(const list& __x) + { + static_cast<_Base&>(*this) = __x; + this->_M_invalidate_all(); + return *this; + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + list& + operator=(list&& __x) + { + // NB: DR 675. + clear(); + swap(__x); + return *this; + } + + list& + operator=(initializer_list __l) + { + static_cast<_Base&>(*this) = __l; + this->_M_invalidate_all(); + return *this; + } + + void + assign(initializer_list __l) + { + _Base::assign(__l); + this->_M_invalidate_all(); + } +#endif + + template + void + assign(_InputIterator __first, _InputIterator __last) + { + __glibcxx_check_valid_range(__first, __last); + _Base::assign(__first, __last); + this->_M_invalidate_all(); + } + + void + assign(size_type __n, const _Tp& __t) + { + _Base::assign(__n, __t); + this->_M_invalidate_all(); + } + + using _Base::get_allocator; + + // iterators: + iterator + begin() + { return iterator(_Base::begin(), this); } + + const_iterator + begin() const + { return const_iterator(_Base::begin(), this); } + + iterator + end() + { return iterator(_Base::end(), this); } + + const_iterator + end() const + { return const_iterator(_Base::end(), this); } + + reverse_iterator + rbegin() + { return reverse_iterator(end()); } + + const_reverse_iterator + rbegin() const + { return const_reverse_iterator(end()); } + + reverse_iterator + rend() + { return reverse_iterator(begin()); } + + const_reverse_iterator + rend() const + { return const_reverse_iterator(begin()); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + const_iterator + cbegin() const + { return const_iterator(_Base::begin(), this); } + + const_iterator + cend() const + { return const_iterator(_Base::end(), this); } + + const_reverse_iterator + crbegin() const + { return const_reverse_iterator(end()); } + + const_reverse_iterator + crend() const + { return const_reverse_iterator(begin()); } +#endif + + // 23.2.2.2 capacity: + using _Base::empty; + using _Base::size; + using _Base::max_size; + + void + resize(size_type __sz, _Tp __c = _Tp()) + { + this->_M_detach_singular(); + + // if __sz < size(), invalidate all iterators in [begin+__sz, end()) + iterator __victim = begin(); + iterator __end = end(); + for (size_type __i = __sz; __victim != __end && __i > 0; --__i) + ++__victim; + + while (__victim != __end) + { + iterator __real_victim = __victim++; + __real_victim._M_invalidate(); + } + + __try + { + _Base::resize(__sz, __c); + } + __catch(...) + { + this->_M_revalidate_singular(); + __throw_exception_again; + } + } + + // element access: + reference + front() + { + __glibcxx_check_nonempty(); + return _Base::front(); + } + + const_reference + front() const + { + __glibcxx_check_nonempty(); + return _Base::front(); + } + + reference + back() + { + __glibcxx_check_nonempty(); + return _Base::back(); + } + + const_reference + back() const + { + __glibcxx_check_nonempty(); + return _Base::back(); + } + + // 23.2.2.3 modifiers: + using _Base::push_front; + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + using _Base::emplace_front; +#endif + + void + pop_front() + { + __glibcxx_check_nonempty(); + iterator __victim = begin(); + __victim._M_invalidate(); + _Base::pop_front(); + } + + using _Base::push_back; + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + using _Base::emplace_back; +#endif + + void + pop_back() + { + __glibcxx_check_nonempty(); + iterator __victim = end(); + --__victim; + __victim._M_invalidate(); + _Base::pop_back(); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + iterator + emplace(iterator __position, _Args&&... __args) + { + __glibcxx_check_insert(__position); + return iterator(_Base::emplace(__position.base(), + std::forward<_Args>(__args)...), this); + } +#endif + + iterator + insert(iterator __position, const _Tp& __x) + { + __glibcxx_check_insert(__position); + return iterator(_Base::insert(__position.base(), __x), this); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + iterator + insert(iterator __position, _Tp&& __x) + { return emplace(__position, std::move(__x)); } + + void + insert(iterator __p, initializer_list __l) + { + __glibcxx_check_insert(__p); + _Base::insert(__p, __l); + } +#endif + + void + insert(iterator __position, size_type __n, const _Tp& __x) + { + __glibcxx_check_insert(__position); + _Base::insert(__position.base(), __n, __x); + } + + template + void + insert(iterator __position, _InputIterator __first, + _InputIterator __last) + { + __glibcxx_check_insert_range(__position, __first, __last); + _Base::insert(__position.base(), __first, __last); + } + + iterator + erase(iterator __position) + { + __glibcxx_check_erase(__position); + __position._M_invalidate(); + return iterator(_Base::erase(__position.base()), this); + } + + iterator + erase(iterator __position, iterator __last) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 151. can't currently clear() empty container + __glibcxx_check_erase_range(__position, __last); + for (iterator __victim = __position; __victim != __last; ) + { + iterator __old = __victim; + ++__victim; + __old._M_invalidate(); + } + return iterator(_Base::erase(__position.base(), __last.base()), this); + } + + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + swap(list&& __x) +#else + swap(list& __x) +#endif + { + _Base::swap(__x); + this->_M_swap(__x); + } + + void + clear() + { + _Base::clear(); + this->_M_invalidate_all(); + } + + // 23.2.2.4 list operations: + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + splice(iterator __position, list&& __x) +#else + splice(iterator __position, list& __x) +#endif + { + _GLIBCXX_DEBUG_VERIFY(&__x != this, + _M_message(__gnu_debug::__msg_self_splice) + ._M_sequence(*this, "this")); + this->splice(__position, _GLIBCXX_MOVE(__x), __x.begin(), __x.end()); + } + + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + splice(iterator __position, list&& __x, iterator __i) +#else + splice(iterator __position, list& __x, iterator __i) +#endif + { + __glibcxx_check_insert(__position); + + // We used to perform the splice_alloc check: not anymore, redundant + // after implementing the relevant bits of N1599. + + _GLIBCXX_DEBUG_VERIFY(__i._M_dereferenceable(), + _M_message(__gnu_debug::__msg_splice_bad) + ._M_iterator(__i, "__i")); + _GLIBCXX_DEBUG_VERIFY(__i._M_attached_to(&__x), + _M_message(__gnu_debug::__msg_splice_other) + ._M_iterator(__i, "__i")._M_sequence(__x, "__x")); + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 250. splicing invalidates iterators + this->_M_transfer_iter(__i); + _Base::splice(__position.base(), _GLIBCXX_MOVE(__x._M_base()), + __i.base()); + } + + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + splice(iterator __position, list&& __x, iterator __first, + iterator __last) +#else + splice(iterator __position, list& __x, iterator __first, + iterator __last) +#endif + { + __glibcxx_check_insert(__position); + __glibcxx_check_valid_range(__first, __last); + _GLIBCXX_DEBUG_VERIFY(__first._M_attached_to(&__x), + _M_message(__gnu_debug::__msg_splice_other) + ._M_sequence(__x, "x") + ._M_iterator(__first, "first")); + + // We used to perform the splice_alloc check: not anymore, redundant + // after implementing the relevant bits of N1599. + + for (iterator __tmp = __first; __tmp != __last; ) + { + _GLIBCXX_DEBUG_VERIFY(&__x != this || __tmp != __position, + _M_message(__gnu_debug::__msg_splice_overlap) + ._M_iterator(__tmp, "position") + ._M_iterator(__first, "first") + ._M_iterator(__last, "last")); + iterator __victim = __tmp++; + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 250. splicing invalidates iterators + this->_M_transfer_iter(__victim); + } + + _Base::splice(__position.base(), _GLIBCXX_MOVE(__x._M_base()), + __first.base(), __last.base()); + } + + void + remove(const _Tp& __value) + { + for (iterator __x = begin(); __x.base() != _Base::end(); ) + { + if (*__x == __value) + __x = erase(__x); + else + ++__x; + } + } + + template + void + remove_if(_Predicate __pred) + { + for (iterator __x = begin(); __x.base() != _Base::end(); ) + { + if (__pred(*__x)) + __x = erase(__x); + else + ++__x; + } + } + + void + unique() + { + iterator __first = begin(); + iterator __last = end(); + if (__first == __last) + return; + iterator __next = __first; + while (++__next != __last) + { + if (*__first == *__next) + erase(__next); + else + __first = __next; + __next = __first; + } + } + + template + void + unique(_BinaryPredicate __binary_pred) + { + iterator __first = begin(); + iterator __last = end(); + if (__first == __last) + return; + iterator __next = __first; + while (++__next != __last) + { + if (__binary_pred(*__first, *__next)) + erase(__next); + else + __first = __next; + __next = __first; + } + } + + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + merge(list&& __x) +#else + merge(list& __x) +#endif + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 300. list::merge() specification incomplete + if (this != &__x) + { + __glibcxx_check_sorted(_Base::begin(), _Base::end()); + __glibcxx_check_sorted(__x.begin().base(), __x.end().base()); + for (iterator __tmp = __x.begin(); __tmp != __x.end();) + { + iterator __victim = __tmp++; + this->_M_transfer_iter(__victim); + } + _Base::merge(_GLIBCXX_MOVE(__x._M_base())); + } + } + + template + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + merge(list&& __x, _Compare __comp) +#else + merge(list& __x, _Compare __comp) +#endif + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 300. list::merge() specification incomplete + if (this != &__x) + { + __glibcxx_check_sorted_pred(_Base::begin(), _Base::end(), + __comp); + __glibcxx_check_sorted_pred(__x.begin().base(), __x.end().base(), + __comp); + for (iterator __tmp = __x.begin(); __tmp != __x.end();) + { + iterator __victim = __tmp++; + this->_M_transfer_iter(__victim); + } + _Base::merge(_GLIBCXX_MOVE(__x._M_base()), __comp); + } + } + + void + sort() { _Base::sort(); } + + template + void + sort(_StrictWeakOrdering __pred) { _Base::sort(__pred); } + + using _Base::reverse; + + _Base& + _M_base() { return *this; } + + const _Base& + _M_base() const { return *this; } + + private: + void + _M_invalidate_all() + { + typedef typename _Base::const_iterator _Base_const_iterator; + typedef __gnu_debug::_Not_equal_to<_Base_const_iterator> _Not_equal; + this->_M_invalidate_if(_Not_equal(_M_base().end())); + } + }; + + template + inline bool + operator==(const list<_Tp, _Alloc>& __lhs, + const list<_Tp, _Alloc>& __rhs) + { return __lhs._M_base() == __rhs._M_base(); } + + template + inline bool + operator!=(const list<_Tp, _Alloc>& __lhs, + const list<_Tp, _Alloc>& __rhs) + { return __lhs._M_base() != __rhs._M_base(); } + + template + inline bool + operator<(const list<_Tp, _Alloc>& __lhs, + const list<_Tp, _Alloc>& __rhs) + { return __lhs._M_base() < __rhs._M_base(); } + + template + inline bool + operator<=(const list<_Tp, _Alloc>& __lhs, + const list<_Tp, _Alloc>& __rhs) + { return __lhs._M_base() <= __rhs._M_base(); } + + template + inline bool + operator>=(const list<_Tp, _Alloc>& __lhs, + const list<_Tp, _Alloc>& __rhs) + { return __lhs._M_base() >= __rhs._M_base(); } + + template + inline bool + operator>(const list<_Tp, _Alloc>& __lhs, + const list<_Tp, _Alloc>& __rhs) + { return __lhs._M_base() > __rhs._M_base(); } + + template + inline void + swap(list<_Tp, _Alloc>& __lhs, list<_Tp, _Alloc>& __rhs) + { __lhs.swap(__rhs); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + inline void + swap(list<_Tp, _Alloc>&& __lhs, list<_Tp, _Alloc>& __rhs) + { __lhs.swap(__rhs); } + + template + inline void + swap(list<_Tp, _Alloc>& __lhs, list<_Tp, _Alloc>&& __rhs) + { __lhs.swap(__rhs); } +#endif + +} // namespace __debug +} // namespace std + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/macros.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/macros.h new file mode 100644 index 00000000..1a8ce69c --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/macros.h @@ -0,0 +1,246 @@ +// Debugging support implementation -*- C++ -*- + +// Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file debug/macros.h + * This file is a GNU debug extension to the Standard C++ Library. + */ + +#ifndef _GLIBCXX_DEBUG_MACROS_H +#define _GLIBCXX_DEBUG_MACROS_H 1 + +/** + * Macros used by the implementation to verify certain + * properties. These macros may only be used directly by the debug + * wrappers. Note that these are macros (instead of the more obviously + * "correct" choice of making them functions) because we need line and + * file information at the call site, to minimize the distance between + * the user error and where the error is reported. + * + */ +#define _GLIBCXX_DEBUG_VERIFY(_Condition,_ErrorMessage) \ + do \ + { \ + if (! (_Condition)) \ + __gnu_debug::_Error_formatter::_M_at(__FILE__, __LINE__) \ + ._ErrorMessage._M_error(); \ + } while (false) + +// Verify that [_First, _Last) forms a valid iterator range. +#define __glibcxx_check_valid_range(_First,_Last) \ +_GLIBCXX_DEBUG_VERIFY(__gnu_debug::__valid_range(_First, _Last), \ + _M_message(__gnu_debug::__msg_valid_range) \ + ._M_iterator(_First, #_First) \ + ._M_iterator(_Last, #_Last)) + +/** Verify that we can insert into *this with the iterator _Position. + * Insertion into a container at a specific position requires that + * the iterator be nonsingular (i.e., either dereferenceable or + * past-the-end) and that it reference the sequence we are inserting + * into. Note that this macro is only valid when the container is a + * _Safe_sequence and the iterator is a _Safe_iterator. +*/ +#define __glibcxx_check_insert(_Position) \ +_GLIBCXX_DEBUG_VERIFY(!_Position._M_singular(), \ + _M_message(__gnu_debug::__msg_insert_singular) \ + ._M_sequence(*this, "this") \ + ._M_iterator(_Position, #_Position)); \ +_GLIBCXX_DEBUG_VERIFY(_Position._M_attached_to(this), \ + _M_message(__gnu_debug::__msg_insert_different) \ + ._M_sequence(*this, "this") \ + ._M_iterator(_Position, #_Position)) + +/** Verify that we can insert the values in the iterator range + * [_First, _Last) into *this with the iterator _Position. Insertion + * into a container at a specific position requires that the iterator + * be nonsingular (i.e., either dereferenceable or past-the-end), + * that it reference the sequence we are inserting into, and that the + * iterator range [_First, Last) is a valid (possibly empty) + * range. Note that this macro is only valid when the container is a + * _Safe_sequence and the iterator is a _Safe_iterator. + * + * @tbd We would like to be able to check for noninterference of + * _Position and the range [_First, _Last), but that can't (in + * general) be done. +*/ +#define __glibcxx_check_insert_range(_Position,_First,_Last) \ +__glibcxx_check_valid_range(_First,_Last); \ +_GLIBCXX_DEBUG_VERIFY(!_Position._M_singular(), \ + _M_message(__gnu_debug::__msg_insert_singular) \ + ._M_sequence(*this, "this") \ + ._M_iterator(_Position, #_Position)); \ +_GLIBCXX_DEBUG_VERIFY(_Position._M_attached_to(this), \ + _M_message(__gnu_debug::__msg_insert_different) \ + ._M_sequence(*this, "this") \ + ._M_iterator(_Position, #_Position)) + +/** Verify that we can erase the element referenced by the iterator + * _Position. We can erase the element if the _Position iterator is + * dereferenceable and references this sequence. +*/ +#define __glibcxx_check_erase(_Position) \ +_GLIBCXX_DEBUG_VERIFY(_Position._M_dereferenceable(), \ + _M_message(__gnu_debug::__msg_erase_bad) \ + ._M_sequence(*this, "this") \ + ._M_iterator(_Position, #_Position)); \ +_GLIBCXX_DEBUG_VERIFY(_Position._M_attached_to(this), \ + _M_message(__gnu_debug::__msg_erase_different) \ + ._M_sequence(*this, "this") \ + ._M_iterator(_Position, #_Position)) + +/** Verify that we can erase the elements in the iterator range + * [_First, _Last). We can erase the elements if [_First, _Last) is a + * valid iterator range within this sequence. +*/ +#define __glibcxx_check_erase_range(_First,_Last) \ +__glibcxx_check_valid_range(_First,_Last); \ +_GLIBCXX_DEBUG_VERIFY(_First._M_attached_to(this), \ + _M_message(__gnu_debug::__msg_erase_different) \ + ._M_sequence(*this, "this") \ + ._M_iterator(_First, #_First) \ + ._M_iterator(_Last, #_Last)) + +// Verify that the subscript _N is less than the container's size. +#define __glibcxx_check_subscript(_N) \ +_GLIBCXX_DEBUG_VERIFY(_N < this->size(), \ + _M_message(__gnu_debug::__msg_subscript_oob) \ + ._M_sequence(*this, "this") \ + ._M_integer(_N, #_N) \ + ._M_integer(this->size(), "size")) + +// Verify that the container is nonempty +#define __glibcxx_check_nonempty() \ +_GLIBCXX_DEBUG_VERIFY(! this->empty(), \ + _M_message(__gnu_debug::__msg_empty) \ + ._M_sequence(*this, "this")) + +// Verify that the iterator range [_First, _Last) is sorted +#define __glibcxx_check_sorted(_First,_Last) \ +__glibcxx_check_valid_range(_First,_Last); \ +_GLIBCXX_DEBUG_VERIFY(__gnu_debug::__check_sorted(_First, _Last), \ + _M_message(__gnu_debug::__msg_unsorted) \ + ._M_iterator(_First, #_First) \ + ._M_iterator(_Last, #_Last)) + +/** Verify that the iterator range [_First, _Last) is sorted by the + predicate _Pred. */ +#define __glibcxx_check_sorted_pred(_First,_Last,_Pred) \ +__glibcxx_check_valid_range(_First,_Last); \ +_GLIBCXX_DEBUG_VERIFY(__gnu_debug::__check_sorted(_First, _Last, _Pred), \ + _M_message(__gnu_debug::__msg_unsorted_pred) \ + ._M_iterator(_First, #_First) \ + ._M_iterator(_Last, #_Last) \ + ._M_string(#_Pred)) + +// Special variant for std::merge, std::includes, std::set_* +#define __glibcxx_check_sorted_set(_First1,_Last1,_First2) \ +__glibcxx_check_valid_range(_First1,_Last1); \ +_GLIBCXX_DEBUG_VERIFY( \ + __gnu_debug::__check_sorted_set(_First1, _Last1, _First2), \ + _M_message(__gnu_debug::__msg_unsorted) \ + ._M_iterator(_First1, #_First1) \ + ._M_iterator(_Last1, #_Last1)) + +// Likewise with a _Pred. +#define __glibcxx_check_sorted_set_pred(_First1,_Last1,_First2,_Pred) \ +__glibcxx_check_valid_range(_First1,_Last1); \ +_GLIBCXX_DEBUG_VERIFY( \ + __gnu_debug::__check_sorted_set(_First1, _Last1, _First2, _Pred), \ + _M_message(__gnu_debug::__msg_unsorted_pred) \ + ._M_iterator(_First1, #_First1) \ + ._M_iterator(_Last1, #_Last1) \ + ._M_string(#_Pred)) + +/** Verify that the iterator range [_First, _Last) is partitioned + w.r.t. the value _Value. */ +#define __glibcxx_check_partitioned_lower(_First,_Last,_Value) \ +__glibcxx_check_valid_range(_First,_Last); \ +_GLIBCXX_DEBUG_VERIFY(__gnu_debug::__check_partitioned_lower(_First, _Last, \ + _Value), \ + _M_message(__gnu_debug::__msg_unpartitioned) \ + ._M_iterator(_First, #_First) \ + ._M_iterator(_Last, #_Last) \ + ._M_string(#_Value)) + +#define __glibcxx_check_partitioned_upper(_First,_Last,_Value) \ +__glibcxx_check_valid_range(_First,_Last); \ +_GLIBCXX_DEBUG_VERIFY(__gnu_debug::__check_partitioned_upper(_First, _Last, \ + _Value), \ + _M_message(__gnu_debug::__msg_unpartitioned) \ + ._M_iterator(_First, #_First) \ + ._M_iterator(_Last, #_Last) \ + ._M_string(#_Value)) + +/** Verify that the iterator range [_First, _Last) is partitioned + w.r.t. the value _Value and predicate _Pred. */ +#define __glibcxx_check_partitioned_lower_pred(_First,_Last,_Value,_Pred) \ +__glibcxx_check_valid_range(_First,_Last); \ +_GLIBCXX_DEBUG_VERIFY(__gnu_debug::__check_partitioned_lower(_First, _Last, \ + _Value, _Pred), \ + _M_message(__gnu_debug::__msg_unpartitioned_pred) \ + ._M_iterator(_First, #_First) \ + ._M_iterator(_Last, #_Last) \ + ._M_string(#_Pred) \ + ._M_string(#_Value)) + +/** Verify that the iterator range [_First, _Last) is partitioned + w.r.t. the value _Value and predicate _Pred. */ +#define __glibcxx_check_partitioned_upper_pred(_First,_Last,_Value,_Pred) \ +__glibcxx_check_valid_range(_First,_Last); \ +_GLIBCXX_DEBUG_VERIFY(__gnu_debug::__check_partitioned_upper(_First, _Last, \ + _Value, _Pred), \ + _M_message(__gnu_debug::__msg_unpartitioned_pred) \ + ._M_iterator(_First, #_First) \ + ._M_iterator(_Last, #_Last) \ + ._M_string(#_Pred) \ + ._M_string(#_Value)) + +// Verify that the iterator range [_First, _Last) is a heap +#define __glibcxx_check_heap(_First,_Last) \ +__glibcxx_check_valid_range(_First,_Last); \ +_GLIBCXX_DEBUG_VERIFY(std::__is_heap(_First, _Last), \ + _M_message(__gnu_debug::__msg_not_heap) \ + ._M_iterator(_First, #_First) \ + ._M_iterator(_Last, #_Last)) + +/** Verify that the iterator range [_First, _Last) is a heap + w.r.t. the predicate _Pred. */ +#define __glibcxx_check_heap_pred(_First,_Last,_Pred) \ +__glibcxx_check_valid_range(_First,_Last); \ +_GLIBCXX_DEBUG_VERIFY(std::__is_heap(_First, _Last, _Pred), \ + _M_message(__gnu_debug::__msg_not_heap_pred) \ + ._M_iterator(_First, #_First) \ + ._M_iterator(_Last, #_Last) \ + ._M_string(#_Pred)) + +#ifdef _GLIBCXX_DEBUG_PEDANTIC +# define __glibcxx_check_string(_String) _GLIBCXX_DEBUG_ASSERT(_String != 0) +# define __glibcxx_check_string_len(_String,_Len) \ + _GLIBCXX_DEBUG_ASSERT(_String != 0 || _Len == 0) +#else +# define __glibcxx_check_string(_String) +# define __glibcxx_check_string_len(_String,_Len) +#endif + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/map b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/map new file mode 100644 index 00000000..2d16b71d --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/map @@ -0,0 +1,37 @@ +// Debugging map/multimap implementation -*- C++ -*- + +// Copyright (C) 2003, 2006, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file debug/map + * This file is a GNU debug extension to the Standard C++ Library. + */ + +#ifndef _GLIBCXX_DEBUG_MAP +#define _GLIBCXX_DEBUG_MAP 1 + +#include +#include +#include + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/map.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/map.h new file mode 100644 index 00000000..de1e5a5e --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/map.h @@ -0,0 +1,412 @@ +// Debugging map implementation -*- C++ -*- + +// Copyright (C) 2003, 2004, 2005, 2006, 2007, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file debug/map.h + * This file is a GNU debug extension to the Standard C++ Library. + */ + +#ifndef _GLIBCXX_DEBUG_MAP_H +#define _GLIBCXX_DEBUG_MAP_H 1 + +#include +#include +#include + +namespace std +{ +namespace __debug +{ + template, + typename _Allocator = std::allocator > > + class map + : public _GLIBCXX_STD_D::map<_Key, _Tp, _Compare, _Allocator>, + public __gnu_debug::_Safe_sequence > + { + typedef _GLIBCXX_STD_D::map<_Key, _Tp, _Compare, _Allocator> _Base; + typedef __gnu_debug::_Safe_sequence _Safe_base; + + public: + // types: + typedef _Key key_type; + typedef _Tp mapped_type; + typedef std::pair value_type; + typedef _Compare key_compare; + typedef _Allocator allocator_type; + typedef typename _Base::reference reference; + typedef typename _Base::const_reference const_reference; + + typedef __gnu_debug::_Safe_iterator + iterator; + typedef __gnu_debug::_Safe_iterator + const_iterator; + + typedef typename _Base::size_type size_type; + typedef typename _Base::difference_type difference_type; + typedef typename _Base::pointer pointer; + typedef typename _Base::const_pointer const_pointer; + typedef std::reverse_iterator reverse_iterator; + typedef std::reverse_iterator const_reverse_iterator; + + using _Base::value_compare; + + // 23.3.1.1 construct/copy/destroy: + explicit map(const _Compare& __comp = _Compare(), + const _Allocator& __a = _Allocator()) + : _Base(__comp, __a) { } + + template + map(_InputIterator __first, _InputIterator __last, + const _Compare& __comp = _Compare(), + const _Allocator& __a = _Allocator()) + : _Base(__gnu_debug::__check_valid_range(__first, __last), __last, + __comp, __a), _Safe_base() { } + + map(const map& __x) + : _Base(__x), _Safe_base() { } + + map(const _Base& __x) + : _Base(__x), _Safe_base() { } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + map(map&& __x) + : _Base(std::forward(__x)), _Safe_base() + { this->_M_swap(__x); } + + map(initializer_list __l, + const _Compare& __c = _Compare(), + const allocator_type& __a = allocator_type()) + : _Base(__l, __c, __a), _Safe_base() { } +#endif + + ~map() { } + + map& + operator=(const map& __x) + { + *static_cast<_Base*>(this) = __x; + this->_M_invalidate_all(); + return *this; + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + map& + operator=(map&& __x) + { + // NB: DR 675. + clear(); + swap(__x); + return *this; + } + + map& + operator=(initializer_list __l) + { + this->clear(); + this->insert(__l); + return *this; + } +#endif + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 133. map missing get_allocator() + using _Base::get_allocator; + + // iterators: + iterator + begin() + { return iterator(_Base::begin(), this); } + + const_iterator + begin() const + { return const_iterator(_Base::begin(), this); } + + iterator + end() + { return iterator(_Base::end(), this); } + + const_iterator + end() const + { return const_iterator(_Base::end(), this); } + + reverse_iterator + rbegin() + { return reverse_iterator(end()); } + + const_reverse_iterator + rbegin() const + { return const_reverse_iterator(end()); } + + reverse_iterator + rend() + { return reverse_iterator(begin()); } + + const_reverse_iterator + rend() const + { return const_reverse_iterator(begin()); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + const_iterator + cbegin() const + { return const_iterator(_Base::begin(), this); } + + const_iterator + cend() const + { return const_iterator(_Base::end(), this); } + + const_reverse_iterator + crbegin() const + { return const_reverse_iterator(end()); } + + const_reverse_iterator + crend() const + { return const_reverse_iterator(begin()); } +#endif + + // capacity: + using _Base::empty; + using _Base::size; + using _Base::max_size; + + // 23.3.1.2 element access: + using _Base::operator[]; + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 464. Suggestion for new member functions in standard containers. + using _Base::at; + + // modifiers: + std::pair + insert(const value_type& __x) + { + typedef typename _Base::iterator _Base_iterator; + std::pair<_Base_iterator, bool> __res = _Base::insert(__x); + return std::pair(iterator(__res.first, this), + __res.second); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + void + insert(std::initializer_list __list) + { _Base::insert(__list); } +#endif + + iterator + insert(iterator __position, const value_type& __x) + { + __glibcxx_check_insert(__position); + return iterator(_Base::insert(__position.base(), __x), this); + } + + template + void + insert(_InputIterator __first, _InputIterator __last) + { + __glibcxx_check_valid_range(__first, __last); + _Base::insert(__first, __last); + } + + void + erase(iterator __position) + { + __glibcxx_check_erase(__position); + __position._M_invalidate(); + _Base::erase(__position.base()); + } + + size_type + erase(const key_type& __x) + { + iterator __victim = find(__x); + if (__victim == end()) + return 0; + else + { + __victim._M_invalidate(); + _Base::erase(__victim.base()); + return 1; + } + } + + void + erase(iterator __first, iterator __last) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 151. can't currently clear() empty container + __glibcxx_check_erase_range(__first, __last); + while (__first != __last) + this->erase(__first++); + } + + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + swap(map&& __x) +#else + swap(map& __x) +#endif + { + _Base::swap(__x); + this->_M_swap(__x); + } + + void + clear() + { this->erase(begin(), end()); } + + // observers: + using _Base::key_comp; + using _Base::value_comp; + + // 23.3.1.3 map operations: + iterator + find(const key_type& __x) + { return iterator(_Base::find(__x), this); } + + const_iterator + find(const key_type& __x) const + { return const_iterator(_Base::find(__x), this); } + + using _Base::count; + + iterator + lower_bound(const key_type& __x) + { return iterator(_Base::lower_bound(__x), this); } + + const_iterator + lower_bound(const key_type& __x) const + { return const_iterator(_Base::lower_bound(__x), this); } + + iterator + upper_bound(const key_type& __x) + { return iterator(_Base::upper_bound(__x), this); } + + const_iterator + upper_bound(const key_type& __x) const + { return const_iterator(_Base::upper_bound(__x), this); } + + std::pair + equal_range(const key_type& __x) + { + typedef typename _Base::iterator _Base_iterator; + std::pair<_Base_iterator, _Base_iterator> __res = + _Base::equal_range(__x); + return std::make_pair(iterator(__res.first, this), + iterator(__res.second, this)); + } + + std::pair + equal_range(const key_type& __x) const + { + typedef typename _Base::const_iterator _Base_const_iterator; + std::pair<_Base_const_iterator, _Base_const_iterator> __res = + _Base::equal_range(__x); + return std::make_pair(const_iterator(__res.first, this), + const_iterator(__res.second, this)); + } + + _Base& + _M_base() { return *this; } + + const _Base& + _M_base() const { return *this; } + + private: + void + _M_invalidate_all() + { + typedef typename _Base::const_iterator _Base_const_iterator; + typedef __gnu_debug::_Not_equal_to<_Base_const_iterator> _Not_equal; + this->_M_invalidate_if(_Not_equal(_M_base().end())); + } + }; + + template + inline bool + operator==(const map<_Key, _Tp, _Compare, _Allocator>& __lhs, + const map<_Key, _Tp, _Compare, _Allocator>& __rhs) + { return __lhs._M_base() == __rhs._M_base(); } + + template + inline bool + operator!=(const map<_Key, _Tp, _Compare, _Allocator>& __lhs, + const map<_Key, _Tp, _Compare, _Allocator>& __rhs) + { return __lhs._M_base() != __rhs._M_base(); } + + template + inline bool + operator<(const map<_Key, _Tp, _Compare, _Allocator>& __lhs, + const map<_Key, _Tp, _Compare, _Allocator>& __rhs) + { return __lhs._M_base() < __rhs._M_base(); } + + template + inline bool + operator<=(const map<_Key, _Tp, _Compare, _Allocator>& __lhs, + const map<_Key, _Tp, _Compare, _Allocator>& __rhs) + { return __lhs._M_base() <= __rhs._M_base(); } + + template + inline bool + operator>=(const map<_Key, _Tp, _Compare, _Allocator>& __lhs, + const map<_Key, _Tp, _Compare, _Allocator>& __rhs) + { return __lhs._M_base() >= __rhs._M_base(); } + + template + inline bool + operator>(const map<_Key, _Tp, _Compare, _Allocator>& __lhs, + const map<_Key, _Tp, _Compare, _Allocator>& __rhs) + { return __lhs._M_base() > __rhs._M_base(); } + + template + inline void + swap(map<_Key, _Tp, _Compare, _Allocator>& __lhs, + map<_Key, _Tp, _Compare, _Allocator>& __rhs) + { __lhs.swap(__rhs); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + inline void + swap(map<_Key, _Tp, _Compare, _Allocator>&& __lhs, + map<_Key, _Tp, _Compare, _Allocator>& __rhs) + { __lhs.swap(__rhs); } + + template + inline void + swap(map<_Key, _Tp, _Compare, _Allocator>& __lhs, + map<_Key, _Tp, _Compare, _Allocator>&& __rhs) + { __lhs.swap(__rhs); } +#endif + +} // namespace __debug +} // namespace std + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/multimap.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/multimap.h new file mode 100644 index 00000000..42741dac --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/multimap.h @@ -0,0 +1,400 @@ +// Debugging multimap implementation -*- C++ -*- + +// Copyright (C) 2003, 2004, 2005, 2006, 2007, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file debug/multimap.h + * This file is a GNU debug extension to the Standard C++ Library. + */ + +#ifndef _GLIBCXX_DEBUG_MULTIMAP_H +#define _GLIBCXX_DEBUG_MULTIMAP_H 1 + +#include +#include +#include + +namespace std +{ +namespace __debug +{ + template, + typename _Allocator = std::allocator > > + class multimap + : public _GLIBCXX_STD_D::multimap<_Key, _Tp, _Compare, _Allocator>, + public __gnu_debug::_Safe_sequence > + { + typedef _GLIBCXX_STD_D::multimap<_Key, _Tp, _Compare, _Allocator> _Base; + typedef __gnu_debug::_Safe_sequence _Safe_base; + + public: + // types: + typedef _Key key_type; + typedef _Tp mapped_type; + typedef std::pair value_type; + typedef _Compare key_compare; + typedef _Allocator allocator_type; + typedef typename _Base::reference reference; + typedef typename _Base::const_reference const_reference; + + typedef __gnu_debug::_Safe_iterator + iterator; + typedef __gnu_debug::_Safe_iterator const_iterator; + + typedef typename _Base::size_type size_type; + typedef typename _Base::difference_type difference_type; + typedef typename _Base::pointer pointer; + typedef typename _Base::const_pointer const_pointer; + typedef std::reverse_iterator reverse_iterator; + typedef std::reverse_iterator const_reverse_iterator; + + using _Base::value_compare; + + // 23.3.1.1 construct/copy/destroy: + explicit multimap(const _Compare& __comp = _Compare(), + const _Allocator& __a = _Allocator()) + : _Base(__comp, __a) { } + + template + multimap(_InputIterator __first, _InputIterator __last, + const _Compare& __comp = _Compare(), + const _Allocator& __a = _Allocator()) + : _Base(__gnu_debug::__check_valid_range(__first, __last), __last, + __comp, __a) { } + + multimap(const multimap& __x) + : _Base(__x), _Safe_base() { } + + multimap(const _Base& __x) + : _Base(__x), _Safe_base() { } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + multimap(multimap&& __x) + : _Base(std::forward(__x)), _Safe_base() + { this->_M_swap(__x); } + + multimap(initializer_list __l, + const _Compare& __c = _Compare(), + const allocator_type& __a = allocator_type()) + : _Base(__l, __c, __a), _Safe_base() { } +#endif + + ~multimap() { } + + multimap& + operator=(const multimap& __x) + { + *static_cast<_Base*>(this) = __x; + this->_M_invalidate_all(); + return *this; + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + multimap& + operator=(multimap&& __x) + { + // NB: DR 675. + clear(); + swap(__x); + return *this; + } + + multimap& + operator=(initializer_list __l) + { + this->clear(); + this->insert(__l); + return *this; + } +#endif + + using _Base::get_allocator; + + // iterators: + iterator + begin() + { return iterator(_Base::begin(), this); } + + const_iterator + begin() const + { return const_iterator(_Base::begin(), this); } + + iterator + end() + { return iterator(_Base::end(), this); } + + const_iterator + end() const + { return const_iterator(_Base::end(), this); } + + reverse_iterator + rbegin() + { return reverse_iterator(end()); } + + const_reverse_iterator + rbegin() const + { return const_reverse_iterator(end()); } + + reverse_iterator + rend() + { return reverse_iterator(begin()); } + + const_reverse_iterator + rend() const + { return const_reverse_iterator(begin()); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + const_iterator + cbegin() const + { return const_iterator(_Base::begin(), this); } + + const_iterator + cend() const + { return const_iterator(_Base::end(), this); } + + const_reverse_iterator + crbegin() const + { return const_reverse_iterator(end()); } + + const_reverse_iterator + crend() const + { return const_reverse_iterator(begin()); } +#endif + + // capacity: + using _Base::empty; + using _Base::size; + using _Base::max_size; + + // modifiers: + iterator + insert(const value_type& __x) + { return iterator(_Base::insert(__x), this); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + void + insert(std::initializer_list __list) + { _Base::insert(__list); } +#endif + + iterator + insert(iterator __position, const value_type& __x) + { + __glibcxx_check_insert(__position); + return iterator(_Base::insert(__position.base(), __x), this); + } + + template + void + insert(_InputIterator __first, _InputIterator __last) + { + __glibcxx_check_valid_range(__first, __last); + _Base::insert(__first, __last); + } + + void + erase(iterator __position) + { + __glibcxx_check_erase(__position); + __position._M_invalidate(); + _Base::erase(__position.base()); + } + + size_type + erase(const key_type& __x) + { + std::pair __victims = this->equal_range(__x); + size_type __count = 0; + while (__victims.first != __victims.second) + { + iterator __victim = __victims.first++; + __victim._M_invalidate(); + _Base::erase(__victim.base()); + ++__count; + } + return __count; + } + + void + erase(iterator __first, iterator __last) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 151. can't currently clear() empty container + __glibcxx_check_erase_range(__first, __last); + while (__first != __last) + this->erase(__first++); + } + + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + swap(multimap&& __x) +#else + swap(multimap& __x) +#endif + { + _Base::swap(__x); + this->_M_swap(__x); + } + + void + clear() + { this->erase(begin(), end()); } + + // observers: + using _Base::key_comp; + using _Base::value_comp; + + // 23.3.1.3 multimap operations: + iterator + find(const key_type& __x) + { return iterator(_Base::find(__x), this); } + + const_iterator + find(const key_type& __x) const + { return const_iterator(_Base::find(__x), this); } + + using _Base::count; + + iterator + lower_bound(const key_type& __x) + { return iterator(_Base::lower_bound(__x), this); } + + const_iterator + lower_bound(const key_type& __x) const + { return const_iterator(_Base::lower_bound(__x), this); } + + iterator + upper_bound(const key_type& __x) + { return iterator(_Base::upper_bound(__x), this); } + + const_iterator + upper_bound(const key_type& __x) const + { return const_iterator(_Base::upper_bound(__x), this); } + + std::pair + equal_range(const key_type& __x) + { + typedef typename _Base::iterator _Base_iterator; + std::pair<_Base_iterator, _Base_iterator> __res = + _Base::equal_range(__x); + return std::make_pair(iterator(__res.first, this), + iterator(__res.second, this)); + } + + std::pair + equal_range(const key_type& __x) const + { + typedef typename _Base::const_iterator _Base_const_iterator; + std::pair<_Base_const_iterator, _Base_const_iterator> __res = + _Base::equal_range(__x); + return std::make_pair(const_iterator(__res.first, this), + const_iterator(__res.second, this)); + } + + _Base& + _M_base() { return *this; } + + const _Base& + _M_base() const { return *this; } + + private: + void + _M_invalidate_all() + { + typedef typename _Base::const_iterator _Base_const_iterator; + typedef __gnu_debug::_Not_equal_to<_Base_const_iterator> _Not_equal; + this->_M_invalidate_if(_Not_equal(_M_base().end())); + } + }; + + template + inline bool + operator==(const multimap<_Key, _Tp, _Compare, _Allocator>& __lhs, + const multimap<_Key, _Tp, _Compare, _Allocator>& __rhs) + { return __lhs._M_base() == __rhs._M_base(); } + + template + inline bool + operator!=(const multimap<_Key, _Tp, _Compare, _Allocator>& __lhs, + const multimap<_Key, _Tp, _Compare, _Allocator>& __rhs) + { return __lhs._M_base() != __rhs._M_base(); } + + template + inline bool + operator<(const multimap<_Key, _Tp, _Compare, _Allocator>& __lhs, + const multimap<_Key, _Tp, _Compare, _Allocator>& __rhs) + { return __lhs._M_base() < __rhs._M_base(); } + + template + inline bool + operator<=(const multimap<_Key, _Tp, _Compare, _Allocator>& __lhs, + const multimap<_Key, _Tp, _Compare, _Allocator>& __rhs) + { return __lhs._M_base() <= __rhs._M_base(); } + + template + inline bool + operator>=(const multimap<_Key, _Tp, _Compare, _Allocator>& __lhs, + const multimap<_Key, _Tp, _Compare, _Allocator>& __rhs) + { return __lhs._M_base() >= __rhs._M_base(); } + + template + inline bool + operator>(const multimap<_Key, _Tp, _Compare, _Allocator>& __lhs, + const multimap<_Key, _Tp, _Compare, _Allocator>& __rhs) + { return __lhs._M_base() > __rhs._M_base(); } + + template + inline void + swap(multimap<_Key, _Tp, _Compare, _Allocator>& __lhs, + multimap<_Key, _Tp, _Compare, _Allocator>& __rhs) + { __lhs.swap(__rhs); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + inline void + swap(multimap<_Key, _Tp, _Compare, _Allocator>&& __lhs, + multimap<_Key, _Tp, _Compare, _Allocator>& __rhs) + { __lhs.swap(__rhs); } + + template + inline void + swap(multimap<_Key, _Tp, _Compare, _Allocator>& __lhs, + multimap<_Key, _Tp, _Compare, _Allocator>&& __rhs) + { __lhs.swap(__rhs); } +#endif + +} // namespace __debug +} // namespace std + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/multiset.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/multiset.h new file mode 100644 index 00000000..3e4ee86a --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/multiset.h @@ -0,0 +1,396 @@ +// Debugging multiset implementation -*- C++ -*- + +// Copyright (C) 2003, 2004, 2005, 2006, 2007, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file debug/multiset.h + * This file is a GNU debug extension to the Standard C++ Library. + */ + +#ifndef _GLIBCXX_DEBUG_MULTISET_H +#define _GLIBCXX_DEBUG_MULTISET_H 1 + +#include +#include +#include + +namespace std +{ +namespace __debug +{ + template, + typename _Allocator = std::allocator<_Key> > + class multiset + : public _GLIBCXX_STD_D::multiset<_Key, _Compare, _Allocator>, + public __gnu_debug::_Safe_sequence > + { + typedef _GLIBCXX_STD_D::multiset<_Key, _Compare, _Allocator> _Base; + typedef __gnu_debug::_Safe_sequence _Safe_base; + + public: + // types: + typedef _Key key_type; + typedef _Key value_type; + typedef _Compare key_compare; + typedef _Compare value_compare; + typedef _Allocator allocator_type; + typedef typename _Base::reference reference; + typedef typename _Base::const_reference const_reference; + + typedef __gnu_debug::_Safe_iterator + iterator; + typedef __gnu_debug::_Safe_iterator const_iterator; + + typedef typename _Base::size_type size_type; + typedef typename _Base::difference_type difference_type; + typedef typename _Base::pointer pointer; + typedef typename _Base::const_pointer const_pointer; + typedef std::reverse_iterator reverse_iterator; + typedef std::reverse_iterator const_reverse_iterator; + + // 23.3.3.1 construct/copy/destroy: + explicit multiset(const _Compare& __comp = _Compare(), + const _Allocator& __a = _Allocator()) + : _Base(__comp, __a) { } + + template + multiset(_InputIterator __first, _InputIterator __last, + const _Compare& __comp = _Compare(), + const _Allocator& __a = _Allocator()) + : _Base(__gnu_debug::__check_valid_range(__first, __last), __last, + __comp, __a) { } + + multiset(const multiset& __x) + : _Base(__x), _Safe_base() { } + + multiset(const _Base& __x) + : _Base(__x), _Safe_base() { } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + multiset(multiset&& __x) + : _Base(std::forward(__x)), _Safe_base() + { this->_M_swap(__x); } + + multiset(initializer_list __l, + const _Compare& __comp = _Compare(), + const allocator_type& __a = allocator_type()) + : _Base(__l, __comp, __a), _Safe_base() { } +#endif + + ~multiset() { } + + multiset& + operator=(const multiset& __x) + { + *static_cast<_Base*>(this) = __x; + this->_M_invalidate_all(); + return *this; + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + multiset& + operator=(multiset&& __x) + { + // NB: DR 675. + clear(); + swap(__x); + return *this; + } + + multiset& + operator=(initializer_list __l) + { + this->clear(); + this->insert(__l); + return *this; + } +#endif + + using _Base::get_allocator; + + // iterators: + iterator + begin() + { return iterator(_Base::begin(), this); } + + const_iterator + begin() const + { return const_iterator(_Base::begin(), this); } + + iterator + end() + { return iterator(_Base::end(), this); } + + const_iterator + end() const + { return const_iterator(_Base::end(), this); } + + reverse_iterator + rbegin() + { return reverse_iterator(end()); } + + const_reverse_iterator + rbegin() const + { return const_reverse_iterator(end()); } + + reverse_iterator + rend() + { return reverse_iterator(begin()); } + + const_reverse_iterator + rend() const + { return const_reverse_iterator(begin()); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + const_iterator + cbegin() const + { return const_iterator(_Base::begin(), this); } + + const_iterator + cend() const + { return const_iterator(_Base::end(), this); } + + const_reverse_iterator + crbegin() const + { return const_reverse_iterator(end()); } + + const_reverse_iterator + crend() const + { return const_reverse_iterator(begin()); } +#endif + + // capacity: + using _Base::empty; + using _Base::size; + using _Base::max_size; + + // modifiers: + iterator + insert(const value_type& __x) + { return iterator(_Base::insert(__x), this); } + + iterator + insert(iterator __position, const value_type& __x) + { + __glibcxx_check_insert(__position); + return iterator(_Base::insert(__position.base(), __x), this); + } + + template + void + insert(_InputIterator __first, _InputIterator __last) + { + __glibcxx_check_valid_range(__first, __last); + _Base::insert(__first, __last); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + void + insert(initializer_list __l) + { _Base::insert(__l); } +#endif + + void + erase(iterator __position) + { + __glibcxx_check_erase(__position); + __position._M_invalidate(); + _Base::erase(__position.base()); + } + + size_type + erase(const key_type& __x) + { + std::pair __victims = this->equal_range(__x); + size_type __count = 0; + while (__victims.first != __victims.second) + { + iterator __victim = __victims.first++; + __victim._M_invalidate(); + _Base::erase(__victim.base()); + ++__count; + } + return __count; + } + + void + erase(iterator __first, iterator __last) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 151. can't currently clear() empty container + __glibcxx_check_erase_range(__first, __last); + while (__first != __last) + this->erase(__first++); + } + + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + swap(multiset&& __x) +#else + swap(multiset& __x) +#endif + { + _Base::swap(__x); + this->_M_swap(__x); + } + + void + clear() + { this->erase(begin(), end()); } + + // observers: + using _Base::key_comp; + using _Base::value_comp; + + // multiset operations: + iterator + find(const key_type& __x) + { return iterator(_Base::find(__x), this); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 214. set::find() missing const overload + const_iterator + find(const key_type& __x) const + { return const_iterator(_Base::find(__x), this); } + + using _Base::count; + + iterator + lower_bound(const key_type& __x) + { return iterator(_Base::lower_bound(__x), this); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 214. set::find() missing const overload + const_iterator + lower_bound(const key_type& __x) const + { return const_iterator(_Base::lower_bound(__x), this); } + + iterator + upper_bound(const key_type& __x) + { return iterator(_Base::upper_bound(__x), this); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 214. set::find() missing const overload + const_iterator + upper_bound(const key_type& __x) const + { return const_iterator(_Base::upper_bound(__x), this); } + + std::pair + equal_range(const key_type& __x) + { + typedef typename _Base::iterator _Base_iterator; + std::pair<_Base_iterator, _Base_iterator> __res = + _Base::equal_range(__x); + return std::make_pair(iterator(__res.first, this), + iterator(__res.second, this)); + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 214. set::find() missing const overload + std::pair + equal_range(const key_type& __x) const + { + typedef typename _Base::const_iterator _Base_iterator; + std::pair<_Base_iterator, _Base_iterator> __res = + _Base::equal_range(__x); + return std::make_pair(const_iterator(__res.first, this), + const_iterator(__res.second, this)); + } + + _Base& + _M_base() { return *this; } + + const _Base& + _M_base() const { return *this; } + + private: + void + _M_invalidate_all() + { + typedef typename _Base::const_iterator _Base_const_iterator; + typedef __gnu_debug::_Not_equal_to<_Base_const_iterator> _Not_equal; + this->_M_invalidate_if(_Not_equal(_M_base().end())); + } + }; + + template + inline bool + operator==(const multiset<_Key, _Compare, _Allocator>& __lhs, + const multiset<_Key, _Compare, _Allocator>& __rhs) + { return __lhs._M_base() == __rhs._M_base(); } + + template + inline bool + operator!=(const multiset<_Key, _Compare, _Allocator>& __lhs, + const multiset<_Key, _Compare, _Allocator>& __rhs) + { return __lhs._M_base() != __rhs._M_base(); } + + template + inline bool + operator<(const multiset<_Key, _Compare, _Allocator>& __lhs, + const multiset<_Key, _Compare, _Allocator>& __rhs) + { return __lhs._M_base() < __rhs._M_base(); } + + template + inline bool + operator<=(const multiset<_Key, _Compare, _Allocator>& __lhs, + const multiset<_Key, _Compare, _Allocator>& __rhs) + { return __lhs._M_base() <= __rhs._M_base(); } + + template + inline bool + operator>=(const multiset<_Key, _Compare, _Allocator>& __lhs, + const multiset<_Key, _Compare, _Allocator>& __rhs) + { return __lhs._M_base() >= __rhs._M_base(); } + + template + inline bool + operator>(const multiset<_Key, _Compare, _Allocator>& __lhs, + const multiset<_Key, _Compare, _Allocator>& __rhs) + { return __lhs._M_base() > __rhs._M_base(); } + + template + void + swap(multiset<_Key, _Compare, _Allocator>& __x, + multiset<_Key, _Compare, _Allocator>& __y) + { return __x.swap(__y); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + void + swap(multiset<_Key, _Compare, _Allocator>&& __x, + multiset<_Key, _Compare, _Allocator>& __y) + { return __x.swap(__y); } + + template + void + swap(multiset<_Key, _Compare, _Allocator>& __x, + multiset<_Key, _Compare, _Allocator>&& __y) + { return __x.swap(__y); } +#endif + +} // namespace __debug +} // namespace std + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/safe_base.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/safe_base.h new file mode 100644 index 00000000..1bef5e7e --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/safe_base.h @@ -0,0 +1,220 @@ +// Safe sequence/iterator base implementation -*- C++ -*- + +// Copyright (C) 2003, 2004, 2005, 2006, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file debug/safe_base.h + * This file is a GNU debug extension to the Standard C++ Library. + */ + +#ifndef _GLIBCXX_DEBUG_SAFE_BASE_H +#define _GLIBCXX_DEBUG_SAFE_BASE_H 1 + +#include + +namespace __gnu_debug +{ + class _Safe_sequence_base; + + /** \brief Basic functionality for a "safe" iterator. + * + * The %_Safe_iterator_base base class implements the functionality + * of a safe iterator that is not specific to a particular iterator + * type. It contains a pointer back to the sequence it references + * along with iterator version information and pointers to form a + * doubly-linked list of iterators referenced by the container. + * + * This class must not perform any operations that can throw an + * exception, or the exception guarantees of derived iterators will + * be broken. + */ + class _Safe_iterator_base + { + public: + /** The sequence this iterator references; may be NULL to indicate + a singular iterator. */ + _Safe_sequence_base* _M_sequence; + + /** The version number of this iterator. The sentinel value 0 is + * used to indicate an invalidated iterator (i.e., one that is + * singular because of an operation on the container). This + * version number must equal the version number in the sequence + * referenced by _M_sequence for the iterator to be + * non-singular. + */ + unsigned int _M_version; + + /** Pointer to the previous iterator in the sequence's list of + iterators. Only valid when _M_sequence != NULL. */ + _Safe_iterator_base* _M_prior; + + /** Pointer to the next iterator in the sequence's list of + iterators. Only valid when _M_sequence != NULL. */ + _Safe_iterator_base* _M_next; + + protected: + /** Initializes the iterator and makes it singular. */ + _Safe_iterator_base() + : _M_sequence(0), _M_version(0), _M_prior(0), _M_next(0) + { } + + /** Initialize the iterator to reference the sequence pointed to + * by @p__seq. @p __constant is true when we are initializing a + * constant iterator, and false if it is a mutable iterator. Note + * that @p __seq may be NULL, in which case the iterator will be + * singular. Otherwise, the iterator will reference @p __seq and + * be nonsingular. + */ + _Safe_iterator_base(const _Safe_sequence_base* __seq, bool __constant) + : _M_sequence(0), _M_version(0), _M_prior(0), _M_next(0) + { this->_M_attach(const_cast<_Safe_sequence_base*>(__seq), __constant); } + + /** Initializes the iterator to reference the same sequence that + @p __x does. @p __constant is true if this is a constant + iterator, and false if it is mutable. */ + _Safe_iterator_base(const _Safe_iterator_base& __x, bool __constant) + : _M_sequence(0), _M_version(0), _M_prior(0), _M_next(0) + { this->_M_attach(__x._M_sequence, __constant); } + + _Safe_iterator_base& + operator=(const _Safe_iterator_base&); + + explicit + _Safe_iterator_base(const _Safe_iterator_base&); + + ~_Safe_iterator_base() { this->_M_detach(); } + + /** For use in _Safe_iterator. */ + __gnu_cxx::__mutex& _M_get_mutex(); + + public: + /** Attaches this iterator to the given sequence, detaching it + * from whatever sequence it was attached to originally. If the + * new sequence is the NULL pointer, the iterator is left + * unattached. + */ + void _M_attach(_Safe_sequence_base* __seq, bool __constant); + + /** Likewise, but not thread-safe. */ + void _M_attach_single(_Safe_sequence_base* __seq, bool __constant); + + /** Detach the iterator for whatever sequence it is attached to, + * if any. + */ + void _M_detach(); + + /** Likewise, but not thread-safe. */ + void _M_detach_single(); + + /** Determines if we are attached to the given sequence. */ + bool _M_attached_to(const _Safe_sequence_base* __seq) const + { return _M_sequence == __seq; } + + /** Is this iterator singular? */ + bool _M_singular() const; + + /** Can we compare this iterator to the given iterator @p __x? + Returns true if both iterators are nonsingular and reference + the same sequence. */ + bool _M_can_compare(const _Safe_iterator_base& __x) const; + }; + + /** + * @brief Base class that supports tracking of iterators that + * reference a sequence. + * + * The %_Safe_sequence_base class provides basic support for + * tracking iterators into a sequence. Sequences that track + * iterators must derived from %_Safe_sequence_base publicly, so + * that safe iterators (which inherit _Safe_iterator_base) can + * attach to them. This class contains two linked lists of + * iterators, one for constant iterators and one for mutable + * iterators, and a version number that allows very fast + * invalidation of all iterators that reference the container. + * + * This class must ensure that no operation on it may throw an + * exception, otherwise "safe" sequences may fail to provide the + * exception-safety guarantees required by the C++ standard. + */ + class _Safe_sequence_base + { + public: + /// The list of mutable iterators that reference this container + _Safe_iterator_base* _M_iterators; + + /// The list of constant iterators that reference this container + _Safe_iterator_base* _M_const_iterators; + + /// The container version number. This number may never be 0. + mutable unsigned int _M_version; + + protected: + // Initialize with a version number of 1 and no iterators + _Safe_sequence_base() + : _M_iterators(0), _M_const_iterators(0), _M_version(1) + { } + + /** Notify all iterators that reference this sequence that the + sequence is being destroyed. */ + ~_Safe_sequence_base() + { this->_M_detach_all(); } + + /** Detach all iterators, leaving them singular. */ + void + _M_detach_all(); + + /** Detach all singular iterators. + * @post for all iterators i attached to this sequence, + * i->_M_version == _M_version. + */ + void + _M_detach_singular(); + + /** Revalidates all attached singular iterators. This method may + * be used to validate iterators that were invalidated before + * (but for some reason, such as an exception, need to become + * valid again). + */ + void + _M_revalidate_singular(); + + /** Swap this sequence with the given sequence. This operation + * also swaps ownership of the iterators, so that when the + * operation is complete all iterators that originally referenced + * one container now reference the other container. + */ + void + _M_swap(_Safe_sequence_base& __x); + + /** For use in _Safe_sequence. */ + __gnu_cxx::__mutex& _M_get_mutex(); + + public: + /** Invalidates all iterators. */ + void + _M_invalidate_all() const + { if (++_M_version == 0) _M_version = 1; } + }; +} // namespace __gnu_debug + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/safe_iterator.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/safe_iterator.h new file mode 100644 index 00000000..dbdb32e2 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/safe_iterator.h @@ -0,0 +1,643 @@ +// Safe iterator implementation -*- C++ -*- + +// Copyright (C) 2003, 2004, 2005, 2006, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file debug/safe_iterator.h + * This file is a GNU debug extension to the Standard C++ Library. + */ + +#ifndef _GLIBCXX_DEBUG_SAFE_ITERATOR_H +#define _GLIBCXX_DEBUG_SAFE_ITERATOR_H 1 + +#include +#include +#include +#include +#include +#include +#include + +namespace __gnu_debug +{ + /** Iterators that derive from _Safe_iterator_base but that aren't + * _Safe_iterators can be determined singular or non-singular via + * _Safe_iterator_base. + */ + inline bool + __check_singular_aux(const _Safe_iterator_base* __x) + { return __x->_M_singular(); } + + /** \brief Safe iterator wrapper. + * + * The class template %_Safe_iterator is a wrapper around an + * iterator that tracks the iterator's movement among sequences and + * checks that operations performed on the "safe" iterator are + * legal. In additional to the basic iterator operations (which are + * validated, and then passed to the underlying iterator), + * %_Safe_iterator has member functions for iterator invalidation, + * attaching/detaching the iterator from sequences, and querying + * the iterator's state. + */ + template + class _Safe_iterator : public _Safe_iterator_base + { + typedef _Safe_iterator _Self; + + /** The precision to which we can calculate the distance between + * two iterators. + */ + enum _Distance_precision + { + __dp_equality, //< Can compare iterator equality, only + __dp_sign, //< Can determine equality and ordering + __dp_exact //< Can determine distance precisely + }; + + /// The underlying iterator + _Iterator _M_current; + + /// Determine if this is a constant iterator. + bool + _M_constant() const + { + typedef typename _Sequence::const_iterator const_iterator; + return __is_same::value; + } + + typedef std::iterator_traits<_Iterator> _Traits; + + public: + typedef _Iterator _Base_iterator; + typedef typename _Traits::iterator_category iterator_category; + typedef typename _Traits::value_type value_type; + typedef typename _Traits::difference_type difference_type; + typedef typename _Traits::reference reference; + typedef typename _Traits::pointer pointer; + + /// @post the iterator is singular and unattached + _Safe_iterator() : _M_current() { } + + /** + * @brief Safe iterator construction from an unsafe iterator and + * its sequence. + * + * @pre @p seq is not NULL + * @post this is not singular + */ + _Safe_iterator(const _Iterator& __i, const _Sequence* __seq) + : _Safe_iterator_base(__seq, _M_constant()), _M_current(__i) + { + _GLIBCXX_DEBUG_VERIFY(! this->_M_singular(), + _M_message(__msg_init_singular) + ._M_iterator(*this, "this")); + } + + /** + * @brief Copy construction. + * @pre @p x is not singular + */ + _Safe_iterator(const _Safe_iterator& __x) + : _Safe_iterator_base(__x, _M_constant()), _M_current(__x._M_current) + { + _GLIBCXX_DEBUG_VERIFY(!__x._M_singular(), + _M_message(__msg_init_copy_singular) + ._M_iterator(*this, "this") + ._M_iterator(__x, "other")); + } + + /** + * @brief Converting constructor from a mutable iterator to a + * constant iterator. + * + * @pre @p x is not singular + */ + template + _Safe_iterator( + const _Safe_iterator<_MutableIterator, + typename __gnu_cxx::__enable_if<(std::__are_same<_MutableIterator, + typename _Sequence::iterator::_Base_iterator>::__value), + _Sequence>::__type>& __x) + : _Safe_iterator_base(__x, _M_constant()), _M_current(__x.base()) + { + _GLIBCXX_DEBUG_VERIFY(!__x._M_singular(), + _M_message(__msg_init_const_singular) + ._M_iterator(*this, "this") + ._M_iterator(__x, "other")); + } + + /** + * @brief Copy assignment. + * @pre @p x is not singular + */ + _Safe_iterator& + operator=(const _Safe_iterator& __x) + { + _GLIBCXX_DEBUG_VERIFY(!__x._M_singular(), + _M_message(__msg_copy_singular) + ._M_iterator(*this, "this") + ._M_iterator(__x, "other")); + _M_current = __x._M_current; + this->_M_attach(static_cast<_Sequence*>(__x._M_sequence)); + return *this; + } + + /** + * @brief Iterator dereference. + * @pre iterator is dereferenceable + */ + reference + operator*() const + { + + _GLIBCXX_DEBUG_VERIFY(this->_M_dereferenceable(), + _M_message(__msg_bad_deref) + ._M_iterator(*this, "this")); + return *_M_current; + } + + /** + * @brief Iterator dereference. + * @pre iterator is dereferenceable + * @todo Make this correct w.r.t. iterators that return proxies + * @todo Use addressof() instead of & operator + */ + pointer + operator->() const + { + _GLIBCXX_DEBUG_VERIFY(this->_M_dereferenceable(), + _M_message(__msg_bad_deref) + ._M_iterator(*this, "this")); + return &*_M_current; + } + + // ------ Input iterator requirements ------ + /** + * @brief Iterator preincrement + * @pre iterator is incrementable + */ + _Safe_iterator& + operator++() + { + _GLIBCXX_DEBUG_VERIFY(this->_M_incrementable(), + _M_message(__msg_bad_inc) + ._M_iterator(*this, "this")); + ++_M_current; + return *this; + } + + /** + * @brief Iterator postincrement + * @pre iterator is incrementable + */ + _Safe_iterator + operator++(int) + { + _GLIBCXX_DEBUG_VERIFY(this->_M_incrementable(), + _M_message(__msg_bad_inc) + ._M_iterator(*this, "this")); + _Safe_iterator __tmp(*this); + ++_M_current; + return __tmp; + } + + // ------ Bidirectional iterator requirements ------ + /** + * @brief Iterator predecrement + * @pre iterator is decrementable + */ + _Safe_iterator& + operator--() + { + _GLIBCXX_DEBUG_VERIFY(this->_M_decrementable(), + _M_message(__msg_bad_dec) + ._M_iterator(*this, "this")); + --_M_current; + return *this; + } + + /** + * @brief Iterator postdecrement + * @pre iterator is decrementable + */ + _Safe_iterator + operator--(int) + { + _GLIBCXX_DEBUG_VERIFY(this->_M_decrementable(), + _M_message(__msg_bad_dec) + ._M_iterator(*this, "this")); + _Safe_iterator __tmp(*this); + --_M_current; + return __tmp; + } + + // ------ Random access iterator requirements ------ + reference + operator[](const difference_type& __n) const + { + _GLIBCXX_DEBUG_VERIFY(this->_M_can_advance(__n) + && this->_M_can_advance(__n+1), + _M_message(__msg_iter_subscript_oob) + ._M_iterator(*this)._M_integer(__n)); + + return _M_current[__n]; + } + + _Safe_iterator& + operator+=(const difference_type& __n) + { + _GLIBCXX_DEBUG_VERIFY(this->_M_can_advance(__n), + _M_message(__msg_advance_oob) + ._M_iterator(*this)._M_integer(__n)); + _M_current += __n; + return *this; + } + + _Safe_iterator + operator+(const difference_type& __n) const + { + _Safe_iterator __tmp(*this); + __tmp += __n; + return __tmp; + } + + _Safe_iterator& + operator-=(const difference_type& __n) + { + _GLIBCXX_DEBUG_VERIFY(this->_M_can_advance(-__n), + _M_message(__msg_retreat_oob) + ._M_iterator(*this)._M_integer(__n)); + _M_current += -__n; + return *this; + } + + _Safe_iterator + operator-(const difference_type& __n) const + { + _Safe_iterator __tmp(*this); + __tmp -= __n; + return __tmp; + } + + // ------ Utilities ------ + /** + * @brief Return the underlying iterator + */ + _Iterator + base() const { return _M_current; } + + /** + * @brief Conversion to underlying non-debug iterator to allow + * better interaction with non-debug containers. + */ + operator _Iterator() const { return _M_current; } + + /** Attach iterator to the given sequence. */ + void + _M_attach(const _Sequence* __seq) + { + _Safe_iterator_base::_M_attach(const_cast<_Sequence*>(__seq), + _M_constant()); + } + + /** Likewise, but not thread-safe. */ + void + _M_attach_single(const _Sequence* __seq) + { + _Safe_iterator_base::_M_attach_single(const_cast<_Sequence*>(__seq), + _M_constant()); + } + + /** Invalidate the iterator, making it singular. */ + void + _M_invalidate(); + + /** Likewise, but not thread-safe. */ + void + _M_invalidate_single(); + + /// Is the iterator dereferenceable? + bool + _M_dereferenceable() const + { return !this->_M_singular() && !_M_is_end(); } + + /// Is the iterator incrementable? + bool + _M_incrementable() const { return this->_M_dereferenceable(); } + + // Is the iterator decrementable? + bool + _M_decrementable() const { return !_M_singular() && !_M_is_begin(); } + + // Can we advance the iterator @p __n steps (@p __n may be negative) + bool + _M_can_advance(const difference_type& __n) const; + + // Is the iterator range [*this, __rhs) valid? + template + bool + _M_valid_range(const _Safe_iterator<_Other, _Sequence>& __rhs) const; + + // The sequence this iterator references. + const _Sequence* + _M_get_sequence() const + { return static_cast(_M_sequence); } + + /** Determine the distance between two iterators with some known + * precision. + */ + template + static std::pair + _M_get_distance(const _Iterator1& __lhs, const _Iterator2& __rhs) + { + typedef typename std::iterator_traits<_Iterator1>::iterator_category + _Category; + return _M_get_distance(__lhs, __rhs, _Category()); + } + + template + static std::pair + _M_get_distance(const _Iterator1& __lhs, const _Iterator2& __rhs, + std::random_access_iterator_tag) + { + return std::make_pair(__rhs.base() - __lhs.base(), __dp_exact); + } + + template + static std::pair + _M_get_distance(const _Iterator1& __lhs, const _Iterator2& __rhs, + std::forward_iterator_tag) + { + return std::make_pair(__lhs.base() == __rhs.base()? 0 : 1, + __dp_equality); + } + + /// Is this iterator equal to the sequence's begin() iterator? + bool _M_is_begin() const + { return *this == static_cast(_M_sequence)->begin(); } + + /// Is this iterator equal to the sequence's end() iterator? + bool _M_is_end() const + { return *this == static_cast(_M_sequence)->end(); } + }; + + template + inline bool + operator==(const _Safe_iterator<_IteratorL, _Sequence>& __lhs, + const _Safe_iterator<_IteratorR, _Sequence>& __rhs) + { + _GLIBCXX_DEBUG_VERIFY(! __lhs._M_singular() && ! __rhs._M_singular(), + _M_message(__msg_iter_compare_bad) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + _GLIBCXX_DEBUG_VERIFY(__lhs._M_can_compare(__rhs), + _M_message(__msg_compare_different) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + return __lhs.base() == __rhs.base(); + } + + template + inline bool + operator==(const _Safe_iterator<_Iterator, _Sequence>& __lhs, + const _Safe_iterator<_Iterator, _Sequence>& __rhs) + { + _GLIBCXX_DEBUG_VERIFY(! __lhs._M_singular() && ! __rhs._M_singular(), + _M_message(__msg_iter_compare_bad) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + _GLIBCXX_DEBUG_VERIFY(__lhs._M_can_compare(__rhs), + _M_message(__msg_compare_different) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + return __lhs.base() == __rhs.base(); + } + + template + inline bool + operator!=(const _Safe_iterator<_IteratorL, _Sequence>& __lhs, + const _Safe_iterator<_IteratorR, _Sequence>& __rhs) + { + _GLIBCXX_DEBUG_VERIFY(! __lhs._M_singular() && ! __rhs._M_singular(), + _M_message(__msg_iter_compare_bad) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + _GLIBCXX_DEBUG_VERIFY(__lhs._M_can_compare(__rhs), + _M_message(__msg_compare_different) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + return __lhs.base() != __rhs.base(); + } + + template + inline bool + operator!=(const _Safe_iterator<_Iterator, _Sequence>& __lhs, + const _Safe_iterator<_Iterator, _Sequence>& __rhs) + { + _GLIBCXX_DEBUG_VERIFY(! __lhs._M_singular() && ! __rhs._M_singular(), + _M_message(__msg_iter_compare_bad) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + _GLIBCXX_DEBUG_VERIFY(__lhs._M_can_compare(__rhs), + _M_message(__msg_compare_different) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + return __lhs.base() != __rhs.base(); + } + + template + inline bool + operator<(const _Safe_iterator<_IteratorL, _Sequence>& __lhs, + const _Safe_iterator<_IteratorR, _Sequence>& __rhs) + { + _GLIBCXX_DEBUG_VERIFY(! __lhs._M_singular() && ! __rhs._M_singular(), + _M_message(__msg_iter_order_bad) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + _GLIBCXX_DEBUG_VERIFY(__lhs._M_can_compare(__rhs), + _M_message(__msg_order_different) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + return __lhs.base() < __rhs.base(); + } + + template + inline bool + operator<(const _Safe_iterator<_Iterator, _Sequence>& __lhs, + const _Safe_iterator<_Iterator, _Sequence>& __rhs) + { + _GLIBCXX_DEBUG_VERIFY(! __lhs._M_singular() && ! __rhs._M_singular(), + _M_message(__msg_iter_order_bad) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + _GLIBCXX_DEBUG_VERIFY(__lhs._M_can_compare(__rhs), + _M_message(__msg_order_different) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + return __lhs.base() < __rhs.base(); + } + + template + inline bool + operator<=(const _Safe_iterator<_IteratorL, _Sequence>& __lhs, + const _Safe_iterator<_IteratorR, _Sequence>& __rhs) + { + _GLIBCXX_DEBUG_VERIFY(! __lhs._M_singular() && ! __rhs._M_singular(), + _M_message(__msg_iter_order_bad) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + _GLIBCXX_DEBUG_VERIFY(__lhs._M_can_compare(__rhs), + _M_message(__msg_order_different) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + return __lhs.base() <= __rhs.base(); + } + + template + inline bool + operator<=(const _Safe_iterator<_Iterator, _Sequence>& __lhs, + const _Safe_iterator<_Iterator, _Sequence>& __rhs) + { + _GLIBCXX_DEBUG_VERIFY(! __lhs._M_singular() && ! __rhs._M_singular(), + _M_message(__msg_iter_order_bad) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + _GLIBCXX_DEBUG_VERIFY(__lhs._M_can_compare(__rhs), + _M_message(__msg_order_different) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + return __lhs.base() <= __rhs.base(); + } + + template + inline bool + operator>(const _Safe_iterator<_IteratorL, _Sequence>& __lhs, + const _Safe_iterator<_IteratorR, _Sequence>& __rhs) + { + _GLIBCXX_DEBUG_VERIFY(! __lhs._M_singular() && ! __rhs._M_singular(), + _M_message(__msg_iter_order_bad) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + _GLIBCXX_DEBUG_VERIFY(__lhs._M_can_compare(__rhs), + _M_message(__msg_order_different) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + return __lhs.base() > __rhs.base(); + } + + template + inline bool + operator>(const _Safe_iterator<_Iterator, _Sequence>& __lhs, + const _Safe_iterator<_Iterator, _Sequence>& __rhs) + { + _GLIBCXX_DEBUG_VERIFY(! __lhs._M_singular() && ! __rhs._M_singular(), + _M_message(__msg_iter_order_bad) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + _GLIBCXX_DEBUG_VERIFY(__lhs._M_can_compare(__rhs), + _M_message(__msg_order_different) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + return __lhs.base() > __rhs.base(); + } + + template + inline bool + operator>=(const _Safe_iterator<_IteratorL, _Sequence>& __lhs, + const _Safe_iterator<_IteratorR, _Sequence>& __rhs) + { + _GLIBCXX_DEBUG_VERIFY(! __lhs._M_singular() && ! __rhs._M_singular(), + _M_message(__msg_iter_order_bad) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + _GLIBCXX_DEBUG_VERIFY(__lhs._M_can_compare(__rhs), + _M_message(__msg_order_different) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + return __lhs.base() >= __rhs.base(); + } + + template + inline bool + operator>=(const _Safe_iterator<_Iterator, _Sequence>& __lhs, + const _Safe_iterator<_Iterator, _Sequence>& __rhs) + { + _GLIBCXX_DEBUG_VERIFY(! __lhs._M_singular() && ! __rhs._M_singular(), + _M_message(__msg_iter_order_bad) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + _GLIBCXX_DEBUG_VERIFY(__lhs._M_can_compare(__rhs), + _M_message(__msg_order_different) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + return __lhs.base() >= __rhs.base(); + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // According to the resolution of DR179 not only the various comparison + // operators but also operator- must accept mixed iterator/const_iterator + // parameters. + template + inline typename _Safe_iterator<_IteratorL, _Sequence>::difference_type + operator-(const _Safe_iterator<_IteratorL, _Sequence>& __lhs, + const _Safe_iterator<_IteratorR, _Sequence>& __rhs) + { + _GLIBCXX_DEBUG_VERIFY(! __lhs._M_singular() && ! __rhs._M_singular(), + _M_message(__msg_distance_bad) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + _GLIBCXX_DEBUG_VERIFY(__lhs._M_can_compare(__rhs), + _M_message(__msg_distance_different) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + return __lhs.base() - __rhs.base(); + } + + template + inline typename _Safe_iterator<_Iterator, _Sequence>::difference_type + operator-(const _Safe_iterator<_Iterator, _Sequence>& __lhs, + const _Safe_iterator<_Iterator, _Sequence>& __rhs) + { + _GLIBCXX_DEBUG_VERIFY(! __lhs._M_singular() && ! __rhs._M_singular(), + _M_message(__msg_distance_bad) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + _GLIBCXX_DEBUG_VERIFY(__lhs._M_can_compare(__rhs), + _M_message(__msg_distance_different) + ._M_iterator(__lhs, "lhs") + ._M_iterator(__rhs, "rhs")); + return __lhs.base() - __rhs.base(); + } + + template + inline _Safe_iterator<_Iterator, _Sequence> + operator+(typename _Safe_iterator<_Iterator,_Sequence>::difference_type __n, + const _Safe_iterator<_Iterator, _Sequence>& __i) + { return __i + __n; } +} // namespace __gnu_debug + +#ifndef _GLIBCXX_EXPORT_TEMPLATE +# include +#endif + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/safe_iterator.tcc b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/safe_iterator.tcc new file mode 100644 index 00000000..d4f2aee5 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/safe_iterator.tcc @@ -0,0 +1,143 @@ +// Debugging iterator implementation (out of line) -*- C++ -*- + +// Copyright (C) 2003, 2004, 2005, 2006, 2007, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file debug/safe_iterator.tcc + * This file is a GNU debug extension to the Standard C++ Library. + */ + +#ifndef _GLIBCXX_DEBUG_SAFE_ITERATOR_TCC +#define _GLIBCXX_DEBUG_SAFE_ITERATOR_TCC 1 + +namespace __gnu_debug +{ + template + bool + _Safe_iterator<_Iterator, _Sequence>:: + _M_can_advance(const difference_type& __n) const + { + typedef typename _Sequence::const_iterator const_iterator; + + if (this->_M_singular()) + return false; + if (__n == 0) + return true; + if (__n < 0) + { + const_iterator __begin = + static_cast(_M_sequence)->begin(); + std::pair __dist = + this->_M_get_distance(__begin, *this); + bool __ok = ((__dist.second == __dp_exact && __dist.first >= -__n) + || (__dist.second != __dp_exact && __dist.first > 0)); + return __ok; + } + else + { + const_iterator __end = + static_cast(_M_sequence)->end(); + std::pair __dist = + this->_M_get_distance(*this, __end); + bool __ok = ((__dist.second == __dp_exact && __dist.first >= __n) + || (__dist.second != __dp_exact && __dist.first > 0)); + return __ok; + } + } + + template + template + bool + _Safe_iterator<_Iterator, _Sequence>:: + _M_valid_range(const _Safe_iterator<_Other, _Sequence>& __rhs) const + { + if (!_M_can_compare(__rhs)) + return false; + + /* Determine if we can order the iterators without the help of + the container */ + std::pair __dist = + this->_M_get_distance(*this, __rhs); + switch (__dist.second) { + case __dp_equality: + if (__dist.first == 0) + return true; + break; + + case __dp_sign: + case __dp_exact: + return __dist.first >= 0; + } + + /* We can only test for equality, but check if one of the + iterators is at an extreme. */ + if (_M_is_begin() || __rhs._M_is_end()) + return true; + else if (_M_is_end() || __rhs._M_is_begin()) + return false; + + // Assume that this is a valid range; we can't check anything else + return true; + } + + template + void + _Safe_iterator<_Iterator, _Sequence>:: + _M_invalidate() + { + __gnu_cxx::__scoped_lock sentry(this->_M_get_mutex()); + _M_invalidate_single(); + } + + template + void + _Safe_iterator<_Iterator, _Sequence>:: + _M_invalidate_single() + { + typedef typename _Sequence::iterator iterator; + typedef typename _Sequence::const_iterator const_iterator; + + if (!this->_M_singular()) + { + for (_Safe_iterator_base* __iter = _M_sequence->_M_iterators; + __iter; __iter = __iter->_M_next) + { + iterator* __victim = static_cast(__iter); + if (this->base() == __victim->base()) + __victim->_M_version = 0; + } + + for (_Safe_iterator_base* __iter2 = _M_sequence->_M_const_iterators; + __iter2; __iter2 = __iter2->_M_next) + { + const_iterator* __victim = static_cast(__iter2); + if (__victim->base() == this->base()) + __victim->_M_version = 0; + } + _M_version = 0; + } + } +} // namespace __gnu_debug + +#endif + diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/safe_sequence.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/safe_sequence.h new file mode 100644 index 00000000..bbeac1d7 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/safe_sequence.h @@ -0,0 +1,183 @@ +// Safe sequence implementation -*- C++ -*- + +// Copyright (C) 2003, 2004, 2005, 2006, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file debug/safe_sequence.h + * This file is a GNU debug extension to the Standard C++ Library. + */ + +#ifndef _GLIBCXX_DEBUG_SAFE_SEQUENCE_H +#define _GLIBCXX_DEBUG_SAFE_SEQUENCE_H 1 + +#include +#include +#include +#include + +namespace __gnu_debug +{ + template + class _Safe_iterator; + + /** A simple function object that returns true if the passed-in + * value is not equal to the stored value. It saves typing over + * using both bind1st and not_equal. + */ + template + class _Not_equal_to + { + _Type __value; + + public: + explicit _Not_equal_to(const _Type& __v) : __value(__v) { } + + bool + operator()(const _Type& __x) const + { return __value != __x; } + }; + + /** A function object that returns true when the given random access + iterator is at least @c n steps away from the given iterator. */ + template + class _After_nth_from + { + typedef typename std::iterator_traits<_Iterator>::difference_type + difference_type; + + _Iterator _M_base; + difference_type _M_n; + + public: + _After_nth_from(const difference_type& __n, const _Iterator& __base) + : _M_base(__base), _M_n(__n) { } + + bool + operator()(const _Iterator& __x) const + { return __x - _M_base >= _M_n; } + }; + + /** + * @brief Base class for constructing a "safe" sequence type that + * tracks iterators that reference it. + * + * The class template %_Safe_sequence simplifies the construction of + * "safe" sequences that track the iterators that reference the + * sequence, so that the iterators are notified of changes in the + * sequence that may affect their operation, e.g., if the container + * invalidates its iterators or is destructed. This class template + * may only be used by deriving from it and passing the name of the + * derived class as its template parameter via the curiously + * recurring template pattern. The derived class must have @c + * iterator and @const_iterator types that are instantiations of + * class template _Safe_iterator for this sequence. Iterators will + * then be tracked automatically. + */ + template + class _Safe_sequence : public _Safe_sequence_base + { + public: + /** Invalidates all iterators @c x that reference this sequence, + are not singular, and for which @c pred(x) returns @c + true. The user of this routine should be careful not to make + copies of the iterators passed to @p pred, as the copies may + interfere with the invalidation. */ + template + void + _M_invalidate_if(_Predicate __pred); + + /** Transfers all iterators that reference this memory location + to this sequence from whatever sequence they are attached + to. */ + template + void + _M_transfer_iter(const _Safe_iterator<_Iterator, _Sequence>& __x); + }; + + template + template + void + _Safe_sequence<_Sequence>:: + _M_invalidate_if(_Predicate __pred) + { + typedef typename _Sequence::iterator iterator; + typedef typename _Sequence::const_iterator const_iterator; + + __gnu_cxx::__scoped_lock sentry(this->_M_get_mutex()); + for (_Safe_iterator_base* __iter = _M_iterators; __iter;) + { + iterator* __victim = static_cast(__iter); + __iter = __iter->_M_next; + if (!__victim->_M_singular()) + { + if (__pred(__victim->base())) + __victim->_M_invalidate_single(); + } + } + + for (_Safe_iterator_base* __iter2 = _M_const_iterators; __iter2;) + { + const_iterator* __victim = static_cast(__iter2); + __iter2 = __iter2->_M_next; + if (!__victim->_M_singular()) + { + if (__pred(__victim->base())) + __victim->_M_invalidate_single(); + } + } + } + + template + template + void + _Safe_sequence<_Sequence>:: + _M_transfer_iter(const _Safe_iterator<_Iterator, _Sequence>& __x) + { + _Safe_sequence_base* __from = __x._M_sequence; + if (!__from) + return; + + typedef typename _Sequence::iterator iterator; + typedef typename _Sequence::const_iterator const_iterator; + + __gnu_cxx::__scoped_lock sentry(this->_M_get_mutex()); + for (_Safe_iterator_base* __iter = __from->_M_iterators; __iter;) + { + iterator* __victim = static_cast(__iter); + __iter = __iter->_M_next; + if (!__victim->_M_singular() && __victim->base() == __x.base()) + __victim->_M_attach_single(static_cast<_Sequence*>(this)); + } + + for (_Safe_iterator_base* __iter2 = __from->_M_const_iterators; + __iter2;) + { + const_iterator* __victim = static_cast(__iter2); + __iter2 = __iter2->_M_next; + if (!__victim->_M_singular() && __victim->base() == __x.base()) + __victim->_M_attach_single(static_cast<_Sequence*>(this)); + } + } +} // namespace __gnu_debug + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/set b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/set new file mode 100644 index 00000000..34f3ea5e --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/set @@ -0,0 +1,37 @@ +// Debugging set/multiset implementation -*- C++ -*- + +// Copyright (C) 2003, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file debug/set + * This file is a GNU debug extension to the Standard C++ Library. + */ + +#ifndef _GLIBCXX_DEBUG_SET +#define _GLIBCXX_DEBUG_SET 1 + +#include +#include +#include + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/set.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/set.h new file mode 100644 index 00000000..a025b3de --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/set.h @@ -0,0 +1,401 @@ +// Debugging set implementation -*- C++ -*- + +// Copyright (C) 2003, 2004, 2005, 2006, 2007, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file debug/set.h + * This file is a GNU debug extension to the Standard C++ Library. + */ + +#ifndef _GLIBCXX_DEBUG_SET_H +#define _GLIBCXX_DEBUG_SET_H 1 + +#include +#include +#include + +namespace std +{ +namespace __debug +{ + template, + typename _Allocator = std::allocator<_Key> > + class set + : public _GLIBCXX_STD_D::set<_Key,_Compare,_Allocator>, + public __gnu_debug::_Safe_sequence > + { + typedef _GLIBCXX_STD_D::set<_Key, _Compare, _Allocator> _Base; + typedef __gnu_debug::_Safe_sequence _Safe_base; + + public: + // types: + typedef _Key key_type; + typedef _Key value_type; + typedef _Compare key_compare; + typedef _Compare value_compare; + typedef _Allocator allocator_type; + typedef typename _Base::reference reference; + typedef typename _Base::const_reference const_reference; + + typedef __gnu_debug::_Safe_iterator + iterator; + typedef __gnu_debug::_Safe_iterator + const_iterator; + + typedef typename _Base::size_type size_type; + typedef typename _Base::difference_type difference_type; + typedef typename _Base::pointer pointer; + typedef typename _Base::const_pointer const_pointer; + typedef std::reverse_iterator reverse_iterator; + typedef std::reverse_iterator const_reverse_iterator; + + // 23.3.3.1 construct/copy/destroy: + explicit set(const _Compare& __comp = _Compare(), + const _Allocator& __a = _Allocator()) + : _Base(__comp, __a) { } + + template + set(_InputIterator __first, _InputIterator __last, + const _Compare& __comp = _Compare(), + const _Allocator& __a = _Allocator()) + : _Base(__gnu_debug::__check_valid_range(__first, __last), __last, + __comp, __a) { } + + set(const set& __x) + : _Base(__x), _Safe_base() { } + + set(const _Base& __x) + : _Base(__x), _Safe_base() { } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + set(set&& __x) + : _Base(std::forward(__x)), _Safe_base() + { this->_M_swap(__x); } + + set(initializer_list __l, + const _Compare& __comp = _Compare(), + const allocator_type& __a = allocator_type()) + : _Base(__l, __comp, __a), _Safe_base() { } +#endif + + ~set() { } + + set& + operator=(const set& __x) + { + *static_cast<_Base*>(this) = __x; + this->_M_invalidate_all(); + return *this; + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + set& + operator=(set&& __x) + { + // NB: DR 675. + clear(); + swap(__x); + return *this; + } + + set& + operator=(initializer_list __l) + { + this->clear(); + this->insert(__l); + return *this; + } +#endif + + using _Base::get_allocator; + + // iterators: + iterator + begin() + { return iterator(_Base::begin(), this); } + + const_iterator + begin() const + { return const_iterator(_Base::begin(), this); } + + iterator + end() + { return iterator(_Base::end(), this); } + + const_iterator + end() const + { return const_iterator(_Base::end(), this); } + + reverse_iterator + rbegin() + { return reverse_iterator(end()); } + + const_reverse_iterator + rbegin() const + { return const_reverse_iterator(end()); } + + reverse_iterator + rend() + { return reverse_iterator(begin()); } + + const_reverse_iterator + rend() const + { return const_reverse_iterator(begin()); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + const_iterator + cbegin() const + { return const_iterator(_Base::begin(), this); } + + const_iterator + cend() const + { return const_iterator(_Base::end(), this); } + + const_reverse_iterator + crbegin() const + { return const_reverse_iterator(end()); } + + const_reverse_iterator + crend() const + { return const_reverse_iterator(begin()); } +#endif + + // capacity: + using _Base::empty; + using _Base::size; + using _Base::max_size; + + // modifiers: + std::pair + insert(const value_type& __x) + { + typedef typename _Base::iterator _Base_iterator; + std::pair<_Base_iterator, bool> __res = _Base::insert(__x); + return std::pair(iterator(__res.first, this), + __res.second); + } + + iterator + insert(iterator __position, const value_type& __x) + { + __glibcxx_check_insert(__position); + return iterator(_Base::insert(__position.base(), __x), this); + } + + template + void + insert(_InputIterator __first, _InputIterator __last) + { + __glibcxx_check_valid_range(__first, __last); + _Base::insert(__first, __last); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + void + insert(initializer_list __l) + { _Base::insert(__l); } +#endif + + void + erase(iterator __position) + { + __glibcxx_check_erase(__position); + __position._M_invalidate(); + _Base::erase(__position.base()); + } + + size_type + erase(const key_type& __x) + { + iterator __victim = find(__x); + if (__victim == end()) + return 0; + else + { + __victim._M_invalidate(); + _Base::erase(__victim.base()); + return 1; + } + } + + void + erase(iterator __first, iterator __last) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 151. can't currently clear() empty container + __glibcxx_check_erase_range(__first, __last); + + while (__first != __last) + this->erase(__first++); + } + + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + swap(set&& __x) +#else + swap(set& __x) +#endif + { + _Base::swap(__x); + this->_M_swap(__x); + } + + void + clear() + { this->erase(begin(), end()); } + + // observers: + using _Base::key_comp; + using _Base::value_comp; + + // set operations: + iterator + find(const key_type& __x) + { return iterator(_Base::find(__x), this); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 214. set::find() missing const overload + const_iterator + find(const key_type& __x) const + { return const_iterator(_Base::find(__x), this); } + + using _Base::count; + + iterator + lower_bound(const key_type& __x) + { return iterator(_Base::lower_bound(__x), this); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 214. set::find() missing const overload + const_iterator + lower_bound(const key_type& __x) const + { return const_iterator(_Base::lower_bound(__x), this); } + + iterator + upper_bound(const key_type& __x) + { return iterator(_Base::upper_bound(__x), this); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 214. set::find() missing const overload + const_iterator + upper_bound(const key_type& __x) const + { return const_iterator(_Base::upper_bound(__x), this); } + + std::pair + equal_range(const key_type& __x) + { + typedef typename _Base::iterator _Base_iterator; + std::pair<_Base_iterator, _Base_iterator> __res = + _Base::equal_range(__x); + return std::make_pair(iterator(__res.first, this), + iterator(__res.second, this)); + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 214. set::find() missing const overload + std::pair + equal_range(const key_type& __x) const + { + typedef typename _Base::const_iterator _Base_iterator; + std::pair<_Base_iterator, _Base_iterator> __res = + _Base::equal_range(__x); + return std::make_pair(const_iterator(__res.first, this), + const_iterator(__res.second, this)); + } + + _Base& + _M_base() { return *this; } + + const _Base& + _M_base() const { return *this; } + + private: + void + _M_invalidate_all() + { + typedef typename _Base::const_iterator _Base_const_iterator; + typedef __gnu_debug::_Not_equal_to<_Base_const_iterator> _Not_equal; + this->_M_invalidate_if(_Not_equal(_M_base().end())); + } + }; + + template + inline bool + operator==(const set<_Key, _Compare, _Allocator>& __lhs, + const set<_Key, _Compare, _Allocator>& __rhs) + { return __lhs._M_base() == __rhs._M_base(); } + + template + inline bool + operator!=(const set<_Key, _Compare, _Allocator>& __lhs, + const set<_Key, _Compare, _Allocator>& __rhs) + { return __lhs._M_base() != __rhs._M_base(); } + + template + inline bool + operator<(const set<_Key, _Compare, _Allocator>& __lhs, + const set<_Key, _Compare, _Allocator>& __rhs) + { return __lhs._M_base() < __rhs._M_base(); } + + template + inline bool + operator<=(const set<_Key, _Compare, _Allocator>& __lhs, + const set<_Key, _Compare, _Allocator>& __rhs) + { return __lhs._M_base() <= __rhs._M_base(); } + + template + inline bool + operator>=(const set<_Key, _Compare, _Allocator>& __lhs, + const set<_Key, _Compare, _Allocator>& __rhs) + { return __lhs._M_base() >= __rhs._M_base(); } + + template + inline bool + operator>(const set<_Key, _Compare, _Allocator>& __lhs, + const set<_Key, _Compare, _Allocator>& __rhs) + { return __lhs._M_base() > __rhs._M_base(); } + + template + void + swap(set<_Key, _Compare, _Allocator>& __x, + set<_Key, _Compare, _Allocator>& __y) + { return __x.swap(__y); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + void + swap(set<_Key, _Compare, _Allocator>&& __x, + set<_Key, _Compare, _Allocator>& __y) + { return __x.swap(__y); } + + template + void + swap(set<_Key, _Compare, _Allocator>& __x, + set<_Key, _Compare, _Allocator>&& __y) + { return __x.swap(__y); } +#endif + +} // namespace __debug +} // namespace std + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/string b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/string new file mode 100644 index 00000000..d88989ad --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/string @@ -0,0 +1,1074 @@ +// Debugging string implementation -*- C++ -*- + +// Copyright (C) 2003, 2005, 2006, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file debug/string + * This file is a GNU debug extension to the Standard C++ Library. + */ + +#ifndef _GLIBCXX_DEBUG_STRING +#define _GLIBCXX_DEBUG_STRING 1 + +#include +#include +#include + +namespace __gnu_debug +{ + template, + typename _Allocator = std::allocator<_CharT> > + class basic_string + : public std::basic_string<_CharT, _Traits, _Allocator>, + public __gnu_debug::_Safe_sequence > + { + typedef std::basic_string<_CharT, _Traits, _Allocator> _Base; + typedef __gnu_debug::_Safe_sequence _Safe_base; + + public: + // types: + typedef _Traits traits_type; + typedef typename _Traits::char_type value_type; + typedef _Allocator allocator_type; + typedef typename _Base::size_type size_type; + typedef typename _Base::difference_type difference_type; + typedef typename _Base::reference reference; + typedef typename _Base::const_reference const_reference; + typedef typename _Base::pointer pointer; + typedef typename _Base::const_pointer const_pointer; + + typedef __gnu_debug::_Safe_iterator + iterator; + typedef __gnu_debug::_Safe_iterator const_iterator; + + typedef std::reverse_iterator reverse_iterator; + typedef std::reverse_iterator const_reverse_iterator; + + using _Base::npos; + + // 21.3.1 construct/copy/destroy: + explicit basic_string(const _Allocator& __a = _Allocator()) + : _Base(__a) + { } + + // Provides conversion from a release-mode string to a debug-mode string + basic_string(const _Base& __base) : _Base(__base), _Safe_base() { } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 42. string ctors specify wrong default allocator + basic_string(const basic_string& __str) + : _Base(__str, 0, _Base::npos, __str.get_allocator()), _Safe_base() + { } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 42. string ctors specify wrong default allocator + basic_string(const basic_string& __str, size_type __pos, + size_type __n = _Base::npos, + const _Allocator& __a = _Allocator()) + : _Base(__str, __pos, __n, __a) + { } + + basic_string(const _CharT* __s, size_type __n, + const _Allocator& __a = _Allocator()) + : _Base(__gnu_debug::__check_string(__s, __n), __n, __a) + { } + + basic_string(const _CharT* __s, const _Allocator& __a = _Allocator()) + : _Base(__gnu_debug::__check_string(__s), __a) + { this->assign(__s); } + + basic_string(size_type __n, _CharT __c, + const _Allocator& __a = _Allocator()) + : _Base(__n, __c, __a) + { } + + template + basic_string(_InputIterator __begin, _InputIterator __end, + const _Allocator& __a = _Allocator()) + : _Base(__gnu_debug::__check_valid_range(__begin, __end), __end, __a) + { } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + basic_string(initializer_list<_CharT> __l, const _Alloc& __a = _Alloc()) + : _Base(__l, __a) + { } +#endif // __GXX_EXPERIMENTAL_CXX0X__ + + ~basic_string() { } + + basic_string& + operator=(const basic_string& __str) + { + *static_cast<_Base*>(this) = __str; + this->_M_invalidate_all(); + return *this; + } + + basic_string& + operator=(const _CharT* __s) + { + __glibcxx_check_string(__s); + *static_cast<_Base*>(this) = __s; + this->_M_invalidate_all(); + return *this; + } + + basic_string& + operator=(_CharT __c) + { + *static_cast<_Base*>(this) = __c; + this->_M_invalidate_all(); + return *this; + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + basic_string& + operator=(initializer_list<_CharT> __l) + { + *static_cast<_Base*>(this) = __l; + this->_M_invalidate_all(); + return *this; + } +#endif // __GXX_EXPERIMENTAL_CXX0X__ + + // 21.3.2 iterators: + iterator + begin() + { return iterator(_Base::begin(), this); } + + const_iterator + begin() const + { return const_iterator(_Base::begin(), this); } + + iterator + end() + { return iterator(_Base::end(), this); } + + const_iterator + end() const + { return const_iterator(_Base::end(), this); } + + reverse_iterator + rbegin() + { return reverse_iterator(end()); } + + const_reverse_iterator + rbegin() const + { return const_reverse_iterator(end()); } + + reverse_iterator + rend() + { return reverse_iterator(begin()); } + + const_reverse_iterator + rend() const + { return const_reverse_iterator(begin()); } + + // 21.3.3 capacity: + using _Base::size; + using _Base::length; + using _Base::max_size; + + void + resize(size_type __n, _CharT __c) + { + _Base::resize(__n, __c); + this->_M_invalidate_all(); + } + + void + resize(size_type __n) + { this->resize(__n, _CharT()); } + + using _Base::capacity; + using _Base::reserve; + + void + clear() + { + _Base::clear(); + this->_M_invalidate_all(); + } + + using _Base::empty; + + // 21.3.4 element access: + const_reference + operator[](size_type __pos) const + { + _GLIBCXX_DEBUG_VERIFY(__pos <= this->size(), + _M_message(__gnu_debug::__msg_subscript_oob) + ._M_sequence(*this, "this") + ._M_integer(__pos, "__pos") + ._M_integer(this->size(), "size")); + return _M_base()[__pos]; + } + + reference + operator[](size_type __pos) + { +#ifdef _GLIBCXX_DEBUG_PEDANTIC + __glibcxx_check_subscript(__pos); +#else + // as an extension v3 allows s[s.size()] when s is non-const. + _GLIBCXX_DEBUG_VERIFY(__pos <= this->size(), + _M_message(__gnu_debug::__msg_subscript_oob) + ._M_sequence(*this, "this") + ._M_integer(__pos, "__pos") + ._M_integer(this->size(), "size")); +#endif + return _M_base()[__pos]; + } + + using _Base::at; + + // 21.3.5 modifiers: + basic_string& + operator+=(const basic_string& __str) + { + _M_base() += __str; + this->_M_invalidate_all(); + return *this; + } + + basic_string& + operator+=(const _CharT* __s) + { + __glibcxx_check_string(__s); + _M_base() += __s; + this->_M_invalidate_all(); + return *this; + } + + basic_string& + operator+=(_CharT __c) + { + _M_base() += __c; + this->_M_invalidate_all(); + return *this; + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + basic_string& + operator+=(initializer_list<_CharT> __l) + { + _M_base() += __l; + this->_M_invalidate_all(); + return *this; + } +#endif // __GXX_EXPERIMENTAL_CXX0X__ + + basic_string& + append(const basic_string& __str) + { + _Base::append(__str); + this->_M_invalidate_all(); + return *this; + } + + basic_string& + append(const basic_string& __str, size_type __pos, size_type __n) + { + _Base::append(__str, __pos, __n); + this->_M_invalidate_all(); + return *this; + } + + basic_string& + append(const _CharT* __s, size_type __n) + { + __glibcxx_check_string_len(__s, __n); + _Base::append(__s, __n); + this->_M_invalidate_all(); + return *this; + } + + basic_string& + append(const _CharT* __s) + { + __glibcxx_check_string(__s); + _Base::append(__s); + this->_M_invalidate_all(); + return *this; + } + + basic_string& + append(size_type __n, _CharT __c) + { + _Base::append(__n, __c); + this->_M_invalidate_all(); + return *this; + } + + template + basic_string& + append(_InputIterator __first, _InputIterator __last) + { + __glibcxx_check_valid_range(__first, __last); + _Base::append(__first, __last); + this->_M_invalidate_all(); + return *this; + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 7. string clause minor problems + void + push_back(_CharT __c) + { + _Base::push_back(__c); + this->_M_invalidate_all(); + } + + basic_string& + assign(const basic_string& __x) + { + _Base::assign(__x); + this->_M_invalidate_all(); + return *this; + } + + basic_string& + assign(const basic_string& __str, size_type __pos, size_type __n) + { + _Base::assign(__str, __pos, __n); + this->_M_invalidate_all(); + return *this; + } + + basic_string& + assign(const _CharT* __s, size_type __n) + { + __glibcxx_check_string_len(__s, __n); + _Base::assign(__s, __n); + this->_M_invalidate_all(); + return *this; + } + + basic_string& + assign(const _CharT* __s) + { + __glibcxx_check_string(__s); + _Base::assign(__s); + this->_M_invalidate_all(); + return *this; + } + + basic_string& + assign(size_type __n, _CharT __c) + { + _Base::assign(__n, __c); + this->_M_invalidate_all(); + return *this; + } + + template + basic_string& + assign(_InputIterator __first, _InputIterator __last) + { + __glibcxx_check_valid_range(__first, __last); + _Base::assign(__first, __last); + this->_M_invalidate_all(); + return *this; + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + basic_string& + assign(initializer_list<_CharT> __l) + { + _Base::assign(__l); + this->_M_invalidate_all(); + return *this; + } +#endif // __GXX_EXPERIMENTAL_CXX0X__ + + basic_string& + insert(size_type __pos1, const basic_string& __str) + { + _Base::insert(__pos1, __str); + this->_M_invalidate_all(); + return *this; + } + + basic_string& + insert(size_type __pos1, const basic_string& __str, + size_type __pos2, size_type __n) + { + _Base::insert(__pos1, __str, __pos2, __n); + this->_M_invalidate_all(); + return *this; + } + + basic_string& + insert(size_type __pos, const _CharT* __s, size_type __n) + { + __glibcxx_check_string(__s); + _Base::insert(__pos, __s, __n); + this->_M_invalidate_all(); + return *this; + } + + basic_string& + insert(size_type __pos, const _CharT* __s) + { + __glibcxx_check_string(__s); + _Base::insert(__pos, __s); + this->_M_invalidate_all(); + return *this; + } + + basic_string& + insert(size_type __pos, size_type __n, _CharT __c) + { + _Base::insert(__pos, __n, __c); + this->_M_invalidate_all(); + return *this; + } + + iterator + insert(iterator __p, _CharT __c) + { + __glibcxx_check_insert(__p); + typename _Base::iterator __res = _Base::insert(__p.base(), __c); + this->_M_invalidate_all(); + return iterator(__res, this); + } + + void + insert(iterator __p, size_type __n, _CharT __c) + { + __glibcxx_check_insert(__p); + _Base::insert(__p.base(), __n, __c); + this->_M_invalidate_all(); + } + + template + void + insert(iterator __p, _InputIterator __first, _InputIterator __last) + { + __glibcxx_check_insert_range(__p, __first, __last); + _Base::insert(__p.base(), __first, __last); + this->_M_invalidate_all(); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + void + insert(iterator __p, initializer_list<_CharT> __l) + { + _Base::insert(__p, __l); + this->_M_invalidate_all(); + } +#endif // __GXX_EXPERIMENTAL_CXX0X__ + + basic_string& + erase(size_type __pos = 0, size_type __n = _Base::npos) + { + _Base::erase(__pos, __n); + this->_M_invalidate_all(); + return *this; + } + + iterator + erase(iterator __position) + { + __glibcxx_check_erase(__position); + typename _Base::iterator __res = _Base::erase(__position.base()); + this->_M_invalidate_all(); + return iterator(__res, this); + } + + iterator + erase(iterator __first, iterator __last) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 151. can't currently clear() empty container + __glibcxx_check_erase_range(__first, __last); + typename _Base::iterator __res = _Base::erase(__first.base(), + __last.base()); + this->_M_invalidate_all(); + return iterator(__res, this); + } + + basic_string& + replace(size_type __pos1, size_type __n1, const basic_string& __str) + { + _Base::replace(__pos1, __n1, __str); + this->_M_invalidate_all(); + return *this; + } + + basic_string& + replace(size_type __pos1, size_type __n1, const basic_string& __str, + size_type __pos2, size_type __n2) + { + _Base::replace(__pos1, __n1, __str, __pos2, __n2); + this->_M_invalidate_all(); + return *this; + } + + basic_string& + replace(size_type __pos, size_type __n1, const _CharT* __s, + size_type __n2) + { + __glibcxx_check_string_len(__s, __n2); + _Base::replace(__pos, __n1, __s, __n2); + this->_M_invalidate_all(); + return *this; + } + + basic_string& + replace(size_type __pos, size_type __n1, const _CharT* __s) + { + __glibcxx_check_string(__s); + _Base::replace(__pos, __n1, __s); + this->_M_invalidate_all(); + return *this; + } + + basic_string& + replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c) + { + _Base::replace(__pos, __n1, __n2, __c); + this->_M_invalidate_all(); + return *this; + } + + basic_string& + replace(iterator __i1, iterator __i2, const basic_string& __str) + { + __glibcxx_check_erase_range(__i1, __i2); + _Base::replace(__i1.base(), __i2.base(), __str); + this->_M_invalidate_all(); + return *this; + } + + basic_string& + replace(iterator __i1, iterator __i2, const _CharT* __s, size_type __n) + { + __glibcxx_check_erase_range(__i1, __i2); + __glibcxx_check_string_len(__s, __n); + _Base::replace(__i1.base(), __i2.base(), __s, __n); + this->_M_invalidate_all(); + return *this; + } + + basic_string& + replace(iterator __i1, iterator __i2, const _CharT* __s) + { + __glibcxx_check_erase_range(__i1, __i2); + __glibcxx_check_string(__s); + _Base::replace(__i1.base(), __i2.base(), __s); + this->_M_invalidate_all(); + return *this; + } + + basic_string& + replace(iterator __i1, iterator __i2, size_type __n, _CharT __c) + { + __glibcxx_check_erase_range(__i1, __i2); + _Base::replace(__i1.base(), __i2.base(), __n, __c); + this->_M_invalidate_all(); + return *this; + } + + template + basic_string& + replace(iterator __i1, iterator __i2, + _InputIterator __j1, _InputIterator __j2) + { + __glibcxx_check_erase_range(__i1, __i2); + __glibcxx_check_valid_range(__j1, __j2); + _Base::replace(__i1.base(), __i2.base(), __j1, __j2); + this->_M_invalidate_all(); + return *this; + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + basic_string& replace(iterator __i1, iterator __i2, + initializer_list<_CharT> __l) + { + __glibcxx_check_erase_range(__i1, __i2); + _Base::replace(__i1.base(), __i2.base(), __l); + this->_M_invalidate_all(); + return *this; + } +#endif // __GXX_EXPERIMENTAL_CXX0X__ + + size_type + copy(_CharT* __s, size_type __n, size_type __pos = 0) const + { + __glibcxx_check_string_len(__s, __n); + return _Base::copy(__s, __n, __pos); + } + + void + swap(basic_string<_CharT,_Traits,_Allocator>& __x) + { + _Base::swap(__x); + this->_M_swap(__x); + this->_M_invalidate_all(); + __x._M_invalidate_all(); + } + + // 21.3.6 string operations: + const _CharT* + c_str() const + { + const _CharT* __res = _Base::c_str(); + this->_M_invalidate_all(); + return __res; + } + + const _CharT* + data() const + { + const _CharT* __res = _Base::data(); + this->_M_invalidate_all(); + return __res; + } + + using _Base::get_allocator; + + size_type + find(const basic_string& __str, size_type __pos = 0) const + { return _Base::find(__str, __pos); } + + size_type + find(const _CharT* __s, size_type __pos, size_type __n) const + { + __glibcxx_check_string(__s); + return _Base::find(__s, __pos, __n); + } + + size_type + find(const _CharT* __s, size_type __pos = 0) const + { + __glibcxx_check_string(__s); + return _Base::find(__s, __pos); + } + + size_type + find(_CharT __c, size_type __pos = 0) const + { return _Base::find(__c, __pos); } + + size_type + rfind(const basic_string& __str, size_type __pos = _Base::npos) const + { return _Base::rfind(__str, __pos); } + + size_type + rfind(const _CharT* __s, size_type __pos, size_type __n) const + { + __glibcxx_check_string_len(__s, __n); + return _Base::rfind(__s, __pos, __n); + } + + size_type + rfind(const _CharT* __s, size_type __pos = _Base::npos) const + { + __glibcxx_check_string(__s); + return _Base::rfind(__s, __pos); + } + + size_type + rfind(_CharT __c, size_type __pos = _Base::npos) const + { return _Base::rfind(__c, __pos); } + + size_type + find_first_of(const basic_string& __str, size_type __pos = 0) const + { return _Base::find_first_of(__str, __pos); } + + size_type + find_first_of(const _CharT* __s, size_type __pos, size_type __n) const + { + __glibcxx_check_string(__s); + return _Base::find_first_of(__s, __pos, __n); + } + + size_type + find_first_of(const _CharT* __s, size_type __pos = 0) const + { + __glibcxx_check_string(__s); + return _Base::find_first_of(__s, __pos); + } + + size_type + find_first_of(_CharT __c, size_type __pos = 0) const + { return _Base::find_first_of(__c, __pos); } + + size_type + find_last_of(const basic_string& __str, + size_type __pos = _Base::npos) const + { return _Base::find_last_of(__str, __pos); } + + size_type + find_last_of(const _CharT* __s, size_type __pos, size_type __n) const + { + __glibcxx_check_string(__s); + return _Base::find_last_of(__s, __pos, __n); + } + + size_type + find_last_of(const _CharT* __s, size_type __pos = _Base::npos) const + { + __glibcxx_check_string(__s); + return _Base::find_last_of(__s, __pos); + } + + size_type + find_last_of(_CharT __c, size_type __pos = _Base::npos) const + { return _Base::find_last_of(__c, __pos); } + + size_type + find_first_not_of(const basic_string& __str, size_type __pos = 0) const + { return _Base::find_first_not_of(__str, __pos); } + + size_type + find_first_not_of(const _CharT* __s, size_type __pos, size_type __n) const + { + __glibcxx_check_string_len(__s, __n); + return _Base::find_first_not_of(__s, __pos, __n); + } + + size_type + find_first_not_of(const _CharT* __s, size_type __pos = 0) const + { + __glibcxx_check_string(__s); + return _Base::find_first_not_of(__s, __pos); + } + + size_type + find_first_not_of(_CharT __c, size_type __pos = 0) const + { return _Base::find_first_not_of(__c, __pos); } + + size_type + find_last_not_of(const basic_string& __str, + size_type __pos = _Base::npos) const + { return _Base::find_last_not_of(__str, __pos); } + + size_type + find_last_not_of(const _CharT* __s, size_type __pos, size_type __n) const + { + __glibcxx_check_string(__s); + return _Base::find_last_not_of(__s, __pos, __n); + } + + size_type + find_last_not_of(const _CharT* __s, size_type __pos = _Base::npos) const + { + __glibcxx_check_string(__s); + return _Base::find_last_not_of(__s, __pos); + } + + size_type + find_last_not_of(_CharT __c, size_type __pos = _Base::npos) const + { return _Base::find_last_not_of(__c, __pos); } + + basic_string + substr(size_type __pos = 0, size_type __n = _Base::npos) const + { return basic_string(_Base::substr(__pos, __n)); } + + int + compare(const basic_string& __str) const + { return _Base::compare(__str); } + + int + compare(size_type __pos1, size_type __n1, + const basic_string& __str) const + { return _Base::compare(__pos1, __n1, __str); } + + int + compare(size_type __pos1, size_type __n1, const basic_string& __str, + size_type __pos2, size_type __n2) const + { return _Base::compare(__pos1, __n1, __str, __pos2, __n2); } + + int + compare(const _CharT* __s) const + { + __glibcxx_check_string(__s); + return _Base::compare(__s); + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 5. string::compare specification questionable + int + compare(size_type __pos1, size_type __n1, const _CharT* __s) const + { + __glibcxx_check_string(__s); + return _Base::compare(__pos1, __n1, __s); + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 5. string::compare specification questionable + int + compare(size_type __pos1, size_type __n1,const _CharT* __s, + size_type __n2) const + { + __glibcxx_check_string_len(__s, __n2); + return _Base::compare(__pos1, __n1, __s, __n2); + } + + _Base& + _M_base() { return *this; } + + const _Base& + _M_base() const { return *this; } + + using _Safe_base::_M_invalidate_all; + }; + + template + inline basic_string<_CharT,_Traits,_Allocator> + operator+(const basic_string<_CharT,_Traits,_Allocator>& __lhs, + const basic_string<_CharT,_Traits,_Allocator>& __rhs) + { return basic_string<_CharT,_Traits,_Allocator>(__lhs) += __rhs; } + + template + inline basic_string<_CharT,_Traits,_Allocator> + operator+(const _CharT* __lhs, + const basic_string<_CharT,_Traits,_Allocator>& __rhs) + { + __glibcxx_check_string(__lhs); + return basic_string<_CharT,_Traits,_Allocator>(__lhs) += __rhs; + } + + template + inline basic_string<_CharT,_Traits,_Allocator> + operator+(_CharT __lhs, + const basic_string<_CharT,_Traits,_Allocator>& __rhs) + { return basic_string<_CharT,_Traits,_Allocator>(1, __lhs) += __rhs; } + + template + inline basic_string<_CharT,_Traits,_Allocator> + operator+(const basic_string<_CharT,_Traits,_Allocator>& __lhs, + const _CharT* __rhs) + { + __glibcxx_check_string(__rhs); + return basic_string<_CharT,_Traits,_Allocator>(__lhs) += __rhs; + } + + template + inline basic_string<_CharT,_Traits,_Allocator> + operator+(const basic_string<_CharT,_Traits,_Allocator>& __lhs, + _CharT __rhs) + { return basic_string<_CharT,_Traits,_Allocator>(__lhs) += __rhs; } + + template + inline bool + operator==(const basic_string<_CharT,_Traits,_Allocator>& __lhs, + const basic_string<_CharT,_Traits,_Allocator>& __rhs) + { return __lhs._M_base() == __rhs._M_base(); } + + template + inline bool + operator==(const _CharT* __lhs, + const basic_string<_CharT,_Traits,_Allocator>& __rhs) + { + __glibcxx_check_string(__lhs); + return __lhs == __rhs._M_base(); + } + + template + inline bool + operator==(const basic_string<_CharT,_Traits,_Allocator>& __lhs, + const _CharT* __rhs) + { + __glibcxx_check_string(__rhs); + return __lhs._M_base() == __rhs; + } + + template + inline bool + operator!=(const basic_string<_CharT,_Traits,_Allocator>& __lhs, + const basic_string<_CharT,_Traits,_Allocator>& __rhs) + { return __lhs._M_base() != __rhs._M_base(); } + + template + inline bool + operator!=(const _CharT* __lhs, + const basic_string<_CharT,_Traits,_Allocator>& __rhs) + { + __glibcxx_check_string(__lhs); + return __lhs != __rhs._M_base(); + } + + template + inline bool + operator!=(const basic_string<_CharT,_Traits,_Allocator>& __lhs, + const _CharT* __rhs) + { + __glibcxx_check_string(__rhs); + return __lhs._M_base() != __rhs; + } + + template + inline bool + operator<(const basic_string<_CharT,_Traits,_Allocator>& __lhs, + const basic_string<_CharT,_Traits,_Allocator>& __rhs) + { return __lhs._M_base() < __rhs._M_base(); } + + template + inline bool + operator<(const _CharT* __lhs, + const basic_string<_CharT,_Traits,_Allocator>& __rhs) + { + __glibcxx_check_string(__lhs); + return __lhs < __rhs._M_base(); + } + + template + inline bool + operator<(const basic_string<_CharT,_Traits,_Allocator>& __lhs, + const _CharT* __rhs) + { + __glibcxx_check_string(__rhs); + return __lhs._M_base() < __rhs; + } + + template + inline bool + operator<=(const basic_string<_CharT,_Traits,_Allocator>& __lhs, + const basic_string<_CharT,_Traits,_Allocator>& __rhs) + { return __lhs._M_base() <= __rhs._M_base(); } + + template + inline bool + operator<=(const _CharT* __lhs, + const basic_string<_CharT,_Traits,_Allocator>& __rhs) + { + __glibcxx_check_string(__lhs); + return __lhs <= __rhs._M_base(); + } + + template + inline bool + operator<=(const basic_string<_CharT,_Traits,_Allocator>& __lhs, + const _CharT* __rhs) + { + __glibcxx_check_string(__rhs); + return __lhs._M_base() <= __rhs; + } + + template + inline bool + operator>=(const basic_string<_CharT,_Traits,_Allocator>& __lhs, + const basic_string<_CharT,_Traits,_Allocator>& __rhs) + { return __lhs._M_base() >= __rhs._M_base(); } + + template + inline bool + operator>=(const _CharT* __lhs, + const basic_string<_CharT,_Traits,_Allocator>& __rhs) + { + __glibcxx_check_string(__lhs); + return __lhs >= __rhs._M_base(); + } + + template + inline bool + operator>=(const basic_string<_CharT,_Traits,_Allocator>& __lhs, + const _CharT* __rhs) + { + __glibcxx_check_string(__rhs); + return __lhs._M_base() >= __rhs; + } + + template + inline bool + operator>(const basic_string<_CharT,_Traits,_Allocator>& __lhs, + const basic_string<_CharT,_Traits,_Allocator>& __rhs) + { return __lhs._M_base() > __rhs._M_base(); } + + template + inline bool + operator>(const _CharT* __lhs, + const basic_string<_CharT,_Traits,_Allocator>& __rhs) + { + __glibcxx_check_string(__lhs); + return __lhs > __rhs._M_base(); + } + + template + inline bool + operator>(const basic_string<_CharT,_Traits,_Allocator>& __lhs, + const _CharT* __rhs) + { + __glibcxx_check_string(__rhs); + return __lhs._M_base() > __rhs; + } + + // 21.3.7.8: + template + inline void + swap(basic_string<_CharT,_Traits,_Allocator>& __lhs, + basic_string<_CharT,_Traits,_Allocator>& __rhs) + { __lhs.swap(__rhs); } + + template + std::basic_ostream<_CharT, _Traits>& + operator<<(std::basic_ostream<_CharT, _Traits>& __os, + const basic_string<_CharT, _Traits, _Allocator>& __str) + { return __os << __str._M_base(); } + + template + std::basic_istream<_CharT,_Traits>& + operator>>(std::basic_istream<_CharT,_Traits>& __is, + basic_string<_CharT,_Traits,_Allocator>& __str) + { + std::basic_istream<_CharT,_Traits>& __res = __is >> __str._M_base(); + __str._M_invalidate_all(); + return __res; + } + + template + std::basic_istream<_CharT,_Traits>& + getline(std::basic_istream<_CharT,_Traits>& __is, + basic_string<_CharT,_Traits,_Allocator>& __str, _CharT __delim) + { + std::basic_istream<_CharT,_Traits>& __res = getline(__is, + __str._M_base(), + __delim); + __str._M_invalidate_all(); + return __res; + } + + template + std::basic_istream<_CharT,_Traits>& + getline(std::basic_istream<_CharT,_Traits>& __is, + basic_string<_CharT,_Traits,_Allocator>& __str) + { + std::basic_istream<_CharT,_Traits>& __res = getline(__is, + __str._M_base()); + __str._M_invalidate_all(); + return __res; + } + + typedef basic_string string; + +#ifdef _GLIBCXX_USE_WCHAR_T + typedef basic_string wstring; +#endif + +} // namespace __gnu_debug + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/unordered_map b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/unordered_map new file mode 100644 index 00000000..fd7c31ef --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/unordered_map @@ -0,0 +1,608 @@ +// Debugging unordered_map/unordered_multimap implementation -*- C++ -*- + +// Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file debug/unordered_map + * This file is a GNU debug extension to the Standard C++ Library. + */ + +#ifndef _GLIBCXX_DEBUG_UNORDERED_MAP +#define _GLIBCXX_DEBUG_UNORDERED_MAP 1 + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ +# include +#else +# include +#endif + +#include +#include +#include + +namespace std +{ +namespace __debug +{ + template, + typename _Pred = std::equal_to<_Key>, + typename _Alloc = std::allocator<_Key> > + class unordered_map + : public _GLIBCXX_STD_D::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>, + public __gnu_debug::_Safe_sequence > + { + typedef _GLIBCXX_STD_D::unordered_map<_Key, _Tp, _Hash, + _Pred, _Alloc> _Base; + typedef __gnu_debug::_Safe_sequence _Safe_base; + + public: + typedef typename _Base::size_type size_type; + typedef typename _Base::hasher hasher; + typedef typename _Base::key_equal key_equal; + typedef typename _Base::allocator_type allocator_type; + + typedef typename _Base::key_type key_type; + typedef typename _Base::value_type value_type; + + typedef __gnu_debug::_Safe_iterator iterator; + typedef __gnu_debug::_Safe_iterator const_iterator; + + explicit + unordered_map(size_type __n = 10, + const hasher& __hf = hasher(), + const key_equal& __eql = key_equal(), + const allocator_type& __a = allocator_type()) + : _Base(__n, __hf, __eql, __a) { } + + template + unordered_map(_InputIterator __f, _InputIterator __l, + size_type __n = 10, + const hasher& __hf = hasher(), + const key_equal& __eql = key_equal(), + const allocator_type& __a = allocator_type()) + : _Base(__gnu_debug::__check_valid_range(__f, __l), __l, __n, + __hf, __eql, __a), _Safe_base() { } + + unordered_map(const unordered_map& __x) + : _Base(__x), _Safe_base() { } + + unordered_map(const _Base& __x) + : _Base(__x), _Safe_base() { } + + unordered_map(unordered_map&& __x) + : _Base(std::forward(__x)), _Safe_base() { } + + unordered_map(initializer_list __l, + size_type __n = 10, + const hasher& __hf = hasher(), + const key_equal& __eql = key_equal(), + const allocator_type& __a = allocator_type()) + : _Base(__l, __n, __hf, __eql, __a), _Safe_base() { } + + unordered_map& + operator=(const unordered_map& __x) + { + *static_cast<_Base*>(this) = __x; + this->_M_invalidate_all(); + return *this; + } + + unordered_map& + operator=(unordered_map&& __x) + { + // NB: DR 675. + clear(); + swap(__x); + return *this; + } + + unordered_map& + operator=(initializer_list __l) + { + this->clear(); + this->insert(__l); + return *this; + } + + void + swap(unordered_map&& __x) + { + _Base::swap(__x); + _Safe_base::_M_swap(__x); + } + + void + clear() + { + _Base::clear(); + this->_M_invalidate_all(); + } + + iterator + begin() + { return iterator(_Base::begin(), this); } + + const_iterator + begin() const + { return const_iterator(_Base::begin(), this); } + + iterator + end() + { return iterator(_Base::end(), this); } + + const_iterator + end() const + { return const_iterator(_Base::end(), this); } + + const_iterator + cbegin() const + { return const_iterator(_Base::begin(), this); } + + const_iterator + cend() const + { return const_iterator(_Base::end(), this); } + + // local versions + using _Base::begin; + using _Base::end; + using _Base::cbegin; + using _Base::cend; + + std::pair + insert(const value_type& __obj) + { + typedef std::pair __pair_type; + __pair_type __res = _Base::insert(__obj); + return std::make_pair(iterator(__res.first, this), __res.second); + } + + iterator + insert(iterator, const value_type& __obj) + { + typedef std::pair __pair_type; + __pair_type __res = _Base::insert(__obj); + return iterator(__res.first, this); + } + + const_iterator + insert(const_iterator, const value_type& __obj) + { + typedef std::pair __pair_type; + __pair_type __res = _Base::insert(__obj); + return const_iterator(__res.first, this); + } + + void + insert(std::initializer_list __l) + { _Base::insert(__l); } + + template + void + insert(_InputIterator __first, _InputIterator __last) + { + __glibcxx_check_valid_range(__first, __last); + _Base::insert(__first, __last); + } + + iterator + find(const key_type& __key) + { return iterator(_Base::find(__key), this); } + + const_iterator + find(const key_type& __key) const + { return const_iterator(_Base::find(__key), this); } + + std::pair + equal_range(const key_type& __key) + { + typedef typename _Base::iterator _Base_iterator; + typedef std::pair<_Base_iterator, _Base_iterator> __pair_type; + __pair_type __res = _Base::equal_range(__key); + return std::make_pair(iterator(__res.first, this), + iterator(__res.second, this)); + } + + std::pair + equal_range(const key_type& __key) const + { + typedef typename _Base::const_iterator _Base_iterator; + typedef std::pair<_Base_iterator, _Base_iterator> __pair_type; + __pair_type __res = _Base::equal_range(__key); + return std::make_pair(const_iterator(__res.first, this), + const_iterator(__res.second, this)); + } + + size_type + erase(const key_type& __key) + { + size_type __ret(0); + iterator __victim(_Base::find(__key), this); + if (__victim != end()) + { + this->erase(__victim); + __ret = 1; + } + return __ret; + } + + iterator + erase(iterator __it) + { + __glibcxx_check_erase(__it); + __it._M_invalidate(); + return iterator(_Base::erase(__it.base()), this); + } + + const_iterator + erase(const_iterator __it) + { + __glibcxx_check_erase(__it); + __it._M_invalidate(); + return const_iterator(_Base::erase(__it.base()), this); + } + + iterator + erase(iterator __first, iterator __last) + { + __glibcxx_check_erase_range(__first, __last); + for (iterator __tmp = __first; __tmp != __last;) + { + iterator __victim = __tmp++; + __victim._M_invalidate(); + } + return iterator(_Base::erase(__first.base(), + __last.base()), this); + } + + const_iterator + erase(const_iterator __first, const_iterator __last) + { + __glibcxx_check_erase_range(__first, __last); + for (const_iterator __tmp = __first; __tmp != __last;) + { + const_iterator __victim = __tmp++; + __victim._M_invalidate(); + } + return const_iterator(_Base::erase(__first.base(), + __last.base()), this); + } + + _Base& + _M_base() { return *this; } + + const _Base& + _M_base() const { return *this; } + + private: + void + _M_invalidate_all() + { + typedef typename _Base::const_iterator _Base_const_iterator; + typedef __gnu_debug::_Not_equal_to<_Base_const_iterator> _Not_equal; + this->_M_invalidate_if(_Not_equal(_M_base().end())); + } + }; + + template + inline void + swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x, + unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y) + { __x.swap(__y); } + + template + inline void + swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>&& __x, + unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y) + { __x.swap(__y); } + + template + inline void + swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x, + unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>&& __y) + { __x.swap(__y); } + + + template, + typename _Pred = std::equal_to<_Key>, + typename _Alloc = std::allocator<_Key> > + class unordered_multimap + : public _GLIBCXX_STD_D::unordered_multimap<_Key, _Tp, _Hash, + _Pred, _Alloc>, + public __gnu_debug::_Safe_sequence > + { + typedef _GLIBCXX_STD_D::unordered_multimap<_Key, _Tp, _Hash, + _Pred, _Alloc> _Base; + typedef __gnu_debug::_Safe_sequence _Safe_base; + + public: + typedef typename _Base::size_type size_type; + typedef typename _Base::hasher hasher; + typedef typename _Base::key_equal key_equal; + typedef typename _Base::allocator_type allocator_type; + + typedef typename _Base::key_type key_type; + typedef typename _Base::value_type value_type; + + typedef __gnu_debug::_Safe_iterator iterator; + typedef __gnu_debug::_Safe_iterator const_iterator; + + explicit + unordered_multimap(size_type __n = 10, + const hasher& __hf = hasher(), + const key_equal& __eql = key_equal(), + const allocator_type& __a = allocator_type()) + : _Base(__n, __hf, __eql, __a) { } + + template + unordered_multimap(_InputIterator __f, _InputIterator __l, + size_type __n = 10, + const hasher& __hf = hasher(), + const key_equal& __eql = key_equal(), + const allocator_type& __a = allocator_type()) + : _Base(__gnu_debug::__check_valid_range(__f, __l), __l, __n, + __hf, __eql, __a), _Safe_base() { } + + unordered_multimap(const unordered_multimap& __x) + : _Base(__x), _Safe_base() { } + + unordered_multimap(const _Base& __x) + : _Base(__x), _Safe_base() { } + + unordered_multimap(unordered_multimap&& __x) + : _Base(std::forward(__x)), _Safe_base() { } + + unordered_multimap(initializer_list __l, + size_type __n = 10, + const hasher& __hf = hasher(), + const key_equal& __eql = key_equal(), + const allocator_type& __a = allocator_type()) + : _Base(__l, __n, __hf, __eql, __a), _Safe_base() { } + + unordered_multimap& + operator=(const unordered_multimap& __x) + { + *static_cast<_Base*>(this) = __x; + this->_M_invalidate_all(); + return *this; + } + + unordered_multimap& + operator=(unordered_multimap&& __x) + { + // NB: DR 675. + clear(); + swap(__x); + return *this; + } + + unordered_multimap& + operator=(initializer_list __l) + { + this->clear(); + this->insert(__l); + return *this; + } + + void + swap(unordered_multimap&& __x) + { + _Base::swap(__x); + _Safe_base::_M_swap(__x); + } + + void + clear() + { + _Base::clear(); + this->_M_invalidate_all(); + } + + iterator + begin() + { return iterator(_Base::begin(), this); } + + const_iterator + begin() const + { return const_iterator(_Base::begin(), this); } + + iterator + end() + { return iterator(_Base::end(), this); } + + const_iterator + end() const + { return const_iterator(_Base::end(), this); } + + const_iterator + cbegin() const + { return const_iterator(_Base::begin(), this); } + + const_iterator + cend() const + { return const_iterator(_Base::end(), this); } + + // local versions + using _Base::begin; + using _Base::end; + using _Base::cbegin; + using _Base::cend; + + iterator + insert(const value_type& __obj) + { return iterator(_Base::insert(__obj), this); } + + iterator + insert(iterator, const value_type& __obj) + { return iterator(_Base::insert(__obj), this); } + + const_iterator + insert(const_iterator, const value_type& __obj) + { return const_iterator(_Base::insert(__obj), this); } + + void + insert(std::initializer_list __l) + { _Base::insert(__l); } + + template + void + insert(_InputIterator __first, _InputIterator __last) + { + __glibcxx_check_valid_range(__first, __last); + _Base::insert(__first, __last); + } + + iterator + find(const key_type& __key) + { return iterator(_Base::find(__key), this); } + + const_iterator + find(const key_type& __key) const + { return const_iterator(_Base::find(__key), this); } + + std::pair + equal_range(const key_type& __key) + { + typedef typename _Base::iterator _Base_iterator; + typedef std::pair<_Base_iterator, _Base_iterator> __pair_type; + __pair_type __res = _Base::equal_range(__key); + return std::make_pair(iterator(__res.first, this), + iterator(__res.second, this)); + } + + std::pair + equal_range(const key_type& __key) const + { + typedef typename _Base::const_iterator _Base_iterator; + typedef std::pair<_Base_iterator, _Base_iterator> __pair_type; + __pair_type __res = _Base::equal_range(__key); + return std::make_pair(const_iterator(__res.first, this), + const_iterator(__res.second, this)); + } + + size_type + erase(const key_type& __key) + { + size_type __ret(0); + iterator __victim(_Base::find(__key), this); + if (__victim != end()) + { + this->erase(__victim); + __ret = 1; + } + return __ret; + } + + iterator + erase(iterator __it) + { + __glibcxx_check_erase(__it); + __it._M_invalidate(); + return iterator(_Base::erase(__it.base()), this); + } + + const_iterator + erase(const_iterator __it) + { + __glibcxx_check_erase(__it); + __it._M_invalidate(); + return const_iterator(_Base::erase(__it.base()), this); + } + + iterator + erase(iterator __first, iterator __last) + { + __glibcxx_check_erase_range(__first, __last); + for (iterator __tmp = __first; __tmp != __last;) + { + iterator __victim = __tmp++; + __victim._M_invalidate(); + } + return iterator(_Base::erase(__first.base(), + __last.base()), this); + } + + const_iterator + erase(const_iterator __first, const_iterator __last) + { + __glibcxx_check_erase_range(__first, __last); + for (const_iterator __tmp = __first; __tmp != __last;) + { + const_iterator __victim = __tmp++; + __victim._M_invalidate(); + } + return const_iterator(_Base::erase(__first.base(), + __last.base()), this); + } + + _Base& + _M_base() { return *this; } + + const _Base& + _M_base() const { return *this; } + + private: + void + _M_invalidate_all() + { + typedef typename _Base::const_iterator _Base_const_iterator; + typedef __gnu_debug::_Not_equal_to<_Base_const_iterator> _Not_equal; + this->_M_invalidate_if(_Not_equal(_M_base().end())); + } + }; + + template + inline void + swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x, + unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y) + { __x.swap(__y); } + + template + inline void + swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>&& __x, + unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y) + { __x.swap(__y); } + + template + inline void + swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x, + unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>&& __y) + { __x.swap(__y); } + +} // namespace __debug +} // namespace std + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/unordered_set b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/unordered_set new file mode 100644 index 00000000..d340442a --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/unordered_set @@ -0,0 +1,601 @@ +// Debugging unordered_set/unordered_multiset implementation -*- C++ -*- + +// Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file debug/unordered_set + * This file is a GNU debug extension to the Standard C++ Library. + */ + +#ifndef _GLIBCXX_DEBUG_UNORDERED_SET +#define _GLIBCXX_DEBUG_UNORDERED_SET 1 + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ +# include +#else +# include +#endif + +#include +#include +#include + +namespace std +{ +namespace __debug +{ + template, + typename _Pred = std::equal_to<_Value>, + typename _Alloc = std::allocator<_Value> > + class unordered_set + : public _GLIBCXX_STD_D::unordered_set<_Value, _Hash, _Pred, _Alloc>, + public __gnu_debug::_Safe_sequence > + { + typedef _GLIBCXX_STD_D::unordered_set<_Value, _Hash, + _Pred, _Alloc> _Base; + typedef __gnu_debug::_Safe_sequence _Safe_base; + + public: + typedef typename _Base::size_type size_type; + typedef typename _Base::hasher hasher; + typedef typename _Base::key_equal key_equal; + typedef typename _Base::allocator_type allocator_type; + + typedef typename _Base::key_type key_type; + typedef typename _Base::value_type value_type; + + typedef __gnu_debug::_Safe_iterator iterator; + typedef __gnu_debug::_Safe_iterator const_iterator; + + explicit + unordered_set(size_type __n = 10, + const hasher& __hf = hasher(), + const key_equal& __eql = key_equal(), + const allocator_type& __a = allocator_type()) + : _Base(__n, __hf, __eql, __a) { } + + template + unordered_set(_InputIterator __f, _InputIterator __l, + size_type __n = 10, + const hasher& __hf = hasher(), + const key_equal& __eql = key_equal(), + const allocator_type& __a = allocator_type()) + : _Base(__gnu_debug::__check_valid_range(__f, __l), __l, __n, + __hf, __eql, __a), _Safe_base() { } + + unordered_set(const unordered_set& __x) + : _Base(__x), _Safe_base() { } + + unordered_set(const _Base& __x) + : _Base(__x), _Safe_base() { } + + unordered_set(unordered_set&& __x) + : _Base(std::forward(__x)), _Safe_base() { } + + unordered_set(initializer_list __l, + size_type __n = 10, + const hasher& __hf = hasher(), + const key_equal& __eql = key_equal(), + const allocator_type& __a = allocator_type()) + : _Base(__l, __n, __hf, __eql, __a), _Safe_base() { } + + unordered_set& + operator=(const unordered_set& __x) + { + *static_cast<_Base*>(this) = __x; + this->_M_invalidate_all(); + return *this; + } + + unordered_set& + operator=(unordered_set&& __x) + { + // NB: DR 675. + clear(); + swap(__x); + return *this; + } + + unordered_set& + operator=(initializer_list __l) + { + this->clear(); + this->insert(__l); + return *this; + } + + void + swap(unordered_set&& __x) + { + _Base::swap(__x); + _Safe_base::_M_swap(__x); + } + + void + clear() + { + _Base::clear(); + this->_M_invalidate_all(); + } + + iterator + begin() + { return iterator(_Base::begin(), this); } + + const_iterator + begin() const + { return const_iterator(_Base::begin(), this); } + + iterator + end() + { return iterator(_Base::end(), this); } + + const_iterator + end() const + { return const_iterator(_Base::end(), this); } + + const_iterator + cbegin() const + { return const_iterator(_Base::begin(), this); } + + const_iterator + cend() const + { return const_iterator(_Base::end(), this); } + + // local versions + using _Base::begin; + using _Base::end; + using _Base::cbegin; + using _Base::cend; + + std::pair + insert(const value_type& __obj) + { + typedef std::pair __pair_type; + __pair_type __res = _Base::insert(__obj); + return std::make_pair(iterator(__res.first, this), __res.second); + } + + iterator + insert(iterator, const value_type& __obj) + { + typedef std::pair __pair_type; + __pair_type __res = _Base::insert(__obj); + return iterator(__res.first, this); + } + + const_iterator + insert(const_iterator, const value_type& __obj) + { + typedef std::pair __pair_type; + __pair_type __res = _Base::insert(__obj); + return const_iterator(__res.first, this); + } + + void + insert(std::initializer_list __l) + { _Base::insert(__l); } + + template + void + insert(_InputIterator __first, _InputIterator __last) + { + __glibcxx_check_valid_range(__first, __last); + _Base::insert(__first, __last); + } + + iterator + find(const key_type& __key) + { return iterator(_Base::find(__key), this); } + + const_iterator + find(const key_type& __key) const + { return const_iterator(_Base::find(__key), this); } + + std::pair + equal_range(const key_type& __key) + { + typedef typename _Base::iterator _Base_iterator; + typedef std::pair<_Base_iterator, _Base_iterator> __pair_type; + __pair_type __res = _Base::equal_range(__key); + return std::make_pair(iterator(__res.first, this), + iterator(__res.second, this)); + } + + std::pair + equal_range(const key_type& __key) const + { + typedef typename _Base::const_iterator _Base_iterator; + typedef std::pair<_Base_iterator, _Base_iterator> __pair_type; + __pair_type __res = _Base::equal_range(__key); + return std::make_pair(const_iterator(__res.first, this), + const_iterator(__res.second, this)); + } + + size_type + erase(const key_type& __key) + { + size_type __ret(0); + iterator __victim(_Base::find(__key), this); + if (__victim != end()) + { + this->erase(__victim); + __ret = 1; + } + return __ret; + } + + iterator + erase(iterator __it) + { + __glibcxx_check_erase(__it); + __it._M_invalidate(); + return iterator(_Base::erase(__it.base()), this); + } + + const_iterator + erase(const_iterator __it) + { + __glibcxx_check_erase(__it); + __it._M_invalidate(); + return const_iterator(_Base::erase(__it.base()), this); + } + + iterator + erase(iterator __first, iterator __last) + { + __glibcxx_check_erase_range(__first, __last); + for (iterator __tmp = __first; __tmp != __last;) + { + iterator __victim = __tmp++; + __victim._M_invalidate(); + } + return iterator(_Base::erase(__first.base(), + __last.base()), this); + } + + const_iterator + erase(const_iterator __first, const_iterator __last) + { + __glibcxx_check_erase_range(__first, __last); + for (const_iterator __tmp = __first; __tmp != __last;) + { + const_iterator __victim = __tmp++; + __victim._M_invalidate(); + } + return const_iterator(_Base::erase(__first.base(), + __last.base()), this); + } + + _Base& + _M_base() { return *this; } + + const _Base& + _M_base() const { return *this; } + + private: + void + _M_invalidate_all() + { + typedef typename _Base::const_iterator _Base_const_iterator; + typedef __gnu_debug::_Not_equal_to<_Base_const_iterator> _Not_equal; + this->_M_invalidate_if(_Not_equal(_M_base().end())); + } + }; + + template + inline void + swap(unordered_set<_Value, _Hash, _Pred, _Alloc>& __x, + unordered_set<_Value, _Hash, _Pred, _Alloc>& __y) + { __x.swap(__y); } + + template + inline void + swap(unordered_set<_Value, _Hash, _Pred, _Alloc>&& __x, + unordered_set<_Value, _Hash, _Pred, _Alloc>& __y) + { __x.swap(__y); } + + template + inline void + swap(unordered_set<_Value, _Hash, _Pred, _Alloc>& __x, + unordered_set<_Value, _Hash, _Pred, _Alloc>&& __y) + { __x.swap(__y); } + + + template, + typename _Pred = std::equal_to<_Value>, + typename _Alloc = std::allocator<_Value> > + class unordered_multiset + : public _GLIBCXX_STD_D::unordered_multiset<_Value, _Hash, _Pred, _Alloc>, + public __gnu_debug::_Safe_sequence > + { + typedef _GLIBCXX_STD_D::unordered_multiset<_Value, _Hash, + _Pred, _Alloc> _Base; + typedef __gnu_debug::_Safe_sequence _Safe_base; + + public: + typedef typename _Base::size_type size_type; + typedef typename _Base::hasher hasher; + typedef typename _Base::key_equal key_equal; + typedef typename _Base::allocator_type allocator_type; + + typedef typename _Base::key_type key_type; + typedef typename _Base::value_type value_type; + + typedef __gnu_debug::_Safe_iterator iterator; + typedef __gnu_debug::_Safe_iterator const_iterator; + + explicit + unordered_multiset(size_type __n = 10, + const hasher& __hf = hasher(), + const key_equal& __eql = key_equal(), + const allocator_type& __a = allocator_type()) + : _Base(__n, __hf, __eql, __a) { } + + template + unordered_multiset(_InputIterator __f, _InputIterator __l, + size_type __n = 10, + const hasher& __hf = hasher(), + const key_equal& __eql = key_equal(), + const allocator_type& __a = allocator_type()) + : _Base(__gnu_debug::__check_valid_range(__f, __l), __l, __n, + __hf, __eql, __a), _Safe_base() { } + + unordered_multiset(const unordered_multiset& __x) + : _Base(__x), _Safe_base() { } + + unordered_multiset(const _Base& __x) + : _Base(__x), _Safe_base() { } + + unordered_multiset(unordered_multiset&& __x) + : _Base(std::forward(__x)), _Safe_base() { } + + unordered_multiset(initializer_list __l, + size_type __n = 10, + const hasher& __hf = hasher(), + const key_equal& __eql = key_equal(), + const allocator_type& __a = allocator_type()) + : _Base(__l, __n, __hf, __eql, __a), _Safe_base() { } + + unordered_multiset& + operator=(const unordered_multiset& __x) + { + *static_cast<_Base*>(this) = __x; + this->_M_invalidate_all(); + return *this; + } + + unordered_multiset& + operator=(unordered_multiset&& __x) + { + // NB: DR 675. + clear(); + swap(__x); + return *this; + } + + unordered_multiset& + operator=(initializer_list __l) + { + this->clear(); + this->insert(__l); + return *this; + } + + void + swap(unordered_multiset&& __x) + { + _Base::swap(__x); + _Safe_base::_M_swap(__x); + } + + void + clear() + { + _Base::clear(); + this->_M_invalidate_all(); + } + + iterator + begin() + { return iterator(_Base::begin(), this); } + + const_iterator + begin() const + { return const_iterator(_Base::begin(), this); } + + iterator + end() + { return iterator(_Base::end(), this); } + + const_iterator + end() const + { return const_iterator(_Base::end(), this); } + + const_iterator + cbegin() const + { return const_iterator(_Base::begin(), this); } + + const_iterator + cend() const + { return const_iterator(_Base::end(), this); } + + // local versions + using _Base::begin; + using _Base::end; + using _Base::cbegin; + using _Base::cend; + + iterator + insert(const value_type& __obj) + { return iterator(_Base::insert(__obj), this); } + + iterator + insert(iterator, const value_type& __obj) + { return iterator(_Base::insert(__obj), this); } + + const_iterator + insert(const_iterator, const value_type& __obj) + { return const_iterator(_Base::insert(__obj), this); } + + void + insert(std::initializer_list __l) + { _Base::insert(__l); } + + template + void + insert(_InputIterator __first, _InputIterator __last) + { + __glibcxx_check_valid_range(__first, __last); + _Base::insert(__first, __last); + } + + iterator + find(const key_type& __key) + { return iterator(_Base::find(__key), this); } + + const_iterator + find(const key_type& __key) const + { return const_iterator(_Base::find(__key), this); } + + std::pair + equal_range(const key_type& __key) + { + typedef typename _Base::iterator _Base_iterator; + typedef std::pair<_Base_iterator, _Base_iterator> __pair_type; + __pair_type __res = _Base::equal_range(__key); + return std::make_pair(iterator(__res.first, this), + iterator(__res.second, this)); + } + + std::pair + equal_range(const key_type& __key) const + { + typedef typename _Base::const_iterator _Base_iterator; + typedef std::pair<_Base_iterator, _Base_iterator> __pair_type; + __pair_type __res = _Base::equal_range(__key); + return std::make_pair(const_iterator(__res.first, this), + const_iterator(__res.second, this)); + } + + size_type + erase(const key_type& __key) + { + size_type __ret(0); + iterator __victim(_Base::find(__key), this); + if (__victim != end()) + { + this->erase(__victim); + __ret = 1; + } + return __ret; + } + + iterator + erase(iterator __it) + { + __glibcxx_check_erase(__it); + __it._M_invalidate(); + return iterator(_Base::erase(__it.base()), this); + } + + const_iterator + erase(const_iterator __it) + { + __glibcxx_check_erase(__it); + __it._M_invalidate(); + return const_iterator(_Base::erase(__it.base()), this); + } + + iterator + erase(iterator __first, iterator __last) + { + __glibcxx_check_erase_range(__first, __last); + for (iterator __tmp = __first; __tmp != __last;) + { + iterator __victim = __tmp++; + __victim._M_invalidate(); + } + return iterator(_Base::erase(__first.base(), + __last.base()), this); + } + + const_iterator + erase(const_iterator __first, const_iterator __last) + { + __glibcxx_check_erase_range(__first, __last); + for (const_iterator __tmp = __first; __tmp != __last;) + { + const_iterator __victim = __tmp++; + __victim._M_invalidate(); + } + return const_iterator(_Base::erase(__first.base(), + __last.base()), this); + } + + _Base& + _M_base() { return *this; } + + const _Base& + _M_base() const { return *this; } + + private: + void + _M_invalidate_all() + { + typedef typename _Base::const_iterator _Base_const_iterator; + typedef __gnu_debug::_Not_equal_to<_Base_const_iterator> _Not_equal; + this->_M_invalidate_if(_Not_equal(_M_base().end())); + } + }; + + template + inline void + swap(unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x, + unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y) + { __x.swap(__y); } + + template + inline void + swap(unordered_multiset<_Value, _Hash, _Pred, _Alloc>&& __x, + unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y) + { __x.swap(__y); } + + template + inline void + swap(unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x, + unordered_multiset<_Value, _Hash, _Pred, _Alloc>&& __y) + { __x.swap(__y); } + +} // namespace __debug +} // namespace std + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/vector b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/vector new file mode 100644 index 00000000..97ab7bf5 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/debug/vector @@ -0,0 +1,551 @@ +// Debugging vector implementation -*- C++ -*- + +// Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file debug/vector + * This file is a GNU debug extension to the Standard C++ Library. + */ + +#ifndef _GLIBCXX_DEBUG_VECTOR +#define _GLIBCXX_DEBUG_VECTOR 1 + +#include +#include +#include +#include + +namespace std +{ +namespace __debug +{ + template > + class vector + : public _GLIBCXX_STD_D::vector<_Tp, _Allocator>, + public __gnu_debug::_Safe_sequence > + { + typedef _GLIBCXX_STD_D::vector<_Tp, _Allocator> _Base; + typedef __gnu_debug::_Safe_sequence _Safe_base; + + typedef typename _Base::const_iterator _Base_const_iterator; + typedef __gnu_debug::_After_nth_from<_Base_const_iterator> _After_nth; + + public: + typedef typename _Base::reference reference; + typedef typename _Base::const_reference const_reference; + + typedef __gnu_debug::_Safe_iterator + iterator; + typedef __gnu_debug::_Safe_iterator + const_iterator; + + typedef typename _Base::size_type size_type; + typedef typename _Base::difference_type difference_type; + + typedef _Tp value_type; + typedef _Allocator allocator_type; + typedef typename _Base::pointer pointer; + typedef typename _Base::const_pointer const_pointer; + typedef std::reverse_iterator reverse_iterator; + typedef std::reverse_iterator const_reverse_iterator; + + // 23.2.4.1 construct/copy/destroy: + explicit vector(const _Allocator& __a = _Allocator()) + : _Base(__a), _M_guaranteed_capacity(0) { } + + explicit vector(size_type __n, const _Tp& __value = _Tp(), + const _Allocator& __a = _Allocator()) + : _Base(__n, __value, __a), _M_guaranteed_capacity(__n) { } + + template + vector(_InputIterator __first, _InputIterator __last, + const _Allocator& __a = _Allocator()) + : _Base(__gnu_debug::__check_valid_range(__first, __last), + __last, __a), + _M_guaranteed_capacity(0) + { _M_update_guaranteed_capacity(); } + + vector(const vector& __x) + : _Base(__x), _Safe_base(), _M_guaranteed_capacity(__x.size()) { } + + /// Construction from a release-mode vector + vector(const _Base& __x) + : _Base(__x), _Safe_base(), _M_guaranteed_capacity(__x.size()) { } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + vector(vector&& __x) + : _Base(std::forward(__x)), _Safe_base(), + _M_guaranteed_capacity(this->size()) + { + this->_M_swap(__x); + __x._M_guaranteed_capacity = 0; + } + + vector(initializer_list __l, + const allocator_type& __a = allocator_type()) + : _Base(__l, __a), _Safe_base(), + _M_guaranteed_capacity(__l.size()) { } +#endif + + ~vector() { } + + vector& + operator=(const vector& __x) + { + static_cast<_Base&>(*this) = __x; + this->_M_invalidate_all(); + _M_update_guaranteed_capacity(); + return *this; + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + vector& + operator=(vector&& __x) + { + // NB: DR 675. + clear(); + swap(__x); + return *this; + } + + vector& + operator=(initializer_list __l) + { + static_cast<_Base&>(*this) = __l; + this->_M_invalidate_all(); + _M_update_guaranteed_capacity(); + return *this; + } +#endif + + template + void + assign(_InputIterator __first, _InputIterator __last) + { + __glibcxx_check_valid_range(__first, __last); + _Base::assign(__first, __last); + this->_M_invalidate_all(); + _M_update_guaranteed_capacity(); + } + + void + assign(size_type __n, const _Tp& __u) + { + _Base::assign(__n, __u); + this->_M_invalidate_all(); + _M_update_guaranteed_capacity(); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + void + assign(initializer_list __l) + { + _Base::assign(__l); + this->_M_invalidate_all(); + _M_update_guaranteed_capacity(); + } +#endif + + using _Base::get_allocator; + + // iterators: + iterator + begin() + { return iterator(_Base::begin(), this); } + + const_iterator + begin() const + { return const_iterator(_Base::begin(), this); } + + iterator + end() + { return iterator(_Base::end(), this); } + + const_iterator + end() const + { return const_iterator(_Base::end(), this); } + + reverse_iterator + rbegin() + { return reverse_iterator(end()); } + + const_reverse_iterator + rbegin() const + { return const_reverse_iterator(end()); } + + reverse_iterator + rend() + { return reverse_iterator(begin()); } + + const_reverse_iterator + rend() const + { return const_reverse_iterator(begin()); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + const_iterator + cbegin() const + { return const_iterator(_Base::begin(), this); } + + const_iterator + cend() const + { return const_iterator(_Base::end(), this); } + + const_reverse_iterator + crbegin() const + { return const_reverse_iterator(end()); } + + const_reverse_iterator + crend() const + { return const_reverse_iterator(begin()); } +#endif + + // 23.2.4.2 capacity: + using _Base::size; + using _Base::max_size; + + void + resize(size_type __sz, _Tp __c = _Tp()) + { + bool __realloc = _M_requires_reallocation(__sz); + if (__sz < this->size()) + this->_M_invalidate_if(_After_nth(__sz, _M_base().begin())); + _Base::resize(__sz, __c); + if (__realloc) + this->_M_invalidate_all(); + } + + size_type + capacity() const + { +#ifdef _GLIBCXX_DEBUG_PEDANTIC + return _M_guaranteed_capacity; +#else + return _Base::capacity(); +#endif + } + + using _Base::empty; + + void + reserve(size_type __n) + { + bool __realloc = _M_requires_reallocation(__n); + _Base::reserve(__n); + if (__n > _M_guaranteed_capacity) + _M_guaranteed_capacity = __n; + if (__realloc) + this->_M_invalidate_all(); + } + + // element access: + reference + operator[](size_type __n) + { + __glibcxx_check_subscript(__n); + return _M_base()[__n]; + } + + const_reference + operator[](size_type __n) const + { + __glibcxx_check_subscript(__n); + return _M_base()[__n]; + } + + using _Base::at; + + reference + front() + { + __glibcxx_check_nonempty(); + return _Base::front(); + } + + const_reference + front() const + { + __glibcxx_check_nonempty(); + return _Base::front(); + } + + reference + back() + { + __glibcxx_check_nonempty(); + return _Base::back(); + } + + const_reference + back() const + { + __glibcxx_check_nonempty(); + return _Base::back(); + } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // DR 464. Suggestion for new member functions in standard containers. + using _Base::data; + + // 23.2.4.3 modifiers: + void + push_back(const _Tp& __x) + { + bool __realloc = _M_requires_reallocation(this->size() + 1); + _Base::push_back(__x); + if (__realloc) + this->_M_invalidate_all(); + _M_update_guaranteed_capacity(); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + typename __gnu_cxx::__enable_if::__value, + void>::__type + push_back(_Tp&& __x) + { emplace_back(std::move(__x)); } + + template + void + emplace_back(_Args&&... __args) + { + bool __realloc = _M_requires_reallocation(this->size() + 1); + _Base::emplace_back(std::forward<_Args>(__args)...); + if (__realloc) + this->_M_invalidate_all(); + _M_update_guaranteed_capacity(); + } +#endif + + void + pop_back() + { + __glibcxx_check_nonempty(); + iterator __victim = end() - 1; + __victim._M_invalidate(); + _Base::pop_back(); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + iterator + emplace(iterator __position, _Args&&... __args) + { + __glibcxx_check_insert(__position); + bool __realloc = _M_requires_reallocation(this->size() + 1); + difference_type __offset = __position - begin(); + typename _Base::iterator __res = _Base::emplace(__position.base(), + std::forward<_Args>(__args)...); + if (__realloc) + this->_M_invalidate_all(); + else + this->_M_invalidate_if(_After_nth(__offset, _M_base().begin())); + _M_update_guaranteed_capacity(); + return iterator(__res, this); + } +#endif + + iterator + insert(iterator __position, const _Tp& __x) + { + __glibcxx_check_insert(__position); + bool __realloc = _M_requires_reallocation(this->size() + 1); + difference_type __offset = __position - begin(); + typename _Base::iterator __res = _Base::insert(__position.base(),__x); + if (__realloc) + this->_M_invalidate_all(); + else + this->_M_invalidate_if(_After_nth(__offset, _M_base().begin())); + _M_update_guaranteed_capacity(); + return iterator(__res, this); + } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + typename __gnu_cxx::__enable_if::__value, + iterator>::__type + insert(iterator __position, _Tp&& __x) + { return emplace(__position, std::move(__x)); } + + void + insert(iterator __position, initializer_list __l) + { this->insert(__position, __l.begin(), __l.end()); } +#endif + + void + insert(iterator __position, size_type __n, const _Tp& __x) + { + __glibcxx_check_insert(__position); + bool __realloc = _M_requires_reallocation(this->size() + __n); + difference_type __offset = __position - begin(); + _Base::insert(__position.base(), __n, __x); + if (__realloc) + this->_M_invalidate_all(); + else + this->_M_invalidate_if(_After_nth(__offset, _M_base().begin())); + _M_update_guaranteed_capacity(); + } + + template + void + insert(iterator __position, + _InputIterator __first, _InputIterator __last) + { + __glibcxx_check_insert_range(__position, __first, __last); + + /* Hard to guess if invalidation will occur, because __last + - __first can't be calculated in all cases, so we just + punt here by checking if it did occur. */ + typename _Base::iterator __old_begin = _M_base().begin(); + difference_type __offset = __position - begin(); + _Base::insert(__position.base(), __first, __last); + + if (_M_base().begin() != __old_begin) + this->_M_invalidate_all(); + else + this->_M_invalidate_if(_After_nth(__offset, _M_base().begin())); + _M_update_guaranteed_capacity(); + } + + iterator + erase(iterator __position) + { + __glibcxx_check_erase(__position); + difference_type __offset = __position - begin(); + typename _Base::iterator __res = _Base::erase(__position.base()); + this->_M_invalidate_if(_After_nth(__offset, _M_base().begin())); + return iterator(__res, this); + } + + iterator + erase(iterator __first, iterator __last) + { + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 151. can't currently clear() empty container + __glibcxx_check_erase_range(__first, __last); + + difference_type __offset = __first - begin(); + typename _Base::iterator __res = _Base::erase(__first.base(), + __last.base()); + this->_M_invalidate_if(_After_nth(__offset, _M_base().begin())); + return iterator(__res, this); + } + + void +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + swap(vector&& __x) +#else + swap(vector& __x) +#endif + { + _Base::swap(__x); + this->_M_swap(__x); + std::swap(_M_guaranteed_capacity, __x._M_guaranteed_capacity); + } + + void + clear() + { + _Base::clear(); + this->_M_invalidate_all(); + _M_guaranteed_capacity = 0; + } + + _Base& + _M_base() { return *this; } + + const _Base& + _M_base() const { return *this; } + + private: + size_type _M_guaranteed_capacity; + + bool + _M_requires_reallocation(size_type __elements) + { return __elements > this->capacity(); } + + void + _M_update_guaranteed_capacity() + { + if (this->size() > _M_guaranteed_capacity) + _M_guaranteed_capacity = this->size(); + } + }; + + template + inline bool + operator==(const vector<_Tp, _Alloc>& __lhs, + const vector<_Tp, _Alloc>& __rhs) + { return __lhs._M_base() == __rhs._M_base(); } + + template + inline bool + operator!=(const vector<_Tp, _Alloc>& __lhs, + const vector<_Tp, _Alloc>& __rhs) + { return __lhs._M_base() != __rhs._M_base(); } + + template + inline bool + operator<(const vector<_Tp, _Alloc>& __lhs, + const vector<_Tp, _Alloc>& __rhs) + { return __lhs._M_base() < __rhs._M_base(); } + + template + inline bool + operator<=(const vector<_Tp, _Alloc>& __lhs, + const vector<_Tp, _Alloc>& __rhs) + { return __lhs._M_base() <= __rhs._M_base(); } + + template + inline bool + operator>=(const vector<_Tp, _Alloc>& __lhs, + const vector<_Tp, _Alloc>& __rhs) + { return __lhs._M_base() >= __rhs._M_base(); } + + template + inline bool + operator>(const vector<_Tp, _Alloc>& __lhs, + const vector<_Tp, _Alloc>& __rhs) + { return __lhs._M_base() > __rhs._M_base(); } + + template + inline void + swap(vector<_Tp, _Alloc>& __lhs, vector<_Tp, _Alloc>& __rhs) + { __lhs.swap(__rhs); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + inline void + swap(vector<_Tp, _Alloc>&& __lhs, vector<_Tp, _Alloc>& __rhs) + { __lhs.swap(__rhs); } + + template + inline void + swap(vector<_Tp, _Alloc>& __lhs, vector<_Tp, _Alloc>&& __rhs) + { __lhs.swap(__rhs); } +#endif + +} // namespace __debug +} // namespace std + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/deque b/mingw/lib/gcc/mingw32/4.4.0/include/c++/deque new file mode 100644 index 00000000..8f64b005 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/deque @@ -0,0 +1,75 @@ +// -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file include/deque + * This is a Standard C++ Library header. + */ + +#ifndef _GLIBCXX_DEQUE +#define _GLIBCXX_DEQUE 1 + +#pragma GCC system_header + +#include +#include +#include +#include +#include + +#ifndef _GLIBCXX_EXPORT_TEMPLATE +# include +#endif + +#ifdef _GLIBCXX_DEBUG +# include +#endif + +#endif /* _GLIBCXX_DEQUE */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/exception b/mingw/lib/gcc/mingw32/4.4.0/include/c++/exception new file mode 100644 index 00000000..7fa929b6 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/exception @@ -0,0 +1,151 @@ +// Exception Handling support header for -*- C++ -*- + +// Copyright (C) 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, +// 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation +// +// This file is part of GCC. +// +// GCC is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation; either version 3, or (at your option) +// any later version. +// +// GCC is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. +// +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file exception + * This is a Standard C++ Library header. + */ + +#ifndef __EXCEPTION__ +#define __EXCEPTION__ + +#pragma GCC visibility push(default) + +#include + +extern "C++" { + +namespace std +{ + /** + * @defgroup exceptions Exceptions + * @ingroup diagnostics + * + * Classes and functions for reporting errors via exception classes. + * @{ + */ + + /** + * @brief Base class for all library exceptions. + * + * This is the base class for all exceptions thrown by the standard + * library, and by certain language expressions. You are free to derive + * your own %exception classes, or use a different hierarchy, or to + * throw non-class data (e.g., fundamental types). + */ + class exception + { + public: + exception() throw() { } + virtual ~exception() throw(); + + /** Returns a C-style character string describing the general cause + * of the current error. */ + virtual const char* what() const throw(); + }; + + /** If an %exception is thrown which is not listed in a function's + * %exception specification, one of these may be thrown. */ + class bad_exception : public exception + { + public: + bad_exception() throw() { } + + // This declaration is not useless: + // http://gcc.gnu.org/onlinedocs/gcc-3.0.2/gcc_6.html#SEC118 + virtual ~bad_exception() throw(); + + // See comment in eh_exception.cc. + virtual const char* what() const throw(); + }; + + /// If you write a replacement %terminate handler, it must be of this type. + typedef void (*terminate_handler) (); + + /// If you write a replacement %unexpected handler, it must be of this type. + typedef void (*unexpected_handler) (); + + /// Takes a new handler function as an argument, returns the old function. + terminate_handler set_terminate(terminate_handler) throw(); + + /** The runtime will call this function if %exception handling must be + * abandoned for any reason. It can also be called by the user. */ + void terminate() __attribute__ ((__noreturn__)); + + /// Takes a new handler function as an argument, returns the old function. + unexpected_handler set_unexpected(unexpected_handler) throw(); + + /** The runtime will call this function if an %exception is thrown which + * violates the function's %exception specification. */ + void unexpected() __attribute__ ((__noreturn__)); + + /** [18.6.4]/1: "Returns true after completing evaluation of a + * throw-expression until either completing initialization of the + * exception-declaration in the matching handler or entering @c unexpected() + * due to the throw; or after entering @c terminate() for any reason + * other than an explicit call to @c terminate(). [Note: This includes + * stack unwinding [15.2]. end note]" + * + * 2: "When @c uncaught_exception() is true, throwing an %exception can + * result in a call of @c terminate() (15.5.1)." + */ + bool uncaught_exception() throw(); + + // @} group exceptions +} // namespace std + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + /** + * @brief A replacement for the standard terminate_handler which + * prints more information about the terminating exception (if any) + * on stderr. + * + * @ingroup exceptions + * + * Call + * @code + * std::set_terminate(__gnu_cxx::__verbose_terminate_handler) + * @endcode + * to use. For more info, see + * http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt02ch06s02.html + * + * In 3.4 and later, this is on by default. + */ + void __verbose_terminate_handler(); + +_GLIBCXX_END_NAMESPACE + +} // extern "C++" + +#pragma GCC visibility pop + +#if (defined(__GXX_EXPERIMENTAL_CXX0X__) \ + && defined(_GLIBCXX_ATOMIC_BUILTINS_4)) +#include +#endif + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/exception_defines.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/exception_defines.h new file mode 100644 index 00000000..951d96f3 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/exception_defines.h @@ -0,0 +1,49 @@ +// -fno-exceptions Support -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +// +// ISO C++ 14882: 19.1 Exception classes +// + +/** @file exception_defines.h + * This is a Standard C++ Library header. + */ + +#ifndef _EXCEPTION_DEFINES_H +#define _EXCEPTION_DEFINES_H 1 + +#ifndef __EXCEPTIONS +// Iff -fno-exceptions, transform error handling code to work without it. +# define __try if (true) +# define __catch(X) if (false) +# define __throw_exception_again +#else +// Else proceed normally. +# define __try try +# define __catch(X) catch(X) +# define __throw_exception_again throw +#endif + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/exception_ptr.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/exception_ptr.h new file mode 100644 index 00000000..3c44ff11 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/exception_ptr.h @@ -0,0 +1,178 @@ +// Exception Handling support header (exception_ptr class) for -*- C++ -*- + +// Copyright (C) 2008, 2009 Free Software Foundation +// +// This file is part of GCC. +// +// GCC is free software; you can redistribute it and/or modify +// it under the terms of the GNU General Public License as published by +// the Free Software Foundation; either version 3, or (at your option) +// any later version. +// +// GCC is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. +// +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file exception_ptr.h + * This is an internal header file, included by other headers and the + * implementation. You should not attempt to use it directly. + */ + +#ifndef _EXCEPTION_PTR_H +#define _EXCEPTION_PTR_H + +#pragma GCC visibility push(default) + +#include +#include + +#if !defined(_GLIBCXX_ATOMIC_BUILTINS_4) +# error This platform does not support exception propagation. +#endif + +extern "C++" { + +namespace std +{ + /** + * @addtogroup exceptions + * @{ + */ + + // Hide the free operators from other types + namespace __exception_ptr + { + /** + * @brief An opaque pointer to an arbitrary exception. + */ + class exception_ptr; + } + + using __exception_ptr::exception_ptr; + + /** Obtain an %exception_ptr to the currently handled exception. If there + * is none, or the currently handled exception is foreign, return the null + * value. + */ + exception_ptr current_exception() throw(); + + /// Throw the object pointed to by the %exception_ptr. + void rethrow_exception(exception_ptr) __attribute__ ((__noreturn__)); + + /// Obtain an %exception_ptr pointing to a copy of the supplied object. + template + exception_ptr + copy_exception(_Ex __ex) throw(); + + namespace __exception_ptr + { + bool + operator==(const exception_ptr&, const exception_ptr&) throw(); + + bool + operator!=(const exception_ptr&, const exception_ptr&) throw(); + + class exception_ptr + { + void* _M_exception_object; + + explicit exception_ptr(void* __e) throw(); + + void _M_addref() throw(); + void _M_release() throw(); + + void *_M_get() const throw(); + + void _M_safe_bool_dummy(); + + friend exception_ptr std::current_exception() throw(); + friend void std::rethrow_exception(exception_ptr); + + public: + exception_ptr() throw(); + + typedef void (exception_ptr::*__safe_bool)(); + + // For construction from nullptr or 0. + exception_ptr(__safe_bool) throw(); + + exception_ptr(const exception_ptr&) throw(); + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + exception_ptr(exception_ptr&& __o) throw() + : _M_exception_object(__o._M_exception_object) + { __o._M_exception_object = 0; } +#endif + + exception_ptr& + operator=(const exception_ptr&) throw(); + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + exception_ptr& + operator=(exception_ptr&& __o) throw() + { + exception_ptr(__o).swap(*this); + return *this; + } +#endif + + ~exception_ptr() throw(); + + void + swap(exception_ptr&) throw(); + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + void + swap(exception_ptr &&__o) throw() + { + void *__tmp = _M_exception_object; + _M_exception_object = __o._M_exception_object; + __o._M_exception_object = __tmp; + } +#endif + + bool operator!() const throw(); + operator __safe_bool() const throw(); + + friend bool + operator==(const exception_ptr&, const exception_ptr&) throw(); + + const type_info* + __cxa_exception_type() const throw(); + }; + + } // namespace __exception_ptr + + + template + exception_ptr + copy_exception(_Ex __ex) throw() + { + __try + { + throw __ex; + } + __catch(...) + { + return current_exception (); + } + } + + // @} group exceptions +} // namespace std + +} // extern "C++" + +#pragma GCC visibility pop + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/algorithm b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/algorithm new file mode 100644 index 00000000..3337d6c0 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/algorithm @@ -0,0 +1,524 @@ +// Algorithm extensions -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file ext/algorithm + * This file is a GNU extension to the Standard C++ Library (possibly + * containing extensions from the HP/SGI STL subset). + */ + +#ifndef _EXT_ALGORITHM +#define _EXT_ALGORITHM 1 + +#pragma GCC system_header + +#include + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + using std::ptrdiff_t; + using std::min; + using std::pair; + using std::input_iterator_tag; + using std::random_access_iterator_tag; + using std::iterator_traits; + + //-------------------------------------------------- + // copy_n (not part of the C++ standard) + + template + pair<_InputIterator, _OutputIterator> + __copy_n(_InputIterator __first, _Size __count, + _OutputIterator __result, + input_iterator_tag) + { + for ( ; __count > 0; --__count) + { + *__result = *__first; + ++__first; + ++__result; + } + return pair<_InputIterator, _OutputIterator>(__first, __result); + } + + template + inline pair<_RAIterator, _OutputIterator> + __copy_n(_RAIterator __first, _Size __count, + _OutputIterator __result, + random_access_iterator_tag) + { + _RAIterator __last = __first + __count; + return pair<_RAIterator, _OutputIterator>(__last, std::copy(__first, + __last, + __result)); + } + + /** + * @brief Copies the range [first,first+count) into [result,result+count). + * @param first An input iterator. + * @param count The number of elements to copy. + * @param result An output iterator. + * @return A std::pair composed of first+count and result+count. + * + * This is an SGI extension. + * This inline function will boil down to a call to @c memmove whenever + * possible. Failing that, if random access iterators are passed, then the + * loop count will be known (and therefore a candidate for compiler + * optimizations such as unrolling). + * @ingroup SGIextensions + */ + template + inline pair<_InputIterator, _OutputIterator> + copy_n(_InputIterator __first, _Size __count, _OutputIterator __result) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + typename iterator_traits<_InputIterator>::value_type>) + + return __copy_n(__first, __count, __result, + std::__iterator_category(__first)); + } + + template + int + __lexicographical_compare_3way(_InputIterator1 __first1, + _InputIterator1 __last1, + _InputIterator2 __first2, + _InputIterator2 __last2) + { + while (__first1 != __last1 && __first2 != __last2) + { + if (*__first1 < *__first2) + return -1; + if (*__first2 < *__first1) + return 1; + ++__first1; + ++__first2; + } + if (__first2 == __last2) + return !(__first1 == __last1); + else + return -1; + } + + inline int + __lexicographical_compare_3way(const unsigned char* __first1, + const unsigned char* __last1, + const unsigned char* __first2, + const unsigned char* __last2) + { + const ptrdiff_t __len1 = __last1 - __first1; + const ptrdiff_t __len2 = __last2 - __first2; + const int __result = __builtin_memcmp(__first1, __first2, + min(__len1, __len2)); + return __result != 0 ? __result + : (__len1 == __len2 ? 0 : (__len1 < __len2 ? -1 : 1)); + } + + inline int + __lexicographical_compare_3way(const char* __first1, const char* __last1, + const char* __first2, const char* __last2) + { +#if CHAR_MAX == SCHAR_MAX + return __lexicographical_compare_3way((const signed char*) __first1, + (const signed char*) __last1, + (const signed char*) __first2, + (const signed char*) __last2); +#else + return __lexicographical_compare_3way((const unsigned char*) __first1, + (const unsigned char*) __last1, + (const unsigned char*) __first2, + (const unsigned char*) __last2); +#endif + } + + /** + * @brief @c memcmp on steroids. + * @param first1 An input iterator. + * @param last1 An input iterator. + * @param first2 An input iterator. + * @param last2 An input iterator. + * @return An int, as with @c memcmp. + * + * The return value will be less than zero if the first range is + * "lexigraphically less than" the second, greater than zero if the second + * range is "lexigraphically less than" the first, and zero otherwise. + * This is an SGI extension. + * @ingroup SGIextensions + */ + template + int + lexicographical_compare_3way(_InputIterator1 __first1, + _InputIterator1 __last1, + _InputIterator2 __first2, + _InputIterator2 __last2) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) + __glibcxx_function_requires(_LessThanComparableConcept< + typename iterator_traits<_InputIterator1>::value_type>) + __glibcxx_function_requires(_LessThanComparableConcept< + typename iterator_traits<_InputIterator2>::value_type>) + __glibcxx_requires_valid_range(__first1, __last1); + __glibcxx_requires_valid_range(__first2, __last2); + + return __lexicographical_compare_3way(__first1, __last1, __first2, + __last2); + } + + // count and count_if: this version, whose return type is void, was present + // in the HP STL, and is retained as an extension for backward compatibility. + template + void + count(_InputIterator __first, _InputIterator __last, + const _Tp& __value, + _Size& __n) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_EqualityComparableConcept< + typename iterator_traits<_InputIterator>::value_type >) + __glibcxx_function_requires(_EqualityComparableConcept<_Tp>) + __glibcxx_requires_valid_range(__first, __last); + + for ( ; __first != __last; ++__first) + if (*__first == __value) + ++__n; + } + + template + void + count_if(_InputIterator __first, _InputIterator __last, + _Predicate __pred, + _Size& __n) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, + typename iterator_traits<_InputIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + for ( ; __first != __last; ++__first) + if (__pred(*__first)) + ++__n; + } + + // random_sample and random_sample_n (extensions, not part of the standard). + + /** + * This is an SGI extension. + * @ingroup SGIextensions + * @doctodo + */ + template + _OutputIterator + random_sample_n(_ForwardIterator __first, _ForwardIterator __last, + _OutputIterator __out, const _Distance __n) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + _Distance __remaining = std::distance(__first, __last); + _Distance __m = min(__n, __remaining); + + while (__m > 0) + { + if ((std::rand() % __remaining) < __m) + { + *__out = *__first; + ++__out; + --__m; + } + --__remaining; + ++__first; + } + return __out; + } + + /** + * This is an SGI extension. + * @ingroup SGIextensions + * @doctodo + */ + template + _OutputIterator + random_sample_n(_ForwardIterator __first, _ForwardIterator __last, + _OutputIterator __out, const _Distance __n, + _RandomNumberGenerator& __rand) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_function_requires(_UnaryFunctionConcept< + _RandomNumberGenerator, _Distance, _Distance>) + __glibcxx_requires_valid_range(__first, __last); + + _Distance __remaining = std::distance(__first, __last); + _Distance __m = min(__n, __remaining); + + while (__m > 0) + { + if (__rand(__remaining) < __m) + { + *__out = *__first; + ++__out; + --__m; + } + --__remaining; + ++__first; + } + return __out; + } + + template + _RandomAccessIterator + __random_sample(_InputIterator __first, _InputIterator __last, + _RandomAccessIterator __out, + const _Distance __n) + { + _Distance __m = 0; + _Distance __t = __n; + for ( ; __first != __last && __m < __n; ++__m, ++__first) + __out[__m] = *__first; + + while (__first != __last) + { + ++__t; + _Distance __M = std::rand() % (__t); + if (__M < __n) + __out[__M] = *__first; + ++__first; + } + return __out + __m; + } + + template + _RandomAccessIterator + __random_sample(_InputIterator __first, _InputIterator __last, + _RandomAccessIterator __out, + _RandomNumberGenerator& __rand, + const _Distance __n) + { + // concept requirements + __glibcxx_function_requires(_UnaryFunctionConcept< + _RandomNumberGenerator, _Distance, _Distance>) + + _Distance __m = 0; + _Distance __t = __n; + for ( ; __first != __last && __m < __n; ++__m, ++__first) + __out[__m] = *__first; + + while (__first != __last) + { + ++__t; + _Distance __M = __rand(__t); + if (__M < __n) + __out[__M] = *__first; + ++__first; + } + return __out + __m; + } + + /** + * This is an SGI extension. + * @ingroup SGIextensions + * @doctodo + */ + template + inline _RandomAccessIterator + random_sample(_InputIterator __first, _InputIterator __last, + _RandomAccessIterator __out_first, + _RandomAccessIterator __out_last) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_requires_valid_range(__first, __last); + __glibcxx_requires_valid_range(__out_first, __out_last); + + return __random_sample(__first, __last, + __out_first, __out_last - __out_first); + } + + /** + * This is an SGI extension. + * @ingroup SGIextensions + * @doctodo + */ + template + inline _RandomAccessIterator + random_sample(_InputIterator __first, _InputIterator __last, + _RandomAccessIterator __out_first, + _RandomAccessIterator __out_last, + _RandomNumberGenerator& __rand) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_requires_valid_range(__first, __last); + __glibcxx_requires_valid_range(__out_first, __out_last); + + return __random_sample(__first, __last, + __out_first, __rand, + __out_last - __out_first); + } + + /** + * This is an SGI extension. + * @ingroup SGIextensions + * @doctodo + */ + template + inline bool + is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) + { + // concept requirements + __glibcxx_function_requires(_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_LessThanComparableConcept< + typename iterator_traits<_RandomAccessIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + return std::__is_heap(__first, __last - __first); + } + + /** + * This is an SGI extension. + * @ingroup SGIextensions + * @doctodo + */ + template + inline bool + is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, + _StrictWeakOrdering __comp) + { + // concept requirements + __glibcxx_function_requires(_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_StrictWeakOrdering, + typename iterator_traits<_RandomAccessIterator>::value_type, + typename iterator_traits<_RandomAccessIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + return std::__is_heap(__first, __comp, __last - __first); + } + + // is_sorted, a predicated testing whether a range is sorted in + // nondescending order. This is an extension, not part of the C++ + // standard. + + /** + * This is an SGI extension. + * @ingroup SGIextensions + * @doctodo + */ + template + bool + is_sorted(_ForwardIterator __first, _ForwardIterator __last) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_LessThanComparableConcept< + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return true; + + _ForwardIterator __next = __first; + for (++__next; __next != __last; __first = __next, ++__next) + if (*__next < *__first) + return false; + return true; + } + + /** + * This is an SGI extension. + * @ingroup SGIextensions + * @doctodo + */ + template + bool + is_sorted(_ForwardIterator __first, _ForwardIterator __last, + _StrictWeakOrdering __comp) + { + // concept requirements + __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) + __glibcxx_function_requires(_BinaryPredicateConcept<_StrictWeakOrdering, + typename iterator_traits<_ForwardIterator>::value_type, + typename iterator_traits<_ForwardIterator>::value_type>) + __glibcxx_requires_valid_range(__first, __last); + + if (__first == __last) + return true; + + _ForwardIterator __next = __first; + for (++__next; __next != __last; __first = __next, ++__next) + if (__comp(*__next, *__first)) + return false; + return true; + } + +_GLIBCXX_END_NAMESPACE + +#endif /* _EXT_ALGORITHM */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/array_allocator.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/array_allocator.h new file mode 100644 index 00000000..f36f273d --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/array_allocator.h @@ -0,0 +1,154 @@ +// array allocator -*- C++ -*- + +// Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file ext/array_allocator.h + * This file is a GNU extension to the Standard C++ Library. + */ + +#ifndef _ARRAY_ALLOCATOR_H +#define _ARRAY_ALLOCATOR_H 1 + +#include +#include +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + using std::size_t; + using std::ptrdiff_t; + + /// Base class. + template + class array_allocator_base + { + public: + typedef size_t size_type; + typedef ptrdiff_t difference_type; + typedef _Tp* pointer; + typedef const _Tp* const_pointer; + typedef _Tp& reference; + typedef const _Tp& const_reference; + typedef _Tp value_type; + + pointer + address(reference __x) const { return &__x; } + + const_pointer + address(const_reference __x) const { return &__x; } + + void + deallocate(pointer, size_type) + { + // Does nothing. + } + + size_type + max_size() const throw() + { return size_t(-1) / sizeof(_Tp); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 402. wrong new expression in [some_] allocator::construct + void + construct(pointer __p, const _Tp& __val) + { ::new((void *)__p) value_type(__val); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + void + construct(pointer __p, _Args&&... __args) + { ::new((void *)__p) _Tp(std::forward<_Args>(__args)...); } +#endif + + void + destroy(pointer __p) { __p->~_Tp(); } + }; + + /** + * @brief An allocator that uses previously allocated memory. + * This memory can be externally, globally, or otherwise allocated. + * @ingroup allocators + */ + template > + class array_allocator : public array_allocator_base<_Tp> + { + public: + typedef size_t size_type; + typedef ptrdiff_t difference_type; + typedef _Tp* pointer; + typedef const _Tp* const_pointer; + typedef _Tp& reference; + typedef const _Tp& const_reference; + typedef _Tp value_type; + typedef _Array array_type; + + private: + array_type* _M_array; + size_type _M_used; + + public: + template + struct rebind + { typedef array_allocator<_Tp1, _Array1> other; }; + + array_allocator(array_type* __array = NULL) throw() + : _M_array(__array), _M_used(size_type()) { } + + array_allocator(const array_allocator& __o) throw() + : _M_array(__o._M_array), _M_used(__o._M_used) { } + + template + array_allocator(const array_allocator<_Tp1, _Array1>&) throw() + : _M_array(NULL), _M_used(size_type()) { } + + ~array_allocator() throw() { } + + pointer + allocate(size_type __n, const void* = 0) + { + if (_M_array == 0 || _M_used + __n > _M_array->size()) + std::__throw_bad_alloc(); + pointer __ret = _M_array->begin() + _M_used; + _M_used += __n; + return __ret; + } + }; + + template + inline bool + operator==(const array_allocator<_Tp, _Array>&, + const array_allocator<_Tp, _Array>&) + { return true; } + + template + inline bool + operator!=(const array_allocator<_Tp, _Array>&, + const array_allocator<_Tp, _Array>&) + { return false; } + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/atomicity.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/atomicity.h new file mode 100644 index 00000000..bb891e8a --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/atomicity.h @@ -0,0 +1,113 @@ +// Support for atomic operations -*- C++ -*- + +// Copyright (C) 2004, 2005, 2006, 2008, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file atomicity.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _GLIBCXX_ATOMICITY_H +#define _GLIBCXX_ATOMICITY_H 1 + +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + // Functions for portable atomic access. + // To abstract locking primitives across all thread policies, use: + // __exchange_and_add_dispatch + // __atomic_add_dispatch +#ifdef _GLIBCXX_ATOMIC_BUILTINS_4 + static inline _Atomic_word + __exchange_and_add(volatile _Atomic_word* __mem, int __val) + { return __sync_fetch_and_add(__mem, __val); } + + static inline void + __atomic_add(volatile _Atomic_word* __mem, int __val) + { __sync_fetch_and_add(__mem, __val); } +#else + _Atomic_word + __attribute__ ((__unused__)) + __exchange_and_add(volatile _Atomic_word*, int); + + void + __attribute__ ((__unused__)) + __atomic_add(volatile _Atomic_word*, int); +#endif + + static inline _Atomic_word + __exchange_and_add_single(_Atomic_word* __mem, int __val) + { + _Atomic_word __result = *__mem; + *__mem += __val; + return __result; + } + + static inline void + __atomic_add_single(_Atomic_word* __mem, int __val) + { *__mem += __val; } + + static inline _Atomic_word + __attribute__ ((__unused__)) + __exchange_and_add_dispatch(_Atomic_word* __mem, int __val) + { +#ifdef __GTHREADS + if (__gthread_active_p()) + return __exchange_and_add(__mem, __val); + else + return __exchange_and_add_single(__mem, __val); +#else + return __exchange_and_add_single(__mem, __val); +#endif + } + + static inline void + __attribute__ ((__unused__)) + __atomic_add_dispatch(_Atomic_word* __mem, int __val) + { +#ifdef __GTHREADS + if (__gthread_active_p()) + __atomic_add(__mem, __val); + else + __atomic_add_single(__mem, __val); +#else + __atomic_add_single(__mem, __val); +#endif + } + +_GLIBCXX_END_NAMESPACE + +// Even if the CPU doesn't need a memory barrier, we need to ensure +// that the compiler doesn't reorder memory accesses across the +// barriers. +#ifndef _GLIBCXX_READ_MEM_BARRIER +#define _GLIBCXX_READ_MEM_BARRIER __asm __volatile ("":::"memory") +#endif +#ifndef _GLIBCXX_WRITE_MEM_BARRIER +#define _GLIBCXX_WRITE_MEM_BARRIER __asm __volatile ("":::"memory") +#endif + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/bitmap_allocator.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/bitmap_allocator.h new file mode 100644 index 00000000..3ad08fbe --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/bitmap_allocator.h @@ -0,0 +1,1145 @@ +// Bitmap Allocator. -*- C++ -*- + +// Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file ext/bitmap_allocator.h + * This file is a GNU extension to the Standard C++ Library. + */ + +#ifndef _BITMAP_ALLOCATOR_H +#define _BITMAP_ALLOCATOR_H 1 + +#include // For std::size_t, and ptrdiff_t. +#include // For __throw_bad_alloc(). +#include // For std::pair. +#include // For greater_equal, and less_equal. +#include // For operator new. +#include // _GLIBCXX_DEBUG_ASSERT +#include +#include + +/** @brief The constant in the expression below is the alignment + * required in bytes. + */ +#define _BALLOC_ALIGN_BYTES 8 + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + using std::size_t; + using std::ptrdiff_t; + + namespace __detail + { + /** @class __mini_vector bitmap_allocator.h bitmap_allocator.h + * + * @brief __mini_vector<> is a stripped down version of the + * full-fledged std::vector<>. + * + * It is to be used only for built-in types or PODs. Notable + * differences are: + * + * @detail + * 1. Not all accessor functions are present. + * 2. Used ONLY for PODs. + * 3. No Allocator template argument. Uses ::operator new() to get + * memory, and ::operator delete() to free it. + * Caveat: The dtor does NOT free the memory allocated, so this a + * memory-leaking vector! + */ + template + class __mini_vector + { + __mini_vector(const __mini_vector&); + __mini_vector& operator=(const __mini_vector&); + + public: + typedef _Tp value_type; + typedef _Tp* pointer; + typedef _Tp& reference; + typedef const _Tp& const_reference; + typedef size_t size_type; + typedef ptrdiff_t difference_type; + typedef pointer iterator; + + private: + pointer _M_start; + pointer _M_finish; + pointer _M_end_of_storage; + + size_type + _M_space_left() const throw() + { return _M_end_of_storage - _M_finish; } + + pointer + allocate(size_type __n) + { return static_cast(::operator new(__n * sizeof(_Tp))); } + + void + deallocate(pointer __p, size_type) + { ::operator delete(__p); } + + public: + // Members used: size(), push_back(), pop_back(), + // insert(iterator, const_reference), erase(iterator), + // begin(), end(), back(), operator[]. + + __mini_vector() : _M_start(0), _M_finish(0), + _M_end_of_storage(0) + { } + +#if 0 + ~__mini_vector() + { + if (this->_M_start) + { + this->deallocate(this->_M_start, this->_M_end_of_storage + - this->_M_start); + } + } +#endif + + size_type + size() const throw() + { return _M_finish - _M_start; } + + iterator + begin() const throw() + { return this->_M_start; } + + iterator + end() const throw() + { return this->_M_finish; } + + reference + back() const throw() + { return *(this->end() - 1); } + + reference + operator[](const size_type __pos) const throw() + { return this->_M_start[__pos]; } + + void + insert(iterator __pos, const_reference __x); + + void + push_back(const_reference __x) + { + if (this->_M_space_left()) + { + *this->end() = __x; + ++this->_M_finish; + } + else + this->insert(this->end(), __x); + } + + void + pop_back() throw() + { --this->_M_finish; } + + void + erase(iterator __pos) throw(); + + void + clear() throw() + { this->_M_finish = this->_M_start; } + }; + + // Out of line function definitions. + template + void __mini_vector<_Tp>:: + insert(iterator __pos, const_reference __x) + { + if (this->_M_space_left()) + { + size_type __to_move = this->_M_finish - __pos; + iterator __dest = this->end(); + iterator __src = this->end() - 1; + + ++this->_M_finish; + while (__to_move) + { + *__dest = *__src; + --__dest; --__src; --__to_move; + } + *__pos = __x; + } + else + { + size_type __new_size = this->size() ? this->size() * 2 : 1; + iterator __new_start = this->allocate(__new_size); + iterator __first = this->begin(); + iterator __start = __new_start; + while (__first != __pos) + { + *__start = *__first; + ++__start; ++__first; + } + *__start = __x; + ++__start; + while (__first != this->end()) + { + *__start = *__first; + ++__start; ++__first; + } + if (this->_M_start) + this->deallocate(this->_M_start, this->size()); + + this->_M_start = __new_start; + this->_M_finish = __start; + this->_M_end_of_storage = this->_M_start + __new_size; + } + } + + template + void __mini_vector<_Tp>:: + erase(iterator __pos) throw() + { + while (__pos + 1 != this->end()) + { + *__pos = __pos[1]; + ++__pos; + } + --this->_M_finish; + } + + + template + struct __mv_iter_traits + { + typedef typename _Tp::value_type value_type; + typedef typename _Tp::difference_type difference_type; + }; + + template + struct __mv_iter_traits<_Tp*> + { + typedef _Tp value_type; + typedef ptrdiff_t difference_type; + }; + + enum + { + bits_per_byte = 8, + bits_per_block = sizeof(size_t) * size_t(bits_per_byte) + }; + + template + _ForwardIterator + __lower_bound(_ForwardIterator __first, _ForwardIterator __last, + const _Tp& __val, _Compare __comp) + { + typedef typename __mv_iter_traits<_ForwardIterator>::value_type + _ValueType; + typedef typename __mv_iter_traits<_ForwardIterator>::difference_type + _DistanceType; + + _DistanceType __len = __last - __first; + _DistanceType __half; + _ForwardIterator __middle; + + while (__len > 0) + { + __half = __len >> 1; + __middle = __first; + __middle += __half; + if (__comp(*__middle, __val)) + { + __first = __middle; + ++__first; + __len = __len - __half - 1; + } + else + __len = __half; + } + return __first; + } + + template + inline _InputIterator + __find_if(_InputIterator __first, _InputIterator __last, _Predicate __p) + { + while (__first != __last && !__p(*__first)) + ++__first; + return __first; + } + + /** @brief The number of Blocks pointed to by the address pair + * passed to the function. + */ + template + inline size_t + __num_blocks(_AddrPair __ap) + { return (__ap.second - __ap.first) + 1; } + + /** @brief The number of Bit-maps pointed to by the address pair + * passed to the function. + */ + template + inline size_t + __num_bitmaps(_AddrPair __ap) + { return __num_blocks(__ap) / size_t(bits_per_block); } + + // _Tp should be a pointer type. + template + class _Inclusive_between + : public std::unary_function, bool> + { + typedef _Tp pointer; + pointer _M_ptr_value; + typedef typename std::pair<_Tp, _Tp> _Block_pair; + + public: + _Inclusive_between(pointer __ptr) : _M_ptr_value(__ptr) + { } + + bool + operator()(_Block_pair __bp) const throw() + { + if (std::less_equal()(_M_ptr_value, __bp.second) + && std::greater_equal()(_M_ptr_value, __bp.first)) + return true; + else + return false; + } + }; + + // Used to pass a Functor to functions by reference. + template + class _Functor_Ref + : public std::unary_function + { + _Functor& _M_fref; + + public: + typedef typename _Functor::argument_type argument_type; + typedef typename _Functor::result_type result_type; + + _Functor_Ref(_Functor& __fref) : _M_fref(__fref) + { } + + result_type + operator()(argument_type __arg) + { return _M_fref(__arg); } + }; + + /** @class _Ffit_finder bitmap_allocator.h bitmap_allocator.h + * + * @brief The class which acts as a predicate for applying the + * first-fit memory allocation policy for the bitmap allocator. + */ + // _Tp should be a pointer type, and _Alloc is the Allocator for + // the vector. + template + class _Ffit_finder + : public std::unary_function, bool> + { + typedef typename std::pair<_Tp, _Tp> _Block_pair; + typedef typename __detail::__mini_vector<_Block_pair> _BPVector; + typedef typename _BPVector::difference_type _Counter_type; + + size_t* _M_pbitmap; + _Counter_type _M_data_offset; + + public: + _Ffit_finder() : _M_pbitmap(0), _M_data_offset(0) + { } + + bool + operator()(_Block_pair __bp) throw() + { + // Set the _rover to the last physical location bitmap, + // which is the bitmap which belongs to the first free + // block. Thus, the bitmaps are in exact reverse order of + // the actual memory layout. So, we count down the bitmaps, + // which is the same as moving up the memory. + + // If the used count stored at the start of the Bit Map headers + // is equal to the number of Objects that the current Block can + // store, then there is definitely no space for another single + // object, so just return false. + _Counter_type __diff = + __gnu_cxx::__detail::__num_bitmaps(__bp); + + if (*(reinterpret_cast + (__bp.first) - (__diff + 1)) + == __gnu_cxx::__detail::__num_blocks(__bp)) + return false; + + size_t* __rover = reinterpret_cast(__bp.first) - 1; + + for (_Counter_type __i = 0; __i < __diff; ++__i) + { + _M_data_offset = __i; + if (*__rover) + { + _M_pbitmap = __rover; + return true; + } + --__rover; + } + return false; + } + + + size_t* + _M_get() const throw() + { return _M_pbitmap; } + + _Counter_type + _M_offset() const throw() + { return _M_data_offset * size_t(bits_per_block); } + }; + + + /** @class _Bitmap_counter bitmap_allocator.h bitmap_allocator.h + * + * @brief The bitmap counter which acts as the bitmap + * manipulator, and manages the bit-manipulation functions and + * the searching and identification functions on the bit-map. + */ + // _Tp should be a pointer type. + template + class _Bitmap_counter + { + typedef typename __detail::__mini_vector > + _BPVector; + typedef typename _BPVector::size_type _Index_type; + typedef _Tp pointer; + + _BPVector& _M_vbp; + size_t* _M_curr_bmap; + size_t* _M_last_bmap_in_block; + _Index_type _M_curr_index; + + public: + // Use the 2nd parameter with care. Make sure that such an + // entry exists in the vector before passing that particular + // index to this ctor. + _Bitmap_counter(_BPVector& Rvbp, long __index = -1) : _M_vbp(Rvbp) + { this->_M_reset(__index); } + + void + _M_reset(long __index = -1) throw() + { + if (__index == -1) + { + _M_curr_bmap = 0; + _M_curr_index = static_cast<_Index_type>(-1); + return; + } + + _M_curr_index = __index; + _M_curr_bmap = reinterpret_cast + (_M_vbp[_M_curr_index].first) - 1; + + _GLIBCXX_DEBUG_ASSERT(__index <= (long)_M_vbp.size() - 1); + + _M_last_bmap_in_block = _M_curr_bmap + - ((_M_vbp[_M_curr_index].second + - _M_vbp[_M_curr_index].first + 1) + / size_t(bits_per_block) - 1); + } + + // Dangerous Function! Use with extreme care. Pass to this + // function ONLY those values that are known to be correct, + // otherwise this will mess up big time. + void + _M_set_internal_bitmap(size_t* __new_internal_marker) throw() + { _M_curr_bmap = __new_internal_marker; } + + bool + _M_finished() const throw() + { return(_M_curr_bmap == 0); } + + _Bitmap_counter& + operator++() throw() + { + if (_M_curr_bmap == _M_last_bmap_in_block) + { + if (++_M_curr_index == _M_vbp.size()) + _M_curr_bmap = 0; + else + this->_M_reset(_M_curr_index); + } + else + --_M_curr_bmap; + return *this; + } + + size_t* + _M_get() const throw() + { return _M_curr_bmap; } + + pointer + _M_base() const throw() + { return _M_vbp[_M_curr_index].first; } + + _Index_type + _M_offset() const throw() + { + return size_t(bits_per_block) + * ((reinterpret_cast(this->_M_base()) + - _M_curr_bmap) - 1); + } + + _Index_type + _M_where() const throw() + { return _M_curr_index; } + }; + + /** @brief Mark a memory address as allocated by re-setting the + * corresponding bit in the bit-map. + */ + inline void + __bit_allocate(size_t* __pbmap, size_t __pos) throw() + { + size_t __mask = 1 << __pos; + __mask = ~__mask; + *__pbmap &= __mask; + } + + /** @brief Mark a memory address as free by setting the + * corresponding bit in the bit-map. + */ + inline void + __bit_free(size_t* __pbmap, size_t __pos) throw() + { + size_t __mask = 1 << __pos; + *__pbmap |= __mask; + } + } // namespace __detail + + /** @brief Generic Version of the bsf instruction. + */ + inline size_t + _Bit_scan_forward(size_t __num) + { return static_cast(__builtin_ctzl(__num)); } + + /** @class free_list bitmap_allocator.h bitmap_allocator.h + * + * @brief The free list class for managing chunks of memory to be + * given to and returned by the bitmap_allocator. + */ + class free_list + { + typedef size_t* value_type; + typedef __detail::__mini_vector vector_type; + typedef vector_type::iterator iterator; + typedef __mutex __mutex_type; + + struct _LT_pointer_compare + { + bool + operator()(const size_t* __pui, + const size_t __cui) const throw() + { return *__pui < __cui; } + }; + +#if defined __GTHREADS + __mutex_type& + _M_get_mutex() + { + static __mutex_type _S_mutex; + return _S_mutex; + } +#endif + + vector_type& + _M_get_free_list() + { + static vector_type _S_free_list; + return _S_free_list; + } + + /** @brief Performs validation of memory based on their size. + * + * @param __addr The pointer to the memory block to be + * validated. + * + * @detail Validates the memory block passed to this function and + * appropriately performs the action of managing the free list of + * blocks by adding this block to the free list or deleting this + * or larger blocks from the free list. + */ + void + _M_validate(size_t* __addr) throw() + { + vector_type& __free_list = _M_get_free_list(); + const vector_type::size_type __max_size = 64; + if (__free_list.size() >= __max_size) + { + // Ok, the threshold value has been reached. We determine + // which block to remove from the list of free blocks. + if (*__addr >= *__free_list.back()) + { + // Ok, the new block is greater than or equal to the + // last block in the list of free blocks. We just free + // the new block. + ::operator delete(static_cast(__addr)); + return; + } + else + { + // Deallocate the last block in the list of free lists, + // and insert the new one in its correct position. + ::operator delete(static_cast(__free_list.back())); + __free_list.pop_back(); + } + } + + // Just add the block to the list of free lists unconditionally. + iterator __temp = __gnu_cxx::__detail::__lower_bound + (__free_list.begin(), __free_list.end(), + *__addr, _LT_pointer_compare()); + + // We may insert the new free list before _temp; + __free_list.insert(__temp, __addr); + } + + /** @brief Decides whether the wastage of memory is acceptable for + * the current memory request and returns accordingly. + * + * @param __block_size The size of the block available in the free + * list. + * + * @param __required_size The required size of the memory block. + * + * @return true if the wastage incurred is acceptable, else returns + * false. + */ + bool + _M_should_i_give(size_t __block_size, + size_t __required_size) throw() + { + const size_t __max_wastage_percentage = 36; + if (__block_size >= __required_size && + (((__block_size - __required_size) * 100 / __block_size) + < __max_wastage_percentage)) + return true; + else + return false; + } + + public: + /** @brief This function returns the block of memory to the + * internal free list. + * + * @param __addr The pointer to the memory block that was given + * by a call to the _M_get function. + */ + inline void + _M_insert(size_t* __addr) throw() + { +#if defined __GTHREADS + __gnu_cxx::__scoped_lock __bfl_lock(_M_get_mutex()); +#endif + // Call _M_validate to decide what should be done with + // this particular free list. + this->_M_validate(reinterpret_cast(__addr) - 1); + // See discussion as to why this is 1! + } + + /** @brief This function gets a block of memory of the specified + * size from the free list. + * + * @param __sz The size in bytes of the memory required. + * + * @return A pointer to the new memory block of size at least + * equal to that requested. + */ + size_t* + _M_get(size_t __sz) throw(std::bad_alloc); + + /** @brief This function just clears the internal Free List, and + * gives back all the memory to the OS. + */ + void + _M_clear(); + }; + + + // Forward declare the class. + template + class bitmap_allocator; + + // Specialize for void: + template<> + class bitmap_allocator + { + public: + typedef void* pointer; + typedef const void* const_pointer; + + // Reference-to-void members are impossible. + typedef void value_type; + template + struct rebind + { + typedef bitmap_allocator<_Tp1> other; + }; + }; + + /** + * @brief Bitmap Allocator, primary template. + * @ingroup allocators + */ + template + class bitmap_allocator : private free_list + { + public: + typedef size_t size_type; + typedef ptrdiff_t difference_type; + typedef _Tp* pointer; + typedef const _Tp* const_pointer; + typedef _Tp& reference; + typedef const _Tp& const_reference; + typedef _Tp value_type; + typedef free_list::__mutex_type __mutex_type; + + template + struct rebind + { + typedef bitmap_allocator<_Tp1> other; + }; + + private: + template + struct aligned_size + { + enum + { + modulus = _BSize % _AlignSize, + value = _BSize + (modulus ? _AlignSize - (modulus) : 0) + }; + }; + + struct _Alloc_block + { + char __M_unused[aligned_size::value]; + }; + + + typedef typename std::pair<_Alloc_block*, _Alloc_block*> _Block_pair; + + typedef typename + __detail::__mini_vector<_Block_pair> _BPVector; + +#if defined _GLIBCXX_DEBUG + // Complexity: O(lg(N)). Where, N is the number of block of size + // sizeof(value_type). + void + _S_check_for_free_blocks() throw() + { + typedef typename + __gnu_cxx::__detail::_Ffit_finder<_Alloc_block*> _FFF; + _FFF __fff; + typedef typename _BPVector::iterator _BPiter; + _BPiter __bpi = + __gnu_cxx::__detail::__find_if + (_S_mem_blocks.begin(), _S_mem_blocks.end(), + __gnu_cxx::__detail::_Functor_Ref<_FFF>(__fff)); + + _GLIBCXX_DEBUG_ASSERT(__bpi == _S_mem_blocks.end()); + } +#endif + + /** @brief Responsible for exponentially growing the internal + * memory pool. + * + * @throw std::bad_alloc. If memory can not be allocated. + * + * @detail Complexity: O(1), but internally depends upon the + * complexity of the function free_list::_M_get. The part where + * the bitmap headers are written has complexity: O(X),where X + * is the number of blocks of size sizeof(value_type) within + * the newly acquired block. Having a tight bound. + */ + void + _S_refill_pool() throw(std::bad_alloc) + { +#if defined _GLIBCXX_DEBUG + _S_check_for_free_blocks(); +#endif + + const size_t __num_bitmaps = (_S_block_size + / size_t(__detail::bits_per_block)); + const size_t __size_to_allocate = sizeof(size_t) + + _S_block_size * sizeof(_Alloc_block) + + __num_bitmaps * sizeof(size_t); + + size_t* __temp = + reinterpret_cast + (this->_M_get(__size_to_allocate)); + *__temp = 0; + ++__temp; + + // The Header information goes at the Beginning of the Block. + _Block_pair __bp = + std::make_pair(reinterpret_cast<_Alloc_block*> + (__temp + __num_bitmaps), + reinterpret_cast<_Alloc_block*> + (__temp + __num_bitmaps) + + _S_block_size - 1); + + // Fill the Vector with this information. + _S_mem_blocks.push_back(__bp); + + size_t __bit_mask = 0; // 0 Indicates all Allocated. + __bit_mask = ~__bit_mask; // 1 Indicates all Free. + + for (size_t __i = 0; __i < __num_bitmaps; ++__i) + __temp[__i] = __bit_mask; + + _S_block_size *= 2; + } + + + static _BPVector _S_mem_blocks; + static size_t _S_block_size; + static __gnu_cxx::__detail:: + _Bitmap_counter<_Alloc_block*> _S_last_request; + static typename _BPVector::size_type _S_last_dealloc_index; +#if defined __GTHREADS + static __mutex_type _S_mut; +#endif + + public: + + /** @brief Allocates memory for a single object of size + * sizeof(_Tp). + * + * @throw std::bad_alloc. If memory can not be allocated. + * + * @detail Complexity: Worst case complexity is O(N), but that + * is hardly ever hit. If and when this particular case is + * encountered, the next few cases are guaranteed to have a + * worst case complexity of O(1)! That's why this function + * performs very well on average. You can consider this + * function to have a complexity referred to commonly as: + * Amortized Constant time. + */ + pointer + _M_allocate_single_object() throw(std::bad_alloc) + { +#if defined __GTHREADS + __gnu_cxx::__scoped_lock __bit_lock(_S_mut); +#endif + + // The algorithm is something like this: The last_request + // variable points to the last accessed Bit Map. When such a + // condition occurs, we try to find a free block in the + // current bitmap, or succeeding bitmaps until the last bitmap + // is reached. If no free block turns up, we resort to First + // Fit method. + + // WARNING: Do not re-order the condition in the while + // statement below, because it relies on C++'s short-circuit + // evaluation. The return from _S_last_request->_M_get() will + // NOT be dereference able if _S_last_request->_M_finished() + // returns true. This would inevitably lead to a NULL pointer + // dereference if tinkered with. + while (_S_last_request._M_finished() == false + && (*(_S_last_request._M_get()) == 0)) + { + _S_last_request.operator++(); + } + + if (__builtin_expect(_S_last_request._M_finished() == true, false)) + { + // Fall Back to First Fit algorithm. + typedef typename + __gnu_cxx::__detail::_Ffit_finder<_Alloc_block*> _FFF; + _FFF __fff; + typedef typename _BPVector::iterator _BPiter; + _BPiter __bpi = + __gnu_cxx::__detail::__find_if + (_S_mem_blocks.begin(), _S_mem_blocks.end(), + __gnu_cxx::__detail::_Functor_Ref<_FFF>(__fff)); + + if (__bpi != _S_mem_blocks.end()) + { + // Search was successful. Ok, now mark the first bit from + // the right as 0, meaning Allocated. This bit is obtained + // by calling _M_get() on __fff. + size_t __nz_bit = _Bit_scan_forward(*__fff._M_get()); + __detail::__bit_allocate(__fff._M_get(), __nz_bit); + + _S_last_request._M_reset(__bpi - _S_mem_blocks.begin()); + + // Now, get the address of the bit we marked as allocated. + pointer __ret = reinterpret_cast + (__bpi->first + __fff._M_offset() + __nz_bit); + size_t* __puse_count = + reinterpret_cast + (__bpi->first) + - (__gnu_cxx::__detail::__num_bitmaps(*__bpi) + 1); + + ++(*__puse_count); + return __ret; + } + else + { + // Search was unsuccessful. We Add more memory to the + // pool by calling _S_refill_pool(). + _S_refill_pool(); + + // _M_Reset the _S_last_request structure to the first + // free block's bit map. + _S_last_request._M_reset(_S_mem_blocks.size() - 1); + + // Now, mark that bit as allocated. + } + } + + // _S_last_request holds a pointer to a valid bit map, that + // points to a free block in memory. + size_t __nz_bit = _Bit_scan_forward(*_S_last_request._M_get()); + __detail::__bit_allocate(_S_last_request._M_get(), __nz_bit); + + pointer __ret = reinterpret_cast + (_S_last_request._M_base() + _S_last_request._M_offset() + __nz_bit); + + size_t* __puse_count = reinterpret_cast + (_S_mem_blocks[_S_last_request._M_where()].first) + - (__gnu_cxx::__detail:: + __num_bitmaps(_S_mem_blocks[_S_last_request._M_where()]) + 1); + + ++(*__puse_count); + return __ret; + } + + /** @brief Deallocates memory that belongs to a single object of + * size sizeof(_Tp). + * + * @detail Complexity: O(lg(N)), but the worst case is not hit + * often! This is because containers usually deallocate memory + * close to each other and this case is handled in O(1) time by + * the deallocate function. + */ + void + _M_deallocate_single_object(pointer __p) throw() + { +#if defined __GTHREADS + __gnu_cxx::__scoped_lock __bit_lock(_S_mut); +#endif + _Alloc_block* __real_p = reinterpret_cast<_Alloc_block*>(__p); + + typedef typename _BPVector::iterator _Iterator; + typedef typename _BPVector::difference_type _Difference_type; + + _Difference_type __diff; + long __displacement; + + _GLIBCXX_DEBUG_ASSERT(_S_last_dealloc_index >= 0); + + + if (__gnu_cxx::__detail::_Inclusive_between<_Alloc_block*> + (__real_p) (_S_mem_blocks[_S_last_dealloc_index])) + { + _GLIBCXX_DEBUG_ASSERT(_S_last_dealloc_index + <= _S_mem_blocks.size() - 1); + + // Initial Assumption was correct! + __diff = _S_last_dealloc_index; + __displacement = __real_p - _S_mem_blocks[__diff].first; + } + else + { + _Iterator _iter = __gnu_cxx::__detail:: + __find_if(_S_mem_blocks.begin(), + _S_mem_blocks.end(), + __gnu_cxx::__detail:: + _Inclusive_between<_Alloc_block*>(__real_p)); + + _GLIBCXX_DEBUG_ASSERT(_iter != _S_mem_blocks.end()); + + __diff = _iter - _S_mem_blocks.begin(); + __displacement = __real_p - _S_mem_blocks[__diff].first; + _S_last_dealloc_index = __diff; + } + + // Get the position of the iterator that has been found. + const size_t __rotate = (__displacement + % size_t(__detail::bits_per_block)); + size_t* __bitmapC = + reinterpret_cast + (_S_mem_blocks[__diff].first) - 1; + __bitmapC -= (__displacement / size_t(__detail::bits_per_block)); + + __detail::__bit_free(__bitmapC, __rotate); + size_t* __puse_count = reinterpret_cast + (_S_mem_blocks[__diff].first) + - (__gnu_cxx::__detail::__num_bitmaps(_S_mem_blocks[__diff]) + 1); + + _GLIBCXX_DEBUG_ASSERT(*__puse_count != 0); + + --(*__puse_count); + + if (__builtin_expect(*__puse_count == 0, false)) + { + _S_block_size /= 2; + + // We can safely remove this block. + // _Block_pair __bp = _S_mem_blocks[__diff]; + this->_M_insert(__puse_count); + _S_mem_blocks.erase(_S_mem_blocks.begin() + __diff); + + // Reset the _S_last_request variable to reflect the + // erased block. We do this to protect future requests + // after the last block has been removed from a particular + // memory Chunk, which in turn has been returned to the + // free list, and hence had been erased from the vector, + // so the size of the vector gets reduced by 1. + if ((_Difference_type)_S_last_request._M_where() >= __diff--) + _S_last_request._M_reset(__diff); + + // If the Index into the vector of the region of memory + // that might hold the next address that will be passed to + // deallocated may have been invalidated due to the above + // erase procedure being called on the vector, hence we + // try to restore this invariant too. + if (_S_last_dealloc_index >= _S_mem_blocks.size()) + { + _S_last_dealloc_index =(__diff != -1 ? __diff : 0); + _GLIBCXX_DEBUG_ASSERT(_S_last_dealloc_index >= 0); + } + } + } + + public: + bitmap_allocator() throw() + { } + + bitmap_allocator(const bitmap_allocator&) + { } + + template + bitmap_allocator(const bitmap_allocator<_Tp1>&) throw() + { } + + ~bitmap_allocator() throw() + { } + + pointer + allocate(size_type __n) + { + if (__builtin_expect(__n > this->max_size(), false)) + std::__throw_bad_alloc(); + + if (__builtin_expect(__n == 1, true)) + return this->_M_allocate_single_object(); + else + { + const size_type __b = __n * sizeof(value_type); + return reinterpret_cast(::operator new(__b)); + } + } + + pointer + allocate(size_type __n, typename bitmap_allocator::const_pointer) + { return allocate(__n); } + + void + deallocate(pointer __p, size_type __n) throw() + { + if (__builtin_expect(__p != 0, true)) + { + if (__builtin_expect(__n == 1, true)) + this->_M_deallocate_single_object(__p); + else + ::operator delete(__p); + } + } + + pointer + address(reference __r) const + { return &__r; } + + const_pointer + address(const_reference __r) const + { return &__r; } + + size_type + max_size() const throw() + { return size_type(-1) / sizeof(value_type); } + + void + construct(pointer __p, const_reference __data) + { ::new((void *)__p) value_type(__data); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + void + construct(pointer __p, _Args&&... __args) + { ::new((void *)__p) _Tp(std::forward<_Args>(__args)...); } +#endif + + void + destroy(pointer __p) + { __p->~value_type(); } + }; + + template + bool + operator==(const bitmap_allocator<_Tp1>&, + const bitmap_allocator<_Tp2>&) throw() + { return true; } + + template + bool + operator!=(const bitmap_allocator<_Tp1>&, + const bitmap_allocator<_Tp2>&) throw() + { return false; } + + // Static member definitions. + template + typename bitmap_allocator<_Tp>::_BPVector + bitmap_allocator<_Tp>::_S_mem_blocks; + + template + size_t bitmap_allocator<_Tp>::_S_block_size = + 2 * size_t(__detail::bits_per_block); + + template + typename __gnu_cxx::bitmap_allocator<_Tp>::_BPVector::size_type + bitmap_allocator<_Tp>::_S_last_dealloc_index = 0; + + template + __gnu_cxx::__detail::_Bitmap_counter + ::_Alloc_block*> + bitmap_allocator<_Tp>::_S_last_request(_S_mem_blocks); + +#if defined __GTHREADS + template + typename bitmap_allocator<_Tp>::__mutex_type + bitmap_allocator<_Tp>::_S_mut; +#endif + +_GLIBCXX_END_NAMESPACE + +#endif + diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/cast.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/cast.h new file mode 100644 index 00000000..3ffad7c2 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/cast.h @@ -0,0 +1,113 @@ +// -*- C++ -*- + +// Copyright (C) 2008, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +#ifndef _CAST_H +#define _CAST_H 1 + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx); + + /** + * These functions are here to allow containers to support non standard + * pointer types. For normal pointers, these resolve to the use of the + * standard cast operation. For other types the functions will perform + * the apprpriate cast to/from the custom pointer class so long as that + * class meets the following conditions: + * 1) has a typedef element_type which names tehe type it points to. + * 2) has a get() const method which returns element_type*. + * 3) has a constructor which can take one element_type* argument. + */ + + /** + * This type supports the semantics of the pointer cast operators (below.) + */ + template + struct _Caster + { typedef typename _ToType::element_type* type; }; + + template + struct _Caster<_ToType*> + { typedef _ToType* type; }; + + /** + * Casting operations for cases where _FromType is not a standard pointer. + * _ToType can be a standard or non-standard pointer. Given that _FromType + * is not a pointer, it must have a get() method that returns the standard + * pointer equivalent of the address it points to, and must have an + * element_type typedef which names the type it points to. + */ + template + inline _ToType + __static_pointer_cast(const _FromType& __arg) + { return _ToType(static_cast:: + type>(__arg.get())); } + + template + inline _ToType + __dynamic_pointer_cast(const _FromType& __arg) + { return _ToType(dynamic_cast:: + type>(__arg.get())); } + + template + inline _ToType + __const_pointer_cast(const _FromType& __arg) + { return _ToType(const_cast:: + type>(__arg.get())); } + + template + inline _ToType + __reinterpret_pointer_cast(const _FromType& __arg) + { return _ToType(reinterpret_cast:: + type>(__arg.get())); } + + /** + * Casting operations for cases where _FromType is a standard pointer. + * _ToType can be a standard or non-standard pointer. + */ + template + inline _ToType + __static_pointer_cast(_FromType* __arg) + { return _ToType(static_cast:: + type>(__arg)); } + + template + inline _ToType + __dynamic_pointer_cast(_FromType* __arg) + { return _ToType(dynamic_cast:: + type>(__arg)); } + + template + inline _ToType + __const_pointer_cast(_FromType* __arg) + { return _ToType(const_cast:: + type>(__arg)); } + + template + inline _ToType + __reinterpret_pointer_cast(_FromType* __arg) + { return _ToType(reinterpret_cast:: + type>(__arg)); } + +_GLIBCXX_END_NAMESPACE + +#endif // _CAST_H diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/codecvt_specializations.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/codecvt_specializations.h new file mode 100644 index 00000000..89adb3f2 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/codecvt_specializations.h @@ -0,0 +1,507 @@ +// Locale support (codecvt) -*- C++ -*- + +// Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +// +// ISO C++ 14882: 22.2.1.5 Template class codecvt +// + +// Written by Benjamin Kosnik + +/** @file ext/codecvt_specializations.h + * This file is a GNU extension to the Standard C++ Library. + */ + +#ifndef _EXT_CODECVT_SPECIALIZATIONS_H +#define _EXT_CODECVT_SPECIALIZATIONS_H 1 + +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + /// Extension to use iconv for dealing with character encodings. + // This includes conversions and comparisons between various character + // sets. This object encapsulates data that may need to be shared between + // char_traits, codecvt and ctype. + class encoding_state + { + public: + // Types: + // NB: A conversion descriptor subsumes and enhances the + // functionality of a simple state type such as mbstate_t. + typedef iconv_t descriptor_type; + + protected: + // Name of internal character set encoding. + std::string _M_int_enc; + + // Name of external character set encoding. + std::string _M_ext_enc; + + // Conversion descriptor between external encoding to internal encoding. + descriptor_type _M_in_desc; + + // Conversion descriptor between internal encoding to external encoding. + descriptor_type _M_out_desc; + + // The byte-order marker for the external encoding, if necessary. + int _M_ext_bom; + + // The byte-order marker for the internal encoding, if necessary. + int _M_int_bom; + + // Number of external bytes needed to construct one complete + // character in the internal encoding. + // NB: -1 indicates variable, or stateful, encodings. + int _M_bytes; + + public: + explicit + encoding_state() + : _M_in_desc(0), _M_out_desc(0), _M_ext_bom(0), _M_int_bom(0), _M_bytes(0) + { } + + explicit + encoding_state(const char* __int, const char* __ext, + int __ibom = 0, int __ebom = 0, int __bytes = 1) + : _M_int_enc(__int), _M_ext_enc(__ext), _M_in_desc(0), _M_out_desc(0), + _M_ext_bom(__ebom), _M_int_bom(__ibom), _M_bytes(__bytes) + { init(); } + + // 21.1.2 traits typedefs + // p4 + // typedef STATE_T state_type + // requires: state_type shall meet the requirements of + // CopyConstructible types (20.1.3) + // NB: This does not preserve the actual state of the conversion + // descriptor member, but it does duplicate the encoding + // information. + encoding_state(const encoding_state& __obj) : _M_in_desc(0), _M_out_desc(0) + { construct(__obj); } + + // Need assignment operator as well. + encoding_state& + operator=(const encoding_state& __obj) + { + construct(__obj); + return *this; + } + + ~encoding_state() + { destroy(); } + + bool + good() const throw() + { + const descriptor_type __err = (iconv_t)(-1); + bool __test = _M_in_desc && _M_in_desc != __err; + __test &= _M_out_desc && _M_out_desc != __err; + return __test; + } + + int + character_ratio() const + { return _M_bytes; } + + const std::string + internal_encoding() const + { return _M_int_enc; } + + int + internal_bom() const + { return _M_int_bom; } + + const std::string + external_encoding() const + { return _M_ext_enc; } + + int + external_bom() const + { return _M_ext_bom; } + + const descriptor_type& + in_descriptor() const + { return _M_in_desc; } + + const descriptor_type& + out_descriptor() const + { return _M_out_desc; } + + protected: + void + init() + { + const descriptor_type __err = (iconv_t)(-1); + const bool __have_encodings = _M_int_enc.size() && _M_ext_enc.size(); + if (!_M_in_desc && __have_encodings) + { + _M_in_desc = iconv_open(_M_int_enc.c_str(), _M_ext_enc.c_str()); + if (_M_in_desc == __err) + std::__throw_runtime_error(__N("encoding_state::_M_init " + "creating iconv input descriptor failed")); + } + if (!_M_out_desc && __have_encodings) + { + _M_out_desc = iconv_open(_M_ext_enc.c_str(), _M_int_enc.c_str()); + if (_M_out_desc == __err) + std::__throw_runtime_error(__N("encoding_state::_M_init " + "creating iconv output descriptor failed")); + } + } + + void + construct(const encoding_state& __obj) + { + destroy(); + _M_int_enc = __obj._M_int_enc; + _M_ext_enc = __obj._M_ext_enc; + _M_ext_bom = __obj._M_ext_bom; + _M_int_bom = __obj._M_int_bom; + _M_bytes = __obj._M_bytes; + init(); + } + + void + destroy() throw() + { + const descriptor_type __err = (iconv_t)(-1); + if (_M_in_desc && _M_in_desc != __err) + { + iconv_close(_M_in_desc); + _M_in_desc = 0; + } + if (_M_out_desc && _M_out_desc != __err) + { + iconv_close(_M_out_desc); + _M_out_desc = 0; + } + } + }; + + /// encoding_char_traits + // Custom traits type with encoding_state for the state type, and the + // associated fpos for the position type, all other + // bits equivalent to the required char_traits instantiations. + template + struct encoding_char_traits : public std::char_traits<_CharT> + { + typedef encoding_state state_type; + typedef typename std::fpos pos_type; + }; + +_GLIBCXX_END_NAMESPACE + + +_GLIBCXX_BEGIN_NAMESPACE(std) + + using __gnu_cxx::encoding_state; + + /// codecvt specialization. + // This partial specialization takes advantage of iconv to provide + // code conversions between a large number of character encodings. + template + class codecvt<_InternT, _ExternT, encoding_state> + : public __codecvt_abstract_base<_InternT, _ExternT, encoding_state> + { + public: + // Types: + typedef codecvt_base::result result; + typedef _InternT intern_type; + typedef _ExternT extern_type; + typedef __gnu_cxx::encoding_state state_type; + typedef state_type::descriptor_type descriptor_type; + + // Data Members: + static locale::id id; + + explicit + codecvt(size_t __refs = 0) + : __codecvt_abstract_base(__refs) + { } + + explicit + codecvt(state_type& __enc, size_t __refs = 0) + : __codecvt_abstract_base(__refs) + { } + + protected: + virtual + ~codecvt() { } + + virtual result + do_out(state_type& __state, const intern_type* __from, + const intern_type* __from_end, const intern_type*& __from_next, + extern_type* __to, extern_type* __to_end, + extern_type*& __to_next) const; + + virtual result + do_unshift(state_type& __state, extern_type* __to, + extern_type* __to_end, extern_type*& __to_next) const; + + virtual result + do_in(state_type& __state, const extern_type* __from, + const extern_type* __from_end, const extern_type*& __from_next, + intern_type* __to, intern_type* __to_end, + intern_type*& __to_next) const; + + virtual int + do_encoding() const throw(); + + virtual bool + do_always_noconv() const throw(); + + virtual int + do_length(state_type&, const extern_type* __from, + const extern_type* __end, size_t __max) const; + + virtual int + do_max_length() const throw(); + }; + + template + locale::id + codecvt<_InternT, _ExternT, encoding_state>::id; + + // This adaptor works around the signature problems of the second + // argument to iconv(): SUSv2 and others use 'const char**', but glibc 2.2 + // uses 'char**', which matches the POSIX 1003.1-2001 standard. + // Using this adaptor, g++ will do the work for us. + template + inline size_t + __iconv_adaptor(size_t(*__func)(iconv_t, _Tp, size_t*, char**, size_t*), + iconv_t __cd, char** __inbuf, size_t* __inbytes, + char** __outbuf, size_t* __outbytes) + { return __func(__cd, (_Tp)__inbuf, __inbytes, __outbuf, __outbytes); } + + template + codecvt_base::result + codecvt<_InternT, _ExternT, encoding_state>:: + do_out(state_type& __state, const intern_type* __from, + const intern_type* __from_end, const intern_type*& __from_next, + extern_type* __to, extern_type* __to_end, + extern_type*& __to_next) const + { + result __ret = codecvt_base::error; + if (__state.good()) + { + const descriptor_type& __desc = __state.out_descriptor(); + const size_t __fmultiple = sizeof(intern_type); + size_t __fbytes = __fmultiple * (__from_end - __from); + const size_t __tmultiple = sizeof(extern_type); + size_t __tbytes = __tmultiple * (__to_end - __to); + + // Argument list for iconv specifies a byte sequence. Thus, + // all to/from arrays must be brutally casted to char*. + char* __cto = reinterpret_cast(__to); + char* __cfrom; + size_t __conv; + + // Some encodings need a byte order marker as the first item + // in the byte stream, to designate endian-ness. The default + // value for the byte order marker is NULL, so if this is + // the case, it's not necessary and we can just go on our + // merry way. + int __int_bom = __state.internal_bom(); + if (__int_bom) + { + size_t __size = __from_end - __from; + intern_type* __cfixed = static_cast + (__builtin_alloca(sizeof(intern_type) * (__size + 1))); + __cfixed[0] = static_cast(__int_bom); + char_traits::copy(__cfixed + 1, __from, __size); + __cfrom = reinterpret_cast(__cfixed); + __conv = __iconv_adaptor(iconv, __desc, &__cfrom, + &__fbytes, &__cto, &__tbytes); + } + else + { + intern_type* __cfixed = const_cast(__from); + __cfrom = reinterpret_cast(__cfixed); + __conv = __iconv_adaptor(iconv, __desc, &__cfrom, &__fbytes, + &__cto, &__tbytes); + } + + if (__conv != size_t(-1)) + { + __from_next = reinterpret_cast(__cfrom); + __to_next = reinterpret_cast(__cto); + __ret = codecvt_base::ok; + } + else + { + if (__fbytes < __fmultiple * (__from_end - __from)) + { + __from_next = reinterpret_cast(__cfrom); + __to_next = reinterpret_cast(__cto); + __ret = codecvt_base::partial; + } + else + __ret = codecvt_base::error; + } + } + return __ret; + } + + template + codecvt_base::result + codecvt<_InternT, _ExternT, encoding_state>:: + do_unshift(state_type& __state, extern_type* __to, + extern_type* __to_end, extern_type*& __to_next) const + { + result __ret = codecvt_base::error; + if (__state.good()) + { + const descriptor_type& __desc = __state.in_descriptor(); + const size_t __tmultiple = sizeof(intern_type); + size_t __tlen = __tmultiple * (__to_end - __to); + + // Argument list for iconv specifies a byte sequence. Thus, + // all to/from arrays must be brutally casted to char*. + char* __cto = reinterpret_cast(__to); + size_t __conv = __iconv_adaptor(iconv,__desc, NULL, NULL, + &__cto, &__tlen); + + if (__conv != size_t(-1)) + { + __to_next = reinterpret_cast(__cto); + if (__tlen == __tmultiple * (__to_end - __to)) + __ret = codecvt_base::noconv; + else if (__tlen == 0) + __ret = codecvt_base::ok; + else + __ret = codecvt_base::partial; + } + else + __ret = codecvt_base::error; + } + return __ret; + } + + template + codecvt_base::result + codecvt<_InternT, _ExternT, encoding_state>:: + do_in(state_type& __state, const extern_type* __from, + const extern_type* __from_end, const extern_type*& __from_next, + intern_type* __to, intern_type* __to_end, + intern_type*& __to_next) const + { + result __ret = codecvt_base::error; + if (__state.good()) + { + const descriptor_type& __desc = __state.in_descriptor(); + const size_t __fmultiple = sizeof(extern_type); + size_t __flen = __fmultiple * (__from_end - __from); + const size_t __tmultiple = sizeof(intern_type); + size_t __tlen = __tmultiple * (__to_end - __to); + + // Argument list for iconv specifies a byte sequence. Thus, + // all to/from arrays must be brutally casted to char*. + char* __cto = reinterpret_cast(__to); + char* __cfrom; + size_t __conv; + + // Some encodings need a byte order marker as the first item + // in the byte stream, to designate endian-ness. The default + // value for the byte order marker is NULL, so if this is + // the case, it's not necessary and we can just go on our + // merry way. + int __ext_bom = __state.external_bom(); + if (__ext_bom) + { + size_t __size = __from_end - __from; + extern_type* __cfixed = static_cast + (__builtin_alloca(sizeof(extern_type) * (__size + 1))); + __cfixed[0] = static_cast(__ext_bom); + char_traits::copy(__cfixed + 1, __from, __size); + __cfrom = reinterpret_cast(__cfixed); + __conv = __iconv_adaptor(iconv, __desc, &__cfrom, + &__flen, &__cto, &__tlen); + } + else + { + extern_type* __cfixed = const_cast(__from); + __cfrom = reinterpret_cast(__cfixed); + __conv = __iconv_adaptor(iconv, __desc, &__cfrom, + &__flen, &__cto, &__tlen); + } + + + if (__conv != size_t(-1)) + { + __from_next = reinterpret_cast(__cfrom); + __to_next = reinterpret_cast(__cto); + __ret = codecvt_base::ok; + } + else + { + if (__flen < static_cast(__from_end - __from)) + { + __from_next = reinterpret_cast(__cfrom); + __to_next = reinterpret_cast(__cto); + __ret = codecvt_base::partial; + } + else + __ret = codecvt_base::error; + } + } + return __ret; + } + + template + int + codecvt<_InternT, _ExternT, encoding_state>:: + do_encoding() const throw() + { + int __ret = 0; + if (sizeof(_ExternT) <= sizeof(_InternT)) + __ret = sizeof(_InternT) / sizeof(_ExternT); + return __ret; + } + + template + bool + codecvt<_InternT, _ExternT, encoding_state>:: + do_always_noconv() const throw() + { return false; } + + template + int + codecvt<_InternT, _ExternT, encoding_state>:: + do_length(state_type&, const extern_type* __from, + const extern_type* __end, size_t __max) const + { return std::min(__max, static_cast(__end - __from)); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 74. Garbled text for codecvt::do_max_length + template + int + codecvt<_InternT, _ExternT, encoding_state>:: + do_max_length() const throw() + { return 1; } + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/concurrence.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/concurrence.h new file mode 100644 index 00000000..71f8cd0a --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/concurrence.h @@ -0,0 +1,322 @@ +// Support for concurrent programing -*- C++ -*- + +// Copyright (C) 2003, 2004, 2005, 2006, 2007, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file concurrence.h + * This is an internal header file, included by other library headers. + * You should not attempt to use it directly. + */ + +#ifndef _CONCURRENCE_H +#define _CONCURRENCE_H 1 + +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + // Available locking policies: + // _S_single single-threaded code that doesn't need to be locked. + // _S_mutex multi-threaded code that requires additional support + // from gthr.h or abstraction layers in concurrence.h. + // _S_atomic multi-threaded code using atomic operations. + enum _Lock_policy { _S_single, _S_mutex, _S_atomic }; + + // Compile time constant that indicates prefered locking policy in + // the current configuration. + static const _Lock_policy __default_lock_policy = +#ifdef __GTHREADS +#if (defined(__GCC_HAVE_SYNC_COMPARE_AND_SWAP_2) \ + && defined(__GCC_HAVE_SYNC_COMPARE_AND_SWAP_4)) + _S_atomic; +#else + _S_mutex; +#endif +#else + _S_single; +#endif + + // NB: As this is used in libsupc++, need to only depend on + // exception. No stdexception classes, no use of std::string. + class __concurrence_lock_error : public std::exception + { + public: + virtual char const* + what() const throw() + { return "__gnu_cxx::__concurrence_lock_error"; } + }; + + class __concurrence_unlock_error : public std::exception + { + public: + virtual char const* + what() const throw() + { return "__gnu_cxx::__concurrence_unlock_error"; } + }; + + class __concurrence_broadcast_error : public std::exception + { + public: + virtual char const* + what() const throw() + { return "__gnu_cxx::__concurrence_broadcast_error"; } + }; + + class __concurrence_wait_error : public std::exception + { + public: + virtual char const* + what() const throw() + { return "__gnu_cxx::__concurrence_wait_error"; } + }; + + // Substitute for concurrence_error object in the case of -fno-exceptions. + inline void + __throw_concurrence_lock_error() + { +#if __EXCEPTIONS + throw __concurrence_lock_error(); +#else + __builtin_abort(); +#endif + } + + inline void + __throw_concurrence_unlock_error() + { +#if __EXCEPTIONS + throw __concurrence_unlock_error(); +#else + __builtin_abort(); +#endif + } + +#ifdef __GTHREAD_HAS_COND + inline void + __throw_concurrence_broadcast_error() + { +#if __EXCEPTIONS + throw __concurrence_broadcast_error(); +#else + __builtin_abort(); +#endif + } + + inline void + __throw_concurrence_wait_error() + { +#if __EXCEPTIONS + throw __concurrence_wait_error(); +#else + __builtin_abort(); +#endif + } +#endif + + class __mutex + { + private: + __gthread_mutex_t _M_mutex; + + __mutex(const __mutex&); + __mutex& operator=(const __mutex&); + + public: + __mutex() + { +#if __GTHREADS + if (__gthread_active_p()) + { +#if defined __GTHREAD_MUTEX_INIT + __gthread_mutex_t __tmp = __GTHREAD_MUTEX_INIT; + _M_mutex = __tmp; +#else + __GTHREAD_MUTEX_INIT_FUNCTION(&_M_mutex); +#endif + } +#endif + } + + void lock() + { +#if __GTHREADS + if (__gthread_active_p()) + { + if (__gthread_mutex_lock(&_M_mutex) != 0) + __throw_concurrence_lock_error(); + } +#endif + } + + void unlock() + { +#if __GTHREADS + if (__gthread_active_p()) + { + if (__gthread_mutex_unlock(&_M_mutex) != 0) + __throw_concurrence_unlock_error(); + } +#endif + } + + __gthread_mutex_t* gthread_mutex(void) + { return &_M_mutex; } + }; + + class __recursive_mutex + { + private: + __gthread_recursive_mutex_t _M_mutex; + + __recursive_mutex(const __recursive_mutex&); + __recursive_mutex& operator=(const __recursive_mutex&); + + public: + __recursive_mutex() + { +#if __GTHREADS + if (__gthread_active_p()) + { +#if defined __GTHREAD_RECURSIVE_MUTEX_INIT + __gthread_recursive_mutex_t __tmp = __GTHREAD_RECURSIVE_MUTEX_INIT; + _M_mutex = __tmp; +#else + __GTHREAD_RECURSIVE_MUTEX_INIT_FUNCTION(&_M_mutex); +#endif + } +#endif + } + + void lock() + { +#if __GTHREADS + if (__gthread_active_p()) + { + if (__gthread_recursive_mutex_lock(&_M_mutex) != 0) + __throw_concurrence_lock_error(); + } +#endif + } + + void unlock() + { +#if __GTHREADS + if (__gthread_active_p()) + { + if (__gthread_recursive_mutex_unlock(&_M_mutex) != 0) + __throw_concurrence_unlock_error(); + } +#endif + } + + __gthread_recursive_mutex_t* gthread_recursive_mutex(void) + { return &_M_mutex; } + }; + + /// Scoped lock idiom. + // Acquire the mutex here with a constructor call, then release with + // the destructor call in accordance with RAII style. + class __scoped_lock + { + public: + typedef __mutex __mutex_type; + + private: + __mutex_type& _M_device; + + __scoped_lock(const __scoped_lock&); + __scoped_lock& operator=(const __scoped_lock&); + + public: + explicit __scoped_lock(__mutex_type& __name) : _M_device(__name) + { _M_device.lock(); } + + ~__scoped_lock() throw() + { _M_device.unlock(); } + }; + +#ifdef __GTHREAD_HAS_COND + class __cond + { + private: + __gthread_cond_t _M_cond; + + __cond(const __cond&); + __cond& operator=(const __cond&); + + public: + __cond() + { +#if __GTHREADS + if (__gthread_active_p()) + { +#if defined __GTHREAD_COND_INIT + __gthread_cond_t __tmp = __GTHREAD_COND_INIT; + _M_cond = __tmp; +#else + __GTHREAD_COND_INIT_FUNCTION(&_M_cond); +#endif + } +#endif + } + + void broadcast() + { +#if __GTHREADS + if (__gthread_active_p()) + { + if (__gthread_cond_broadcast(&_M_cond) != 0) + __throw_concurrence_broadcast_error(); + } +#endif + } + + void wait(__mutex *mutex) + { +#if __GTHREADS + { + if (__gthread_cond_wait(&_M_cond, mutex->gthread_mutex()) != 0) + __throw_concurrence_wait_error(); + } +#endif + } + + void wait_recursive(__recursive_mutex *mutex) + { +#if __GTHREADS + { + if (__gthread_cond_wait_recursive(&_M_cond, + mutex->gthread_recursive_mutex()) + != 0) + __throw_concurrence_wait_error(); + } +#endif + } + }; +#endif + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/debug_allocator.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/debug_allocator.h new file mode 100644 index 00000000..18d80498 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/debug_allocator.h @@ -0,0 +1,124 @@ +// Allocators -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * Copyright (c) 1996-1997 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file ext/debug_allocator.h + * This file is a GNU extension to the Standard C++ Library. + * You should only include this header if you are using GCC 3 or later. + */ + +#ifndef _DEBUG_ALLOCATOR_H +#define _DEBUG_ALLOCATOR_H 1 + +#include + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + using std::size_t; + + /** + * @brief A meta-allocator with debugging bits, as per [20.4]. + * @ingroup allocators + * + * This is precisely the allocator defined in the C++ Standard. + * - all allocation calls operator new + * - all deallocation calls operator delete + */ + template + class debug_allocator + { + public: + typedef typename _Alloc::size_type size_type; + typedef typename _Alloc::difference_type difference_type; + typedef typename _Alloc::pointer pointer; + typedef typename _Alloc::const_pointer const_pointer; + typedef typename _Alloc::reference reference; + typedef typename _Alloc::const_reference const_reference; + typedef typename _Alloc::value_type value_type; + + private: + // _M_extra is the number of objects that correspond to the + // extra space where debug information is stored. + size_type _M_extra; + + _Alloc _M_allocator; + + public: + debug_allocator() + { + const size_t __obj_size = sizeof(value_type); + _M_extra = (sizeof(size_type) + __obj_size - 1) / __obj_size; + } + + pointer + allocate(size_type __n) + { + pointer __res = _M_allocator.allocate(__n + _M_extra); + size_type* __ps = reinterpret_cast(__res); + *__ps = __n; + return __res + _M_extra; + } + + pointer + allocate(size_type __n, const void* __hint) + { + pointer __res = _M_allocator.allocate(__n + _M_extra, __hint); + size_type* __ps = reinterpret_cast(__res); + *__ps = __n; + return __res + _M_extra; + } + + void + deallocate(pointer __p, size_type __n) + { + if (__p) + { + pointer __real_p = __p - _M_extra; + if (*reinterpret_cast(__real_p) != __n) + { + throw std::runtime_error("debug_allocator::deallocate" + " wrong size"); + } + _M_allocator.deallocate(__real_p, __n + _M_extra); + } + else + throw std::runtime_error("debug_allocator::deallocate null pointer"); + } + }; + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/enc_filebuf.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/enc_filebuf.h new file mode 100644 index 00000000..4f835679 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/enc_filebuf.h @@ -0,0 +1,62 @@ +// filebuf with encoding state type -*- C++ -*- + +// Copyright (C) 2002, 2003, 2004, 2007, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file ext/enc_filebuf.h + * This file is a GNU extension to the Standard C++ Library. + */ + +#ifndef _EXT_ENC_FILEBUF_H +#define _EXT_ENC_FILEBUF_H 1 + +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + /// class enc_filebuf. + template + class enc_filebuf + : public std::basic_filebuf<_CharT, encoding_char_traits<_CharT> > + { + public: + typedef encoding_char_traits<_CharT> traits_type; + typedef typename traits_type::state_type state_type; + typedef typename traits_type::pos_type pos_type; + + enc_filebuf(state_type& __state) + : std::basic_filebuf<_CharT, encoding_char_traits<_CharT> >() + { this->_M_state_beg = __state; } + + private: + // concept requirements: + // Set state type to something useful. + // Something more than copyconstructible is needed here, so + // require default and copy constructible + assignment operator. + __glibcxx_class_requires(state_type, _SGIAssignableConcept) + }; + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/extptr_allocator.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/extptr_allocator.h new file mode 100644 index 00000000..fab6b1d8 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/extptr_allocator.h @@ -0,0 +1,176 @@ +// -*- C++ -*- + +// Copyright (C) 2008, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** + * @file ext/extptr_allocator.h + * @author Bob Walters + * + * An example allocator which uses an alternative pointer type from + * bits/pointer.h. Supports test cases which confirm container support + * for alternative pointers. + */ + +#ifndef _EXTPTR_ALLOCATOR_H +#define _EXTPTR_ALLOCATOR_H 1 + +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + /** + * @brief An example allocator which uses a non-standard pointer type. + * @ingroup allocators + * + * This allocator specifies that containers use a 'relative pointer' as it's + * pointer type. (See ext/pointer.h) Memory allocation in this example + * is still performed using std::allocator. + */ + template + class _ExtPtr_allocator + { + public: + typedef std::size_t size_type; + typedef std::ptrdiff_t difference_type; + + // Note the non-standard pointer types. + typedef _Pointer_adapter<_Relative_pointer_impl<_Tp> > pointer; + typedef _Pointer_adapter<_Relative_pointer_impl > + const_pointer; + + typedef _Tp& reference; + typedef const _Tp& const_reference; + typedef _Tp value_type; + + template + struct rebind + { typedef _ExtPtr_allocator<_Up> other; }; + + _ExtPtr_allocator() throw() + : _M_real_alloc() { } + + _ExtPtr_allocator(const _ExtPtr_allocator &__rarg) throw() + : _M_real_alloc(__rarg._M_real_alloc) { } + + template + _ExtPtr_allocator(const _ExtPtr_allocator<_Up>& __rarg) throw() + : _M_real_alloc(__rarg._M_getUnderlyingImp()) { } + + ~_ExtPtr_allocator() throw() + { } + + pointer address(reference __x) const + { return &__x; } + + const_pointer address(const_reference __x) const + { return &__x; } + + pointer allocate(size_type __n, void* __hint = 0) + { return _M_real_alloc.allocate(__n,__hint); } + + void deallocate(pointer __p, size_type __n) + { _M_real_alloc.deallocate(__p.get(), __n); } + + size_type max_size() const throw() + { return std::numeric_limits::max() / sizeof(_Tp); } + + void construct(pointer __p, const _Tp& __val) + { ::new(__p.get()) _Tp(__val); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + void + construct(pointer __p, _Args&&... __args) + { ::new(__p.get()) _Tp(std::forward<_Args>(__args)...); } +#endif + + void destroy(pointer __p) + { __p->~_Tp(); } + + template + inline bool + operator==(const _ExtPtr_allocator<_Up>& __rarg) + { return _M_real_alloc == __rarg._M_getUnderlyingImp(); } + + inline bool + operator==(const _ExtPtr_allocator& __rarg) + { return _M_real_alloc == __rarg._M_real_alloc; } + + template + inline bool + operator!=(const _ExtPtr_allocator<_Up>& __rarg) + { return _M_real_alloc != __rarg._M_getUnderlyingImp(); } + + inline bool + operator!=(const _ExtPtr_allocator& __rarg) + { return _M_real_alloc != __rarg._M_real_alloc; } + + template + inline friend void + swap(_ExtPtr_allocator<_Up>&, _ExtPtr_allocator<_Up>&); + + // A method specific to this implementation. + const std::allocator<_Tp>& + _M_getUnderlyingImp() const + { return _M_real_alloc; } + + private: + std::allocator<_Tp> _M_real_alloc; + }; + + // _ExtPtr_allocator specialization. + template<> + class _ExtPtr_allocator + { + public: + typedef std::size_t size_type; + typedef std::ptrdiff_t difference_type; + typedef void value_type; + + // Note the non-standard pointer types + typedef _Pointer_adapter<_Relative_pointer_impl > pointer; + typedef _Pointer_adapter<_Relative_pointer_impl > + const_pointer; + + template + struct rebind + { typedef _ExtPtr_allocator<_Up> other; }; + + private: + std::allocator _M_real_alloc; + }; + + template + inline void + swap(_ExtPtr_allocator<_Tp>& __larg, _ExtPtr_allocator<_Tp>& __rarg) + { + std::allocator<_Tp> __tmp( __rarg._M_real_alloc ); + __rarg._M_real_alloc = __larg._M_real_alloc; + __larg._M_real_alloc = __tmp; + } + +_GLIBCXX_END_NAMESPACE + +#endif /* _EXTPTR_ALLOCATOR_H */ diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/functional b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/functional new file mode 100644 index 00000000..30afd586 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/functional @@ -0,0 +1,425 @@ +// Functional extensions -*- C++ -*- + +// Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file ext/functional + * This file is a GNU extension to the Standard C++ Library (possibly + * containing extensions from the HP/SGI STL subset). + */ + +#ifndef _EXT_FUNCTIONAL +#define _EXT_FUNCTIONAL 1 + +#pragma GCC system_header + +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + using std::size_t; + using std::unary_function; + using std::binary_function; + using std::mem_fun1_t; + using std::const_mem_fun1_t; + using std::mem_fun1_ref_t; + using std::const_mem_fun1_ref_t; + + /** The @c identity_element functions are not part of the C++ + * standard; SGI provided them as an extension. Its argument is an + * operation, and its return value is the identity element for that + * operation. It is overloaded for addition and multiplication, + * and you can overload it for your own nefarious operations. + * + * @addtogroup SGIextensions + * @{ + */ + /// An \link SGIextensions SGI extension \endlink. + template + inline _Tp + identity_element(std::plus<_Tp>) + { return _Tp(0); } + + /// An \link SGIextensions SGI extension \endlink. + template + inline _Tp + identity_element(std::multiplies<_Tp>) + { return _Tp(1); } + /** @} */ + + /** As an extension to the binders, SGI provided composition functors and + * wrapper functions to aid in their creation. The @c unary_compose + * functor is constructed from two functions/functors, @c f and @c g. + * Calling @c operator() with a single argument @c x returns @c f(g(x)). + * The function @c compose1 takes the two functions and constructs a + * @c unary_compose variable for you. + * + * @c binary_compose is constructed from three functors, @c f, @c g1, + * and @c g2. Its @c operator() returns @c f(g1(x),g2(x)). The function + * @compose2 takes f, g1, and g2, and constructs the @c binary_compose + * instance for you. For example, if @c f returns an int, then + * \code + * int answer = (compose2(f,g1,g2))(x); + * \endcode + * is equivalent to + * \code + * int temp1 = g1(x); + * int temp2 = g2(x); + * int answer = f(temp1,temp2); + * \endcode + * But the first form is more compact, and can be passed around as a + * functor to other algorithms. + * + * @addtogroup SGIextensions + * @{ + */ + /// An \link SGIextensions SGI extension \endlink. + template + class unary_compose + : public unary_function + { + protected: + _Operation1 _M_fn1; + _Operation2 _M_fn2; + + public: + unary_compose(const _Operation1& __x, const _Operation2& __y) + : _M_fn1(__x), _M_fn2(__y) {} + + typename _Operation1::result_type + operator()(const typename _Operation2::argument_type& __x) const + { return _M_fn1(_M_fn2(__x)); } + }; + + /// An \link SGIextensions SGI extension \endlink. + template + inline unary_compose<_Operation1, _Operation2> + compose1(const _Operation1& __fn1, const _Operation2& __fn2) + { return unary_compose<_Operation1,_Operation2>(__fn1, __fn2); } + + /// An \link SGIextensions SGI extension \endlink. + template + class binary_compose + : public unary_function + { + protected: + _Operation1 _M_fn1; + _Operation2 _M_fn2; + _Operation3 _M_fn3; + + public: + binary_compose(const _Operation1& __x, const _Operation2& __y, + const _Operation3& __z) + : _M_fn1(__x), _M_fn2(__y), _M_fn3(__z) { } + + typename _Operation1::result_type + operator()(const typename _Operation2::argument_type& __x) const + { return _M_fn1(_M_fn2(__x), _M_fn3(__x)); } + }; + + /// An \link SGIextensions SGI extension \endlink. + template + inline binary_compose<_Operation1, _Operation2, _Operation3> + compose2(const _Operation1& __fn1, const _Operation2& __fn2, + const _Operation3& __fn3) + { return binary_compose<_Operation1, _Operation2, _Operation3> + (__fn1, __fn2, __fn3); } + /** @} */ + + /** As an extension, SGI provided a functor called @c identity. When a + * functor is required but no operations are desired, this can be used as a + * pass-through. Its @c operator() returns its argument unchanged. + * + * @addtogroup SGIextensions + */ + template + struct identity : public std::_Identity<_Tp> {}; + + /** @c select1st and @c select2nd are extensions provided by SGI. Their + * @c operator()s + * take a @c std::pair as an argument, and return either the first member + * or the second member, respectively. They can be used (especially with + * the composition functors) to "strip" data from a sequence before + * performing the remainder of an algorithm. + * + * @addtogroup SGIextensions + * @{ + */ + /// An \link SGIextensions SGI extension \endlink. + template + struct select1st : public std::_Select1st<_Pair> {}; + + /// An \link SGIextensions SGI extension \endlink. + template + struct select2nd : public std::_Select2nd<_Pair> {}; + /** @} */ + + // extension documented next + template + struct _Project1st : public binary_function<_Arg1, _Arg2, _Arg1> + { + _Arg1 + operator()(const _Arg1& __x, const _Arg2&) const + { return __x; } + }; + + template + struct _Project2nd : public binary_function<_Arg1, _Arg2, _Arg2> + { + _Arg2 + operator()(const _Arg1&, const _Arg2& __y) const + { return __y; } + }; + + /** The @c operator() of the @c project1st functor takes two arbitrary + * arguments and returns the first one, while @c project2nd returns the + * second one. They are extensions provided by SGI. + * + * @addtogroup SGIextensions + * @{ + */ + + /// An \link SGIextensions SGI extension \endlink. + template + struct project1st : public _Project1st<_Arg1, _Arg2> {}; + + /// An \link SGIextensions SGI extension \endlink. + template + struct project2nd : public _Project2nd<_Arg1, _Arg2> {}; + /** @} */ + + // extension documented next + template + struct _Constant_void_fun + { + typedef _Result result_type; + result_type _M_val; + + _Constant_void_fun(const result_type& __v) : _M_val(__v) {} + + const result_type& + operator()() const + { return _M_val; } + }; + + template + struct _Constant_unary_fun + { + typedef _Argument argument_type; + typedef _Result result_type; + result_type _M_val; + + _Constant_unary_fun(const result_type& __v) : _M_val(__v) {} + + const result_type& + operator()(const _Argument&) const + { return _M_val; } + }; + + template + struct _Constant_binary_fun + { + typedef _Arg1 first_argument_type; + typedef _Arg2 second_argument_type; + typedef _Result result_type; + _Result _M_val; + + _Constant_binary_fun(const _Result& __v) : _M_val(__v) {} + + const result_type& + operator()(const _Arg1&, const _Arg2&) const + { return _M_val; } + }; + + /** These three functors are each constructed from a single arbitrary + * variable/value. Later, their @c operator()s completely ignore any + * arguments passed, and return the stored value. + * - @c constant_void_fun's @c operator() takes no arguments + * - @c constant_unary_fun's @c operator() takes one argument (ignored) + * - @c constant_binary_fun's @c operator() takes two arguments (ignored) + * + * The helper creator functions @c constant0, @c constant1, and + * @c constant2 each take a "result" argument and construct variables of + * the appropriate functor type. + * + * @addtogroup SGIextensions + * @{ + */ + /// An \link SGIextensions SGI extension \endlink. + template + struct constant_void_fun + : public _Constant_void_fun<_Result> + { + constant_void_fun(const _Result& __v) + : _Constant_void_fun<_Result>(__v) {} + }; + + /// An \link SGIextensions SGI extension \endlink. + template + struct constant_unary_fun : public _Constant_unary_fun<_Result, _Argument> + { + constant_unary_fun(const _Result& __v) + : _Constant_unary_fun<_Result, _Argument>(__v) {} + }; + + /// An \link SGIextensions SGI extension \endlink. + template + struct constant_binary_fun + : public _Constant_binary_fun<_Result, _Arg1, _Arg2> + { + constant_binary_fun(const _Result& __v) + : _Constant_binary_fun<_Result, _Arg1, _Arg2>(__v) {} + }; + + /// An \link SGIextensions SGI extension \endlink. + template + inline constant_void_fun<_Result> + constant0(const _Result& __val) + { return constant_void_fun<_Result>(__val); } + + /// An \link SGIextensions SGI extension \endlink. + template + inline constant_unary_fun<_Result, _Result> + constant1(const _Result& __val) + { return constant_unary_fun<_Result, _Result>(__val); } + + /// An \link SGIextensions SGI extension \endlink. + template + inline constant_binary_fun<_Result,_Result,_Result> + constant2(const _Result& __val) + { return constant_binary_fun<_Result, _Result, _Result>(__val); } + /** @} */ + + /** The @c subtractive_rng class is documented on + * SGI's site. + * Note that this code assumes that @c int is 32 bits. + * + * @ingroup SGIextensions + */ + class subtractive_rng + : public unary_function + { + private: + unsigned int _M_table[55]; + size_t _M_index1; + size_t _M_index2; + + public: + /// Returns a number less than the argument. + unsigned int + operator()(unsigned int __limit) + { + _M_index1 = (_M_index1 + 1) % 55; + _M_index2 = (_M_index2 + 1) % 55; + _M_table[_M_index1] = _M_table[_M_index1] - _M_table[_M_index2]; + return _M_table[_M_index1] % __limit; + } + + void + _M_initialize(unsigned int __seed) + { + unsigned int __k = 1; + _M_table[54] = __seed; + size_t __i; + for (__i = 0; __i < 54; __i++) + { + size_t __ii = (21 * (__i + 1) % 55) - 1; + _M_table[__ii] = __k; + __k = __seed - __k; + __seed = _M_table[__ii]; + } + for (int __loop = 0; __loop < 4; __loop++) + { + for (__i = 0; __i < 55; __i++) + _M_table[__i] = _M_table[__i] - _M_table[(1 + __i + 30) % 55]; + } + _M_index1 = 0; + _M_index2 = 31; + } + + /// Ctor allowing you to initialize the seed. + subtractive_rng(unsigned int __seed) + { _M_initialize(__seed); } + + /// Default ctor; initializes its state with some number you don't see. + subtractive_rng() + { _M_initialize(161803398u); } + }; + + // Mem_fun adaptor helper functions mem_fun1 and mem_fun1_ref, + // provided for backward compatibility, they are no longer part of + // the C++ standard. + + template + inline mem_fun1_t<_Ret, _Tp, _Arg> + mem_fun1(_Ret (_Tp::*__f)(_Arg)) + { return mem_fun1_t<_Ret, _Tp, _Arg>(__f); } + + template + inline const_mem_fun1_t<_Ret, _Tp, _Arg> + mem_fun1(_Ret (_Tp::*__f)(_Arg) const) + { return const_mem_fun1_t<_Ret, _Tp, _Arg>(__f); } + + template + inline mem_fun1_ref_t<_Ret, _Tp, _Arg> + mem_fun1_ref(_Ret (_Tp::*__f)(_Arg)) + { return mem_fun1_ref_t<_Ret, _Tp, _Arg>(__f); } + + template + inline const_mem_fun1_ref_t<_Ret, _Tp, _Arg> + mem_fun1_ref(_Ret (_Tp::*__f)(_Arg) const) + { return const_mem_fun1_ref_t<_Ret, _Tp, _Arg>(__f); } + +_GLIBCXX_END_NAMESPACE + +#endif + diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/hash_map b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/hash_map new file mode 100644 index 00000000..469429cc --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/hash_map @@ -0,0 +1,590 @@ +// Hashing map implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2004, 2005, 2006, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * Copyright (c) 1996 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + */ + +/** @file backward/hash_map + * This file is a GNU extension to the Standard C++ Library (possibly + * containing extensions from the HP/SGI STL subset). + */ + +#ifndef _HASH_MAP +#define _HASH_MAP 1 + +#include "backward_warning.h" +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + using std::equal_to; + using std::allocator; + using std::pair; + using std::_Select1st; + + /** + * This is an SGI extension. + * @ingroup SGIextensions + * @doctodo + */ + template, + class _EqualKey = equal_to<_Key>, class _Alloc = allocator<_Tp> > + class hash_map + { + private: + typedef hashtable,_Key, _HashFn, + _Select1st >, + _EqualKey, _Alloc> _Ht; + + _Ht _M_ht; + + public: + typedef typename _Ht::key_type key_type; + typedef _Tp data_type; + typedef _Tp mapped_type; + typedef typename _Ht::value_type value_type; + typedef typename _Ht::hasher hasher; + typedef typename _Ht::key_equal key_equal; + + typedef typename _Ht::size_type size_type; + typedef typename _Ht::difference_type difference_type; + typedef typename _Ht::pointer pointer; + typedef typename _Ht::const_pointer const_pointer; + typedef typename _Ht::reference reference; + typedef typename _Ht::const_reference const_reference; + + typedef typename _Ht::iterator iterator; + typedef typename _Ht::const_iterator const_iterator; + + typedef typename _Ht::allocator_type allocator_type; + + hasher + hash_funct() const + { return _M_ht.hash_funct(); } + + key_equal + key_eq() const + { return _M_ht.key_eq(); } + + allocator_type + get_allocator() const + { return _M_ht.get_allocator(); } + + hash_map() + : _M_ht(100, hasher(), key_equal(), allocator_type()) {} + + explicit + hash_map(size_type __n) + : _M_ht(__n, hasher(), key_equal(), allocator_type()) {} + + hash_map(size_type __n, const hasher& __hf) + : _M_ht(__n, __hf, key_equal(), allocator_type()) {} + + hash_map(size_type __n, const hasher& __hf, const key_equal& __eql, + const allocator_type& __a = allocator_type()) + : _M_ht(__n, __hf, __eql, __a) {} + + template + hash_map(_InputIterator __f, _InputIterator __l) + : _M_ht(100, hasher(), key_equal(), allocator_type()) + { _M_ht.insert_unique(__f, __l); } + + template + hash_map(_InputIterator __f, _InputIterator __l, size_type __n) + : _M_ht(__n, hasher(), key_equal(), allocator_type()) + { _M_ht.insert_unique(__f, __l); } + + template + hash_map(_InputIterator __f, _InputIterator __l, size_type __n, + const hasher& __hf) + : _M_ht(__n, __hf, key_equal(), allocator_type()) + { _M_ht.insert_unique(__f, __l); } + + template + hash_map(_InputIterator __f, _InputIterator __l, size_type __n, + const hasher& __hf, const key_equal& __eql, + const allocator_type& __a = allocator_type()) + : _M_ht(__n, __hf, __eql, __a) + { _M_ht.insert_unique(__f, __l); } + + size_type + size() const + { return _M_ht.size(); } + + size_type + max_size() const + { return _M_ht.max_size(); } + + bool + empty() const + { return _M_ht.empty(); } + + void + swap(hash_map& __hs) + { _M_ht.swap(__hs._M_ht); } + + template + friend bool + operator== (const hash_map<_K1, _T1, _HF, _EqK, _Al>&, + const hash_map<_K1, _T1, _HF, _EqK, _Al>&); + + iterator + begin() + { return _M_ht.begin(); } + + iterator + end() + { return _M_ht.end(); } + + const_iterator + begin() const + { return _M_ht.begin(); } + + const_iterator + end() const + { return _M_ht.end(); } + + pair + insert(const value_type& __obj) + { return _M_ht.insert_unique(__obj); } + + template + void + insert(_InputIterator __f, _InputIterator __l) + { _M_ht.insert_unique(__f, __l); } + + pair + insert_noresize(const value_type& __obj) + { return _M_ht.insert_unique_noresize(__obj); } + + iterator + find(const key_type& __key) + { return _M_ht.find(__key); } + + const_iterator + find(const key_type& __key) const + { return _M_ht.find(__key); } + + _Tp& + operator[](const key_type& __key) + { return _M_ht.find_or_insert(value_type(__key, _Tp())).second; } + + size_type + count(const key_type& __key) const + { return _M_ht.count(__key); } + + pair + equal_range(const key_type& __key) + { return _M_ht.equal_range(__key); } + + pair + equal_range(const key_type& __key) const + { return _M_ht.equal_range(__key); } + + size_type + erase(const key_type& __key) + {return _M_ht.erase(__key); } + + void + erase(iterator __it) + { _M_ht.erase(__it); } + + void + erase(iterator __f, iterator __l) + { _M_ht.erase(__f, __l); } + + void + clear() + { _M_ht.clear(); } + + void + resize(size_type __hint) + { _M_ht.resize(__hint); } + + size_type + bucket_count() const + { return _M_ht.bucket_count(); } + + size_type + max_bucket_count() const + { return _M_ht.max_bucket_count(); } + + size_type + elems_in_bucket(size_type __n) const + { return _M_ht.elems_in_bucket(__n); } + }; + + template + inline bool + operator==(const hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm1, + const hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm2) + { return __hm1._M_ht == __hm2._M_ht; } + + template + inline bool + operator!=(const hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm1, + const hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm2) + { return !(__hm1 == __hm2); } + + template + inline void + swap(hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm1, + hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm2) + { __hm1.swap(__hm2); } + + + /** + * This is an SGI extension. + * @ingroup SGIextensions + * @doctodo + */ + template, + class _EqualKey = equal_to<_Key>, + class _Alloc = allocator<_Tp> > + class hash_multimap + { + // concept requirements + __glibcxx_class_requires(_Key, _SGIAssignableConcept) + __glibcxx_class_requires(_Tp, _SGIAssignableConcept) + __glibcxx_class_requires3(_HashFn, size_t, _Key, _UnaryFunctionConcept) + __glibcxx_class_requires3(_EqualKey, _Key, _Key, _BinaryPredicateConcept) + + private: + typedef hashtable, _Key, _HashFn, + _Select1st >, _EqualKey, _Alloc> + _Ht; + + _Ht _M_ht; + + public: + typedef typename _Ht::key_type key_type; + typedef _Tp data_type; + typedef _Tp mapped_type; + typedef typename _Ht::value_type value_type; + typedef typename _Ht::hasher hasher; + typedef typename _Ht::key_equal key_equal; + + typedef typename _Ht::size_type size_type; + typedef typename _Ht::difference_type difference_type; + typedef typename _Ht::pointer pointer; + typedef typename _Ht::const_pointer const_pointer; + typedef typename _Ht::reference reference; + typedef typename _Ht::const_reference const_reference; + + typedef typename _Ht::iterator iterator; + typedef typename _Ht::const_iterator const_iterator; + + typedef typename _Ht::allocator_type allocator_type; + + hasher + hash_funct() const + { return _M_ht.hash_funct(); } + + key_equal + key_eq() const + { return _M_ht.key_eq(); } + + allocator_type + get_allocator() const + { return _M_ht.get_allocator(); } + + hash_multimap() + : _M_ht(100, hasher(), key_equal(), allocator_type()) {} + + explicit + hash_multimap(size_type __n) + : _M_ht(__n, hasher(), key_equal(), allocator_type()) {} + + hash_multimap(size_type __n, const hasher& __hf) + : _M_ht(__n, __hf, key_equal(), allocator_type()) {} + + hash_multimap(size_type __n, const hasher& __hf, const key_equal& __eql, + const allocator_type& __a = allocator_type()) + : _M_ht(__n, __hf, __eql, __a) {} + + template + hash_multimap(_InputIterator __f, _InputIterator __l) + : _M_ht(100, hasher(), key_equal(), allocator_type()) + { _M_ht.insert_equal(__f, __l); } + + template + hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n) + : _M_ht(__n, hasher(), key_equal(), allocator_type()) + { _M_ht.insert_equal(__f, __l); } + + template + hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n, + const hasher& __hf) + : _M_ht(__n, __hf, key_equal(), allocator_type()) + { _M_ht.insert_equal(__f, __l); } + + template + hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n, + const hasher& __hf, const key_equal& __eql, + const allocator_type& __a = allocator_type()) + : _M_ht(__n, __hf, __eql, __a) + { _M_ht.insert_equal(__f, __l); } + + size_type + size() const + { return _M_ht.size(); } + + size_type + max_size() const + { return _M_ht.max_size(); } + + bool + empty() const + { return _M_ht.empty(); } + + void + swap(hash_multimap& __hs) + { _M_ht.swap(__hs._M_ht); } + + template + friend bool + operator==(const hash_multimap<_K1, _T1, _HF, _EqK, _Al>&, + const hash_multimap<_K1, _T1, _HF, _EqK, _Al>&); + + iterator + begin() + { return _M_ht.begin(); } + + iterator + end() + { return _M_ht.end(); } + + const_iterator + begin() const + { return _M_ht.begin(); } + + const_iterator + end() const + { return _M_ht.end(); } + + iterator + insert(const value_type& __obj) + { return _M_ht.insert_equal(__obj); } + + template + void + insert(_InputIterator __f, _InputIterator __l) + { _M_ht.insert_equal(__f,__l); } + + iterator + insert_noresize(const value_type& __obj) + { return _M_ht.insert_equal_noresize(__obj); } + + iterator + find(const key_type& __key) + { return _M_ht.find(__key); } + + const_iterator + find(const key_type& __key) const + { return _M_ht.find(__key); } + + size_type + count(const key_type& __key) const + { return _M_ht.count(__key); } + + pair + equal_range(const key_type& __key) + { return _M_ht.equal_range(__key); } + + pair + equal_range(const key_type& __key) const + { return _M_ht.equal_range(__key); } + + size_type + erase(const key_type& __key) + { return _M_ht.erase(__key); } + + void + erase(iterator __it) + { _M_ht.erase(__it); } + + void + erase(iterator __f, iterator __l) + { _M_ht.erase(__f, __l); } + + void + clear() + { _M_ht.clear(); } + + void + resize(size_type __hint) + { _M_ht.resize(__hint); } + + size_type + bucket_count() const + { return _M_ht.bucket_count(); } + + size_type + max_bucket_count() const + { return _M_ht.max_bucket_count(); } + + size_type + elems_in_bucket(size_type __n) const + { return _M_ht.elems_in_bucket(__n); } + }; + + template + inline bool + operator==(const hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc>& __hm1, + const hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc>& __hm2) + { return __hm1._M_ht == __hm2._M_ht; } + + template + inline bool + operator!=(const hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc>& __hm1, + const hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc>& __hm2) + { return !(__hm1 == __hm2); } + + template + inline void + swap(hash_multimap<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm1, + hash_multimap<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm2) + { __hm1.swap(__hm2); } + +_GLIBCXX_END_NAMESPACE + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // Specialization of insert_iterator so that it will work for hash_map + // and hash_multimap. + template + class insert_iterator<__gnu_cxx::hash_map<_Key, _Tp, _HashFn, + _EqKey, _Alloc> > + { + protected: + typedef __gnu_cxx::hash_map<_Key, _Tp, _HashFn, _EqKey, _Alloc> + _Container; + _Container* container; + + public: + typedef _Container container_type; + typedef output_iterator_tag iterator_category; + typedef void value_type; + typedef void difference_type; + typedef void pointer; + typedef void reference; + + insert_iterator(_Container& __x) + : container(&__x) {} + + insert_iterator(_Container& __x, typename _Container::iterator) + : container(&__x) {} + + insert_iterator<_Container>& + operator=(const typename _Container::value_type& __value) + { + container->insert(__value); + return *this; + } + + insert_iterator<_Container>& + operator*() + { return *this; } + + insert_iterator<_Container>& + operator++() { return *this; } + + insert_iterator<_Container>& + operator++(int) + { return *this; } + }; + + template + class insert_iterator<__gnu_cxx::hash_multimap<_Key, _Tp, _HashFn, + _EqKey, _Alloc> > + { + protected: + typedef __gnu_cxx::hash_multimap<_Key, _Tp, _HashFn, _EqKey, _Alloc> + _Container; + _Container* container; + typename _Container::iterator iter; + + public: + typedef _Container container_type; + typedef output_iterator_tag iterator_category; + typedef void value_type; + typedef void difference_type; + typedef void pointer; + typedef void reference; + + insert_iterator(_Container& __x) + : container(&__x) {} + + insert_iterator(_Container& __x, typename _Container::iterator) + : container(&__x) {} + + insert_iterator<_Container>& + operator=(const typename _Container::value_type& __value) + { + container->insert(__value); + return *this; + } + + insert_iterator<_Container>& + operator*() + { return *this; } + + insert_iterator<_Container>& + operator++() + { return *this; } + + insert_iterator<_Container>& + operator++(int) + { return *this; } + }; + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/hash_set b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/hash_set new file mode 100644 index 00000000..32fa2205 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/hash_set @@ -0,0 +1,558 @@ +// Hashing set implementation -*- C++ -*- + +// Copyright (C) 2001, 2002, 2004, 2005, 2006, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * Copyright (c) 1996 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + */ + +/** @file backward/hash_set + * This file is a GNU extension to the Standard C++ Library (possibly + * containing extensions from the HP/SGI STL subset). + */ + +#ifndef _HASH_SET +#define _HASH_SET 1 + +#include "backward_warning.h" +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + using std::equal_to; + using std::allocator; + using std::pair; + using std::_Identity; + + /** + * This is an SGI extension. + * @ingroup SGIextensions + * @doctodo + */ + template, + class _EqualKey = equal_to<_Value>, + class _Alloc = allocator<_Value> > + class hash_set + { + // concept requirements + __glibcxx_class_requires(_Value, _SGIAssignableConcept) + __glibcxx_class_requires3(_HashFcn, size_t, _Value, _UnaryFunctionConcept) + __glibcxx_class_requires3(_EqualKey, _Value, _Value, _BinaryPredicateConcept) + + private: + typedef hashtable<_Value, _Value, _HashFcn, _Identity<_Value>, + _EqualKey, _Alloc> _Ht; + _Ht _M_ht; + + public: + typedef typename _Ht::key_type key_type; + typedef typename _Ht::value_type value_type; + typedef typename _Ht::hasher hasher; + typedef typename _Ht::key_equal key_equal; + + typedef typename _Ht::size_type size_type; + typedef typename _Ht::difference_type difference_type; + typedef typename _Alloc::pointer pointer; + typedef typename _Alloc::const_pointer const_pointer; + typedef typename _Alloc::reference reference; + typedef typename _Alloc::const_reference const_reference; + + typedef typename _Ht::const_iterator iterator; + typedef typename _Ht::const_iterator const_iterator; + + typedef typename _Ht::allocator_type allocator_type; + + hasher + hash_funct() const + { return _M_ht.hash_funct(); } + + key_equal + key_eq() const + { return _M_ht.key_eq(); } + + allocator_type + get_allocator() const + { return _M_ht.get_allocator(); } + + hash_set() + : _M_ht(100, hasher(), key_equal(), allocator_type()) {} + + explicit + hash_set(size_type __n) + : _M_ht(__n, hasher(), key_equal(), allocator_type()) {} + + hash_set(size_type __n, const hasher& __hf) + : _M_ht(__n, __hf, key_equal(), allocator_type()) {} + + hash_set(size_type __n, const hasher& __hf, const key_equal& __eql, + const allocator_type& __a = allocator_type()) + : _M_ht(__n, __hf, __eql, __a) {} + + template + hash_set(_InputIterator __f, _InputIterator __l) + : _M_ht(100, hasher(), key_equal(), allocator_type()) + { _M_ht.insert_unique(__f, __l); } + + template + hash_set(_InputIterator __f, _InputIterator __l, size_type __n) + : _M_ht(__n, hasher(), key_equal(), allocator_type()) + { _M_ht.insert_unique(__f, __l); } + + template + hash_set(_InputIterator __f, _InputIterator __l, size_type __n, + const hasher& __hf) + : _M_ht(__n, __hf, key_equal(), allocator_type()) + { _M_ht.insert_unique(__f, __l); } + + template + hash_set(_InputIterator __f, _InputIterator __l, size_type __n, + const hasher& __hf, const key_equal& __eql, + const allocator_type& __a = allocator_type()) + : _M_ht(__n, __hf, __eql, __a) + { _M_ht.insert_unique(__f, __l); } + + size_type + size() const + { return _M_ht.size(); } + + size_type + max_size() const + { return _M_ht.max_size(); } + + bool + empty() const + { return _M_ht.empty(); } + + void + swap(hash_set& __hs) + { _M_ht.swap(__hs._M_ht); } + + template + friend bool + operator==(const hash_set<_Val, _HF, _EqK, _Al>&, + const hash_set<_Val, _HF, _EqK, _Al>&); + + iterator + begin() const + { return _M_ht.begin(); } + + iterator + end() const + { return _M_ht.end(); } + + pair + insert(const value_type& __obj) + { + pair __p = _M_ht.insert_unique(__obj); + return pair(__p.first, __p.second); + } + + template + void + insert(_InputIterator __f, _InputIterator __l) + { _M_ht.insert_unique(__f, __l); } + + pair + insert_noresize(const value_type& __obj) + { + pair __p + = _M_ht.insert_unique_noresize(__obj); + return pair(__p.first, __p.second); + } + + iterator + find(const key_type& __key) const + { return _M_ht.find(__key); } + + size_type + count(const key_type& __key) const + { return _M_ht.count(__key); } + + pair + equal_range(const key_type& __key) const + { return _M_ht.equal_range(__key); } + + size_type + erase(const key_type& __key) + {return _M_ht.erase(__key); } + + void + erase(iterator __it) + { _M_ht.erase(__it); } + + void + erase(iterator __f, iterator __l) + { _M_ht.erase(__f, __l); } + + void + clear() + { _M_ht.clear(); } + + void + resize(size_type __hint) + { _M_ht.resize(__hint); } + + size_type + bucket_count() const + { return _M_ht.bucket_count(); } + + size_type + max_bucket_count() const + { return _M_ht.max_bucket_count(); } + + size_type + elems_in_bucket(size_type __n) const + { return _M_ht.elems_in_bucket(__n); } + }; + + template + inline bool + operator==(const hash_set<_Value, _HashFcn, _EqualKey, _Alloc>& __hs1, + const hash_set<_Value, _HashFcn, _EqualKey, _Alloc>& __hs2) + { return __hs1._M_ht == __hs2._M_ht; } + + template + inline bool + operator!=(const hash_set<_Value, _HashFcn, _EqualKey, _Alloc>& __hs1, + const hash_set<_Value, _HashFcn, _EqualKey, _Alloc>& __hs2) + { return !(__hs1 == __hs2); } + + template + inline void + swap(hash_set<_Val, _HashFcn, _EqualKey, _Alloc>& __hs1, + hash_set<_Val, _HashFcn, _EqualKey, _Alloc>& __hs2) + { __hs1.swap(__hs2); } + + + /** + * This is an SGI extension. + * @ingroup SGIextensions + * @doctodo + */ + template, + class _EqualKey = equal_to<_Value>, + class _Alloc = allocator<_Value> > + class hash_multiset + { + // concept requirements + __glibcxx_class_requires(_Value, _SGIAssignableConcept) + __glibcxx_class_requires3(_HashFcn, size_t, _Value, _UnaryFunctionConcept) + __glibcxx_class_requires3(_EqualKey, _Value, _Value, _BinaryPredicateConcept) + + private: + typedef hashtable<_Value, _Value, _HashFcn, _Identity<_Value>, + _EqualKey, _Alloc> _Ht; + _Ht _M_ht; + + public: + typedef typename _Ht::key_type key_type; + typedef typename _Ht::value_type value_type; + typedef typename _Ht::hasher hasher; + typedef typename _Ht::key_equal key_equal; + + typedef typename _Ht::size_type size_type; + typedef typename _Ht::difference_type difference_type; + typedef typename _Alloc::pointer pointer; + typedef typename _Alloc::const_pointer const_pointer; + typedef typename _Alloc::reference reference; + typedef typename _Alloc::const_reference const_reference; + + typedef typename _Ht::const_iterator iterator; + typedef typename _Ht::const_iterator const_iterator; + + typedef typename _Ht::allocator_type allocator_type; + + hasher + hash_funct() const + { return _M_ht.hash_funct(); } + + key_equal + key_eq() const + { return _M_ht.key_eq(); } + + allocator_type + get_allocator() const + { return _M_ht.get_allocator(); } + + hash_multiset() + : _M_ht(100, hasher(), key_equal(), allocator_type()) {} + + explicit + hash_multiset(size_type __n) + : _M_ht(__n, hasher(), key_equal(), allocator_type()) {} + + hash_multiset(size_type __n, const hasher& __hf) + : _M_ht(__n, __hf, key_equal(), allocator_type()) {} + + hash_multiset(size_type __n, const hasher& __hf, const key_equal& __eql, + const allocator_type& __a = allocator_type()) + : _M_ht(__n, __hf, __eql, __a) {} + + template + hash_multiset(_InputIterator __f, _InputIterator __l) + : _M_ht(100, hasher(), key_equal(), allocator_type()) + { _M_ht.insert_equal(__f, __l); } + + template + hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n) + : _M_ht(__n, hasher(), key_equal(), allocator_type()) + { _M_ht.insert_equal(__f, __l); } + + template + hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n, + const hasher& __hf) + : _M_ht(__n, __hf, key_equal(), allocator_type()) + { _M_ht.insert_equal(__f, __l); } + + template + hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n, + const hasher& __hf, const key_equal& __eql, + const allocator_type& __a = allocator_type()) + : _M_ht(__n, __hf, __eql, __a) + { _M_ht.insert_equal(__f, __l); } + + size_type + size() const + { return _M_ht.size(); } + + size_type + max_size() const + { return _M_ht.max_size(); } + + bool + empty() const + { return _M_ht.empty(); } + + void + swap(hash_multiset& hs) + { _M_ht.swap(hs._M_ht); } + + template + friend bool + operator==(const hash_multiset<_Val, _HF, _EqK, _Al>&, + const hash_multiset<_Val, _HF, _EqK, _Al>&); + + iterator + begin() const + { return _M_ht.begin(); } + + iterator + end() const + { return _M_ht.end(); } + + iterator + insert(const value_type& __obj) + { return _M_ht.insert_equal(__obj); } + + template + void + insert(_InputIterator __f, _InputIterator __l) + { _M_ht.insert_equal(__f,__l); } + + iterator + insert_noresize(const value_type& __obj) + { return _M_ht.insert_equal_noresize(__obj); } + + iterator + find(const key_type& __key) const + { return _M_ht.find(__key); } + + size_type + count(const key_type& __key) const + { return _M_ht.count(__key); } + + pair + equal_range(const key_type& __key) const + { return _M_ht.equal_range(__key); } + + size_type + erase(const key_type& __key) + { return _M_ht.erase(__key); } + + void + erase(iterator __it) + { _M_ht.erase(__it); } + + void + erase(iterator __f, iterator __l) + { _M_ht.erase(__f, __l); } + + void + clear() + { _M_ht.clear(); } + + void + resize(size_type __hint) + { _M_ht.resize(__hint); } + + size_type + bucket_count() const + { return _M_ht.bucket_count(); } + + size_type + max_bucket_count() const + { return _M_ht.max_bucket_count(); } + + size_type + elems_in_bucket(size_type __n) const + { return _M_ht.elems_in_bucket(__n); } + }; + + template + inline bool + operator==(const hash_multiset<_Val, _HashFcn, _EqualKey, _Alloc>& __hs1, + const hash_multiset<_Val, _HashFcn, _EqualKey, _Alloc>& __hs2) + { return __hs1._M_ht == __hs2._M_ht; } + + template + inline bool + operator!=(const hash_multiset<_Val, _HashFcn, _EqualKey, _Alloc>& __hs1, + const hash_multiset<_Val, _HashFcn, _EqualKey, _Alloc>& __hs2) + { return !(__hs1 == __hs2); } + + template + inline void + swap(hash_multiset<_Val, _HashFcn, _EqualKey, _Alloc>& __hs1, + hash_multiset<_Val, _HashFcn, _EqualKey, _Alloc>& __hs2) + { __hs1.swap(__hs2); } + +_GLIBCXX_END_NAMESPACE + +_GLIBCXX_BEGIN_NAMESPACE(std) + + // Specialization of insert_iterator so that it will work for hash_set + // and hash_multiset. + template + class insert_iterator<__gnu_cxx::hash_set<_Value, _HashFcn, + _EqualKey, _Alloc> > + { + protected: + typedef __gnu_cxx::hash_set<_Value, _HashFcn, _EqualKey, _Alloc> + _Container; + _Container* container; + + public: + typedef _Container container_type; + typedef output_iterator_tag iterator_category; + typedef void value_type; + typedef void difference_type; + typedef void pointer; + typedef void reference; + + insert_iterator(_Container& __x) + : container(&__x) {} + + insert_iterator(_Container& __x, typename _Container::iterator) + : container(&__x) {} + + insert_iterator<_Container>& + operator=(const typename _Container::value_type& __value) + { + container->insert(__value); + return *this; + } + + insert_iterator<_Container>& + operator*() + { return *this; } + + insert_iterator<_Container>& + operator++() + { return *this; } + + insert_iterator<_Container>& + operator++(int) + { return *this; } + }; + + template + class insert_iterator<__gnu_cxx::hash_multiset<_Value, _HashFcn, + _EqualKey, _Alloc> > + { + protected: + typedef __gnu_cxx::hash_multiset<_Value, _HashFcn, _EqualKey, _Alloc> + _Container; + _Container* container; + typename _Container::iterator iter; + + public: + typedef _Container container_type; + typedef output_iterator_tag iterator_category; + typedef void value_type; + typedef void difference_type; + typedef void pointer; + typedef void reference; + + insert_iterator(_Container& __x) + : container(&__x) {} + + insert_iterator(_Container& __x, typename _Container::iterator) + : container(&__x) {} + + insert_iterator<_Container>& + operator=(const typename _Container::value_type& __value) + { + container->insert(__value); + return *this; + } + + insert_iterator<_Container>& + operator*() + { return *this; } + + insert_iterator<_Container>& + operator++() + { return *this; } + + insert_iterator<_Container>& + operator++(int) { return *this; } + }; + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/iterator b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/iterator new file mode 100644 index 00000000..83b4b578 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/iterator @@ -0,0 +1,113 @@ +// HP/SGI iterator extensions -*- C++ -*- + +// Copyright (C) 2001, 2002, 2004, 2005, 2009 Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996-1998 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file ext/iterator + * This file is a GNU extension to the Standard C++ Library (possibly + * containing extensions from the HP/SGI STL subset). + */ + +#ifndef _EXT_ITERATOR +#define _EXT_ITERATOR 1 + +#pragma GCC system_header + +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + // There are two signatures for distance. In addition to the one + // taking two iterators and returning a result, there is another + // taking two iterators and a reference-to-result variable, and + // returning nothing. The latter seems to be an SGI extension. + // -- pedwards + template + inline void + __distance(_InputIterator __first, _InputIterator __last, + _Distance& __n, std::input_iterator_tag) + { + // concept requirements + __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) + while (__first != __last) + { + ++__first; + ++__n; + } + } + + template + inline void + __distance(_RandomAccessIterator __first, _RandomAccessIterator __last, + _Distance& __n, std::random_access_iterator_tag) + { + // concept requirements + __glibcxx_function_requires(_RandomAccessIteratorConcept< + _RandomAccessIterator>) + __n += __last - __first; + } + + /** + * This is an SGI extension. + * @ingroup SGIextensions + * @doctodo + */ + template + inline void + distance(_InputIterator __first, _InputIterator __last, + _Distance& __n) + { + // concept requirements -- taken care of in __distance + __distance(__first, __last, __n, std::__iterator_category(__first)); + } + +_GLIBCXX_END_NAMESPACE + +#endif + diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/malloc_allocator.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/malloc_allocator.h new file mode 100644 index 00000000..4c4a72a1 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/malloc_allocator.h @@ -0,0 +1,134 @@ +// Allocator that wraps "C" malloc -*- C++ -*- + +// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file ext/malloc_allocator.h + * This file is a GNU extension to the Standard C++ Library. + */ + +#ifndef _MALLOC_ALLOCATOR_H +#define _MALLOC_ALLOCATOR_H 1 + +#include +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + using std::size_t; + using std::ptrdiff_t; + + /** + * @brief An allocator that uses malloc. + * @ingroup allocators + * + * This is precisely the allocator defined in the C++ Standard. + * - all allocation calls malloc + * - all deallocation calls free + */ + template + class malloc_allocator + { + public: + typedef size_t size_type; + typedef ptrdiff_t difference_type; + typedef _Tp* pointer; + typedef const _Tp* const_pointer; + typedef _Tp& reference; + typedef const _Tp& const_reference; + typedef _Tp value_type; + + template + struct rebind + { typedef malloc_allocator<_Tp1> other; }; + + malloc_allocator() throw() { } + + malloc_allocator(const malloc_allocator&) throw() { } + + template + malloc_allocator(const malloc_allocator<_Tp1>&) throw() { } + + ~malloc_allocator() throw() { } + + pointer + address(reference __x) const { return &__x; } + + const_pointer + address(const_reference __x) const { return &__x; } + + // NB: __n is permitted to be 0. The C++ standard says nothing + // about what the return value is when __n == 0. + pointer + allocate(size_type __n, const void* = 0) + { + if (__builtin_expect(__n > this->max_size(), false)) + std::__throw_bad_alloc(); + + pointer __ret = static_cast<_Tp*>(std::malloc(__n * sizeof(_Tp))); + if (!__ret) + std::__throw_bad_alloc(); + return __ret; + } + + // __p is not permitted to be a null pointer. + void + deallocate(pointer __p, size_type) + { std::free(static_cast(__p)); } + + size_type + max_size() const throw() + { return size_t(-1) / sizeof(_Tp); } + + // _GLIBCXX_RESOLVE_LIB_DEFECTS + // 402. wrong new expression in [some_] allocator::construct + void + construct(pointer __p, const _Tp& __val) + { ::new((void *)__p) value_type(__val); } + +#ifdef __GXX_EXPERIMENTAL_CXX0X__ + template + void + construct(pointer __p, _Args&&... __args) + { ::new((void *)__p) _Tp(std::forward<_Args>(__args)...); } +#endif + + void + destroy(pointer __p) { __p->~_Tp(); } + }; + + template + inline bool + operator==(const malloc_allocator<_Tp>&, const malloc_allocator<_Tp>&) + { return true; } + + template + inline bool + operator!=(const malloc_allocator<_Tp>&, const malloc_allocator<_Tp>&) + { return false; } + +_GLIBCXX_END_NAMESPACE + +#endif diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/memory b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/memory new file mode 100644 index 00000000..048ebe6c --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/memory @@ -0,0 +1,195 @@ +// Memory extensions -*- C++ -*- + +// Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/* + * + * Copyright (c) 1994 + * Hewlett-Packard Company + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Hewlett-Packard Company makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + * + * + * Copyright (c) 1996 + * Silicon Graphics Computer Systems, Inc. + * + * Permission to use, copy, modify, distribute and sell this software + * and its documentation for any purpose is hereby granted without fee, + * provided that the above copyright notice appear in all copies and + * that both that copyright notice and this permission notice appear + * in supporting documentation. Silicon Graphics makes no + * representations about the suitability of this software for any + * purpose. It is provided "as is" without express or implied warranty. + */ + +/** @file ext/memory + * This file is a GNU extension to the Standard C++ Library (possibly + * containing extensions from the HP/SGI STL subset). + */ + +#ifndef _EXT_MEMORY +#define _EXT_MEMORY 1 + +#pragma GCC system_header + +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + using std::ptrdiff_t; + using std::pair; + using std::__iterator_category; + using std::_Temporary_buffer; + + template + pair<_InputIter, _ForwardIter> + __uninitialized_copy_n(_InputIter __first, _Size __count, + _ForwardIter __result, std::input_iterator_tag) + { + _ForwardIter __cur = __result; + __try + { + for (; __count > 0 ; --__count, ++__first, ++__cur) + std::_Construct(&*__cur, *__first); + return pair<_InputIter, _ForwardIter>(__first, __cur); + } + __catch(...) + { + std::_Destroy(__result, __cur); + __throw_exception_again; + } + } + + template + inline pair<_RandomAccessIter, _ForwardIter> + __uninitialized_copy_n(_RandomAccessIter __first, _Size __count, + _ForwardIter __result, + std::random_access_iterator_tag) + { + _RandomAccessIter __last = __first + __count; + return (pair<_RandomAccessIter, _ForwardIter> + (__last, std::uninitialized_copy(__first, __last, __result))); + } + + template + inline pair<_InputIter, _ForwardIter> + __uninitialized_copy_n(_InputIter __first, _Size __count, + _ForwardIter __result) + { return __uninitialized_copy_n(__first, __count, __result, + __iterator_category(__first)); } + + /** + * @brief Copies the range [first,last) into result. + * @param first An input iterator. + * @param last An input iterator. + * @param result An output iterator. + * @return result + (first - last) + * @ingroup SGIextensions + * + * Like copy(), but does not require an initialized output range. + */ + template + inline pair<_InputIter, _ForwardIter> + uninitialized_copy_n(_InputIter __first, _Size __count, + _ForwardIter __result) + { return __uninitialized_copy_n(__first, __count, __result, + __iterator_category(__first)); } + + + // An alternative version of uninitialized_copy_n that constructs + // and destroys objects with a user-provided allocator. + template + pair<_InputIter, _ForwardIter> + __uninitialized_copy_n_a(_InputIter __first, _Size __count, + _ForwardIter __result, + _Allocator __alloc) + { + _ForwardIter __cur = __result; + __try + { + for (; __count > 0 ; --__count, ++__first, ++__cur) + __alloc.construct(&*__cur, *__first); + return pair<_InputIter, _ForwardIter>(__first, __cur); + } + __catch(...) + { + std::_Destroy(__result, __cur, __alloc); + __throw_exception_again; + } + } + + template + inline pair<_InputIter, _ForwardIter> + __uninitialized_copy_n_a(_InputIter __first, _Size __count, + _ForwardIter __result, + std::allocator<_Tp>) + { + return uninitialized_copy_n(__first, __count, __result); + } + + /** + * This class provides similar behavior and semantics of the standard + * functions get_temporary_buffer() and return_temporary_buffer(), but + * encapsulated in a type vaguely resembling a standard container. + * + * By default, a temporary_buffer stores space for objects of + * whatever type the Iter iterator points to. It is constructed from a + * typical [first,last) range, and provides the begin(), end(), size() + * functions, as well as requested_size(). For non-trivial types, copies + * of *first will be used to initialize the storage. + * + * @c malloc is used to obtain underlying storage. + * + * Like get_temporary_buffer(), not all the requested memory may be + * available. Ideally, the created buffer will be large enough to hold a + * copy of [first,last), but if size() is less than requested_size(), + * then this didn't happen. + * + * @ingroup SGIextensions + */ + template ::value_type > + struct temporary_buffer : public _Temporary_buffer<_ForwardIterator, _Tp> + { + /// Requests storage large enough to hold a copy of [first,last). + temporary_buffer(_ForwardIterator __first, _ForwardIterator __last) + : _Temporary_buffer<_ForwardIterator, _Tp>(__first, __last) { } + + /// Destroys objects and frees storage. + ~temporary_buffer() { } + }; + +_GLIBCXX_END_NAMESPACE + +#endif + diff --git a/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/mt_allocator.h b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/mt_allocator.h new file mode 100644 index 00000000..f03f3a61 --- /dev/null +++ b/mingw/lib/gcc/mingw32/4.4.0/include/c++/ext/mt_allocator.h @@ -0,0 +1,751 @@ +// MT-optimized allocator -*- C++ -*- + +// Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009 +// Free Software Foundation, Inc. +// +// This file is part of the GNU ISO C++ Library. This library is free +// software; you can redistribute it and/or modify it under the +// terms of the GNU General Public License as published by the +// Free Software Foundation; either version 3, or (at your option) +// any later version. + +// This library is distributed in the hope that it will be useful, +// but WITHOUT ANY WARRANTY; without even the implied warranty of +// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +// GNU General Public License for more details. + +// Under Section 7 of GPL version 3, you are granted additional +// permissions described in the GCC Runtime Library Exception, version +// 3.1, as published by the Free Software Foundation. + +// You should have received a copy of the GNU General Public License and +// a copy of the GCC Runtime Library Exception along with this program; +// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see +// . + +/** @file ext/mt_allocator.h + * This file is a GNU extension to the Standard C++ Library. + */ + +#ifndef _MT_ALLOCATOR_H +#define _MT_ALLOCATOR_H 1 + +#include +#include +#include +#include +#include + +_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) + + using std::size_t; + using std::ptrdiff_t; + + typedef void (*__destroy_handler)(void*); + + /// Base class for pool object. + struct __pool_base + { + // Using short int as type for the binmap implies we are never + // caching blocks larger than 32768 with this allocator. + typedef unsigned short int _Binmap_type; + + // Variables used to configure the behavior of the allocator, + // assigned and explained in detail below. + struct _Tune + { + // Compile time constants for the default _Tune values. + enum { _S_align = 8 }; + enum { _S_max_bytes = 128 }; + enum { _S_min_bin = 8 }; + enum { _S_chunk_size = 4096 - 4 * sizeof(void*) }; + enum { _S_max_threads = 4096 }; + enum { _S_freelist_headroom = 10 }; + + // Alignment needed. + // NB: In any case must be >= sizeof(_Block_record), that + // is 4 on 32 bit machines and 8 on 64 bit machines. + size_t _M_align; + + // Allocation requests (after round-up to power of 2) below + // this value will be handled by the allocator. A raw new/ + // call will be used for requests larger than this value. + // NB: Must be much smaller than _M_chunk_size and in any + // case <= 32768. + size_t _M_max_bytes; + + // Size in bytes of the smallest bin. + // NB: Must be a power of 2 and >= _M_align (and of course + // much smaller than _M_max_bytes). + size_t _M_min_bin; + + // In order to avoid fragmenting and minimize the number of + // new() calls we always request new memory using this + // value. Based on previous discussions on the libstdc++ + // mailing list we have chosen the value below. + // See http://gcc.gnu.org/ml/libstdc++/2001-07/msg00077.html + // NB: At least one order of magnitude > _M_max_bytes. + size_t _M_chunk_size; + + // The maximum number of supported threads. For + // single-threaded operation, use one. Maximum values will + // vary depending on details of the underlying system. (For + // instance, Linux 2.4.18 reports 4070 in + // /proc/sys/kernel/threads-max, while Linux 2.6.6 reports + // 65534) + size_t _M_max_threads; + + // Each time a deallocation occurs in a threaded application + // we make sure that there are no more than + // _M_freelist_headroom % of used memory on the freelist. If + // the number of additional records is more than + // _M_freelist_headroom % of the freelist, we move these + // records back to the global pool. + size_t _M_freelist_headroom; + + // Set to true forces all allocations to use new(). + bool _M_force_new; + + explicit + _Tune() + : _M_align(_S_align), _M_max_bytes(_S_max_bytes), _M_min_bin(_S_min_bin), + _M_chunk_size(_S_chunk_size), _M_max_threads(_S_max_threads), + _M_freelist_headroom(_S_freelist_headroom), + _M_force_new(std::getenv("GLIBCXX_FORCE_NEW") ? true : false) + { } + + explicit + _Tune(size_t __align, size_t __maxb, size_t __minbin, size_t __chunk, + size_t __maxthreads, size_t __headroom, bool __force) + : _M_align(__align), _M_max_bytes(__maxb), _M_min_bin(__minbin), + _M_chunk_size(__chunk), _M_max_threads(__maxthreads), + _M_freelist_headroom(__headroom), _M_force_new(__force) + { } + }; + + struct _Block_address + { + void* _M_initial; + _Block_address* _M_next; + }; + + const _Tune& + _M_get_options() const + { return _M_options; } + + void + _M_set_options(_Tune __t) + { + if (!_M_init) + _M_options = __t; + } + + bool + _M_check_threshold(size_t __bytes) + { return __bytes > _M_options._M_max_bytes || _M_options._M_force_new; } + + size_t + _M_get_binmap(size_t __bytes) + { return _M_binmap[__bytes]; } + + size_t + _M_get_align() + { return _M_options._M_align; } + + explicit + __pool_base() + : _M_options(_Tune()), _M_binmap(NULL), _M_init(false) { } + + explicit + __pool_base(const _Tune& __options) + : _M_options(__options), _M_binmap(NULL), _M_init(false) { } + + private: + explicit + __pool_base(const __pool_base&); + + __pool_base& + operator=(const __pool_base&); + + protected: + // Configuration options. + _Tune _M_options; + + _Binmap_type* _M_binmap; + + // Configuration of the pool object via _M_options can happen + // after construction but before initialization. After + // initialization is complete, this variable is set to true. + bool _M_init; + }; + + + /** + * @brief Data describing the underlying memory pool, parameterized on + * threading support. + */ + template + class __pool; + + /// Specialization for single thread. + template<> + class __pool : public __pool_base + { + public: + union _Block_record + { + // Points to the block_record of the next free block. + _Block_record* _M_next; + }; + + struct _Bin_record + { + // An "array" of pointers to the first free block. + _Block_record** _M_first; + + // A list of the initial addresses of all allocated blocks. + _Block_address* _M_address; + }; + + void + _M_initialize_once() + { + if (__builtin_expect(_M_init == false, false)) + _M_initialize(); + } + + void + _M_destroy() throw(); + + char* + _M_reserve_block(size_t __bytes, const size_t __thread_id); + + void + _M_reclaim_block(char* __p, size_t __bytes); + + size_t + _M_get_thread_id() { return 0; } + + const _Bin_record& + _M_get_bin(size_t __which) + { return _M_bin[__which]; } + + void + _M_adjust_freelist(const _Bin_record&, _Block_record*, size_t) + { } + + explicit __pool() + : _M_bin(NULL), _M_bin_size(1) { } + + explicit __pool(const __pool_base::_Tune& __tune) + : __pool_base(__tune), _M_bin(NULL), _M_bin_size(1) { } + + private: + // An "array" of bin_records each of which represents a specific + // power of 2 size. Memory to this "array" is allocated in + // _M_initialize(). + _Bin_record* _M_bin; + + // Actual value calculated in _M_initialize(). + size_t _M_bin_size; + + void + _M_initialize(); + }; + +#ifdef __GTHREADS + /// Specialization for thread enabled, via gthreads.h. + template<> + class __pool : public __pool_base + { + public: + // Each requesting thread is assigned an id ranging from 1 to + // _S_max_threads. Thread id 0 is used as a global memory pool. + // In order to get constant performance on the thread assignment + // routine, we keep a list of free ids. When a thread first + // requests memory we remove the first record in this list and + // stores the address in a __gthread_key. When initializing the + // __gthread_key we specify a destructor. When this destructor + // (i.e. the thread dies) is called, we return the thread id to + // the front of this list. + struct _Thread_record + { + // Points to next free thread id record. NULL if last record in list. + _Thread_record* _M_next; + + // Thread id ranging from 1 to _S_max_threads. + size_t _M_id; + }; + + union _Block_record + { + // Points to the block_record of the next free block. + _Block_record* _M_next; + + // The thread id of the thread which has requested this block. + size_t _M_thread_id; + }; + + struct _Bin_record + { + // An "array" of pointers to the first free block for each + // thread id. Memory to this "array" is allocated in + // _S_initialize() for _S_max_threads + global pool 0. + _Block_record** _M_first; + + // A list of the initial addresses of all allocated blocks. + _Block_address* _M_address; + + // An "array" of counters used to keep track of the amount of + // blocks that are on the freelist/used for each thread id. + // - Note that the second part of the allocated _M_used "array" + // actually hosts (atomic) counters of reclaimed blocks: in + // _M_reserve_block and in _M_reclaim_block those numbers are + // subtracted from the first ones to obtain the actual size + // of the "working set" of the given thread. + // - Memory to these "arrays" is allocated in _S_initialize() + // for _S_max_threads + global pool 0. + size_t* _M_free; + size_t* _M_used; + + // Each bin has its own mutex which is used to ensure data + // integrity while changing "ownership" on a block. The mutex + // is initialized in _S_initialize(). + __gthread_mutex_t* _M_mutex; + }; + + // XXX GLIBCXX_ABI Deprecated + void + _M_initialize(__destroy_handler); + + void + _M_initialize_once() + { + if (__builtin_expect(_M_init == false, false)) + _M_initialize(); + } + + void + _M_destroy() throw(); + + char* + _M_reserve_block(size_t __bytes, const size_t __thread_id); + + void + _M_reclaim_block(char* __p, size_t __bytes); + + const _Bin_record& + _M_get_bin(size_t __which) + { return _M_bin[__which]; } + + void + _M_adjust_freelist(const _Bin_record& __bin, _Block_record* __block, + size_t __thread_id) + { + if (__gthread_active_p()) + { + __block->_M_thread_id = __thread_id; + --__bin._M_free[__thread_id]; + ++__bin._M_used[__thread_id]; + } + } + + // XXX GLIBCXX_ABI Deprecated + void + _M_destroy_thread_key(void*); + + size_t + _M_get_thread_id(); + + explicit __pool() + : _M_bin(NULL), _M_bin_size(1), _M_thread_freelist(NULL) + { } + + explicit __pool(const __pool_base::_Tune& __tune) + : __pool_base(__tune), _M_bin(NULL), _M_bin_size(1), + _M_thread_freelist(NULL) + { } + + private: + // An "array" of bin_records each of which represents a specific + // power of 2 size. Memory to this "array" is allocated in + // _M_initialize(). + _Bin_record* _M_bin; + + // Actual value calculated in _M_initialize(). + size_t _M_bin_size; + + _Thread_record* _M_thread_freelist; + void* _M_thread_freelist_initial; + + void + _M_initialize(); + }; +#endif + + template