diff -Nrcpad gcc-4.3.0/gcc/cp/ChangeLog gcc-4.3.1/gcc/cp/ChangeLog
*** gcc-4.3.0/gcc/cp/ChangeLog	Wed Mar  5 17:43:16 2008
--- gcc-4.3.1/gcc/cp/ChangeLog	Fri Jun  6 14:28:48 2008
***************
*** 1,3 ****
--- 1,207 ----
+ 2008-06-06  Release Manager
+ 
+ 	* GCC 4.3.1 released.
+ 
+ 2008-05-27  Alexandre Oliva  <aoliva@redhat.com>
+ 
+ 	PR c++/35909
+ 	* call.c (convert_like_real): Convert bitfield to desired type
+ 	before creating temporary.
+ 
+ 2008-05-23  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/36237
+ 	* cp-gimplify.c (cxx_omp_clause_apply_fn): Call
+ 	fold_build_cleanup_point_expr on build_call_a results.
+ 
+ 	PR c++/36308
+ 	* semantics.c (omp_clause_info_fndecl): New function.
+ 	(finish_omp_clauses): Use it.
+ 
+ 2008-05-21  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/36023
+ 	* cp-tree.h (check_array_initializer): New prototype.
+ 	* decl.c (check_array_initializer): New function.
+ 	(check_initializer): Call it.
+ 	* semantics.c (finish_compound_literal): Call it for ARRAY_TYPEs.
+ 
+ 2008-05-11  Volker Reichelt  <v.reichelt@netcologne.de>
+ 
+ 	* parser.c (cp_parser_omp_clause_reduction): Add missing "expected"
+ 	in error message.
+ 	(cp_parser_omp_clause_schedule): Remove superfluous "expected"
+ 	in error message.
+ 
+ 	PR c++/35578
+ 	* parser.c (cp_parser_decl_specifier_seq): Add location to error
+ 	message.
+ 
+ 2008-04-30  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/35986
+ 	* pt.c (more_specialized_fn): Stop the loop even if there are no
+ 	arguments before ellipsis.
+ 
+ 2008-04-29  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/35650
+ 	* parser.c (cp_parser_lookup_name): Look through single function
+ 	OVERLOAD.
+ 
+ 	PR c++/35987
+ 	* typeck.c (build_modify_expr) <case PREINCREMENT_EXPR>: Don't build
+ 	COMPOUND_EXPR if the second argument would be error_mark_node.
+ 
+ 2008-04-24  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/35758
+ 	* cp-tree.h (cp_reconstruct_complex_type): New prototype.
+ 	* cp-objcp-common.h (LANG_HOOKS_RECONSTRUCT_COMPLEX_TYPE): Define.
+ 	* decl2.c (is_late_template_attribute): Only make vector_size
+ 	late tmpl attribute if argument is type or value dependent.
+ 	(cp_reconstruct_complex_type): New function.
+ 
+ 2008-04-22  Jason Merrill  <jason@redhat.com>
+ 
+ 	PR c++/35316
+ 	* semantics.c (finish_decltype_type): Check DECL_BIT_FIELD_TYPE
+ 	to see if DECL_BIT_FIELD_TYPE should be used, not some other flag.
+ 	* typeck.c (is_bitfield_expr_with_lowered_type): Likewise.
+ 
+ 2008-04-22  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/35747
+ 	* semantics.c (finish_stmt_expr): Call pop_stmt_list even if the stmt
+ 	expression is errorneous.
+ 
+ 2008-04-21  Jason Merrill  <jason@redhat.com>
+ 
+ 	PR c++/35325
+ 	* tree.c (cp_tree_equal): Handle FIXED_CST.
+ 
+ 	PR c++/35678
+ 	* pt.c (template_template_parm_bindings_ok_p): Set 
+ 	processing_template_decl while in this function.
+ 
+ 2008-04-18  Jason Merrill  <jason@redhat.com>
+ 
+ 	PR c++/33486
+ 	* name-lookup.c (arg_assoc_namespace): Look down into inline 
+ 	namespaces, too.
+ 
+ 2008-04-17  Volker Reichelt  <v.reichelt@netcologne.de>
+ 
+ 	* parser.c (cp_parser_asm_specification_opt): Print CPP_CLOSE_PAREN
+ 	as `)', not as `('.
+ 
+ 2008-04-17  Jason Merrill  <jason@redhat.com>
+ 
+ 	PR c++/35773
+ 	* call.c (build_user_type_conversion_1): Represent second step of 
+ 	copy-init with an rvalue conversion.
+ 	(convert_like_real) [ck_user]: Don't implicitly add it here.
+ 
+ 2008-04-15  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c/35751
+ 	* decl.c (layout_var_decl): If extern or static var has variable
+ 	size, set TREE_TYPE (decl) to error_mark_node.
+ 
+ 2008-04-09  Jason Merrill  <jason@redhat.com>
+ 
+ 	PR c++/35708
+ 	* semantics.c (finish_compound_literal): Return a TARGET_EXPR, 
+ 	not a pushed variable.
+ 
+ 2008-04-07  Jason Merrill  <jason@redhat.com>
+ 
+ 	PR c++/35734
+ 	* class.c (type_has_user_nondefault_constructor): A template 
+ 	counts as a nondefault constructor.
+ 
+ 2008-04-03  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/35741
+ 	* semantics.c (finish_offsetof): Undo effect of convert_from_reference
+ 	before calling fold_offsetof.
+ 
+ 2008-03-26  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/35546
+ 	* pt.c (apply_late_template_attributes): Don't call tsubst on
+ 	first attribute argument if it is IDENTIFIER_NODE.
+ 
+ 	PR c++/35332
+ 	* error.c (dump_expr): Pass {,UN}ORDERED_EXPR, UN{LT,LE,GT,GE,EQ}_EXPR
+ 	and LTGT_EXPR to pp_expression.
+ 
+ 2008-03-17  Jason Merrill  <jason@redhat.com>
+ 
+ 	PR c++/35548
+ 	* call.c (reference_binding): Check LOOKUP_NO_TEMP_BIND when binding
+ 	a temp directly to a reference as per DR391.
+ 
+ 2008-03-12  Richard Guenther  <rguenther@suse.de>
+ 
+ 	PR c++/35469
+ 	Revert:
+ 	2008-02-04  Richard Guenther  <rguenther@suse.de>
+ 
+         PR java/35035
+         * decl.c (record_builtin_java_type): Make jboolean a
+         integer type again where its mode doesn't match that of bool.
+ 
+ 	2008-01-25  Richard Guenther  <rguenther@suse.de>
+ 
+         PR c++/33887
+         * decl.c (record_builtin_java_type): Make __java_boolean
+         a variant of bool.
+         * typeck.c (structural_comptypes): Move TYPE_FOR_JAVA check
+         after TYPE_MAIN_VARIANT check.
+ 
+ 2008-03-10  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/35328
+ 	* semantics.c (finish_omp_clauses): Look through NOP_EXPR even
+ 	if errorcount.
+ 
+ 	PR c++/35337
+ 	* semantics.c (finish_omp_clauses): Use %qD instead of %qE for
+ 	DECL_P in not a variable and appears more than once error messages.
+ 
+ 2008-03-06  Jakub Jelinek  <jakub@redhat.com>
+ 
+ 	PR c++/35028
+ 	* cp-gimplify.c (cxx_omp_clause_apply_fn): Handle vararg copy ctors.
+ 
+ 	PR c++/34964
+ 	PR c++/35244
+ 	* semantics.c (finish_omp_threadprivate): Do nothing for error_operand_p
+ 	vars.  Afterwards ensure v is VAR_DECL.
+ 
+ 	PR c++/35078
+ 	* parser.c (cp_parser_omp_for_loop): If DECL has REFERENCE_TYPE, don't
+ 	call cp_finish_decl.
+ 	* semantics.c (finish_omp_for): Fail if DECL doesn't have integral type
+ 	early.
+ 
+ 2008-03-06  Paolo Carlini  <pcarlini@suse.de>
+ 
+         PR c++/35323
+         * name-lookup.c (arg_assoc_type): Handle FIXED_POINT_TYPE.
+ 
+ 2008-03-06  Paolo Carlini  <pcarlini@suse.de>
+ 
+         PR c++/35333
+         * error.c (dump_expr): Handle CONJ_EXPR.
+ 
+ 2008-03-06  Paolo Carlini  <pcarlini@suse.de>
+ 
+         PR c++/35338
+         * error.c (dump_type): Handle FIXED_POINT_TYPE.
+ 	(dump_expr): Handle FIXED_CST.
+ 	
  2008-03-05  Release Manager
  
  	* GCC 4.3.0 released.
diff -Nrcpad gcc-4.3.0/gcc/cp/call.c gcc-4.3.1/gcc/cp/call.c
*** gcc-4.3.0/gcc/cp/call.c	Wed Feb 13 04:06:03 2008
--- gcc-4.3.1/gcc/cp/call.c	Tue May 27 06:02:18 2008
*************** reference_binding (tree rto, tree rfrom,
*** 1145,1151 ****
       const and rvalue references to rvalues of compatible class type. */
    if (compatible_p
        && (lvalue_p
! 	  || ((CP_TYPE_CONST_NON_VOLATILE_P(to) || TYPE_REF_IS_RVALUE (rto))
  	      && CLASS_TYPE_P (from))))
      {
        /* [dcl.init.ref]
--- 1145,1152 ----
       const and rvalue references to rvalues of compatible class type. */
    if (compatible_p
        && (lvalue_p
! 	  || (!(flags & LOOKUP_NO_TEMP_BIND)
! 	      && (CP_TYPE_CONST_NON_VOLATILE_P(to) || TYPE_REF_IS_RVALUE (rto))
  	      && CLASS_TYPE_P (from))))
      {
        /* [dcl.init.ref]
*************** build_user_type_conversion_1 (tree totyp
*** 2632,2638 ****
  				       flags);
  
        if (cand)
! 	cand->second_conv = build_identity_conv (totype, NULL_TREE);
      }
  
    if (conv_fns)
--- 2633,2654 ----
  				       flags);
  
        if (cand)
! 	{
! 	  cand->second_conv = build_identity_conv (totype, NULL_TREE);
! 
! 	  /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
! 	     set, then this is copy-initialization.  In that case, "The
! 	     result of the call is then used to direct-initialize the
! 	     object that is the destination of the copy-initialization."
! 	     [dcl.init]
! 
! 	     We represent this in the conversion sequence with an
! 	     rvalue conversion, which means a constructor call.  */
! 	  if (TREE_CODE (totype) != REFERENCE_TYPE
! 	      && !(convflags & LOOKUP_NO_TEMP_BIND))
! 	    cand->second_conv
! 	      = build_conv (ck_rvalue, totype, cand->second_conv);
! 	}
      }
  
    if (conv_fns)
*************** build_user_type_conversion_1 (tree totyp
*** 2684,2689 ****
--- 2700,2719 ----
  				       0,
  				       /*c_cast_p=*/false, convflags);
  
+ 	      /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
+ 		 copy-initialization.  In that case, "The result of the
+ 		 call is then used to direct-initialize the object that is
+ 		 the destination of the copy-initialization."  [dcl.init]
+ 
+ 		 We represent this in the conversion sequence with an
+ 		 rvalue conversion, which means a constructor call.  But
+ 		 don't add a second rvalue conversion if there's already
+ 		 one there.  Which there really shouldn't be, but it's
+ 		 harmless since we'd add it here anyway. */
+ 	      if (ics && IS_AGGR_TYPE (totype) && ics->kind != ck_rvalue
+ 		  && !(convflags & LOOKUP_NO_TEMP_BIND))
+ 		ics = build_conv (ck_rvalue, totype, ics);
+ 
  	      cand->second_conv = ics;
  
  	      if (!ics)
*************** convert_like_real (conversion *convs, tr
*** 4372,4409 ****
  	if (DECL_CONSTRUCTOR_P (convfn))
  	  expr = build_cplus_new (totype, expr);
  
- 	/* The result of the call is then used to direct-initialize the object
- 	   that is the destination of the copy-initialization.  [dcl.init]
- 
- 	   Note that this step is not reflected in the conversion sequence;
- 	   it affects the semantics when we actually perform the
- 	   conversion, but is not considered during overload resolution.
- 
- 	   If the target is a class, that means call a ctor.  */
- 	if (IS_AGGR_TYPE (totype)
- 	    && (inner >= 0 || !lvalue_p (expr)))
- 	  {
- 	    expr = (build_temp
- 		    (expr, totype,
- 		     /* Core issue 84, now a DR, says that we don't
- 			allow UDCs for these args (which deliberately
- 			breaks copy-init of an auto_ptr<Base> from an
- 			auto_ptr<Derived>).  */
- 		     LOOKUP_NORMAL|LOOKUP_ONLYCONVERTING|LOOKUP_NO_CONVERSION,
- 		     &diagnostic_fn));
- 
- 	    if (diagnostic_fn)
- 	      {
- 		if (fn)
- 		  diagnostic_fn
- 		    ("  initializing argument %P of %qD from result of %qD",
- 		     argnum, fn, convfn);
- 		else
- 		 diagnostic_fn
- 		   ("  initializing temporary from result of %qD",  convfn);
- 	      }
- 	    expr = build_cplus_new (totype, expr);
- 	  }
  	return expr;
        }
      case ck_identity:
--- 4402,4407 ----
*************** convert_like_real (conversion *convs, tr
*** 4464,4470 ****
        flags = LOOKUP_NORMAL|LOOKUP_ONLYCONVERTING;
        if (convs->user_conv_p)
  	/* This conversion is being done in the context of a user-defined
! 	   conversion, so don't allow any more.  */
  	flags |= LOOKUP_NO_CONVERSION;
        expr = build_temp (expr, totype, flags, &diagnostic_fn);
        if (diagnostic_fn && fn)
--- 4462,4469 ----
        flags = LOOKUP_NORMAL|LOOKUP_ONLYCONVERTING;
        if (convs->user_conv_p)
  	/* This conversion is being done in the context of a user-defined
! 	   conversion (i.e. the second step of copy-initialization), so
! 	   don't allow any more.  */
  	flags |= LOOKUP_NO_CONVERSION;
        expr = build_temp (expr, totype, flags, &diagnostic_fn);
        if (diagnostic_fn && fn)
*************** convert_like_real (conversion *convs, tr
*** 4519,4525 ****
  		return error_mark_node;
  	      }
  	    if (lvalue & clk_bitfield)
! 	      expr = convert_bitfield_to_declared_type (expr);
  	    expr = build_target_expr_with_type (expr, type);
  	  }
  
--- 4518,4527 ----
  		return error_mark_node;
  	      }
  	    if (lvalue & clk_bitfield)
! 	      {
! 		expr = convert_bitfield_to_declared_type (expr);
! 		expr = fold_convert (type, expr);
! 	      }
  	    expr = build_target_expr_with_type (expr, type);
  	  }
  
diff -Nrcpad gcc-4.3.0/gcc/cp/class.c gcc-4.3.1/gcc/cp/class.c
*** gcc-4.3.0/gcc/cp/class.c	Thu Feb 14 23:11:04 2008
--- gcc-4.3.1/gcc/cp/class.c	Tue Apr  8 17:49:56 2008
*************** type_has_user_nondefault_constructor (tr
*** 4054,4060 ****
      {
        tree fn = OVL_CURRENT (fns);
        if (!DECL_ARTIFICIAL (fn)
! 	  && skip_artificial_parms_for (fn, DECL_ARGUMENTS (fn)) != NULL_TREE)
  	return true;
      }
  
--- 4054,4062 ----
      {
        tree fn = OVL_CURRENT (fns);
        if (!DECL_ARTIFICIAL (fn)
! 	  && (TREE_CODE (fn) == TEMPLATE_DECL
! 	      || (skip_artificial_parms_for (fn, DECL_ARGUMENTS (fn))
! 		  != NULL_TREE)))
  	return true;
      }
  
diff -Nrcpad gcc-4.3.0/gcc/cp/cp-gimplify.c gcc-4.3.1/gcc/cp/cp-gimplify.c
*** gcc-4.3.0/gcc/cp/cp-gimplify.c	Mon Feb  4 03:28:53 2008
--- gcc-4.3.1/gcc/cp/cp-gimplify.c	Fri May 23 13:30:51 2008
***************
*** 1,6 ****
  /* C++-specific tree lowering bits; see also c-gimplify.c and tree-gimple.c.
  
!    Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007
     Free Software Foundation, Inc.
     Contributed by Jason Merrill <jason@redhat.com>
  
--- 1,6 ----
  /* C++-specific tree lowering bits; see also c-gimplify.c and tree-gimple.c.
  
!    Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008
     Free Software Foundation, Inc.
     Contributed by Jason Merrill <jason@redhat.com>
  
*************** cp_genericize (tree fndecl)
*** 784,790 ****
  static tree
  cxx_omp_clause_apply_fn (tree fn, tree arg1, tree arg2)
  {
!   tree defparm, parm;
    int i = 0;
    int nargs;
    tree *argarray;
--- 784,790 ----
  static tree
  cxx_omp_clause_apply_fn (tree fn, tree arg1, tree arg2)
  {
!   tree defparm, parm, t;
    int i = 0;
    int nargs;
    tree *argarray;
*************** cxx_omp_clause_apply_fn (tree fn, tree a
*** 804,810 ****
        tree inner_type = TREE_TYPE (arg1);
        tree start1, end1, p1;
        tree start2 = NULL, p2 = NULL;
!       tree ret = NULL, lab, t;
  
        start1 = arg1;
        start2 = arg2;
--- 804,810 ----
        tree inner_type = TREE_TYPE (arg1);
        tree start1, end1, p1;
        tree start2 = NULL, p2 = NULL;
!       tree ret = NULL, lab;
  
        start1 = arg1;
        start2 = arg2;
*************** cxx_omp_clause_apply_fn (tree fn, tree a
*** 844,853 ****
        if (arg2)
  	argarray[i++] = p2;
        /* Handle default arguments.  */
!       for (parm = defparm; parm != void_list_node; parm = TREE_CHAIN (parm), i++)
  	argarray[i] = convert_default_arg (TREE_VALUE (parm),
  					   TREE_PURPOSE (parm), fn, i);
        t = build_call_a (fn, i, argarray);
        append_to_statement_list (t, &ret);
  
        t = TYPE_SIZE_UNIT (inner_type);
--- 844,856 ----
        if (arg2)
  	argarray[i++] = p2;
        /* Handle default arguments.  */
!       for (parm = defparm; parm && parm != void_list_node;
! 	   parm = TREE_CHAIN (parm), i++)
  	argarray[i] = convert_default_arg (TREE_VALUE (parm),
  					   TREE_PURPOSE (parm), fn, i);
        t = build_call_a (fn, i, argarray);
+       t = fold_convert (void_type_node, t);
+       t = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
        append_to_statement_list (t, &ret);
  
        t = TYPE_SIZE_UNIT (inner_type);
*************** cxx_omp_clause_apply_fn (tree fn, tree a
*** 875,886 ****
        if (arg2)
  	argarray[i++] = build_fold_addr_expr (arg2);
        /* Handle default arguments.  */
!       for (parm = defparm; parm != void_list_node;
  	   parm = TREE_CHAIN (parm), i++)
  	argarray[i] = convert_default_arg (TREE_VALUE (parm),
  					   TREE_PURPOSE (parm),
  					   fn, i);
!       return build_call_a (fn, i, argarray);
      }
  }
  
--- 878,891 ----
        if (arg2)
  	argarray[i++] = build_fold_addr_expr (arg2);
        /* Handle default arguments.  */
!       for (parm = defparm; parm && parm != void_list_node;
  	   parm = TREE_CHAIN (parm), i++)
  	argarray[i] = convert_default_arg (TREE_VALUE (parm),
  					   TREE_PURPOSE (parm),
  					   fn, i);
!       t = build_call_a (fn, i, argarray);
!       t = fold_convert (void_type_node, t);
!       return fold_build_cleanup_point_expr (TREE_TYPE (t), t);
      }
  }
  
diff -Nrcpad gcc-4.3.0/gcc/cp/cp-objcp-common.h gcc-4.3.1/gcc/cp/cp-objcp-common.h
*** gcc-4.3.0/gcc/cp/cp-objcp-common.h	Fri Oct 26 08:19:14 2007
--- gcc-4.3.1/gcc/cp/cp-objcp-common.h	Thu Apr 24 16:31:59 2008
*************** extern tree objcp_tsubst_copy_and_build 
*** 130,135 ****
--- 130,137 ----
  #define LANG_HOOKS_TYPE_PROMOTES_TO cxx_type_promotes_to
  #undef LANG_HOOKS_REGISTER_BUILTIN_TYPE
  #define LANG_HOOKS_REGISTER_BUILTIN_TYPE c_register_builtin_type
+ #undef LANG_HOOKS_RECONSTRUCT_COMPLEX_TYPE
+ #define LANG_HOOKS_RECONSTRUCT_COMPLEX_TYPE cp_reconstruct_complex_type
  #undef LANG_HOOKS_TO_TARGET_CHARSET
  #define LANG_HOOKS_TO_TARGET_CHARSET c_common_to_target_charset
  #undef LANG_HOOKS_GIMPLIFY_EXPR
diff -Nrcpad gcc-4.3.0/gcc/cp/cp-tree.h gcc-4.3.1/gcc/cp/cp-tree.h
*** gcc-4.3.0/gcc/cp/cp-tree.h	Thu Feb 14 23:11:04 2008
--- gcc-4.3.1/gcc/cp/cp-tree.h	Wed May 21 19:58:27 2008
*************** extern tree shadow_tag				(cp_decl_speci
*** 4213,4218 ****
--- 4213,4219 ----
  extern tree groktypename			(cp_decl_specifier_seq *, const cp_declarator *);
  extern tree start_decl				(const cp_declarator *, cp_decl_specifier_seq *, int, tree, tree, tree *);
  extern void start_decl_1			(tree, bool);
+ extern bool check_array_initializer		(tree, tree, tree);
  extern void cp_finish_decl			(tree, tree, bool, tree, int);
  extern void finish_decl				(tree, tree, tree);
  extern int cp_complete_array_type		(tree *, tree, bool);
*************** extern tree grokfield (const cp_declarat
*** 4284,4289 ****
--- 4285,4291 ----
  		       tree, bool, tree, tree);
  extern tree grokbitfield (const cp_declarator *, cp_decl_specifier_seq *,
  			  tree);
+ extern tree cp_reconstruct_complex_type		(tree, tree);
  extern void cplus_decl_attributes		(tree *, tree, int);
  extern void finish_anon_union			(tree);
  extern void cp_write_global_declarations	(void);
diff -Nrcpad gcc-4.3.0/gcc/cp/decl.c gcc-4.3.1/gcc/cp/decl.c
*** gcc-4.3.0/gcc/cp/decl.c	Fri Feb 22 21:51:19 2008
--- gcc-4.3.1/gcc/cp/decl.c	Wed May 21 19:58:27 2008
*************** record_builtin_java_type (const char* na
*** 3164,3182 ****
    tree type, decl;
    if (size > 0)
      type = make_signed_type (size);
-   else if (size == -1)
-     { /* "__java_boolean".  */
-       if ((TYPE_MODE (boolean_type_node)
- 	   == smallest_mode_for_size (1, MODE_INT)))
-         type = build_variant_type_copy (boolean_type_node);
-       else
- 	/* ppc-darwin has SImode bool, make jboolean a 1-bit
- 	   integer type without boolean semantics there.  */
- 	type = make_unsigned_type (1);
-     }
    else if (size > -32)
!     { /* "__java_char".  */
        type = make_unsigned_type (-size);
      }
    else
      { /* "__java_float" or ""__java_double".  */
--- 3164,3173 ----
    tree type, decl;
    if (size > 0)
      type = make_signed_type (size);
    else if (size > -32)
!     { /* "__java_char" or ""__java_boolean".  */
        type = make_unsigned_type (-size);
+       /*if (size == -1)	TREE_SET_CODE (type, BOOLEAN_TYPE);*/
      }
    else
      { /* "__java_float" or ""__java_double".  */
*************** layout_var_decl (tree decl)
*** 4446,4452 ****
        if (TREE_CODE (DECL_SIZE (decl)) == INTEGER_CST)
  	constant_expression_warning (DECL_SIZE (decl));
        else
! 	error ("storage size of %qD isn't constant", decl);
      }
  }
  
--- 4437,4446 ----
        if (TREE_CODE (DECL_SIZE (decl)) == INTEGER_CST)
  	constant_expression_warning (DECL_SIZE (decl));
        else
! 	{
! 	  error ("storage size of %qD isn't constant", decl);
! 	  TREE_TYPE (decl) = error_mark_node;
! 	}
      }
  }
  
*************** reshape_init (tree type, tree init)
*** 4893,4898 ****
--- 4887,4924 ----
    return new_init;
  }
  
+ /* Verify array initializer.  Returns true if errors have been reported.  */
+ 
+ bool
+ check_array_initializer (tree decl, tree type, tree init)
+ {
+   tree element_type = TREE_TYPE (type);
+ 
+   /* The array type itself need not be complete, because the
+      initializer may tell us how many elements are in the array.
+      But, the elements of the array must be complete.  */
+   if (!COMPLETE_TYPE_P (complete_type (element_type)))
+     {
+       if (decl)
+ 	error ("elements of array %q#D have incomplete type", decl);
+       else
+ 	error ("elements of array %q#T have incomplete type", type);
+       return true;
+     }
+   /* It is not valid to initialize a VLA.  */
+   if (init
+       && ((COMPLETE_TYPE_P (type) && !TREE_CONSTANT (TYPE_SIZE (type)))
+ 	  || !TREE_CONSTANT (TYPE_SIZE (element_type))))
+     {
+       if (decl)
+ 	error ("variable-sized object %qD may not be initialized", decl);
+       else
+ 	error ("variable-sized compound literal");
+       return true;
+     }
+   return false;
+ }
+ 
  /* Verify INIT (the initializer for DECL), and record the
     initialization in DECL_INITIAL, if appropriate.  CLEANUP is as for
     grok_reference_init.
*************** check_initializer (tree decl, tree init,
*** 4916,4939 ****
  
    if (TREE_CODE (type) == ARRAY_TYPE)
      {
!       tree element_type = TREE_TYPE (type);
! 
!       /* The array type itself need not be complete, because the
! 	 initializer may tell us how many elements are in the array.
! 	 But, the elements of the array must be complete.  */
!       if (!COMPLETE_TYPE_P (complete_type (element_type)))
! 	{
! 	  error ("elements of array %q#D have incomplete type", decl);
! 	  return NULL_TREE;
! 	}
!       /* It is not valid to initialize a VLA.  */
!       if (init
! 	  && ((COMPLETE_TYPE_P (type) && !TREE_CONSTANT (TYPE_SIZE (type)))
! 	      || !TREE_CONSTANT (TYPE_SIZE (element_type))))
! 	{
! 	  error ("variable-sized object %qD may not be initialized", decl);
! 	  return NULL_TREE;
! 	}
      }
    else if (!COMPLETE_TYPE_P (type))
      {
--- 4942,4949 ----
  
    if (TREE_CODE (type) == ARRAY_TYPE)
      {
!       if (check_array_initializer (decl, type, init))
! 	return NULL_TREE;
      }
    else if (!COMPLETE_TYPE_P (type))
      {
diff -Nrcpad gcc-4.3.0/gcc/cp/decl2.c gcc-4.3.1/gcc/cp/decl2.c
*** gcc-4.3.0/gcc/cp/decl2.c	Wed Feb 13 21:27:16 2008
--- gcc-4.3.1/gcc/cp/decl2.c	Thu Apr 24 16:31:59 2008
*************** is_late_template_attribute (tree attr, t
*** 991,1001 ****
      /* Unknown attribute.  */
      return false;
  
!   /* Attribute vector_size handling wants to dive into the back end array
!      building code, which breaks during template processing.  */
!   if (is_attribute_p ("vector_size", name)
!       /* Attribute weak handling wants to write out assembly right away.  */
!       || is_attribute_p ("weak", name))
      return true;
  
    /* If any of the arguments are dependent expressions, we can't evaluate
--- 991,998 ----
      /* Unknown attribute.  */
      return false;
  
!   /* Attribute weak handling wants to write out assembly right away.  */
!   if (is_attribute_p ("weak", name))
      return true;
  
    /* If any of the arguments are dependent expressions, we can't evaluate
*************** save_template_attributes (tree *attr_p, 
*** 1120,1125 ****
--- 1117,1178 ----
      }
  }
  
+ /* Like reconstruct_complex_type, but handle also template trees.  */
+ 
+ tree
+ cp_reconstruct_complex_type (tree type, tree bottom)
+ {
+   tree inner, outer;
+ 
+   if (TREE_CODE (type) == POINTER_TYPE)
+     {
+       inner = cp_reconstruct_complex_type (TREE_TYPE (type), bottom);
+       outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
+ 					   TYPE_REF_CAN_ALIAS_ALL (type));
+     }
+   else if (TREE_CODE (type) == REFERENCE_TYPE)
+     {
+       inner = cp_reconstruct_complex_type (TREE_TYPE (type), bottom);
+       outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
+ 					     TYPE_REF_CAN_ALIAS_ALL (type));
+     }
+   else if (TREE_CODE (type) == ARRAY_TYPE)
+     {
+       inner = cp_reconstruct_complex_type (TREE_TYPE (type), bottom);
+       outer = build_cplus_array_type (inner, TYPE_DOMAIN (type));
+       /* Don't call cp_build_qualified_type on ARRAY_TYPEs, the
+ 	 element type qualification will be handled by the recursive
+ 	 cp_reconstruct_complex_type call and cp_build_qualified_type
+ 	 for ARRAY_TYPEs changes the element type.  */
+       return outer;
+     }
+   else if (TREE_CODE (type) == FUNCTION_TYPE)
+     {
+       inner = cp_reconstruct_complex_type (TREE_TYPE (type), bottom);
+       outer = build_function_type (inner, TYPE_ARG_TYPES (type));
+     }
+   else if (TREE_CODE (type) == METHOD_TYPE)
+     {
+       inner = cp_reconstruct_complex_type (TREE_TYPE (type), bottom);
+       /* The build_method_type_directly() routine prepends 'this' to argument list,
+ 	 so we must compensate by getting rid of it.  */
+       outer
+ 	= build_method_type_directly
+ 	    (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
+ 	     inner,
+ 	     TREE_CHAIN (TYPE_ARG_TYPES (type)));
+     }
+   else if (TREE_CODE (type) == OFFSET_TYPE)
+     {
+       inner = cp_reconstruct_complex_type (TREE_TYPE (type), bottom);
+       outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
+     }
+   else
+     return bottom;
+ 
+   return cp_build_qualified_type (outer, TYPE_QUALS (type));
+ }
+ 
  /* Like decl_attributes, but handle C++ complexity.  */
  
  void
diff -Nrcpad gcc-4.3.0/gcc/cp/error.c gcc-4.3.1/gcc/cp/error.c
*** gcc-4.3.0/gcc/cp/error.c	Sat Jan 26 17:04:54 2008
--- gcc-4.3.1/gcc/cp/error.c	Wed Mar 26 13:07:24 2008
*************** dump_type (tree t, int flags)
*** 326,331 ****
--- 326,332 ----
      case BOOLEAN_TYPE:
      case COMPLEX_TYPE:
      case VECTOR_TYPE:
+     case FIXED_POINT_TYPE:
        pp_type_specifier_seq (cxx_pp, t);
        break;
  
*************** dump_expr (tree t, int flags)
*** 2079,2085 ****
--- 2080,2096 ----
      case VEC_DELETE_EXPR:
      case MODOP_EXPR:
      case ABS_EXPR:
+     case CONJ_EXPR:
      case VECTOR_CST:
+     case FIXED_CST:
+     case UNORDERED_EXPR:
+     case ORDERED_EXPR:
+     case UNLT_EXPR:
+     case UNLE_EXPR:
+     case UNGT_EXPR:
+     case UNGE_EXPR:
+     case UNEQ_EXPR:
+     case LTGT_EXPR:
        pp_expression (cxx_pp, t);
        break;
  
diff -Nrcpad gcc-4.3.0/gcc/cp/name-lookup.c gcc-4.3.1/gcc/cp/name-lookup.c
*** gcc-4.3.0/gcc/cp/name-lookup.c	Tue Jan 22 19:50:37 2008
--- gcc-4.3.1/gcc/cp/name-lookup.c	Fri Apr 18 19:56:55 2008
***************
*** 1,5 ****
  /* Definitions for C++ name lookup routines.
!    Copyright (C) 2003, 2004, 2005, 2006, 2007
     Free Software Foundation, Inc.
     Contributed by Gabriel Dos Reis <gdr@integrable-solutions.net>
  
--- 1,5 ----
  /* Definitions for C++ name lookup routines.
!    Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008
     Free Software Foundation, Inc.
     Contributed by Gabriel Dos Reis <gdr@integrable-solutions.net>
  
*************** arg_assoc_namespace (struct arg_lookup *
*** 4419,4424 ****
--- 4419,4431 ----
      if (arg_assoc_namespace (k, TREE_PURPOSE (value)))
        return true;
  
+   /* Also look down into inline namespaces.  */
+   for (value = DECL_NAMESPACE_USING (scope); value;
+        value = TREE_CHAIN (value))
+     if (is_associated_namespace (scope, TREE_PURPOSE (value)))
+       if (arg_assoc_namespace (k, TREE_PURPOSE (value)))
+ 	return true;
+ 
    value = namespace_binding (k->name, scope);
    if (!value)
      return false;
*************** arg_assoc_type (struct arg_lookup *k, tr
*** 4594,4599 ****
--- 4601,4607 ----
      case COMPLEX_TYPE:
      case VECTOR_TYPE:
      case BOOLEAN_TYPE:
+     case FIXED_POINT_TYPE:
        return false;
      case RECORD_TYPE:
        if (TYPE_PTRMEMFUNC_P (type))
diff -Nrcpad gcc-4.3.0/gcc/cp/parser.c gcc-4.3.1/gcc/cp/parser.c
*** gcc-4.3.0/gcc/cp/parser.c	Wed Feb 13 22:30:43 2008
--- gcc-4.3.1/gcc/cp/parser.c	Sun May 11 19:56:39 2008
*************** cp_parser_decl_specifier_seq (cp_parser*
*** 8093,8099 ****
  	case RID_FRIEND:
  	  if (!at_class_scope_p ())
  	    {
! 	      error ("%<friend%> used outside of class");
  	      cp_lexer_purge_token (parser->lexer);
  	    }
  	  else
--- 8093,8099 ----
  	case RID_FRIEND:
  	  if (!at_class_scope_p ())
  	    {
! 	      error ("%H%<friend%> used outside of class", &token->location);
  	      cp_lexer_purge_token (parser->lexer);
  	    }
  	  else
*************** cp_parser_asm_specification_opt (cp_pars
*** 15787,15793 ****
    asm_specification = cp_parser_string_literal (parser, false, false);
  
    /* Look for the `)'.  */
!   cp_parser_require (parser, CPP_CLOSE_PAREN, "`('");
  
    return asm_specification;
  }
--- 15787,15793 ----
    asm_specification = cp_parser_string_literal (parser, false, false);
  
    /* Look for the `)'.  */
!   cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
  
    return asm_specification;
  }
*************** cp_parser_lookup_name (cp_parser *parser
*** 16262,16267 ****
--- 16262,16274 ----
  	  decl = lookup_qualified_name (parser->scope, name,
  					tag_type != none_type,
  					/*complain=*/true);
+ 
+ 	  /* If we have a single function from a using decl, pull it out.  */
+ 	  if (decl
+ 	      && TREE_CODE (decl) == OVERLOAD
+ 	      && !really_overloaded_fn (decl))
+ 	    decl = OVL_FUNCTION (decl);
+ 
  	  if (pushed_scope)
  	    pop_scope (pushed_scope);
  	}
*************** cp_parser_omp_clause_reduction (cp_parse
*** 19625,19631 ****
        code = TRUTH_ORIF_EXPR;
        break;
      default:
!       cp_parser_error (parser, "`+', `*', `-', `&', `^', `|', `&&', or `||'");
      resync_fail:
        cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
  					     /*or_comma=*/false,
--- 19632,19639 ----
        code = TRUTH_ORIF_EXPR;
        break;
      default:
!       cp_parser_error (parser, "expected `+', `*', `-', `&', `^', `|', "
! 			       "`&&', or `||'");
      resync_fail:
        cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
  					     /*or_comma=*/false,
*************** cp_parser_omp_clause_schedule (cp_parser
*** 19656,19662 ****
  {
    tree c, t;
  
!   if (!cp_parser_require (parser, CPP_OPEN_PAREN, "expected %<(%>"))
      return list;
  
    c = build_omp_clause (OMP_CLAUSE_SCHEDULE);
--- 19664,19670 ----
  {
    tree c, t;
  
!   if (!cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
      return list;
  
    c = build_omp_clause (OMP_CLAUSE_SCHEDULE);
*************** cp_parser_omp_for_loop (cp_parser *parse
*** 20074,20081 ****
  
  	      init = cp_parser_assignment_expression (parser, false);
  
! 	      cp_finish_decl (decl, NULL_TREE, /*init_const_expr_p=*/false,
! 			      asm_specification, LOOKUP_ONLYCONVERTING);
  
  	      if (pushed_scope)
  		pop_scope (pushed_scope);
--- 20082,20092 ----
  
  	      init = cp_parser_assignment_expression (parser, false);
  
! 	      if (TREE_CODE (TREE_TYPE (decl)) == REFERENCE_TYPE)
! 		init = error_mark_node;
! 	      else
! 		cp_finish_decl (decl, NULL_TREE, /*init_const_expr_p=*/false,
! 				asm_specification, LOOKUP_ONLYCONVERTING);
  
  	      if (pushed_scope)
  		pop_scope (pushed_scope);
diff -Nrcpad gcc-4.3.0/gcc/cp/pt.c gcc-4.3.1/gcc/cp/pt.c
*** gcc-4.3.0/gcc/cp/pt.c	Fri Feb 22 11:02:31 2008
--- gcc-4.3.1/gcc/cp/pt.c	Wed Apr 30 15:04:56 2008
*************** bool 
*** 4740,4745 ****
--- 4740,4749 ----
  template_template_parm_bindings_ok_p (tree tparms, tree targs)
  {
    int i, ntparms = TREE_VEC_LENGTH (tparms);
+   bool ret = true;
+ 
+   /* We're dealing with template parms in this process.  */
+   ++processing_template_decl;
  
    targs = INNERMOST_TEMPLATE_ARGS (targs);
  
*************** template_template_parm_bindings_ok_p (tr
*** 4790,4802 ****
  			tf_none,
  			tparm,
  			targs))
! 		return false;
  	    }
  	}
      }
  
!   /* Everything is okay.  */
!   return true;
  }
  
  /* Convert the indicated template ARG as necessary to match the
--- 4794,4811 ----
  			tf_none,
  			tparm,
  			targs))
! 		{
! 		  ret = false;
! 		  goto out;
! 		}
  	    }
  	}
      }
  
!  out:
! 
!   --processing_template_decl;
!   return ret;
  }
  
  /* Convert the indicated template ARG as necessary to match the
*************** apply_late_template_attributes (tree *de
*** 6717,6725 ****
  	    {
  	      *p = TREE_CHAIN (t);
  	      TREE_CHAIN (t) = NULL_TREE;
! 	      TREE_VALUE (t)
! 		= tsubst_expr (TREE_VALUE (t), args, complain, in_decl,
! 			       /*integral_constant_expression_p=*/false);
  	      *q = t;
  	      q = &TREE_CHAIN (t);
  	    }
--- 6726,6754 ----
  	    {
  	      *p = TREE_CHAIN (t);
  	      TREE_CHAIN (t) = NULL_TREE;
! 	      /* If the first attribute argument is an identifier, don't
! 		 pass it through tsubst.  Attributes like mode, format,
! 		 cleanup and several target specific attributes expect it
! 		 unmodified.  */
! 	      if (TREE_VALUE (t)
! 		  && TREE_CODE (TREE_VALUE (t)) == TREE_LIST
! 		  && TREE_VALUE (TREE_VALUE (t))
! 		  && (TREE_CODE (TREE_VALUE (TREE_VALUE (t)))
! 		      == IDENTIFIER_NODE))
! 		{
! 		  tree chain
! 		    = tsubst_expr (TREE_CHAIN (TREE_VALUE (t)), args, complain,
! 				   in_decl,
! 				   /*integral_constant_expression_p=*/false);
! 		  if (chain != TREE_CHAIN (TREE_VALUE (t)))
! 		    TREE_VALUE (t)
! 		      = tree_cons (NULL_TREE, TREE_VALUE (TREE_VALUE (t)),
! 				   chain);
! 		}
! 	      else
! 		TREE_VALUE (t)
! 		  = tsubst_expr (TREE_VALUE (t), args, complain, in_decl,
! 				 /*integral_constant_expression_p=*/false);
  	      *q = t;
  	      q = &TREE_CHAIN (t);
  	    }
*************** more_specialized_fn (tree pat1, tree pat
*** 13530,13536 ****
  
    processing_template_decl++;
  
!   while (len--)
      {
        tree arg1 = TREE_VALUE (args1);
        tree arg2 = TREE_VALUE (args2);
--- 13559,13567 ----
  
    processing_template_decl++;
  
!   while (len--
! 	 /* Stop when an ellipsis is seen.  */
! 	 && args1 != NULL_TREE && args2 != NULL_TREE)
      {
        tree arg1 = TREE_VALUE (args1);
        tree arg2 = TREE_VALUE (args2);
*************** more_specialized_fn (tree pat1, tree pat
*** 13693,13702 ****
  
        args1 = TREE_CHAIN (args1);
        args2 = TREE_CHAIN (args2);
- 
-       /* Stop when an ellipsis is seen.  */
-       if (args1 == NULL_TREE || args2 == NULL_TREE)
- 	break;
      }
  
    processing_template_decl--;
--- 13724,13729 ----
diff -Nrcpad gcc-4.3.0/gcc/cp/semantics.c gcc-4.3.1/gcc/cp/semantics.c
*** gcc-4.3.0/gcc/cp/semantics.c	Tue Feb 12 17:26:34 2008
--- gcc-4.3.1/gcc/cp/semantics.c	Fri May 23 12:16:41 2008
*************** finish_stmt_expr (tree stmt_expr, bool h
*** 1736,1742 ****
    tree result;
  
    if (error_operand_p (stmt_expr))
!     return error_mark_node;
  
    gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
  
--- 1736,1745 ----
    tree result;
  
    if (error_operand_p (stmt_expr))
!     {
!       pop_stmt_list (stmt_expr);
!       return error_mark_node;
!     }
  
    gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
  
*************** finish_unary_op_expr (enum tree_code cod
*** 2096,2102 ****
  tree
  finish_compound_literal (tree type, VEC(constructor_elt,gc) *initializer_list)
  {
-   tree var;
    tree compound_literal;
  
    if (!TYPE_OBJ_P (type))
--- 2099,2104 ----
*************** finish_compound_literal (tree type, VEC(
*** 2115,2144 ****
        return compound_literal;
      }
  
!   /* Create a temporary variable to represent the compound literal.  */
!   var = create_temporary_var (type);
!   if (!current_function_decl)
!     {
!       /* If this compound-literal appears outside of a function, then
! 	 the corresponding variable has static storage duration, just
! 	 like the variable in whose initializer it appears.  */
!       TREE_STATIC (var) = 1;
!       /* The variable has internal linkage, since there is no need to
! 	 reference it from another translation unit.  */
!       TREE_PUBLIC (var) = 0;
!       /* It must have a name, so that the name mangler can mangle it.  */
!       DECL_NAME (var) = make_anon_name ();
!     }
!   /* We must call pushdecl, since the gimplifier complains if the
!      variable has not been declared via a BIND_EXPR.  */
!   pushdecl (var);
!   /* Initialize the variable as we would any other variable with a
!      brace-enclosed initializer.  */
!   cp_finish_decl (var, compound_literal,
! 		  /*init_const_expr_p=*/false,
! 		  /*asmspec_tree=*/NULL_TREE,
! 		  LOOKUP_ONLYCONVERTING);
!   return var;
  }
  
  /* Return the declaration for the function-name variable indicated by
--- 2117,2131 ----
        return compound_literal;
      }
  
!   type = complete_type (type);
!   if (TREE_CODE (type) == ARRAY_TYPE
!       && check_array_initializer (NULL_TREE, type, compound_literal))
!     return error_mark_node;
!   compound_literal = reshape_init (type, compound_literal);
!   if (TREE_CODE (type) == ARRAY_TYPE)
!     cp_complete_array_type (&type, compound_literal, false);
!   compound_literal = digest_init (type, compound_literal);
!   return get_target_expr (compound_literal);
  }
  
  /* Return the declaration for the function-name variable indicated by
*************** finish_offsetof (tree expr)
*** 3028,3033 ****
--- 3015,3022 ----
        error ("cannot apply %<offsetof%> to member function %qD", expr);
        return error_mark_node;
      }
+   if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr))
+     expr = TREE_OPERAND (expr, 0);
    return fold_offsetof (expr, NULL_TREE);
  }
  
*************** finalize_nrv (tree *tp, tree var, tree r
*** 3335,3340 ****
--- 3324,3354 ----
    htab_delete (data.visited);
  }
  
+ /* Return the declaration for the function called by CALL_EXPR T,
+    TYPE is the class type of the clause decl.  */
+ 
+ static tree
+ omp_clause_info_fndecl (tree t, tree type)
+ {
+   tree ret = get_callee_fndecl (t);
+ 
+   if (ret)
+     return ret;
+ 
+   gcc_assert (TREE_CODE (t) == CALL_EXPR);
+   t = CALL_EXPR_FN (t);
+   STRIP_NOPS (t);
+   if (TREE_CODE (t) == OBJ_TYPE_REF)
+     {
+       t = cp_fold_obj_type_ref (t, type);
+       if (TREE_CODE (t) == ADDR_EXPR
+ 	  && TREE_CODE (TREE_OPERAND (t, 0)) == FUNCTION_DECL)
+ 	return TREE_OPERAND (t, 0);
+     }
+ 
+   return NULL_TREE;
+ }
+ 
  /* For all elements of CLAUSES, validate them vs OpenMP constraints.
     Remove any elements from the list that are invalid.  */
  
*************** finish_omp_clauses (tree clauses)
*** 3400,3412 ****
  	    {
  	      if (processing_template_decl)
  		break;
! 	      error ("%qE is not a variable in clause %<firstprivate%>", t);
  	      remove = true;
  	    }
  	  else if (bitmap_bit_p (&generic_head, DECL_UID (t))
  		   || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
  	    {
! 	      error ("%qE appears more than once in data clauses", t);
  	      remove = true;
  	    }
  	  else
--- 3414,3429 ----
  	    {
  	      if (processing_template_decl)
  		break;
! 	      if (DECL_P (t))
! 		error ("%qD is not a variable in clause %<firstprivate%>", t);
! 	      else
! 		error ("%qE is not a variable in clause %<firstprivate%>", t);
  	      remove = true;
  	    }
  	  else if (bitmap_bit_p (&generic_head, DECL_UID (t))
  		   || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
  	    {
! 	      error ("%qD appears more than once in data clauses", t);
  	      remove = true;
  	    }
  	  else
*************** finish_omp_clauses (tree clauses)
*** 3419,3431 ****
  	    {
  	      if (processing_template_decl)
  		break;
! 	      error ("%qE is not a variable in clause %<lastprivate%>", t);
  	      remove = true;
  	    }
  	  else if (bitmap_bit_p (&generic_head, DECL_UID (t))
  		   || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
  	    {
! 	      error ("%qE appears more than once in data clauses", t);
  	      remove = true;
  	    }
  	  else
--- 3436,3451 ----
  	    {
  	      if (processing_template_decl)
  		break;
! 	      if (DECL_P (t))
! 		error ("%qD is not a variable in clause %<lastprivate%>", t);
! 	      else
! 		error ("%qE is not a variable in clause %<lastprivate%>", t);
  	      remove = true;
  	    }
  	  else if (bitmap_bit_p (&generic_head, DECL_UID (t))
  		   || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
  	    {
! 	      error ("%qD appears more than once in data clauses", t);
  	      remove = true;
  	    }
  	  else
*************** finish_omp_clauses (tree clauses)
*** 3661,3667 ****
  					     complete_ctor_identifier,
  					     t, inner_type, LOOKUP_NORMAL);
  
! 	      if (targetm.cxx.cdtor_returns_this ())
  		/* Because constructors and destructors return this,
  		   the call will have been cast to "void".  Remove the
  		   cast here.  We would like to use STRIP_NOPS, but it
--- 3681,3687 ----
  					     complete_ctor_identifier,
  					     t, inner_type, LOOKUP_NORMAL);
  
! 	      if (targetm.cxx.cdtor_returns_this () || errorcount)
  		/* Because constructors and destructors return this,
  		   the call will have been cast to "void".  Remove the
  		   cast here.  We would like to use STRIP_NOPS, but it
*************** finish_omp_clauses (tree clauses)
*** 3671,3678 ****
  		if (TREE_CODE (t) == NOP_EXPR)
  		  t = TREE_OPERAND (t, 0);
  
! 	      t = get_callee_fndecl (t);
! 	      TREE_VEC_ELT (info, 0) = t;
  	    }
  
  	  if ((need_default_ctor || need_copy_ctor)
--- 3691,3697 ----
  		if (TREE_CODE (t) == NOP_EXPR)
  		  t = TREE_OPERAND (t, 0);
  
! 	      TREE_VEC_ELT (info, 0) = get_callee_fndecl (t);
  	    }
  
  	  if ((need_default_ctor || need_copy_ctor)
*************** finish_omp_clauses (tree clauses)
*** 3683,3689 ****
  	      t = build_special_member_call (t, complete_dtor_identifier,
  					     NULL, inner_type, LOOKUP_NORMAL);
  
! 	      if (targetm.cxx.cdtor_returns_this ())
  		/* Because constructors and destructors return this,
  		   the call will have been cast to "void".  Remove the
  		   cast here.  We would like to use STRIP_NOPS, but it
--- 3702,3708 ----
  	      t = build_special_member_call (t, complete_dtor_identifier,
  					     NULL, inner_type, LOOKUP_NORMAL);
  
! 	      if (targetm.cxx.cdtor_returns_this () || errorcount)
  		/* Because constructors and destructors return this,
  		   the call will have been cast to "void".  Remove the
  		   cast here.  We would like to use STRIP_NOPS, but it
*************** finish_omp_clauses (tree clauses)
*** 3693,3700 ****
  		if (TREE_CODE (t) == NOP_EXPR)
  		  t = TREE_OPERAND (t, 0);
  
! 	      t = get_callee_fndecl (t);
! 	      TREE_VEC_ELT (info, 1) = t;
  	    }
  
  	  if (need_copy_assignment
--- 3712,3718 ----
  		if (TREE_CODE (t) == NOP_EXPR)
  		  t = TREE_OPERAND (t, 0);
  
! 	      TREE_VEC_ELT (info, 1) = omp_clause_info_fndecl (t, inner_type);
  	    }
  
  	  if (need_copy_assignment
*************** finish_omp_clauses (tree clauses)
*** 3712,3719 ****
  	      if (TREE_CODE (t) == INDIRECT_REF)
  		t = TREE_OPERAND (t, 0);
  
! 	      t = get_callee_fndecl (t);
! 	      TREE_VEC_ELT (info, 2) = t;
  	    }
  
  	  if (errorcount != save_errorcount)
--- 3730,3736 ----
  	      if (TREE_CODE (t) == INDIRECT_REF)
  		t = TREE_OPERAND (t, 0);
  
! 	      TREE_VEC_ELT (info, 2) = omp_clause_info_fndecl (t, inner_type);
  	    }
  
  	  if (errorcount != save_errorcount)
*************** finish_omp_threadprivate (tree vars)
*** 3742,3750 ****
      {
        tree v = TREE_PURPOSE (t);
  
        /* If V had already been marked threadprivate, it doesn't matter
  	 whether it had been used prior to this point.  */
!       if (TREE_USED (v)
  	  && (DECL_LANG_SPECIFIC (v) == NULL
  	      || !CP_DECL_THREADPRIVATE_P (v)))
  	error ("%qE declared %<threadprivate%> after first use", v);
--- 3759,3772 ----
      {
        tree v = TREE_PURPOSE (t);
  
+       if (error_operand_p (v))
+ 	;
+       else if (TREE_CODE (v) != VAR_DECL)
+ 	error ("%<threadprivate%> %qD is not file, namespace "
+ 	       "or block scope variable", v);
        /* If V had already been marked threadprivate, it doesn't matter
  	 whether it had been used prior to this point.  */
!       else if (TREE_USED (v)
  	  && (DECL_LANG_SPECIFIC (v) == NULL
  	      || !CP_DECL_THREADPRIVATE_P (v)))
  	error ("%qE declared %<threadprivate%> after first use", v);
*************** finish_omp_for (location_t locus, tree d
*** 3903,3908 ****
--- 3925,3940 ----
        return NULL;
      }
  
+   if (!INTEGRAL_TYPE_P (TREE_TYPE (decl)))
+     {
+       location_t elocus = locus;
+ 
+       if (EXPR_HAS_LOCATION (init))
+ 	elocus = EXPR_LOCATION (init);
+       error ("%Hinvalid type for iteration variable %qE", &elocus, decl);
+       return NULL;
+     }
+ 
    if (pre_body == NULL || IS_EMPTY_STMT (pre_body))
      pre_body = NULL;
    else if (! processing_template_decl)
*************** finish_decltype_type (tree expr, bool id
*** 4154,4160 ****
        switch (TREE_CODE (expr))
          {
          case FIELD_DECL:
!           if (DECL_C_BIT_FIELD (expr))
              {
                type = DECL_BIT_FIELD_TYPE (expr);
                break;
--- 4186,4192 ----
        switch (TREE_CODE (expr))
          {
          case FIELD_DECL:
!           if (DECL_BIT_FIELD_TYPE (expr))
              {
                type = DECL_BIT_FIELD_TYPE (expr);
                break;
diff -Nrcpad gcc-4.3.0/gcc/cp/tree.c gcc-4.3.1/gcc/cp/tree.c
*** gcc-4.3.0/gcc/cp/tree.c	Mon Feb 11 18:58:16 2008
--- gcc-4.3.1/gcc/cp/tree.c	Mon Apr 21 18:02:26 2008
*************** cp_tree_equal (tree t1, tree t2)
*** 1734,1739 ****
--- 1734,1743 ----
  	&& !memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
  		    TREE_STRING_LENGTH (t1));
  
+     case FIXED_CST:
+       return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1),
+ 				     TREE_FIXED_CST (t2));
+ 
      case COMPLEX_CST:
        return cp_tree_equal (TREE_REALPART (t1), TREE_REALPART (t2))
  	&& cp_tree_equal (TREE_IMAGPART (t1), TREE_IMAGPART (t2));
diff -Nrcpad gcc-4.3.0/gcc/cp/typeck.c gcc-4.3.1/gcc/cp/typeck.c
*** gcc-4.3.0/gcc/cp/typeck.c	Wed Feb  6 18:49:03 2008
--- gcc-4.3.1/gcc/cp/typeck.c	Tue Apr 29 08:56:27 2008
*************** structural_comptypes (tree t1, tree t2, 
*** 962,967 ****
--- 962,969 ----
    if (TREE_CODE (t1) != ARRAY_TYPE
        && TYPE_QUALS (t1) != TYPE_QUALS (t2))
      return false;
+   if (TYPE_FOR_JAVA (t1) != TYPE_FOR_JAVA (t2))
+     return false;
  
    /* Allow for two different type nodes which have essentially the same
       definition.  Note that we already checked for equality of the type
*************** structural_comptypes (tree t1, tree t2, 
*** 971,979 ****
        && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
      return true;
  
-   if (TYPE_FOR_JAVA (t1) != TYPE_FOR_JAVA (t2))
-     return false;
- 
    /* Compare the types.  Break out if they could be the same.  */
    switch (TREE_CODE (t1))
      {
--- 973,978 ----
*************** is_bitfield_expr_with_lowered_type (cons
*** 1473,1479 ****
  	tree field;
  	
  	field = TREE_OPERAND (exp, 1);
! 	if (TREE_CODE (field) != FIELD_DECL || !DECL_C_BIT_FIELD (field))
  	  return NULL_TREE;
  	if (same_type_ignoring_top_level_qualifiers_p
  	    (TREE_TYPE (exp), DECL_BIT_FIELD_TYPE (field)))
--- 1472,1478 ----
  	tree field;
  	
  	field = TREE_OPERAND (exp, 1);
! 	if (TREE_CODE (field) != FIELD_DECL || !DECL_BIT_FIELD_TYPE (field))
  	  return NULL_TREE;
  	if (same_type_ignoring_top_level_qualifiers_p
  	    (TREE_TYPE (exp), DECL_BIT_FIELD_TYPE (field)))
*************** build_modify_expr (tree lhs, enum tree_c
*** 5668,5677 ****
  	lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
  		      stabilize_reference (TREE_OPERAND (lhs, 0)),
  		      TREE_OPERAND (lhs, 1));
!       return build2 (COMPOUND_EXPR, lhstype,
! 		     lhs,
! 		     build_modify_expr (TREE_OPERAND (lhs, 0),
! 					modifycode, rhs));
  
        /* Handle (a, b) used as an "lvalue".  */
      case COMPOUND_EXPR:
--- 5667,5677 ----
  	lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
  		      stabilize_reference (TREE_OPERAND (lhs, 0)),
  		      TREE_OPERAND (lhs, 1));
!       newrhs = build_modify_expr (TREE_OPERAND (lhs, 0),
! 				  modifycode, rhs);
!       if (newrhs == error_mark_node)
! 	return error_mark_node;
!       return build2 (COMPOUND_EXPR, lhstype, lhs, newrhs);
  
        /* Handle (a, b) used as an "lvalue".  */
      case COMPOUND_EXPR:
diff -Nrcpad gcc-4.3.0/libstdc++-v3/ChangeLog gcc-4.3.1/libstdc++-v3/ChangeLog
*** gcc-4.3.0/libstdc++-v3/ChangeLog	Wed Mar  5 17:44:19 2008
--- gcc-4.3.1/libstdc++-v3/ChangeLog	Fri Jun  6 14:26:44 2008
***************
*** 1,3 ****
--- 1,326 ----
+ 2008-06-06  Release Manager
+ 
+ 	* GCC 4.3.1 released.
+ 
+ 2008-06-05  Johannes Singler  <singler@ira.uka.de>
+ 
+         * include/parallel/random_shuffle.h:
+         (parallel_random_shuffle_drs) Get the actual number of
+         threads after entering the parallel region. Indentation.
+         * include/parallel/algo.h: (random_shuffle(begin, end))
+         Add namespace qualification to avoid ambiguity.
+ 
+ 2008-05-15  Johannes Singler  <singler@ira.uka.de>
+ 
+         * doc/xml/manual/parallel_mode.xml:
+         General revision, correct wrong doc and make it more 
+         readable. 
+ 
+ 2008-05-12  Paolo Carlini  <paolo.carlini@oracle.com>
+ 
+ 	Revert:
+ 	2008-05-10  Roberto Bagnara  <bagnara@cs.unipr.it>
+ 	    	    Paolo Carlini  <paolo.carlini@oracle.com>
+ 
+ 	* include/debug/vector (vector<>::_M_requires_reallocation): Fix macro.
+ 	* testsuite/23_containers/vector/debug_mode_requires_reallocation.cc:
+ 	New.
+ 
+ 2008-05-10  Roberto Bagnara  <bagnara@cs.unipr.it>
+ 	    Paolo Carlini  <paolo.carlini@oracle.com>
+ 
+ 	* include/debug/vector (vector<>::_M_requires_reallocation): Fix macro.
+ 	* testsuite/23_containers/vector/debug_mode_requires_reallocation.cc:
+ 	New.
+ 
+ 2008-05-07  Johannes Singler  <singler@ira.uka.de>
+ 
+ 	* include/parallel/quicksort.h (parallel_sort_qs_conquer):
+ 	Explicitly request number of threads in the parallel clause.
+ 	(parallel_sort_qs): Remove setting the number of threads globally. 
+ 
+ 2008-05-06  Johannes Singler  <singler@ira.uka.de>
+ 
+         * include/parallel/multiway_merge.h (multiway_merge_*_unguarded):
+         Pass sentinel directly, to allow correct determination.
+         (multiway_merge_loser_tree_unguarded): Remove over-cautious assertion.
+         (calls to multiway_merge_*_splitting): Parametrize with type that
+ 	is correct in all cases.
+         * include/parallel/losertree.h (delete_min_insert (in many classes)):
+         Correct and standardize assertions.
+ 
+ 2008-05-05  Benjamin Kosnik  <bkoz@redhat.com>
+ 
+ 	* 20_util/make_signed/requirements/typedefs-1.cc: Correct requirements.
+ 	* 20_util/make_unsigned/requirements/typedefs-1.cc: Same.
+ 	
+ 2008-04-29  Benjamin Kosnik  <bkoz@redhat.com>
+ 
+ 	PR libstdc++/35922
+ 	* include/std/unordered_map: Include debug/unordered_map if
+ 	_GLIBCXX_DEBUG.
+ 	* testsuite/23_containers/unordered_map/requirements/debug.cc: Move...
+ 	* testsuite/23_containers/unordered_map/requirements/
+ 	debug_container.cc: ...here.
+ 	* testsuite/23_containers/unordered_map/requirements/debug_mode.cc: New.
+ 	* testsuite/23_containers/unordered_set/requirements/debug.cc: Move...
+ 	* testsuite/23_containers/unordered_set/requirements/
+ 	debug_container.cc: ...here.
+ 	* testsuite/23_containers/unordered_set/requirements/debug_mode.cc: New.
+ 
+ 2008-04-29  Joseph Myers  <joseph@codesourcery.com>
+ 
+ 	* Makefile.am (install-html, install-pdf): Add dummy targets.
+ 	* Makefile.in: Regenerate.
+ 	* doc/Makefile.am (install-html, install-pdf): Remove.
+ 	* doc/Makefile.in: Regenerate.
+ 
+ 2008-04-28  Ralf Wildenhues  <Ralf.Wildenhues@gmx.de>
+ 
+ 	* include/Makefile.am: Fix most stamp rules to regenerate
+ 	the links for all sources newer than the stamp file.
+ 	* include/Makefile.in: Regenerate.
+ 
+ 2008-05-25  Benjamin Kosnik  <bkoz@redhat.com>
+ 
+         Revert PR libstdc++/35887 
+         * configure.ac: Revert.
+         * acinclude.m4: Same.
+         * configure: Regenerate.
+         * include/Makefile.am: Revert.
+         * include/Makefile.in: Regenerate.
+ 	
+ 2008-04-24  Benjamin Kosnik  <bkoz@redhat.com>
+ 
+         PR libstdc++/35887 
+         * configure.ac: Add default argument to GLIBCXX_ENABLE_PARALLEL.
+         * acinclude.m4 (GLIBCXX_ENABLE_PARALLEL): Check for --disable-libgomp.
+         * configure: Regenerate.
+         * include/Makefile.am (parallel_headers): Make conditional on
+         ENABLE_PARALLEL.
+         * include/Makefile.in: Regenerate.
+ 
+ 2008-04-24  Ralf Wildenhues  <Ralf.Wildenhues@gmx.de>
+ 
+ 	PR libstdc++/35954
+ 	* include/Makefile.am (pch*_output): Do not touch pch*_output_anchor.
+ 	Call 'mkdir -p' unconditionally, but ignore its return value.
+ 	* include/Makefile.in: Regenerate.
+ 
+ 2008-04-23  Johannes Singler  <singler@ira.uka.de>
+ 
+         * include/parallel/multiway_merge.h
+         (multiway_merge_loser_tree):
+         Leave checks to callers, add precondition instead.
+         (multiway_merge_loser_tree_unguarded): Likewise.
+         (multiway_merge_loser_tree_sentinel): Likewise.
+         (sequential_multiway_merge): Added checks for total length 0.
+         (parallel_multiway_merge): Skip empty sequences.
+         (multiway_merge, all variants):
+         Remove temporary variable, return directly.
+         (stable_multiway_merge, all variants): Likewise.
+         (multiway_merge_sentinels, all variants):  Likewise.
+         (stable_multiway_merge_sentinels, all variants): Likewise.
+         * include/parallel/multiseq_selection.h
+         (multiseq_partition): More detailed assertions.
+ 
+ 2008-04-14  Benjamin Kosnik  <bkoz@redhat.com>
+ 
+ 	PR libstdc++/35816
+ 	* acinclude.m4 (GLIBCXX_ENABLE_ATOMIC_BUILTINS): Set CXXFLAGS to
+ 	-O0 when checking for atomic builtins.
+ 	* configure: Regenerate.
+ 
+ 2008-04-10  Benjamin Kosnik  <bkoz@redhat.com>
+ 
+ 	* doc/html/*: Regenerate.
+ 	
+ 2008-04-10  Ralf Wildenhues  <Ralf.Wildenhues@gmx.de>
+ 
+ 	* doc/xml/manual/bitmap_allocator.xml: Improve wording a bit.
+ 	* doc/xml/authors.xml: Fix typos.
+ 	* doc/xml/faq.xml: Likewise.
+ 	* doc/xml/manual/abi.xml: Likewise.
+ 	* doc/xml/manual/allocator.xml: Likewise.
+ 	* doc/xml/manual/appendix_contributing.xml: Likewise.
+ 	* doc/xml/manual/backwards_compatibility.xml: Likewise.
+ 	* doc/xml/manual/build_hacking.xml: Likewise.
+ 	* doc/xml/manual/codecvt.xml: Likewise.
+ 	* doc/xml/manual/concurrency.xml: Likewise.
+ 	* doc/xml/manual/ctype.xml: Likewise.
+ 	* doc/xml/manual/debug_mode.xml: Likewise.
+ 	* doc/xml/manual/diagnostics.xml: Likewise.
+ 	* doc/xml/manual/evolution.xml: Likewise.
+ 	* doc/xml/manual/extensions.xml: Likewise.
+ 	* doc/xml/manual/locale.xml: Likewise.
+ 	* doc/xml/manual/messages.xml: Likewise.
+ 	* doc/xml/manual/parallel_mode.xml: Likewise.
+ 	* doc/xml/manual/status_cxx200x.xml: Likewise.
+ 	* doc/xml/manual/strings.xml: Likewise.
+ 	* doc/xml/manual/support.xml: Likewise.
+ 	* doc/xml/manual/test.xml: Likewise.
+ 	* doc/xml/manual/using.xml: Likewise.
+ 
+ 2008-04-10  Benjamin Kosnik  <bkoz@redhat.com>
+ 	    Johannes Singler  <singler@ira.uka.de>
+ 
+ 	* doc/xml/manual/parallel_mode.xml: Remove map/set bulk
+ 	insertors. Correct omp_set_num_threads example.
+ 	
+ 2008-04-07  Johannes Singler  <singler@ira.uka.de>
+ 
+ 	* include/parallel/multiway_merge.h: Moved decisions to
+ 	compile-time instead of run-time.
+ 	* include/parallel/losertree.h: Removed obsolete variants, added
+ 	variant that uses pointers in the loser tree.
+ 	* include/parallel/types.h: Remove obsolete settings options from enum.
+ 	* include/parallel/features.h: Remove obsolete compile-time switches.
+ 	* include/parallel/compiletime_settings.h: Remove obsolete variant
+ 	that copies back *after* sorting.
+ 	* include/parallel/tags.h: Add one new tag for compile-time switch.
+ 	* include/parallel/merge.h: Adapt to changes in multiway_merge.h.
+ 	* include/parallel/multiway_mergesort.h: Adapt to changes in
+ 	multiway_merge.h. Factor out splitting variants. Remove obsolete
+ 	variant that copies back *after* sorting.
+ 	* include/parallel/sort.h: Adapt to changes in multiway_mergesort.h.
+ 	* testsuite/25_algorithms/sort/35588.cc: Added test case from /
+ 	for PR 35588.
+ 
+ 2008-03-29  Paolo Carlini  <pcarlini@suse.de>
+ 
+ 	PR libstdc++/35725
+ 	* include/bits/stl_algobase.h (__fill_a(_ForwardIterator,
+ 	_ForwardIterator, _Tp), __fill_a(_Tp*, _Tp*, _Tp),
+ 	__fill_n_a(_OutputIterator, _Size, _Tp), __fill_n_a(_Tp*, _Size,
+ 	_Tp)): Fix signatures.
+ 	* testsuite/25_algorithms/fill/35725.cc: New.
+ 	* testsuite/25_algorithms/fill_n/35725.cc: Likewise.
+ 
+ 2008-03-29  Matthias Klose  <doko@ubuntu.com>
+ 
+ 	* config/abi/post/s390-linux-gnu/baseline_symbols.txt: Update.
+ 	* config/abi/post/ia64-linux-gnu/baseline_symbols.txt: Likewise.
+ 	* config/abi/post/mips-linux-gnu/baseline_symbols.txt: Likewise.
+ 	* config/abi/post/sparc-linux-gnu/baseline_symbols.txt: Likewise.
+ 
+ 2008-03-25  Benjamin Kosnik  <bkoz@redhat.com>
+ 
+ 	* scripts/run_doxygen: Remove html_output_dir. Downgrade to
+ 	Doxygen 1.5.1.
+ 	* doc/doxygen/style.css: Delete.
+ 	* doc/doxygen/user.cfg.in: Regenerate with Doxygen 1.5.1.
+ 	(INPUT): Update.
+ 	(PREDEFINED): Update.
+ 	(HTML_OUTPUT): Remove html_output_dir, use html.
+ 	(HTML_STYLESHEET): Remove style.css.
+ 	* doc/doxygen/tables.html: Remove style.css use.
+ 	* doc/doxygen/mainpage.html: Nested lists for Namespaces and Classes.
+ 	* doc/doxygen/doxygroups.cc: Namespace edits.
+ 	* doc/doxygen/Intro.3: Correct typo.
+ 
+ 	* doc/xml/api.xml: Add gcc-4.3 links.
+ 	* doc/html/api.html: Regenerate.	
+ 	
+ 	* include/debug/debug.h: Document namepaces here.
+ 	* include/parallel/base.h: Same.
+ 	* include/ext/typelist.h: Same.
+ 	* include/ext/pb_ds/tag_and_trait.hpp: Same.
+ 	
+ 	* include/tr1_impl/random: Adjust line break.
+ 	* include/tr1_impl/unordered_map: Correct and or add markup.
+ 	* include/tr1_impl/boost_shared_ptr.h: Correct and or add markup.
+ 	* include/tr1_impl/functional_hash.h: Same.
+ 	* include/tr1_impl/cmath: Same.
+ 	* include/tr1_impl/functional: Same.
+ 	* include/tr1_impl/unordered_set: Same.
+ 	* include/tr1_impl/complex: Same.
+ 	* include/tr1_impl/type_traits: Same.
+ 	* include/tr1_impl/regex: Same.
+ 	* include/tr1_impl/array: Same.
+ 	* include/std/tuple: Same.
+ 	* include/std/date_time: Same.
+ 	* include/std/system_error: Same.
+ 	* include/std/type_traits: Same.
+ 	* include/ext/enc_filebuf.h: Same.
+ 	* include/ext/throw_allocator.h: Same.
+ 	* include/ext/pool_allocator.h: Same.
+ 	* include/ext/bitmap_allocator.h: Same.
+ 	* include/ext/concurrence.h: Same.
+ 	* include/ext/codecvt_specializations.h: Same.
+ 	* include/ext/stdio_sync_filebuf.h: Same.
+ 	* include/ext/array_allocator.h: Same.
+ 	* include/ext/mt_allocator.h: Same.
+ 	* include/bits/locale_classes.h: Same.
+ 	* include/bits/locale_facets.h: Same.
+ 	* include/bits/codecvt.h: Same.
+ 	* include/bits/char_traits.h: Same.
+ 	* include/bits/allocator.h: Same.
+ 	* include/bits/locale_facets_nonio.h: Same.
+ 	* include/tr1/poly_laguerre.tcc: Same.
+ 	* include/tr1/riemann_zeta.tcc: Same.
+ 	* include/tr1/beta_function.tcc: Same.
+ 	* include/tr1/tuple: Same.
+ 	* include/tr1/exp_integral.tcc: Same.
+ 	* include/tr1/gamma.tcc: Same.
+ 	* include/tr1/hypergeometric.tcc: Same.
+ 	* include/tr1/modified_bessel_func.tcc: Same.
+ 	* include/tr1/legendre_function.tcc: Same.
+ 	* include/tr1/type_traits: Same.
+ 	* include/tr1/special_function_util.h: Same.
+ 	* include/tr1/bessel_function.tcc: Same.
+ 	* include/tr1/cmath: Same.
+ 	* include/tr1/poly_hermite.tcc: Same.
+ 	* include/tr1/ell_integral.tcc: Same.
+ 	* config/abi/compatibility.h: Adjust file name.
+ 
+ 	* testsuite/19_diagnostics/error_category/cons/copy_neg.cc: Adjust
+ 	line numbers.	
+ 	* testsuite/20_util/make_signed/requirements/typedefs_neg.cc: Same.
+ 	* testsuite/20_util/make_unsigned/requirements/typedefs_neg.cc: Same.
+ 
+ 2008-03-23  Paolo Carlini  <pcarlini@suse.de>
+ 
+ 	* doc/xml/faq.xml: Fix various links.
+ 	* doc/xml/api.xml: Likewise.
+ 	* doc/xml/manual/parallel_mode.xml: Likewise.
+ 	* doc/html/faq.html: Regenerate.
+ 	* doc/html/api.html: Likewise.
+ 	* doc/html/manual/bk01pt12ch31s03.html: Likewise.
+ 
+ 2008-03-20  Paolo Carlini  <pcarlini@suse.de>
+ 
+ 	PR libstdc++/35637
+ 	* include/tr1_impl/type_traits (struct __in_array): Add back.
+ 	(is_function): Use it.
+ 	* testsuite/tr1/4_metaprogramming/is_function/35637.cc: New.
+ 
+ 2008-03-19  Benjamin Kosnik  <bkoz@redhat.com>
+ 
+ 	PR libstdc++/35256
+ 	* doc/xml/manual/parallel_mode.xml: Correct configuration documentation.
+ 	* doc/html/manual/bk01pt12ch31s04.html: Regenerate.
+ 
+ 2008-03-13  Dennis Czeremin  <dennis.czeremin@smiths-heimann.com>
+ 
+ 	PR libstdc++/35566
+ 	* include/bits/stl_multimap.h (multimap<>::multimap(_InputIterator,
+ 	_InputIterator)): Forward to _M_insert_equal, not _M_insert_unique.
+ 
+ 2008-03-13  Paolo Carlini  <pcarlini@suse.de>
+ 
+ 	PR libstdc++/35541
+ 	* include/debug/functions.h (__check_sorted_set_aux): Fix signature.
+ 	* testsuite/25_algorithms/set_difference/35541.cc: New.
+ 
+ 2008-03-06  Chris Jefferson  <chris@bubblescope.net>
+ 	    Paolo Carlini  <pcarlini@suse.de>
+ 
+ 	PR libstdc++/35480
+ 	* include/tr1/tuple (operator==, operator<): Fix.
+ 	* include/std/tuple (operator==, operator<): Likewise.
+ 	* testsuite/tr1/6_containers/tuple/comparison_operators/35480.cc: New.
+ 	* testsuite/20_util/tuple/comparison_operators/35480.cc: Likewise.
+ 
  2008-03-05  Release Manager
  
  	* GCC 4.3.0 released.
diff -Nrcpad gcc-4.3.0/libstdc++-v3/Makefile.am gcc-4.3.1/libstdc++-v3/Makefile.am
*** gcc-4.3.0/libstdc++-v3/Makefile.am	Fri Jan 18 08:16:51 2008
--- gcc-4.3.1/libstdc++-v3/Makefile.am	Tue Apr 29 15:32:26 2008
*************** AM_MAKEFLAGS = \
*** 89,91 ****
--- 89,95 ----
  
  # Subdir rules rely on $(FLAGS_TO_PASS)
  FLAGS_TO_PASS = $(AM_MAKEFLAGS)
+ 
+ .PHONY: install-html install-pdf
+ install-html:
+ install-pdf:
diff -Nrcpad gcc-4.3.0/libstdc++-v3/Makefile.in gcc-4.3.1/libstdc++-v3/Makefile.in
*** gcc-4.3.0/libstdc++-v3/Makefile.in	Mon Feb 11 10:05:33 2008
--- gcc-4.3.1/libstdc++-v3/Makefile.in	Tue Apr 29 15:32:26 2008
*************** doc-%:
*** 794,799 ****
--- 794,803 ----
  # All the machinations with string instantiations messes up the
  # automake-generated TAGS rule. Make a simple one here.
  TAGS: tags-recursive $(LISP)
+ 
+ .PHONY: install-html install-pdf
+ install-html:
+ install-pdf:
  # Tell versions [3.59,3.63) of GNU make to not export all variables.
  # Otherwise a system limit (for SysV at least) may be exceeded.
  .NOEXPORT:
diff -Nrcpad gcc-4.3.0/libstdc++-v3/acinclude.m4 gcc-4.3.1/libstdc++-v3/acinclude.m4
*** gcc-4.3.0/libstdc++-v3/acinclude.m4	Fri Feb 29 00:00:39 2008
--- gcc-4.3.1/libstdc++-v3/acinclude.m4	Fri Apr 25 16:52:57 2008
*************** int main()
*** 2083,2089 ****
  }
  EOF
      old_CXXFLAGS="$CXXFLAGS"
!     CXXFLAGS=-S
      if AC_TRY_EVAL(ac_compile); then
        if grep __sync_fetch_and_add conftest.s >/dev/null 2>&1 ; then
          enable_atomic_builtins=no
--- 2083,2089 ----
  }
  EOF
      old_CXXFLAGS="$CXXFLAGS"
!     CXXFLAGS='-O0 -S'
      if AC_TRY_EVAL(ac_compile); then
        if grep __sync_fetch_and_add conftest.s >/dev/null 2>&1 ; then
          enable_atomic_builtins=no
*************** EOF
*** 2094,2099 ****
--- 2094,2100 ----
  	atomicity_dir=cpu/generic/atomicity_builtins
        fi
      fi
+     AC_MSG_RESULT($enable_atomic_builtins)
      CXXFLAGS="$old_CXXFLAGS"
      rm -f conftest*
  
*************** EOF
*** 2102,2108 ****
  	atomicity_dir=cpu/generic/atomicity_mutex
    fi
   AC_LANG_RESTORE
-  AC_MSG_RESULT($enable_atomic_builtins)
  ])
  
  
--- 2103,2108 ----
diff -Nrcpad gcc-4.3.0/libstdc++-v3/config/abi/compatibility.h gcc-4.3.1/libstdc++-v3/config/abi/compatibility.h
*** gcc-4.3.0/libstdc++-v3/config/abi/compatibility.h	Tue Dec  5 23:24:07 2006
--- gcc-4.3.1/libstdc++-v3/config/abi/compatibility.h	Wed Mar 26 23:21:44 2008
***************
*** 28,34 ****
  // invalidate any other reasons why the executable file might be covered by
  // the GNU General Public License.
  
! /** @file compatibility.h
   *  This is an internal header file, included by other library sources.
   *  You should not attempt to use it directly.
   */
--- 28,34 ----
  // invalidate any other reasons why the executable file might be covered by
  // the GNU General Public License.
  
! /** @file bits/compatibility.h
   *  This is an internal header file, included by other library sources.
   *  You should not attempt to use it directly.
   */
diff -Nrcpad gcc-4.3.0/libstdc++-v3/config/abi/post/ia64-linux-gnu/baseline_symbols.txt gcc-4.3.1/libstdc++-v3/config/abi/post/ia64-linux-gnu/baseline_symbols.txt
*** gcc-4.3.0/libstdc++-v3/config/abi/post/ia64-linux-gnu/baseline_symbols.txt	Sun Dec 18 09:39:23 2005
--- gcc-4.3.1/libstdc++-v3/config/abi/post/ia64-linux-gnu/baseline_symbols.txt	Sat Mar 29 09:10:14 2008
*************** FUNC:_ZN10__gnu_norm15_List_node_base4sw
*** 33,51 ****
--- 33,83 ----
  FUNC:_ZN10__gnu_norm15_List_node_base6unhookEv@@GLIBCXX_3.4
  FUNC:_ZN10__gnu_norm15_List_node_base7reverseEv@@GLIBCXX_3.4
  FUNC:_ZN10__gnu_norm15_List_node_base8transferEPS0_S1_@@GLIBCXX_3.4
+ FUNC:_ZN11__gnu_debug19_Safe_iterator_base12_M_get_mutexEv@@GLIBCXX_3.4.9
+ FUNC:_ZN11__gnu_debug19_Safe_iterator_base16_M_attach_singleEPNS_19_Safe_sequence_baseEb@@GLIBCXX_3.4.9
+ FUNC:_ZN11__gnu_debug19_Safe_iterator_base16_M_detach_singleEv@@GLIBCXX_3.4.9
  FUNC:_ZN11__gnu_debug19_Safe_iterator_base9_M_attachEPNS_19_Safe_sequence_baseEb@@GLIBCXX_3.4
  FUNC:_ZN11__gnu_debug19_Safe_iterator_base9_M_detachEv@@GLIBCXX_3.4
+ FUNC:_ZN11__gnu_debug19_Safe_sequence_base12_M_get_mutexEv@@GLIBCXX_3.4.9
  FUNC:_ZN11__gnu_debug19_Safe_sequence_base13_M_detach_allEv@@GLIBCXX_3.4
  FUNC:_ZN11__gnu_debug19_Safe_sequence_base18_M_detach_singularEv@@GLIBCXX_3.4
  FUNC:_ZN11__gnu_debug19_Safe_sequence_base22_M_revalidate_singularEv@@GLIBCXX_3.4
  FUNC:_ZN11__gnu_debug19_Safe_sequence_base7_M_swapERS0_@@GLIBCXX_3.4
+ FUNC:_ZN14__gnu_parallel9_Settings3getEv@@GLIBCXX_3.4.10
+ FUNC:_ZN14__gnu_parallel9_Settings3setERS0_@@GLIBCXX_3.4.10
  FUNC:_ZN9__gnu_cxx12__atomic_addEPVii@@GLIBCXX_3.4
  FUNC:_ZN9__gnu_cxx17__pool_alloc_base12_M_get_mutexEv@@GLIBCXX_3.4.2
  FUNC:_ZN9__gnu_cxx17__pool_alloc_base16_M_get_free_listEm@@GLIBCXX_3.4.2
  FUNC:_ZN9__gnu_cxx17__pool_alloc_base9_M_refillEm@@GLIBCXX_3.4.2
  FUNC:_ZN9__gnu_cxx18__exchange_and_addEPVii@@GLIBCXX_3.4
  FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE4fileEv@@GLIBCXX_3.4.2
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE4syncEv@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE5uflowEv@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE6xsgetnEPcl@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE6xsputnEPKcl@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE7seekoffElSt12_Ios_SeekdirSt13_Ios_Openmode@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE7seekposESt4fposI11__mbstate_tESt13_Ios_Openmode@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE8overflowEi@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE9pbackfailEi@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE9underflowEv@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEEC1EP8_IO_FILE@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEEC2EP8_IO_FILE@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEED0Ev@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEED1Ev@@GLIBCXX_3.4.10
  FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE4fileEv@@GLIBCXX_3.4.2
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE4syncEv@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE5uflowEv@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE6xsgetnEPwl@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE6xsputnEPKwl@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE7seekoffElSt12_Ios_SeekdirSt13_Ios_Openmode@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE7seekposESt4fposI11__mbstate_tESt13_Ios_Openmode@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE8overflowEj@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE9pbackfailEj@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE9underflowEv@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEEC1EP8_IO_FILE@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEEC2EP8_IO_FILE@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEED0Ev@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEED1Ev@@GLIBCXX_3.4.10
  FUNC:_ZN9__gnu_cxx27__verbose_terminate_handlerEv@@CXXABI_1.3
  FUNC:_ZN9__gnu_cxx6__poolILb0EE10_M_destroyEv@@GLIBCXX_3.4.4
  FUNC:_ZN9__gnu_cxx6__poolILb0EE13_M_initializeEv@@GLIBCXX_3.4.4
*************** FUNC:_ZN9__gnu_cxx6__poolILb0EE16_M_recl
*** 53,58 ****
--- 85,91 ----
  FUNC:_ZN9__gnu_cxx6__poolILb0EE16_M_reserve_blockEmm@@GLIBCXX_3.4.4
  FUNC:_ZN9__gnu_cxx6__poolILb1EE10_M_destroyEv@@GLIBCXX_3.4.4
  FUNC:_ZN9__gnu_cxx6__poolILb1EE13_M_initializeEPFvPvE@@GLIBCXX_3.4.4
+ FUNC:_ZN9__gnu_cxx6__poolILb1EE13_M_initializeEv@@GLIBCXX_3.4.6
  FUNC:_ZN9__gnu_cxx6__poolILb1EE16_M_get_thread_idEv@@GLIBCXX_3.4.4
  FUNC:_ZN9__gnu_cxx6__poolILb1EE16_M_reclaim_blockEPcm@@GLIBCXX_3.4.4
  FUNC:_ZN9__gnu_cxx6__poolILb1EE16_M_reserve_blockEmm@@GLIBCXX_3.4.4
*************** FUNC:_ZNK11__gnu_debug16_Error_formatter
*** 81,86 ****
--- 114,120 ----
  FUNC:_ZNK11__gnu_debug16_Error_formatter10_Parameter20_M_print_descriptionEPKS0_@@GLIBCXX_3.4
  FUNC:_ZNK11__gnu_debug16_Error_formatter13_M_print_wordEPKc@@GLIBCXX_3.4
  FUNC:_ZNK11__gnu_debug16_Error_formatter15_M_print_stringEPKc@@GLIBCXX_3.4
+ FUNC:_ZNK11__gnu_debug16_Error_formatter17_M_get_max_lengthEv@@GLIBCXX_3.4.10
  FUNC:_ZNK11__gnu_debug16_Error_formatter8_M_errorEv@@GLIBCXX_3.4
  FUNC:_ZNK11__gnu_debug19_Safe_iterator_base11_M_singularEv@@GLIBCXX_3.4
  FUNC:_ZNK11__gnu_debug19_Safe_iterator_base14_M_can_compareERKS0_@@GLIBCXX_3.4
*************** FUNC:_ZNKSs8capacityEv@@GLIBCXX_3.4
*** 203,208 ****
--- 237,243 ----
  FUNC:_ZNKSs8max_sizeEv@@GLIBCXX_3.4
  FUNC:_ZNKSs9_M_ibeginEv@@GLIBCXX_3.4
  FUNC:_ZNKSsixEm@@GLIBCXX_3.4
+ FUNC:_ZNKSt10bad_typeid4whatEv@@GLIBCXX_3.4.9
  FUNC:_ZNKSt10istrstream5rdbufEv@@GLIBCXX_3.4
  FUNC:_ZNKSt10moneypunctIcLb0EE10neg_formatEv@@GLIBCXX_3.4
  FUNC:_ZNKSt10moneypunctIcLb0EE10pos_formatEv@@GLIBCXX_3.4
*************** FUNC:_ZNKSt11__timepunctIwE9_M_monthsEPP
*** 301,306 ****
--- 336,342 ----
  FUNC:_ZNKSt11logic_error4whatEv@@GLIBCXX_3.4
  FUNC:_ZNKSt12__basic_fileIcE7is_openEv@@GLIBCXX_3.4
  FUNC:_ZNKSt12strstreambuf6pcountEv@@GLIBCXX_3.4
+ FUNC:_ZNKSt13bad_exception4whatEv@@GLIBCXX_3.4.9
  FUNC:_ZNKSt13basic_filebufIcSt11char_traitsIcEE7is_openEv@@GLIBCXX_3.4
  FUNC:_ZNKSt13basic_filebufIwSt11char_traitsIwEE7is_openEv@@GLIBCXX_3.4
  FUNC:_ZNKSt13basic_fstreamIcSt11char_traitsIcEE5rdbufEv@@GLIBCXX_3.4
*************** FUNC:_ZNKSt19basic_ostringstreamIcSt11ch
*** 353,358 ****
--- 389,404 ----
  FUNC:_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE5rdbufEv@@GLIBCXX_3.4
  FUNC:_ZNKSt19basic_ostringstreamIwSt11char_traitsIwESaIwEE3strEv@@GLIBCXX_3.4
  FUNC:_ZNKSt19basic_ostringstreamIwSt11char_traitsIwESaIwEE5rdbufEv@@GLIBCXX_3.4
+ FUNC:_ZNKSt3tr14hashIRKSbIwSt11char_traitsIwESaIwEEEclES6_@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt3tr14hashIRKSsEclES2_@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt3tr14hashISbIwSt11char_traitsIwESaIwEEEclES4_@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt3tr14hashISsEclESs@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt3tr14hashIeEclEe@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt4hashIRKSbIwSt11char_traitsIwESaIwEEEclES5_@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt4hashIRKSsEclES1_@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt4hashISbIwSt11char_traitsIwESaIwEEEclES3_@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt4hashISsEclESs@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt4hashIeEclEe@@GLIBCXX_3.4.10
  FUNC:_ZNKSt5ctypeIcE10do_tolowerEPcPKc@@GLIBCXX_3.4
  FUNC:_ZNKSt5ctypeIcE10do_tolowerEc@@GLIBCXX_3.4
  FUNC:_ZNKSt5ctypeIcE10do_toupperEPcPKc@@GLIBCXX_3.4
*************** FUNC:_ZNKSt7num_putIwSt19ostreambuf_iter
*** 515,520 ****
--- 561,567 ----
  FUNC:_ZNKSt7num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES3_RSt8ios_basewm@@GLIBCXX_3.4
  FUNC:_ZNKSt7num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES3_RSt8ios_basewx@@GLIBCXX_3.4
  FUNC:_ZNKSt7num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES3_RSt8ios_basewy@@GLIBCXX_3.4
+ FUNC:_ZNKSt8bad_cast4whatEv@@GLIBCXX_3.4.9
  FUNC:_ZNKSt8ios_base7failure4whatEv@@GLIBCXX_3.4
  FUNC:_ZNKSt8messagesIcE18_M_convert_to_charERKSs@@GLIBCXX_3.4
  FUNC:_ZNKSt8messagesIcE20_M_convert_from_charEPc@@GLIBCXX_3.4
*************** FUNC:_ZNKSt8time_putIwSt19ostreambuf_ite
*** 591,596 ****
--- 638,644 ----
  FUNC:_ZNKSt8time_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE3putES3_RSt8ios_basewPK2tmcc@@GLIBCXX_3.4
  FUNC:_ZNKSt8time_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES3_RSt8ios_basewPK2tmcc@@GLIBCXX_3.4
  FUNC:_ZNKSt8valarrayImE4sizeEv@@GLIBCXX_3.4
+ FUNC:_ZNKSt9bad_alloc4whatEv@@GLIBCXX_3.4.9
  FUNC:_ZNKSt9basic_iosIcSt11char_traitsIcEE10exceptionsEv@@GLIBCXX_3.4
  FUNC:_ZNKSt9basic_iosIcSt11char_traitsIcEE3badEv@@GLIBCXX_3.4
  FUNC:_ZNKSt9basic_iosIcSt11char_traitsIcEE3eofEv@@GLIBCXX_3.4
*************** FUNC:_ZNSdC2Ev@@GLIBCXX_3.4
*** 774,779 ****
--- 822,838 ----
  FUNC:_ZNSdD0Ev@@GLIBCXX_3.4
  FUNC:_ZNSdD1Ev@@GLIBCXX_3.4
  FUNC:_ZNSdD2Ev@@GLIBCXX_3.4
+ FUNC:_ZNSi10_M_extractIPvEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIbEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIdEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIeEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIfEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIjEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIlEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractImEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractItEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIxEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIyEERSiRT_@@GLIBCXX_3.4.9
  FUNC:_ZNSi3getEPcl@@GLIBCXX_3.4
  FUNC:_ZNSi3getEPclc@@GLIBCXX_3.4
  FUNC:_ZNSi3getERSt15basic_streambufIcSt11char_traitsIcEE@@GLIBCXX_3.4
*************** FUNC:_ZNSo6sentryC2ERSo@@GLIBCXX_3.4
*** 833,838 ****
--- 892,905 ----
  FUNC:_ZNSo6sentryD1Ev@@GLIBCXX_3.4
  FUNC:_ZNSo6sentryD2Ev@@GLIBCXX_3.4
  FUNC:_ZNSo8_M_writeEPKcl@@GLIBCXX_3.4
+ FUNC:_ZNSo9_M_insertIPKvEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertIbEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertIdEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertIeEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertIlEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertImEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertIxEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertIyEERSoT_@@GLIBCXX_3.4.9
  FUNC:_ZNSoC1EPSt15basic_streambufIcSt11char_traitsIcEE@@GLIBCXX_3.4
  FUNC:_ZNSoC1Ev@@GLIBCXX_3.4
  FUNC:_ZNSoC2EPSt15basic_streambufIcSt11char_traitsIcEE@@GLIBCXX_3.4
*************** FUNC:_ZNSt13basic_fstreamIwSt11char_trai
*** 1206,1211 ****
--- 1273,1289 ----
  FUNC:_ZNSt13basic_fstreamIwSt11char_traitsIwEED0Ev@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_fstreamIwSt11char_traitsIwEED1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_fstreamIwSt11char_traitsIwEED2Ev@@GLIBCXX_3.4
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIPvEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIbEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIdEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIeEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIfEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIjEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIlEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractImEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractItEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIxEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIyEERS2_RT_@@GLIBCXX_3.4.9
  FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE3getEPwl@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE3getEPwlw@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE3getERSt15basic_streambufIwS1_E@@GLIBCXX_3.4
*************** FUNC:_ZNSt13basic_ostreamIwSt11char_trai
*** 1265,1270 ****
--- 1343,1356 ----
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE6sentryD1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE6sentryD2Ev@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE8_M_writeEPKwl@@GLIBCXX_3.4
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIPKvEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIbEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIdEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIeEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIlEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertImEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIxEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIyEERS2_T_@@GLIBCXX_3.4.9
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEEC1EPSt15basic_streambufIwS1_E@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEEC1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEEC2EPSt15basic_streambufIwS1_E@@GLIBCXX_3.4
*************** FUNC:_ZNSt15basic_streambufIcSt11char_tr
*** 1386,1391 ****
--- 1472,1478 ----
  FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE6sbumpcEv@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE6setbufEPcl@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE6snextcEv@@GLIBCXX_3.4
+ FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE6stosscEv@@GLIBCXX_3.4.10
  FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE6xsgetnEPcl@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE6xsputnEPKcl@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE7pubsyncEv@@GLIBCXX_3.4
*************** FUNC:_ZNSt15basic_streambufIwSt11char_tr
*** 1424,1429 ****
--- 1511,1517 ----
  FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE6sbumpcEv@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE6setbufEPwl@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE6snextcEv@@GLIBCXX_3.4
+ FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE6stosscEv@@GLIBCXX_3.4.10
  FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE6xsgetnEPwl@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE6xsputnEPKwl@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE7pubsyncEv@@GLIBCXX_3.4
*************** FUNC:_ZNSt15basic_stringbufIcSt11char_tr
*** 1455,1460 ****
--- 1543,1549 ----
  FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEE7seekposESt4fposI11__mbstate_tESt13_Ios_Openmode@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEE8overflowEi@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEE9pbackfailEi@@GLIBCXX_3.4
+ FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEE9showmanycEv@@GLIBCXX_3.4.6
  FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEE9underflowEv@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ERKSsSt13_Ios_Openmode@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode@@GLIBCXX_3.4
*************** FUNC:_ZNSt15basic_stringbufIwSt11char_tr
*** 1471,1476 ****
--- 1560,1566 ----
  FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEE7seekposESt4fposI11__mbstate_tESt13_Ios_Openmode@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEE8overflowEj@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEE9pbackfailEj@@GLIBCXX_3.4
+ FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEE9showmanycEv@@GLIBCXX_3.4.6
  FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEE9underflowEv@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEEC1ERKSbIwS1_S2_ESt13_Ios_Openmode@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEEC1ESt13_Ios_Openmode@@GLIBCXX_3.4
*************** FUNC:_ZNSt5ctypeIwEC2Em@@GLIBCXX_3.4
*** 1660,1669 ****
--- 1750,1765 ----
  FUNC:_ZNSt5ctypeIwED0Ev@@GLIBCXX_3.4
  FUNC:_ZNSt5ctypeIwED1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt5ctypeIwED2Ev@@GLIBCXX_3.4
+ FUNC:_ZNSt6__norm15_List_node_base4hookEPS0_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt6__norm15_List_node_base4swapERS0_S1_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt6__norm15_List_node_base6unhookEv@@GLIBCXX_3.4.9
+ FUNC:_ZNSt6__norm15_List_node_base7reverseEv@@GLIBCXX_3.4.9
+ FUNC:_ZNSt6__norm15_List_node_base8transferEPS0_S1_@@GLIBCXX_3.4.9
  FUNC:_ZNSt6gslice8_IndexerC1EmRKSt8valarrayImES4_@@GLIBCXX_3.4
  FUNC:_ZNSt6gslice8_IndexerC2EmRKSt8valarrayImES4_@@GLIBCXX_3.4
  FUNC:_ZNSt6locale11_M_coalesceERKS_S1_i@@GLIBCXX_3.4
  FUNC:_ZNSt6locale21_S_normalize_categoryEi@@GLIBCXX_3.4
+ FUNC:_ZNSt6locale5_Impl16_M_install_cacheEPKNS_5facetEm@@GLIBCXX_3.4.7
  FUNC:_ZNSt6locale5_Impl16_M_install_facetEPKNS_2idEPKNS_5facetE@@GLIBCXX_3.4
  FUNC:_ZNSt6locale5_Impl16_M_replace_facetEPKS0_PKNS_2idE@@GLIBCXX_3.4
  FUNC:_ZNSt6locale5_Impl19_M_replace_categoryEPKS0_PKPKNS_2idE@@GLIBCXX_3.4
*************** FUNC:_ZNSt6locale5_ImplC2ERKS0_m@@GLIBCX
*** 1676,1681 ****
--- 1772,1778 ----
  FUNC:_ZNSt6locale5_ImplC2Em@@GLIBCXX_3.4
  FUNC:_ZNSt6locale5_ImplD1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt6locale5_ImplD2Ev@@GLIBCXX_3.4
+ FUNC:_ZNSt6locale5facet13_S_get_c_nameEv@@GLIBCXX_3.4.6
  FUNC:_ZNSt6locale5facet15_S_get_c_localeEv@@GLIBCXX_3.4
  FUNC:_ZNSt6locale5facet17_S_clone_c_localeERP15__locale_struct@@GLIBCXX_3.4
  FUNC:_ZNSt6locale5facet18_S_create_c_localeERP15__locale_structPKcS2_@@GLIBCXX_3.4
*************** FUNC:_ZNSt8bad_castD1Ev@@GLIBCXX_3.4
*** 1753,1759 ****
--- 1850,1858 ----
  FUNC:_ZNSt8bad_castD2Ev@@GLIBCXX_3.4
  FUNC:_ZNSt8ios_base13_M_grow_wordsEib@@GLIBCXX_3.4
  FUNC:_ZNSt8ios_base15sync_with_stdioEb@@GLIBCXX_3.4
+ FUNC:_ZNSt8ios_base17_M_call_callbacksENS_5eventE@@GLIBCXX_3.4.6
  FUNC:_ZNSt8ios_base17register_callbackEPFvNS_5eventERS_iEi@@GLIBCXX_3.4
+ FUNC:_ZNSt8ios_base20_M_dispose_callbacksEv@@GLIBCXX_3.4.6
  FUNC:_ZNSt8ios_base4InitC1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt8ios_base4InitC2Ev@@GLIBCXX_3.4
  FUNC:_ZNSt8ios_base4InitD1Ev@@GLIBCXX_3.4
*************** FUNC:_ZNSt8valarrayImEC2Em@@GLIBCXX_3.4
*** 1832,1837 ****
--- 1931,1941 ----
  FUNC:_ZNSt8valarrayImED1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt8valarrayImED2Ev@@GLIBCXX_3.4
  FUNC:_ZNSt8valarrayImEixEm@@GLIBCXX_3.4
+ FUNC:_ZNSt9__cxx199815_List_node_base4hookEPS0_@@GLIBCXX_3.4.10
+ FUNC:_ZNSt9__cxx199815_List_node_base4swapERS0_S1_@@GLIBCXX_3.4.10
+ FUNC:_ZNSt9__cxx199815_List_node_base6unhookEv@@GLIBCXX_3.4.10
+ FUNC:_ZNSt9__cxx199815_List_node_base7reverseEv@@GLIBCXX_3.4.10
+ FUNC:_ZNSt9__cxx199815_List_node_base8transferEPS0_S1_@@GLIBCXX_3.4.10
  FUNC:_ZNSt9bad_allocD0Ev@@GLIBCXX_3.4
  FUNC:_ZNSt9bad_allocD1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt9bad_allocD2Ev@@GLIBCXX_3.4
*************** FUNC:_ZSt14__convert_to_vIeEvPKcRT_RSt12
*** 1913,1920 ****
--- 2017,2029 ----
  FUNC:_ZSt14__convert_to_vIfEvPKcRT_RSt12_Ios_IostateRKP15__locale_struct@@GLIBCXX_3.4
  FUNC:_ZSt14set_unexpectedPFvvE@@GLIBCXX_3.4
  FUNC:_ZSt15set_new_handlerPFvvE@@GLIBCXX_3.4
+ FUNC:_ZSt16__ostream_insertIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_PKS3_l@@GLIBCXX_3.4.9
+ FUNC:_ZSt16__ostream_insertIwSt11char_traitsIwEERSt13basic_ostreamIT_T0_ES6_PKS3_l@@GLIBCXX_3.4.9
  FUNC:_ZSt16__throw_bad_castv@@GLIBCXX_3.4
+ FUNC:_ZSt17__copy_streambufsIcSt11char_traitsIcEElPSt15basic_streambufIT_T0_ES6_@@GLIBCXX_3.4.8
+ FUNC:_ZSt17__copy_streambufsIwSt11char_traitsIwEElPSt15basic_streambufIT_T0_ES6_@@GLIBCXX_3.4.8
  FUNC:_ZSt17__throw_bad_allocv@@GLIBCXX_3.4
+ FUNC:_ZSt17__verify_groupingPKcmRKSs@@GLIBCXX_3.4.10
  FUNC:_ZSt18_Rb_tree_decrementPKSt18_Rb_tree_node_base@@GLIBCXX_3.4
  FUNC:_ZSt18_Rb_tree_decrementPSt18_Rb_tree_node_base@@GLIBCXX_3.4
  FUNC:_ZSt18_Rb_tree_incrementPKSt18_Rb_tree_node_base@@GLIBCXX_3.4
*************** FUNC:_ZSt20__throw_domain_errorPKc@@GLIB
*** 1930,1935 ****
--- 2039,2046 ----
  FUNC:_ZSt20__throw_length_errorPKc@@GLIBCXX_3.4
  FUNC:_ZSt20__throw_out_of_rangePKc@@GLIBCXX_3.4
  FUNC:_ZSt21_Rb_tree_rotate_rightPSt18_Rb_tree_node_baseRS0_@@GLIBCXX_3.4
+ FUNC:_ZSt21__copy_streambufs_eofIcSt11char_traitsIcEElPSt15basic_streambufIT_T0_ES6_Rb@@GLIBCXX_3.4.9
+ FUNC:_ZSt21__copy_streambufs_eofIwSt11char_traitsIwEElPSt15basic_streambufIT_T0_ES6_Rb@@GLIBCXX_3.4.9
  FUNC:_ZSt21__throw_bad_exceptionv@@GLIBCXX_3.4
  FUNC:_ZSt21__throw_runtime_errorPKc@@GLIBCXX_3.4
  FUNC:_ZSt22__throw_overflow_errorPKc@@GLIBCXX_3.4
*************** FUNC:__dynamic_cast@@CXXABI_1.3
*** 2164,2175 ****
--- 2275,2292 ----
  FUNC:__gxx_personality_v0@@CXXABI_1.3
  OBJECT:0:CXXABI_1.3
  OBJECT:0:CXXABI_1.3.1
+ OBJECT:0:CXXABI_1.3.2
  OBJECT:0:GLIBCXX_3.4
  OBJECT:0:GLIBCXX_3.4.1
+ OBJECT:0:GLIBCXX_3.4.10
  OBJECT:0:GLIBCXX_3.4.2
  OBJECT:0:GLIBCXX_3.4.3
  OBJECT:0:GLIBCXX_3.4.4
  OBJECT:0:GLIBCXX_3.4.5
+ OBJECT:0:GLIBCXX_3.4.6
+ OBJECT:0:GLIBCXX_3.4.7
+ OBJECT:0:GLIBCXX_3.4.8
+ OBJECT:0:GLIBCXX_3.4.9
  OBJECT:112:_ZNSt17__timepunct_cacheIcE12_S_timezonesE@@GLIBCXX_3.4
  OBJECT:112:_ZNSt17__timepunct_cacheIwE12_S_timezonesE@@GLIBCXX_3.4
  OBJECT:112:_ZTVN10__cxxabiv116__enum_type_infoE@@CXXABI_1.3
*************** OBJECT:168:_ZTVSt14basic_iostreamIwSt11c
*** 2238,2243 ****
--- 2355,2362 ----
  OBJECT:168:_ZTVSt18basic_stringstreamIcSt11char_traitsIcESaIcEE@@GLIBCXX_3.4
  OBJECT:168:_ZTVSt18basic_stringstreamIwSt11char_traitsIwESaIwEE@@GLIBCXX_3.4
  OBJECT:168:_ZTVSt9strstream@@GLIBCXX_3.4
+ OBJECT:16:_ZTIN10__cxxabiv115__forced_unwindE@@CXXABI_1.3.2
+ OBJECT:16:_ZTIN10__cxxabiv119__foreign_exceptionE@@CXXABI_1.3.2
  OBJECT:16:_ZTINSt6locale5facetE@@GLIBCXX_3.4
  OBJECT:16:_ZTISt10ctype_base@@GLIBCXX_3.4
  OBJECT:16:_ZTISt10money_base@@GLIBCXX_3.4
*************** OBJECT:240:_ZTVSt15basic_stringbufIwSt11
*** 2557,2562 ****
--- 2676,2683 ----
  OBJECT:240:_ZTVSt21__ctype_abstract_baseIcE@@GLIBCXX_3.4
  OBJECT:240:_ZTVSt21__ctype_abstract_baseIwE@@GLIBCXX_3.4
  OBJECT:240:_ZTVSt5ctypeIwE@@GLIBCXX_3.4
+ OBJECT:2440:_ZNSt3tr18__detail12__prime_listE@@GLIBCXX_3.4.10
+ OBJECT:2440:_ZNSt8__detail12__prime_listE@@GLIBCXX_3.4.10
  OBJECT:24:_ZTIN10__cxxabiv116__enum_type_infoE@@CXXABI_1.3
  OBJECT:24:_ZTIN10__cxxabiv117__array_type_infoE@@CXXABI_1.3
  OBJECT:24:_ZTIN10__cxxabiv117__class_type_infoE@@CXXABI_1.3
diff -Nrcpad gcc-4.3.0/libstdc++-v3/config/abi/post/mips-linux-gnu/baseline_symbols.txt gcc-4.3.1/libstdc++-v3/config/abi/post/mips-linux-gnu/baseline_symbols.txt
*** gcc-4.3.0/libstdc++-v3/config/abi/post/mips-linux-gnu/baseline_symbols.txt	Sun Dec 18 09:39:23 2005
--- gcc-4.3.1/libstdc++-v3/config/abi/post/mips-linux-gnu/baseline_symbols.txt	Sat Mar 29 09:10:14 2008
*************** FUNC:_ZN10__gnu_norm15_List_node_base4sw
*** 33,51 ****
--- 33,83 ----
  FUNC:_ZN10__gnu_norm15_List_node_base6unhookEv@@GLIBCXX_3.4
  FUNC:_ZN10__gnu_norm15_List_node_base7reverseEv@@GLIBCXX_3.4
  FUNC:_ZN10__gnu_norm15_List_node_base8transferEPS0_S1_@@GLIBCXX_3.4
+ FUNC:_ZN11__gnu_debug19_Safe_iterator_base12_M_get_mutexEv@@GLIBCXX_3.4.9
+ FUNC:_ZN11__gnu_debug19_Safe_iterator_base16_M_attach_singleEPNS_19_Safe_sequence_baseEb@@GLIBCXX_3.4.9
+ FUNC:_ZN11__gnu_debug19_Safe_iterator_base16_M_detach_singleEv@@GLIBCXX_3.4.9
  FUNC:_ZN11__gnu_debug19_Safe_iterator_base9_M_attachEPNS_19_Safe_sequence_baseEb@@GLIBCXX_3.4
  FUNC:_ZN11__gnu_debug19_Safe_iterator_base9_M_detachEv@@GLIBCXX_3.4
+ FUNC:_ZN11__gnu_debug19_Safe_sequence_base12_M_get_mutexEv@@GLIBCXX_3.4.9
  FUNC:_ZN11__gnu_debug19_Safe_sequence_base13_M_detach_allEv@@GLIBCXX_3.4
  FUNC:_ZN11__gnu_debug19_Safe_sequence_base18_M_detach_singularEv@@GLIBCXX_3.4
  FUNC:_ZN11__gnu_debug19_Safe_sequence_base22_M_revalidate_singularEv@@GLIBCXX_3.4
  FUNC:_ZN11__gnu_debug19_Safe_sequence_base7_M_swapERS0_@@GLIBCXX_3.4
+ FUNC:_ZN14__gnu_parallel9_Settings3getEv@@GLIBCXX_3.4.10
+ FUNC:_ZN14__gnu_parallel9_Settings3setERS0_@@GLIBCXX_3.4.10
  FUNC:_ZN9__gnu_cxx12__atomic_addEPVii@@GLIBCXX_3.4
  FUNC:_ZN9__gnu_cxx17__pool_alloc_base12_M_get_mutexEv@@GLIBCXX_3.4.2
  FUNC:_ZN9__gnu_cxx17__pool_alloc_base16_M_get_free_listEj@@GLIBCXX_3.4.2
  FUNC:_ZN9__gnu_cxx17__pool_alloc_base9_M_refillEj@@GLIBCXX_3.4.2
  FUNC:_ZN9__gnu_cxx18__exchange_and_addEPVii@@GLIBCXX_3.4
  FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE4fileEv@@GLIBCXX_3.4.2
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE4syncEv@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE5uflowEv@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE6xsgetnEPci@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE6xsputnEPKci@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE7seekoffExSt12_Ios_SeekdirSt13_Ios_Openmode@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE7seekposESt4fposI11__mbstate_tESt13_Ios_Openmode@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE8overflowEi@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE9pbackfailEi@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE9underflowEv@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEEC1EP8_IO_FILE@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEEC2EP8_IO_FILE@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEED0Ev@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEED1Ev@@GLIBCXX_3.4.10
  FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE4fileEv@@GLIBCXX_3.4.2
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE4syncEv@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE5uflowEv@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE6xsgetnEPwi@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE6xsputnEPKwi@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE7seekoffExSt12_Ios_SeekdirSt13_Ios_Openmode@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE7seekposESt4fposI11__mbstate_tESt13_Ios_Openmode@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE8overflowEj@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE9pbackfailEj@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE9underflowEv@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEEC1EP8_IO_FILE@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEEC2EP8_IO_FILE@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEED0Ev@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEED1Ev@@GLIBCXX_3.4.10
  FUNC:_ZN9__gnu_cxx27__verbose_terminate_handlerEv@@CXXABI_1.3
  FUNC:_ZN9__gnu_cxx6__poolILb0EE10_M_destroyEv@@GLIBCXX_3.4.4
  FUNC:_ZN9__gnu_cxx6__poolILb0EE13_M_initializeEv@@GLIBCXX_3.4.4
*************** FUNC:_ZN9__gnu_cxx6__poolILb0EE16_M_recl
*** 53,58 ****
--- 85,91 ----
  FUNC:_ZN9__gnu_cxx6__poolILb0EE16_M_reserve_blockEjj@@GLIBCXX_3.4.4
  FUNC:_ZN9__gnu_cxx6__poolILb1EE10_M_destroyEv@@GLIBCXX_3.4.4
  FUNC:_ZN9__gnu_cxx6__poolILb1EE13_M_initializeEPFvPvE@@GLIBCXX_3.4.4
+ FUNC:_ZN9__gnu_cxx6__poolILb1EE13_M_initializeEv@@GLIBCXX_3.4.6
  FUNC:_ZN9__gnu_cxx6__poolILb1EE16_M_get_thread_idEv@@GLIBCXX_3.4.4
  FUNC:_ZN9__gnu_cxx6__poolILb1EE16_M_reclaim_blockEPcj@@GLIBCXX_3.4.4
  FUNC:_ZN9__gnu_cxx6__poolILb1EE16_M_reserve_blockEjj@@GLIBCXX_3.4.4
*************** FUNC:_ZNK11__gnu_debug16_Error_formatter
*** 81,86 ****
--- 114,120 ----
  FUNC:_ZNK11__gnu_debug16_Error_formatter10_Parameter20_M_print_descriptionEPKS0_@@GLIBCXX_3.4
  FUNC:_ZNK11__gnu_debug16_Error_formatter13_M_print_wordEPKc@@GLIBCXX_3.4
  FUNC:_ZNK11__gnu_debug16_Error_formatter15_M_print_stringEPKc@@GLIBCXX_3.4
+ FUNC:_ZNK11__gnu_debug16_Error_formatter17_M_get_max_lengthEv@@GLIBCXX_3.4.10
  FUNC:_ZNK11__gnu_debug16_Error_formatter8_M_errorEv@@GLIBCXX_3.4
  FUNC:_ZNK11__gnu_debug19_Safe_iterator_base11_M_singularEv@@GLIBCXX_3.4
  FUNC:_ZNK11__gnu_debug19_Safe_iterator_base14_M_can_compareERKS0_@@GLIBCXX_3.4
*************** FUNC:_ZNKSs8capacityEv@@GLIBCXX_3.4
*** 203,208 ****
--- 237,243 ----
  FUNC:_ZNKSs8max_sizeEv@@GLIBCXX_3.4
  FUNC:_ZNKSs9_M_ibeginEv@@GLIBCXX_3.4
  FUNC:_ZNKSsixEj@@GLIBCXX_3.4
+ FUNC:_ZNKSt10bad_typeid4whatEv@@GLIBCXX_3.4.9
  FUNC:_ZNKSt10istrstream5rdbufEv@@GLIBCXX_3.4
  FUNC:_ZNKSt10moneypunctIcLb0EE10neg_formatEv@@GLIBCXX_3.4
  FUNC:_ZNKSt10moneypunctIcLb0EE10pos_formatEv@@GLIBCXX_3.4
*************** FUNC:_ZNKSt11__timepunctIwE9_M_monthsEPP
*** 301,306 ****
--- 336,342 ----
  FUNC:_ZNKSt11logic_error4whatEv@@GLIBCXX_3.4
  FUNC:_ZNKSt12__basic_fileIcE7is_openEv@@GLIBCXX_3.4
  FUNC:_ZNKSt12strstreambuf6pcountEv@@GLIBCXX_3.4
+ FUNC:_ZNKSt13bad_exception4whatEv@@GLIBCXX_3.4.9
  FUNC:_ZNKSt13basic_filebufIcSt11char_traitsIcEE7is_openEv@@GLIBCXX_3.4
  FUNC:_ZNKSt13basic_filebufIwSt11char_traitsIwEE7is_openEv@@GLIBCXX_3.4
  FUNC:_ZNKSt13basic_fstreamIcSt11char_traitsIcEE5rdbufEv@@GLIBCXX_3.4
*************** FUNC:_ZNKSt19basic_ostringstreamIcSt11ch
*** 353,358 ****
--- 389,404 ----
  FUNC:_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE5rdbufEv@@GLIBCXX_3.4
  FUNC:_ZNKSt19basic_ostringstreamIwSt11char_traitsIwESaIwEE3strEv@@GLIBCXX_3.4
  FUNC:_ZNKSt19basic_ostringstreamIwSt11char_traitsIwESaIwEE5rdbufEv@@GLIBCXX_3.4
+ FUNC:_ZNKSt3tr14hashIRKSbIwSt11char_traitsIwESaIwEEEclES6_@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt3tr14hashIRKSsEclES2_@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt3tr14hashISbIwSt11char_traitsIwESaIwEEEclES4_@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt3tr14hashISsEclESs@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt3tr14hashIeEclEe@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt4hashIRKSbIwSt11char_traitsIwESaIwEEEclES5_@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt4hashIRKSsEclES1_@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt4hashISbIwSt11char_traitsIwESaIwEEEclES3_@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt4hashISsEclESs@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt4hashIeEclEe@@GLIBCXX_3.4.10
  FUNC:_ZNKSt5ctypeIcE10do_tolowerEPcPKc@@GLIBCXX_3.4
  FUNC:_ZNKSt5ctypeIcE10do_tolowerEc@@GLIBCXX_3.4
  FUNC:_ZNKSt5ctypeIcE10do_toupperEPcPKc@@GLIBCXX_3.4
*************** FUNC:_ZNKSt7num_putIwSt19ostreambuf_iter
*** 515,520 ****
--- 561,567 ----
  FUNC:_ZNKSt7num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES3_RSt8ios_basewm@@GLIBCXX_3.4
  FUNC:_ZNKSt7num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES3_RSt8ios_basewx@@GLIBCXX_3.4
  FUNC:_ZNKSt7num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES3_RSt8ios_basewy@@GLIBCXX_3.4
+ FUNC:_ZNKSt8bad_cast4whatEv@@GLIBCXX_3.4.9
  FUNC:_ZNKSt8ios_base7failure4whatEv@@GLIBCXX_3.4
  FUNC:_ZNKSt8messagesIcE18_M_convert_to_charERKSs@@GLIBCXX_3.4
  FUNC:_ZNKSt8messagesIcE20_M_convert_from_charEPc@@GLIBCXX_3.4
*************** FUNC:_ZNKSt8time_putIwSt19ostreambuf_ite
*** 591,596 ****
--- 638,644 ----
  FUNC:_ZNKSt8time_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE3putES3_RSt8ios_basewPK2tmcc@@GLIBCXX_3.4
  FUNC:_ZNKSt8time_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES3_RSt8ios_basewPK2tmcc@@GLIBCXX_3.4
  FUNC:_ZNKSt8valarrayIjE4sizeEv@@GLIBCXX_3.4
+ FUNC:_ZNKSt9bad_alloc4whatEv@@GLIBCXX_3.4.9
  FUNC:_ZNKSt9basic_iosIcSt11char_traitsIcEE10exceptionsEv@@GLIBCXX_3.4
  FUNC:_ZNKSt9basic_iosIcSt11char_traitsIcEE3badEv@@GLIBCXX_3.4
  FUNC:_ZNKSt9basic_iosIcSt11char_traitsIcEE3eofEv@@GLIBCXX_3.4
*************** FUNC:_ZNSdC2Ev@@GLIBCXX_3.4
*** 774,779 ****
--- 822,838 ----
  FUNC:_ZNSdD0Ev@@GLIBCXX_3.4
  FUNC:_ZNSdD1Ev@@GLIBCXX_3.4
  FUNC:_ZNSdD2Ev@@GLIBCXX_3.4
+ FUNC:_ZNSi10_M_extractIPvEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIbEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIdEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIeEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIfEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIjEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIlEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractImEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractItEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIxEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIyEERSiRT_@@GLIBCXX_3.4.9
  FUNC:_ZNSi3getEPci@@GLIBCXX_3.4
  FUNC:_ZNSi3getEPcic@@GLIBCXX_3.4
  FUNC:_ZNSi3getERSt15basic_streambufIcSt11char_traitsIcEE@@GLIBCXX_3.4
*************** FUNC:_ZNSo6sentryC2ERSo@@GLIBCXX_3.4
*** 833,838 ****
--- 892,905 ----
  FUNC:_ZNSo6sentryD1Ev@@GLIBCXX_3.4
  FUNC:_ZNSo6sentryD2Ev@@GLIBCXX_3.4
  FUNC:_ZNSo8_M_writeEPKci@@GLIBCXX_3.4
+ FUNC:_ZNSo9_M_insertIPKvEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertIbEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertIdEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertIeEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertIlEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertImEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertIxEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertIyEERSoT_@@GLIBCXX_3.4.9
  FUNC:_ZNSoC1EPSt15basic_streambufIcSt11char_traitsIcEE@@GLIBCXX_3.4
  FUNC:_ZNSoC1Ev@@GLIBCXX_3.4
  FUNC:_ZNSoC2EPSt15basic_streambufIcSt11char_traitsIcEE@@GLIBCXX_3.4
*************** FUNC:_ZNSt13basic_fstreamIwSt11char_trai
*** 1206,1211 ****
--- 1273,1289 ----
  FUNC:_ZNSt13basic_fstreamIwSt11char_traitsIwEED0Ev@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_fstreamIwSt11char_traitsIwEED1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_fstreamIwSt11char_traitsIwEED2Ev@@GLIBCXX_3.4
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIPvEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIbEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIdEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIeEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIfEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIjEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIlEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractImEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractItEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIxEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIyEERS2_RT_@@GLIBCXX_3.4.9
  FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE3getEPwi@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE3getEPwiw@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE3getERSt15basic_streambufIwS1_E@@GLIBCXX_3.4
*************** FUNC:_ZNSt13basic_ostreamIwSt11char_trai
*** 1265,1270 ****
--- 1343,1356 ----
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE6sentryD1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE6sentryD2Ev@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE8_M_writeEPKwi@@GLIBCXX_3.4
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIPKvEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIbEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIdEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIeEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIlEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertImEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIxEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIyEERS2_T_@@GLIBCXX_3.4.9
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEEC1EPSt15basic_streambufIwS1_E@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEEC1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEEC2EPSt15basic_streambufIwS1_E@@GLIBCXX_3.4
*************** FUNC:_ZNSt15basic_streambufIcSt11char_tr
*** 1386,1391 ****
--- 1472,1478 ----
  FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE6sbumpcEv@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE6setbufEPci@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE6snextcEv@@GLIBCXX_3.4
+ FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE6stosscEv@@GLIBCXX_3.4.10
  FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE6xsgetnEPci@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE6xsputnEPKci@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE7pubsyncEv@@GLIBCXX_3.4
*************** FUNC:_ZNSt15basic_streambufIwSt11char_tr
*** 1424,1429 ****
--- 1511,1517 ----
  FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE6sbumpcEv@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE6setbufEPwi@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE6snextcEv@@GLIBCXX_3.4
+ FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE6stosscEv@@GLIBCXX_3.4.10
  FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE6xsgetnEPwi@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE6xsputnEPKwi@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE7pubsyncEv@@GLIBCXX_3.4
*************** FUNC:_ZNSt15basic_stringbufIcSt11char_tr
*** 1455,1460 ****
--- 1543,1549 ----
  FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEE7seekposESt4fposI11__mbstate_tESt13_Ios_Openmode@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEE8overflowEi@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEE9pbackfailEi@@GLIBCXX_3.4
+ FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEE9showmanycEv@@GLIBCXX_3.4.6
  FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEE9underflowEv@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ERKSsSt13_Ios_Openmode@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode@@GLIBCXX_3.4
*************** FUNC:_ZNSt15basic_stringbufIwSt11char_tr
*** 1471,1476 ****
--- 1560,1566 ----
  FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEE7seekposESt4fposI11__mbstate_tESt13_Ios_Openmode@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEE8overflowEj@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEE9pbackfailEj@@GLIBCXX_3.4
+ FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEE9showmanycEv@@GLIBCXX_3.4.6
  FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEE9underflowEv@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEEC1ERKSbIwS1_S2_ESt13_Ios_Openmode@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEEC1ESt13_Ios_Openmode@@GLIBCXX_3.4
*************** FUNC:_ZNSt5ctypeIwEC2Ej@@GLIBCXX_3.4
*** 1660,1669 ****
--- 1750,1765 ----
  FUNC:_ZNSt5ctypeIwED0Ev@@GLIBCXX_3.4
  FUNC:_ZNSt5ctypeIwED1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt5ctypeIwED2Ev@@GLIBCXX_3.4
+ FUNC:_ZNSt6__norm15_List_node_base4hookEPS0_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt6__norm15_List_node_base4swapERS0_S1_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt6__norm15_List_node_base6unhookEv@@GLIBCXX_3.4.9
+ FUNC:_ZNSt6__norm15_List_node_base7reverseEv@@GLIBCXX_3.4.9
+ FUNC:_ZNSt6__norm15_List_node_base8transferEPS0_S1_@@GLIBCXX_3.4.9
  FUNC:_ZNSt6gslice8_IndexerC1EjRKSt8valarrayIjES4_@@GLIBCXX_3.4
  FUNC:_ZNSt6gslice8_IndexerC2EjRKSt8valarrayIjES4_@@GLIBCXX_3.4
  FUNC:_ZNSt6locale11_M_coalesceERKS_S1_i@@GLIBCXX_3.4
  FUNC:_ZNSt6locale21_S_normalize_categoryEi@@GLIBCXX_3.4
+ FUNC:_ZNSt6locale5_Impl16_M_install_cacheEPKNS_5facetEj@@GLIBCXX_3.4.7
  FUNC:_ZNSt6locale5_Impl16_M_install_facetEPKNS_2idEPKNS_5facetE@@GLIBCXX_3.4
  FUNC:_ZNSt6locale5_Impl16_M_replace_facetEPKS0_PKNS_2idE@@GLIBCXX_3.4
  FUNC:_ZNSt6locale5_Impl19_M_replace_categoryEPKS0_PKPKNS_2idE@@GLIBCXX_3.4
*************** FUNC:_ZNSt6locale5_ImplC2ERKS0_j@@GLIBCX
*** 1676,1681 ****
--- 1772,1778 ----
  FUNC:_ZNSt6locale5_ImplC2Ej@@GLIBCXX_3.4
  FUNC:_ZNSt6locale5_ImplD1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt6locale5_ImplD2Ev@@GLIBCXX_3.4
+ FUNC:_ZNSt6locale5facet13_S_get_c_nameEv@@GLIBCXX_3.4.6
  FUNC:_ZNSt6locale5facet15_S_get_c_localeEv@@GLIBCXX_3.4
  FUNC:_ZNSt6locale5facet17_S_clone_c_localeERP15__locale_struct@@GLIBCXX_3.4
  FUNC:_ZNSt6locale5facet18_S_create_c_localeERP15__locale_structPKcS2_@@GLIBCXX_3.4
*************** FUNC:_ZNSt8bad_castD1Ev@@GLIBCXX_3.4
*** 1753,1759 ****
--- 1850,1858 ----
  FUNC:_ZNSt8bad_castD2Ev@@GLIBCXX_3.4
  FUNC:_ZNSt8ios_base13_M_grow_wordsEib@@GLIBCXX_3.4
  FUNC:_ZNSt8ios_base15sync_with_stdioEb@@GLIBCXX_3.4
+ FUNC:_ZNSt8ios_base17_M_call_callbacksENS_5eventE@@GLIBCXX_3.4.6
  FUNC:_ZNSt8ios_base17register_callbackEPFvNS_5eventERS_iEi@@GLIBCXX_3.4
+ FUNC:_ZNSt8ios_base20_M_dispose_callbacksEv@@GLIBCXX_3.4.6
  FUNC:_ZNSt8ios_base4InitC1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt8ios_base4InitC2Ev@@GLIBCXX_3.4
  FUNC:_ZNSt8ios_base4InitD1Ev@@GLIBCXX_3.4
*************** FUNC:_ZNSt8valarrayIjEC2Ej@@GLIBCXX_3.4
*** 1832,1837 ****
--- 1931,1941 ----
  FUNC:_ZNSt8valarrayIjED1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt8valarrayIjED2Ev@@GLIBCXX_3.4
  FUNC:_ZNSt8valarrayIjEixEj@@GLIBCXX_3.4
+ FUNC:_ZNSt9__cxx199815_List_node_base4hookEPS0_@@GLIBCXX_3.4.10
+ FUNC:_ZNSt9__cxx199815_List_node_base4swapERS0_S1_@@GLIBCXX_3.4.10
+ FUNC:_ZNSt9__cxx199815_List_node_base6unhookEv@@GLIBCXX_3.4.10
+ FUNC:_ZNSt9__cxx199815_List_node_base7reverseEv@@GLIBCXX_3.4.10
+ FUNC:_ZNSt9__cxx199815_List_node_base8transferEPS0_S1_@@GLIBCXX_3.4.10
  FUNC:_ZNSt9bad_allocD0Ev@@GLIBCXX_3.4
  FUNC:_ZNSt9bad_allocD1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt9bad_allocD2Ev@@GLIBCXX_3.4
*************** FUNC:_ZSt14__convert_to_vIeEvPKcRT_RSt12
*** 1913,1920 ****
--- 2017,2029 ----
  FUNC:_ZSt14__convert_to_vIfEvPKcRT_RSt12_Ios_IostateRKP15__locale_struct@@GLIBCXX_3.4
  FUNC:_ZSt14set_unexpectedPFvvE@@GLIBCXX_3.4
  FUNC:_ZSt15set_new_handlerPFvvE@@GLIBCXX_3.4
+ FUNC:_ZSt16__ostream_insertIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_PKS3_i@@GLIBCXX_3.4.9
+ FUNC:_ZSt16__ostream_insertIwSt11char_traitsIwEERSt13basic_ostreamIT_T0_ES6_PKS3_i@@GLIBCXX_3.4.9
  FUNC:_ZSt16__throw_bad_castv@@GLIBCXX_3.4
+ FUNC:_ZSt17__copy_streambufsIcSt11char_traitsIcEEiPSt15basic_streambufIT_T0_ES6_@@GLIBCXX_3.4.6
+ FUNC:_ZSt17__copy_streambufsIwSt11char_traitsIwEEiPSt15basic_streambufIT_T0_ES6_@@GLIBCXX_3.4.6
  FUNC:_ZSt17__throw_bad_allocv@@GLIBCXX_3.4
+ FUNC:_ZSt17__verify_groupingPKcjRKSs@@GLIBCXX_3.4.10
  FUNC:_ZSt18_Rb_tree_decrementPKSt18_Rb_tree_node_base@@GLIBCXX_3.4
  FUNC:_ZSt18_Rb_tree_decrementPSt18_Rb_tree_node_base@@GLIBCXX_3.4
  FUNC:_ZSt18_Rb_tree_incrementPKSt18_Rb_tree_node_base@@GLIBCXX_3.4
*************** FUNC:_ZSt20__throw_domain_errorPKc@@GLIB
*** 1930,1935 ****
--- 2039,2046 ----
  FUNC:_ZSt20__throw_length_errorPKc@@GLIBCXX_3.4
  FUNC:_ZSt20__throw_out_of_rangePKc@@GLIBCXX_3.4
  FUNC:_ZSt21_Rb_tree_rotate_rightPSt18_Rb_tree_node_baseRS0_@@GLIBCXX_3.4
+ FUNC:_ZSt21__copy_streambufs_eofIcSt11char_traitsIcEEiPSt15basic_streambufIT_T0_ES6_Rb@@GLIBCXX_3.4.9
+ FUNC:_ZSt21__copy_streambufs_eofIwSt11char_traitsIwEEiPSt15basic_streambufIT_T0_ES6_Rb@@GLIBCXX_3.4.9
  FUNC:_ZSt21__throw_bad_exceptionv@@GLIBCXX_3.4
  FUNC:_ZSt21__throw_runtime_errorPKc@@GLIBCXX_3.4
  FUNC:_ZSt22__throw_overflow_errorPKc@@GLIBCXX_3.4
*************** FUNC:tanhl@@GLIBCXX_3.4
*** 2186,2197 ****
--- 2297,2316 ----
  FUNC:tanl@@GLIBCXX_3.4
  OBJECT:0:CXXABI_1.3
  OBJECT:0:CXXABI_1.3.1
+ OBJECT:0:CXXABI_1.3.2
  OBJECT:0:GLIBCXX_3.4
  OBJECT:0:GLIBCXX_3.4.1
+ OBJECT:0:GLIBCXX_3.4.10
  OBJECT:0:GLIBCXX_3.4.2
  OBJECT:0:GLIBCXX_3.4.3
  OBJECT:0:GLIBCXX_3.4.4
  OBJECT:0:GLIBCXX_3.4.5
+ OBJECT:0:GLIBCXX_3.4.6
+ OBJECT:0:GLIBCXX_3.4.7
+ OBJECT:0:GLIBCXX_3.4.8
+ OBJECT:0:GLIBCXX_3.4.9
+ OBJECT:1028:_ZNSt3tr18__detail12__prime_listE@@GLIBCXX_3.4.10
+ OBJECT:1028:_ZNSt8__detail12__prime_listE@@GLIBCXX_3.4.10
  OBJECT:12:_ZTIN10__cxxabiv116__enum_type_infoE@@CXXABI_1.3
  OBJECT:12:_ZTIN10__cxxabiv117__array_type_infoE@@CXXABI_1.3
  OBJECT:12:_ZTIN10__cxxabiv117__class_type_infoE@@CXXABI_1.3
*************** OBJECT:8:_ZGVNSt9money_getIcSt19istreamb
*** 3135,3140 ****
--- 3254,3261 ----
  OBJECT:8:_ZGVNSt9money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE2idE@@GLIBCXX_3.4
  OBJECT:8:_ZGVNSt9money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE2idE@@GLIBCXX_3.4
  OBJECT:8:_ZGVNSt9money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE2idE@@GLIBCXX_3.4
+ OBJECT:8:_ZTIN10__cxxabiv115__forced_unwindE@@CXXABI_1.3.2
+ OBJECT:8:_ZTIN10__cxxabiv119__foreign_exceptionE@@CXXABI_1.3.2
  OBJECT:8:_ZTINSt6locale5facetE@@GLIBCXX_3.4
  OBJECT:8:_ZTISt10ctype_base@@GLIBCXX_3.4
  OBJECT:8:_ZTISt10money_base@@GLIBCXX_3.4
diff -Nrcpad gcc-4.3.0/libstdc++-v3/config/abi/post/s390-linux-gnu/baseline_symbols.txt gcc-4.3.1/libstdc++-v3/config/abi/post/s390-linux-gnu/baseline_symbols.txt
*** gcc-4.3.0/libstdc++-v3/config/abi/post/s390-linux-gnu/baseline_symbols.txt	Sun Dec 18 09:39:23 2005
--- gcc-4.3.1/libstdc++-v3/config/abi/post/s390-linux-gnu/baseline_symbols.txt	Sat Mar 29 09:10:14 2008
*************** FUNC:_ZN10__gnu_norm15_List_node_base4sw
*** 33,51 ****
--- 33,83 ----
  FUNC:_ZN10__gnu_norm15_List_node_base6unhookEv@@GLIBCXX_3.4
  FUNC:_ZN10__gnu_norm15_List_node_base7reverseEv@@GLIBCXX_3.4
  FUNC:_ZN10__gnu_norm15_List_node_base8transferEPS0_S1_@@GLIBCXX_3.4
+ FUNC:_ZN11__gnu_debug19_Safe_iterator_base12_M_get_mutexEv@@GLIBCXX_3.4.9
+ FUNC:_ZN11__gnu_debug19_Safe_iterator_base16_M_attach_singleEPNS_19_Safe_sequence_baseEb@@GLIBCXX_3.4.9
+ FUNC:_ZN11__gnu_debug19_Safe_iterator_base16_M_detach_singleEv@@GLIBCXX_3.4.9
  FUNC:_ZN11__gnu_debug19_Safe_iterator_base9_M_attachEPNS_19_Safe_sequence_baseEb@@GLIBCXX_3.4
  FUNC:_ZN11__gnu_debug19_Safe_iterator_base9_M_detachEv@@GLIBCXX_3.4
+ FUNC:_ZN11__gnu_debug19_Safe_sequence_base12_M_get_mutexEv@@GLIBCXX_3.4.9
  FUNC:_ZN11__gnu_debug19_Safe_sequence_base13_M_detach_allEv@@GLIBCXX_3.4
  FUNC:_ZN11__gnu_debug19_Safe_sequence_base18_M_detach_singularEv@@GLIBCXX_3.4
  FUNC:_ZN11__gnu_debug19_Safe_sequence_base22_M_revalidate_singularEv@@GLIBCXX_3.4
  FUNC:_ZN11__gnu_debug19_Safe_sequence_base7_M_swapERS0_@@GLIBCXX_3.4
+ FUNC:_ZN14__gnu_parallel9_Settings3getEv@@GLIBCXX_3.4.10
+ FUNC:_ZN14__gnu_parallel9_Settings3setERS0_@@GLIBCXX_3.4.10
  FUNC:_ZN9__gnu_cxx12__atomic_addEPVii@@GLIBCXX_3.4
  FUNC:_ZN9__gnu_cxx17__pool_alloc_base12_M_get_mutexEv@@GLIBCXX_3.4.2
  FUNC:_ZN9__gnu_cxx17__pool_alloc_base16_M_get_free_listEm@@GLIBCXX_3.4.2
  FUNC:_ZN9__gnu_cxx17__pool_alloc_base9_M_refillEm@@GLIBCXX_3.4.2
  FUNC:_ZN9__gnu_cxx18__exchange_and_addEPVii@@GLIBCXX_3.4
  FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE4fileEv@@GLIBCXX_3.4.2
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE4syncEv@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE5uflowEv@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE6xsgetnEPci@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE6xsputnEPKci@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE7seekoffExSt12_Ios_SeekdirSt13_Ios_Openmode@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE7seekposESt4fposI11__mbstate_tESt13_Ios_Openmode@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE8overflowEi@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE9pbackfailEi@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE9underflowEv@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEEC1EP8_IO_FILE@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEEC2EP8_IO_FILE@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEED0Ev@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEED1Ev@@GLIBCXX_3.4.10
  FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE4fileEv@@GLIBCXX_3.4.2
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE4syncEv@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE5uflowEv@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE6xsgetnEPwi@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE6xsputnEPKwi@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE7seekoffExSt12_Ios_SeekdirSt13_Ios_Openmode@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE7seekposESt4fposI11__mbstate_tESt13_Ios_Openmode@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE8overflowEj@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE9pbackfailEj@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE9underflowEv@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEEC1EP8_IO_FILE@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEEC2EP8_IO_FILE@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEED0Ev@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEED1Ev@@GLIBCXX_3.4.10
  FUNC:_ZN9__gnu_cxx27__verbose_terminate_handlerEv@@CXXABI_1.3
  FUNC:_ZN9__gnu_cxx6__poolILb0EE10_M_destroyEv@@GLIBCXX_3.4.4
  FUNC:_ZN9__gnu_cxx6__poolILb0EE13_M_initializeEv@@GLIBCXX_3.4.4
*************** FUNC:_ZN9__gnu_cxx6__poolILb0EE16_M_recl
*** 53,58 ****
--- 85,91 ----
  FUNC:_ZN9__gnu_cxx6__poolILb0EE16_M_reserve_blockEmm@@GLIBCXX_3.4.4
  FUNC:_ZN9__gnu_cxx6__poolILb1EE10_M_destroyEv@@GLIBCXX_3.4.4
  FUNC:_ZN9__gnu_cxx6__poolILb1EE13_M_initializeEPFvPvE@@GLIBCXX_3.4.4
+ FUNC:_ZN9__gnu_cxx6__poolILb1EE13_M_initializeEv@@GLIBCXX_3.4.6
  FUNC:_ZN9__gnu_cxx6__poolILb1EE16_M_get_thread_idEv@@GLIBCXX_3.4.4
  FUNC:_ZN9__gnu_cxx6__poolILb1EE16_M_reclaim_blockEPcm@@GLIBCXX_3.4.4
  FUNC:_ZN9__gnu_cxx6__poolILb1EE16_M_reserve_blockEmm@@GLIBCXX_3.4.4
*************** FUNC:_ZNK11__gnu_debug16_Error_formatter
*** 81,86 ****
--- 114,120 ----
  FUNC:_ZNK11__gnu_debug16_Error_formatter10_Parameter20_M_print_descriptionEPKS0_@@GLIBCXX_3.4
  FUNC:_ZNK11__gnu_debug16_Error_formatter13_M_print_wordEPKc@@GLIBCXX_3.4
  FUNC:_ZNK11__gnu_debug16_Error_formatter15_M_print_stringEPKc@@GLIBCXX_3.4
+ FUNC:_ZNK11__gnu_debug16_Error_formatter17_M_get_max_lengthEv@@GLIBCXX_3.4.10
  FUNC:_ZNK11__gnu_debug16_Error_formatter8_M_errorEv@@GLIBCXX_3.4
  FUNC:_ZNK11__gnu_debug19_Safe_iterator_base11_M_singularEv@@GLIBCXX_3.4
  FUNC:_ZNK11__gnu_debug19_Safe_iterator_base14_M_can_compareERKS0_@@GLIBCXX_3.4
*************** FUNC:_ZNKSs8capacityEv@@GLIBCXX_3.4
*** 203,208 ****
--- 237,243 ----
  FUNC:_ZNKSs8max_sizeEv@@GLIBCXX_3.4
  FUNC:_ZNKSs9_M_ibeginEv@@GLIBCXX_3.4
  FUNC:_ZNKSsixEm@@GLIBCXX_3.4
+ FUNC:_ZNKSt10bad_typeid4whatEv@@GLIBCXX_3.4.9
  FUNC:_ZNKSt10istrstream5rdbufEv@@GLIBCXX_3.4
  FUNC:_ZNKSt10moneypunctIcLb0EE10neg_formatEv@@GLIBCXX_3.4
  FUNC:_ZNKSt10moneypunctIcLb0EE10pos_formatEv@@GLIBCXX_3.4
*************** FUNC:_ZNKSt11__timepunctIwE9_M_monthsEPP
*** 301,306 ****
--- 336,342 ----
  FUNC:_ZNKSt11logic_error4whatEv@@GLIBCXX_3.4
  FUNC:_ZNKSt12__basic_fileIcE7is_openEv@@GLIBCXX_3.4
  FUNC:_ZNKSt12strstreambuf6pcountEv@@GLIBCXX_3.4
+ FUNC:_ZNKSt13bad_exception4whatEv@@GLIBCXX_3.4.9
  FUNC:_ZNKSt13basic_filebufIcSt11char_traitsIcEE7is_openEv@@GLIBCXX_3.4
  FUNC:_ZNKSt13basic_filebufIwSt11char_traitsIwEE7is_openEv@@GLIBCXX_3.4
  FUNC:_ZNKSt13basic_fstreamIcSt11char_traitsIcEE5rdbufEv@@GLIBCXX_3.4
*************** FUNC:_ZNKSt15basic_streambufIwSt11char_t
*** 341,346 ****
--- 377,522 ----
  FUNC:_ZNKSt15basic_streambufIwSt11char_traitsIwEE6getlocEv@@GLIBCXX_3.4
  FUNC:_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv@@GLIBCXX_3.4
  FUNC:_ZNKSt15basic_stringbufIwSt11char_traitsIwESaIwEE3strEv@@GLIBCXX_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE14_M_extract_intIjEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE14_M_extract_intIlEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE14_M_extract_intImEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE14_M_extract_intItEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE14_M_extract_intIxEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE14_M_extract_intIyEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE16_M_extract_floatES4_S4_RSt8ios_baseRSt12_Ios_IostateRSs@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRPv@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRb@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRf@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRj@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRl@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRm@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRt@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRx@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRy@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRPv@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRb@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRf@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRj@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRl@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRm@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRt@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRx@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRy@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE8__do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE14_M_extract_intIjEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE14_M_extract_intIlEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE14_M_extract_intImEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE14_M_extract_intItEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE14_M_extract_intIxEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE14_M_extract_intIyEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE16_M_extract_floatES4_S4_RSt8ios_baseRSt12_Ios_IostateRSs@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRPv@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRb@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRf@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRj@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRl@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRm@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRt@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRx@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRy@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRPv@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRb@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRf@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRj@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRl@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRm@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRt@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRx@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRy@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE8__do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE12_M_group_intEPKcmcRSt8ios_basePcSA_Ri@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE13_M_insert_intIlEES4_S4_RSt8ios_basecT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE13_M_insert_intImEES4_S4_RSt8ios_basecT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE13_M_insert_intIxEES4_S4_RSt8ios_basecT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE13_M_insert_intIyEES4_S4_RSt8ios_basecT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE14_M_group_floatEPKcmcS7_PcS8_Ri@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE15_M_insert_floatIdEES4_S4_RSt8ios_baseccT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE15_M_insert_floatIgEES4_S4_RSt8ios_baseccT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE3putES4_RSt8ios_basecPKv@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE3putES4_RSt8ios_basecb@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE3putES4_RSt8ios_basecd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE3putES4_RSt8ios_basecg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE3putES4_RSt8ios_basecl@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE3putES4_RSt8ios_basecm@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE3putES4_RSt8ios_basecx@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE3putES4_RSt8ios_basecy@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE6_M_padEciRSt8ios_basePcPKcRi@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE6do_putES4_RSt8ios_basecPKv@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE6do_putES4_RSt8ios_basecb@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE6do_putES4_RSt8ios_basecd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE6do_putES4_RSt8ios_basecg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE6do_putES4_RSt8ios_basecl@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE6do_putES4_RSt8ios_basecm@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE6do_putES4_RSt8ios_basecx@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE6do_putES4_RSt8ios_basecy@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE8__do_putES4_RSt8ios_basecd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE12_M_group_intEPKcmwRSt8ios_basePwSA_Ri@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE13_M_insert_intIlEES4_S4_RSt8ios_basewT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE13_M_insert_intImEES4_S4_RSt8ios_basewT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE13_M_insert_intIxEES4_S4_RSt8ios_basewT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE13_M_insert_intIyEES4_S4_RSt8ios_basewT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE14_M_group_floatEPKcmwPKwPwSA_Ri@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE15_M_insert_floatIdEES4_S4_RSt8ios_basewcT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE15_M_insert_floatIgEES4_S4_RSt8ios_basewcT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE3putES4_RSt8ios_basewPKv@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE3putES4_RSt8ios_basewb@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE3putES4_RSt8ios_basewd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE3putES4_RSt8ios_basewg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE3putES4_RSt8ios_basewl@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE3putES4_RSt8ios_basewm@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE3putES4_RSt8ios_basewx@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE3putES4_RSt8ios_basewy@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6_M_padEwiRSt8ios_basePwPKwRi@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES4_RSt8ios_basewPKv@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES4_RSt8ios_basewb@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES4_RSt8ios_basewd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES4_RSt8ios_basewg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES4_RSt8ios_basewl@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES4_RSt8ios_basewm@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES4_RSt8ios_basewx@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES4_RSt8ios_basewy@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE8__do_putES4_RSt8ios_basewd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE10_M_extractILb0EEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRSs@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE10_M_extractILb1EEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRSs@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_bRSt8ios_baseRSt12_Ios_IostateRSs@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_bRSt8ios_baseRSt12_Ios_IostateRg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_bRSt8ios_baseRSt12_Ios_IostateRSs@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_bRSt8ios_baseRSt12_Ios_IostateRg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE8__do_getES4_S4_bRSt8ios_baseRSt12_Ios_IostateRd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE10_M_extractILb0EEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRSs@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE10_M_extractILb1EEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRSs@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_bRSt8ios_baseRSt12_Ios_IostateRSbIwS3_SaIwEE@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_bRSt8ios_baseRSt12_Ios_IostateRg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_bRSt8ios_baseRSt12_Ios_IostateRSbIwS3_SaIwEE@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_bRSt8ios_baseRSt12_Ios_IostateRg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE8__do_getES4_S4_bRSt8ios_baseRSt12_Ios_IostateRd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE3putES4_bRSt8ios_basecRKSs@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE3putES4_bRSt8ios_basecg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE6do_putES4_bRSt8ios_basecRKSs@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE6do_putES4_bRSt8ios_basecg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE8__do_putES4_bRSt8ios_basecd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE9_M_insertILb0EEES4_S4_RSt8ios_basecRKSs@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE9_M_insertILb1EEES4_S4_RSt8ios_basecRKSs@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE3putES4_bRSt8ios_basewRKSbIwS3_SaIwEE@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE3putES4_bRSt8ios_basewg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES4_bRSt8ios_basewRKSbIwS3_SaIwEE@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES4_bRSt8ios_basewg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE8__do_putES4_bRSt8ios_basewd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE9_M_insertILb0EEES4_S4_RSt8ios_basewRKSbIwS3_SaIwEE@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE9_M_insertILb1EEES4_S4_RSt8ios_basewRKSbIwS3_SaIwEE@@GLIBCXX_LDBL_3.4
  FUNC:_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv@@GLIBCXX_3.4
  FUNC:_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE5rdbufEv@@GLIBCXX_3.4
  FUNC:_ZNKSt18basic_stringstreamIwSt11char_traitsIwESaIwEE3strEv@@GLIBCXX_3.4
*************** FUNC:_ZNKSt19basic_ostringstreamIcSt11ch
*** 353,358 ****
--- 529,546 ----
  FUNC:_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE5rdbufEv@@GLIBCXX_3.4
  FUNC:_ZNKSt19basic_ostringstreamIwSt11char_traitsIwESaIwEE3strEv@@GLIBCXX_3.4
  FUNC:_ZNKSt19basic_ostringstreamIwSt11char_traitsIwESaIwEE5rdbufEv@@GLIBCXX_3.4
+ FUNC:_ZNKSt3tr14hashIRKSbIwSt11char_traitsIwESaIwEEEclES6_@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt3tr14hashIRKSsEclES2_@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt3tr14hashISbIwSt11char_traitsIwESaIwEEEclES4_@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt3tr14hashISsEclESs@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt3tr14hashIeEclEe@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt3tr14hashIgEclEg@@GLIBCXX_LDBL_3.4.10
+ FUNC:_ZNKSt4hashIRKSbIwSt11char_traitsIwESaIwEEEclES5_@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt4hashIRKSsEclES1_@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt4hashISbIwSt11char_traitsIwESaIwEEEclES3_@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt4hashISsEclESs@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt4hashIeEclEe@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt4hashIgEclEg@@GLIBCXX_LDBL_3.4.10
  FUNC:_ZNKSt5ctypeIcE10do_tolowerEPcPKc@@GLIBCXX_3.4
  FUNC:_ZNKSt5ctypeIcE10do_tolowerEc@@GLIBCXX_3.4
  FUNC:_ZNKSt5ctypeIcE10do_toupperEPcPKc@@GLIBCXX_3.4
*************** FUNC:_ZNKSt7num_putIwSt19ostreambuf_iter
*** 515,520 ****
--- 703,709 ----
  FUNC:_ZNKSt7num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES3_RSt8ios_basewm@@GLIBCXX_3.4
  FUNC:_ZNKSt7num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES3_RSt8ios_basewx@@GLIBCXX_3.4
  FUNC:_ZNKSt7num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES3_RSt8ios_basewy@@GLIBCXX_3.4
+ FUNC:_ZNKSt8bad_cast4whatEv@@GLIBCXX_3.4.9
  FUNC:_ZNKSt8ios_base7failure4whatEv@@GLIBCXX_3.4
  FUNC:_ZNKSt8messagesIcE18_M_convert_to_charERKSs@@GLIBCXX_3.4
  FUNC:_ZNKSt8messagesIcE20_M_convert_from_charEPc@@GLIBCXX_3.4
*************** FUNC:_ZNKSt8time_putIwSt19ostreambuf_ite
*** 591,596 ****
--- 780,786 ----
  FUNC:_ZNKSt8time_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE3putES3_RSt8ios_basewPK2tmcc@@GLIBCXX_3.4
  FUNC:_ZNKSt8time_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES3_RSt8ios_basewPK2tmcc@@GLIBCXX_3.4
  FUNC:_ZNKSt8valarrayImE4sizeEv@@GLIBCXX_3.4
+ FUNC:_ZNKSt9bad_alloc4whatEv@@GLIBCXX_3.4.9
  FUNC:_ZNKSt9basic_iosIcSt11char_traitsIcEE10exceptionsEv@@GLIBCXX_3.4
  FUNC:_ZNKSt9basic_iosIcSt11char_traitsIcEE3badEv@@GLIBCXX_3.4
  FUNC:_ZNKSt9basic_iosIcSt11char_traitsIcEE3eofEv@@GLIBCXX_3.4
*************** FUNC:_ZNSdC2Ev@@GLIBCXX_3.4
*** 774,779 ****
--- 964,981 ----
  FUNC:_ZNSdD0Ev@@GLIBCXX_3.4
  FUNC:_ZNSdD1Ev@@GLIBCXX_3.4
  FUNC:_ZNSdD2Ev@@GLIBCXX_3.4
+ FUNC:_ZNSi10_M_extractIPvEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIbEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIdEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIeEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIfEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIgEERSiRT_@@GLIBCXX_LDBL_3.4.7
+ FUNC:_ZNSi10_M_extractIjEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIlEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractImEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractItEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIxEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIyEERSiRT_@@GLIBCXX_3.4.9
  FUNC:_ZNSi3getEPci@@GLIBCXX_3.4
  FUNC:_ZNSi3getEPcic@@GLIBCXX_3.4
  FUNC:_ZNSi3getERSt15basic_streambufIcSt11char_traitsIcEE@@GLIBCXX_3.4
*************** FUNC:_ZNSirsERb@@GLIBCXX_3.4
*** 814,819 ****
--- 1016,1022 ----
  FUNC:_ZNSirsERd@@GLIBCXX_3.4
  FUNC:_ZNSirsERe@@GLIBCXX_3.4
  FUNC:_ZNSirsERf@@GLIBCXX_3.4
+ FUNC:_ZNSirsERg@@GLIBCXX_LDBL_3.4
  FUNC:_ZNSirsERi@@GLIBCXX_3.4
  FUNC:_ZNSirsERj@@GLIBCXX_3.4
  FUNC:_ZNSirsERl@@GLIBCXX_3.4
*************** FUNC:_ZNSo6sentryC2ERSo@@GLIBCXX_3.4
*** 833,838 ****
--- 1036,1050 ----
  FUNC:_ZNSo6sentryD1Ev@@GLIBCXX_3.4
  FUNC:_ZNSo6sentryD2Ev@@GLIBCXX_3.4
  FUNC:_ZNSo8_M_writeEPKci@@GLIBCXX_3.4
+ FUNC:_ZNSo9_M_insertIPKvEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertIbEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertIdEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertIeEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertIgEERSoT_@@GLIBCXX_LDBL_3.4.7
+ FUNC:_ZNSo9_M_insertIlEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertImEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertIxEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertIyEERSoT_@@GLIBCXX_3.4.9
  FUNC:_ZNSoC1EPSt15basic_streambufIcSt11char_traitsIcEE@@GLIBCXX_3.4
  FUNC:_ZNSoC1Ev@@GLIBCXX_3.4
  FUNC:_ZNSoC2EPSt15basic_streambufIcSt11char_traitsIcEE@@GLIBCXX_3.4
*************** FUNC:_ZNSolsEb@@GLIBCXX_3.4
*** 849,854 ****
--- 1061,1067 ----
  FUNC:_ZNSolsEd@@GLIBCXX_3.4
  FUNC:_ZNSolsEe@@GLIBCXX_3.4
  FUNC:_ZNSolsEf@@GLIBCXX_3.4
+ FUNC:_ZNSolsEg@@GLIBCXX_LDBL_3.4
  FUNC:_ZNSolsEi@@GLIBCXX_3.4
  FUNC:_ZNSolsEj@@GLIBCXX_3.4
  FUNC:_ZNSolsEl@@GLIBCXX_3.4
*************** FUNC:_ZNSt13basic_fstreamIwSt11char_trai
*** 1206,1211 ****
--- 1419,1436 ----
  FUNC:_ZNSt13basic_fstreamIwSt11char_traitsIwEED0Ev@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_fstreamIwSt11char_traitsIwEED1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_fstreamIwSt11char_traitsIwEED2Ev@@GLIBCXX_3.4
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIPvEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIbEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIdEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIeEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIfEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIgEERS2_RT_@@GLIBCXX_LDBL_3.4.7
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIjEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIlEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractImEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractItEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIxEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIyEERS2_RT_@@GLIBCXX_3.4.9
  FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE3getEPwi@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE3getEPwiw@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE3getERSt15basic_streambufIwS1_E@@GLIBCXX_3.4
*************** FUNC:_ZNSt13basic_istreamIwSt11char_trai
*** 1246,1251 ****
--- 1471,1477 ----
  FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEErsERd@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEErsERe@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEErsERf@@GLIBCXX_3.4
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEErsERg@@GLIBCXX_LDBL_3.4
  FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEErsERi@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEErsERj@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEErsERl@@GLIBCXX_3.4
*************** FUNC:_ZNSt13basic_ostreamIwSt11char_trai
*** 1265,1270 ****
--- 1491,1505 ----
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE6sentryD1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE6sentryD2Ev@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE8_M_writeEPKwi@@GLIBCXX_3.4
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIPKvEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIbEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIdEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIeEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIgEERS2_T_@@GLIBCXX_LDBL_3.4.7
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIlEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertImEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIxEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIyEERS2_T_@@GLIBCXX_3.4.9
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEEC1EPSt15basic_streambufIwS1_E@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEEC1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEEC2EPSt15basic_streambufIwS1_E@@GLIBCXX_3.4
*************** FUNC:_ZNSt13basic_ostreamIwSt11char_trai
*** 1281,1286 ****
--- 1516,1522 ----
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEElsEd@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEElsEe@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEElsEf@@GLIBCXX_3.4
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEElsEg@@GLIBCXX_LDBL_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEElsEi@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEElsEj@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEElsEl@@GLIBCXX_3.4
*************** FUNC:_ZNSt15basic_streambufIcSt11char_tr
*** 1386,1391 ****
--- 1622,1628 ----
  FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE6sbumpcEv@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE6setbufEPci@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE6snextcEv@@GLIBCXX_3.4
+ FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE6stosscEv@@GLIBCXX_3.4.10
  FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE6xsgetnEPci@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE6xsputnEPKci@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE7pubsyncEv@@GLIBCXX_3.4
*************** FUNC:_ZNSt15basic_streambufIwSt11char_tr
*** 1424,1429 ****
--- 1661,1667 ----
  FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE6sbumpcEv@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE6setbufEPwi@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE6snextcEv@@GLIBCXX_3.4
+ FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE6stosscEv@@GLIBCXX_3.4.10
  FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE6xsgetnEPwi@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE6xsputnEPKwi@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE7pubsyncEv@@GLIBCXX_3.4
*************** FUNC:_ZNSt15basic_stringbufIcSt11char_tr
*** 1455,1460 ****
--- 1693,1699 ----
  FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEE7seekposESt4fposI11__mbstate_tESt13_Ios_Openmode@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEE8overflowEi@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEE9pbackfailEi@@GLIBCXX_3.4
+ FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEE9showmanycEv@@GLIBCXX_3.4.6
  FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEE9underflowEv@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ERKSsSt13_Ios_Openmode@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode@@GLIBCXX_3.4
*************** FUNC:_ZNSt15basic_stringbufIwSt11char_tr
*** 1471,1476 ****
--- 1710,1716 ----
  FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEE7seekposESt4fposI11__mbstate_tESt13_Ios_Openmode@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEE8overflowEj@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEE9pbackfailEj@@GLIBCXX_3.4
+ FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEE9showmanycEv@@GLIBCXX_3.4.6
  FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEE9underflowEv@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEEC1ERKSbIwS1_S2_ESt13_Ios_Openmode@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEEC1ESt13_Ios_Openmode@@GLIBCXX_3.4
*************** FUNC:_ZNSt16invalid_argumentC1ERKSs@@GLI
*** 1538,1543 ****
--- 1778,1823 ----
  FUNC:_ZNSt16invalid_argumentC2ERKSs@@GLIBCXX_3.4
  FUNC:_ZNSt16invalid_argumentD0Ev@@GLIBCXX_3.4
  FUNC:_ZNSt16invalid_argumentD1Ev@@GLIBCXX_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEC1Em@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEC2Em@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEED0Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEED1Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEED2Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEC1Em@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEC2Em@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEED0Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEED1Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEED2Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEC1Em@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEC2Em@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEED0Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEED1Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEED2Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEC1Em@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEC2Em@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEED0Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEED1Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEED2Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEC1Em@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEC2Em@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEED0Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEED1Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEED2Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEC1Em@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEC2Em@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEED0Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEED1Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEED2Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEC1Em@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEC2Em@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEED0Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEED1Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEED2Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEC1Em@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEC2Em@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEED0Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEED1Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEED2Ev@@GLIBCXX_LDBL_3.4
  FUNC:_ZNSt17__timepunct_cacheIcEC1Em@@GLIBCXX_3.4
  FUNC:_ZNSt17__timepunct_cacheIcEC2Em@@GLIBCXX_3.4
  FUNC:_ZNSt17__timepunct_cacheIcED0Ev@@GLIBCXX_3.4
*************** FUNC:_ZNSt5ctypeIwEC2Em@@GLIBCXX_3.4
*** 1660,1669 ****
--- 1940,1955 ----
  FUNC:_ZNSt5ctypeIwED0Ev@@GLIBCXX_3.4
  FUNC:_ZNSt5ctypeIwED1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt5ctypeIwED2Ev@@GLIBCXX_3.4
+ FUNC:_ZNSt6__norm15_List_node_base4hookEPS0_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt6__norm15_List_node_base4swapERS0_S1_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt6__norm15_List_node_base6unhookEv@@GLIBCXX_3.4.9
+ FUNC:_ZNSt6__norm15_List_node_base7reverseEv@@GLIBCXX_3.4.9
+ FUNC:_ZNSt6__norm15_List_node_base8transferEPS0_S1_@@GLIBCXX_3.4.9
  FUNC:_ZNSt6gslice8_IndexerC1EmRKSt8valarrayImES4_@@GLIBCXX_3.4
  FUNC:_ZNSt6gslice8_IndexerC2EmRKSt8valarrayImES4_@@GLIBCXX_3.4
  FUNC:_ZNSt6locale11_M_coalesceERKS_S1_i@@GLIBCXX_3.4
  FUNC:_ZNSt6locale21_S_normalize_categoryEi@@GLIBCXX_3.4
+ FUNC:_ZNSt6locale5_Impl16_M_install_cacheEPKNS_5facetEm@@GLIBCXX_3.4.7
  FUNC:_ZNSt6locale5_Impl16_M_install_facetEPKNS_2idEPKNS_5facetE@@GLIBCXX_3.4
  FUNC:_ZNSt6locale5_Impl16_M_replace_facetEPKS0_PKNS_2idE@@GLIBCXX_3.4
  FUNC:_ZNSt6locale5_Impl19_M_replace_categoryEPKS0_PKPKNS_2idE@@GLIBCXX_3.4
*************** FUNC:_ZNSt6locale5_ImplC2ERKS0_m@@GLIBCX
*** 1676,1681 ****
--- 1962,1968 ----
  FUNC:_ZNSt6locale5_ImplC2Em@@GLIBCXX_3.4
  FUNC:_ZNSt6locale5_ImplD1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt6locale5_ImplD2Ev@@GLIBCXX_3.4
+ FUNC:_ZNSt6locale5facet13_S_get_c_nameEv@@GLIBCXX_3.4.6
  FUNC:_ZNSt6locale5facet15_S_get_c_localeEv@@GLIBCXX_3.4
  FUNC:_ZNSt6locale5facet17_S_clone_c_localeERP15__locale_struct@@GLIBCXX_3.4
  FUNC:_ZNSt6locale5facet18_S_create_c_localeERP15__locale_structPKcS2_@@GLIBCXX_3.4
*************** FUNC:_ZNSt8bad_castD1Ev@@GLIBCXX_3.4
*** 1753,1759 ****
--- 2040,2048 ----
  FUNC:_ZNSt8bad_castD2Ev@@GLIBCXX_3.4
  FUNC:_ZNSt8ios_base13_M_grow_wordsEib@@GLIBCXX_3.4
  FUNC:_ZNSt8ios_base15sync_with_stdioEb@@GLIBCXX_3.4
+ FUNC:_ZNSt8ios_base17_M_call_callbacksENS_5eventE@@GLIBCXX_3.4.6
  FUNC:_ZNSt8ios_base17register_callbackEPFvNS_5eventERS_iEi@@GLIBCXX_3.4
+ FUNC:_ZNSt8ios_base20_M_dispose_callbacksEv@@GLIBCXX_3.4.6
  FUNC:_ZNSt8ios_base4InitC1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt8ios_base4InitC2Ev@@GLIBCXX_3.4
  FUNC:_ZNSt8ios_base4InitD1Ev@@GLIBCXX_3.4
*************** FUNC:_ZNSt8valarrayImEC2Em@@GLIBCXX_3.4
*** 1832,1837 ****
--- 2121,2131 ----
  FUNC:_ZNSt8valarrayImED1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt8valarrayImED2Ev@@GLIBCXX_3.4
  FUNC:_ZNSt8valarrayImEixEm@@GLIBCXX_3.4
+ FUNC:_ZNSt9__cxx199815_List_node_base4hookEPS0_@@GLIBCXX_3.4.10
+ FUNC:_ZNSt9__cxx199815_List_node_base4swapERS0_S1_@@GLIBCXX_3.4.10
+ FUNC:_ZNSt9__cxx199815_List_node_base6unhookEv@@GLIBCXX_3.4.10
+ FUNC:_ZNSt9__cxx199815_List_node_base7reverseEv@@GLIBCXX_3.4.10
+ FUNC:_ZNSt9__cxx199815_List_node_base8transferEPS0_S1_@@GLIBCXX_3.4.10
  FUNC:_ZNSt9bad_allocD0Ev@@GLIBCXX_3.4
  FUNC:_ZNSt9bad_allocD1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt9bad_allocD2Ev@@GLIBCXX_3.4
*************** FUNC:_ZSt13set_terminatePFvvE@@GLIBCXX_3
*** 1911,1920 ****
--- 2205,2220 ----
  FUNC:_ZSt14__convert_to_vIdEvPKcRT_RSt12_Ios_IostateRKP15__locale_struct@@GLIBCXX_3.4
  FUNC:_ZSt14__convert_to_vIeEvPKcRT_RSt12_Ios_IostateRKP15__locale_struct@@GLIBCXX_3.4
  FUNC:_ZSt14__convert_to_vIfEvPKcRT_RSt12_Ios_IostateRKP15__locale_struct@@GLIBCXX_3.4
+ FUNC:_ZSt14__convert_to_vIgEvPKcRT_RSt12_Ios_IostateRKP15__locale_struct@@GLIBCXX_LDBL_3.4
  FUNC:_ZSt14set_unexpectedPFvvE@@GLIBCXX_3.4
  FUNC:_ZSt15set_new_handlerPFvvE@@GLIBCXX_3.4
+ FUNC:_ZSt16__ostream_insertIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_PKS3_i@@GLIBCXX_3.4.9
+ FUNC:_ZSt16__ostream_insertIwSt11char_traitsIwEERSt13basic_ostreamIT_T0_ES6_PKS3_i@@GLIBCXX_3.4.9
  FUNC:_ZSt16__throw_bad_castv@@GLIBCXX_3.4
+ FUNC:_ZSt17__copy_streambufsIcSt11char_traitsIcEEiPSt15basic_streambufIT_T0_ES6_@@GLIBCXX_3.4.6
+ FUNC:_ZSt17__copy_streambufsIwSt11char_traitsIwEEiPSt15basic_streambufIT_T0_ES6_@@GLIBCXX_3.4.6
  FUNC:_ZSt17__throw_bad_allocv@@GLIBCXX_3.4
+ FUNC:_ZSt17__verify_groupingPKcmRKSs@@GLIBCXX_3.4.10
  FUNC:_ZSt18_Rb_tree_decrementPKSt18_Rb_tree_node_base@@GLIBCXX_3.4
  FUNC:_ZSt18_Rb_tree_decrementPSt18_Rb_tree_node_base@@GLIBCXX_3.4
  FUNC:_ZSt18_Rb_tree_incrementPKSt18_Rb_tree_node_base@@GLIBCXX_3.4
*************** FUNC:_ZSt20__throw_domain_errorPKc@@GLIB
*** 1930,1935 ****
--- 2230,2237 ----
  FUNC:_ZSt20__throw_length_errorPKc@@GLIBCXX_3.4
  FUNC:_ZSt20__throw_out_of_rangePKc@@GLIBCXX_3.4
  FUNC:_ZSt21_Rb_tree_rotate_rightPSt18_Rb_tree_node_baseRS0_@@GLIBCXX_3.4
+ FUNC:_ZSt21__copy_streambufs_eofIcSt11char_traitsIcEEiPSt15basic_streambufIT_T0_ES6_Rb@@GLIBCXX_3.4.9
+ FUNC:_ZSt21__copy_streambufs_eofIwSt11char_traitsIwEEiPSt15basic_streambufIT_T0_ES6_Rb@@GLIBCXX_3.4.9
  FUNC:_ZSt21__throw_bad_exceptionv@@GLIBCXX_3.4
  FUNC:_ZSt21__throw_runtime_errorPKc@@GLIBCXX_3.4
  FUNC:_ZSt22__throw_overflow_errorPKc@@GLIBCXX_3.4
*************** FUNC:_ZSt7getlineIcSt11char_traitsIcESaI
*** 1949,1954 ****
--- 2251,2264 ----
  FUNC:_ZSt7getlineIcSt11char_traitsIcESaIcEERSt13basic_istreamIT_T0_ES7_RSbIS4_S5_T1_ES4_@@GLIBCXX_3.4
  FUNC:_ZSt7getlineIwSt11char_traitsIwESaIwEERSt13basic_istreamIT_T0_ES7_RSbIS4_S5_T1_E@@GLIBCXX_3.4
  FUNC:_ZSt7getlineIwSt11char_traitsIwESaIwEERSt13basic_istreamIT_T0_ES7_RSbIS4_S5_T1_ES4_@@GLIBCXX_3.4
+ FUNC:_ZSt9has_facetINSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEEEbRKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9has_facetINSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEEEbRKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9has_facetINSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEEEbRKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9has_facetINSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEEEbRKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9has_facetINSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEEEbRKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9has_facetINSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEEEbRKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9has_facetINSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEEEbRKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9has_facetINSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEEEbRKSt6locale@@GLIBCXX_LDBL_3.4
  FUNC:_ZSt9has_facetISt10moneypunctIcLb0EEEbRKSt6locale@@GLIBCXX_3.4
  FUNC:_ZSt9has_facetISt10moneypunctIwLb0EEEbRKSt6locale@@GLIBCXX_3.4
  FUNC:_ZSt9has_facetISt11__timepunctIcEEbRKSt6locale@@GLIBCXX_3.4
*************** FUNC:_ZSt9has_facetISt9money_getIwSt19is
*** 1976,1981 ****
--- 2286,2299 ----
  FUNC:_ZSt9has_facetISt9money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEEbRKSt6locale@@GLIBCXX_3.4
  FUNC:_ZSt9has_facetISt9money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEEbRKSt6locale@@GLIBCXX_3.4
  FUNC:_ZSt9terminatev@@GLIBCXX_3.4
+ FUNC:_ZSt9use_facetINSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEEERKT_RKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9use_facetINSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEEERKT_RKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9use_facetINSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEEERKT_RKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9use_facetINSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEEERKT_RKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9use_facetINSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEEERKT_RKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9use_facetINSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEEERKT_RKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9use_facetINSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEEERKT_RKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9use_facetINSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEEERKT_RKSt6locale@@GLIBCXX_LDBL_3.4
  FUNC:_ZSt9use_facetISt10moneypunctIcLb0EEERKT_RKSt6locale@@GLIBCXX_3.4
  FUNC:_ZSt9use_facetISt10moneypunctIcLb1EEERKT_RKSt6locale@@GLIBCXX_3.4
  FUNC:_ZSt9use_facetISt10moneypunctIwLb0EEERKT_RKSt6locale@@GLIBCXX_3.4
*************** FUNC:_ZStlsIecSt11char_traitsIcEERSt13ba
*** 2023,2028 ****
--- 2341,2348 ----
  FUNC:_ZStlsIewSt11char_traitsIwEERSt13basic_ostreamIT0_T1_ES6_RKSt7complexIT_E@@GLIBCXX_3.4
  FUNC:_ZStlsIfcSt11char_traitsIcEERSt13basic_ostreamIT0_T1_ES6_RKSt7complexIT_E@@GLIBCXX_3.4
  FUNC:_ZStlsIfwSt11char_traitsIwEERSt13basic_ostreamIT0_T1_ES6_RKSt7complexIT_E@@GLIBCXX_3.4
+ FUNC:_ZStlsIgcSt11char_traitsIcEERSt13basic_ostreamIT0_T1_ES6_RKSt7complexIT_E@@GLIBCXX_LDBL_3.4
+ FUNC:_ZStlsIgwSt11char_traitsIwEERSt13basic_ostreamIT0_T1_ES6_RKSt7complexIT_E@@GLIBCXX_LDBL_3.4
  FUNC:_ZStlsIwSt11char_traitsIwEERSt13basic_ostreamIT_T0_ES6_PKS3_@@GLIBCXX_3.4
  FUNC:_ZStlsIwSt11char_traitsIwEERSt13basic_ostreamIT_T0_ES6_PKc@@GLIBCXX_3.4
  FUNC:_ZStlsIwSt11char_traitsIwEERSt13basic_ostreamIT_T0_ES6_S3_@@GLIBCXX_3.4
*************** FUNC:_ZStrsIecSt11char_traitsIcEERSt13ba
*** 2059,2064 ****
--- 2379,2386 ----
  FUNC:_ZStrsIewSt11char_traitsIwEERSt13basic_istreamIT0_T1_ES6_RSt7complexIT_E@@GLIBCXX_3.4
  FUNC:_ZStrsIfcSt11char_traitsIcEERSt13basic_istreamIT0_T1_ES6_RSt7complexIT_E@@GLIBCXX_3.4
  FUNC:_ZStrsIfwSt11char_traitsIwEERSt13basic_istreamIT0_T1_ES6_RSt7complexIT_E@@GLIBCXX_3.4
+ FUNC:_ZStrsIgcSt11char_traitsIcEERSt13basic_istreamIT0_T1_ES6_RSt7complexIT_E@@GLIBCXX_LDBL_3.4
+ FUNC:_ZStrsIgwSt11char_traitsIwEERSt13basic_istreamIT0_T1_ES6_RSt7complexIT_E@@GLIBCXX_LDBL_3.4
  FUNC:_ZStrsIwSt11char_traitsIwEERSt13basic_istreamIT_T0_ES6_PS3_@@GLIBCXX_3.4
  FUNC:_ZStrsIwSt11char_traitsIwEERSt13basic_istreamIT_T0_ES6_RS3_@@GLIBCXX_3.4
  FUNC:_ZStrsIwSt11char_traitsIwEERSt13basic_istreamIT_T0_ES6_St12_Setiosflags@@GLIBCXX_3.4
*************** FUNC:__cxa_vec_new3@@CXXABI_1.3
*** 2162,2197 ****
  FUNC:__cxa_vec_new@@CXXABI_1.3
  FUNC:__dynamic_cast@@CXXABI_1.3
  FUNC:__gxx_personality_v0@@CXXABI_1.3
! FUNC:acosl@@GLIBCXX_3.4.3
! FUNC:asinl@@GLIBCXX_3.4.3
! FUNC:atan2l@@GLIBCXX_3.4
! FUNC:atanl@@GLIBCXX_3.4.3
! FUNC:ceill@@GLIBCXX_3.4.3
! FUNC:coshl@@GLIBCXX_3.4
! FUNC:cosl@@GLIBCXX_3.4
! FUNC:expl@@GLIBCXX_3.4
! FUNC:floorl@@GLIBCXX_3.4.3
! FUNC:fmodl@@GLIBCXX_3.4.3
! FUNC:frexpl@@GLIBCXX_3.4.3
! FUNC:hypotl@@GLIBCXX_3.4
! FUNC:ldexpl@@GLIBCXX_3.4.3
! FUNC:log10l@@GLIBCXX_3.4
! FUNC:logl@@GLIBCXX_3.4
! FUNC:modfl@@GLIBCXX_3.4.3
! FUNC:powl@@GLIBCXX_3.4
! FUNC:sinhl@@GLIBCXX_3.4
! FUNC:sinl@@GLIBCXX_3.4
! FUNC:sqrtl@@GLIBCXX_3.4
! FUNC:tanhl@@GLIBCXX_3.4
! FUNC:tanl@@GLIBCXX_3.4
  OBJECT:0:CXXABI_1.3
  OBJECT:0:CXXABI_1.3.1
  OBJECT:0:GLIBCXX_3.4
  OBJECT:0:GLIBCXX_3.4.1
  OBJECT:0:GLIBCXX_3.4.2
  OBJECT:0:GLIBCXX_3.4.3
  OBJECT:0:GLIBCXX_3.4.4
  OBJECT:0:GLIBCXX_3.4.5
  OBJECT:12:_ZTIN10__cxxabiv116__enum_type_infoE@@CXXABI_1.3
  OBJECT:12:_ZTIN10__cxxabiv117__array_type_infoE@@CXXABI_1.3
  OBJECT:12:_ZTIN10__cxxabiv117__class_type_infoE@@CXXABI_1.3
--- 2484,2531 ----
  FUNC:__cxa_vec_new@@CXXABI_1.3
  FUNC:__dynamic_cast@@CXXABI_1.3
  FUNC:__gxx_personality_v0@@CXXABI_1.3
! FUNC:acosl@GLIBCXX_3.4.3
! FUNC:asinl@GLIBCXX_3.4.3
! FUNC:atan2l@GLIBCXX_3.4
! FUNC:atanl@GLIBCXX_3.4.3
! FUNC:ceill@GLIBCXX_3.4.3
! FUNC:coshl@GLIBCXX_3.4
! FUNC:cosl@GLIBCXX_3.4
! FUNC:expl@GLIBCXX_3.4
! FUNC:floorl@GLIBCXX_3.4.3
! FUNC:fmodl@GLIBCXX_3.4.3
! FUNC:frexpl@GLIBCXX_3.4.3
! FUNC:hypotl@GLIBCXX_3.4
! FUNC:ldexpl@GLIBCXX_3.4.3
! FUNC:log10l@GLIBCXX_3.4
! FUNC:logl@GLIBCXX_3.4
! FUNC:modfl@GLIBCXX_3.4.3
! FUNC:powl@GLIBCXX_3.4
! FUNC:sinhl@GLIBCXX_3.4
! FUNC:sinl@GLIBCXX_3.4
! FUNC:sqrtl@GLIBCXX_3.4
! FUNC:tanhl@GLIBCXX_3.4
! FUNC:tanl@GLIBCXX_3.4
  OBJECT:0:CXXABI_1.3
  OBJECT:0:CXXABI_1.3.1
+ OBJECT:0:CXXABI_1.3.2
+ OBJECT:0:CXXABI_LDBL_1.3
  OBJECT:0:GLIBCXX_3.4
  OBJECT:0:GLIBCXX_3.4.1
+ OBJECT:0:GLIBCXX_3.4.10
  OBJECT:0:GLIBCXX_3.4.2
  OBJECT:0:GLIBCXX_3.4.3
  OBJECT:0:GLIBCXX_3.4.4
  OBJECT:0:GLIBCXX_3.4.5
+ OBJECT:0:GLIBCXX_3.4.6
+ OBJECT:0:GLIBCXX_3.4.7
+ OBJECT:0:GLIBCXX_3.4.8
+ OBJECT:0:GLIBCXX_3.4.9
+ OBJECT:0:GLIBCXX_LDBL_3.4
+ OBJECT:0:GLIBCXX_LDBL_3.4.10
+ OBJECT:0:GLIBCXX_LDBL_3.4.7
+ OBJECT:1028:_ZNSt3tr18__detail12__prime_listE@@GLIBCXX_3.4.10
+ OBJECT:1028:_ZNSt8__detail12__prime_listE@@GLIBCXX_3.4.10
  OBJECT:12:_ZTIN10__cxxabiv116__enum_type_infoE@@CXXABI_1.3
  OBJECT:12:_ZTIN10__cxxabiv117__array_type_infoE@@CXXABI_1.3
  OBJECT:12:_ZTIN10__cxxabiv117__class_type_infoE@@CXXABI_1.3
*************** OBJECT:12:_ZTIN9__gnu_cxx13stdio_filebuf
*** 2206,2211 ****
--- 2540,2553 ----
  OBJECT:12:_ZTIN9__gnu_cxx13stdio_filebufIwSt11char_traitsIwEEE@@GLIBCXX_3.4
  OBJECT:12:_ZTIN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEEE@@GLIBCXX_3.4
  OBJECT:12:_ZTIN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEEE@@GLIBCXX_3.4
+ OBJECT:12:_ZTINSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:12:_ZTINSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:12:_ZTINSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:12:_ZTINSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:12:_ZTINSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:12:_ZTINSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:12:_ZTINSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:12:_ZTINSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEE@@GLIBCXX_LDBL_3.4
  OBJECT:12:_ZTINSt8ios_base7failureE@@GLIBCXX_3.4
  OBJECT:12:_ZTISt10bad_typeid@@GLIBCXX_3.4
  OBJECT:12:_ZTISt10istrstream@@GLIBCXX_3.4
*************** OBJECT:16:_ZTIPKc@@CXXABI_1.3
*** 2315,2320 ****
--- 2657,2663 ----
  OBJECT:16:_ZTIPKd@@CXXABI_1.3
  OBJECT:16:_ZTIPKe@@CXXABI_1.3
  OBJECT:16:_ZTIPKf@@CXXABI_1.3
+ OBJECT:16:_ZTIPKg@@CXXABI_LDBL_1.3
  OBJECT:16:_ZTIPKh@@CXXABI_1.3
  OBJECT:16:_ZTIPKi@@CXXABI_1.3
  OBJECT:16:_ZTIPKj@@CXXABI_1.3
*************** OBJECT:16:_ZTIPc@@CXXABI_1.3
*** 2332,2337 ****
--- 2675,2681 ----
  OBJECT:16:_ZTIPd@@CXXABI_1.3
  OBJECT:16:_ZTIPe@@CXXABI_1.3
  OBJECT:16:_ZTIPf@@CXXABI_1.3
+ OBJECT:16:_ZTIPg@@CXXABI_LDBL_1.3
  OBJECT:16:_ZTIPh@@CXXABI_1.3
  OBJECT:16:_ZTIPi@@CXXABI_1.3
  OBJECT:16:_ZTIPj@@CXXABI_1.3
*************** OBJECT:1:_ZNSt14numeric_limitsIfE8is_exa
*** 2456,2461 ****
--- 2800,2818 ----
  OBJECT:1:_ZNSt14numeric_limitsIfE9is_iec559E@@GLIBCXX_3.4
  OBJECT:1:_ZNSt14numeric_limitsIfE9is_moduloE@@GLIBCXX_3.4
  OBJECT:1:_ZNSt14numeric_limitsIfE9is_signedE@@GLIBCXX_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE10is_boundedE@@GLIBCXX_LDBL_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE10is_integerE@@GLIBCXX_LDBL_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE12has_infinityE@@GLIBCXX_LDBL_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE13has_quiet_NaNE@@GLIBCXX_LDBL_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE14is_specializedE@@GLIBCXX_LDBL_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE15has_denorm_lossE@@GLIBCXX_LDBL_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE15tinyness_beforeE@@GLIBCXX_LDBL_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE17has_signaling_NaNE@@GLIBCXX_LDBL_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE5trapsE@@GLIBCXX_LDBL_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE8is_exactE@@GLIBCXX_LDBL_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE9is_iec559E@@GLIBCXX_LDBL_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE9is_moduloE@@GLIBCXX_LDBL_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE9is_signedE@@GLIBCXX_LDBL_3.4
  OBJECT:1:_ZNSt14numeric_limitsIhE10is_boundedE@@GLIBCXX_3.4
  OBJECT:1:_ZNSt14numeric_limitsIhE10is_integerE@@GLIBCXX_3.4
  OBJECT:1:_ZNSt14numeric_limitsIhE12has_infinityE@@GLIBCXX_3.4
*************** OBJECT:28:_ZTSSt7codecvtIcc11__mbstate_t
*** 2650,2655 ****
--- 3007,3016 ----
  OBJECT:28:_ZTSSt7codecvtIwc11__mbstate_tE@@GLIBCXX_3.4
  OBJECT:28:_ZTTSd@@GLIBCXX_3.4
  OBJECT:28:_ZTTSt14basic_iostreamIwSt11char_traitsIwEE@@GLIBCXX_3.4
+ OBJECT:28:_ZTVNSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:28:_ZTVNSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:28:_ZTVNSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:28:_ZTVNSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEE@@GLIBCXX_LDBL_3.4
  OBJECT:28:_ZTVSt14collate_bynameIcE@@GLIBCXX_3.4
  OBJECT:28:_ZTVSt14collate_bynameIwE@@GLIBCXX_3.4
  OBJECT:28:_ZTVSt15messages_bynameIcE@@GLIBCXX_3.4
*************** OBJECT:2:_ZTSc@@CXXABI_1.3
*** 2681,2686 ****
--- 3042,3048 ----
  OBJECT:2:_ZTSd@@CXXABI_1.3
  OBJECT:2:_ZTSe@@CXXABI_1.3
  OBJECT:2:_ZTSf@@CXXABI_1.3
+ OBJECT:2:_ZTSg@@CXXABI_LDBL_1.3
  OBJECT:2:_ZTSh@@CXXABI_1.3
  OBJECT:2:_ZTSi@@CXXABI_1.3
  OBJECT:2:_ZTSj@@CXXABI_1.3
*************** OBJECT:3:_ZTSPc@@CXXABI_1.3
*** 2743,2748 ****
--- 3105,3111 ----
  OBJECT:3:_ZTSPd@@CXXABI_1.3
  OBJECT:3:_ZTSPe@@CXXABI_1.3
  OBJECT:3:_ZTSPf@@CXXABI_1.3
+ OBJECT:3:_ZTSPg@@CXXABI_LDBL_1.3
  OBJECT:3:_ZTSPh@@CXXABI_1.3
  OBJECT:3:_ZTSPi@@CXXABI_1.3
  OBJECT:3:_ZTSPj@@CXXABI_1.3
*************** OBJECT:4:_ZNSt14numeric_limitsIfE14min_e
*** 2879,2884 ****
--- 3242,3256 ----
  OBJECT:4:_ZNSt14numeric_limitsIfE5radixE@@GLIBCXX_3.4
  OBJECT:4:_ZNSt14numeric_limitsIfE6digitsE@@GLIBCXX_3.4
  OBJECT:4:_ZNSt14numeric_limitsIfE8digits10E@@GLIBCXX_3.4
+ OBJECT:4:_ZNSt14numeric_limitsIgE10has_denormE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt14numeric_limitsIgE11round_styleE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt14numeric_limitsIgE12max_exponentE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt14numeric_limitsIgE12min_exponentE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt14numeric_limitsIgE14max_exponent10E@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt14numeric_limitsIgE14min_exponent10E@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt14numeric_limitsIgE5radixE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt14numeric_limitsIgE6digitsE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt14numeric_limitsIgE8digits10E@@GLIBCXX_LDBL_3.4
  OBJECT:4:_ZNSt14numeric_limitsIhE10has_denormE@@GLIBCXX_3.4
  OBJECT:4:_ZNSt14numeric_limitsIhE11round_styleE@@GLIBCXX_3.4
  OBJECT:4:_ZNSt14numeric_limitsIhE12max_exponentE@@GLIBCXX_3.4
*************** OBJECT:4:_ZNSt14numeric_limitsIyE14min_e
*** 2969,2974 ****
--- 3341,3354 ----
  OBJECT:4:_ZNSt14numeric_limitsIyE5radixE@@GLIBCXX_3.4
  OBJECT:4:_ZNSt14numeric_limitsIyE6digitsE@@GLIBCXX_3.4
  OBJECT:4:_ZNSt14numeric_limitsIyE8digits10E@@GLIBCXX_3.4
+ OBJECT:4:_ZNSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE2idE@@GLIBCXX_LDBL_3.4
  OBJECT:4:_ZNSt21__numeric_limits_base10has_denormE@@GLIBCXX_3.4
  OBJECT:4:_ZNSt21__numeric_limits_base11round_styleE@@GLIBCXX_3.4
  OBJECT:4:_ZNSt21__numeric_limits_base12max_exponentE@@GLIBCXX_3.4
*************** OBJECT:4:_ZTSPKc@@CXXABI_1.3
*** 3046,3051 ****
--- 3426,3432 ----
  OBJECT:4:_ZTSPKd@@CXXABI_1.3
  OBJECT:4:_ZTSPKe@@CXXABI_1.3
  OBJECT:4:_ZTSPKf@@CXXABI_1.3
+ OBJECT:4:_ZTSPKg@@CXXABI_LDBL_1.3
  OBJECT:4:_ZTSPKh@@CXXABI_1.3
  OBJECT:4:_ZTSPKi@@CXXABI_1.3
  OBJECT:4:_ZTSPKj@@CXXABI_1.3
*************** OBJECT:50:_ZTSSt19basic_istringstreamIcS
*** 3061,3066 ****
--- 3442,3449 ----
  OBJECT:50:_ZTSSt19basic_istringstreamIwSt11char_traitsIwESaIwEE@@GLIBCXX_3.4
  OBJECT:50:_ZTSSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE@@GLIBCXX_3.4
  OBJECT:50:_ZTSSt19basic_ostringstreamIwSt11char_traitsIwESaIwEE@@GLIBCXX_3.4
+ OBJECT:52:_ZTVNSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:52:_ZTVNSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEE@@GLIBCXX_LDBL_3.4
  OBJECT:52:_ZTVSt10moneypunctIcLb0EE@@GLIBCXX_3.4
  OBJECT:52:_ZTVSt10moneypunctIcLb1EE@@GLIBCXX_3.4
  OBJECT:52:_ZTVSt10moneypunctIwLb0EE@@GLIBCXX_3.4
*************** OBJECT:60:_ZTVSt7num_getIwSt19istreambuf
*** 3096,3101 ****
--- 3479,3486 ----
  OBJECT:60:_ZTVSt9strstream@@GLIBCXX_3.4
  OBJECT:64:_ZTVN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEEE@@GLIBCXX_3.4
  OBJECT:64:_ZTVN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEEE@@GLIBCXX_3.4
+ OBJECT:64:_ZTVNSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:64:_ZTVNSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEE@@GLIBCXX_LDBL_3.4
  OBJECT:64:_ZTVSt12ctype_bynameIwE@@GLIBCXX_3.4
  OBJECT:64:_ZTVSt12strstreambuf@@GLIBCXX_3.4
  OBJECT:64:_ZTVSt13basic_filebufIcSt11char_traitsIcEE@@GLIBCXX_3.4
*************** OBJECT:67:_ZTSSt15time_get_bynameIcSt19i
*** 3111,3122 ****
--- 3496,3523 ----
  OBJECT:67:_ZTSSt15time_get_bynameIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE@@GLIBCXX_3.4
  OBJECT:67:_ZTSSt15time_put_bynameIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE@@GLIBCXX_3.4
  OBJECT:67:_ZTSSt15time_put_bynameIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE@@GLIBCXX_3.4
+ OBJECT:79:_ZTSNSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:79:_ZTSNSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:79:_ZTSNSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:79:_ZTSNSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:81:_ZTSNSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:81:_ZTSNSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:81:_ZTSNSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:81:_ZTSNSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEE@@GLIBCXX_LDBL_3.4
  OBJECT:8:_ZGVNSt10moneypunctIcLb0EE2idE@@GLIBCXX_3.4
  OBJECT:8:_ZGVNSt10moneypunctIcLb1EE2idE@@GLIBCXX_3.4
  OBJECT:8:_ZGVNSt10moneypunctIwLb0EE2idE@@GLIBCXX_3.4
  OBJECT:8:_ZGVNSt10moneypunctIwLb1EE2idE@@GLIBCXX_3.4
  OBJECT:8:_ZGVNSt11__timepunctIcE2idE@@GLIBCXX_3.4
  OBJECT:8:_ZGVNSt11__timepunctIwE2idE@@GLIBCXX_3.4
+ OBJECT:8:_ZGVNSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:8:_ZGVNSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:8:_ZGVNSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:8:_ZGVNSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:8:_ZGVNSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:8:_ZGVNSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:8:_ZGVNSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:8:_ZGVNSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE2idE@@GLIBCXX_LDBL_3.4
  OBJECT:8:_ZGVNSt7collateIcE2idE@@GLIBCXX_3.4
  OBJECT:8:_ZGVNSt7collateIwE2idE@@GLIBCXX_3.4
  OBJECT:8:_ZGVNSt7num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE2idE@@GLIBCXX_3.4
*************** OBJECT:8:_ZGVNSt9money_getIcSt19istreamb
*** 3135,3140 ****
--- 3536,3543 ----
  OBJECT:8:_ZGVNSt9money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE2idE@@GLIBCXX_3.4
  OBJECT:8:_ZGVNSt9money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE2idE@@GLIBCXX_3.4
  OBJECT:8:_ZGVNSt9money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE2idE@@GLIBCXX_3.4
+ OBJECT:8:_ZTIN10__cxxabiv115__forced_unwindE@@CXXABI_1.3.2
+ OBJECT:8:_ZTIN10__cxxabiv119__foreign_exceptionE@@CXXABI_1.3.2
  OBJECT:8:_ZTINSt6locale5facetE@@GLIBCXX_3.4
  OBJECT:8:_ZTISt10ctype_base@@GLIBCXX_3.4
  OBJECT:8:_ZTISt10money_base@@GLIBCXX_3.4
*************** OBJECT:8:_ZTIc@@CXXABI_1.3
*** 3152,3157 ****
--- 3555,3561 ----
  OBJECT:8:_ZTId@@CXXABI_1.3
  OBJECT:8:_ZTIe@@CXXABI_1.3
  OBJECT:8:_ZTIf@@CXXABI_1.3
+ OBJECT:8:_ZTIg@@CXXABI_LDBL_1.3
  OBJECT:8:_ZTIh@@CXXABI_1.3
  OBJECT:8:_ZTIi@@CXXABI_1.3
  OBJECT:8:_ZTIj@@CXXABI_1.3
diff -Nrcpad gcc-4.3.0/libstdc++-v3/config/abi/post/sparc-linux-gnu/baseline_symbols.txt gcc-4.3.1/libstdc++-v3/config/abi/post/sparc-linux-gnu/baseline_symbols.txt
*** gcc-4.3.0/libstdc++-v3/config/abi/post/sparc-linux-gnu/baseline_symbols.txt	Sun Dec 18 09:39:23 2005
--- gcc-4.3.1/libstdc++-v3/config/abi/post/sparc-linux-gnu/baseline_symbols.txt	Sat Mar 29 09:10:14 2008
*************** FUNC:_ZN10__gnu_norm15_List_node_base4sw
*** 33,51 ****
--- 33,83 ----
  FUNC:_ZN10__gnu_norm15_List_node_base6unhookEv@@GLIBCXX_3.4
  FUNC:_ZN10__gnu_norm15_List_node_base7reverseEv@@GLIBCXX_3.4
  FUNC:_ZN10__gnu_norm15_List_node_base8transferEPS0_S1_@@GLIBCXX_3.4
+ FUNC:_ZN11__gnu_debug19_Safe_iterator_base12_M_get_mutexEv@@GLIBCXX_3.4.9
+ FUNC:_ZN11__gnu_debug19_Safe_iterator_base16_M_attach_singleEPNS_19_Safe_sequence_baseEb@@GLIBCXX_3.4.9
+ FUNC:_ZN11__gnu_debug19_Safe_iterator_base16_M_detach_singleEv@@GLIBCXX_3.4.9
  FUNC:_ZN11__gnu_debug19_Safe_iterator_base9_M_attachEPNS_19_Safe_sequence_baseEb@@GLIBCXX_3.4
  FUNC:_ZN11__gnu_debug19_Safe_iterator_base9_M_detachEv@@GLIBCXX_3.4
+ FUNC:_ZN11__gnu_debug19_Safe_sequence_base12_M_get_mutexEv@@GLIBCXX_3.4.9
  FUNC:_ZN11__gnu_debug19_Safe_sequence_base13_M_detach_allEv@@GLIBCXX_3.4
  FUNC:_ZN11__gnu_debug19_Safe_sequence_base18_M_detach_singularEv@@GLIBCXX_3.4
  FUNC:_ZN11__gnu_debug19_Safe_sequence_base22_M_revalidate_singularEv@@GLIBCXX_3.4
  FUNC:_ZN11__gnu_debug19_Safe_sequence_base7_M_swapERS0_@@GLIBCXX_3.4
+ FUNC:_ZN14__gnu_parallel9_Settings3getEv@@GLIBCXX_3.4.10
+ FUNC:_ZN14__gnu_parallel9_Settings3setERS0_@@GLIBCXX_3.4.10
  FUNC:_ZN9__gnu_cxx12__atomic_addEPVii@@GLIBCXX_3.4
  FUNC:_ZN9__gnu_cxx17__pool_alloc_base12_M_get_mutexEv@@GLIBCXX_3.4.2
  FUNC:_ZN9__gnu_cxx17__pool_alloc_base16_M_get_free_listEj@@GLIBCXX_3.4.2
  FUNC:_ZN9__gnu_cxx17__pool_alloc_base9_M_refillEj@@GLIBCXX_3.4.2
  FUNC:_ZN9__gnu_cxx18__exchange_and_addEPVii@@GLIBCXX_3.4
  FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE4fileEv@@GLIBCXX_3.4.2
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE4syncEv@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE5uflowEv@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE6xsgetnEPci@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE6xsputnEPKci@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE7seekoffExSt12_Ios_SeekdirSt13_Ios_Openmode@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE7seekposESt4fposI11__mbstate_tESt13_Ios_Openmode@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE8overflowEi@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE9pbackfailEi@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEE9underflowEv@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEEC1EP8_IO_FILE@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEEC2EP8_IO_FILE@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEED0Ev@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEED1Ev@@GLIBCXX_3.4.10
  FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE4fileEv@@GLIBCXX_3.4.2
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE4syncEv@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE5uflowEv@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE6xsgetnEPwi@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE6xsputnEPKwi@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE7seekoffExSt12_Ios_SeekdirSt13_Ios_Openmode@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE7seekposESt4fposI11__mbstate_tESt13_Ios_Openmode@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE8overflowEj@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE9pbackfailEj@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEE9underflowEv@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEEC1EP8_IO_FILE@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEEC2EP8_IO_FILE@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEED0Ev@@GLIBCXX_3.4.10
+ FUNC:_ZN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEED1Ev@@GLIBCXX_3.4.10
  FUNC:_ZN9__gnu_cxx27__verbose_terminate_handlerEv@@CXXABI_1.3
  FUNC:_ZN9__gnu_cxx6__poolILb0EE10_M_destroyEv@@GLIBCXX_3.4.4
  FUNC:_ZN9__gnu_cxx6__poolILb0EE13_M_initializeEv@@GLIBCXX_3.4.4
*************** FUNC:_ZN9__gnu_cxx6__poolILb0EE16_M_recl
*** 53,58 ****
--- 85,91 ----
  FUNC:_ZN9__gnu_cxx6__poolILb0EE16_M_reserve_blockEjj@@GLIBCXX_3.4.4
  FUNC:_ZN9__gnu_cxx6__poolILb1EE10_M_destroyEv@@GLIBCXX_3.4.4
  FUNC:_ZN9__gnu_cxx6__poolILb1EE13_M_initializeEPFvPvE@@GLIBCXX_3.4.4
+ FUNC:_ZN9__gnu_cxx6__poolILb1EE13_M_initializeEv@@GLIBCXX_3.4.6
  FUNC:_ZN9__gnu_cxx6__poolILb1EE16_M_get_thread_idEv@@GLIBCXX_3.4.4
  FUNC:_ZN9__gnu_cxx6__poolILb1EE16_M_reclaim_blockEPcj@@GLIBCXX_3.4.4
  FUNC:_ZN9__gnu_cxx6__poolILb1EE16_M_reserve_blockEjj@@GLIBCXX_3.4.4
*************** FUNC:_ZNK11__gnu_debug16_Error_formatter
*** 81,86 ****
--- 114,120 ----
  FUNC:_ZNK11__gnu_debug16_Error_formatter10_Parameter20_M_print_descriptionEPKS0_@@GLIBCXX_3.4
  FUNC:_ZNK11__gnu_debug16_Error_formatter13_M_print_wordEPKc@@GLIBCXX_3.4
  FUNC:_ZNK11__gnu_debug16_Error_formatter15_M_print_stringEPKc@@GLIBCXX_3.4
+ FUNC:_ZNK11__gnu_debug16_Error_formatter17_M_get_max_lengthEv@@GLIBCXX_3.4.10
  FUNC:_ZNK11__gnu_debug16_Error_formatter8_M_errorEv@@GLIBCXX_3.4
  FUNC:_ZNK11__gnu_debug19_Safe_iterator_base11_M_singularEv@@GLIBCXX_3.4
  FUNC:_ZNK11__gnu_debug19_Safe_iterator_base14_M_can_compareERKS0_@@GLIBCXX_3.4
*************** FUNC:_ZNKSs8capacityEv@@GLIBCXX_3.4
*** 203,208 ****
--- 237,243 ----
  FUNC:_ZNKSs8max_sizeEv@@GLIBCXX_3.4
  FUNC:_ZNKSs9_M_ibeginEv@@GLIBCXX_3.4
  FUNC:_ZNKSsixEj@@GLIBCXX_3.4
+ FUNC:_ZNKSt10bad_typeid4whatEv@@GLIBCXX_3.4.9
  FUNC:_ZNKSt10istrstream5rdbufEv@@GLIBCXX_3.4
  FUNC:_ZNKSt10moneypunctIcLb0EE10neg_formatEv@@GLIBCXX_3.4
  FUNC:_ZNKSt10moneypunctIcLb0EE10pos_formatEv@@GLIBCXX_3.4
*************** FUNC:_ZNKSt11__timepunctIwE9_M_monthsEPP
*** 301,306 ****
--- 336,342 ----
  FUNC:_ZNKSt11logic_error4whatEv@@GLIBCXX_3.4
  FUNC:_ZNKSt12__basic_fileIcE7is_openEv@@GLIBCXX_3.4
  FUNC:_ZNKSt12strstreambuf6pcountEv@@GLIBCXX_3.4
+ FUNC:_ZNKSt13bad_exception4whatEv@@GLIBCXX_3.4.9
  FUNC:_ZNKSt13basic_filebufIcSt11char_traitsIcEE7is_openEv@@GLIBCXX_3.4
  FUNC:_ZNKSt13basic_filebufIwSt11char_traitsIwEE7is_openEv@@GLIBCXX_3.4
  FUNC:_ZNKSt13basic_fstreamIcSt11char_traitsIcEE5rdbufEv@@GLIBCXX_3.4
*************** FUNC:_ZNKSt15basic_streambufIwSt11char_t
*** 341,346 ****
--- 377,522 ----
  FUNC:_ZNKSt15basic_streambufIwSt11char_traitsIwEE6getlocEv@@GLIBCXX_3.4
  FUNC:_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv@@GLIBCXX_3.4
  FUNC:_ZNKSt15basic_stringbufIwSt11char_traitsIwESaIwEE3strEv@@GLIBCXX_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE14_M_extract_intIjEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE14_M_extract_intIlEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE14_M_extract_intImEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE14_M_extract_intItEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE14_M_extract_intIxEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE14_M_extract_intIyEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE16_M_extract_floatES4_S4_RSt8ios_baseRSt12_Ios_IostateRSs@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRPv@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRb@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRf@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRj@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRl@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRm@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRt@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRx@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRy@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRPv@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRb@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRf@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRj@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRl@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRm@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRt@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRx@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRy@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE8__do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE14_M_extract_intIjEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE14_M_extract_intIlEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE14_M_extract_intImEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE14_M_extract_intItEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE14_M_extract_intIxEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE14_M_extract_intIyEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE16_M_extract_floatES4_S4_RSt8ios_baseRSt12_Ios_IostateRSs@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRPv@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRb@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRf@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRj@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRl@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRm@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRt@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRx@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_RSt8ios_baseRSt12_Ios_IostateRy@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRPv@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRb@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRf@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRj@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRl@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRm@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRt@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRx@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRy@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE8__do_getES4_S4_RSt8ios_baseRSt12_Ios_IostateRd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE12_M_group_intEPKcjcRSt8ios_basePcSA_Ri@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE13_M_insert_intIlEES4_S4_RSt8ios_basecT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE13_M_insert_intImEES4_S4_RSt8ios_basecT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE13_M_insert_intIxEES4_S4_RSt8ios_basecT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE13_M_insert_intIyEES4_S4_RSt8ios_basecT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE14_M_group_floatEPKcjcS7_PcS8_Ri@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE15_M_insert_floatIdEES4_S4_RSt8ios_baseccT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE15_M_insert_floatIgEES4_S4_RSt8ios_baseccT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE3putES4_RSt8ios_basecPKv@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE3putES4_RSt8ios_basecb@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE3putES4_RSt8ios_basecd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE3putES4_RSt8ios_basecg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE3putES4_RSt8ios_basecl@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE3putES4_RSt8ios_basecm@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE3putES4_RSt8ios_basecx@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE3putES4_RSt8ios_basecy@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE6_M_padEciRSt8ios_basePcPKcRi@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE6do_putES4_RSt8ios_basecPKv@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE6do_putES4_RSt8ios_basecb@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE6do_putES4_RSt8ios_basecd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE6do_putES4_RSt8ios_basecg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE6do_putES4_RSt8ios_basecl@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE6do_putES4_RSt8ios_basecm@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE6do_putES4_RSt8ios_basecx@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE6do_putES4_RSt8ios_basecy@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE8__do_putES4_RSt8ios_basecd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE12_M_group_intEPKcjwRSt8ios_basePwSA_Ri@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE13_M_insert_intIlEES4_S4_RSt8ios_basewT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE13_M_insert_intImEES4_S4_RSt8ios_basewT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE13_M_insert_intIxEES4_S4_RSt8ios_basewT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE13_M_insert_intIyEES4_S4_RSt8ios_basewT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE14_M_group_floatEPKcjwPKwPwSA_Ri@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE15_M_insert_floatIdEES4_S4_RSt8ios_basewcT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE15_M_insert_floatIgEES4_S4_RSt8ios_basewcT_@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE3putES4_RSt8ios_basewPKv@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE3putES4_RSt8ios_basewb@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE3putES4_RSt8ios_basewd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE3putES4_RSt8ios_basewg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE3putES4_RSt8ios_basewl@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE3putES4_RSt8ios_basewm@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE3putES4_RSt8ios_basewx@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE3putES4_RSt8ios_basewy@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6_M_padEwiRSt8ios_basePwPKwRi@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES4_RSt8ios_basewPKv@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES4_RSt8ios_basewb@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES4_RSt8ios_basewd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES4_RSt8ios_basewg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES4_RSt8ios_basewl@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES4_RSt8ios_basewm@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES4_RSt8ios_basewx@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES4_RSt8ios_basewy@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE8__do_putES4_RSt8ios_basewd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE10_M_extractILb0EEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRSs@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE10_M_extractILb1EEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRSs@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_bRSt8ios_baseRSt12_Ios_IostateRSs@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE3getES4_S4_bRSt8ios_baseRSt12_Ios_IostateRg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_bRSt8ios_baseRSt12_Ios_IostateRSs@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE6do_getES4_S4_bRSt8ios_baseRSt12_Ios_IostateRg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE8__do_getES4_S4_bRSt8ios_baseRSt12_Ios_IostateRd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE10_M_extractILb0EEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRSs@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE10_M_extractILb1EEES4_S4_S4_RSt8ios_baseRSt12_Ios_IostateRSs@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_bRSt8ios_baseRSt12_Ios_IostateRSbIwS3_SaIwEE@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE3getES4_S4_bRSt8ios_baseRSt12_Ios_IostateRg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_bRSt8ios_baseRSt12_Ios_IostateRSbIwS3_SaIwEE@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE6do_getES4_S4_bRSt8ios_baseRSt12_Ios_IostateRg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE8__do_getES4_S4_bRSt8ios_baseRSt12_Ios_IostateRd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE3putES4_bRSt8ios_basecRKSs@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE3putES4_bRSt8ios_basecg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE6do_putES4_bRSt8ios_basecRKSs@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE6do_putES4_bRSt8ios_basecg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE8__do_putES4_bRSt8ios_basecd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE9_M_insertILb0EEES4_S4_RSt8ios_basecRKSs@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE9_M_insertILb1EEES4_S4_RSt8ios_basecRKSs@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE3putES4_bRSt8ios_basewRKSbIwS3_SaIwEE@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE3putES4_bRSt8ios_basewg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES4_bRSt8ios_basewRKSbIwS3_SaIwEE@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES4_bRSt8ios_basewg@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE8__do_putES4_bRSt8ios_basewd@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE9_M_insertILb0EEES4_S4_RSt8ios_basewRKSbIwS3_SaIwEE@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNKSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE9_M_insertILb1EEES4_S4_RSt8ios_basewRKSbIwS3_SaIwEE@@GLIBCXX_LDBL_3.4
  FUNC:_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv@@GLIBCXX_3.4
  FUNC:_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE5rdbufEv@@GLIBCXX_3.4
  FUNC:_ZNKSt18basic_stringstreamIwSt11char_traitsIwESaIwEE3strEv@@GLIBCXX_3.4
*************** FUNC:_ZNKSt19basic_ostringstreamIcSt11ch
*** 353,358 ****
--- 529,546 ----
  FUNC:_ZNKSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE5rdbufEv@@GLIBCXX_3.4
  FUNC:_ZNKSt19basic_ostringstreamIwSt11char_traitsIwESaIwEE3strEv@@GLIBCXX_3.4
  FUNC:_ZNKSt19basic_ostringstreamIwSt11char_traitsIwESaIwEE5rdbufEv@@GLIBCXX_3.4
+ FUNC:_ZNKSt3tr14hashIRKSbIwSt11char_traitsIwESaIwEEEclES6_@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt3tr14hashIRKSsEclES2_@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt3tr14hashISbIwSt11char_traitsIwESaIwEEEclES4_@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt3tr14hashISsEclESs@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt3tr14hashIeEclEe@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt3tr14hashIgEclEg@@GLIBCXX_LDBL_3.4.10
+ FUNC:_ZNKSt4hashIRKSbIwSt11char_traitsIwESaIwEEEclES5_@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt4hashIRKSsEclES1_@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt4hashISbIwSt11char_traitsIwESaIwEEEclES3_@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt4hashISsEclESs@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt4hashIeEclEe@@GLIBCXX_3.4.10
+ FUNC:_ZNKSt4hashIgEclEg@@GLIBCXX_LDBL_3.4.10
  FUNC:_ZNKSt5ctypeIcE10do_tolowerEPcPKc@@GLIBCXX_3.4
  FUNC:_ZNKSt5ctypeIcE10do_tolowerEc@@GLIBCXX_3.4
  FUNC:_ZNKSt5ctypeIcE10do_toupperEPcPKc@@GLIBCXX_3.4
*************** FUNC:_ZNKSt7num_putIwSt19ostreambuf_iter
*** 515,520 ****
--- 703,709 ----
  FUNC:_ZNKSt7num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES3_RSt8ios_basewm@@GLIBCXX_3.4
  FUNC:_ZNKSt7num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES3_RSt8ios_basewx@@GLIBCXX_3.4
  FUNC:_ZNKSt7num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES3_RSt8ios_basewy@@GLIBCXX_3.4
+ FUNC:_ZNKSt8bad_cast4whatEv@@GLIBCXX_3.4.9
  FUNC:_ZNKSt8ios_base7failure4whatEv@@GLIBCXX_3.4
  FUNC:_ZNKSt8messagesIcE18_M_convert_to_charERKSs@@GLIBCXX_3.4
  FUNC:_ZNKSt8messagesIcE20_M_convert_from_charEPc@@GLIBCXX_3.4
*************** FUNC:_ZNKSt8time_putIwSt19ostreambuf_ite
*** 591,596 ****
--- 780,786 ----
  FUNC:_ZNKSt8time_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE3putES3_RSt8ios_basewPK2tmcc@@GLIBCXX_3.4
  FUNC:_ZNKSt8time_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES3_RSt8ios_basewPK2tmcc@@GLIBCXX_3.4
  FUNC:_ZNKSt8valarrayIjE4sizeEv@@GLIBCXX_3.4
+ FUNC:_ZNKSt9bad_alloc4whatEv@@GLIBCXX_3.4.9
  FUNC:_ZNKSt9basic_iosIcSt11char_traitsIcEE10exceptionsEv@@GLIBCXX_3.4
  FUNC:_ZNKSt9basic_iosIcSt11char_traitsIcEE3badEv@@GLIBCXX_3.4
  FUNC:_ZNKSt9basic_iosIcSt11char_traitsIcEE3eofEv@@GLIBCXX_3.4
*************** FUNC:_ZNSdC2Ev@@GLIBCXX_3.4
*** 774,779 ****
--- 964,981 ----
  FUNC:_ZNSdD0Ev@@GLIBCXX_3.4
  FUNC:_ZNSdD1Ev@@GLIBCXX_3.4
  FUNC:_ZNSdD2Ev@@GLIBCXX_3.4
+ FUNC:_ZNSi10_M_extractIPvEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIbEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIdEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIeEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIfEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIgEERSiRT_@@GLIBCXX_LDBL_3.4.7
+ FUNC:_ZNSi10_M_extractIjEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIlEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractImEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractItEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIxEERSiRT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSi10_M_extractIyEERSiRT_@@GLIBCXX_3.4.9
  FUNC:_ZNSi3getEPci@@GLIBCXX_3.4
  FUNC:_ZNSi3getEPcic@@GLIBCXX_3.4
  FUNC:_ZNSi3getERSt15basic_streambufIcSt11char_traitsIcEE@@GLIBCXX_3.4
*************** FUNC:_ZNSirsERb@@GLIBCXX_3.4
*** 814,819 ****
--- 1016,1022 ----
  FUNC:_ZNSirsERd@@GLIBCXX_3.4
  FUNC:_ZNSirsERe@@GLIBCXX_3.4
  FUNC:_ZNSirsERf@@GLIBCXX_3.4
+ FUNC:_ZNSirsERg@@GLIBCXX_LDBL_3.4
  FUNC:_ZNSirsERi@@GLIBCXX_3.4
  FUNC:_ZNSirsERj@@GLIBCXX_3.4
  FUNC:_ZNSirsERl@@GLIBCXX_3.4
*************** FUNC:_ZNSo6sentryC2ERSo@@GLIBCXX_3.4
*** 833,838 ****
--- 1036,1050 ----
  FUNC:_ZNSo6sentryD1Ev@@GLIBCXX_3.4
  FUNC:_ZNSo6sentryD2Ev@@GLIBCXX_3.4
  FUNC:_ZNSo8_M_writeEPKci@@GLIBCXX_3.4
+ FUNC:_ZNSo9_M_insertIPKvEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertIbEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertIdEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertIeEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertIgEERSoT_@@GLIBCXX_LDBL_3.4.7
+ FUNC:_ZNSo9_M_insertIlEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertImEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertIxEERSoT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSo9_M_insertIyEERSoT_@@GLIBCXX_3.4.9
  FUNC:_ZNSoC1EPSt15basic_streambufIcSt11char_traitsIcEE@@GLIBCXX_3.4
  FUNC:_ZNSoC1Ev@@GLIBCXX_3.4
  FUNC:_ZNSoC2EPSt15basic_streambufIcSt11char_traitsIcEE@@GLIBCXX_3.4
*************** FUNC:_ZNSolsEb@@GLIBCXX_3.4
*** 849,854 ****
--- 1061,1067 ----
  FUNC:_ZNSolsEd@@GLIBCXX_3.4
  FUNC:_ZNSolsEe@@GLIBCXX_3.4
  FUNC:_ZNSolsEf@@GLIBCXX_3.4
+ FUNC:_ZNSolsEg@@GLIBCXX_LDBL_3.4
  FUNC:_ZNSolsEi@@GLIBCXX_3.4
  FUNC:_ZNSolsEj@@GLIBCXX_3.4
  FUNC:_ZNSolsEl@@GLIBCXX_3.4
*************** FUNC:_ZNSt13basic_fstreamIwSt11char_trai
*** 1206,1211 ****
--- 1419,1436 ----
  FUNC:_ZNSt13basic_fstreamIwSt11char_traitsIwEED0Ev@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_fstreamIwSt11char_traitsIwEED1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_fstreamIwSt11char_traitsIwEED2Ev@@GLIBCXX_3.4
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIPvEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIbEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIdEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIeEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIfEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIgEERS2_RT_@@GLIBCXX_LDBL_3.4.7
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIjEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIlEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractImEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractItEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIxEERS2_RT_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE10_M_extractIyEERS2_RT_@@GLIBCXX_3.4.9
  FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE3getEPwi@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE3getEPwiw@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEE3getERSt15basic_streambufIwS1_E@@GLIBCXX_3.4
*************** FUNC:_ZNSt13basic_istreamIwSt11char_trai
*** 1246,1251 ****
--- 1471,1477 ----
  FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEErsERd@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEErsERe@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEErsERf@@GLIBCXX_3.4
+ FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEErsERg@@GLIBCXX_LDBL_3.4
  FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEErsERi@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEErsERj@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_istreamIwSt11char_traitsIwEErsERl@@GLIBCXX_3.4
*************** FUNC:_ZNSt13basic_ostreamIwSt11char_trai
*** 1265,1270 ****
--- 1491,1505 ----
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE6sentryD1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE6sentryD2Ev@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE8_M_writeEPKwi@@GLIBCXX_3.4
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIPKvEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIbEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIdEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIeEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIgEERS2_T_@@GLIBCXX_LDBL_3.4.7
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIlEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertImEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIxEERS2_T_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEE9_M_insertIyEERS2_T_@@GLIBCXX_3.4.9
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEEC1EPSt15basic_streambufIwS1_E@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEEC1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEEC2EPSt15basic_streambufIwS1_E@@GLIBCXX_3.4
*************** FUNC:_ZNSt13basic_ostreamIwSt11char_trai
*** 1281,1286 ****
--- 1516,1522 ----
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEElsEd@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEElsEe@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEElsEf@@GLIBCXX_3.4
+ FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEElsEg@@GLIBCXX_LDBL_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEElsEi@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEElsEj@@GLIBCXX_3.4
  FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEElsEl@@GLIBCXX_3.4
*************** FUNC:_ZNSt15basic_streambufIcSt11char_tr
*** 1386,1391 ****
--- 1622,1628 ----
  FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE6sbumpcEv@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE6setbufEPci@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE6snextcEv@@GLIBCXX_3.4
+ FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE6stosscEv@@GLIBCXX_3.4.10
  FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE6xsgetnEPci@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE6xsputnEPKci@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIcSt11char_traitsIcEE7pubsyncEv@@GLIBCXX_3.4
*************** FUNC:_ZNSt15basic_streambufIwSt11char_tr
*** 1424,1429 ****
--- 1661,1667 ----
  FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE6sbumpcEv@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE6setbufEPwi@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE6snextcEv@@GLIBCXX_3.4
+ FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE6stosscEv@@GLIBCXX_3.4.10
  FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE6xsgetnEPwi@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE6xsputnEPKwi@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_streambufIwSt11char_traitsIwEE7pubsyncEv@@GLIBCXX_3.4
*************** FUNC:_ZNSt15basic_stringbufIcSt11char_tr
*** 1455,1460 ****
--- 1693,1699 ----
  FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEE7seekposESt4fposI11__mbstate_tESt13_Ios_Openmode@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEE8overflowEi@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEE9pbackfailEi@@GLIBCXX_3.4
+ FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEE9showmanycEv@@GLIBCXX_3.4.6
  FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEE9underflowEv@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ERKSsSt13_Ios_Openmode@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIcSt11char_traitsIcESaIcEEC1ESt13_Ios_Openmode@@GLIBCXX_3.4
*************** FUNC:_ZNSt15basic_stringbufIwSt11char_tr
*** 1471,1476 ****
--- 1710,1716 ----
  FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEE7seekposESt4fposI11__mbstate_tESt13_Ios_Openmode@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEE8overflowEj@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEE9pbackfailEj@@GLIBCXX_3.4
+ FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEE9showmanycEv@@GLIBCXX_3.4.6
  FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEE9underflowEv@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEEC1ERKSbIwS1_S2_ESt13_Ios_Openmode@@GLIBCXX_3.4
  FUNC:_ZNSt15basic_stringbufIwSt11char_traitsIwESaIwEEC1ESt13_Ios_Openmode@@GLIBCXX_3.4
*************** FUNC:_ZNSt16invalid_argumentC1ERKSs@@GLI
*** 1538,1543 ****
--- 1778,1823 ----
  FUNC:_ZNSt16invalid_argumentC2ERKSs@@GLIBCXX_3.4
  FUNC:_ZNSt16invalid_argumentD0Ev@@GLIBCXX_3.4
  FUNC:_ZNSt16invalid_argumentD1Ev@@GLIBCXX_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEC1Ej@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEC2Ej@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEED0Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEED1Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEED2Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEC1Ej@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEC2Ej@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEED0Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEED1Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEED2Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEC1Ej@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEC2Ej@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEED0Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEED1Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEED2Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEC1Ej@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEC2Ej@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEED0Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEED1Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEED2Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEC1Ej@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEC2Ej@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEED0Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEED1Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEED2Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEC1Ej@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEC2Ej@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEED0Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEED1Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEED2Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEC1Ej@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEC2Ej@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEED0Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEED1Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEED2Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEC1Ej@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEC2Ej@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEED0Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEED1Ev@@GLIBCXX_LDBL_3.4
+ FUNC:_ZNSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEED2Ev@@GLIBCXX_LDBL_3.4
  FUNC:_ZNSt17__timepunct_cacheIcEC1Ej@@GLIBCXX_3.4
  FUNC:_ZNSt17__timepunct_cacheIcEC2Ej@@GLIBCXX_3.4
  FUNC:_ZNSt17__timepunct_cacheIcED0Ev@@GLIBCXX_3.4
*************** FUNC:_ZNSt5ctypeIwEC2Ej@@GLIBCXX_3.4
*** 1660,1669 ****
--- 1940,1955 ----
  FUNC:_ZNSt5ctypeIwED0Ev@@GLIBCXX_3.4
  FUNC:_ZNSt5ctypeIwED1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt5ctypeIwED2Ev@@GLIBCXX_3.4
+ FUNC:_ZNSt6__norm15_List_node_base4hookEPS0_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt6__norm15_List_node_base4swapERS0_S1_@@GLIBCXX_3.4.9
+ FUNC:_ZNSt6__norm15_List_node_base6unhookEv@@GLIBCXX_3.4.9
+ FUNC:_ZNSt6__norm15_List_node_base7reverseEv@@GLIBCXX_3.4.9
+ FUNC:_ZNSt6__norm15_List_node_base8transferEPS0_S1_@@GLIBCXX_3.4.9
  FUNC:_ZNSt6gslice8_IndexerC1EjRKSt8valarrayIjES4_@@GLIBCXX_3.4
  FUNC:_ZNSt6gslice8_IndexerC2EjRKSt8valarrayIjES4_@@GLIBCXX_3.4
  FUNC:_ZNSt6locale11_M_coalesceERKS_S1_i@@GLIBCXX_3.4
  FUNC:_ZNSt6locale21_S_normalize_categoryEi@@GLIBCXX_3.4
+ FUNC:_ZNSt6locale5_Impl16_M_install_cacheEPKNS_5facetEj@@GLIBCXX_3.4.7
  FUNC:_ZNSt6locale5_Impl16_M_install_facetEPKNS_2idEPKNS_5facetE@@GLIBCXX_3.4
  FUNC:_ZNSt6locale5_Impl16_M_replace_facetEPKS0_PKNS_2idE@@GLIBCXX_3.4
  FUNC:_ZNSt6locale5_Impl19_M_replace_categoryEPKS0_PKPKNS_2idE@@GLIBCXX_3.4
*************** FUNC:_ZNSt6locale5_ImplC2ERKS0_j@@GLIBCX
*** 1676,1681 ****
--- 1962,1968 ----
  FUNC:_ZNSt6locale5_ImplC2Ej@@GLIBCXX_3.4
  FUNC:_ZNSt6locale5_ImplD1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt6locale5_ImplD2Ev@@GLIBCXX_3.4
+ FUNC:_ZNSt6locale5facet13_S_get_c_nameEv@@GLIBCXX_3.4.6
  FUNC:_ZNSt6locale5facet15_S_get_c_localeEv@@GLIBCXX_3.4
  FUNC:_ZNSt6locale5facet17_S_clone_c_localeERP15__locale_struct@@GLIBCXX_3.4
  FUNC:_ZNSt6locale5facet18_S_create_c_localeERP15__locale_structPKcS2_@@GLIBCXX_3.4
*************** FUNC:_ZNSt8bad_castD1Ev@@GLIBCXX_3.4
*** 1753,1759 ****
--- 2040,2048 ----
  FUNC:_ZNSt8bad_castD2Ev@@GLIBCXX_3.4
  FUNC:_ZNSt8ios_base13_M_grow_wordsEib@@GLIBCXX_3.4
  FUNC:_ZNSt8ios_base15sync_with_stdioEb@@GLIBCXX_3.4
+ FUNC:_ZNSt8ios_base17_M_call_callbacksENS_5eventE@@GLIBCXX_3.4.6
  FUNC:_ZNSt8ios_base17register_callbackEPFvNS_5eventERS_iEi@@GLIBCXX_3.4
+ FUNC:_ZNSt8ios_base20_M_dispose_callbacksEv@@GLIBCXX_3.4.6
  FUNC:_ZNSt8ios_base4InitC1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt8ios_base4InitC2Ev@@GLIBCXX_3.4
  FUNC:_ZNSt8ios_base4InitD1Ev@@GLIBCXX_3.4
*************** FUNC:_ZNSt8valarrayIjEC2Ej@@GLIBCXX_3.4
*** 1832,1837 ****
--- 2121,2131 ----
  FUNC:_ZNSt8valarrayIjED1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt8valarrayIjED2Ev@@GLIBCXX_3.4
  FUNC:_ZNSt8valarrayIjEixEj@@GLIBCXX_3.4
+ FUNC:_ZNSt9__cxx199815_List_node_base4hookEPS0_@@GLIBCXX_3.4.10
+ FUNC:_ZNSt9__cxx199815_List_node_base4swapERS0_S1_@@GLIBCXX_3.4.10
+ FUNC:_ZNSt9__cxx199815_List_node_base6unhookEv@@GLIBCXX_3.4.10
+ FUNC:_ZNSt9__cxx199815_List_node_base7reverseEv@@GLIBCXX_3.4.10
+ FUNC:_ZNSt9__cxx199815_List_node_base8transferEPS0_S1_@@GLIBCXX_3.4.10
  FUNC:_ZNSt9bad_allocD0Ev@@GLIBCXX_3.4
  FUNC:_ZNSt9bad_allocD1Ev@@GLIBCXX_3.4
  FUNC:_ZNSt9bad_allocD2Ev@@GLIBCXX_3.4
*************** FUNC:_ZSt13set_terminatePFvvE@@GLIBCXX_3
*** 1911,1920 ****
--- 2205,2220 ----
  FUNC:_ZSt14__convert_to_vIdEvPKcRT_RSt12_Ios_IostateRKP15__locale_struct@@GLIBCXX_3.4
  FUNC:_ZSt14__convert_to_vIeEvPKcRT_RSt12_Ios_IostateRKP15__locale_struct@@GLIBCXX_3.4
  FUNC:_ZSt14__convert_to_vIfEvPKcRT_RSt12_Ios_IostateRKP15__locale_struct@@GLIBCXX_3.4
+ FUNC:_ZSt14__convert_to_vIgEvPKcRT_RSt12_Ios_IostateRKP15__locale_struct@@GLIBCXX_LDBL_3.4
  FUNC:_ZSt14set_unexpectedPFvvE@@GLIBCXX_3.4
  FUNC:_ZSt15set_new_handlerPFvvE@@GLIBCXX_3.4
+ FUNC:_ZSt16__ostream_insertIcSt11char_traitsIcEERSt13basic_ostreamIT_T0_ES6_PKS3_i@@GLIBCXX_3.4.9
+ FUNC:_ZSt16__ostream_insertIwSt11char_traitsIwEERSt13basic_ostreamIT_T0_ES6_PKS3_i@@GLIBCXX_3.4.9
  FUNC:_ZSt16__throw_bad_castv@@GLIBCXX_3.4
+ FUNC:_ZSt17__copy_streambufsIcSt11char_traitsIcEEiPSt15basic_streambufIT_T0_ES6_@@GLIBCXX_3.4.6
+ FUNC:_ZSt17__copy_streambufsIwSt11char_traitsIwEEiPSt15basic_streambufIT_T0_ES6_@@GLIBCXX_3.4.6
  FUNC:_ZSt17__throw_bad_allocv@@GLIBCXX_3.4
+ FUNC:_ZSt17__verify_groupingPKcjRKSs@@GLIBCXX_3.4.10
  FUNC:_ZSt18_Rb_tree_decrementPKSt18_Rb_tree_node_base@@GLIBCXX_3.4
  FUNC:_ZSt18_Rb_tree_decrementPSt18_Rb_tree_node_base@@GLIBCXX_3.4
  FUNC:_ZSt18_Rb_tree_incrementPKSt18_Rb_tree_node_base@@GLIBCXX_3.4
*************** FUNC:_ZSt20__throw_domain_errorPKc@@GLIB
*** 1930,1935 ****
--- 2230,2237 ----
  FUNC:_ZSt20__throw_length_errorPKc@@GLIBCXX_3.4
  FUNC:_ZSt20__throw_out_of_rangePKc@@GLIBCXX_3.4
  FUNC:_ZSt21_Rb_tree_rotate_rightPSt18_Rb_tree_node_baseRS0_@@GLIBCXX_3.4
+ FUNC:_ZSt21__copy_streambufs_eofIcSt11char_traitsIcEEiPSt15basic_streambufIT_T0_ES6_Rb@@GLIBCXX_3.4.9
+ FUNC:_ZSt21__copy_streambufs_eofIwSt11char_traitsIwEEiPSt15basic_streambufIT_T0_ES6_Rb@@GLIBCXX_3.4.9
  FUNC:_ZSt21__throw_bad_exceptionv@@GLIBCXX_3.4
  FUNC:_ZSt21__throw_runtime_errorPKc@@GLIBCXX_3.4
  FUNC:_ZSt22__throw_overflow_errorPKc@@GLIBCXX_3.4
*************** FUNC:_ZSt7getlineIcSt11char_traitsIcESaI
*** 1949,1954 ****
--- 2251,2264 ----
  FUNC:_ZSt7getlineIcSt11char_traitsIcESaIcEERSt13basic_istreamIT_T0_ES7_RSbIS4_S5_T1_ES4_@@GLIBCXX_3.4
  FUNC:_ZSt7getlineIwSt11char_traitsIwESaIwEERSt13basic_istreamIT_T0_ES7_RSbIS4_S5_T1_E@@GLIBCXX_3.4
  FUNC:_ZSt7getlineIwSt11char_traitsIwESaIwEERSt13basic_istreamIT_T0_ES7_RSbIS4_S5_T1_ES4_@@GLIBCXX_3.4
+ FUNC:_ZSt9has_facetINSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEEEbRKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9has_facetINSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEEEbRKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9has_facetINSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEEEbRKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9has_facetINSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEEEbRKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9has_facetINSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEEEbRKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9has_facetINSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEEEbRKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9has_facetINSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEEEbRKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9has_facetINSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEEEbRKSt6locale@@GLIBCXX_LDBL_3.4
  FUNC:_ZSt9has_facetISt10moneypunctIcLb0EEEbRKSt6locale@@GLIBCXX_3.4
  FUNC:_ZSt9has_facetISt10moneypunctIwLb0EEEbRKSt6locale@@GLIBCXX_3.4
  FUNC:_ZSt9has_facetISt11__timepunctIcEEbRKSt6locale@@GLIBCXX_3.4
*************** FUNC:_ZSt9has_facetISt9money_getIwSt19is
*** 1976,1981 ****
--- 2286,2299 ----
  FUNC:_ZSt9has_facetISt9money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEEbRKSt6locale@@GLIBCXX_3.4
  FUNC:_ZSt9has_facetISt9money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEEbRKSt6locale@@GLIBCXX_3.4
  FUNC:_ZSt9terminatev@@GLIBCXX_3.4
+ FUNC:_ZSt9use_facetINSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEEERKT_RKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9use_facetINSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEEERKT_RKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9use_facetINSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEEERKT_RKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9use_facetINSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEEERKT_RKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9use_facetINSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEEERKT_RKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9use_facetINSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEEERKT_RKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9use_facetINSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEEERKT_RKSt6locale@@GLIBCXX_LDBL_3.4
+ FUNC:_ZSt9use_facetINSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEEERKT_RKSt6locale@@GLIBCXX_LDBL_3.4
  FUNC:_ZSt9use_facetISt10moneypunctIcLb0EEERKT_RKSt6locale@@GLIBCXX_3.4
  FUNC:_ZSt9use_facetISt10moneypunctIcLb1EEERKT_RKSt6locale@@GLIBCXX_3.4
  FUNC:_ZSt9use_facetISt10moneypunctIwLb0EEERKT_RKSt6locale@@GLIBCXX_3.4
*************** FUNC:_ZStlsIecSt11char_traitsIcEERSt13ba
*** 2023,2028 ****
--- 2341,2348 ----
  FUNC:_ZStlsIewSt11char_traitsIwEERSt13basic_ostreamIT0_T1_ES6_RKSt7complexIT_E@@GLIBCXX_3.4
  FUNC:_ZStlsIfcSt11char_traitsIcEERSt13basic_ostreamIT0_T1_ES6_RKSt7complexIT_E@@GLIBCXX_3.4
  FUNC:_ZStlsIfwSt11char_traitsIwEERSt13basic_ostreamIT0_T1_ES6_RKSt7complexIT_E@@GLIBCXX_3.4
+ FUNC:_ZStlsIgcSt11char_traitsIcEERSt13basic_ostreamIT0_T1_ES6_RKSt7complexIT_E@@GLIBCXX_LDBL_3.4
+ FUNC:_ZStlsIgwSt11char_traitsIwEERSt13basic_ostreamIT0_T1_ES6_RKSt7complexIT_E@@GLIBCXX_LDBL_3.4
  FUNC:_ZStlsIwSt11char_traitsIwEERSt13basic_ostreamIT_T0_ES6_PKS3_@@GLIBCXX_3.4
  FUNC:_ZStlsIwSt11char_traitsIwEERSt13basic_ostreamIT_T0_ES6_PKc@@GLIBCXX_3.4
  FUNC:_ZStlsIwSt11char_traitsIwEERSt13basic_ostreamIT_T0_ES6_S3_@@GLIBCXX_3.4
*************** FUNC:_ZStrsIecSt11char_traitsIcEERSt13ba
*** 2059,2064 ****
--- 2379,2386 ----
  FUNC:_ZStrsIewSt11char_traitsIwEERSt13basic_istreamIT0_T1_ES6_RSt7complexIT_E@@GLIBCXX_3.4
  FUNC:_ZStrsIfcSt11char_traitsIcEERSt13basic_istreamIT0_T1_ES6_RSt7complexIT_E@@GLIBCXX_3.4
  FUNC:_ZStrsIfwSt11char_traitsIwEERSt13basic_istreamIT0_T1_ES6_RSt7complexIT_E@@GLIBCXX_3.4
+ FUNC:_ZStrsIgcSt11char_traitsIcEERSt13basic_istreamIT0_T1_ES6_RSt7complexIT_E@@GLIBCXX_LDBL_3.4
+ FUNC:_ZStrsIgwSt11char_traitsIwEERSt13basic_istreamIT0_T1_ES6_RSt7complexIT_E@@GLIBCXX_LDBL_3.4
  FUNC:_ZStrsIwSt11char_traitsIwEERSt13basic_istreamIT_T0_ES6_PS3_@@GLIBCXX_3.4
  FUNC:_ZStrsIwSt11char_traitsIwEERSt13basic_istreamIT_T0_ES6_RS3_@@GLIBCXX_3.4
  FUNC:_ZStrsIwSt11char_traitsIwEERSt13basic_istreamIT_T0_ES6_St12_Setiosflags@@GLIBCXX_3.4
*************** FUNC:__cxa_vec_new3@@CXXABI_1.3
*** 2162,2197 ****
  FUNC:__cxa_vec_new@@CXXABI_1.3
  FUNC:__dynamic_cast@@CXXABI_1.3
  FUNC:__gxx_personality_v0@@CXXABI_1.3
! FUNC:acosl@@GLIBCXX_3.4.3
! FUNC:asinl@@GLIBCXX_3.4.3
! FUNC:atan2l@@GLIBCXX_3.4
! FUNC:atanl@@GLIBCXX_3.4.3
! FUNC:ceill@@GLIBCXX_3.4.3
! FUNC:coshl@@GLIBCXX_3.4
! FUNC:cosl@@GLIBCXX_3.4
! FUNC:expl@@GLIBCXX_3.4
! FUNC:floorl@@GLIBCXX_3.4.3
! FUNC:fmodl@@GLIBCXX_3.4.3
! FUNC:frexpl@@GLIBCXX_3.4.3
! FUNC:hypotl@@GLIBCXX_3.4
! FUNC:ldexpl@@GLIBCXX_3.4.3
! FUNC:log10l@@GLIBCXX_3.4
! FUNC:logl@@GLIBCXX_3.4
! FUNC:modfl@@GLIBCXX_3.4.3
! FUNC:powl@@GLIBCXX_3.4
! FUNC:sinhl@@GLIBCXX_3.4
! FUNC:sinl@@GLIBCXX_3.4
! FUNC:sqrtl@@GLIBCXX_3.4
! FUNC:tanhl@@GLIBCXX_3.4
! FUNC:tanl@@GLIBCXX_3.4
  OBJECT:0:CXXABI_1.3
  OBJECT:0:CXXABI_1.3.1
  OBJECT:0:GLIBCXX_3.4
  OBJECT:0:GLIBCXX_3.4.1
  OBJECT:0:GLIBCXX_3.4.2
  OBJECT:0:GLIBCXX_3.4.3
  OBJECT:0:GLIBCXX_3.4.4
  OBJECT:0:GLIBCXX_3.4.5
  OBJECT:12:_ZTIN10__cxxabiv116__enum_type_infoE@@CXXABI_1.3
  OBJECT:12:_ZTIN10__cxxabiv117__array_type_infoE@@CXXABI_1.3
  OBJECT:12:_ZTIN10__cxxabiv117__class_type_infoE@@CXXABI_1.3
--- 2484,2531 ----
  FUNC:__cxa_vec_new@@CXXABI_1.3
  FUNC:__dynamic_cast@@CXXABI_1.3
  FUNC:__gxx_personality_v0@@CXXABI_1.3
! FUNC:acosl@GLIBCXX_3.4.3
! FUNC:asinl@GLIBCXX_3.4.3
! FUNC:atan2l@GLIBCXX_3.4
! FUNC:atanl@GLIBCXX_3.4.3
! FUNC:ceill@GLIBCXX_3.4.3
! FUNC:coshl@GLIBCXX_3.4
! FUNC:cosl@GLIBCXX_3.4
! FUNC:expl@GLIBCXX_3.4
! FUNC:floorl@GLIBCXX_3.4.3
! FUNC:fmodl@GLIBCXX_3.4.3
! FUNC:frexpl@GLIBCXX_3.4.3
! FUNC:hypotl@GLIBCXX_3.4
! FUNC:ldexpl@GLIBCXX_3.4.3
! FUNC:log10l@GLIBCXX_3.4
! FUNC:logl@GLIBCXX_3.4
! FUNC:modfl@GLIBCXX_3.4.3
! FUNC:powl@GLIBCXX_3.4
! FUNC:sinhl@GLIBCXX_3.4
! FUNC:sinl@GLIBCXX_3.4
! FUNC:sqrtl@GLIBCXX_3.4
! FUNC:tanhl@GLIBCXX_3.4
! FUNC:tanl@GLIBCXX_3.4
  OBJECT:0:CXXABI_1.3
  OBJECT:0:CXXABI_1.3.1
+ OBJECT:0:CXXABI_1.3.2
+ OBJECT:0:CXXABI_LDBL_1.3
  OBJECT:0:GLIBCXX_3.4
  OBJECT:0:GLIBCXX_3.4.1
+ OBJECT:0:GLIBCXX_3.4.10
  OBJECT:0:GLIBCXX_3.4.2
  OBJECT:0:GLIBCXX_3.4.3
  OBJECT:0:GLIBCXX_3.4.4
  OBJECT:0:GLIBCXX_3.4.5
+ OBJECT:0:GLIBCXX_3.4.6
+ OBJECT:0:GLIBCXX_3.4.7
+ OBJECT:0:GLIBCXX_3.4.8
+ OBJECT:0:GLIBCXX_3.4.9
+ OBJECT:0:GLIBCXX_LDBL_3.4
+ OBJECT:0:GLIBCXX_LDBL_3.4.10
+ OBJECT:0:GLIBCXX_LDBL_3.4.7
+ OBJECT:1028:_ZNSt3tr18__detail12__prime_listE@@GLIBCXX_3.4.10
+ OBJECT:1028:_ZNSt8__detail12__prime_listE@@GLIBCXX_3.4.10
  OBJECT:12:_ZTIN10__cxxabiv116__enum_type_infoE@@CXXABI_1.3
  OBJECT:12:_ZTIN10__cxxabiv117__array_type_infoE@@CXXABI_1.3
  OBJECT:12:_ZTIN10__cxxabiv117__class_type_infoE@@CXXABI_1.3
*************** OBJECT:12:_ZTIN9__gnu_cxx13stdio_filebuf
*** 2206,2211 ****
--- 2540,2553 ----
  OBJECT:12:_ZTIN9__gnu_cxx13stdio_filebufIwSt11char_traitsIwEEE@@GLIBCXX_3.4
  OBJECT:12:_ZTIN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEEE@@GLIBCXX_3.4
  OBJECT:12:_ZTIN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEEE@@GLIBCXX_3.4
+ OBJECT:12:_ZTINSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:12:_ZTINSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:12:_ZTINSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:12:_ZTINSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:12:_ZTINSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:12:_ZTINSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:12:_ZTINSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:12:_ZTINSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEE@@GLIBCXX_LDBL_3.4
  OBJECT:12:_ZTINSt8ios_base7failureE@@GLIBCXX_3.4
  OBJECT:12:_ZTISt10bad_typeid@@GLIBCXX_3.4
  OBJECT:12:_ZTISt10istrstream@@GLIBCXX_3.4
*************** OBJECT:16:_ZTIPKc@@CXXABI_1.3
*** 2315,2320 ****
--- 2657,2663 ----
  OBJECT:16:_ZTIPKd@@CXXABI_1.3
  OBJECT:16:_ZTIPKe@@CXXABI_1.3
  OBJECT:16:_ZTIPKf@@CXXABI_1.3
+ OBJECT:16:_ZTIPKg@@CXXABI_LDBL_1.3
  OBJECT:16:_ZTIPKh@@CXXABI_1.3
  OBJECT:16:_ZTIPKi@@CXXABI_1.3
  OBJECT:16:_ZTIPKj@@CXXABI_1.3
*************** OBJECT:16:_ZTIPc@@CXXABI_1.3
*** 2332,2337 ****
--- 2675,2681 ----
  OBJECT:16:_ZTIPd@@CXXABI_1.3
  OBJECT:16:_ZTIPe@@CXXABI_1.3
  OBJECT:16:_ZTIPf@@CXXABI_1.3
+ OBJECT:16:_ZTIPg@@CXXABI_LDBL_1.3
  OBJECT:16:_ZTIPh@@CXXABI_1.3
  OBJECT:16:_ZTIPi@@CXXABI_1.3
  OBJECT:16:_ZTIPj@@CXXABI_1.3
*************** OBJECT:1:_ZNSt14numeric_limitsIfE8is_exa
*** 2456,2461 ****
--- 2800,2818 ----
  OBJECT:1:_ZNSt14numeric_limitsIfE9is_iec559E@@GLIBCXX_3.4
  OBJECT:1:_ZNSt14numeric_limitsIfE9is_moduloE@@GLIBCXX_3.4
  OBJECT:1:_ZNSt14numeric_limitsIfE9is_signedE@@GLIBCXX_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE10is_boundedE@@GLIBCXX_LDBL_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE10is_integerE@@GLIBCXX_LDBL_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE12has_infinityE@@GLIBCXX_LDBL_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE13has_quiet_NaNE@@GLIBCXX_LDBL_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE14is_specializedE@@GLIBCXX_LDBL_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE15has_denorm_lossE@@GLIBCXX_LDBL_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE15tinyness_beforeE@@GLIBCXX_LDBL_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE17has_signaling_NaNE@@GLIBCXX_LDBL_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE5trapsE@@GLIBCXX_LDBL_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE8is_exactE@@GLIBCXX_LDBL_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE9is_iec559E@@GLIBCXX_LDBL_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE9is_moduloE@@GLIBCXX_LDBL_3.4
+ OBJECT:1:_ZNSt14numeric_limitsIgE9is_signedE@@GLIBCXX_LDBL_3.4
  OBJECT:1:_ZNSt14numeric_limitsIhE10is_boundedE@@GLIBCXX_3.4
  OBJECT:1:_ZNSt14numeric_limitsIhE10is_integerE@@GLIBCXX_3.4
  OBJECT:1:_ZNSt14numeric_limitsIhE12has_infinityE@@GLIBCXX_3.4
*************** OBJECT:28:_ZTSSt7codecvtIcc11__mbstate_t
*** 2650,2655 ****
--- 3007,3016 ----
  OBJECT:28:_ZTSSt7codecvtIwc11__mbstate_tE@@GLIBCXX_3.4
  OBJECT:28:_ZTTSd@@GLIBCXX_3.4
  OBJECT:28:_ZTTSt14basic_iostreamIwSt11char_traitsIwEE@@GLIBCXX_3.4
+ OBJECT:28:_ZTVNSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:28:_ZTVNSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:28:_ZTVNSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:28:_ZTVNSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEE@@GLIBCXX_LDBL_3.4
  OBJECT:28:_ZTVSt14collate_bynameIcE@@GLIBCXX_3.4
  OBJECT:28:_ZTVSt14collate_bynameIwE@@GLIBCXX_3.4
  OBJECT:28:_ZTVSt15messages_bynameIcE@@GLIBCXX_3.4
*************** OBJECT:2:_ZTSc@@CXXABI_1.3
*** 2681,2686 ****
--- 3042,3048 ----
  OBJECT:2:_ZTSd@@CXXABI_1.3
  OBJECT:2:_ZTSe@@CXXABI_1.3
  OBJECT:2:_ZTSf@@CXXABI_1.3
+ OBJECT:2:_ZTSg@@CXXABI_LDBL_1.3
  OBJECT:2:_ZTSh@@CXXABI_1.3
  OBJECT:2:_ZTSi@@CXXABI_1.3
  OBJECT:2:_ZTSj@@CXXABI_1.3
*************** OBJECT:3:_ZTSPc@@CXXABI_1.3
*** 2743,2748 ****
--- 3105,3111 ----
  OBJECT:3:_ZTSPd@@CXXABI_1.3
  OBJECT:3:_ZTSPe@@CXXABI_1.3
  OBJECT:3:_ZTSPf@@CXXABI_1.3
+ OBJECT:3:_ZTSPg@@CXXABI_LDBL_1.3
  OBJECT:3:_ZTSPh@@CXXABI_1.3
  OBJECT:3:_ZTSPi@@CXXABI_1.3
  OBJECT:3:_ZTSPj@@CXXABI_1.3
*************** OBJECT:4:_ZNSt14numeric_limitsIfE14min_e
*** 2879,2884 ****
--- 3242,3256 ----
  OBJECT:4:_ZNSt14numeric_limitsIfE5radixE@@GLIBCXX_3.4
  OBJECT:4:_ZNSt14numeric_limitsIfE6digitsE@@GLIBCXX_3.4
  OBJECT:4:_ZNSt14numeric_limitsIfE8digits10E@@GLIBCXX_3.4
+ OBJECT:4:_ZNSt14numeric_limitsIgE10has_denormE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt14numeric_limitsIgE11round_styleE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt14numeric_limitsIgE12max_exponentE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt14numeric_limitsIgE12min_exponentE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt14numeric_limitsIgE14max_exponent10E@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt14numeric_limitsIgE14min_exponent10E@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt14numeric_limitsIgE5radixE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt14numeric_limitsIgE6digitsE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt14numeric_limitsIgE8digits10E@@GLIBCXX_LDBL_3.4
  OBJECT:4:_ZNSt14numeric_limitsIhE10has_denormE@@GLIBCXX_3.4
  OBJECT:4:_ZNSt14numeric_limitsIhE11round_styleE@@GLIBCXX_3.4
  OBJECT:4:_ZNSt14numeric_limitsIhE12max_exponentE@@GLIBCXX_3.4
*************** OBJECT:4:_ZNSt14numeric_limitsIyE14min_e
*** 2969,2974 ****
--- 3341,3354 ----
  OBJECT:4:_ZNSt14numeric_limitsIyE5radixE@@GLIBCXX_3.4
  OBJECT:4:_ZNSt14numeric_limitsIyE6digitsE@@GLIBCXX_3.4
  OBJECT:4:_ZNSt14numeric_limitsIyE8digits10E@@GLIBCXX_3.4
+ OBJECT:4:_ZNSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:4:_ZNSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE2idE@@GLIBCXX_LDBL_3.4
  OBJECT:4:_ZNSt21__numeric_limits_base10has_denormE@@GLIBCXX_3.4
  OBJECT:4:_ZNSt21__numeric_limits_base11round_styleE@@GLIBCXX_3.4
  OBJECT:4:_ZNSt21__numeric_limits_base12max_exponentE@@GLIBCXX_3.4
*************** OBJECT:4:_ZTSPKc@@CXXABI_1.3
*** 3046,3051 ****
--- 3426,3432 ----
  OBJECT:4:_ZTSPKd@@CXXABI_1.3
  OBJECT:4:_ZTSPKe@@CXXABI_1.3
  OBJECT:4:_ZTSPKf@@CXXABI_1.3
+ OBJECT:4:_ZTSPKg@@CXXABI_LDBL_1.3
  OBJECT:4:_ZTSPKh@@CXXABI_1.3
  OBJECT:4:_ZTSPKi@@CXXABI_1.3
  OBJECT:4:_ZTSPKj@@CXXABI_1.3
*************** OBJECT:50:_ZTSSt19basic_istringstreamIcS
*** 3061,3066 ****
--- 3442,3449 ----
  OBJECT:50:_ZTSSt19basic_istringstreamIwSt11char_traitsIwESaIwEE@@GLIBCXX_3.4
  OBJECT:50:_ZTSSt19basic_ostringstreamIcSt11char_traitsIcESaIcEE@@GLIBCXX_3.4
  OBJECT:50:_ZTSSt19basic_ostringstreamIwSt11char_traitsIwESaIwEE@@GLIBCXX_3.4
+ OBJECT:52:_ZTVNSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:52:_ZTVNSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEE@@GLIBCXX_LDBL_3.4
  OBJECT:52:_ZTVSt10moneypunctIcLb0EE@@GLIBCXX_3.4
  OBJECT:52:_ZTVSt10moneypunctIcLb1EE@@GLIBCXX_3.4
  OBJECT:52:_ZTVSt10moneypunctIwLb0EE@@GLIBCXX_3.4
*************** OBJECT:60:_ZTVSt7num_getIwSt19istreambuf
*** 3096,3101 ****
--- 3479,3486 ----
  OBJECT:60:_ZTVSt9strstream@@GLIBCXX_3.4
  OBJECT:64:_ZTVN9__gnu_cxx18stdio_sync_filebufIcSt11char_traitsIcEEE@@GLIBCXX_3.4
  OBJECT:64:_ZTVN9__gnu_cxx18stdio_sync_filebufIwSt11char_traitsIwEEE@@GLIBCXX_3.4
+ OBJECT:64:_ZTVNSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:64:_ZTVNSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEE@@GLIBCXX_LDBL_3.4
  OBJECT:64:_ZTVSt12ctype_bynameIwE@@GLIBCXX_3.4
  OBJECT:64:_ZTVSt12strstreambuf@@GLIBCXX_3.4
  OBJECT:64:_ZTVSt13basic_filebufIcSt11char_traitsIcEE@@GLIBCXX_3.4
*************** OBJECT:67:_ZTSSt15time_get_bynameIcSt19i
*** 3111,3122 ****
--- 3496,3523 ----
  OBJECT:67:_ZTSSt15time_get_bynameIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE@@GLIBCXX_3.4
  OBJECT:67:_ZTSSt15time_put_bynameIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE@@GLIBCXX_3.4
  OBJECT:67:_ZTSSt15time_put_bynameIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE@@GLIBCXX_3.4
+ OBJECT:79:_ZTSNSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:79:_ZTSNSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:79:_ZTSNSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:79:_ZTSNSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:81:_ZTSNSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:81:_ZTSNSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:81:_ZTSNSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEEE@@GLIBCXX_LDBL_3.4
+ OBJECT:81:_ZTSNSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEEE@@GLIBCXX_LDBL_3.4
  OBJECT:8:_ZGVNSt10moneypunctIcLb0EE2idE@@GLIBCXX_3.4
  OBJECT:8:_ZGVNSt10moneypunctIcLb1EE2idE@@GLIBCXX_3.4
  OBJECT:8:_ZGVNSt10moneypunctIwLb0EE2idE@@GLIBCXX_3.4
  OBJECT:8:_ZGVNSt10moneypunctIwLb1EE2idE@@GLIBCXX_3.4
  OBJECT:8:_ZGVNSt11__timepunctIcE2idE@@GLIBCXX_3.4
  OBJECT:8:_ZGVNSt11__timepunctIwE2idE@@GLIBCXX_3.4
+ OBJECT:8:_ZGVNSt17__gnu_cxx_ldbl1287num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:8:_ZGVNSt17__gnu_cxx_ldbl1287num_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:8:_ZGVNSt17__gnu_cxx_ldbl1287num_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:8:_ZGVNSt17__gnu_cxx_ldbl1287num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:8:_ZGVNSt17__gnu_cxx_ldbl1289money_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:8:_ZGVNSt17__gnu_cxx_ldbl1289money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:8:_ZGVNSt17__gnu_cxx_ldbl1289money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE2idE@@GLIBCXX_LDBL_3.4
+ OBJECT:8:_ZGVNSt17__gnu_cxx_ldbl1289money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE2idE@@GLIBCXX_LDBL_3.4
  OBJECT:8:_ZGVNSt7collateIcE2idE@@GLIBCXX_3.4
  OBJECT:8:_ZGVNSt7collateIwE2idE@@GLIBCXX_3.4
  OBJECT:8:_ZGVNSt7num_getIcSt19istreambuf_iteratorIcSt11char_traitsIcEEE2idE@@GLIBCXX_3.4
*************** OBJECT:8:_ZGVNSt9money_getIcSt19istreamb
*** 3135,3140 ****
--- 3536,3543 ----
  OBJECT:8:_ZGVNSt9money_getIwSt19istreambuf_iteratorIwSt11char_traitsIwEEE2idE@@GLIBCXX_3.4
  OBJECT:8:_ZGVNSt9money_putIcSt19ostreambuf_iteratorIcSt11char_traitsIcEEE2idE@@GLIBCXX_3.4
  OBJECT:8:_ZGVNSt9money_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE2idE@@GLIBCXX_3.4
+ OBJECT:8:_ZTIN10__cxxabiv115__forced_unwindE@@CXXABI_1.3.2
+ OBJECT:8:_ZTIN10__cxxabiv119__foreign_exceptionE@@CXXABI_1.3.2
  OBJECT:8:_ZTINSt6locale5facetE@@GLIBCXX_3.4
  OBJECT:8:_ZTISt10ctype_base@@GLIBCXX_3.4
  OBJECT:8:_ZTISt10money_base@@GLIBCXX_3.4
*************** OBJECT:8:_ZTIc@@CXXABI_1.3
*** 3152,3157 ****
--- 3555,3561 ----
  OBJECT:8:_ZTId@@CXXABI_1.3
  OBJECT:8:_ZTIe@@CXXABI_1.3
  OBJECT:8:_ZTIf@@CXXABI_1.3
+ OBJECT:8:_ZTIg@@CXXABI_LDBL_1.3
  OBJECT:8:_ZTIh@@CXXABI_1.3
  OBJECT:8:_ZTIi@@CXXABI_1.3
  OBJECT:8:_ZTIj@@CXXABI_1.3
diff -Nrcpad gcc-4.3.0/libstdc++-v3/configure gcc-4.3.1/libstdc++-v3/configure
*** gcc-4.3.0/libstdc++-v3/configure	Fri Feb 29 00:00:39 2008
--- gcc-4.3.1/libstdc++-v3/configure	Fri Apr 25 16:52:57 2008
*************** int main()
*** 17030,17036 ****
  }
  EOF
      old_CXXFLAGS="$CXXFLAGS"
!     CXXFLAGS=-S
      if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5
    (eval $ac_compile) 2>&5
    ac_status=$?
--- 17030,17036 ----
  }
  EOF
      old_CXXFLAGS="$CXXFLAGS"
!     CXXFLAGS='-O0 -S'
      if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5
    (eval $ac_compile) 2>&5
    ac_status=$?
*************** _ACEOF
*** 17048,17053 ****
--- 17048,17055 ----
  	atomicity_dir=cpu/generic/atomicity_builtins
        fi
      fi
+     echo "$as_me:$LINENO: result: $enable_atomic_builtins" >&5
+ echo "${ECHO_T}$enable_atomic_builtins" >&6
      CXXFLAGS="$old_CXXFLAGS"
      rm -f conftest*
  
*************** ac_compile='$CC -c $CFLAGS $CPPFLAGS con
*** 17061,17068 ****
  ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
  ac_compiler_gnu=$ac_cv_c_compiler_gnu
  
-  echo "$as_me:$LINENO: result: $enable_atomic_builtins" >&5
- echo "${ECHO_T}$enable_atomic_builtins" >&6
  
  if test $atomicity_dir = cpu/generic/atomicity_mutex ; then
    { echo "$as_me:$LINENO: WARNING: No native atomic operations are provided for this platform." >&5
--- 17063,17068 ----
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/Makefile.am gcc-4.3.1/libstdc++-v3/doc/Makefile.am
*** gcc-4.3.0/libstdc++-v3/doc/Makefile.am	Tue Feb 12 02:10:57 2008
--- gcc-4.3.1/libstdc++-v3/doc/Makefile.am	Tue Apr 29 15:32:26 2008
*************** doc-pdf-prince: $(xml_sources) ${glibcxx
*** 226,239 ****
  	$(PRINCE) $(PRINCE_FLAGS) ${top_srcdir}/doc/xml/spine.xml
  
  
! # No install-pdf, install-html support in automake yet
! install-pdf:
! install-html:
! 
! # Installation of distribution html documentation not yet supported
! # TODO: Write custom install-html rule.
! .PHONY: install-html install-pdf \
! 	doc-doxygen-html doc-doxygen-man doc-performance
  
  # By adding these files here, automake will remove them for 'make clean'
  CLEANFILES = *.log
--- 226,232 ----
  	$(PRINCE) $(PRINCE_FLAGS) ${top_srcdir}/doc/xml/spine.xml
  
  
! .PHONY: doc-doxygen-html doc-doxygen-man doc-performance
  
  # By adding these files here, automake will remove them for 'make clean'
  CLEANFILES = *.log
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/Makefile.in gcc-4.3.1/libstdc++-v3/doc/Makefile.in
*** gcc-4.3.0/libstdc++-v3/doc/Makefile.in	Tue Feb 12 02:10:57 2008
--- gcc-4.3.1/libstdc++-v3/doc/Makefile.in	Tue Apr 29 15:32:26 2008
*************** doc-pdf-prince: $(xml_sources) ${glibcxx
*** 636,649 ****
  	@echo "Generating pdf prince files..."
  	$(PRINCE) $(PRINCE_FLAGS) ${top_srcdir}/doc/xml/spine.xml
  
! # No install-pdf, install-html support in automake yet
! install-pdf:
! install-html:
! 
! # Installation of distribution html documentation not yet supported
! # TODO: Write custom install-html rule.
! .PHONY: install-html install-pdf \
! 	doc-doxygen-html doc-doxygen-man doc-performance
  
  # To remove directories.
  clean-local:
--- 636,642 ----
  	@echo "Generating pdf prince files..."
  	$(PRINCE) $(PRINCE_FLAGS) ${top_srcdir}/doc/xml/spine.xml
  
! .PHONY: doc-doxygen-html doc-doxygen-man doc-performance
  
  # To remove directories.
  clean-local:
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/doxygen/Intro.3 gcc-4.3.1/libstdc++-v3/doc/doxygen/Intro.3
*** gcc-4.3.0/libstdc++-v3/doc/doxygen/Intro.3	Thu Oct 18 15:22:58 2007
--- gcc-4.3.1/libstdc++-v3/doc/doxygen/Intro.3	Wed Mar 26 23:21:44 2008
***************
*** 1,5 ****
  .\" t
! .\" This man page is released under the FDL as part of libstdc++.
  .TH C++Intro 3 "20 May 2004" "GNU libstdc++" "Standard C++ Library"
  .SH NAME
  C++Intro \- Introduction to the GNU libstdc++ man pages
--- 1,5 ----
  .\" t
! .\" This man page is released under the GPL as part of libstdc++.
  .TH C++Intro 3 "20 May 2004" "GNU libstdc++" "Standard C++ Library"
  .SH NAME
  C++Intro \- Introduction to the GNU libstdc++ man pages
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/doxygen/doxygroups.cc gcc-4.3.1/libstdc++-v3/doc/doxygen/doxygroups.cc
*** gcc-4.3.0/libstdc++-v3/doc/doxygen/doxygroups.cc	Tue Sep 11 22:32:51 2007
--- gcc-4.3.1/libstdc++-v3/doc/doxygen/doxygroups.cc	Wed Mar 26 23:21:44 2008
***************
*** 1,5 ****
  /*
!    Copyright (C) 2001, 2002, 2005 Free Software Foundation, Inc.
     See license.html for license.
  
     This just provides documentation for stuff that doesn't need to be in the
--- 1,5 ----
  /*
!    Copyright (C) 2001, 2002, 2005, 2008 Free Software Foundation, Inc.
     See license.html for license.
  
     This just provides documentation for stuff that doesn't need to be in the
***************
*** 17,52 ****
  
  // // // // // // // // // // // // // // // // // // // // // // // //
  /** @namespace std
!  *  @brief Everything defined by the ISO C++ Standard is within
!  *  namespace <a class="el" href="namespacestd.html">std</a>.
  */
  /** @namespace std::__detail
!  *  @brief Implementation details not part of the namespace <a class="el"
!  *  href="namespacestd.html">std</a> interface.
  */
  /** @namespace std::tr1
!  *  @brief Everything defined by the ISO C++ TR1 is within namespace std::tr1.
  */
  /** @namespace std::tr1::__detail
   *  @brief Implementation details not part of the namespace std::tr1 interface.
  */
  /** @namespace __gnu_cxx
   *  @brief GNU extensions for public use.
  */
  /** @namespace __gnu_cxx::__detail
!  *  @brief Implementation details not part of the namespace __gnu_cxx
   *  interface.
  */
- /** @namespace __gnu_cxx::typelist
-  *  @brief GNU typelist extensions for public compile-time use.
- */
  /** @namespace __gnu_internal
   *  @brief GNU implemenation details, not for public use or
   *  export. Used only when anonymous namespaces cannot be substituted.
  */
- /** @namespace __gnu_debug
-  *  @brief GNU debug classes for public use.
- */
  // // // // // // // // // // // // // // // // // // // // // // // //
  /** @addtogroup SGIextensions STL extensions from SGI
  Because libstdc++ based its implementation of the STL subsections of
--- 17,50 ----
  
  // // // // // // // // // // // // // // // // // // // // // // // //
  /** @namespace std
!  *  @brief ISO C++ entities toplevel namespace is std.
  */
  /** @namespace std::__detail
!  *  @brief Implementation details not part of the namespace std interface.
  */
  /** @namespace std::tr1
!  *  @brief ISO C++ TR1 entities toplevel namespace is std::tr1.
  */
  /** @namespace std::tr1::__detail
   *  @brief Implementation details not part of the namespace std::tr1 interface.
  */
+ /** @namespace std::regex_constants
+  *  @brief ISO C++ 0x entities sub namespace for regex.
+ */
+ /** @namespace std::placeholders
+  *  @brief ISO C++ 0x entities sub namespace for functional.
+ */
  /** @namespace __gnu_cxx
   *  @brief GNU extensions for public use.
  */
  /** @namespace __gnu_cxx::__detail
!  *  @brief Implementation details not part of the namespace __gnu_cxx 
   *  interface.
  */
  /** @namespace __gnu_internal
   *  @brief GNU implemenation details, not for public use or
   *  export. Used only when anonymous namespaces cannot be substituted.
  */
  // // // // // // // // // // // // // // // // // // // // // // // //
  /** @addtogroup SGIextensions STL extensions from SGI
  Because libstdc++ based its implementation of the STL subsections of
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/doxygen/mainpage.html gcc-4.3.1/libstdc++-v3/doc/doxygen/mainpage.html
*** gcc-4.3.0/libstdc++-v3/doc/doxygen/mainpage.html	Wed Feb 13 23:34:10 2008
--- gcc-4.3.1/libstdc++-v3/doc/doxygen/mainpage.html	Wed Mar 26 23:21:44 2008
***************
*** 2,8 ****
  <html>
  <head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
  <title>libstdc++ Source: Main Index</title>
- <link href="style.css" rel="stylesheet" type="text/css">
  </head>
  
  <body bgcolor="#ffffff">
--- 2,7 ----
***************
*** 39,52 ****
  
  <p>Here are entry points to all the pages generated by Doxygen:
     <ul>
!     <li><a href="modules.html">Modules</a>
!     <li><a href="namespaces.html">Namespace List</a>
!     <li><a href="hierarchy.html">Class List</a>
!     <li><a href="annotated.html">Class Annotated List</a>
!     <li><a href="classes.html">Class Alphabetical Index</a>
!     <li><a href="globals_func.html">Function Alphabetical List</a>
!     <li><a href="files.html">Source File List</a>
!     <li><a href="todo.html">TODO List</a> (This is incomplete... how ironic.)
     </ul>
  </p>
  
--- 38,62 ----
  
  <p>Here are entry points to all the pages generated by Doxygen:
     <ul>
!     <li><a href="modules.html">Modules</a></li>
! 
!     <li>Namespaces
!     <ul>
!     <li><a href="namespaces.html">List</a></li>
!     <li><a href="namespacemembers.html">Members</a></li>
!     </ul>
!     </li>
! 
!     <li>Classes
!     <ul>
!     <li><a href="classes.html">List</a></li>
!     <li><a href="hierarchy.html">Hierarchy</a></li>
!     <li><a href="functions.html">Members</a></li>
!     </ul>
!     </li>
! 
!     <li><a href="files.html">Source Files</a></li>
!     <li><a href="todo.html">TODO List</a></li>
     </ul>
  </p>
  
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/doxygen/style.css gcc-4.3.1/libstdc++-v3/doc/doxygen/style.css
*** gcc-4.3.0/libstdc++-v3/doc/doxygen/style.css	Wed Jul 21 18:54:52 2004
--- gcc-4.3.1/libstdc++-v3/doc/doxygen/style.css	Thu Jan  1 00:00:00 1970
***************
*** 1,74 ****
- BODY { 
-    background: white; 
-    font-size: small;
- }
- H1 { text-align: center; font-size: large }
- H2 { text-align: left; font-size: medium; }
- H3 { text-align: left; font-size: small; }
- CODE { font-size: small; }
- CAPTION { font-weight: normal }
- A.qindex {}
- A.qindexRef {}
- A.el { text-decoration: none; font-size: small; font-weight: normal }
- A.elRef { text-decoration: none; font-size: small; font-weight: normal }
- A.code { text-decoration: none; font-weight: normal; color: #4444ee }
- A.codeRef { font-weight: normal; color: #4444ee }
- A:hover { text-decoration: none; background-color: #f2f2ff }
- DL.el { margin-left: -1cm }
- DIV.fragment { width: 100%; border: none; background-color: #eeeeee }
- DIV.ah { 
-    background-color: black; 
-    font-weight: normal; 
-    color: #ffffff; 
-    margin-bottom: 3px; 
-    margin-top: 3px 
- }
- DIV.groupHeader { 
-    margin-left: 16px; 
-    margin-top: 12px; 
-    margin-bottom: 6px; 
-    font-weight: normal 
- }
- DIV.groupText { margin-left: 16px; font-style: italic; font-size: small }
- TD.md { background-color: #f2f2ff; font-size: small; }
- TD.mdname1 { background-color: #f2f2ff; font-size: small; color: #602020; }
- TD.mdname { 
-    background-color: #f2f2ff; 
-    font-weight: normal; 
-    font-size: small; 
-    color: #602020; 
-    width: 600px
- }
- TD.indexkey { 
-    background-color: #eeeeff; 
-    font-weight: normal; 
-    font-size: small; 
-    padding-right  : 10px; 
-    padding-top    : 2px; 
-    padding-left   : 10px; 
-    padding-bottom : 2px; 
-    margin-left    : 0px; 
-    margin-right   : 0px; 
-    margin-top     : 2px; 
-    margin-bottom  : 2px  
- }
- TD.indexvalue { 
-    background-color: #eeeeff; 
-    font-style: italic; 
-    font-size: small; 
-    padding-right  : 10px; 
-    padding-top    : 2px; 
-    padding-left   : 10px; 
-    padding-bottom : 2px; 
-    margin-left    : 0px; 
-    margin-right   : 0px; 
-    margin-top     : 2px; 
-    margin-bottom  : 2px  
- }
- span.keyword       { color: #008000 }
- span.keywordtype   { color: #604020 }
- span.keywordflow   { color: #e08000 }
- span.comment       { color: #800000 }
- span.preprocessor  { color: #806020 }
- span.stringliteral { color: #002080 }
- span.charliteral   { color: #008080 }
--- 0 ----
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/doxygen/tables.html gcc-4.3.1/libstdc++-v3/doc/doxygen/tables.html
*** gcc-4.3.0/libstdc++-v3/doc/doxygen/tables.html	Sat Dec 16 17:16:04 2006
--- gcc-4.3.1/libstdc++-v3/doc/doxygen/tables.html	Wed Mar 26 23:21:44 2008
***************
*** 2,8 ****
  <html>
  <head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
  <title>Tables</title>
- <link href="style.css" rel="stylesheet" type="text/css">
  </head>
  
  <body bgcolor="#ffffff">
--- 2,7 ----
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/doxygen/user.cfg.in gcc-4.3.1/libstdc++-v3/doc/doxygen/user.cfg.in
*** gcc-4.3.0/libstdc++-v3/doc/doxygen/user.cfg.in	Mon Feb 11 00:01:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/doxygen/user.cfg.in	Wed Mar 26 23:21:44 2008
***************
*** 1,4 ****
! # Doxyfile 1.5.4
  
  # This file describes the settings to be used by the documentation system
  # doxygen (www.doxygen.org) for a project
--- 1,4 ----
! # Doxyfile 1.5.1
  
  # This file describes the settings to be used by the documentation system
  # doxygen (www.doxygen.org) for a project
***************
*** 14,28 ****
  # Project related configuration options
  #---------------------------------------------------------------------------
  
- # This tag specifies the encoding used for all characters in the
- # config file that follow. The default is UTF-8 which is also the
- # encoding used for all text before the first occurrence of this
- # tag. Doxygen uses libiconv (or the iconv built into libc) for the
- # transcoding. See http://www.gnu.org/software/libiconv for the list
- # of possible encodings.
- 
- DOXYFILE_ENCODING      = UTF-8
- 
  # The PROJECT_NAME tag is a single word (or a sequence of words surrounded 
  # by quotes) that should identify the project.
  
--- 14,19 ----
*************** CREATE_SUBDIRS         = NO
*** 62,67 ****
--- 53,68 ----
  
  OUTPUT_LANGUAGE        = English
  
+ # This tag can be used to specify the encoding used in the generated output. 
+ # The encoding is not always determined by the language that is chosen, 
+ # but also whether or not the output is meant for Windows or non-Windows users. 
+ # In case there is a difference, setting the USE_WINDOWS_ENCODING tag to YES 
+ # forces the Windows encoding (this is the default for the Windows binary), 
+ # whereas setting the tag to NO uses a Unix-style encoding (the default for 
+ # all platforms other than Windows).
+ 
+ USE_WINDOWS_ENCODING   = NO
+ 
  # If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will 
  # include brief member descriptions after the members that are listed in 
  # the file and class documentation (similar to JavaDoc). 
*************** OUTPUT_LANGUAGE        = English
*** 69,79 ****
  
  BRIEF_MEMBER_DESC      = NO
  
! # If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will
! # prepend the brief description of a member or function before the
! # detailed description.  Note: if both HIDE_UNDOC_MEMBERS and
! # BRIEF_MEMBER_DESC are set to NO, the brief descriptions will be
! # completely suppressed.
  
  REPEAT_BRIEF           = YES
  
--- 70,79 ----
  
  BRIEF_MEMBER_DESC      = NO
  
! # If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend 
! # the brief description of a member or function before the detailed description. 
! # Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the 
! # brief descriptions will be completely suppressed.
  
  REPEAT_BRIEF           = YES
  
*************** SHORT_NAMES            = YES
*** 135,153 ****
  # If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen 
  # will interpret the first line (until the first dot) of a JavaDoc-style 
  # comment as the brief description. If set to NO, the JavaDoc 
! # comments will behave just like regular Qt-style comments 
! # (thus requiring an explicit @brief command for a brief description.)
  
  JAVADOC_AUTOBRIEF      = NO
  
- # If the QT_AUTOBRIEF tag is set to YES then Doxygen will 
- # interpret the first line (until the first dot) of a Qt-style 
- # comment as the brief description. If set to NO, the comments 
- # will behave just like regular Qt-style comments (thus requiring 
- # an explicit \brief command for a brief description.)
- 
- QT_AUTOBRIEF           = NO
- 
  # The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen 
  # treat a multi-line C++ special comment block (i.e. a block of //! or /// 
  # comments) as a brief description. This used to be the default behaviour. 
--- 135,145 ----
  # If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen 
  # will interpret the first line (until the first dot) of a JavaDoc-style 
  # comment as the brief description. If set to NO, the JavaDoc 
! # comments will behave just like the Qt-style comments (thus requiring an 
! # explicit @brief command for a brief description.
  
  JAVADOC_AUTOBRIEF      = NO
  
  # The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen 
  # treat a multi-line C++ special comment block (i.e. a block of //! or /// 
  # comments) as a brief description. This used to be the default behaviour. 
*************** OPTIMIZE_OUTPUT_JAVA   = NO
*** 213,230 ****
  
  BUILTIN_STL_SUPPORT    = NO
  
- # If you use Microsoft's C++/CLI language, you should set this option to YES to
- # enable parsing support.
- 
- CPP_CLI_SUPPORT        = NO
- 
- # Set the SIP_SUPPORT tag to YES if your project consists of sip
- # sources only.  Doxygen will parse them like normal C++ but will
- # assume all classes use public instead of private inheritance when no
- # explicit protection keyword is present.
- 
- SIP_SUPPORT            = NO
- 
  # If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC 
  # tag is set to YES, then doxygen will reuse the documentation of the first 
  # member in the group (if any) for the other members of the group. By default 
--- 205,210 ----
*************** DISTRIBUTE_GROUP_DOC   = YES
*** 240,255 ****
  
  SUBGROUPING            = YES
  
- # When TYPEDEF_HIDES_STRUCT is enabled, a typedef of a struct (or union) is 
- # documented as struct with the name of the typedef. So 
- # typedef struct TypeS {} TypeT, will appear in the documentation as a struct 
- # with name TypeT. When disabled the typedef will appear as a member of a file, 
- # namespace, or class. And the struct will be named TypeS. This can typically 
- # be useful for C code where the coding convention is that all structs are 
- # typedef'ed and only the typedef is referenced never the struct's name.
- 
- TYPEDEF_HIDES_STRUCT   = NO
- 
  #---------------------------------------------------------------------------
  # Build related configuration options
  #---------------------------------------------------------------------------
--- 220,225 ----
*************** EXTRACT_LOCAL_CLASSES  = YES
*** 284,297 ****
  
  EXTRACT_LOCAL_METHODS  = YES
  
- # If this flag is set to YES, the members of anonymous namespaces will
- # be extracted and appear in the documentation as a namespace called
- # 'anonymous_namespace{file}', where file will be replaced with the
- # base name of the file that contains the anonymous namespace. By
- # default anonymous namespace are hidden.
- 
- EXTRACT_ANON_NSPACES   = NO
- 
  # If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all 
  # undocumented members of documented classes, files or namespaces. 
  # If set to NO (the default) these members will be included in the 
--- 254,259 ----
*************** MAX_INITIALIZER_LINES  = 0
*** 422,441 ****
  
  SHOW_USED_FILES        = YES
  
! # If the sources in your project are distributed over multiple
! # directories then setting the SHOW_DIRECTORIES tag to YES will show
! # the directory hierarchy in the documentation. The default is NO.
  
  SHOW_DIRECTORIES       = YES
  
! # The FILE_VERSION_FILTER tag can be used to specify a program or
! # script that doxygen should invoke to get the current version for
! # each file (typically from the version control system). Doxygen will
! # invoke the program by executing (via popen()) the command <command>
! # <input-file>, where <command> is the value of the
! # FILE_VERSION_FILTER tag, and <input-file> is the name of an input
! # file provided by doxygen. Whatever the program writes to standard
! # output is used as the file version. See the manual for examples.
  
  FILE_VERSION_FILTER    = 
  
--- 384,402 ----
  
  SHOW_USED_FILES        = YES
  
! # If the sources in your project are distributed over multiple directories 
! # then setting the SHOW_DIRECTORIES tag to YES will show the directory hierarchy 
! # in the documentation. The default is NO.
  
  SHOW_DIRECTORIES       = YES
  
! # The FILE_VERSION_FILTER tag can be used to specify a program or script that 
! # doxygen should invoke to get the current version for each file (typically from the 
! # version control system). Doxygen will invoke the program by executing (via 
! # popen()) the command <command> <input-file>, where <command> is the value of 
! # the FILE_VERSION_FILTER tag, and <input-file> is the name of an input file 
! # provided by doxygen. Whatever the program writes to standard output 
! # is used as the file version. See the manual for examples.
  
  FILE_VERSION_FILTER    = 
  
*************** WARN_LOGFILE           = 
*** 494,546 ****
  # configuration options related to the input files
  #---------------------------------------------------------------------------
  
! # The INPUT tag can be used to specify the files and/or directories
! # that contain documented source files. You may enter file names like
! # "myfile.cpp" or directories like "/usr/src/myproject". Separate the
! # files or directories with spaces.
  
! INPUT                  = @srcdir@/doc/doxygen/doxygroups.cc \
!                          @srcdir@/include/precompiled/stdc++.h \
!                          @srcdir@/include/precompiled/stdtr1c++.h \
!                          @srcdir@/include/precompiled/extc++.h \
!                          @srcdir@/libsupc++/cxxabi.h \
                           @srcdir@/libsupc++/exception \
                           @srcdir@/libsupc++/new \
                           @srcdir@/libsupc++/typeinfo \
-                          include/@host_alias@/bits \
-                          include/bits \
-                          include/debug \
-                          include/parallel \
-                          include/ext \
-                          include/tr1 \
-                          include/tr1_impl \
                           include/algorithm \
                           include/array \
                           include/bitset \
-                          include/cassert \
-                          include/ccomplex \
-                          include/cctype \
-                          include/cerrno \
-                          include/cfenv \
-                          include/cfloat \
-                          include/cinttypes \
-                          include/ciso646 \
-                          include/climits \
-                          include/clocale \
-                          include/cmath \
-                          include/csetjmp \
-                          include/csignal \
-                          include/cstdarg \
-                          include/cstdbool \
-                          include/cstddef \
-                          include/cstdint \
-                          include/cstdio \
-                          include/cstdlib \
-                          include/cstring \
-                          include/ctgmath \
-                          include/ctime \
-                          include/cwchar \
-                          include/cwctype \
                           include/deque \
                           include/fstream \
                           include/functional \
--- 455,473 ----
  # configuration options related to the input files
  #---------------------------------------------------------------------------
  
! # The INPUT tag can be used to specify the files and/or directories that contain 
! # documented source files. You may enter file names like "myfile.cpp" or 
! # directories like "/usr/src/myproject". Separate the files or directories 
! # with spaces.
  
! INPUT                  = @srcdir@/libsupc++/cxxabi.h \
!                          @srcdir@/libsupc++/cxxabi-forced.h \
                           @srcdir@/libsupc++/exception \
                           @srcdir@/libsupc++/new \
                           @srcdir@/libsupc++/typeinfo \
                           include/algorithm \
                           include/array \
                           include/bitset \
                           include/deque \
                           include/fstream \
                           include/functional \
*************** INPUT                  = @srcdir@/doc/do
*** 566,572 ****
                           include/stdexcept \
                           include/streambuf \
                           include/string \
-                          include/system_error \
                           include/tuple \
                           include/type_traits \
                           include/unordered_map \
--- 493,498 ----
*************** INPUT                  = @srcdir@/doc/do
*** 574,587 ****
--- 500,540 ----
                           include/utility \
                           include/valarray \
                           include/vector \
+                          include/cassert \
+                          include/ccomplex \
+                          include/cctype \
+                          include/cerrno \
+                          include/cfenv \
+                          include/cfloat \
+                          include/cinttypes \
+                          include/ciso646 \
+                          include/climits \
+                          include/clocale \
+                          include/cmath \
+                          include/csetjmp \
+                          include/csignal \
+                          include/cstdarg \
+                          include/cstdbool \
+                          include/cstddef \
+                          include/cstdint \
+                          include/cstdio \
+                          include/cstdlib \
+                          include/cstring \
+                          include/ctgmath \
+                          include/ctime \
+                          include/cwchar \
+                          include/cwctype \
                           include/backward/hash_map \
                           include/backward/hash_set \
+                          include/backward/strstream \
                           include/debug/bitset \
                           include/debug/deque \
                           include/debug/list \
                           include/debug/map \
                           include/debug/set \
                           include/debug/string \
+                          include/debug/unordered_map \
+                          include/debug/unordered_set \
                           include/debug/vector \
                           include/ext/algorithm \
                           include/ext/functional \
*************** INPUT                  = @srcdir@/doc/do
*** 591,598 ****
                           include/ext/rb_tree \
                           include/ext/rope \
                           include/ext/slist \
-                          include/ext/pb_ds \
-                          include/ext/pb_ds/detail \
                           include/parallel/algorithm \
                           include/parallel/numeric \
                           include/tr1/array \
--- 544,549 ----
*************** INPUT                  = @srcdir@/doc/do
*** 614,620 ****
                           include/tr1/cwchar \
                           include/tr1/cwctype \
                           include/tr1/functional \
-                          include/tr1/hashtable.h \
                           include/tr1/memory \
                           include/tr1/random \
                           include/tr1/regex \
--- 565,570 ----
*************** INPUT                  = @srcdir@/doc/do
*** 622,628 ****
                           include/tr1/type_traits \
                           include/tr1/unordered_map \
                           include/tr1/unordered_set \
-                          include/tr1_impl/utility \
                           include/tr1_impl/array \
                           include/tr1_impl/cctype \
                           include/tr1_impl/cfenv \
--- 572,577 ----
*************** INPUT                  = @srcdir@/doc/do
*** 638,664 ****
                           include/tr1_impl/hashtable \
                           include/tr1_impl/random \
                           include/tr1_impl/regex \
-                          include/tr1_impl/tuple \
                           include/tr1_impl/type_traits \
                           include/tr1_impl/unordered_map \
                           include/tr1_impl/unordered_set \
!                          include/tr1_impl/utility
! 
! # This tag can be used to specify the character encoding of the source
! # files that doxygen parses. Internally doxygen uses the UTF-8
! # encoding, which is also the default input encoding. Doxygen uses
! # libiconv (or the iconv built into libc) for the transcoding.  See
! # http://www.gnu.org/software/libiconv for the list of possible
! # encodings.
! 
! INPUT_ENCODING         = UTF-8
  
  # If the value of the INPUT tag contains directories, you can use the 
  # FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp 
  # and *.h) to filter out the source-files in the directories. If left 
  # blank the following patterns are tested: 
  # *.c *.cc *.cxx *.cpp *.c++ *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh *.hxx 
! # *.hpp *.h++ *.idl *.odl *.cs *.php *.php3 *.inc *.m *.mm *.py *.f90
  
  FILE_PATTERNS          = *.h \
                           *.hpp \
--- 587,614 ----
                           include/tr1_impl/hashtable \
                           include/tr1_impl/random \
                           include/tr1_impl/regex \
                           include/tr1_impl/type_traits \
                           include/tr1_impl/unordered_map \
                           include/tr1_impl/unordered_set \
!                          include/tr1_impl/utility \
!                          include/@host_alias@/bits \
!                          include/backward \
!                          include/bits \
!                          include/debug \
!                          include/parallel \
!                          include/tr1 \
!                          include/tr1_impl \
!                          include/ext \
!                          include/ext/pb_ds \
!                          include/ext/pb_ds/detail \
!                          @srcdir@/doc/doxygen/doxygroups.cc
  
  # If the value of the INPUT tag contains directories, you can use the 
  # FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp 
  # and *.h) to filter out the source-files in the directories. If left 
  # blank the following patterns are tested: 
  # *.c *.cc *.cxx *.cpp *.c++ *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh *.hxx 
! # *.hpp *.h++ *.idl *.odl *.cs *.php *.php3 *.inc *.m *.mm *.py
  
  FILE_PATTERNS          = *.h \
                           *.hpp \
*************** EXCLUDE_PATTERNS       = stamp-* \
*** 694,707 ****
                           *extc++.h* \
                           */.svn/*
  
- # The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol
- # names (namespaces, classes, functions, etc.) that should be excluded
- # from the output.  The symbol name can be a fully qualified name, a
- # word, or if the wildcard * is used, a substring. Examples:
- # ANamespace, AClass, AClass::ANamespace, ANamespace::*Test
- 
- EXCLUDE_SYMBOLS        = 
- 
  # The EXAMPLE_PATH tag can be used to specify one or more files or 
  # directories that contain example code fragments that are included (see 
  # the \include command).
--- 644,649 ----
*************** FILTER_SOURCE_FILES    = NO
*** 757,769 ****
  # configuration options related to source browsing
  #---------------------------------------------------------------------------
  
! # If the SOURCE_BROWSER tag is set to YES then a list of source files
! # will be generated. Documented entities will be cross-referenced with
! # these sources.  Note: To get rid of all source code in the generated
! # output, make sure also VERBATIM_HEADERS is set to NO. If you have
! # enabled CALL_GRAPH or CALLER_GRAPH then you must also enable this
! # option. If you don't then doxygen will produce a warning and turn it
! # on anyway
  
  SOURCE_BROWSER         = YES
  
--- 699,708 ----
  # configuration options related to source browsing
  #---------------------------------------------------------------------------
  
! # If the SOURCE_BROWSER tag is set to YES then a list of source files will 
! # be generated. Documented entities will be cross-referenced with these sources. 
! # Note: To get rid of all source code in the generated output, make sure also 
! # VERBATIM_HEADERS is set to NO.
  
  SOURCE_BROWSER         = YES
  
*************** GENERATE_HTML          = @do_html@
*** 847,853 ****
  # If a relative path is entered the value of OUTPUT_DIRECTORY will be 
  # put in front of it. If left blank `html' will be used as the default path.
  
! HTML_OUTPUT            = @html_output_dir@
  
  # The HTML_FILE_EXTENSION tag can be used to specify the file extension for 
  # each generated HTML page (for example: .htm,.php,.asp). If it is left blank 
--- 786,792 ----
  # If a relative path is entered the value of OUTPUT_DIRECTORY will be 
  # put in front of it. If left blank `html' will be used as the default path.
  
! HTML_OUTPUT            = html
  
  # The HTML_FILE_EXTENSION tag can be used to specify the file extension for 
  # each generated HTML page (for example: .htm,.php,.asp). If it is left blank 
*************** HTML_FOOTER            = 
*** 874,880 ****
  # the style sheet file to the HTML output directory, so don't put your own 
  # stylesheet in the HTML output directory as well, or it will be erased!
  
! HTML_STYLESHEET        = @srcdir@/doc/doxygen/style.css
  
  # If the HTML_ALIGN_MEMBERS tag is set to YES, the members of classes, 
  # files or namespaces will be aligned in HTML using tables. If set to 
--- 813,819 ----
  # the style sheet file to the HTML output directory, so don't put your own 
  # stylesheet in the HTML output directory as well, or it will be erased!
  
! HTML_STYLESHEET        = 
  
  # If the HTML_ALIGN_MEMBERS tag is set to YES, the members of classes, 
  # files or namespaces will be aligned in HTML using tables. If set to 
*************** HTML_ALIGN_MEMBERS     = NO
*** 889,902 ****
  
  GENERATE_HTMLHELP      = NO
  
- # If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML 
- # documentation will contain sections that can be hidden and shown after the 
- # page has loaded. For this to work a browser that supports 
- # JavaScript and DHTML is required (for instance Mozilla 1.0+, Firefox 
- # Netscape 6.0+, Internet explorer 5.0+, Konqueror, or Safari).
- 
- HTML_DYNAMIC_SECTIONS  = NO
- 
  # If the GENERATE_HTMLHELP tag is set to YES, the CHM_FILE tag can 
  # be used to specify the file name of the resulting .chm file. You 
  # can add a path in front of the file if the result should not be 
--- 828,833 ----
*************** XML_OUTPUT             = xml
*** 1120,1126 ****
  # which can be used by a validating XML parser to check the 
  # syntax of the XML files.
  
- #XML_SCHEMA             = 
  XML_SCHEMA             = 
  
  # The XML_DTD tag can be used to specify an XML DTD, 
--- 1051,1056 ----
*************** XML_SCHEMA             = 
*** 1128,1134 ****
  # syntax of the XML files.
  
  XML_DTD                = 
- #XML_DTD                = http://www.oasis-open.org/docbook/xml/4.5/docbookx.dtd
  
  # If the XML_PROGRAMLISTING tag is set to YES Doxygen will 
  # dump the program listings (including syntax highlighting 
--- 1058,1063 ----
*************** INCLUDE_FILE_PATTERNS  = 
*** 1232,1244 ****
  # instead of the = operator.
  
  PREDEFINED             = __GTHREADS \
                           _GLIBCXX_STD=std \
!                          _GLIBCXX_TR1=tr1 \
                           "_GLIBCXX_BEGIN_NAMESPACE(name)=namespace name {  " \
                           "_GLIBCXX_BEGIN_NESTED_NAMESPACE(name, unused)=namespace name {  " \
                           _GLIBCXX_END_NAMESPACE=} \
                           _GLIBCXX_END_NESTED_NAMESPACE=} \
                           "_GLIBCXX_TEMPLATE_ARGS=...  " \
                           _GLIBCXX_DEPRECATED \
                           _GLIBCXX_USE_WCHAR_T \
                           _GLIBCXX_USE_LONG_LONG \
--- 1161,1178 ----
  # instead of the = operator.
  
  PREDEFINED             = __GTHREADS \
+                          "_GLIBCXX_STD_P= " \
+                          "_GLIBCXX_STD_D= " \
                           _GLIBCXX_STD=std \
!                          "_GLIBCXX_TR1= " \
!                          "_GLIBCXX_BEGIN_NAMESPACE_TR1= " \
!                          "_GLIBCXX_END_NAMESPACE_TR1= " \
                           "_GLIBCXX_BEGIN_NAMESPACE(name)=namespace name {  " \
                           "_GLIBCXX_BEGIN_NESTED_NAMESPACE(name, unused)=namespace name {  " \
                           _GLIBCXX_END_NAMESPACE=} \
                           _GLIBCXX_END_NESTED_NAMESPACE=} \
                           "_GLIBCXX_TEMPLATE_ARGS=...  " \
+                          _GLIBCXX_INCLUDE_AS_CXX0X \
                           _GLIBCXX_DEPRECATED \
                           _GLIBCXX_USE_WCHAR_T \
                           _GLIBCXX_USE_LONG_LONG \
*************** PREDEFINED             = __GTHREADS \
*** 1248,1258 ****
                           __glibcxx_class_requires3=// \
                           __glibcxx_class_requires4=//
  
! # If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES
! # then this tag can be used to specify a list of macro names that
! # should be expanded.  The macro definition that is found in the
! # sources will be used.  Use the PREDEFINED tag if you want to use a
! # different macro definition.
  
  EXPAND_AS_DEFINED      = 
  
--- 1182,1191 ----
                           __glibcxx_class_requires3=// \
                           __glibcxx_class_requires4=//
  
! # If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then 
! # this tag can be used to specify a list of macro names that should be expanded. 
! # The macro definition that is found in the sources will be used. 
! # Use the PREDEFINED tag if you want to use a different macro definition.
  
  EXPAND_AS_DEFINED      = 
  
*************** PERL_PATH              = /usr/bin/perl
*** 1320,1333 ****
  
  CLASS_DIAGRAMS         = YES
  
- # You can define message sequence charts within doxygen comments using the \msc 
- # command. Doxygen will then run the mscgen tool (see http://www.mcternan.me.uk/mscgen/) to 
- # produce the chart and insert it in the documentation. The MSCGEN_PATH tag allows you to 
- # specify the directory where the mscgen tool resides. If left empty the tool is assumed to 
- # be found in the default search path.
- 
- MSCGEN_PATH            = 
- 
  # If set to YES, the inheritance and collaboration graphs will hide 
  # inheritance and usage relations if the target is undocumented 
  # or is not a class.
--- 1253,1258 ----
*************** INCLUDE_GRAPH          = NO
*** 1385,1405 ****
  
  INCLUDED_BY_GRAPH      = NO
  
! # If the CALL_GRAPH, SOURCE_BROWSER and HAVE_DOT tags are set to YES
! # then doxygen will generate a call dependency graph for every global
! # function or class method.  Note that enabling this option will
! # significantly increase the time of a run.  So in most cases it will
! # be better to enable call graphs for selected functions only using
! # the \callgraph command.
  
  CALL_GRAPH             = NO
  
! # If the CALLER_GRAPH, SOURCE_BROWSER and HAVE_DOT tags are set to YES
! # then doxygen will generate a caller dependency graph for every
! # global function or class method.  Note that enabling this option
! # will significantly increase the time of a run.  So in most cases it
! # will be better to enable caller graphs for selected functions only
! # using the \callergraph command.
  
  CALLER_GRAPH           = NO
  
--- 1310,1328 ----
  
  INCLUDED_BY_GRAPH      = NO
  
! # If the CALL_GRAPH and HAVE_DOT tags are set to YES then doxygen will 
! # generate a call dependency graph for every global function or class method. 
! # Note that enabling this option will significantly increase the time of a run. 
! # So in most cases it will be better to enable call graphs for selected 
! # functions only using the \callgraph command.
  
  CALL_GRAPH             = NO
  
! # If the CALLER_GRAPH and HAVE_DOT tags are set to YES then doxygen will 
! # generate a caller dependency graph for every global function or class method. 
! # Note that enabling this option will significantly increase the time of a run. 
! # So in most cases it will be better to enable caller graphs for selected 
! # functions only using the \callergraph command.
  
  CALLER_GRAPH           = NO
  
*************** DOT_PATH               = 
*** 1432,1455 ****
  
  DOTFILE_DIRS           = 
  
! # The MAX_DOT_GRAPH_MAX_NODES tag can be used to set the maximum
! # number of nodes that will be shown in the graph. If the number of
! # nodes in a graph becomes larger than this value, doxygen will
! # truncate the graph, which is visualized by representing a node as a
! # red box. Note that doxygen if the number of direct children of the
! # root node in a graph is already larger than MAX_DOT_GRAPH_NOTES then
! # the graph will not be shown at all. Also note that the size of a
! # graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
  
! DOT_GRAPH_MAX_NODES    = 50
  
  # The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the 
  # graphs generated by dot. A depth value of 3 means that only nodes reachable 
  # from the root by following a path via at most 3 edges will be shown. Nodes 
  # that lay further from the root node will be omitted. Note that setting this 
  # option to 1 or 2 may greatly reduce the computation time needed for large 
! # code bases. Also note that the size of a graph can be further restricted by 
! # DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
  
  MAX_DOT_GRAPH_DEPTH    = 0
  
--- 1355,1385 ----
  
  DOTFILE_DIRS           = 
  
! # The MAX_DOT_GRAPH_WIDTH tag can be used to set the maximum allowed width 
! # (in pixels) of the graphs generated by dot. If a graph becomes larger than 
! # this value, doxygen will try to truncate the graph, so that it fits within 
! # the specified constraint. Beware that most browsers cannot cope with very 
! # large images.
  
! MAX_DOT_GRAPH_WIDTH    = 1024
! 
! # The MAX_DOT_GRAPH_HEIGHT tag can be used to set the maximum allows height 
! # (in pixels) of the graphs generated by dot. If a graph becomes larger than 
! # this value, doxygen will try to truncate the graph, so that it fits within 
! # the specified constraint. Beware that most browsers cannot cope with very 
! # large images.
! 
! MAX_DOT_GRAPH_HEIGHT   = 1024
  
  # The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the 
  # graphs generated by dot. A depth value of 3 means that only nodes reachable 
  # from the root by following a path via at most 3 edges will be shown. Nodes 
  # that lay further from the root node will be omitted. Note that setting this 
  # option to 1 or 2 may greatly reduce the computation time needed for large 
! # code bases. Also note that a graph may be further truncated if the graph's 
! # image dimensions are not sufficient to fit the graph (see MAX_DOT_GRAPH_WIDTH 
! # and MAX_DOT_GRAPH_HEIGHT). If 0 is used for the depth value (the default), 
! # the graph is not depth-constrained.
  
  MAX_DOT_GRAPH_DEPTH    = 0
  
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/api.html gcc-4.3.1/libstdc++-v3/doc/html/api.html
*** gcc-4.3.0/libstdc++-v3/doc/html/api.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/api.html	Thu Apr 10 22:53:15 2008
***************
*** 3,11 ****
  <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>API and Source Level Documentation</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><link rel="start" href="spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="bk02.html" title="" /><link rel="prev" href="bk02.html" title="" /><link rel="next" href="bk03.html" title="" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">API and Source Level Documentation</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk02.html">Prev</a> </td><th width="60%" align="center"></th><td width="20%" align="right"> <a accesskey="n" href="bk03.html">Next</a></td></tr></table><hr /></div><div class="article" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="api"></a>API and Source Level Documentation</h2></div><div><p class="copyright">Copyright © 
        2008
       
!       <a class="ulink" href="http://fsf.org" target="_top">FSF
        </a>
!     </p></div><div><div class="legalnotice"><a id="id330876"></a><p>
        <a class="ulink" href="17_intro/license.html" target="_top">License 
        </a>
      </p></div></div></div><hr /></div><p>
--- 3,11 ----
  <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>API and Source Level Documentation</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><link rel="start" href="spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="bk02.html" title="" /><link rel="prev" href="bk02.html" title="" /><link rel="next" href="bk03.html" title="" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">API and Source Level Documentation</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk02.html">Prev</a> </td><th width="60%" align="center"></th><td width="20%" align="right"> <a accesskey="n" href="bk03.html">Next</a></td></tr></table><hr /></div><div class="article" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="api"></a>API and Source Level Documentation</h2></div><div><p class="copyright">Copyright © 
        2008
       
!       <a class="ulink" href="http://www.fsf.org/" target="_top">FSF
        </a>
!     </p></div><div><div class="legalnotice"><a id="id364659"></a><p>
        <a class="ulink" href="17_intro/license.html" target="_top">License 
        </a>
      </p></div></div></div><hr /></div><p>
*************** viewed online:
*** 29,34 ****
--- 29,37 ----
        <a class="ulink" href="libstdc++-html-USERS-4.2/index.html" target="_top">for the 4.2 release
        </a>
      </p></li><li><p>
+       <a class="ulink" href="libstdc++-html-USERS-4.3/index.html" target="_top">for the 4.3 release
+       </a>
+     </p></li><li><p>
        <a class="ulink" href="latest-doxygen/index.html" target="_top">"the latest collection"
        </a>
        (For the main development tree; see the date on the first page.)
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/faq.html gcc-4.3.1/libstdc++-v3/doc/html/faq.html
*** gcc-4.3.0/libstdc++-v3/doc/html/faq.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/faq.html	Thu Apr 10 22:53:15 2008
***************
*** 164,170 ****
      </p></td></tr><tr class="question"><td align="left" valign="top"><a id="faq.how"></a><a id="q-how"></a><p><b>1.5.</b></p></td><td align="left" valign="top"><p>
        How do I contribute to the effort?
      </p></td></tr><tr class="answer"><td align="left" valign="top"><a id="a-how"></a></td><td align="left" valign="top"><p>
!     Here is <a class="ulink" href="../17_intro/contribute.html" target="_top">a page devoted to
      this topic</a>. Subscribing to the mailing list (see above, or
      the homepage) is a very good idea if you have something to
      contribute, or if you have spare time and want to
--- 164,170 ----
      </p></td></tr><tr class="question"><td align="left" valign="top"><a id="faq.how"></a><a id="q-how"></a><p><b>1.5.</b></p></td><td align="left" valign="top"><p>
        How do I contribute to the effort?
      </p></td></tr><tr class="answer"><td align="left" valign="top"><a id="a-how"></a></td><td align="left" valign="top"><p>
!     Here is <a class="link" href="manual/appendix_contributing.html" title="Appendix A. Contributing">a page devoted to
      this topic</a>. Subscribing to the mailing list (see above, or
      the homepage) is a very good idea if you have something to
      contribute, or if you have spare time and want to
***************
*** 320,326 ****
      </p></td></tr><tr class="answer"><td align="left" valign="top"><a id="a-what_is_libsupcxx"></a></td><td align="left" valign="top"><p>
        If the only functions from <code class="filename">libstdc++.a</code>
        which you need are language support functions (those listed in
!       <a class="ulink" href="../18_support/howto.html" target="_top">clause 18</a> of the
        standard, e.g., <code class="function">new</code> and
        <code class="function">delete</code>), then try linking against
        <code class="filename">libsupc++.a</code>, which is a subset of
--- 320,326 ----
      </p></td></tr><tr class="answer"><td align="left" valign="top"><a id="a-what_is_libsupcxx"></a></td><td align="left" valign="top"><p>
        If the only functions from <code class="filename">libstdc++.a</code>
        which you need are language support functions (those listed in
!       <a class="link" href="manual/support.html" title="Part II. Support">clause 18</a> of the
        standard, e.g., <code class="function">new</code> and
        <code class="function">delete</code>), then try linking against
        <code class="filename">libsupc++.a</code>, which is a subset of
***************
*** 487,493 ****
      enough to detect when the minimal support to
      enable <span class="type">wchar_t</span> and C++ library structures
      like <code class="classname">wstring</code> were present. This impacted Solaris,
!     Darwin, and BSD varients, and is fixed in libstdc++ versions post 4.1.0.
      </p><p> 
      </p></td></tr><tr class="qandadiv"><td align="left" valign="top" colspan="2"><h3 class="title"><a id="faq.known_bugs"></a>5. Known Bugs</h3></td></tr><tr class="toc"><td align="left" valign="top" colspan="2"><dl><dt>5.1. <a href="faq.html#faq.what_works">
        What works already?
--- 487,493 ----
      enough to detect when the minimal support to
      enable <span class="type">wchar_t</span> and C++ library structures
      like <code class="classname">wstring</code> were present. This impacted Solaris,
!     Darwin, and BSD variants, and is fixed in libstdc++ versions post 4.1.0.
      </p><p> 
      </p></td></tr><tr class="qandadiv"><td align="left" valign="top" colspan="2"><h3 class="title"><a id="faq.known_bugs"></a>5. Known Bugs</h3></td></tr><tr class="toc"><td align="left" valign="top" colspan="2"><dl><dt>5.1. <a href="faq.html#faq.what_works">
        What works already?
***************
*** 578,590 ****
      reason is that the state flags are <span class="emphasis"><em>not</em></span> cleared
      on a successful call to open().  The standard unfortunately did
      not specify behavior in this case, and to everybody's great sorrow,
!     the <a class="ulink" href="../ext/howto.html#5" target="_top">proposed LWG resolution in
        DR #22</a> is to leave the flags unchanged.  You must insert a call
      to <code class="function">fs.clear()</code> between the calls to close() and open(),
      and then everything will work like we all expect it to work.
      <span class="emphasis"><em>Update:</em></span> for GCC 4.0 we implemented the resolution
!     of <a class="ulink" href="../ext/howto.html#5" target="_top">DR #409</a> and open() now calls
!     <code class="function">clear()</code> on success!
      </p></td></tr><tr class="question"><td align="left" valign="top"><a id="faq.wefcxx_verbose"></a><a id="q-wefcxx_verbose"></a><p><b>6.2.</b></p></td><td align="left" valign="top"><p>
        -Weffc++ complains too much
      </p></td></tr><tr class="answer"><td align="left" valign="top"><a id="a-wefcxx_verbose"></a></td><td align="left" valign="top"><p>
--- 578,590 ----
      reason is that the state flags are <span class="emphasis"><em>not</em></span> cleared
      on a successful call to open().  The standard unfortunately did
      not specify behavior in this case, and to everybody's great sorrow,
!     the <a class="link" href="manual/bk01pt01ch01s03.html" title="Bugs">proposed LWG resolution in
        DR #22</a> is to leave the flags unchanged.  You must insert a call
      to <code class="function">fs.clear()</code> between the calls to close() and open(),
      and then everything will work like we all expect it to work.
      <span class="emphasis"><em>Update:</em></span> for GCC 4.0 we implemented the resolution
!     of <a class="link" href="manual/bk01pt01ch01s03.html" title="Bugs">DR #409</a> and open() 
!     now calls <code class="function">clear()</code> on success!
      </p></td></tr><tr class="question"><td align="left" valign="top"><a id="faq.wefcxx_verbose"></a><a id="q-wefcxx_verbose"></a><p><b>6.2.</b></p></td><td align="left" valign="top"><p>
        -Weffc++ complains too much
      </p></td></tr><tr class="answer"><td align="left" valign="top"><a id="a-wefcxx_verbose"></a></td><td align="left" valign="top"><p>
***************
*** 647,653 ****
      </p><p>
      More information, including how to optionally enable/disable the
      checks, is available
!     <a class="ulink" href="../19_diagnostics/howto.html#3" target="_top">here</a>.
      </p></td></tr><tr class="question"><td align="left" valign="top"><a id="faq.dlopen_crash"></a><a id="q-dlopen_crash"></a><p><b>6.6.</b></p></td><td align="left" valign="top"><p>
        Program crashes when using library code in a
        dynamically-loaded library
--- 647,653 ----
      </p><p>
      More information, including how to optionally enable/disable the
      checks, is available
!     <a class="link" href="manual/bk01pt03ch08.html" title="Chapter 8. Concept Checking">here</a>.
      </p></td></tr><tr class="question"><td align="left" valign="top"><a id="faq.dlopen_crash"></a><a id="q-dlopen_crash"></a><p><b>6.6.</b></p></td><td align="left" valign="top"><p>
        Program crashes when using library code in a
        dynamically-loaded library
***************
*** 672,690 ****
      </p></td></tr><tr class="answer"><td align="left" valign="top"><a id="a-memory_leaks"></a></td><td align="left" valign="top"><p>
      A few people have reported that the standard containers appear
      to leak memory when tested with memory checkers such as
!     <a class="ulink" href="http://developer.kde.org/~sewardj/" target="_top">valgrind</a>.
      The library's default allocators keep free memory in a pool
      for later reuse, rather than returning it to the OS.  Although
      this memory is always reachable by the library and is never
      lost, memory debugging tools can report it as a leak.  If you
      want to test the library for memory leaks please read
!     <a class="ulink" href="../debug.html#mem" target="_top">Tips for memory leak hunting</a>
      first.
      </p></td></tr><tr class="question"><td align="left" valign="top"><a id="faq.list_size_on"></a><a id="q-list_size_on"></a><p><b>6.8.</b></p></td><td align="left" valign="top"><p>
        list::size() is O(n)!
      </p></td></tr><tr class="answer"><td align="left" valign="top"><a id="a-list_size_on"></a></td><td align="left" valign="top"><p>
      See
!     the <a class="ulink" href="../23_containers/howto.html#6" target="_top">Containers</a>
      chapter.
      </p></td></tr><tr class="question"><td align="left" valign="top"><a id="faq.easy_to_fix"></a><a id="q-easy_to_fix"></a><p><b>6.9.</b></p></td><td align="left" valign="top"><p>
        Aw, that's easy to fix!
--- 672,690 ----
      </p></td></tr><tr class="answer"><td align="left" valign="top"><a id="a-memory_leaks"></a></td><td align="left" valign="top"><p>
      A few people have reported that the standard containers appear
      to leak memory when tested with memory checkers such as
!     <a class="ulink" href="http://valgrind.org/" target="_top">valgrind</a>.
      The library's default allocators keep free memory in a pool
      for later reuse, rather than returning it to the OS.  Although
      this memory is always reachable by the library and is never
      lost, memory debugging tools can report it as a leak.  If you
      want to test the library for memory leaks please read
!     <a class="link" href="manual/debug.html#debug.memory" title="Memory Leak Hunting">Tips for memory leak hunting</a>
      first.
      </p></td></tr><tr class="question"><td align="left" valign="top"><a id="faq.list_size_on"></a><a id="q-list_size_on"></a><p><b>6.8.</b></p></td><td align="left" valign="top"><p>
        list::size() is O(n)!
      </p></td></tr><tr class="answer"><td align="left" valign="top"><a id="a-list_size_on"></a></td><td align="left" valign="top"><p>
      See
!     the <a class="link" href="manual/containers.html" title="Part VII. Containers">Containers</a>
      chapter.
      </p></td></tr><tr class="question"><td align="left" valign="top"><a id="faq.easy_to_fix"></a><a id="q-easy_to_fix"></a><p><b>6.9.</b></p></td><td align="left" valign="top"><p>
        Aw, that's easy to fix!
***************
*** 695,701 ****
      patches</a> that covers the procedure, but for libstdc++ you
      should also send the patch to our mailing list in addition to
      the GCC patches mailing list.  The libstdc++
!     <a class="ulink" href="../17_intro/contribute.html" target="_top">contributors' page</a>
      also talks about how to submit patches.
      </p><p>
      In addition to the description, the patch, and the ChangeLog
--- 695,701 ----
      patches</a> that covers the procedure, but for libstdc++ you
      should also send the patch to our mailing list in addition to
      the GCC patches mailing list.  The libstdc++
!     <a class="link" href="manual/appendix_contributing.html" title="Appendix A. Contributing">contributors' page</a>
      also talks about how to submit patches.
      </p><p>
      In addition to the description, the patch, and the ChangeLog
***************
*** 777,783 ****
      </p></td></tr><tr class="question"><td align="left" valign="top"><a id="faq.extensions_and_backwards_compat"></a><a id="q-extensions_and_backwards_compat"></a><p><b>7.4.</b></p></td><td align="left" valign="top"><p>
        Extensions and Backward Compatibility
      </p></td></tr><tr class="answer"><td align="left" valign="top"><a id="a-extensions_and_backwards_compat"></a></td><td align="left" valign="top"><p>
!       See the <a class="link" href="manual/backwards.html" title="Backwards Compatibility">link</a> on backwards compatiblity and <a class="link" href="manual/api.html" title="API Evolution and Deprecation History">link</a> on evolution.
      </p></td></tr><tr class="question"><td align="left" valign="top"><a id="faq.tr1_support"></a><a id="q-tr1_support"></a><p><b>7.5.</b></p></td><td align="left" valign="top"><p>
        Does libstdc++ support TR1?
      </p></td></tr><tr class="answer"><td align="left" valign="top"><a id="a-tr1_support"></a></td><td align="left" valign="top"><p>
--- 777,783 ----
      </p></td></tr><tr class="question"><td align="left" valign="top"><a id="faq.extensions_and_backwards_compat"></a><a id="q-extensions_and_backwards_compat"></a><p><b>7.4.</b></p></td><td align="left" valign="top"><p>
        Extensions and Backward Compatibility
      </p></td></tr><tr class="answer"><td align="left" valign="top"><a id="a-extensions_and_backwards_compat"></a></td><td align="left" valign="top"><p>
!       See the <a class="link" href="manual/backwards.html" title="Backwards Compatibility">link</a> on backwards compatibility and <a class="link" href="manual/api.html" title="API Evolution and Deprecation History">link</a> on evolution.
      </p></td></tr><tr class="question"><td align="left" valign="top"><a id="faq.tr1_support"></a><a id="q-tr1_support"></a><p><b>7.5.</b></p></td><td align="left" valign="top"><p>
        Does libstdc++ support TR1?
      </p></td></tr><tr class="answer"><td align="left" valign="top"><a id="a-tr1_support"></a></td><td align="left" valign="top"><p>
***************
*** 868,873 ****
      </p></div><p>
      The copy will take O(n) time and the swap is constant time.
      </p><p>
!     See <a class="ulink" href="../21_strings/howto.html#6" target="_top">Shrink-to-fit
      strings</a> for a similar solution for strings.
      </p></td></tr></tbody></table></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="bk03.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="bk03.html">Up</a></td><td width="40%" align="right"> </td></tr><tr><td width="40%" align="left" valign="top"> </td><td width="20%" align="center"><a accesskey="h" href="spine.html">Home</a></td><td width="40%" align="right" valign="top"> </td></tr></table></div></body></html>
--- 868,873 ----
      </p></div><p>
      The copy will take O(n) time and the swap is constant time.
      </p><p>
!     See <a class="link" href="manual/bk01pt05ch13s05.html" title="Shrink to Fit">Shrink-to-fit
      strings</a> for a similar solution for strings.
      </p></td></tr></tbody></table></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="bk03.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="bk03.html">Up</a></td><td width="40%" align="right"> </td></tr><tr><td width="40%" align="left" valign="top"> </td><td width="20%" align="center"><a accesskey="h" href="spine.html">Home</a></td><td width="40%" align="right" valign="top"> </td></tr></table></div></body></html>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/abi.html gcc-4.3.1/libstdc++-v3/doc/html/manual/abi.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/abi.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/abi.html	Thu Apr 10 22:53:15 2008
*************** given compiler ABI. In a nutshell:
*** 54,60 ****
   created with the same constraints.
  </p><p>
    To use a specific version of the C++ ABI, one must use a
!   corresponding GNU C++ toolchain (Ie, g++ and libstdc++) that
    implements the C++ ABI in question.
  </p></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="abi.versioning"></a>Versioning</h3></div></div></div><p> The C++ interface has evolved throughout the history of the GNU
  C++ toolchain. With each release, various details have been changed so
--- 54,60 ----
   created with the same constraints.
  </p><p>
    To use a specific version of the C++ ABI, one must use a
!   corresponding GNU C++ toolchain (i.e., g++ and libstdc++) that
    implements the C++ ABI in question.
  </p></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="abi.versioning"></a>Versioning</h3></div></div></div><p> The C++ interface has evolved throughout the history of the GNU
  C++ toolchain. With each release, various details have been changed so
*************** release of the series to remain link com
*** 84,90 ****
      others, this is libgcc_s.so.1.  </p></li></ul></div></li><li><p>Symbol versioning on the libgcc_s.so binary.</p><p>It is versioned with the following labels and version
     definitions, where the version definition is the maximum for a
     particular release. Labels are cumulative. If a particular release
!    is not listed, it has the same version labels as the preceeding
     release.</p><p>This corresponds to the mapfile: gcc/libgcc-std.ver</p><div class="itemizedlist"><ul type="disc"><li><p>gcc-3.0.0: GCC_3.0</p></li><li><p>gcc-3.3.0: GCC_3.3</p></li><li><p>gcc-3.3.1: GCC_3.3.1</p></li><li><p>gcc-3.3.2: GCC_3.3.2</p></li><li><p>gcc-3.3.4: GCC_3.3.4</p></li><li><p>gcc-3.4.0: GCC_3.4</p></li><li><p>gcc-3.4.2: GCC_3.4.2</p></li><li><p>gcc-3.4.4: GCC_3.4.4</p></li><li><p>gcc-4.0.0: GCC_4.0.0</p></li><li><p>gcc-4.1.0: GCC_4.1.0</p></li><li><p>gcc-4.2.0: GCC_4.2.0</p></li></ul></div></li><li><p>Release versioning on the libstdc++.so binary, implemented in the same was as the libgcc_s.so binary, above.</p><p>It is versioned as follows:
      </p><div class="itemizedlist"><ul type="disc"><li><p>gcc-3.0.0: libstdc++.so.3.0.0</p></li><li><p>gcc-3.0.1: libstdc++.so.3.0.1</p></li><li><p>gcc-3.0.2: libstdc++.so.3.0.2</p></li><li><p>gcc-3.0.3: libstdc++.so.3.0.2 (Error should be libstdc++.so.3.0.3)</p></li><li><p>gcc-3.0.4: libstdc++.so.3.0.4</p></li><li><p>gcc-3.1.0: libstdc++.so.4.0.0</p></li><li><p>gcc-3.1.1: libstdc++.so.4.0.1</p></li><li><p>gcc-3.2.0: libstdc++.so.5.0.0</p></li><li><p>gcc-3.2.1: libstdc++.so.5.0.1</p></li><li><p>gcc-3.2.2: libstdc++.so.5.0.2</p></li><li><p>gcc-3.2.3: libstdc++.so.5.0.3 (Not strictly required)</p></li><li><p>gcc-3.3.0: libstdc++.so.5.0.4</p></li><li><p>gcc-3.3.1: libstdc++.so.5.0.5</p></li><li><p>gcc-3.3.2: libstdc++.so.5.0.5</p></li><li><p>gcc-3.3.3: libstdc++.so.5.0.5</p></li><li><p>gcc-3.4.0: libstdc++.so.6.0.0</p></li><li><p>gcc-3.4.1: libstdc++.so.6.0.1</p></li><li><p>gcc-3.4.2: libstdc++.so.6.0.2</p></li><li><p>gcc-3.4.3: libstdc++.so.6.0.3</p></li><li><p>gcc-3.4.4: libstdc++.so.6.0.3</p></li><li><p>gcc-3.4.5: libstdc++.so.6.0.3</p></li><li><p>gcc-3.4.6: libstdc++.so.6.0.3</p></li><li><p>gcc-4.0.0: libstdc++.so.6.0.4</p></li><li><p>gcc-4.0.1: libstdc++.so.6.0.5</p></li><li><p>gcc-4.0.2: libstdc++.so.6.0.6</p></li><li><p>gcc-4.0.3: libstdc++.so.6.0.7</p></li><li><p>gcc-4.1.0: libstdc++.so.6.0.7</p></li><li><p>gcc-4.1.1: libstdc++.so.6.0.8</p></li><li><p>gcc-4.1.2: libstdc++.so.6.0.8</p></li><li><p>gcc-4.2.0: libstdc++.so.6.0.9</p></li></ul></div></li><li><p>Symbol versioning on the libstdc++.so binary.</p><p>mapfile: libstdc++/config/linker-map.gnu</p><p>It is versioned with the following labels and version
     definitions, where the version definition is the maximum for a
--- 84,90 ----
      others, this is libgcc_s.so.1.  </p></li></ul></div></li><li><p>Symbol versioning on the libgcc_s.so binary.</p><p>It is versioned with the following labels and version
     definitions, where the version definition is the maximum for a
     particular release. Labels are cumulative. If a particular release
!    is not listed, it has the same version labels as the preceding
     release.</p><p>This corresponds to the mapfile: gcc/libgcc-std.ver</p><div class="itemizedlist"><ul type="disc"><li><p>gcc-3.0.0: GCC_3.0</p></li><li><p>gcc-3.3.0: GCC_3.3</p></li><li><p>gcc-3.3.1: GCC_3.3.1</p></li><li><p>gcc-3.3.2: GCC_3.3.2</p></li><li><p>gcc-3.3.4: GCC_3.3.4</p></li><li><p>gcc-3.4.0: GCC_3.4</p></li><li><p>gcc-3.4.2: GCC_3.4.2</p></li><li><p>gcc-3.4.4: GCC_3.4.4</p></li><li><p>gcc-4.0.0: GCC_4.0.0</p></li><li><p>gcc-4.1.0: GCC_4.1.0</p></li><li><p>gcc-4.2.0: GCC_4.2.0</p></li></ul></div></li><li><p>Release versioning on the libstdc++.so binary, implemented in the same was as the libgcc_s.so binary, above.</p><p>It is versioned as follows:
      </p><div class="itemizedlist"><ul type="disc"><li><p>gcc-3.0.0: libstdc++.so.3.0.0</p></li><li><p>gcc-3.0.1: libstdc++.so.3.0.1</p></li><li><p>gcc-3.0.2: libstdc++.so.3.0.2</p></li><li><p>gcc-3.0.3: libstdc++.so.3.0.2 (Error should be libstdc++.so.3.0.3)</p></li><li><p>gcc-3.0.4: libstdc++.so.3.0.4</p></li><li><p>gcc-3.1.0: libstdc++.so.4.0.0</p></li><li><p>gcc-3.1.1: libstdc++.so.4.0.1</p></li><li><p>gcc-3.2.0: libstdc++.so.5.0.0</p></li><li><p>gcc-3.2.1: libstdc++.so.5.0.1</p></li><li><p>gcc-3.2.2: libstdc++.so.5.0.2</p></li><li><p>gcc-3.2.3: libstdc++.so.5.0.3 (Not strictly required)</p></li><li><p>gcc-3.3.0: libstdc++.so.5.0.4</p></li><li><p>gcc-3.3.1: libstdc++.so.5.0.5</p></li><li><p>gcc-3.3.2: libstdc++.so.5.0.5</p></li><li><p>gcc-3.3.3: libstdc++.so.5.0.5</p></li><li><p>gcc-3.4.0: libstdc++.so.6.0.0</p></li><li><p>gcc-3.4.1: libstdc++.so.6.0.1</p></li><li><p>gcc-3.4.2: libstdc++.so.6.0.2</p></li><li><p>gcc-3.4.3: libstdc++.so.6.0.3</p></li><li><p>gcc-3.4.4: libstdc++.so.6.0.3</p></li><li><p>gcc-3.4.5: libstdc++.so.6.0.3</p></li><li><p>gcc-3.4.6: libstdc++.so.6.0.3</p></li><li><p>gcc-4.0.0: libstdc++.so.6.0.4</p></li><li><p>gcc-4.0.1: libstdc++.so.6.0.5</p></li><li><p>gcc-4.0.2: libstdc++.so.6.0.6</p></li><li><p>gcc-4.0.3: libstdc++.so.6.0.7</p></li><li><p>gcc-4.1.0: libstdc++.so.6.0.7</p></li><li><p>gcc-4.1.1: libstdc++.so.6.0.8</p></li><li><p>gcc-4.1.2: libstdc++.so.6.0.8</p></li><li><p>gcc-4.2.0: libstdc++.so.6.0.9</p></li></ul></div></li><li><p>Symbol versioning on the libstdc++.so binary.</p><p>mapfile: libstdc++/config/linker-map.gnu</p><p>It is versioned with the following labels and version
     definitions, where the version definition is the maximum for a
*************** release of the series to remain link com
*** 95,101 ****
     gcc-3.2.1 release, which has GLIBCPP_3.2.1 for new symbols and
     GLIBCPP_3.2 for symbols that were introduced in the gcc-3.2.0
     release.) If a particular release is not listed, it has the same
!    version labels as the preceeding release.
     </p><div class="itemizedlist"><ul type="disc"><li><p>gcc-3.0.0: (Error, not versioned)</p></li><li><p>gcc-3.0.1: (Error, not versioned)</p></li><li><p>gcc-3.0.2: (Error, not versioned)</p></li><li><p>gcc-3.0.3: (Error, not versioned)</p></li><li><p>gcc-3.0.4: (Error, not versioned)</p></li><li><p>gcc-3.1.0: GLIBCPP_3.1, CXXABI_1</p></li><li><p>gcc-3.1.1: GLIBCPP_3.1, CXXABI_1</p></li><li><p>gcc-3.2.0: GLIBCPP_3.2, CXXABI_1.2</p></li><li><p>gcc-3.2.1: GLIBCPP_3.2.1, CXXABI_1.2</p></li><li><p>gcc-3.2.2: GLIBCPP_3.2.2, CXXABI_1.2</p></li><li><p>gcc-3.2.3: GLIBCPP_3.2.2, CXXABI_1.2</p></li><li><p>gcc-3.3.0: GLIBCPP_3.2.2, CXXABI_1.2.1</p></li><li><p>gcc-3.3.1: GLIBCPP_3.2.3, CXXABI_1.2.1</p></li><li><p>gcc-3.3.2: GLIBCPP_3.2.3, CXXABI_1.2.1</p></li><li><p>gcc-3.3.3: GLIBCPP_3.2.3, CXXABI_1.2.1</p></li><li><p>gcc-3.4.0: GLIBCXX_3.4, CXXABI_1.3</p></li><li><p>gcc-3.4.1: GLIBCXX_3.4.1, CXXABI_1.3</p></li><li><p>gcc-3.4.2: GLIBCXX_3.4.2</p></li><li><p>gcc-3.4.3: GLIBCXX_3.4.3</p></li><li><p>gcc-4.0.0: GLIBCXX_3.4.4, CXXABI_1.3.1</p></li><li><p>gcc-4.0.1: GLIBCXX_3.4.5</p></li><li><p>gcc-4.0.2: GLIBCXX_3.4.6</p></li><li><p>gcc-4.0.3: GLIBCXX_3.4.7</p></li><li><p>gcc-4.1.1: GLIBCXX_3.4.8</p></li><li><p>gcc-4.2.0: GLIBCXX_3.4.9</p></li></ul></div></li><li><p>Incremental bumping of a compiler pre-defined macro,
      __GXX_ABI_VERSION. This macro is defined as the version of the
      compiler v3 ABI, with g++ 3.0.x being version 100. This macro will
--- 95,101 ----
     gcc-3.2.1 release, which has GLIBCPP_3.2.1 for new symbols and
     GLIBCPP_3.2 for symbols that were introduced in the gcc-3.2.0
     release.) If a particular release is not listed, it has the same
!    version labels as the preceding release.
     </p><div class="itemizedlist"><ul type="disc"><li><p>gcc-3.0.0: (Error, not versioned)</p></li><li><p>gcc-3.0.1: (Error, not versioned)</p></li><li><p>gcc-3.0.2: (Error, not versioned)</p></li><li><p>gcc-3.0.3: (Error, not versioned)</p></li><li><p>gcc-3.0.4: (Error, not versioned)</p></li><li><p>gcc-3.1.0: GLIBCPP_3.1, CXXABI_1</p></li><li><p>gcc-3.1.1: GLIBCPP_3.1, CXXABI_1</p></li><li><p>gcc-3.2.0: GLIBCPP_3.2, CXXABI_1.2</p></li><li><p>gcc-3.2.1: GLIBCPP_3.2.1, CXXABI_1.2</p></li><li><p>gcc-3.2.2: GLIBCPP_3.2.2, CXXABI_1.2</p></li><li><p>gcc-3.2.3: GLIBCPP_3.2.2, CXXABI_1.2</p></li><li><p>gcc-3.3.0: GLIBCPP_3.2.2, CXXABI_1.2.1</p></li><li><p>gcc-3.3.1: GLIBCPP_3.2.3, CXXABI_1.2.1</p></li><li><p>gcc-3.3.2: GLIBCPP_3.2.3, CXXABI_1.2.1</p></li><li><p>gcc-3.3.3: GLIBCPP_3.2.3, CXXABI_1.2.1</p></li><li><p>gcc-3.4.0: GLIBCXX_3.4, CXXABI_1.3</p></li><li><p>gcc-3.4.1: GLIBCXX_3.4.1, CXXABI_1.3</p></li><li><p>gcc-3.4.2: GLIBCXX_3.4.2</p></li><li><p>gcc-3.4.3: GLIBCXX_3.4.3</p></li><li><p>gcc-4.0.0: GLIBCXX_3.4.4, CXXABI_1.3.1</p></li><li><p>gcc-4.0.1: GLIBCXX_3.4.5</p></li><li><p>gcc-4.0.2: GLIBCXX_3.4.6</p></li><li><p>gcc-4.0.3: GLIBCXX_3.4.7</p></li><li><p>gcc-4.1.1: GLIBCXX_3.4.8</p></li><li><p>gcc-4.2.0: GLIBCXX_3.4.9</p></li></ul></div></li><li><p>Incremental bumping of a compiler pre-defined macro,
      __GXX_ABI_VERSION. This macro is defined as the version of the
      compiler v3 ABI, with g++ 3.0.x being version 100. This macro will
*************** class in registers, the compiler will be
*** 287,293 ****
       addition, they have the possibility of changing without impacting
       ABI compatibility.
     </p><p>The following namespaces are transformed by the mapfile:</p><div class="variablelist"><dl><dt><span class="term"><code class="code">namespace std</code></span></dt><dd><p> Defaults to exporting all symbols in label
! <code class="code">GLIBCXX</code> that do not begin with an underscore, ie
  <code class="code">__test_func</code> would not be exported by default. Select
  exceptional symbols are allowed to be visible.</p></dd><dt><span class="term"><code class="code">namespace __gnu_cxx</code></span></dt><dd><p> Defaults to not exporting any symbols in label
  <code class="code">GLIBCXX</code>, select items are allowed to be visible.</p></dd><dt><span class="term"><code class="code">namespace __gnu_internal</code></span></dt><dd><p> Defaults to not exported, no items are allowed to be visible.</p></dd><dt><span class="term"><code class="code">namespace __cxxabiv1</code>, aliased to <code class="code"> namespace abi</code></span></dt><dd><p> Defaults to not exporting any symbols in label
--- 287,293 ----
       addition, they have the possibility of changing without impacting
       ABI compatibility.
     </p><p>The following namespaces are transformed by the mapfile:</p><div class="variablelist"><dl><dt><span class="term"><code class="code">namespace std</code></span></dt><dd><p> Defaults to exporting all symbols in label
! <code class="code">GLIBCXX</code> that do not begin with an underscore, i.e.,
  <code class="code">__test_func</code> would not be exported by default. Select
  exceptional symbols are allowed to be visible.</p></dd><dt><span class="term"><code class="code">namespace __gnu_cxx</code></span></dt><dd><p> Defaults to not exporting any symbols in label
  <code class="code">GLIBCXX</code>, select items are allowed to be visible.</p></dd><dt><span class="term"><code class="code">namespace __gnu_internal</code></span></dt><dd><p> Defaults to not exported, no items are allowed to be visible.</p></dd><dt><span class="term"><code class="code">namespace __cxxabiv1</code>, aliased to <code class="code"> namespace abi</code></span></dt><dd><p> Defaults to not exporting any symbols in label
*************** gcc test.c -g -O2 -L. -lone -ltwo /usr/l
*** 428,434 ****
    difficult. In particular, compiler generated constructs such as
    implicit instantiations for templates, typeinfo information, and
    virtual tables all may cause ABI leakage across shared library
!   boundaries. Because of this, mixing C++ ABI's is not recommended at
    this time.
  </p><p>
    For more background on this issue, see these bugzilla entries:
--- 428,434 ----
    difficult. In particular, compiler generated constructs such as
    implicit instantiations for templates, typeinfo information, and
    virtual tables all may cause ABI leakage across shared library
!   boundaries. Because of this, mixing C++ ABIs is not recommended at
    this time.
  </p><p>
    For more background on this issue, see these bugzilla entries:
*************** gcc test.c -g -O2 -L. -lone -ltwo /usr/l
*** 436,489 ****
  <a class="ulink" href="http://gcc.gnu.org/PR24660" target="_top">24660: versioning weak symbols in libstdc++</a>
  </p><p>
  <a class="ulink" href="http://gcc.gnu.org/PR19664" target="_top">19664: libstdc++ headers should have pop/push of the visibility around the declarations</a>
! </p></div><div class="bibliography"><div class="titlepage"><div><div><h3 class="title"><a id="abi.biblio"></a>Bibliography</h3></div></div></div><div class="biblioentry"><a id="id510592"></a><p><span class="title"><i>
        ABIcheck, a vague idea of checking ABI compatibility
      </i>. </span><span class="biblioid">
        <a class="ulink" href="http://abicheck.sourceforge.net/" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id510609"></a><p><span class="title"><i>
        C++ ABI Reference
      </i>. </span><span class="biblioid">
        <a class="ulink" href="http://www.codesourcery.com/cxx-abi" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id510627"></a><p><span class="title"><i>
        Intel® Compilers for Linux* -Compatibility with the GNU Compilers
      </i>. </span><span class="biblioid">
        <a class="ulink" href="http://developer.intel.com/software/products/compilers/techtopics/LinuxCompilersCompatibility.htm" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id510644"></a><p><span class="title"><i>
        Intel® Compilers for Linux* -Compatibility with the GNU Compilers
      </i>. </span><span class="biblioid">
        <a class="ulink" href="http://developer.intel.com/software/products/compilers/techtopics/LinuxCompilersCompatibility.htm" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id510662"></a><p><span class="title"><i>
        Sun Solaris 2.9 : Linker and Libraries Guide (document 816-1386)
      </i>. </span><span class="biblioid">
        <a class="ulink" href="http://docs.sun.com/?p=/doc/816-1386&amp;a=load" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id510679"></a><p><span class="title"><i>
        Sun Solaris 2.9 : C++ Migration Guide (document 816-2459)
      </i>. </span><span class="biblioid">
        <a class="ulink" href="http://docs.sun.com/db/prod/solaris.9" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id510696"></a><p><span class="title"><i>
        ELF Symbol Versioning
      </i>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="biblioid">
        <a class="ulink" href="http://people.redhat.com/drepper/symbol-versioning" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id510725"></a><p><span class="title"><i>
        C++ ABI for the ARM Architecture
      </i>. </span><span class="biblioid">
        <a class="ulink" href="http://www.arm.com/miscPDFs/8033.pdf" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id510742"></a><p><span class="title"><i>
        Dynamic Shared Objects: Survey and Issues
      </i>. </span><span class="subtitle">
        ISO C++ J16/06-0046
      . </span><span class="author"><span class="firstname">Benjamin</span> <span class="surname">Kosnik</span>. </span><span class="biblioid">
        <a class="ulink" href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n1976.html" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id499374"></a><p><span class="title"><i>
        Versioning With Namespaces
      </i>. </span><span class="subtitle">
        ISO C++ J16/06-0083
--- 436,489 ----
  <a class="ulink" href="http://gcc.gnu.org/PR24660" target="_top">24660: versioning weak symbols in libstdc++</a>
  </p><p>
  <a class="ulink" href="http://gcc.gnu.org/PR19664" target="_top">19664: libstdc++ headers should have pop/push of the visibility around the declarations</a>
! </p></div><div class="bibliography"><div class="titlepage"><div><div><h3 class="title"><a id="abi.biblio"></a>Bibliography</h3></div></div></div><div class="biblioentry"><a id="id429530"></a><p><span class="title"><i>
        ABIcheck, a vague idea of checking ABI compatibility
      </i>. </span><span class="biblioid">
        <a class="ulink" href="http://abicheck.sourceforge.net/" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id429548"></a><p><span class="title"><i>
        C++ ABI Reference
      </i>. </span><span class="biblioid">
        <a class="ulink" href="http://www.codesourcery.com/cxx-abi" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id429565"></a><p><span class="title"><i>
        Intel® Compilers for Linux* -Compatibility with the GNU Compilers
      </i>. </span><span class="biblioid">
        <a class="ulink" href="http://developer.intel.com/software/products/compilers/techtopics/LinuxCompilersCompatibility.htm" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id429583"></a><p><span class="title"><i>
        Intel® Compilers for Linux* -Compatibility with the GNU Compilers
      </i>. </span><span class="biblioid">
        <a class="ulink" href="http://developer.intel.com/software/products/compilers/techtopics/LinuxCompilersCompatibility.htm" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id429600"></a><p><span class="title"><i>
        Sun Solaris 2.9 : Linker and Libraries Guide (document 816-1386)
      </i>. </span><span class="biblioid">
        <a class="ulink" href="http://docs.sun.com/?p=/doc/816-1386&amp;a=load" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id429617"></a><p><span class="title"><i>
        Sun Solaris 2.9 : C++ Migration Guide (document 816-2459)
      </i>. </span><span class="biblioid">
        <a class="ulink" href="http://docs.sun.com/db/prod/solaris.9" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id429635"></a><p><span class="title"><i>
        ELF Symbol Versioning
      </i>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="biblioid">
        <a class="ulink" href="http://people.redhat.com/drepper/symbol-versioning" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id429663"></a><p><span class="title"><i>
        C++ ABI for the ARM Architecture
      </i>. </span><span class="biblioid">
        <a class="ulink" href="http://www.arm.com/miscPDFs/8033.pdf" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id429680"></a><p><span class="title"><i>
        Dynamic Shared Objects: Survey and Issues
      </i>. </span><span class="subtitle">
        ISO C++ J16/06-0046
      . </span><span class="author"><span class="firstname">Benjamin</span> <span class="surname">Kosnik</span>. </span><span class="biblioid">
        <a class="ulink" href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n1976.html" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id497460"></a><p><span class="title"><i>
        Versioning With Namespaces
      </i>. </span><span class="subtitle">
        ISO C++ J16/06-0083
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/api.html gcc-4.3.1/libstdc++-v3/doc/html/manual/api.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/api.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/api.html	Thu Apr 10 22:53:15 2008
***************
*** 1,7 ****
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
  <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>API Evolution and Deprecation History</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="ISO C++, api, evolution, deprecation, history" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="appendix_porting.html" title="Appendix B. Porting and Maintenance" /><link rel="prev" href="abi.html" title="ABI Policy and Guidelines" /><link rel="next" href="backwards.html" title="Backwards Compatibility" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">API Evolution and Deprecation History</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="abi.html">Prev</a> </td><th width="60%" align="center">Appendix B. Porting and Maintenance</th><td width="20%" align="right"> <a accesskey="n" href="backwards.html">Next</a></td></tr></table><hr /></div><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="appendix.porting.api"></a>API Evolution and Deprecation History</h2></div></div></div><p>
! A list of user-visible changes, in cronological order
  </p><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="api.rel_300"></a><code class="constant">3.0</code></h3></div></div></div><p>
  Extensions moved to <code class="filename">include/ext</code>.
    </p><p>
--- 1,7 ----
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
  <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>API Evolution and Deprecation History</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="ISO C++, api, evolution, deprecation, history" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="appendix_porting.html" title="Appendix B. Porting and Maintenance" /><link rel="prev" href="abi.html" title="ABI Policy and Guidelines" /><link rel="next" href="backwards.html" title="Backwards Compatibility" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">API Evolution and Deprecation History</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="abi.html">Prev</a> </td><th width="60%" align="center">Appendix B. Porting and Maintenance</th><td width="20%" align="right"> <a accesskey="n" href="backwards.html">Next</a></td></tr></table><hr /></div><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="appendix.porting.api"></a>API Evolution and Deprecation History</h2></div></div></div><p>
! A list of user-visible changes, in chronological order
  </p><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="api.rel_300"></a><code class="constant">3.0</code></h3></div></div></div><p>
  Extensions moved to <code class="filename">include/ext</code>.
    </p><p>
*************** _Alloc_traits</code> have been removed.
*** 52,58 ****
  </p><p>Default behavior of <code class="code">std::allocator</code> has changed.</p><p>
     Previous versions prior to 3.4 cache allocations in a memory
     pool, instead of passing through to call the global allocation
!    operators (ie, <code class="classname">__gnu_cxx::pool_allocator</code>).  More
     recent versions default to the
     simpler <code class="classname">__gnu_cxx::new_allocator</code>.
  </p><p> Previously, all allocators were written to the SGI
--- 52,58 ----
  </p><p>Default behavior of <code class="code">std::allocator</code> has changed.</p><p>
     Previous versions prior to 3.4 cache allocations in a memory
     pool, instead of passing through to call the global allocation
!    operators (i.e., <code class="classname">__gnu_cxx::pool_allocator</code>).  More
     recent versions default to the
     simpler <code class="classname">__gnu_cxx::new_allocator</code>.
  </p><p> Previously, all allocators were written to the SGI
*************** _Alloc_traits</code> have been removed.
*** 72,82 ****
     <span class="type">__alloc</span> to select an underlying allocator that
     satisfied memory allocation requests. The selection of this
     underlying allocator was not user-configurable.
!    </p><div class="table"><a id="id456920"></a><p class="title"><b>Table B.1. Extension Allocators</b></p><div class="table-contents"><table summary="Extension Allocators" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /></colgroup><thead><tr><th align="left">Allocator (3.4)</th><th align="left">Header (3.4)</th><th align="left">Allocator (3.[0-3])</th><th align="left">Header (3.[0-3])</th></tr></thead><tbody><tr><td align="left"><code class="classname">__gnu_cxx::new_allocator&lt;T&gt;</code></td><td align="left"><code class="filename">ext/new_allocator.h</code></td><td align="left"><code class="classname">std::__new_alloc</code></td><td align="left"><code class="filename">memory</code></td></tr><tr><td align="left"><code class="classname">__gnu_cxx::malloc_allocator&lt;T&gt;</code></td><td align="left"><code class="filename">ext/malloc_allocator.h</code></td><td align="left"><code class="classname">std::__malloc_alloc_template&lt;int&gt;</code></td><td align="left"><code class="filename">memory</code></td></tr><tr><td align="left"><code class="classname">__gnu_cxx::debug_allocator&lt;T&gt;</code></td><td align="left"><code class="filename">ext/debug_allocator.h</code></td><td align="left"><code class="classname">std::debug_alloc&lt;T&gt;</code></td><td align="left"><code class="filename">memory</code></td></tr><tr><td align="left"><code class="classname">__gnu_cxx::__pool_alloc&lt;T&gt;</code></td><td align="left"><code class="filename">ext/pool_allocator.h</code></td><td align="left"><code class="classname">std::__default_alloc_template&lt;bool,int&gt;</code></td><td align="left"><code class="filename">memory</code></td></tr><tr><td align="left"><code class="classname">__gnu_cxx::__mt_alloc&lt;T&gt;</code></td><td align="left"><code class="filename">ext/mt_allocator.h</code></td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left"><code class="classname">__gnu_cxx::bitmap_allocator&lt;T&gt;</code></td><td align="left"><code class="filename">ext/bitmap_allocator.h</code></td><td align="left"> </td><td align="left"> </td></tr></tbody></table></div></div><br class="table-break" /><p> Releases after gcc-3.4 have continued to add to the collection
     of available allocators. All of these new allocators are
     standard-style. The following table includes details, along with
     the first released version of GCC that included the extension allocator.
!    </p><div class="table"><a id="id408028"></a><p class="title"><b>Table B.2. Extension Allocators Continued</b></p><div class="table-contents"><table summary="Extension Allocators Continued" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /></colgroup><thead><tr><th align="left">Allocator</th><th align="left">Include</th><th align="left">Version</th></tr></thead><tbody><tr><td align="left"><code class="classname">__gnu_cxx::array_allocator&lt;T&gt;</code></td><td align="left"><code class="filename">ext/array_allocator.h</code></td><td align="left">4.0.0</td></tr><tr><td align="left"><code class="classname">__gnu_cxx::throw_allocator&lt;T&gt;</code></td><td align="left"><code class="filename">ext/throw_allocator.h</code></td><td align="left">4.2.0</td></tr></tbody></table></div></div><br class="table-break" /><p>
  Debug mode first appears.
  </p><p>
  Precompiled header support <acronym class="acronym">PCH</acronym> support.
--- 72,82 ----
     <span class="type">__alloc</span> to select an underlying allocator that
     satisfied memory allocation requests. The selection of this
     underlying allocator was not user-configurable.
!    </p><div class="table"><a id="id521812"></a><p class="title"><b>Table B.1. Extension Allocators</b></p><div class="table-contents"><table summary="Extension Allocators" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /></colgroup><thead><tr><th align="left">Allocator (3.4)</th><th align="left">Header (3.4)</th><th align="left">Allocator (3.[0-3])</th><th align="left">Header (3.[0-3])</th></tr></thead><tbody><tr><td align="left"><code class="classname">__gnu_cxx::new_allocator&lt;T&gt;</code></td><td align="left"><code class="filename">ext/new_allocator.h</code></td><td align="left"><code class="classname">std::__new_alloc</code></td><td align="left"><code class="filename">memory</code></td></tr><tr><td align="left"><code class="classname">__gnu_cxx::malloc_allocator&lt;T&gt;</code></td><td align="left"><code class="filename">ext/malloc_allocator.h</code></td><td align="left"><code class="classname">std::__malloc_alloc_template&lt;int&gt;</code></td><td align="left"><code class="filename">memory</code></td></tr><tr><td align="left"><code class="classname">__gnu_cxx::debug_allocator&lt;T&gt;</code></td><td align="left"><code class="filename">ext/debug_allocator.h</code></td><td align="left"><code class="classname">std::debug_alloc&lt;T&gt;</code></td><td align="left"><code class="filename">memory</code></td></tr><tr><td align="left"><code class="classname">__gnu_cxx::__pool_alloc&lt;T&gt;</code></td><td align="left"><code class="filename">ext/pool_allocator.h</code></td><td align="left"><code class="classname">std::__default_alloc_template&lt;bool,int&gt;</code></td><td align="left"><code class="filename">memory</code></td></tr><tr><td align="left"><code class="classname">__gnu_cxx::__mt_alloc&lt;T&gt;</code></td><td align="left"><code class="filename">ext/mt_allocator.h</code></td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left"><code class="classname">__gnu_cxx::bitmap_allocator&lt;T&gt;</code></td><td align="left"><code class="filename">ext/bitmap_allocator.h</code></td><td align="left"> </td><td align="left"> </td></tr></tbody></table></div></div><br class="table-break" /><p> Releases after gcc-3.4 have continued to add to the collection
     of available allocators. All of these new allocators are
     standard-style. The following table includes details, along with
     the first released version of GCC that included the extension allocator.
!    </p><div class="table"><a id="id422487"></a><p class="title"><b>Table B.2. Extension Allocators Continued</b></p><div class="table-contents"><table summary="Extension Allocators Continued" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /></colgroup><thead><tr><th align="left">Allocator</th><th align="left">Include</th><th align="left">Version</th></tr></thead><tbody><tr><td align="left"><code class="classname">__gnu_cxx::array_allocator&lt;T&gt;</code></td><td align="left"><code class="filename">ext/array_allocator.h</code></td><td align="left">4.0.0</td></tr><tr><td align="left"><code class="classname">__gnu_cxx::throw_allocator&lt;T&gt;</code></td><td align="left"><code class="filename">ext/throw_allocator.h</code></td><td align="left">4.2.0</td></tr></tbody></table></div></div><br class="table-break" /><p>
  Debug mode first appears.
  </p><p>
  Precompiled header support <acronym class="acronym">PCH</acronym> support.
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/appendix_contributing.html gcc-4.3.1/libstdc++-v3/doc/html/manual/appendix_contributing.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/appendix_contributing.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/appendix_contributing.html	Thu Apr 10 22:53:15 2008
***************
*** 1,6 ****
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Appendix A. Contributing</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="spine.html" title="The GNU C++ Library" /><link rel="prev" href="bk01pt12ch40s03.html" title="Use" /><link rel="next" href="bk01apas02.html" title="Directory Layout and Source Conventions" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Appendix A. Contributing</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk01pt12ch40s03.html">Prev</a> </td><th width="60%" align="center">The GNU C++ Library</th><td width="20%" align="right"> <a accesskey="n" href="bk01apas02.html">Next</a></td></tr></table><hr /></div><div class="appendix" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="appendix.contrib"></a>Appendix A. Contributing</h2></div></div></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><span class="sect1"><a href="appendix_contributing.html#contrib.list">Contributor Checklist</a></span></dt><dd><dl><dt><span class="sect2"><a href="appendix_contributing.html#list.reading">Reading</a></span></dt><dt><span class="sect2"><a href="appendix_contributing.html#list.copyright">Assignment</a></span></dt><dt><span class="sect2"><a href="appendix_contributing.html#list.getting">Getting Sources</a></span></dt><dt><span class="sect2"><a href="appendix_contributing.html#list.patches">Submitting Patches</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01apas02.html">Directory Layout and Source Conventions</a></span></dt><dt><span class="sect1"><a href="bk01apas03.html">Coding Style</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01apas03.html#coding_style.bad_identifiers">Bad Itentifiers</a></span></dt><dt><span class="sect2"><a href="bk01apas03.html#coding_style.example">By Example</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01apas04.html">Documentation Style</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01apas04.html#doc_style.doxygen">Doxygen</a></span></dt><dt><span class="sect2"><a href="bk01apas04.html#doc_style.docbook">Docbook</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01apas05.html">Design Notes</a></span></dt></dl></div><p> 
    The GNU C++ Library follows an open development model. Active
    contributors are assigned maintainer-ship responsibility, and given
    write access to the source repository. First time contributors
--- 1,6 ----
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Appendix A. Contributing</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="spine.html" title="The GNU C++ Library" /><link rel="prev" href="bk01pt12ch40s03.html" title="Use" /><link rel="next" href="bk01apas02.html" title="Directory Layout and Source Conventions" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Appendix A. Contributing</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk01pt12ch40s03.html">Prev</a> </td><th width="60%" align="center">The GNU C++ Library</th><td width="20%" align="right"> <a accesskey="n" href="bk01apas02.html">Next</a></td></tr></table><hr /></div><div class="appendix" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="appendix.contrib"></a>Appendix A. Contributing</h2></div></div></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><span class="sect1"><a href="appendix_contributing.html#contrib.list">Contributor Checklist</a></span></dt><dd><dl><dt><span class="sect2"><a href="appendix_contributing.html#list.reading">Reading</a></span></dt><dt><span class="sect2"><a href="appendix_contributing.html#list.copyright">Assignment</a></span></dt><dt><span class="sect2"><a href="appendix_contributing.html#list.getting">Getting Sources</a></span></dt><dt><span class="sect2"><a href="appendix_contributing.html#list.patches">Submitting Patches</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01apas02.html">Directory Layout and Source Conventions</a></span></dt><dt><span class="sect1"><a href="bk01apas03.html">Coding Style</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01apas03.html#coding_style.bad_identifiers">Bad Identifiers</a></span></dt><dt><span class="sect2"><a href="bk01apas03.html#coding_style.example">By Example</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01apas04.html">Documentation Style</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01apas04.html#doc_style.doxygen">Doxygen</a></span></dt><dt><span class="sect2"><a href="bk01apas04.html#doc_style.docbook">Docbook</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01apas05.html">Design Notes</a></span></dt></dl></div><p> 
    The GNU C++ Library follows an open development model. Active
    contributors are assigned maintainer-ship responsibility, and given
    write access to the source repository. First time contributors
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/appendix_porting.html gcc-4.3.1/libstdc++-v3/doc/html/manual/appendix_porting.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/appendix_porting.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/appendix_porting.html	Thu Apr 10 22:53:15 2008
***************
*** 47,53 ****
      discourage that.
  </p></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="build_hacking.conventions"></a>Coding and Commenting Conventions</h3></div></div></div><p>
      Most comments should use {octothorpes, shibboleths, hash marks,
!     pound signs, whatevers} rather than "dnl".  Nearly all comments in
      configure.ac should.  Comments inside macros written in ancilliary
      .m4 files should.  About the only comments which should
      <span class="emphasis"><em>not</em></span> use #, but use dnl instead, are comments
--- 47,53 ----
      discourage that.
  </p></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="build_hacking.conventions"></a>Coding and Commenting Conventions</h3></div></div></div><p>
      Most comments should use {octothorpes, shibboleths, hash marks,
!     pound signs, whatever} rather than "dnl".  Nearly all comments in
      configure.ac should.  Comments inside macros written in ancilliary
      .m4 files should.  About the only comments which should
      <span class="emphasis"><em>not</em></span> use #, but use dnl instead, are comments
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/backwards.html gcc-4.3.1/libstdc++-v3/doc/html/manual/backwards.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/backwards.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/backwards.html	Thu Apr 10 22:53:15 2008
*************** ISO Standard (e.g., statistical analysis
*** 14,21 ****
  really useful things that are used by a lot of people, the Standards
  Committee couldn't include everything, and so a lot of those
  “<span class="quote">obvious</span>” classes didn't get included.
! </p><p>Known Issues include many of the limitations of its immediate ancestor.</p><p>Portability notes and known implementation limitations are as follows.</p><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id390292"></a>No <code class="code">ios_base</code></h4></div></div></div><p> At least some older implementations don't have <code class="code">std::ios_base</code>, so you should use <code class="code">std::ios::badbit</code>, <code class="code">std::ios::failbit</code> and <code class="code">std::ios::eofbit</code> and <code class="code">std::ios::goodbit</code>.
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id390324"></a>No <code class="code">cout</code> in <code class="code">ostream.h</code>, no <code class="code">cin</code> in <code class="code">istream.h</code></h4></div></div></div><p>
  	In earlier versions of the standard,
  	<code class="filename">fstream.h</code>,
  	<code class="filename">ostream.h</code>
--- 14,21 ----
  really useful things that are used by a lot of people, the Standards
  Committee couldn't include everything, and so a lot of those
  “<span class="quote">obvious</span>” classes didn't get included.
! </p><p>Known Issues include many of the limitations of its immediate ancestor.</p><p>Portability notes and known implementation limitations are as follows.</p><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id493961"></a>No <code class="code">ios_base</code></h4></div></div></div><p> At least some older implementations don't have <code class="code">std::ios_base</code>, so you should use <code class="code">std::ios::badbit</code>, <code class="code">std::ios::failbit</code> and <code class="code">std::ios::eofbit</code> and <code class="code">std::ios::goodbit</code>.
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id493993"></a>No <code class="code">cout</code> in <code class="code">ostream.h</code>, no <code class="code">cin</code> in <code class="code">istream.h</code></h4></div></div></div><p>
  	In earlier versions of the standard,
  	<code class="filename">fstream.h</code>,
  	<code class="filename">ostream.h</code>
*************** considered replaced and rewritten.
*** 41,47 ****
    archived.  The code is considered replaced and rewritten.
  </p><p>
    Portability notes and known implementation limitations are as follows.
! </p><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id390424"></a>Namespace <code class="code">std::</code> not supported</h4></div></div></div><p>
      Some care is required to support C++ compiler and or library
      implementation that do not have the standard library in
      <code class="code">namespace std</code>.
--- 41,47 ----
    archived.  The code is considered replaced and rewritten.
  </p><p>
    Portability notes and known implementation limitations are as follows.
! </p><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id494094"></a>Namespace <code class="code">std::</code> not supported</h4></div></div></div><p>
      Some care is required to support C++ compiler and or library
      implementation that do not have the standard library in
      <code class="code">namespace std</code>.
*************** considered replaced and rewritten.
*** 77,83 ****
      then using that to set a value for the <code class="code">NAMESPACE_STD</code>
      macro.  At that point, one is able to use
      <code class="code">NAMESPACE_STD::string</code>, which will evaluate to
!     <code class="code">std::string</code> or <code class="code">::string</code> (ie, in the
      global namespace on systems that do not put <code class="code">string</code> in
      <code class="code">std::</code>).
    </p><pre class="programlisting">
--- 77,83 ----
      then using that to set a value for the <code class="code">NAMESPACE_STD</code>
      macro.  At that point, one is able to use
      <code class="code">NAMESPACE_STD::string</code>, which will evaluate to
!     <code class="code">std::string</code> or <code class="code">::string</code> (i.e., in the
      global namespace on systems that do not put <code class="code">string</code> in
      <code class="code">std::</code>).
    </p><pre class="programlisting">
*************** AC_DEFUN([AC_CXX_NAMESPACE_STD], [
*** 105,111 ****
      AC_DEFINE(HAVE_NAMESPACE_STD,,[Define if g++ supports namespace std. ])
    fi
  ])
! </pre></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id393816"></a>Illegal iterator usage</h4></div></div></div><p>
    The following illustrate implementation-allowed illegal iterator
    use, and then correct use.
  </p><div class="itemizedlist"><ul type="disc"><li><p>
--- 105,111 ----
      AC_DEFINE(HAVE_NAMESPACE_STD,,[Define if g++ supports namespace std. ])
    fi
  ])
! </pre></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id509052"></a>Illegal iterator usage</h4></div></div></div><p>
    The following illustrate implementation-allowed illegal iterator
    use, and then correct use.
  </p><div class="itemizedlist"><ul type="disc"><li><p>
*************** AC_DEFUN([AC_CXX_NAMESPACE_STD], [
*** 118,124 ****
      </p></li><li><p>
        <code class="code">if (iterator)</code> won't work any more =&gt; use
        <code class="code">if (iterator != iterator_type())</code> 
!     </p></li></ul></div></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id393877"></a><code class="code">isspace</code> from <code class="filename">cctype</code> is a macro
    </h4></div></div></div><p> 
      Glibc 2.0.x and 2.1.x define <code class="filename">ctype.h</code> functionality as macros
      (isspace, isalpha etc.).
--- 118,124 ----
      </p></li><li><p>
        <code class="code">if (iterator)</code> won't work any more =&gt; use
        <code class="code">if (iterator != iterator_type())</code> 
!     </p></li></ul></div></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id509113"></a><code class="code">isspace</code> from <code class="filename">cctype</code> is a macro
    </h4></div></div></div><p> 
      Glibc 2.0.x and 2.1.x define <code class="filename">ctype.h</code> functionality as macros
      (isspace, isalpha etc.).
*************** std:: (__ctype_b[(int) ( ( 'X' ) )] &amp
*** 151,157 ****
    (<code class="filename">ctype.h</code>) and the
    definitions in namespace <code class="code">std::</code>
    (<code class="code">&lt;cctype&gt;</code>).
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id450846"></a>No <code class="code">vector::at</code>, <code class="code">deque::at</code>, <code class="code">string::at</code></h4></div></div></div><p>
    One solution is to add an autoconf-test for this:
  </p><pre class="programlisting">
  AC_MSG_CHECKING(for container::at)
--- 151,157 ----
    (<code class="filename">ctype.h</code>) and the
    definitions in namespace <code class="code">std::</code>
    (<code class="code">&lt;cctype&gt;</code>).
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id509207"></a>No <code class="code">vector::at</code>, <code class="code">deque::at</code>, <code class="code">string::at</code></h4></div></div></div><p>
    One solution is to add an autoconf-test for this:
  </p><pre class="programlisting">
  AC_MSG_CHECKING(for container::at)
*************** AC_DEFINE(HAVE_CONTAINER_AT)],
*** 177,183 ****
  </pre><p>
    If you are using other (non-GNU) compilers it might be a good idea
    to check for <code class="code">string::at</code> separately.
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id450884"></a>No <code class="code">std::char_traits&lt;char&gt;::eof</code></h4></div></div></div><p>
    Use some kind of autoconf test, plus this:
  </p><pre class="programlisting">
  #ifdef HAVE_CHAR_TRAITS
--- 177,183 ----
  </pre><p>
    If you are using other (non-GNU) compilers it might be a good idea
    to check for <code class="code">string::at</code> separately.
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id509245"></a>No <code class="code">std::char_traits&lt;char&gt;::eof</code></h4></div></div></div><p>
    Use some kind of autoconf test, plus this:
  </p><pre class="programlisting">
  #ifdef HAVE_CHAR_TRAITS
*************** AC_DEFINE(HAVE_CONTAINER_AT)],
*** 185,191 ****
  #else
  #define CPP_EOF EOF
  #endif
! </pre></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id450902"></a>No <code class="code">string::clear</code></h4></div></div></div><p>
    There are two functions for deleting the contents of a string:
    <code class="code">clear</code> and <code class="code">erase</code> (the latter returns the
    string).
--- 185,191 ----
  #else
  #define CPP_EOF EOF
  #endif
! </pre></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id509263"></a>No <code class="code">string::clear</code></h4></div></div></div><p>
    There are two functions for deleting the contents of a string:
    <code class="code">clear</code> and <code class="code">erase</code> (the latter returns the
    string).
*************** erase(size_type __pos = 0, size_type __n
*** 200,214 ****
                            _M_data(), _M_data()); 
  }
  </pre><p>
!   Unfortunately, ut <code class="code">clear</code> is not implemented in this
    version, so you should use <code class="code">erase</code> (which is probably
    faster than <code class="code">operator=(charT*)</code>).
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id450947"></a>
    Removal of <code class="code">ostream::form</code> and <code class="code">istream::scan</code>
    extensions
  </h4></div></div></div><p> 
    These are no longer supported. Please use stringstreams instead.
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id450966"></a>No <code class="code">basic_stringbuf</code>, <code class="code">basic_stringstream</code></h4></div></div></div><p>
    Although the ISO standard <code class="code">i/ostringstream</code>-classes are
    provided, (<code class="filename">sstream</code>), for
    compatibility with older implementations the pre-ISO
--- 200,214 ----
                            _M_data(), _M_data()); 
  }
  </pre><p>
!   Unfortunately, <code class="code">clear</code> is not implemented in this
    version, so you should use <code class="code">erase</code> (which is probably
    faster than <code class="code">operator=(charT*)</code>).
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id509309"></a>
    Removal of <code class="code">ostream::form</code> and <code class="code">istream::scan</code>
    extensions
  </h4></div></div></div><p> 
    These are no longer supported. Please use stringstreams instead.
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id509328"></a>No <code class="code">basic_stringbuf</code>, <code class="code">basic_stringstream</code></h4></div></div></div><p>
    Although the ISO standard <code class="code">i/ostringstream</code>-classes are
    provided, (<code class="filename">sstream</code>), for
    compatibility with older implementations the pre-ISO
*************** any = temp;
*** 296,309 ****
    Another example of using stringstreams is in <a class="link" href="bk01pt05ch13s05.html" title="Shrink to Fit">this howto</a>.
  </p><p> There is additional information in the libstdc++-v2 info files, in
  particular “<span class="quote">info iostream</span>”.
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id451118"></a>Little or no wide character support</h4></div></div></div><p>
      Classes <code class="classname">wstring</code> and
      <code class="classname">char_traits&lt;wchar_t&gt;</code> are
      not supported.
!   </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id451137"></a>No templatized iostreams</h4></div></div></div><p>
      Classes <code class="classname">wfilebuf</code> and
      <code class="classname">wstringstream</code> are not supported.
!   </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id451156"></a>Thread safety issues</h4></div></div></div><p>
      Earlier GCC releases had a somewhat different approach to
      threading configuration and proper compilation.  Before GCC 3.0,
      configuration of the threading model was dictated by compiler
--- 296,309 ----
    Another example of using stringstreams is in <a class="link" href="bk01pt05ch13s05.html" title="Shrink to Fit">this howto</a>.
  </p><p> There is additional information in the libstdc++-v2 info files, in
  particular “<span class="quote">info iostream</span>”.
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id466068"></a>Little or no wide character support</h4></div></div></div><p>
      Classes <code class="classname">wstring</code> and
      <code class="classname">char_traits&lt;wchar_t&gt;</code> are
      not supported.
!   </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id466087"></a>No templatized iostreams</h4></div></div></div><p>
      Classes <code class="classname">wfilebuf</code> and
      <code class="classname">wstringstream</code> are not supported.
!   </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id466106"></a>Thread safety issues</h4></div></div></div><p>
      Earlier GCC releases had a somewhat different approach to
      threading configuration and proper compilation.  Before GCC 3.0,
      configuration of the threading model was dictated by compiler
*************** libstdc++-v3.
*** 361,367 ****
           of the SGI STL (version 3.3), with extensive changes.
        </p><p>A more formal description of the V3 goals can be found in the
           official <a class="ulink" href="../17_intro/DESIGN" target="_top">design document</a>.
!       </p><p>Portability notes and known implementation limitations are as follows.</p><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id516132"></a>Pre-ISO headers moved to backwards or removed</h4></div></div></div><p> The pre-ISO C++ headers
        (<code class="code">iostream.h</code>, <code class="code">defalloc.h</code> etc.) are
        available, unlike previous libstdc++ versions, but inclusion
        generates a warning that you are using deprecated headers.
--- 361,367 ----
           of the SGI STL (version 3.3), with extensive changes.
        </p><p>A more formal description of the V3 goals can be found in the
           official <a class="ulink" href="../17_intro/DESIGN" target="_top">design document</a>.
!       </p><p>Portability notes and known implementation limitations are as follows.</p><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id466225"></a>Pre-ISO headers moved to backwards or removed</h4></div></div></div><p> The pre-ISO C++ headers
        (<code class="code">iostream.h</code>, <code class="code">defalloc.h</code> etc.) are
        available, unlike previous libstdc++ versions, but inclusion
        generates a warning that you are using deprecated headers.
*************** like <code class="filename">vector.h</co
*** 433,439 ****
  directive <code class="code">using namespace std;</code> can be put at the global
  scope. This should be enough to get this code compiling, assuming the
  other usage is correct.
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id516213"></a>Extension headers hash_map, hash_set moved to ext or backwards</h4></div></div></div><p>At this time most of the features of the SGI STL extension have been
           replaced by standardized libraries.
           In particular, the unordered_map and unordered_set containers of TR1
           are suitable replacement for the non-standard hash_map and hash_set
--- 433,439 ----
  directive <code class="code">using namespace std;</code> can be put at the global
  scope. This should be enough to get this code compiling, assuming the
  other usage is correct.
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id466308"></a>Extension headers hash_map, hash_set moved to ext or backwards</h4></div></div></div><p>At this time most of the features of the SGI STL extension have been
           replaced by standardized libraries.
           In particular, the unordered_map and unordered_set containers of TR1
           are suitable replacement for the non-standard hash_map and hash_set
*************** AC_DEFUN([AC_HEADER_EXT_HASH_SET], [
*** 505,511 ****
      AC_DEFINE(HAVE_EXT_HASH_SET,,[Define if ext/hash_set is present. ])
    fi
  ])
! </pre></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id516316"></a>No <code class="code">ios::nocreate/ios::noreplace</code>.
  </h4></div></div></div><p> The existence of <code class="code">ios::nocreate</code> being used for
  input-streams has been confirmed, most probably because the author
  thought it would be more correct to specify nocreate explicitly.  So
--- 505,511 ----
      AC_DEFINE(HAVE_EXT_HASH_SET,,[Define if ext/hash_set is present. ])
    fi
  ])
! </pre></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id466429"></a>No <code class="code">ios::nocreate/ios::noreplace</code>.
  </h4></div></div></div><p> The existence of <code class="code">ios::nocreate</code> being used for
  input-streams has been confirmed, most probably because the author
  thought it would be more correct to specify nocreate explicitly.  So
*************** open the file for reading, check if it h
*** 516,522 ****
  decide whether you want to create/replace or not. To my knowledge,
  even older implementations support <code class="code">app</code>, <code class="code">ate</code>
  and <code class="code">trunc</code> (except for <code class="code">app</code> ?).
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id516364"></a>
  No <code class="code">stream::attach(int fd)</code>
  </h4></div></div></div><p>
        Phil Edwards writes: It was considered and rejected for the ISO
--- 516,522 ----
  decide whether you want to create/replace or not. To my knowledge,
  even older implementations support <code class="code">app</code>, <code class="code">ate</code>
  and <code class="code">trunc</code> (except for <code class="code">app</code> ?).
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id466476"></a>
  No <code class="code">stream::attach(int fd)</code>
  </h4></div></div></div><p>
        Phil Edwards writes: It was considered and rejected for the ISO
*************** No <code class="code">stream::attach(int
*** 524,530 ****
        that do, not all of them use integers to represent them.
      </p><p>
        For a portable solution (among systems which use
!       filedescriptors), you need to implement a subclass of
        <code class="code">std::streambuf</code> (or
        <code class="code">std::basic_streambuf&lt;..&gt;</code>) which opens a file
        given a descriptor, and then pass an instance of this to the
--- 524,530 ----
        that do, not all of them use integers to represent them.
      </p><p>
        For a portable solution (among systems which use
!       file descriptors), you need to implement a subclass of
        <code class="code">std::streambuf</code> (or
        <code class="code">std::basic_streambuf&lt;..&gt;</code>) which opens a file
        given a descriptor, and then pass an instance of this to the
*************** No <code class="code">stream::attach(int
*** 539,545 ****
   For another example of this, refer to
        <a class="ulink" href="http://www.josuttis.com/cppcode/fdstream.html" target="_top">fdstream example</a> 
        by Nicolai Josuttis.
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id516428"></a>
  Support for C++98 dialect.
  </h4></div></div></div><p>Check for complete library coverage of the C++1998/2003 standard.
  </p><pre class="programlisting">
--- 539,545 ----
   For another example of this, refer to
        <a class="ulink" href="http://www.josuttis.com/cppcode/fdstream.html" target="_top">fdstream example</a> 
        by Nicolai Josuttis.
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id466540"></a>
  Support for C++98 dialect.
  </h4></div></div></div><p>Check for complete library coverage of the C++1998/2003 standard.
  </p><pre class="programlisting">
*************** AC_DEFUN([AC_HEADER_STDCXX_98], [
*** 607,613 ****
      AC_DEFINE(STDCXX_98_HEADERS,,[Define if ISO C++ 1998 header files are present. ])
    fi
  ])
! </pre></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id516455"></a>
  Support for C++TR1 dialect.
  </h4></div></div></div><p>Check for library coverage of the TR1 standard.
  </p><pre class="programlisting">
--- 607,613 ----
      AC_DEFINE(STDCXX_98_HEADERS,,[Define if ISO C++ 1998 header files are present. ])
    fi
  ])
! </pre></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id466568"></a>
  Support for C++TR1 dialect.
  </h4></div></div></div><p>Check for library coverage of the TR1 standard.
  </p><pre class="programlisting">
*************** AC_DEFUN([AC_HEADER_TR1_UNORDERED_SET], 
*** 684,690 ****
      AC_DEFINE(HAVE_TR1_UNORDERED_SET,,[Define if tr1/unordered_set is present. ])
    fi
  ])
! </pre></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id516499"></a>
  Support for C++0x dialect.
  </h4></div></div></div><p>Check for baseline language coverage in the compiler for the C++0xstandard.
  </p><pre class="programlisting">
--- 684,690 ----
      AC_DEFINE(HAVE_TR1_UNORDERED_SET,,[Define if tr1/unordered_set is present. ])
    fi
  ])
! </pre></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id466612"></a>
  Support for C++0x dialect.
  </h4></div></div></div><p>Check for baseline language coverage in the compiler for the C++0xstandard.
  </p><pre class="programlisting">
*************** AC_DEFUN([AC_HEADER_UNORDERED_SET], [
*** 896,922 ****
      AC_DEFINE(HAVE_UNORDERED_SET,,[Define if unordered_set is present. ])
    fi
  ])
! </pre></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id437068"></a>
    Container::iterator_type is not necessarily Container::value_type*
  </h4></div></div></div><p>
    This is a change in behavior from the previous version. Now, most
    <span class="type">iterator_type</span> typedefs in container classes are POD
    objects, not <span class="type">value_type</span> pointers.
! </p></div></div><div class="bibliography"><div class="titlepage"><div><div><h3 class="title"><a id="backwards.biblio"></a>Bibliography</h3></div></div></div><div class="biblioentry"><a id="id437100"></a><p>[<abbr class="abbrev">
        kegel41
      </abbr>] <span class="title"><i>
        Migrating to GCC 4.1
      </i>. </span><span class="author"><span class="firstname">Dan</span> <span class="surname">Kegel</span>. </span><span class="biblioid">
        <a class="ulink" href="http://www.kegel.com/gcc/gcc4.html" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id437132"></a><p>[<abbr class="abbrev">
        kegel41
      </abbr>] <span class="title"><i>
        Building the Whole Debian Archive with GCC 4.1: A Summary
      </i>. </span><span class="author"><span class="firstname">Martin</span> <span class="surname">Michlmayr</span>. </span><span class="biblioid">
        <a class="ulink" href="http://lists.debian.org/debian-gcc/2006/03/msg00405.html" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id437165"></a><p>[<abbr class="abbrev">
        lbl32
      </abbr>] <span class="title"><i>
        Migration guide for GCC-3.2
--- 896,922 ----
      AC_DEFINE(HAVE_UNORDERED_SET,,[Define if unordered_set is present. ])
    fi
  ])
! </pre></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id466689"></a>
    Container::iterator_type is not necessarily Container::value_type*
  </h4></div></div></div><p>
    This is a change in behavior from the previous version. Now, most
    <span class="type">iterator_type</span> typedefs in container classes are POD
    objects, not <span class="type">value_type</span> pointers.
! </p></div></div><div class="bibliography"><div class="titlepage"><div><div><h3 class="title"><a id="backwards.biblio"></a>Bibliography</h3></div></div></div><div class="biblioentry"><a id="id466721"></a><p>[<abbr class="abbrev">
        kegel41
      </abbr>] <span class="title"><i>
        Migrating to GCC 4.1
      </i>. </span><span class="author"><span class="firstname">Dan</span> <span class="surname">Kegel</span>. </span><span class="biblioid">
        <a class="ulink" href="http://www.kegel.com/gcc/gcc4.html" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id466753"></a><p>[<abbr class="abbrev">
        kegel41
      </abbr>] <span class="title"><i>
        Building the Whole Debian Archive with GCC 4.1: A Summary
      </i>. </span><span class="author"><span class="firstname">Martin</span> <span class="surname">Michlmayr</span>. </span><span class="biblioid">
        <a class="ulink" href="http://lists.debian.org/debian-gcc/2006/03/msg00405.html" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id448867"></a><p>[<abbr class="abbrev">
        lbl32
      </abbr>] <span class="title"><i>
        Migration guide for GCC-3.2
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bitmap_allocator.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bitmap_allocator.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bitmap_allocator.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bitmap_allocator.html	Thu Apr 10 22:53:15 2008
*************** else return false.</p></li></ol></div><p
*** 103,109 ****
    </p><p>
      Consider a block of size 64 ints. In memory, it would look like this:
      (assume a 32-bit system where, size_t is a 32-bit entity).
!   </p><div class="table"><a id="id510462"></a><p class="title"><b>Table 32.1. Bitmap Allocator Memory Map</b></p><div class="table-contents"><table summary="Bitmap Allocator Memory Map" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col align="left" /></colgroup><tbody><tr><td align="left">268</td><td align="left">0</td><td align="left">4294967295</td><td align="left">4294967295</td><td align="left">Data -&gt; Space for 64 ints</td></tr></tbody></table></div></div><br class="table-break" /><p>
      The first Column(268) represents the size of the Block in bytes as
      seen by the Bitmap Allocator. Internally, a global free list is
      used to keep track of the free blocks used and given back by the
--- 103,109 ----
    </p><p>
      Consider a block of size 64 ints. In memory, it would look like this:
      (assume a 32-bit system where, size_t is a 32-bit entity).
!   </p><div class="table"><a id="id362834"></a><p class="title"><b>Table 32.1. Bitmap Allocator Memory Map</b></p><div class="table-contents"><table summary="Bitmap Allocator Memory Map" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col align="left" /></colgroup><tbody><tr><td align="left">268</td><td align="left">0</td><td align="left">4294967295</td><td align="left">4294967295</td><td align="left">Data -&gt; Space for 64 ints</td></tr></tbody></table></div></div><br class="table-break" /><p>
      The first Column(268) represents the size of the Block in bytes as
      seen by the Bitmap Allocator. Internally, a global free list is
      used to keep track of the free blocks used and given back by the
*************** else return false.</p></li></ol></div><p
*** 141,148 ****
    </p><p>
  (32 x k + 1) / (2 x (32 x k + 1 + 32 x c)) x 100.
    </p><p>
!     Where, k =&gt; The constant overhead per node. eg. for list, it is
!     8 bytes, and for map it is 12 bytes. c =&gt; The size of the
      base type on which the map/list is instantiated. Thus, suppose the
      type1 is int and type2 is double, they are related by the relation
      sizeof(double) == 2*sizeof(int). Thus, all types must have this
--- 141,148 ----
    </p><p>
  (32 x k + 1) / (2 x (32 x k + 1 + 32 x c)) x 100.
    </p><p>
!     where k is the constant overhead per node (e.g., for list, it is
!     8 bytes, and for map it is 12 bytes) and c is the size of the
      base type on which the map/list is instantiated. Thus, suppose the
      type1 is int and type2 is double, they are related by the relation
      sizeof(double) == 2*sizeof(int). Thus, all types must have this
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01apas03.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01apas03.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01apas03.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01apas03.html	Thu Apr 10 22:53:15 2008
***************
*** 1,7 ****
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
  <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Coding Style</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="appendix_contributing.html" title="Appendix A. Contributing" /><link rel="prev" href="bk01apas02.html" title="Directory Layout and Source Conventions" /><link rel="next" href="bk01apas04.html" title="Documentation Style" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Coding Style</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk01apas02.html">Prev</a> </td><th width="60%" align="center">Appendix A. Contributing</th><td width="20%" align="right"> <a accesskey="n" href="bk01apas04.html">Next</a></td></tr></table><hr /></div><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="contrib.coding_style"></a>Coding Style</h2></div></div></div><p>
!   </p><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="coding_style.bad_identifiers"></a>Bad Itentifiers</h3></div></div></div><p>
        Identifiers that conflict and should be avoided.
      </p><div class="literallayout"><p><br />
        This is the list of names “<span class="quote">reserved to the<br />
--- 1,7 ----
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
  <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Coding Style</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="appendix_contributing.html" title="Appendix A. Contributing" /><link rel="prev" href="bk01apas02.html" title="Directory Layout and Source Conventions" /><link rel="next" href="bk01apas04.html" title="Documentation Style" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Coding Style</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk01apas02.html">Prev</a> </td><th width="60%" align="center">Appendix A. Contributing</th><td width="20%" align="right"> <a accesskey="n" href="bk01apas04.html">Next</a></td></tr></table><hr /></div><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="contrib.coding_style"></a>Coding Style</h2></div></div></div><p>
!   </p><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="coding_style.bad_identifiers"></a>Bad Identifiers</h3></div></div></div><p>
        Identifiers that conflict and should be avoided.
      </p><div class="literallayout"><p><br />
        This is the list of names “<span class="quote">reserved to the<br />
***************
*** 330,336 ****
        for definitions. For C++, where we have member functions that can<br />
        be either inline definitions or declarations, keeping to this<br />
        standard allows all member function names for a given class to be<br />
!       aligned to the same margin, increasing readibility.<br />
  <br />
  <br />
        10. Invocation of member functions with "this-&gt;"<br />
--- 330,336 ----
        for definitions. For C++, where we have member functions that can<br />
        be either inline definitions or declarations, keeping to this<br />
        standard allows all member function names for a given class to be<br />
!       aligned to the same margin, increasing readability.<br />
  <br />
  <br />
        10. Invocation of member functions with "this-&gt;"<br />
***************
*** 356,362 ****
  <br />
        12. Spacing under protected and private in class declarations:<br />
        space above, none below<br />
!       ie<br />
  <br />
        public:<br />
        int foo;<br />
--- 356,362 ----
  <br />
        12. Spacing under protected and private in class declarations:<br />
        space above, none below<br />
!       i.e.<br />
  <br />
        public:<br />
        int foo;<br />
***************
*** 368,374 ****
  <br />
        13. Spacing WRT return statements.<br />
        no extra spacing before returns, no parenthesis<br />
!       ie<br />
  <br />
        }<br />
        return __ret;<br />
--- 368,374 ----
  <br />
        13. Spacing WRT return statements.<br />
        no extra spacing before returns, no parenthesis<br />
!       i.e.<br />
  <br />
        }<br />
        return __ret;<br />
***************
*** 385,391 ****
  <br />
  <br />
        14. Location of global variables.<br />
!       All global variables of class type, whether in the "user visable"<br />
        space (e.g., cin) or the implementation namespace, must be defined<br />
        as a character array with the appropriate alignment and then later<br />
        re-initialized to the correct value.<br />
--- 385,391 ----
  <br />
  <br />
        14. Location of global variables.<br />
!       All global variables of class type, whether in the "user visible"<br />
        space (e.g., cin) or the implementation namespace, must be defined<br />
        as a character array with the appropriate alignment and then later<br />
        re-initialized to the correct value.<br />
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01apas04.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01apas04.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01apas04.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01apas04.html	Thu Apr 10 22:53:15 2008
***************
*** 83,89 ****
  	(Examples of all these abound in the present code.)
        </p></div></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="doc_style.docbook"></a>Docbook</h3></div></div></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="docbook.prereq"></a>Prerequisites</h4></div></div></div><p>
  	Editing the DocBook sources requires an XML editor. Many
! 	exist: some noteable options
  	include <span class="command"><strong>emacs</strong></span>, <span class="application">Kate</span>,
  	or <span class="application">Conglomerate</span>.
        </p><p>
--- 83,89 ----
  	(Examples of all these abound in the present code.)
        </p></div></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="doc_style.docbook"></a>Docbook</h3></div></div></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="docbook.prereq"></a>Prerequisites</h4></div></div></div><p>
  	Editing the DocBook sources requires an XML editor. Many
! 	exist: some notable options
  	include <span class="command"><strong>emacs</strong></span>, <span class="application">Kate</span>,
  	or <span class="application">Conglomerate</span>.
        </p><p>
***************
*** 103,109 ****
  	in <code class="filename">doc/Makefile.am</code> and defaults
  	to <code class="filename">/usr/share/sgml/docbook/xsl-stylesheets</code>.
        </p><p>
! 	For procesessing XML, an XML processor and some style
  	sheets are necessary. Defaults are <span class="command"><strong>xsltproc</strong></span>
  	provided by <code class="filename">libxslt</code>.
        </p><p>
--- 103,109 ----
  	in <code class="filename">doc/Makefile.am</code> and defaults
  	to <code class="filename">/usr/share/sgml/docbook/xsl-stylesheets</code>.
        </p><p>
! 	For processing XML, an XML processor and some style
  	sheets are necessary. Defaults are <span class="command"><strong>xsltproc</strong></span>
  	provided by <code class="filename">libxslt</code>.
        </p><p>
*************** xmllint --noout --valid <code class="fil
*** 153,162 ****
        faq.xml  		- index to FAQ<br />
        api.xml  		- index to source level / API <br />
  <br />
!       All *.txml files are template xml files, ie otherwise empty files with<br />
        the correct structure, suitable for filling in with new information.<br />
  <br />
!       <span class="emphasis"><em>Cannonical Writing Style</em></span><br />
  <br />
        class template<br />
        function template<br />
--- 153,162 ----
        faq.xml  		- index to FAQ<br />
        api.xml  		- index to source level / API <br />
  <br />
!       All *.txml files are template xml files, i.e., otherwise empty files with<br />
        the correct structure, suitable for filling in with new information.<br />
  <br />
!       <span class="emphasis"><em>Canonical Writing Style</em></span><br />
  <br />
        class template<br />
        function template<br />
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01apas05.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01apas05.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01apas05.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01apas05.html	Thu Apr 10 22:53:15 2008
***************
*** 210,216 ****
      "export") is badly needed.<br />
  <br />
      When building a shared library, the current compiler/linker cannot<br />
!     automatically generate the instantiatiations needed. This creates a<br />
      miserable situation; it means any time something is changed in the<br />
      library, before a shared library can be built someone must manually<br />
      copy the declarations of all templates that are needed by other parts<br />
--- 210,216 ----
      "export") is badly needed.<br />
  <br />
      When building a shared library, the current compiler/linker cannot<br />
!     automatically generate the instantiations needed. This creates a<br />
      miserable situation; it means any time something is changed in the<br />
      library, before a shared library can be built someone must manually<br />
      copy the declarations of all templates that are needed by other parts<br />
***************
*** 814,820 ****
      by filebuf. These wrappings have not been completed, though there<br />
      is scaffolding in place.<br />
  <br />
!     The encapulation of certain C header &lt;cstdio&gt; names presents an<br />
      interesting problem. It is possible to define an inline std::fprintf()<br />
      implemented in terms of the 'extern "C"' vfprintf(), but there is no<br />
      standard vfscanf() to use to implement std::fscanf(). It appears that<br />
--- 814,820 ----
      by filebuf. These wrappings have not been completed, though there<br />
      is scaffolding in place.<br />
  <br />
!     The encapsulation of certain C header &lt;cstdio&gt; names presents an<br />
      interesting problem. It is possible to define an inline std::fprintf()<br />
      implemented in terms of the 'extern "C"' vfprintf(), but there is no<br />
      standard vfscanf() to use to implement std::fscanf(). It appears that<br />
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt01ch01.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt01ch01.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt01ch01.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt01ch01.html	Thu Apr 10 22:53:15 2008
*************** In this implementation the header names 
*** 6101,6107 ****
  </p><p>
  This page describes the TR1 support in mainline GCC SVN, not in any particular
  release.
! </p><div class="table"><a id="id395297"></a><p class="title"><b>Table 1.1. C++ TR1 Implementation Status</b></p><div class="table-contents"><table summary="C++ TR1 Implementation Status" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col align="left" /></colgroup><thead><tr><th align="left">Section</th><th align="left">Description</th><th align="left">Done</th><th align="left">Broken</th><th align="left">Missing</th><th align="left">Comments</th></tr></thead><tbody><tr><td align="left"><span class="emphasis"><em>2</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>General Utilities</em></span></td></tr><tr><td align="left">2.1</td><td align="left">Reference wrappers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.1.1</td><td align="left">Additions to header <code class="code">&lt;functional&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.1.2</td><td align="left">Class template <code class="code">reference_wrapper</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.1.2.1</td><td align="left"><code class="code">reference_wrapper</code> construct/copy/destroy</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.1.2.2</td><td align="left"><code class="code">reference_wrapper</code> assignment</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.1.2.3</td><td align="left"><code class="code">reference_wrapper</code> access</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.1.2.4</td><td align="left"><code class="code">reference_wrapper</code> invocation</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.1.2.5</td><td align="left"><code class="code">reference_wrapper</code> helper functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2</td><td align="left">Smart pointers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.1</td><td align="left">Additions to header <code class="code">&lt;memory&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.2</td><td align="left">Class <code class="code">bad_weak_ptr</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.3</td><td align="left">Class template <code class="code">shared_ptr</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">See Footnotes</td></tr><tr><td align="left">2.2.3.1</td><td align="left"><code class="code">shared_ptr</code> constructors</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.3.2</td><td align="left"><code class="code">shared_ptr</code> destructor</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.3.3</td><td align="left"><code class="code">shared_ptr</code> assignment</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.3.4</td><td align="left"><code class="code">shared_ptr</code> modifiers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.3.5</td><td align="left"><code class="code">shared_ptr</code> observers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.3.6</td><td align="left"><code class="code">shared_ptr</code> comparison</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.3.7</td><td align="left"><code class="code">shared_ptr</code> I/O</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.3.8</td><td align="left"><code class="code">shared_ptr</code> specialized algorithms</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.3.9</td><td align="left"><code class="code">shared_ptr</code> casts</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.3.10</td><td align="left"><code class="code">get_deleter</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.4</td><td align="left">Class template <code class="code">weak_ptr</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.4.1</td><td align="left"><code class="code">weak_ptr</code> constructors</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.4.2</td><td align="left"><code class="code">weak_ptr</code> destructor</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.4.3</td><td align="left"><code class="code">weak_ptr</code> assignment</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.4.4</td><td align="left"><code class="code">weak_ptr</code> modifiers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.4.5</td><td align="left"><code class="code">weak_ptr</code> observers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.4.6</td><td align="left"><code class="code">weak_ptr</code> comparison</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.4.7</td><td align="left"><code class="code">weak_ptr</code> specialized algorithms</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.5</td><td align="left">Class template <code class="code">enable_shared_from_this</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left"><span class="emphasis"><em>3</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>Function Objects</em></span></td></tr><tr><td align="left">3.1</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.2</td><td align="left">Additions to <code class="code">&lt;functional&gt; synopsis</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.3</td><td align="left">Requirements</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.4</td><td align="left">Function return types</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.5</td><td align="left">Function template <code class="code">mem_fn</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.6</td><td align="left">Function object binders</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.6.1</td><td align="left">Class template <code class="code">is_bind_expression</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.6.2</td><td align="left">Class template <code class="code">is_placeholder</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.6.3</td><td align="left">Function template <code class="code">bind</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.6.4</td><td align="left">Placeholders</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.7</td><td align="left">Polymorphic function wrappers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.7.1</td><td align="left">Class <code class="code">bad_function_call<code class="code"></code></code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.7.1.1</td><td align="left"><code class="code">bad_function_call</code> constructor</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.7.2</td><td align="left">Class template <code class="code">function</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.7.2.1</td><td align="left"><code class="code">function</code> construct/copy/destroy</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.7.2.2</td><td align="left"><code class="code">function</code> modifiers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.7.2.3</td><td align="left"><code class="code">function</code> capacity</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.7.2.4</td><td align="left"><code class="code">function</code> invocation</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.7.2.5</td><td align="left"><code class="code">function</code> target access</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.7.2.6</td><td align="left">undefined operators</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.7.2.7</td><td align="left">null pointer comparison operators</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.7.2.8</td><td align="left">specialized algorithms</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left"><span class="emphasis"><em>4</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>Metaprogramming and type traits</em></span></td></tr><tr><td align="left">4.1</td><td align="left">Requirements</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.2</td><td align="left">Header <code class="code">&lt;type_traits&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.3</td><td align="left">Helper classes</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.4</td><td align="left">General Requirements</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.5</td><td align="left">Unary Type Traits</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.5.1</td><td align="left">Primary Type Categories</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.5.2</td><td align="left">Composite type traits</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.5.3</td><td align="left">Type properties</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.6</td><td align="left">Relationships between types</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.7</td><td align="left">Transformations between types</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.7.1</td><td align="left">Const-volatile modifications</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.7.2</td><td align="left">Reference modifications</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.7.3</td><td align="left">Array modifications</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.7.4</td><td align="left">Pointer modifications</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.8</td><td align="left">Other transformations</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.9</td><td align="left">Implementation requirements</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left"><span class="emphasis"><em>5</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>Numerical Facilities</em></span></td></tr><tr><td align="left">5.1</td><td align="left">Random number generation</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.1</td><td align="left">Requirements</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.2</td><td align="left">Header <code class="code">&lt;random&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.3</td><td align="left">Class template <code class="code">variate_generator</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.4</td><td align="left">Random number engine class templates</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.4.1</td><td align="left">Class template <code class="code">linear_congruential</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.4.2</td><td align="left">Class template <code class="code">mersenne_twister</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.4.3</td><td align="left">Class template <code class="code">subtract_with_carry</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.4.4</td><td align="left">Class template <code class="code">subtract_with_carry_01</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.4.5</td><td align="left">Class template <code class="code">discard_block</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.4.6</td><td align="left">Class template <code class="code">xor_combine</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">operator()() per N2079</td></tr><tr><td align="left">5.1.5</td><td align="left">Engines with predefined parameters</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.6</td><td align="left">Class <code class="code">random_device</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.7</td><td align="left">Random distribution class templates</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.7.1</td><td align="left">Class template <code class="code">uniform_int</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.7.2</td><td align="left">Class <code class="code">bernoulli_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.7.3</td><td align="left">Class template <code class="code">geometric_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.7.4</td><td align="left">Class template <code class="code">poisson_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.7.5</td><td align="left">Class template <code class="code">binomial_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.7.6</td><td align="left">Class template <code class="code">uniform_real</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.7.7</td><td align="left">Class template <code class="code">exponential_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.7.8</td><td align="left">Class template <code class="code">normal_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.7.9</td><td align="left">Class template <code class="code">gamma_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2</td><td align="left">Mathematical special functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1</td><td align="left">Additions to header <code class="code">&lt;cmath&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.1</td><td align="left">associated Laguerre polynomials</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.2</td><td align="left">associated Legendre functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.3</td><td align="left">beta function</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.4</td><td align="left">(complete) elliptic integral of the first kind</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.5</td><td align="left">(complete) elliptic integral of the second kind</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.6</td><td align="left">(complete) elliptic integral of the third kind</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.7</td><td align="left">confluent hypergeometric functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.8</td><td align="left">regular modified cylindrical Bessel functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.9</td><td align="left">cylindrical Bessel functions (of the first kind)</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.10</td><td align="left">irregular modified cylindrical Bessel functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.11</td><td align="left">cylindrical Neumann functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.12</td><td align="left">(incomplete) elliptic integral of the first kind</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.13</td><td align="left">(incomplete) elliptic integral of the second kind</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.14</td><td align="left">(incomplete) elliptic integral of the third kind</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.15</td><td align="left">exponential integral</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.16</td><td align="left">Hermite polynomials</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.17</td><td align="left">hypergeometric functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.18</td><td align="left">Laguerre polynomials</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.19</td><td align="left">Legendre polynomials</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.20</td><td align="left">Riemann zeta function</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.21</td><td align="left">spherical Bessel functions (of the first kind)</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.22</td><td align="left">spherical associated Legendre functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.23</td><td align="left">spherical Neumann functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.2</td><td align="left">Additions to header <code class="code">&lt;math.h&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left"><span class="emphasis"><em>6</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>Containers</em></span></td></tr><tr><td align="left">6.1</td><td align="left">Tuple types</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.1.1</td><td align="left">Header <code class="code">&lt;tuple&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.1.2</td><td align="left">Additions to header <code class="code">&lt;utility&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.1.3</td><td align="left">Class template <code class="code">tuple</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.1.3.1</td><td align="left">Construction</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.1.3.2</td><td align="left">Tuple creation functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.1.3.3</td><td align="left">Tuple helper classes</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.1.3.4</td><td align="left">Element access</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.1.3.5</td><td align="left">Relational operators</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.1.4</td><td align="left">Pairs</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.2</td><td align="left">Fixed size array</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.2.1</td><td align="left">Header <code class="code">&lt;array&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.2.2</td><td align="left">Class template <code class="code">array</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.2.2.1</td><td align="left"><code class="code">array</code> constructors, copy, and assignment</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.2.2.2</td><td align="left"><code class="code">array</code> specialized algorithms</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.2.2.3</td><td align="left"><code class="code">array</code> size</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.2.2.4</td><td align="left">Zero sized <code class="code">array</code>s</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.2.2.5</td><td align="left">Tuple interface to class template <code class="code">array</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3</td><td align="left">Unordered associative containers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.1</td><td align="left">Unordered associative container requirements</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.1.1</td><td align="left">Exception safety guarantees</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.2</td><td align="left">Additions to header <code class="code">&lt;functional&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.3</td><td align="left">Class template <code class="code">hash</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4</td><td align="left">Unordered associative container classes</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.1</td><td align="left">Header <code class="code">&lt;unordered_set&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.2</td><td align="left">Header <code class="code">&lt;unordered_map&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.3</td><td align="left">Class template <code class="code">unordered_set</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.3.1</td><td align="left"><code class="code">unordered_set</code> constructors</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.3.2</td><td align="left"><code class="code">unordered_set</code> swap</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.4</td><td align="left">Class template <code class="code">unordered_map</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.4.1</td><td align="left"><code class="code">unordered_map</code> constructors</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.4.2</td><td align="left"><code class="code">unordered_map</code> element access</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.4.3</td><td align="left"><code class="code">unordered_map</code> swap</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.5</td><td align="left">Class template <code class="code">unordered_multiset<code class="code"></code></code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.5.1</td><td align="left"><code class="code">unordered_multiset</code> constructors</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.5.2</td><td align="left"><code class="code">unordered_multiset</code> swap</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.6</td><td align="left">Class template <code class="code">unordered_multimap</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.6.1</td><td align="left"><code class="code">unordered_multimap</code> constructors</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.6.2</td><td align="left"><code class="code">unordered_multimap</code> swap</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left"><span class="emphasis"><em>7</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>Regular Expressions</em></span></td></tr><tr><td align="left">7.1</td><td align="left">Definitions</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.2</td><td align="left">Requirements</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.3</td><td align="left">Regular expressions summary</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.4</td><td align="left">Header <code class="code">&lt;regex&gt;</code> synopsis</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.5</td><td align="left">Namespace <code class="code">tr1::regex_constants</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.5.1</td><td align="left">Bitmask Type <code class="code">syntax_option_type</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.5.2</td><td align="left">Bitmask Type <code class="code">regex_constants::match_flag_type</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.5.3</td><td align="left">Implementation defined <code class="code">error_type</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.6</td><td align="left">Class <code class="code">regex_error</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.7</td><td align="left">Class template <code class="code">regex_traits</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.8</td><td align="left">Class template <code class="code">basic_regex</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.8.1</td><td align="left"><code class="code">basic_regex</code> constants</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.8.2</td><td align="left"><code class="code">basic_regex</code> constructors</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.8.3</td><td align="left"><code class="code">basic_regex</code> assign</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.8.4</td><td align="left"><code class="code">basic_regex</code> constant operations</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.8.5</td><td align="left"><code class="code">basic_regex</code> locale</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.8.6</td><td align="left"><code class="code">basic_regex</code> swap</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.8.7</td><td align="left"><code class="code">basic_regex</code> non-member functions</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.8.7.1</td><td align="left"><code class="code">basic_regex</code> non-member swap</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.9</td><td align="left">Class template <code class="code">sub_match</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.9.1</td><td align="left"><code class="code">sub_match</code> members</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.9.2</td><td align="left"><code class="code">sub_match</code> non-member operators</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.10</td><td align="left">Class template <code class="code">match_results</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.10.1</td><td align="left"><code class="code">match_results</code> constructors</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.10.2</td><td align="left"><code class="code">match_results</code> size</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.10.3</td><td align="left"><code class="code">match_results</code> element access</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.10.4</td><td align="left"><code class="code">match_results</code> formatting</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.10.5</td><td align="left"><code class="code">match_results</code> allocator</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.10.6</td><td align="left"><code class="code">match_results</code> swap</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.11</td><td align="left">Regular expression algorithms</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.11.1</td><td align="left">exceptions</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.11.2</td><td align="left"><code class="code">regex_match</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.11.3</td><td align="left"><code class="code">regex_search</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.11.4</td><td align="left"><code class="code">regex_replace</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.12</td><td align="left">Regular expression Iterators</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.12.1</td><td align="left">Class template <code class="code">regex_iterator</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.12.1.1</td><td align="left"><code class="code">regex_iterator</code> constructors</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.12.1.2</td><td align="left"><code class="code">regex_iterator</code> comparisons</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.12.1.3</td><td align="left"><code class="code">regex_iterator</code> dereference</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.12.1.4</td><td align="left"><code class="code">regex_iterator</code> increment</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.12.2</td><td align="left">Class template <code class="code">regex_token_iterator</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.12.2.1</td><td align="left"><code class="code">regex_token_iterator</code> constructors</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.12.2.2</td><td align="left"><code class="code">regex_token_iterator</code> comparisons</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.12.2.3</td><td align="left"><code class="code">regex_token_iterator</code> dereference</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.12.2.4</td><td align="left"><code class="code">regex_token_iterator</code> increment</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.13</td><td align="left">Modified ECMAScript regular expression grammar</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left"><span class="emphasis"><em>8</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>C Compatibility</em></span></td></tr><tr><td align="left">8.1</td><td align="left">Additions to header <code class="code">&lt;complex&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.1.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.1.2</td><td align="left">Function <code class="code">acos</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.1.3</td><td align="left">Function <code class="code">asin</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.1.4</td><td align="left">Function <code class="code">atan</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.1.5</td><td align="left">Function <code class="code">acosh</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.1.6</td><td align="left">Function <code class="code">asinh</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.1.7</td><td align="left">Function <code class="code">atanh</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.1.8</td><td align="left">Function <code class="code">fabs</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.1.9</td><td align="left">Additional Overloads</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.2</td><td align="left">Header <code class="code">&lt;ccomplex&gt;</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left">DR 551</td></tr><tr><td align="left">8.3</td><td align="left">Header <code class="code">&lt;complex.h&gt;</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left">DR 551</td></tr><tr><td align="left">8.4</td><td align="left">Additions to header <code class="code">&lt;cctype&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.4.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.4.2</td><td align="left">Function <code class="code">isblank</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.5</td><td align="left">Additions to header <code class="code">&lt;ctype.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.6</td><td align="left">Header <code class="code">&lt;cfenv&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.6.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.6.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.7</td><td align="left">Header <code class="code">&lt;fenv.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.8</td><td align="left">Additions to header <code class="code">&lt;cfloat&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.9</td><td align="left">Additions to header <code class="code">&lt;float.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.10</td><td align="left">Additions to header <code class="code">&lt;ios&gt;</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">8.10.1</td><td align="left">Synopsis</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">8.10.2</td><td align="left">Function <code class="code">hexfloat</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">8.11</td><td align="left">Header <code class="code">&lt;cinttypes&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.11.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">DR 557</td></tr><tr><td align="left">8.11.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.12</td><td align="left">Header <code class="code">&lt;inttypes.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.13</td><td align="left">Additions to header <code class="code">&lt;climits&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.14</td><td align="left">Additions to header <code class="code">&lt;limits.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.15</td><td align="left">Additions to header <code class="code">&lt;locale&gt;</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">8.16</td><td align="left">Additions to header <code class="code">&lt;cmath&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.16.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.16.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.16.3</td><td align="left">Function template definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.16.4</td><td align="left">Additional overloads</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">DR 568; DR 550</td></tr><tr><td align="left">8.17</td><td align="left">Additions to header <code class="code">&lt;math.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.18</td><td align="left">Additions to header <code class="code">&lt;cstdarg&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.19</td><td align="left">Additions to header <code class="code">&lt;stdarg.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.20</td><td align="left">The header <code class="code">&lt;cstdbool&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.21</td><td align="left">The header <code class="code">&lt;stdbool.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.22</td><td align="left">The header <code class="code">&lt;cstdint&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.22.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.22.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.23</td><td align="left">The header <code class="code">&lt;stdint.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.24</td><td align="left">Additions to header <code class="code">&lt;cstdio&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.24.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.24.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.24.3</td><td align="left">Additional format specifiers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">C library responsibility</td></tr><tr><td align="left">8.24.4</td><td align="left">Additions to header <code class="code">&lt;stdio.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.25</td><td align="left">Additions to header <code class="code">&lt;cstdlib&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.25.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.25.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.25.3</td><td align="left">Function <code class="code">abs</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.25.4</td><td align="left">Function <code class="code">div</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.26</td><td align="left">Additions to header <code class="code">&lt;stdlib.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.27</td><td align="left">Header <code class="code">&lt;ctgmath&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">DR 551</td></tr><tr><td align="left">8.28</td><td align="left">Header <code class="code">&lt;tgmath.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">DR 551</td></tr><tr><td align="left">8.29</td><td align="left">Additions to header <code class="code">&lt;ctime&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">C library responsibility</td></tr><tr><td align="left">8.30</td><td align="left">Additions to header <code class="code">&lt;cwchar&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.30.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.30.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.30.3</td><td align="left">Additional wide format specifiers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">C library responsibility</td></tr><tr><td align="left">8.31</td><td align="left">Additions to header <code class="code">&lt;wchar.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.32</td><td align="left">Additions to header <code class="code">&lt;cwctype&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.32.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.32.2</td><td align="left">Function <code class="code">iswblank</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.33</td><td align="left">Additions to header <code class="code">&lt;wctype.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr></tbody></table></div></div><br class="table-break" /><p>
  Footnotes
  </p><p>
    The shared_ptr implementation uses some code from the
--- 6101,6107 ----
  </p><p>
  This page describes the TR1 support in mainline GCC SVN, not in any particular
  release.
! </p><div class="table"><a id="id405938"></a><p class="title"><b>Table 1.1. C++ TR1 Implementation Status</b></p><div class="table-contents"><table summary="C++ TR1 Implementation Status" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col align="left" /></colgroup><thead><tr><th align="left">Section</th><th align="left">Description</th><th align="left">Done</th><th align="left">Broken</th><th align="left">Missing</th><th align="left">Comments</th></tr></thead><tbody><tr><td align="left"><span class="emphasis"><em>2</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>General Utilities</em></span></td></tr><tr><td align="left">2.1</td><td align="left">Reference wrappers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.1.1</td><td align="left">Additions to header <code class="code">&lt;functional&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.1.2</td><td align="left">Class template <code class="code">reference_wrapper</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.1.2.1</td><td align="left"><code class="code">reference_wrapper</code> construct/copy/destroy</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.1.2.2</td><td align="left"><code class="code">reference_wrapper</code> assignment</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.1.2.3</td><td align="left"><code class="code">reference_wrapper</code> access</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.1.2.4</td><td align="left"><code class="code">reference_wrapper</code> invocation</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.1.2.5</td><td align="left"><code class="code">reference_wrapper</code> helper functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2</td><td align="left">Smart pointers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.1</td><td align="left">Additions to header <code class="code">&lt;memory&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.2</td><td align="left">Class <code class="code">bad_weak_ptr</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.3</td><td align="left">Class template <code class="code">shared_ptr</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">See Footnotes</td></tr><tr><td align="left">2.2.3.1</td><td align="left"><code class="code">shared_ptr</code> constructors</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.3.2</td><td align="left"><code class="code">shared_ptr</code> destructor</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.3.3</td><td align="left"><code class="code">shared_ptr</code> assignment</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.3.4</td><td align="left"><code class="code">shared_ptr</code> modifiers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.3.5</td><td align="left"><code class="code">shared_ptr</code> observers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.3.6</td><td align="left"><code class="code">shared_ptr</code> comparison</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.3.7</td><td align="left"><code class="code">shared_ptr</code> I/O</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.3.8</td><td align="left"><code class="code">shared_ptr</code> specialized algorithms</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.3.9</td><td align="left"><code class="code">shared_ptr</code> casts</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.3.10</td><td align="left"><code class="code">get_deleter</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.4</td><td align="left">Class template <code class="code">weak_ptr</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.4.1</td><td align="left"><code class="code">weak_ptr</code> constructors</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.4.2</td><td align="left"><code class="code">weak_ptr</code> destructor</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.4.3</td><td align="left"><code class="code">weak_ptr</code> assignment</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.4.4</td><td align="left"><code class="code">weak_ptr</code> modifiers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.4.5</td><td align="left"><code class="code">weak_ptr</code> observers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.4.6</td><td align="left"><code class="code">weak_ptr</code> comparison</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.4.7</td><td align="left"><code class="code">weak_ptr</code> specialized algorithms</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.5</td><td align="left">Class template <code class="code">enable_shared_from_this</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left"><span class="emphasis"><em>3</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>Function Objects</em></span></td></tr><tr><td align="left">3.1</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.2</td><td align="left">Additions to <code class="code">&lt;functional&gt; synopsis</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.3</td><td align="left">Requirements</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.4</td><td align="left">Function return types</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.5</td><td align="left">Function template <code class="code">mem_fn</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.6</td><td align="left">Function object binders</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.6.1</td><td align="left">Class template <code class="code">is_bind_expression</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.6.2</td><td align="left">Class template <code class="code">is_placeholder</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.6.3</td><td align="left">Function template <code class="code">bind</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.6.4</td><td align="left">Placeholders</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.7</td><td align="left">Polymorphic function wrappers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.7.1</td><td align="left">Class <code class="code">bad_function_call<code class="code"></code></code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.7.1.1</td><td align="left"><code class="code">bad_function_call</code> constructor</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.7.2</td><td align="left">Class template <code class="code">function</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.7.2.1</td><td align="left"><code class="code">function</code> construct/copy/destroy</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.7.2.2</td><td align="left"><code class="code">function</code> modifiers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.7.2.3</td><td align="left"><code class="code">function</code> capacity</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.7.2.4</td><td align="left"><code class="code">function</code> invocation</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.7.2.5</td><td align="left"><code class="code">function</code> target access</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.7.2.6</td><td align="left">undefined operators</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.7.2.7</td><td align="left">null pointer comparison operators</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">3.7.2.8</td><td align="left">specialized algorithms</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left"><span class="emphasis"><em>4</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>Metaprogramming and type traits</em></span></td></tr><tr><td align="left">4.1</td><td align="left">Requirements</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.2</td><td align="left">Header <code class="code">&lt;type_traits&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.3</td><td align="left">Helper classes</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.4</td><td align="left">General Requirements</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.5</td><td align="left">Unary Type Traits</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.5.1</td><td align="left">Primary Type Categories</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.5.2</td><td align="left">Composite type traits</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.5.3</td><td align="left">Type properties</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.6</td><td align="left">Relationships between types</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.7</td><td align="left">Transformations between types</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.7.1</td><td align="left">Const-volatile modifications</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.7.2</td><td align="left">Reference modifications</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.7.3</td><td align="left">Array modifications</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.7.4</td><td align="left">Pointer modifications</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.8</td><td align="left">Other transformations</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">4.9</td><td align="left">Implementation requirements</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left"><span class="emphasis"><em>5</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>Numerical Facilities</em></span></td></tr><tr><td align="left">5.1</td><td align="left">Random number generation</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.1</td><td align="left">Requirements</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.2</td><td align="left">Header <code class="code">&lt;random&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.3</td><td align="left">Class template <code class="code">variate_generator</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.4</td><td align="left">Random number engine class templates</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.4.1</td><td align="left">Class template <code class="code">linear_congruential</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.4.2</td><td align="left">Class template <code class="code">mersenne_twister</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.4.3</td><td align="left">Class template <code class="code">subtract_with_carry</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.4.4</td><td align="left">Class template <code class="code">subtract_with_carry_01</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.4.5</td><td align="left">Class template <code class="code">discard_block</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.4.6</td><td align="left">Class template <code class="code">xor_combine</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">operator()() per N2079</td></tr><tr><td align="left">5.1.5</td><td align="left">Engines with predefined parameters</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.6</td><td align="left">Class <code class="code">random_device</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.7</td><td align="left">Random distribution class templates</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.7.1</td><td align="left">Class template <code class="code">uniform_int</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.7.2</td><td align="left">Class <code class="code">bernoulli_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.7.3</td><td align="left">Class template <code class="code">geometric_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.7.4</td><td align="left">Class template <code class="code">poisson_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.7.5</td><td align="left">Class template <code class="code">binomial_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.7.6</td><td align="left">Class template <code class="code">uniform_real</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.7.7</td><td align="left">Class template <code class="code">exponential_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.7.8</td><td align="left">Class template <code class="code">normal_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.1.7.9</td><td align="left">Class template <code class="code">gamma_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2</td><td align="left">Mathematical special functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1</td><td align="left">Additions to header <code class="code">&lt;cmath&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.1</td><td align="left">associated Laguerre polynomials</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.2</td><td align="left">associated Legendre functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.3</td><td align="left">beta function</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.4</td><td align="left">(complete) elliptic integral of the first kind</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.5</td><td align="left">(complete) elliptic integral of the second kind</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.6</td><td align="left">(complete) elliptic integral of the third kind</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.7</td><td align="left">confluent hypergeometric functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.8</td><td align="left">regular modified cylindrical Bessel functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.9</td><td align="left">cylindrical Bessel functions (of the first kind)</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.10</td><td align="left">irregular modified cylindrical Bessel functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.11</td><td align="left">cylindrical Neumann functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.12</td><td align="left">(incomplete) elliptic integral of the first kind</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.13</td><td align="left">(incomplete) elliptic integral of the second kind</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.14</td><td align="left">(incomplete) elliptic integral of the third kind</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.15</td><td align="left">exponential integral</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.16</td><td align="left">Hermite polynomials</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.17</td><td align="left">hypergeometric functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.18</td><td align="left">Laguerre polynomials</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.19</td><td align="left">Legendre polynomials</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.20</td><td align="left">Riemann zeta function</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.21</td><td align="left">spherical Bessel functions (of the first kind)</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.22</td><td align="left">spherical associated Legendre functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.1.23</td><td align="left">spherical Neumann functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">5.2.2</td><td align="left">Additions to header <code class="code">&lt;math.h&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left"><span class="emphasis"><em>6</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>Containers</em></span></td></tr><tr><td align="left">6.1</td><td align="left">Tuple types</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.1.1</td><td align="left">Header <code class="code">&lt;tuple&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.1.2</td><td align="left">Additions to header <code class="code">&lt;utility&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.1.3</td><td align="left">Class template <code class="code">tuple</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.1.3.1</td><td align="left">Construction</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.1.3.2</td><td align="left">Tuple creation functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.1.3.3</td><td align="left">Tuple helper classes</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.1.3.4</td><td align="left">Element access</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.1.3.5</td><td align="left">Relational operators</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.1.4</td><td align="left">Pairs</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.2</td><td align="left">Fixed size array</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.2.1</td><td align="left">Header <code class="code">&lt;array&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.2.2</td><td align="left">Class template <code class="code">array</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.2.2.1</td><td align="left"><code class="code">array</code> constructors, copy, and assignment</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.2.2.2</td><td align="left"><code class="code">array</code> specialized algorithms</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.2.2.3</td><td align="left"><code class="code">array</code> size</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.2.2.4</td><td align="left">Zero sized <code class="code">array</code>s</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.2.2.5</td><td align="left">Tuple interface to class template <code class="code">array</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3</td><td align="left">Unordered associative containers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.1</td><td align="left">Unordered associative container requirements</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.1.1</td><td align="left">Exception safety guarantees</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.2</td><td align="left">Additions to header <code class="code">&lt;functional&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.3</td><td align="left">Class template <code class="code">hash</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4</td><td align="left">Unordered associative container classes</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.1</td><td align="left">Header <code class="code">&lt;unordered_set&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.2</td><td align="left">Header <code class="code">&lt;unordered_map&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.3</td><td align="left">Class template <code class="code">unordered_set</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.3.1</td><td align="left"><code class="code">unordered_set</code> constructors</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.3.2</td><td align="left"><code class="code">unordered_set</code> swap</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.4</td><td align="left">Class template <code class="code">unordered_map</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.4.1</td><td align="left"><code class="code">unordered_map</code> constructors</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.4.2</td><td align="left"><code class="code">unordered_map</code> element access</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.4.3</td><td align="left"><code class="code">unordered_map</code> swap</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.5</td><td align="left">Class template <code class="code">unordered_multiset<code class="code"></code></code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.5.1</td><td align="left"><code class="code">unordered_multiset</code> constructors</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.5.2</td><td align="left"><code class="code">unordered_multiset</code> swap</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.6</td><td align="left">Class template <code class="code">unordered_multimap</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.6.1</td><td align="left"><code class="code">unordered_multimap</code> constructors</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">6.3.4.6.2</td><td align="left"><code class="code">unordered_multimap</code> swap</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left"><span class="emphasis"><em>7</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>Regular Expressions</em></span></td></tr><tr><td align="left">7.1</td><td align="left">Definitions</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.2</td><td align="left">Requirements</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.3</td><td align="left">Regular expressions summary</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.4</td><td align="left">Header <code class="code">&lt;regex&gt;</code> synopsis</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.5</td><td align="left">Namespace <code class="code">tr1::regex_constants</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.5.1</td><td align="left">Bitmask Type <code class="code">syntax_option_type</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.5.2</td><td align="left">Bitmask Type <code class="code">regex_constants::match_flag_type</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.5.3</td><td align="left">Implementation defined <code class="code">error_type</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.6</td><td align="left">Class <code class="code">regex_error</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.7</td><td align="left">Class template <code class="code">regex_traits</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.8</td><td align="left">Class template <code class="code">basic_regex</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.8.1</td><td align="left"><code class="code">basic_regex</code> constants</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.8.2</td><td align="left"><code class="code">basic_regex</code> constructors</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.8.3</td><td align="left"><code class="code">basic_regex</code> assign</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.8.4</td><td align="left"><code class="code">basic_regex</code> constant operations</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.8.5</td><td align="left"><code class="code">basic_regex</code> locale</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.8.6</td><td align="left"><code class="code">basic_regex</code> swap</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.8.7</td><td align="left"><code class="code">basic_regex</code> non-member functions</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.8.7.1</td><td align="left"><code class="code">basic_regex</code> non-member swap</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.9</td><td align="left">Class template <code class="code">sub_match</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.9.1</td><td align="left"><code class="code">sub_match</code> members</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.9.2</td><td align="left"><code class="code">sub_match</code> non-member operators</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.10</td><td align="left">Class template <code class="code">match_results</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.10.1</td><td align="left"><code class="code">match_results</code> constructors</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.10.2</td><td align="left"><code class="code">match_results</code> size</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.10.3</td><td align="left"><code class="code">match_results</code> element access</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.10.4</td><td align="left"><code class="code">match_results</code> formatting</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.10.5</td><td align="left"><code class="code">match_results</code> allocator</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.10.6</td><td align="left"><code class="code">match_results</code> swap</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.11</td><td align="left">Regular expression algorithms</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.11.1</td><td align="left">exceptions</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.11.2</td><td align="left"><code class="code">regex_match</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.11.3</td><td align="left"><code class="code">regex_search</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.11.4</td><td align="left"><code class="code">regex_replace</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.12</td><td align="left">Regular expression Iterators</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.12.1</td><td align="left">Class template <code class="code">regex_iterator</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.12.1.1</td><td align="left"><code class="code">regex_iterator</code> constructors</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.12.1.2</td><td align="left"><code class="code">regex_iterator</code> comparisons</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.12.1.3</td><td align="left"><code class="code">regex_iterator</code> dereference</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.12.1.4</td><td align="left"><code class="code">regex_iterator</code> increment</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.12.2</td><td align="left">Class template <code class="code">regex_token_iterator</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.12.2.1</td><td align="left"><code class="code">regex_token_iterator</code> constructors</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.12.2.2</td><td align="left"><code class="code">regex_token_iterator</code> comparisons</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.12.2.3</td><td align="left"><code class="code">regex_token_iterator</code> dereference</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.12.2.4</td><td align="left"><code class="code">regex_token_iterator</code> increment</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">7.13</td><td align="left">Modified ECMAScript regular expression grammar</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left"><span class="emphasis"><em>8</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>C Compatibility</em></span></td></tr><tr><td align="left">8.1</td><td align="left">Additions to header <code class="code">&lt;complex&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.1.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.1.2</td><td align="left">Function <code class="code">acos</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.1.3</td><td align="left">Function <code class="code">asin</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.1.4</td><td align="left">Function <code class="code">atan</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.1.5</td><td align="left">Function <code class="code">acosh</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.1.6</td><td align="left">Function <code class="code">asinh</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.1.7</td><td align="left">Function <code class="code">atanh</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.1.8</td><td align="left">Function <code class="code">fabs</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.1.9</td><td align="left">Additional Overloads</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.2</td><td align="left">Header <code class="code">&lt;ccomplex&gt;</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left">DR 551</td></tr><tr><td align="left">8.3</td><td align="left">Header <code class="code">&lt;complex.h&gt;</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left">DR 551</td></tr><tr><td align="left">8.4</td><td align="left">Additions to header <code class="code">&lt;cctype&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.4.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.4.2</td><td align="left">Function <code class="code">isblank</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.5</td><td align="left">Additions to header <code class="code">&lt;ctype.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.6</td><td align="left">Header <code class="code">&lt;cfenv&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.6.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.6.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.7</td><td align="left">Header <code class="code">&lt;fenv.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.8</td><td align="left">Additions to header <code class="code">&lt;cfloat&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.9</td><td align="left">Additions to header <code class="code">&lt;float.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.10</td><td align="left">Additions to header <code class="code">&lt;ios&gt;</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">8.10.1</td><td align="left">Synopsis</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">8.10.2</td><td align="left">Function <code class="code">hexfloat</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">8.11</td><td align="left">Header <code class="code">&lt;cinttypes&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.11.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">DR 557</td></tr><tr><td align="left">8.11.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.12</td><td align="left">Header <code class="code">&lt;inttypes.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.13</td><td align="left">Additions to header <code class="code">&lt;climits&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.14</td><td align="left">Additions to header <code class="code">&lt;limits.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.15</td><td align="left">Additions to header <code class="code">&lt;locale&gt;</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">8.16</td><td align="left">Additions to header <code class="code">&lt;cmath&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.16.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.16.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.16.3</td><td align="left">Function template definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.16.4</td><td align="left">Additional overloads</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">DR 568; DR 550</td></tr><tr><td align="left">8.17</td><td align="left">Additions to header <code class="code">&lt;math.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.18</td><td align="left">Additions to header <code class="code">&lt;cstdarg&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.19</td><td align="left">Additions to header <code class="code">&lt;stdarg.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.20</td><td align="left">The header <code class="code">&lt;cstdbool&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.21</td><td align="left">The header <code class="code">&lt;stdbool.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.22</td><td align="left">The header <code class="code">&lt;cstdint&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.22.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.22.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.23</td><td align="left">The header <code class="code">&lt;stdint.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.24</td><td align="left">Additions to header <code class="code">&lt;cstdio&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.24.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.24.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.24.3</td><td align="left">Additional format specifiers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">C library responsibility</td></tr><tr><td align="left">8.24.4</td><td align="left">Additions to header <code class="code">&lt;stdio.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.25</td><td align="left">Additions to header <code class="code">&lt;cstdlib&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.25.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.25.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.25.3</td><td align="left">Function <code class="code">abs</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.25.4</td><td align="left">Function <code class="code">div</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.26</td><td align="left">Additions to header <code class="code">&lt;stdlib.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.27</td><td align="left">Header <code class="code">&lt;ctgmath&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">DR 551</td></tr><tr><td align="left">8.28</td><td align="left">Header <code class="code">&lt;tgmath.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">DR 551</td></tr><tr><td align="left">8.29</td><td align="left">Additions to header <code class="code">&lt;ctime&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">C library responsibility</td></tr><tr><td align="left">8.30</td><td align="left">Additions to header <code class="code">&lt;cwchar&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.30.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.30.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.30.3</td><td align="left">Additional wide format specifiers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">C library responsibility</td></tr><tr><td align="left">8.31</td><td align="left">Additions to header <code class="code">&lt;wchar.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.32</td><td align="left">Additions to header <code class="code">&lt;cwctype&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.32.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.32.2</td><td align="left">Function <code class="code">iswblank</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">8.33</td><td align="left">Additions to header <code class="code">&lt;wctype.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr></tbody></table></div></div><br class="table-break" /><p>
  Footnotes
  </p><p>
    The shared_ptr implementation uses some code from the
*************** presence of the required flag.
*** 6120,6128 ****
  </p><p>
  This page describes the C++0x support in mainline GCC SVN, not in any
  particular release.
! </p><div class="table"><a id="id472768"></a><p class="title"><b>Table 1.2. C++ 200x Implementation Status</b></p><div class="table-contents"><table summary="C++ 200x Implementation Status" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col align="left" /></colgroup><thead><tr><th align="left">Section</th><th align="left">Description</th><th align="left">Done</th><th align="left">Broken</th><th align="left">Missing</th><th align="left">Comments</th></tr></thead><tbody><tr><td align="left"><span class="emphasis"><em>20</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>General Utilities</em></span></td></tr><tr><td align="left">20.2</td><td align="left">Utility Components</td><td align="left"> </td><td align="left"> </td><td align="left">incomplete</td><td align="left"> </td></tr><tr><td align="left">20.2.1</td><td align="left">Operators</td><td align="left"> </td><td align="left"> </td><td align="left">partial</td><td align="left"> </td></tr><tr><td align="left">20.2.2</td><td align="left">forward/move helpers</td><td align="left"> </td><td align="left"> </td><td align="left">partial</td><td align="left"> </td></tr><tr><td align="left">20.2.3</td><td align="left">Pairs</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.3</td><td align="left">Header <code class="code">&lt;tuple&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.3.1</td><td align="left">Class template <code class="code">tuple</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.3.1.1</td><td align="left">Construction</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.3.1.2</td><td align="left">Tuple creation functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.3.1.3</td><td align="left">Tuple helper classes</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.3.1.4</td><td align="left">Element access</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.3.1.5</td><td align="left">Relational operators</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4</td><td colspan="5" align="left"><span class="emphasis"><em>Metaprogramming and type traits</em></span></td></tr><tr><td align="left">20.4.1</td><td align="left">Requirements</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.2</td><td align="left">Header <code class="code">&lt;type_traits&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.3</td><td align="left">Helper classes</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.4</td><td align="left">General Requirements</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.5</td><td align="left">Unary Type Traits</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.5.1</td><td align="left">Primary Type Categories</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.5.2</td><td align="left">Composite type traits</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.5.3</td><td align="left">Type properties</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.6</td><td align="left">Relationships between types</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.7</td><td align="left">Transformations between types</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.7.1</td><td align="left">Const-volatile modifications</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.7.2</td><td align="left">Reference modifications</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.7.3</td><td align="left">Array modifications</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.7.4</td><td align="left">Pointer modifications</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.8</td><td align="left">Other transformations</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.9</td><td align="left">Implementation requirements</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5 </td><td align="left">Function Objects</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5</td><td align="left">Additions to header <code class="code">&lt;functional&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.1</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.2</td><td align="left">Requirements</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.3</td><td align="left">Base</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.4</td><td align="left">Function return types</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.5</td><td align="left">Class template <code class="code">reference_wrapper</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.5.1</td><td align="left"><code class="code">reference_wrapper</code> construct/copy/destroy</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.5.2</td><td align="left"><code class="code">reference_wrapper</code> assignment</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.5.3</td><td align="left"><code class="code">reference_wrapper</code> access</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.5.4</td><td align="left"><code class="code">reference_wrapper</code> invocation</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.5.5</td><td align="left"><code class="code">reference_wrapper</code> helper functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.14</td><td align="left">Function template <code class="code">mem_fn</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.11</td><td align="left">Template function bind</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.11.1</td><td align="left">Function object binders</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.11.1.1</td><td align="left">Class template <code class="code">is_bind_expression</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.11.1.2</td><td align="left">Class template <code class="code">is_placeholder</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.11.1.3</td><td align="left">Function template <code class="code">bind</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.11.1.4</td><td align="left">Placeholders</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.15</td><td align="left">Polymorphic function wrappers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.15.1</td><td align="left">Class <code class="code">bad_function_call<code class="code"></code></code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.15.1.1</td><td align="left"><code class="code">bad_function_call</code> constructor</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.15.2</td><td align="left">Class template <code class="code">function</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.15.2.1</td><td align="left"><code class="code">function</code> construct/copy/destroy</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.15.2.2</td><td align="left"><code class="code">function</code> modifiers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.15.2.3</td><td align="left"><code class="code">function</code> capacity</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.15.2.4</td><td align="left"><code class="code">function</code> invocation</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.15.2.5</td><td align="left"><code class="code">function</code> target access</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.15.2.7</td><td align="left">null pointer comparison operators</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.15.2.8</td><td align="left">specialized algorithms</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.16</td><td align="left">Class template <code class="code">hash</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6</td><td align="left">Additions to header <code class="code">&lt;memory&gt;</code> synopsis</td><td align="left"> </td><td align="left"> </td><td align="left">partial</td><td align="left">missing <code class="code">unique_ptr</code></td></tr><tr><td align="left">20.6.5</td><td align="left">Class template <code class="code">unique_ptr</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">20.6.6</td><td align="left">Smart pointers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.1</td><td align="left">Class <code class="code">bad_weak_ptr</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.2</td><td align="left">Class template <code class="code">shared_ptr</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">See Footnotes.</td></tr><tr><td align="left">20.6.6.2.1</td><td align="left"><code class="code">shared_ptr</code> constructors</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.2.2</td><td align="left"><code class="code">shared_ptr</code> destructor</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.2.3</td><td align="left"><code class="code">shared_ptr</code> assignment</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.2.4</td><td align="left"><code class="code">shared_ptr</code> modifiers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.2.5</td><td align="left"><code class="code">shared_ptr</code> observers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.2.6</td><td align="left"><code class="code">shared_ptr</code> creation</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">
        <a class="ulink" href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2351.htm" target="_top">N2351</a>
!       </td></tr><tr><td align="left">20.6.6.2.7</td><td align="left"><code class="code">shared_ptr</code> comparison</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.2.8</td><td align="left"><code class="code">shared_ptr</code> I/O</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.2.9</td><td align="left"><code class="code">shared_ptr</code> specialized algorithms</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.2.10</td><td align="left"><code class="code">shared_ptr</code> casts</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.2.11</td><td align="left"><code class="code">get_deleter</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.3</td><td align="left">Class template <code class="code">weak_ptr</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.3.1</td><td align="left"><code class="code">weak_ptr</code> constructors</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.3.2</td><td align="left"><code class="code">weak_ptr</code> destructor</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.3.3</td><td align="left"><code class="code">weak_ptr</code> assignment</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.3.4</td><td align="left"><code class="code">weak_ptr</code> modifiers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.3.5</td><td align="left"><code class="code">weak_ptr</code> observers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.3.6</td><td align="left"><code class="code">weak_ptr</code> comparison</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.3.7</td><td align="left"><code class="code">weak_ptr</code> specialized algorithms</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.4</td><td align="left">Class template <code class="code">enable_shared_from_this</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left"><span class="emphasis"><em>23</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>Containers</em></span></td></tr><tr><td align="left">23.2.1</td><td align="left">Header <code class="code">&lt;array&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.2.1</td><td align="left">Class template array</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.2.1.1</td><td align="left"><code class="code">array</code> constructors, copy, and assignment</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.2.1.2</td><td align="left"><code class="code">array</code> specialized algorithms</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.2.1.3</td><td align="left"><code class="code">array </code>size</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.2.1.4</td><td align="left"><code class="code">array </code>data</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.2.1.5</td><td align="left">Zero sized <code class="code">array</code>s</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.2.1.6</td><td align="left">Tuple interface to class template <code class="code">array</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4</td><td align="left">Unordered associative containers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.1</td><td align="left">Class template <code class="code">unordered_map</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.1.1</td><td align="left"><code class="code">unordered_map</code> constructors</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.1.2</td><td align="left"><code class="code">unordered_map</code> element access</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.1.3</td><td align="left"><code class="code">unordered_map</code> swap</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.2</td><td align="left">Class template <code class="code">unordered_multimap</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.2.1</td><td align="left"><code class="code">unordered_multimap</code> constructors</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.2.2</td><td align="left"><code class="code">unordered_multimap</code> swap</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.3</td><td align="left">Class template <code class="code">unordered_set</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.3.1</td><td align="left"><code class="code">unordered_set</code> constructors</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.3.2</td><td align="left"><code class="code">unordered_set</code> swap</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.4</td><td align="left">Class template <code class="code">unordered_multiset<code class="code"></code></code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.4.1</td><td align="left"><code class="code">unordered_multiset</code> constructors</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.4.2</td><td align="left"><code class="code">unordered_multiset</code> swap</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left"><span class="emphasis"><em>26</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>Numerics</em></span></td></tr><tr><td align="left">26.4</td><td align="left">Random number generation</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.1</td><td align="left">Requirements</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.2</td><td align="left">Header <code class="code">&lt;random&gt;</code> synopsis</td><td align="left"> </td><td align="left"> </td><td align="left">partial</td><td align="left"> </td></tr><tr><td align="left">26.4.3</td><td align="left">Random number engine class templates</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.3.1</td><td align="left">Class template <code class="code">linear_congruential_engine</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.3.2</td><td align="left">Class template <code class="code">mersenne_twister_engine</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.3.3</td><td align="left">Class template <code class="code">subtract_with_carry_engine</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.4</td><td align="left">Random number engine adaptor class templates</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.4.1</td><td align="left">Class template <code class="code">discard_block_engine</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.4.2</td><td align="left">Class template <code class="code">independent_bits_engine</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.4.3</td><td align="left">Class template <code class="code">shuffle_order_engine</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.4.4</td><td align="left">Class template <code class="code">xor_combine_engine</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">operator()() per N2079</td></tr><tr><td align="left">26.4.5</td><td align="left">Engines and engine adaptors with predefined parameters</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.6</td><td align="left">Class <code class="code">random_device</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.7</td><td align="left">Utilities</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.7.1</td><td align="left">Class <code class="code">seed_seq</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.7.2</td><td align="left">Function template <code class="code">generate_cannonical</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8</td><td align="left">Random number generation class templates</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.8.1</td><td align="left">Uniform distributions</td><td align="left"> </td><td align="left"> </td><td align="left">partial</td><td align="left"> </td></tr><tr><td align="left">26.4.8.1</td><td align="left">Class template <code class="code">uniform_int_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.1</td><td align="left">Class template <code class="code">uniform_real_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.2</td><td align="left">Bernoulli distributions</td><td align="left"> </td><td align="left"> </td><td align="left">partial</td><td align="left"> </td></tr><tr><td align="left">26.4.8.2.1</td><td align="left">Class <code class="code">bernoulli_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.8.2.2</td><td align="left">Class template <code class="code">binomial_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.8.2.3</td><td align="left">Class template <code class="code">geometric_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.8.2.4</td><td align="left">Class template <code class="code">negative_binomial_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.3</td><td align="left">Poisson distributions</td><td align="left"> </td><td align="left"> </td><td align="left">partial</td><td align="left"> </td></tr><tr><td align="left">26.4.8.3.1</td><td align="left">Class template <code class="code">poisson_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.8.3.2</td><td align="left">Class template <code class="code">exponential_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.8.3.3</td><td align="left">Class template <code class="code">gamma_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.8.3.4</td><td align="left">Class template <code class="code">weibull_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.3.5</td><td align="left">Class template <code class="code">extreme_value_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.4</td><td align="left">Normal distributions</td><td align="left"> </td><td align="left"> </td><td align="left">partial</td><td align="left"> </td></tr><tr><td align="left">26.4.8.4.1</td><td align="left">Class template <code class="code">normal_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.8.4.2</td><td align="left">Class template <code class="code">lognormal_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.4.3</td><td align="left">Class template <code class="code">chi_squared_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.4.4</td><td align="left">Class template <code class="code">cauchy_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.4.5</td><td align="left">Class template <code class="code">fisher_f_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.4.6</td><td align="left">Class template <code class="code">student_t_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.5</td><td align="left">Sampling distributions</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.5.1</td><td align="left">Class template <code class="code">discrete_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.5.1</td><td align="left">Class template <code class="code">piecewise_constant_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.5.1</td><td align="left">Class template <code class="code">general_pdf_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left"><span class="emphasis"><em>28</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>Regular Expressions</em></span></td></tr><tr><td align="left">28.1</td><td align="left">Definitions</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.2</td><td align="left">Requirements</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.3</td><td align="left">Regular expressions summary</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.4</td><td align="left">Header <code class="code">&lt;regex&gt;</code> synopsis</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.5</td><td align="left">Namespace <code class="code">tr1::regex_constants</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.5.1</td><td align="left">Bitmask Type <code class="code">syntax_option_type</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.5.2</td><td align="left">Bitmask Type <code class="code">regex_constants::match_flag_type</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.5.3</td><td align="left">Implementation defined <code class="code">error_type</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.6</td><td align="left">Class <code class="code">regex_error</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.7</td><td align="left">Class template <code class="code">regex_traits</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.8</td><td align="left">Class template <code class="code">basic_regex</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.8.1</td><td align="left"><code class="code">basic_regex</code> constants</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.8.2</td><td align="left"><code class="code">basic_regex</code> constructors</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.8.3</td><td align="left"><code class="code">basic_regex</code> assign</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.8.4</td><td align="left"><code class="code">basic_regex</code> constant operations</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.8.5</td><td align="left"><code class="code">basic_regex</code> locale</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.8.6</td><td align="left"><code class="code">basic_regex</code> swap</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.8.7</td><td align="left"><code class="code">basic_regex</code> non-member functions</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.8.7.1</td><td align="left"><code class="code">basic_regex</code> non-member swap</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.9</td><td align="left">Class template <code class="code">sub_match</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.9.1</td><td align="left"><code class="code">sub_match</code> members</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.9.2</td><td align="left"><code class="code">sub_match</code> non-member operators</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.10</td><td align="left">Class template <code class="code">match_results</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.10.1</td><td align="left"><code class="code">match_results</code> constructors</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.10.2</td><td align="left"><code class="code">match_results</code> size</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.10.3</td><td align="left"><code class="code">match_results</code> element access</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.10.4</td><td align="left"><code class="code">match_results</code> formatting</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.10.5</td><td align="left"><code class="code">match_results</code> allocator</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.10.6</td><td align="left"><code class="code">match_results</code> swap</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.11</td><td align="left">Regular expression algorithms</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.11.1</td><td align="left">exceptions</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.11.2</td><td align="left"><code class="code">regex_match</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.11.3</td><td align="left"><code class="code">regex_search</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.11.4</td><td align="left"><code class="code">regex_replace</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.12</td><td align="left">Regular expression Iterators</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.12.1</td><td align="left">Class template <code class="code">regex_iterator</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.12.1.1</td><td align="left"><code class="code">regex_iterator</code> constructors</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.12.1.2</td><td align="left"><code class="code">regex_iterator</code> comparisons</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.12.1.3</td><td align="left"><code class="code">regex_iterator</code> dereference</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.12.1.4</td><td align="left"><code class="code">regex_iterator</code> increment</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.12.2</td><td align="left">Class template <code class="code">regex_token_iterator</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.12.2.1</td><td align="left"><code class="code">regex_token_iterator</code> constructors</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.12.2.2</td><td align="left"><code class="code">regex_token_iterator</code> comparisons</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.12.2.3</td><td align="left"><code class="code">regex_token_iterator</code> dereference</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.12.2.4</td><td align="left"><code class="code">regex_token_iterator</code> increment</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.13</td><td align="left">Modified ECMAScript regular expression grammar</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left"><span class="emphasis"><em>C</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>C Compatibility</em></span></td></tr><tr><td align="left">C2.1</td><td align="left">Additions to header <code class="code">&lt;complex&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.1.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.1.2</td><td align="left">Function <code class="code">acos</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.1.3</td><td align="left">Function <code class="code">asin</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.1.4</td><td align="left">Function <code class="code">atan</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.1.5</td><td align="left">Function <code class="code">acosh</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.1.6</td><td align="left">Function <code class="code">asinh</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.1.7</td><td align="left">Function <code class="code">atanh</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.1.8</td><td align="left">Function <code class="code">fabs</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.1.9</td><td align="left">Additional Overloads</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.2</td><td align="left">Header <code class="code">&lt;ccomplex&gt;</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left">DR 551</td></tr><tr><td align="left">C2.3</td><td align="left">Header <code class="code">&lt;complex.h&gt;</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left">DR 551</td></tr><tr><td align="left">C2.4</td><td align="left">Additions to header <code class="code">&lt;cctype&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.4.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.4.2</td><td align="left">Function <code class="code">isblank</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.5</td><td align="left">Additions to header <code class="code">&lt;ctype.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.6</td><td align="left">Header <code class="code">&lt;cfenv&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.6.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.6.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.7</td><td align="left">Header <code class="code">&lt;fenv.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.8</td><td align="left">Additions to header <code class="code">&lt;cfloat&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.9</td><td align="left">Additions to header <code class="code">&lt;float.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.10</td><td align="left">Additions to header <code class="code">&lt;ios&gt;</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">C2.10.1</td><td align="left">Synopsis</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">C2.10.2</td><td align="left">Function <code class="code">hexfloat</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">C2.11</td><td align="left">Header <code class="code">&lt;cinttypes&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.11.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">DR 557</td></tr><tr><td align="left">C2.11.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.12</td><td align="left">Header <code class="code">&lt;inttypes.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.13</td><td align="left">Additions to header <code class="code">&lt;climits&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.14</td><td align="left">Additions to header <code class="code">&lt;limits.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.15</td><td align="left">Additions to header <code class="code">&lt;locale&gt;</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">C2.16</td><td align="left">Additions to header <code class="code">&lt;cmath&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.16.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.16.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.16.3</td><td align="left">Function template definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.16.4</td><td align="left">Additional overloads</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">DR 568; DR 550</td></tr><tr><td align="left">C2.17</td><td align="left">Additions to header <code class="code">&lt;math.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.18</td><td align="left">Additions to header <code class="code">&lt;cstdarg&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.19</td><td align="left">Additions to header <code class="code">&lt;stdarg.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.20</td><td align="left">The header <code class="code">&lt;cstdbool&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.21</td><td align="left">The header <code class="code">&lt;stdbool.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.22</td><td align="left">The header <code class="code">&lt;cstdint&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.22.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.22.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.23</td><td align="left">The header <code class="code">&lt;stdint.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.24</td><td align="left">Additions to header <code class="code">&lt;cstdio&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.24.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.24.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.24.3</td><td align="left">Additional format specifiers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">C library responsibility</td></tr><tr><td align="left">C2.24.4</td><td align="left">Additions to header <code class="code">&lt;stdio.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.25</td><td align="left">Additions to header <code class="code">&lt;cstdlib&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.25.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.25.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.25.3</td><td align="left">Function <code class="code">abs</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.25.4</td><td align="left">Function <code class="code">div</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.26</td><td align="left">Additions to header <code class="code">&lt;stdlib.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.27</td><td align="left">Header <code class="code">&lt;ctgmath&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">DR 551</td></tr><tr><td align="left">C2.28</td><td align="left">Header <code class="code">&lt;tgmath.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">DR 551</td></tr><tr><td align="left">C2.29</td><td align="left">Additions to header <code class="code">&lt;ctime&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">C library responsibility</td></tr><tr><td align="left">C2.30</td><td align="left">Additions to header <code class="code">&lt;cwchar&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.30.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.30.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.30.3</td><td align="left">Additional wide format specifiers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">C library responsibility</td></tr><tr><td align="left">C2.31</td><td align="left">Additions to header <code class="code">&lt;wchar.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.32</td><td align="left">Additions to header <code class="code">&lt;cwctype&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.32.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.32.2</td><td align="left">Function <code class="code">iswblank</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.33</td><td align="left">Additions to header <code class="code">&lt;wctype.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left"><span class="emphasis"><em>D</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>Compatibility Features</em></span></td></tr><tr><td align="left">D.6</td><td align="left">Old iostream members</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">D.8</td><td align="left">Binders</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"><a class="ulink" href="http://gcc.gnu.org/PR33911" target="_top">33911</a></td></tr><tr><td align="left">D.9</td><td align="left">Class template <code class="code">auto_ptr</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"><a class="ulink" href="http://gcc.gnu.org/PR33911" target="_top">33911</a></td></tr></tbody></table></div></div><br class="table-break" /><p>
  Footnotes
  </p><p>
    The shared_ptr implementation uses some code from the
--- 6120,6128 ----
  </p><p>
  This page describes the C++0x support in mainline GCC SVN, not in any
  particular release.
! </p><div class="table"><a id="id428196"></a><p class="title"><b>Table 1.2. C++ 200x Implementation Status</b></p><div class="table-contents"><table summary="C++ 200x Implementation Status" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col align="left" /></colgroup><thead><tr><th align="left">Section</th><th align="left">Description</th><th align="left">Done</th><th align="left">Broken</th><th align="left">Missing</th><th align="left">Comments</th></tr></thead><tbody><tr><td align="left"><span class="emphasis"><em>20</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>General Utilities</em></span></td></tr><tr><td align="left">20.2</td><td align="left">Utility Components</td><td align="left"> </td><td align="left"> </td><td align="left">incomplete</td><td align="left"> </td></tr><tr><td align="left">20.2.1</td><td align="left">Operators</td><td align="left"> </td><td align="left"> </td><td align="left">partial</td><td align="left"> </td></tr><tr><td align="left">20.2.2</td><td align="left">forward/move helpers</td><td align="left"> </td><td align="left"> </td><td align="left">partial</td><td align="left"> </td></tr><tr><td align="left">20.2.3</td><td align="left">Pairs</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.3</td><td align="left">Header <code class="code">&lt;tuple&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.3.1</td><td align="left">Class template <code class="code">tuple</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.3.1.1</td><td align="left">Construction</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.3.1.2</td><td align="left">Tuple creation functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.3.1.3</td><td align="left">Tuple helper classes</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.3.1.4</td><td align="left">Element access</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.3.1.5</td><td align="left">Relational operators</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4</td><td colspan="5" align="left"><span class="emphasis"><em>Metaprogramming and type traits</em></span></td></tr><tr><td align="left">20.4.1</td><td align="left">Requirements</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.2</td><td align="left">Header <code class="code">&lt;type_traits&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.3</td><td align="left">Helper classes</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.4</td><td align="left">General Requirements</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.5</td><td align="left">Unary Type Traits</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.5.1</td><td align="left">Primary Type Categories</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.5.2</td><td align="left">Composite type traits</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.5.3</td><td align="left">Type properties</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.6</td><td align="left">Relationships between types</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.7</td><td align="left">Transformations between types</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.7.1</td><td align="left">Const-volatile modifications</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.7.2</td><td align="left">Reference modifications</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.7.3</td><td align="left">Array modifications</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.7.4</td><td align="left">Pointer modifications</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.8</td><td align="left">Other transformations</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.4.9</td><td align="left">Implementation requirements</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5 </td><td align="left">Function Objects</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5</td><td align="left">Additions to header <code class="code">&lt;functional&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.1</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.2</td><td align="left">Requirements</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.3</td><td align="left">Base</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.4</td><td align="left">Function return types</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.5</td><td align="left">Class template <code class="code">reference_wrapper</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.5.1</td><td align="left"><code class="code">reference_wrapper</code> construct/copy/destroy</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.5.2</td><td align="left"><code class="code">reference_wrapper</code> assignment</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.5.3</td><td align="left"><code class="code">reference_wrapper</code> access</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.5.4</td><td align="left"><code class="code">reference_wrapper</code> invocation</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.5.5</td><td align="left"><code class="code">reference_wrapper</code> helper functions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.14</td><td align="left">Function template <code class="code">mem_fn</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.11</td><td align="left">Template function bind</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.11.1</td><td align="left">Function object binders</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.11.1.1</td><td align="left">Class template <code class="code">is_bind_expression</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.11.1.2</td><td align="left">Class template <code class="code">is_placeholder</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.11.1.3</td><td align="left">Function template <code class="code">bind</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.11.1.4</td><td align="left">Placeholders</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.15</td><td align="left">Polymorphic function wrappers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.15.1</td><td align="left">Class <code class="code">bad_function_call<code class="code"></code></code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.15.1.1</td><td align="left"><code class="code">bad_function_call</code> constructor</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.15.2</td><td align="left">Class template <code class="code">function</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.15.2.1</td><td align="left"><code class="code">function</code> construct/copy/destroy</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.15.2.2</td><td align="left"><code class="code">function</code> modifiers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.15.2.3</td><td align="left"><code class="code">function</code> capacity</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.15.2.4</td><td align="left"><code class="code">function</code> invocation</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.15.2.5</td><td align="left"><code class="code">function</code> target access</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.15.2.7</td><td align="left">null pointer comparison operators</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.15.2.8</td><td align="left">specialized algorithms</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.5.16</td><td align="left">Class template <code class="code">hash</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6</td><td align="left">Additions to header <code class="code">&lt;memory&gt;</code> synopsis</td><td align="left"> </td><td align="left"> </td><td align="left">partial</td><td align="left">missing <code class="code">unique_ptr</code></td></tr><tr><td align="left">20.6.5</td><td align="left">Class template <code class="code">unique_ptr</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">20.6.6</td><td align="left">Smart pointers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.1</td><td align="left">Class <code class="code">bad_weak_ptr</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.2</td><td align="left">Class template <code class="code">shared_ptr</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">See Footnotes.</td></tr><tr><td align="left">20.6.6.2.1</td><td align="left"><code class="code">shared_ptr</code> constructors</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.2.2</td><td align="left"><code class="code">shared_ptr</code> destructor</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.2.3</td><td align="left"><code class="code">shared_ptr</code> assignment</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.2.4</td><td align="left"><code class="code">shared_ptr</code> modifiers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.2.5</td><td align="left"><code class="code">shared_ptr</code> observers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.2.6</td><td align="left"><code class="code">shared_ptr</code> creation</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">
        <a class="ulink" href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2351.htm" target="_top">N2351</a>
!       </td></tr><tr><td align="left">20.6.6.2.7</td><td align="left"><code class="code">shared_ptr</code> comparison</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.2.8</td><td align="left"><code class="code">shared_ptr</code> I/O</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.2.9</td><td align="left"><code class="code">shared_ptr</code> specialized algorithms</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.2.10</td><td align="left"><code class="code">shared_ptr</code> casts</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.2.11</td><td align="left"><code class="code">get_deleter</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.3</td><td align="left">Class template <code class="code">weak_ptr</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.3.1</td><td align="left"><code class="code">weak_ptr</code> constructors</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.3.2</td><td align="left"><code class="code">weak_ptr</code> destructor</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.3.3</td><td align="left"><code class="code">weak_ptr</code> assignment</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.3.4</td><td align="left"><code class="code">weak_ptr</code> modifiers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.3.5</td><td align="left"><code class="code">weak_ptr</code> observers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.3.6</td><td align="left"><code class="code">weak_ptr</code> comparison</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.3.7</td><td align="left"><code class="code">weak_ptr</code> specialized algorithms</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.6.6.4</td><td align="left">Class template <code class="code">enable_shared_from_this</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left"><span class="emphasis"><em>23</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>Containers</em></span></td></tr><tr><td align="left">23.2.1</td><td align="left">Header <code class="code">&lt;array&gt;</code> synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.2.1</td><td align="left">Class template array</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.2.1.1</td><td align="left"><code class="code">array</code> constructors, copy, and assignment</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.2.1.2</td><td align="left"><code class="code">array</code> specialized algorithms</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.2.1.3</td><td align="left"><code class="code">array </code>size</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.2.1.4</td><td align="left"><code class="code">array </code>data</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.2.1.5</td><td align="left">Zero sized <code class="code">array</code>s</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.2.1.6</td><td align="left">Tuple interface to class template <code class="code">array</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4</td><td align="left">Unordered associative containers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.1</td><td align="left">Class template <code class="code">unordered_map</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.1.1</td><td align="left"><code class="code">unordered_map</code> constructors</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.1.2</td><td align="left"><code class="code">unordered_map</code> element access</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.1.3</td><td align="left"><code class="code">unordered_map</code> swap</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.2</td><td align="left">Class template <code class="code">unordered_multimap</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.2.1</td><td align="left"><code class="code">unordered_multimap</code> constructors</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.2.2</td><td align="left"><code class="code">unordered_multimap</code> swap</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.3</td><td align="left">Class template <code class="code">unordered_set</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.3.1</td><td align="left"><code class="code">unordered_set</code> constructors</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.3.2</td><td align="left"><code class="code">unordered_set</code> swap</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.4</td><td align="left">Class template <code class="code">unordered_multiset<code class="code"></code></code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.4.1</td><td align="left"><code class="code">unordered_multiset</code> constructors</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">23.4.4.2</td><td align="left"><code class="code">unordered_multiset</code> swap</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left"><span class="emphasis"><em>26</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>Numerics</em></span></td></tr><tr><td align="left">26.4</td><td align="left">Random number generation</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.1</td><td align="left">Requirements</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.2</td><td align="left">Header <code class="code">&lt;random&gt;</code> synopsis</td><td align="left"> </td><td align="left"> </td><td align="left">partial</td><td align="left"> </td></tr><tr><td align="left">26.4.3</td><td align="left">Random number engine class templates</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.3.1</td><td align="left">Class template <code class="code">linear_congruential_engine</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.3.2</td><td align="left">Class template <code class="code">mersenne_twister_engine</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.3.3</td><td align="left">Class template <code class="code">subtract_with_carry_engine</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.4</td><td align="left">Random number engine adaptor class templates</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.4.1</td><td align="left">Class template <code class="code">discard_block_engine</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.4.2</td><td align="left">Class template <code class="code">independent_bits_engine</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.4.3</td><td align="left">Class template <code class="code">shuffle_order_engine</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.4.4</td><td align="left">Class template <code class="code">xor_combine_engine</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">operator()() per N2079</td></tr><tr><td align="left">26.4.5</td><td align="left">Engines and engine adaptors with predefined parameters</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.6</td><td align="left">Class <code class="code">random_device</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.7</td><td align="left">Utilities</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.7.1</td><td align="left">Class <code class="code">seed_seq</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.7.2</td><td align="left">Function template <code class="code">generate_canonical</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8</td><td align="left">Random number generation class templates</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.8.1</td><td align="left">Uniform distributions</td><td align="left"> </td><td align="left"> </td><td align="left">partial</td><td align="left"> </td></tr><tr><td align="left">26.4.8.1</td><td align="left">Class template <code class="code">uniform_int_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.1</td><td align="left">Class template <code class="code">uniform_real_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.2</td><td align="left">Bernoulli distributions</td><td align="left"> </td><td align="left"> </td><td align="left">partial</td><td align="left"> </td></tr><tr><td align="left">26.4.8.2.1</td><td align="left">Class <code class="code">bernoulli_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.8.2.2</td><td align="left">Class template <code class="code">binomial_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.8.2.3</td><td align="left">Class template <code class="code">geometric_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.8.2.4</td><td align="left">Class template <code class="code">negative_binomial_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.3</td><td align="left">Poisson distributions</td><td align="left"> </td><td align="left"> </td><td align="left">partial</td><td align="left"> </td></tr><tr><td align="left">26.4.8.3.1</td><td align="left">Class template <code class="code">poisson_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.8.3.2</td><td align="left">Class template <code class="code">exponential_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.8.3.3</td><td align="left">Class template <code class="code">gamma_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.8.3.4</td><td align="left">Class template <code class="code">weibull_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.3.5</td><td align="left">Class template <code class="code">extreme_value_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.4</td><td align="left">Normal distributions</td><td align="left"> </td><td align="left"> </td><td align="left">partial</td><td align="left"> </td></tr><tr><td align="left">26.4.8.4.1</td><td align="left">Class template <code class="code">normal_distribution</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">26.4.8.4.2</td><td align="left">Class template <code class="code">lognormal_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.4.3</td><td align="left">Class template <code class="code">chi_squared_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.4.4</td><td align="left">Class template <code class="code">cauchy_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.4.5</td><td align="left">Class template <code class="code">fisher_f_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.4.6</td><td align="left">Class template <code class="code">student_t_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.5</td><td align="left">Sampling distributions</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.5.1</td><td align="left">Class template <code class="code">discrete_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.5.1</td><td align="left">Class template <code class="code">piecewise_constant_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">26.4.8.5.1</td><td align="left">Class template <code class="code">general_pdf_distribution</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left"><span class="emphasis"><em>28</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>Regular Expressions</em></span></td></tr><tr><td align="left">28.1</td><td align="left">Definitions</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.2</td><td align="left">Requirements</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.3</td><td align="left">Regular expressions summary</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.4</td><td align="left">Header <code class="code">&lt;regex&gt;</code> synopsis</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.5</td><td align="left">Namespace <code class="code">tr1::regex_constants</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.5.1</td><td align="left">Bitmask Type <code class="code">syntax_option_type</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.5.2</td><td align="left">Bitmask Type <code class="code">regex_constants::match_flag_type</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.5.3</td><td align="left">Implementation defined <code class="code">error_type</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.6</td><td align="left">Class <code class="code">regex_error</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.7</td><td align="left">Class template <code class="code">regex_traits</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.8</td><td align="left">Class template <code class="code">basic_regex</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.8.1</td><td align="left"><code class="code">basic_regex</code> constants</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.8.2</td><td align="left"><code class="code">basic_regex</code> constructors</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.8.3</td><td align="left"><code class="code">basic_regex</code> assign</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.8.4</td><td align="left"><code class="code">basic_regex</code> constant operations</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.8.5</td><td align="left"><code class="code">basic_regex</code> locale</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.8.6</td><td align="left"><code class="code">basic_regex</code> swap</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.8.7</td><td align="left"><code class="code">basic_regex</code> non-member functions</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.8.7.1</td><td align="left"><code class="code">basic_regex</code> non-member swap</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.9</td><td align="left">Class template <code class="code">sub_match</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.9.1</td><td align="left"><code class="code">sub_match</code> members</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.9.2</td><td align="left"><code class="code">sub_match</code> non-member operators</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.10</td><td align="left">Class template <code class="code">match_results</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.10.1</td><td align="left"><code class="code">match_results</code> constructors</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.10.2</td><td align="left"><code class="code">match_results</code> size</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.10.3</td><td align="left"><code class="code">match_results</code> element access</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.10.4</td><td align="left"><code class="code">match_results</code> formatting</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.10.5</td><td align="left"><code class="code">match_results</code> allocator</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.10.6</td><td align="left"><code class="code">match_results</code> swap</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.11</td><td align="left">Regular expression algorithms</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.11.1</td><td align="left">exceptions</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.11.2</td><td align="left"><code class="code">regex_match</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.11.3</td><td align="left"><code class="code">regex_search</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.11.4</td><td align="left"><code class="code">regex_replace</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.12</td><td align="left">Regular expression Iterators</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.12.1</td><td align="left">Class template <code class="code">regex_iterator</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.12.1.1</td><td align="left"><code class="code">regex_iterator</code> constructors</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.12.1.2</td><td align="left"><code class="code">regex_iterator</code> comparisons</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.12.1.3</td><td align="left"><code class="code">regex_iterator</code> dereference</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.12.1.4</td><td align="left"><code class="code">regex_iterator</code> increment</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.12.2</td><td align="left">Class template <code class="code">regex_token_iterator</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.12.2.1</td><td align="left"><code class="code">regex_token_iterator</code> constructors</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.12.2.2</td><td align="left"><code class="code">regex_token_iterator</code> comparisons</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.12.2.3</td><td align="left"><code class="code">regex_token_iterator</code> dereference</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.12.2.4</td><td align="left"><code class="code">regex_token_iterator</code> increment</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">28.13</td><td align="left">Modified ECMAScript regular expression grammar</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left"><span class="emphasis"><em>C</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>C Compatibility</em></span></td></tr><tr><td align="left">C2.1</td><td align="left">Additions to header <code class="code">&lt;complex&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.1.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.1.2</td><td align="left">Function <code class="code">acos</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.1.3</td><td align="left">Function <code class="code">asin</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.1.4</td><td align="left">Function <code class="code">atan</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.1.5</td><td align="left">Function <code class="code">acosh</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.1.6</td><td align="left">Function <code class="code">asinh</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.1.7</td><td align="left">Function <code class="code">atanh</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.1.8</td><td align="left">Function <code class="code">fabs</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.1.9</td><td align="left">Additional Overloads</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.2</td><td align="left">Header <code class="code">&lt;ccomplex&gt;</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left">DR 551</td></tr><tr><td align="left">C2.3</td><td align="left">Header <code class="code">&lt;complex.h&gt;</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left">DR 551</td></tr><tr><td align="left">C2.4</td><td align="left">Additions to header <code class="code">&lt;cctype&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.4.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.4.2</td><td align="left">Function <code class="code">isblank</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.5</td><td align="left">Additions to header <code class="code">&lt;ctype.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.6</td><td align="left">Header <code class="code">&lt;cfenv&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.6.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.6.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.7</td><td align="left">Header <code class="code">&lt;fenv.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.8</td><td align="left">Additions to header <code class="code">&lt;cfloat&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.9</td><td align="left">Additions to header <code class="code">&lt;float.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.10</td><td align="left">Additions to header <code class="code">&lt;ios&gt;</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">C2.10.1</td><td align="left">Synopsis</td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">C2.10.2</td><td align="left">Function <code class="code">hexfloat</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">C2.11</td><td align="left">Header <code class="code">&lt;cinttypes&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.11.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">DR 557</td></tr><tr><td align="left">C2.11.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.12</td><td align="left">Header <code class="code">&lt;inttypes.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.13</td><td align="left">Additions to header <code class="code">&lt;climits&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.14</td><td align="left">Additions to header <code class="code">&lt;limits.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.15</td><td align="left">Additions to header <code class="code">&lt;locale&gt;</code></td><td align="left"> </td><td align="left"> </td><td align="left">missing</td><td align="left"> </td></tr><tr><td align="left">C2.16</td><td align="left">Additions to header <code class="code">&lt;cmath&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.16.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.16.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.16.3</td><td align="left">Function template definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.16.4</td><td align="left">Additional overloads</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">DR 568; DR 550</td></tr><tr><td align="left">C2.17</td><td align="left">Additions to header <code class="code">&lt;math.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.18</td><td align="left">Additions to header <code class="code">&lt;cstdarg&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.19</td><td align="left">Additions to header <code class="code">&lt;stdarg.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.20</td><td align="left">The header <code class="code">&lt;cstdbool&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.21</td><td align="left">The header <code class="code">&lt;stdbool.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.22</td><td align="left">The header <code class="code">&lt;cstdint&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.22.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.22.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.23</td><td align="left">The header <code class="code">&lt;stdint.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.24</td><td align="left">Additions to header <code class="code">&lt;cstdio&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.24.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.24.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.24.3</td><td align="left">Additional format specifiers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">C library responsibility</td></tr><tr><td align="left">C2.24.4</td><td align="left">Additions to header <code class="code">&lt;stdio.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.25</td><td align="left">Additions to header <code class="code">&lt;cstdlib&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.25.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.25.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.25.3</td><td align="left">Function <code class="code">abs</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.25.4</td><td align="left">Function <code class="code">div</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.26</td><td align="left">Additions to header <code class="code">&lt;stdlib.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.27</td><td align="left">Header <code class="code">&lt;ctgmath&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">DR 551</td></tr><tr><td align="left">C2.28</td><td align="left">Header <code class="code">&lt;tgmath.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">DR 551</td></tr><tr><td align="left">C2.29</td><td align="left">Additions to header <code class="code">&lt;ctime&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">C library responsibility</td></tr><tr><td align="left">C2.30</td><td align="left">Additions to header <code class="code">&lt;cwchar&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.30.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.30.2</td><td align="left">Definitions</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.30.3</td><td align="left">Additional wide format specifiers</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left">C library responsibility</td></tr><tr><td align="left">C2.31</td><td align="left">Additions to header <code class="code">&lt;wchar.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.32</td><td align="left">Additions to header <code class="code">&lt;cwctype&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.32.1</td><td align="left">Synopsis</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.32.2</td><td align="left">Function <code class="code">iswblank</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">C2.33</td><td align="left">Additions to header <code class="code">&lt;wctype.h&gt;</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left"><span class="emphasis"><em>D</em></span></td><td colspan="5" align="left"><span class="emphasis"><em>Compatibility Features</em></span></td></tr><tr><td align="left">D.6</td><td align="left">Old iostream members</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">D.8</td><td align="left">Binders</td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"><a class="ulink" href="http://gcc.gnu.org/PR33911" target="_top">33911</a></td></tr><tr><td align="left">D.9</td><td align="left">Class template <code class="code">auto_ptr</code></td><td align="left">done</td><td align="left"> </td><td align="left"> </td><td align="left"><a class="ulink" href="http://gcc.gnu.org/PR33911" target="_top">33911</a></td></tr></tbody></table></div></div><br class="table-break" /><p>
  Footnotes
  </p><p>
    The shared_ptr implementation uses some code from the
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt01ch03s02.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt01ch03s02.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt01ch03s02.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt01ch03s02.html	Thu Apr 10 22:53:15 2008
***************
*** 19,33 ****
       the 1998 standard as updated for 2003, and the draft of the
       upcoming 200x standard.
     </p><p>
!      C++98/03 include files. These are available in the default compilation mode, ie <code class="code">-std=c++98</code> or <code class="code">-std=gnu++98</code>. 
!    </p><div class="table"><a id="id398035"></a><p class="title"><b>Table 3.1. C++ 1998 Library Headers</b></p><div class="table-contents"><table summary="C++ 1998 Library Headers" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col /></colgroup><tbody><tr><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="filename">iomanip</code></td><td align="left"><code class="filename">list</code></td><td align="left"><code class="filename">ostream</code></td><td align="left"><code class="filename">streambuf</code></td></tr><tr><td align="left"><code class="filename">bitset</code></td><td align="left"><code class="filename">ios</code></td><td align="left"><code class="filename">locale</code></td><td align="left"><code class="filename">queue</code></td><td align="left"><code class="filename">string</code></td></tr><tr><td align="left"><code class="filename">complex</code></td><td align="left"><code class="filename">iosfwd</code></td><td align="left"><code class="filename">map</code></td><td align="left"><code class="filename">set</code></td><td align="left"><code class="filename">typeinfo</code></td></tr><tr><td align="left"><code class="filename">deque</code></td><td align="left"><code class="filename">iostream</code></td><td align="left"><code class="filename">memory</code></td><td align="left"><code class="filename">sstream</code></td><td align="left"><code class="filename">utility</code></td></tr><tr><td align="left"><code class="filename">exception</code></td><td align="left"><code class="filename">istream</code></td><td align="left"><code class="filename">new</code></td><td align="left"><code class="filename">stack</code></td><td align="left"><code class="filename">valarray</code></td></tr><tr><td align="left"><code class="filename">fstream</code></td><td align="left"><code class="filename">iterator</code></td><td align="left"><code class="filename">numeric</code></td><td align="left"><code class="filename">stdexcept</code></td><td align="left"><code class="filename">vector</code></td></tr><tr><td align="left"><code class="filename">functional</code></td><td align="left"><code class="filename">limits</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /><p></p><div class="table"><a id="id397982"></a><p class="title"><b>Table 3.2. C++ 1998 Library Headers for C Library Facilities</b></p><div class="table-contents"><table summary="C++ 1998 Library Headers for C Library Facilities" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col /></colgroup><tbody><tr><td align="left"><code class="filename">cassert</code></td><td align="left"><code class="filename">ciso646</code></td><td align="left"><code class="filename">csetjmp</code></td><td align="left"><code class="filename">cstdio</code></td><td align="left"><code class="filename">ctime</code></td></tr><tr><td align="left"><code class="filename">cctype</code></td><td align="left"><code class="filename">climits</code></td><td align="left"><code class="filename">csignal</code></td><td align="left"><code class="filename">cstdlib</code></td><td align="left"><code class="filename">cwchar</code></td></tr><tr><td align="left"><code class="filename">cerrno</code></td><td align="left"><code class="filename">clocale</code></td><td align="left"><code class="filename">cstdarg</code></td><td align="left"><code class="filename">cstring</code></td><td align="left"><code class="filename">cwctype</code></td></tr><tr><td align="left"><code class="filename">cfloat</code></td><td align="left"><code class="filename">cmath</code></td><td align="left"><code class="filename">cstddef</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /><p>C++0x include files. These are only available in C++0x compilation mode, ie <code class="code">-std=c++0x</code> or <code class="code">-std=gnu++0x</code>. 
! </p><p></p><div class="table"><a id="id399447"></a><p class="title"><b>Table 3.3. C++ 200x Library Headers</b></p><div class="table-contents"><table summary="C++ 200x Library Headers" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col /></colgroup><tbody><tr><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="filename">iomanip</code></td><td align="left"><code class="filename">locale</code></td><td align="left"><code class="filename">regex</code></td><td align="left"><code class="filename">tuple</code></td></tr><tr><td align="left"><code class="filename">array</code></td><td align="left"><code class="filename">ios</code></td><td align="left"><code class="filename">map</code></td><td align="left"><code class="filename">set</code></td><td align="left"><code class="filename">typeinfo</code></td></tr><tr><td align="left"><code class="filename">bitset</code></td><td align="left"><code class="filename">iosfwd</code></td><td align="left"><code class="filename">memory</code></td><td align="left"><code class="filename">sstream</code></td><td align="left"><code class="filename">type_traits</code></td></tr><tr><td align="left"><code class="filename">complex</code></td><td align="left"><code class="filename">iostream</code></td><td align="left"><code class="filename">new</code></td><td align="left"><code class="filename">stack</code></td><td align="left"><code class="filename">unordered_map</code></td></tr><tr><td align="left"><code class="filename">deque</code></td><td align="left"><code class="filename">istream</code></td><td align="left"><code class="filename">numeric</code></td><td align="left"><code class="filename">stdexcept</code></td><td align="left"><code class="filename">unordered_set</code></td></tr><tr><td align="left"><code class="filename">exception</code></td><td align="left"><code class="filename">iterator</code></td><td align="left"><code class="filename">ostream</code></td><td align="left"><code class="filename">streambuf</code></td><td align="left"><code class="filename">utility</code></td></tr><tr><td align="left"><code class="filename">fstream</code></td><td align="left"><code class="filename">limits</code></td><td align="left"><code class="filename">queue</code></td><td align="left"><code class="filename">string</code></td><td align="left"><code class="filename">valarray</code></td></tr><tr><td align="left"><code class="filename">functional</code></td><td align="left"><code class="filename">list</code></td><td align="left"><code class="filename">random</code></td><td align="left"><code class="filename">system_error</code></td><td align="left"><code class="filename">vector</code></td></tr></tbody></table></div></div><br class="table-break" /><p></p><div class="table"><a id="id394222"></a><p class="title"><b>Table 3.4. C++ 200x Library Headers for C Library Facilities</b></p><div class="table-contents"><table summary="C++ 200x Library Headers for C Library Facilities" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col align="left" /></colgroup><tbody><tr><td align="left"><code class="filename">cassert</code></td><td align="left"><code class="filename">cfloat</code></td><td align="left"><code class="filename">cmath</code></td><td align="left"><code class="filename">cstddef</code></td><td align="left"><code class="filename">ctgmath</code></td></tr><tr><td align="left"><code class="filename">ccomplex</code></td><td align="left"><code class="filename">cinttypes</code></td><td align="left"><code class="filename">csetjmp</code></td><td align="left"><code class="filename">cstdint</code></td><td align="left"><code class="filename">ctime</code></td></tr><tr><td align="left"><code class="filename">cctype</code></td><td align="left"><code class="filename">ciso646</code></td><td align="left"><code class="filename">csignal</code></td><td align="left"><code class="filename">cstdio</code></td><td align="left"><code class="filename">cuchar</code></td></tr><tr><td align="left"><code class="filename">cerrno</code></td><td align="left"><code class="filename">climits</code></td><td align="left"><code class="filename">cstdarg</code></td><td align="left"><code class="filename">cstdlib</code></td><td align="left"><code class="filename">cwchar</code></td></tr><tr><td align="left"><code class="filename">cfenv</code></td><td align="left"><code class="filename">clocale</code></td><td align="left"><code class="filename">cstdbool</code></td><td align="left"><code class="filename">cstring</code></td><td align="left"><code class="filename">cwctype</code></td></tr></tbody></table></div></div><br class="table-break" /><p>
    In addition, TR1 includes as:
! </p><div class="table"><a id="id485624"></a><p class="title"><b>Table 3.5. C++ TR1 Library Headers</b></p><div class="table-contents"><table summary="C++ TR1 Library Headers" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col align="left" /></colgroup><tbody><tr><td align="left"><code class="filename">tr1/array</code></td><td align="left"><code class="filename">tr1/memory</code></td><td align="left"><code class="filename">tr1/regex</code></td><td align="left"><code class="filename">tr1/type_traits</code></td><td align="left"><code class="filename">tr1/unordered_set</code></td></tr><tr><td align="left"><code class="filename">tr1/complex</code></td><td align="left"><code class="filename">tr1/random</code></td><td align="left"><code class="filename">tr1/tuple</code></td><td align="left"><code class="filename">tr1/unordered_map</code></td><td align="left"><code class="filename">tr1/utility</code></td></tr><tr><td align="left"><code class="filename">tr1/functional</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /><p></p><div class="table"><a id="id407403"></a><p class="title"><b>Table 3.6. C++ TR1 Library Headers for C Library Facilities</b></p><div class="table-contents"><table summary="C++ TR1 Library Headers for C Library Facilities" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col align="left" /></colgroup><tbody><tr><td align="left"><code class="filename">tr1/cmath</code></td><td align="left"><code class="filename">tr1/cfloat</code></td><td align="left"><code class="filename">tr1/cstdarg</code></td><td align="left"><code class="filename">tr1/cstdio</code></td><td align="left"><code class="filename">tr1/ctime</code></td></tr><tr><td align="left"><code class="filename">tr1/ccomplex</code></td><td align="left"><code class="filename">tr1/cinttypes</code></td><td align="left"><code class="filename">tr1/cstdbool</code></td><td align="left"><code class="filename">tr1/cstdlib</code></td><td align="left"><code class="filename">tr1/cwchar</code></td></tr><tr><td align="left"><code class="filename">tr1/cfenv</code></td><td align="left"><code class="filename">tr1/climits</code></td><td align="left"><code class="filename">tr1/cstdint</code></td><td align="left"><code class="filename">tr1/ctgmath</code></td><td align="left"><code class="filename">tr1/cwctype</code></td></tr></tbody></table></div></div><br class="table-break" /><p>
    Also included are files for the C++ ABI interface:
! </p><div class="table"><a id="id420398"></a><p class="title"><b>Table 3.7. C++ ABI Headers</b></p><div class="table-contents"><table summary="C++ ABI Headers" border="1"><colgroup><col align="left" /><col align="left" /></colgroup><tbody><tr><td align="left"><code class="filename">cxxabi.h</code></td><td align="left"><code class="filename">cxxabi_forced.h</code></td></tr></tbody></table></div></div><br class="table-break" /><p>
    And a large variety of extensions.
! </p><div class="table"><a id="id414207"></a><p class="title"><b>Table 3.8. Extension Headers</b></p><div class="table-contents"><table summary="Extension Headers" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col align="left" /></colgroup><tbody><tr><td align="left"><code class="filename">ext/algorithm</code></td><td align="left"><code class="filename">ext/debug_allocator.h</code></td><td align="left"><code class="filename">ext/mt_allocator.h</code></td><td align="left"><code class="filename">ext/pod_char_traits.h</code></td><td align="left"><code class="filename">ext/stdio_sync_filebuf.h</code></td></tr><tr><td align="left"><code class="filename">ext/array_allocator.h</code></td><td align="left"><code class="filename">ext/enc_filebuf.h</code></td><td align="left"><code class="filename">ext/new_allocator.h</code></td><td align="left"><code class="filename">ext/pool_allocator.h</code></td><td align="left"><code class="filename">ext/throw_allocator.h</code></td></tr><tr><td align="left"><code class="filename">ext/atomicity.h</code></td><td align="left"><code class="filename">ext/functional</code></td><td align="left"><code class="filename">ext/numeric</code></td><td align="left"><code class="filename">ext/rb_tree</code></td><td align="left"><code class="filename">ext/typelist.h</code></td></tr><tr><td align="left"><code class="filename">ext/bitmap_allocator.h</code></td><td align="left"><code class="filename">ext/iterator</code></td><td align="left"><code class="filename">ext/numeric_traits.h</code></td><td align="left"><code class="filename">ext/rope</code></td><td align="left"><code class="filename">ext/type_traits.h</code></td></tr><tr><td align="left"><code class="filename">ext/codecvt_specializations.h</code></td><td align="left"><code class="filename">ext/malloc_allocator.h</code></td><td align="left"><code class="filename">ext/pb_ds/assoc_container.h</code></td><td align="left"><code class="filename">ext/slist</code></td><td align="left"><code class="filename">ext/vstring.h</code></td></tr><tr><td align="left"><code class="filename">ext/concurrence.h</code></td><td align="left"><code class="filename">ext/memory</code></td><td align="left"><code class="filename">ext/pb_ds/priority_queue.h</code></td><td align="left"><code class="filename">ext/stdio_filebuf.h</code></td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /><p></p><div class="table"><a id="id458275"></a><p class="title"><b>Table 3.9. Extension Debug Headers</b></p><div class="table-contents"><table summary="Extension Debug Headers" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col align="left" /></colgroup><tbody><tr><td align="left"><code class="filename">debug/bitset</code></td><td align="left"><code class="filename">debug/list</code></td><td align="left"><code class="filename">debug/set</code></td><td align="left"><code class="filename">debug/unordered_map</code></td><td align="left"><code class="filename">debug/vector</code></td></tr><tr><td align="left"><code class="filename">debug/deque</code></td><td align="left"><code class="filename">debug/map</code></td><td align="left"><code class="filename">debug/string</code></td><td align="left"><code class="filename">debug/unordered_set</code></td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /><p></p><div class="table"><a id="id428288"></a><p class="title"><b>Table 3.10. Extension Parallel Headers</b></p><div class="table-contents"><table summary="Extension Parallel Headers" border="1"><colgroup><col align="left" /><col align="left" /></colgroup><tbody><tr><td align="left"><code class="filename">parallel/algorithm</code></td><td align="left"><code class="filename">parallel/numeric</code></td></tr></tbody></table></div></div><br class="table-break" /></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="manual.intro.using.headers.mixing"></a>Mixing Headers</h3></div></div></div><p> A few simple rules.
  </p><p>First, mixing different dialects of the standard headers is not
  possible. It's an all-or-nothing affair. Thus, code like
  </p><pre class="programlisting">
--- 19,33 ----
       the 1998 standard as updated for 2003, and the draft of the
       upcoming 200x standard.
     </p><p>
!      C++98/03 include files. These are available in the default compilation mode, i.e. <code class="code">-std=c++98</code> or <code class="code">-std=gnu++98</code>.
!    </p><div class="table"><a id="id424211"></a><p class="title"><b>Table 3.1. C++ 1998 Library Headers</b></p><div class="table-contents"><table summary="C++ 1998 Library Headers" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col /></colgroup><tbody><tr><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="filename">iomanip</code></td><td align="left"><code class="filename">list</code></td><td align="left"><code class="filename">ostream</code></td><td align="left"><code class="filename">streambuf</code></td></tr><tr><td align="left"><code class="filename">bitset</code></td><td align="left"><code class="filename">ios</code></td><td align="left"><code class="filename">locale</code></td><td align="left"><code class="filename">queue</code></td><td align="left"><code class="filename">string</code></td></tr><tr><td align="left"><code class="filename">complex</code></td><td align="left"><code class="filename">iosfwd</code></td><td align="left"><code class="filename">map</code></td><td align="left"><code class="filename">set</code></td><td align="left"><code class="filename">typeinfo</code></td></tr><tr><td align="left"><code class="filename">deque</code></td><td align="left"><code class="filename">iostream</code></td><td align="left"><code class="filename">memory</code></td><td align="left"><code class="filename">sstream</code></td><td align="left"><code class="filename">utility</code></td></tr><tr><td align="left"><code class="filename">exception</code></td><td align="left"><code class="filename">istream</code></td><td align="left"><code class="filename">new</code></td><td align="left"><code class="filename">stack</code></td><td align="left"><code class="filename">valarray</code></td></tr><tr><td align="left"><code class="filename">fstream</code></td><td align="left"><code class="filename">iterator</code></td><td align="left"><code class="filename">numeric</code></td><td align="left"><code class="filename">stdexcept</code></td><td align="left"><code class="filename">vector</code></td></tr><tr><td align="left"><code class="filename">functional</code></td><td align="left"><code class="filename">limits</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /><p></p><div class="table"><a id="id410652"></a><p class="title"><b>Table 3.2. C++ 1998 Library Headers for C Library Facilities</b></p><div class="table-contents"><table summary="C++ 1998 Library Headers for C Library Facilities" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col /></colgroup><tbody><tr><td align="left"><code class="filename">cassert</code></td><td align="left"><code class="filename">ciso646</code></td><td align="left"><code class="filename">csetjmp</code></td><td align="left"><code class="filename">cstdio</code></td><td align="left"><code class="filename">ctime</code></td></tr><tr><td align="left"><code class="filename">cctype</code></td><td align="left"><code class="filename">climits</code></td><td align="left"><code class="filename">csignal</code></td><td align="left"><code class="filename">cstdlib</code></td><td align="left"><code class="filename">cwchar</code></td></tr><tr><td align="left"><code class="filename">cerrno</code></td><td align="left"><code class="filename">clocale</code></td><td align="left"><code class="filename">cstdarg</code></td><td align="left"><code class="filename">cstring</code></td><td align="left"><code class="filename">cwctype</code></td></tr><tr><td align="left"><code class="filename">cfloat</code></td><td align="left"><code class="filename">cmath</code></td><td align="left"><code class="filename">cstddef</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /><p>C++0x include files. These are only available in C++0x compilation mode, i.e. <code class="code">-std=c++0x</code> or <code class="code">-std=gnu++0x</code>.
! </p><p></p><div class="table"><a id="id411001"></a><p class="title"><b>Table 3.3. C++ 200x Library Headers</b></p><div class="table-contents"><table summary="C++ 200x Library Headers" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col /></colgroup><tbody><tr><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="filename">iomanip</code></td><td align="left"><code class="filename">locale</code></td><td align="left"><code class="filename">regex</code></td><td align="left"><code class="filename">tuple</code></td></tr><tr><td align="left"><code class="filename">array</code></td><td align="left"><code class="filename">ios</code></td><td align="left"><code class="filename">map</code></td><td align="left"><code class="filename">set</code></td><td align="left"><code class="filename">typeinfo</code></td></tr><tr><td align="left"><code class="filename">bitset</code></td><td align="left"><code class="filename">iosfwd</code></td><td align="left"><code class="filename">memory</code></td><td align="left"><code class="filename">sstream</code></td><td align="left"><code class="filename">type_traits</code></td></tr><tr><td align="left"><code class="filename">complex</code></td><td align="left"><code class="filename">iostream</code></td><td align="left"><code class="filename">new</code></td><td align="left"><code class="filename">stack</code></td><td align="left"><code class="filename">unordered_map</code></td></tr><tr><td align="left"><code class="filename">deque</code></td><td align="left"><code class="filename">istream</code></td><td align="left"><code class="filename">numeric</code></td><td align="left"><code class="filename">stdexcept</code></td><td align="left"><code class="filename">unordered_set</code></td></tr><tr><td align="left"><code class="filename">exception</code></td><td align="left"><code class="filename">iterator</code></td><td align="left"><code class="filename">ostream</code></td><td align="left"><code class="filename">streambuf</code></td><td align="left"><code class="filename">utility</code></td></tr><tr><td align="left"><code class="filename">fstream</code></td><td align="left"><code class="filename">limits</code></td><td align="left"><code class="filename">queue</code></td><td align="left"><code class="filename">string</code></td><td align="left"><code class="filename">valarray</code></td></tr><tr><td align="left"><code class="filename">functional</code></td><td align="left"><code class="filename">list</code></td><td align="left"><code class="filename">random</code></td><td align="left"><code class="filename">system_error</code></td><td align="left"><code class="filename">vector</code></td></tr></tbody></table></div></div><br class="table-break" /><p></p><div class="table"><a id="id456739"></a><p class="title"><b>Table 3.4. C++ 200x Library Headers for C Library Facilities</b></p><div class="table-contents"><table summary="C++ 200x Library Headers for C Library Facilities" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col align="left" /></colgroup><tbody><tr><td align="left"><code class="filename">cassert</code></td><td align="left"><code class="filename">cfloat</code></td><td align="left"><code class="filename">cmath</code></td><td align="left"><code class="filename">cstddef</code></td><td align="left"><code class="filename">ctgmath</code></td></tr><tr><td align="left"><code class="filename">ccomplex</code></td><td align="left"><code class="filename">cinttypes</code></td><td align="left"><code class="filename">csetjmp</code></td><td align="left"><code class="filename">cstdint</code></td><td align="left"><code class="filename">ctime</code></td></tr><tr><td align="left"><code class="filename">cctype</code></td><td align="left"><code class="filename">ciso646</code></td><td align="left"><code class="filename">csignal</code></td><td align="left"><code class="filename">cstdio</code></td><td align="left"><code class="filename">cuchar</code></td></tr><tr><td align="left"><code class="filename">cerrno</code></td><td align="left"><code class="filename">climits</code></td><td align="left"><code class="filename">cstdarg</code></td><td align="left"><code class="filename">cstdlib</code></td><td align="left"><code class="filename">cwchar</code></td></tr><tr><td align="left"><code class="filename">cfenv</code></td><td align="left"><code class="filename">clocale</code></td><td align="left"><code class="filename">cstdbool</code></td><td align="left"><code class="filename">cstring</code></td><td align="left"><code class="filename">cwctype</code></td></tr></tbody></table></div></div><br class="table-break" /><p>
    In addition, TR1 includes as:
! </p><div class="table"><a id="id420313"></a><p class="title"><b>Table 3.5. C++ TR1 Library Headers</b></p><div class="table-contents"><table summary="C++ TR1 Library Headers" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col align="left" /></colgroup><tbody><tr><td align="left"><code class="filename">tr1/array</code></td><td align="left"><code class="filename">tr1/memory</code></td><td align="left"><code class="filename">tr1/regex</code></td><td align="left"><code class="filename">tr1/type_traits</code></td><td align="left"><code class="filename">tr1/unordered_set</code></td></tr><tr><td align="left"><code class="filename">tr1/complex</code></td><td align="left"><code class="filename">tr1/random</code></td><td align="left"><code class="filename">tr1/tuple</code></td><td align="left"><code class="filename">tr1/unordered_map</code></td><td align="left"><code class="filename">tr1/utility</code></td></tr><tr><td align="left"><code class="filename">tr1/functional</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /><p></p><div class="table"><a id="id362939"></a><p class="title"><b>Table 3.6. C++ TR1 Library Headers for C Library Facilities</b></p><div class="table-contents"><table summary="C++ TR1 Library Headers for C Library Facilities" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col align="left" /></colgroup><tbody><tr><td align="left"><code class="filename">tr1/cmath</code></td><td align="left"><code class="filename">tr1/cfloat</code></td><td align="left"><code class="filename">tr1/cstdarg</code></td><td align="left"><code class="filename">tr1/cstdio</code></td><td align="left"><code class="filename">tr1/ctime</code></td></tr><tr><td align="left"><code class="filename">tr1/ccomplex</code></td><td align="left"><code class="filename">tr1/cinttypes</code></td><td align="left"><code class="filename">tr1/cstdbool</code></td><td align="left"><code class="filename">tr1/cstdlib</code></td><td align="left"><code class="filename">tr1/cwchar</code></td></tr><tr><td align="left"><code class="filename">tr1/cfenv</code></td><td align="left"><code class="filename">tr1/climits</code></td><td align="left"><code class="filename">tr1/cstdint</code></td><td align="left"><code class="filename">tr1/ctgmath</code></td><td align="left"><code class="filename">tr1/cwctype</code></td></tr></tbody></table></div></div><br class="table-break" /><p>
    Also included are files for the C++ ABI interface:
! </p><div class="table"><a id="id429435"></a><p class="title"><b>Table 3.7. C++ ABI Headers</b></p><div class="table-contents"><table summary="C++ ABI Headers" border="1"><colgroup><col align="left" /><col align="left" /></colgroup><tbody><tr><td align="left"><code class="filename">cxxabi.h</code></td><td align="left"><code class="filename">cxxabi_forced.h</code></td></tr></tbody></table></div></div><br class="table-break" /><p>
    And a large variety of extensions.
! </p><div class="table"><a id="id490019"></a><p class="title"><b>Table 3.8. Extension Headers</b></p><div class="table-contents"><table summary="Extension Headers" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col align="left" /></colgroup><tbody><tr><td align="left"><code class="filename">ext/algorithm</code></td><td align="left"><code class="filename">ext/debug_allocator.h</code></td><td align="left"><code class="filename">ext/mt_allocator.h</code></td><td align="left"><code class="filename">ext/pod_char_traits.h</code></td><td align="left"><code class="filename">ext/stdio_sync_filebuf.h</code></td></tr><tr><td align="left"><code class="filename">ext/array_allocator.h</code></td><td align="left"><code class="filename">ext/enc_filebuf.h</code></td><td align="left"><code class="filename">ext/new_allocator.h</code></td><td align="left"><code class="filename">ext/pool_allocator.h</code></td><td align="left"><code class="filename">ext/throw_allocator.h</code></td></tr><tr><td align="left"><code class="filename">ext/atomicity.h</code></td><td align="left"><code class="filename">ext/functional</code></td><td align="left"><code class="filename">ext/numeric</code></td><td align="left"><code class="filename">ext/rb_tree</code></td><td align="left"><code class="filename">ext/typelist.h</code></td></tr><tr><td align="left"><code class="filename">ext/bitmap_allocator.h</code></td><td align="left"><code class="filename">ext/iterator</code></td><td align="left"><code class="filename">ext/numeric_traits.h</code></td><td align="left"><code class="filename">ext/rope</code></td><td align="left"><code class="filename">ext/type_traits.h</code></td></tr><tr><td align="left"><code class="filename">ext/codecvt_specializations.h</code></td><td align="left"><code class="filename">ext/malloc_allocator.h</code></td><td align="left"><code class="filename">ext/pb_ds/assoc_container.h</code></td><td align="left"><code class="filename">ext/slist</code></td><td align="left"><code class="filename">ext/vstring.h</code></td></tr><tr><td align="left"><code class="filename">ext/concurrence.h</code></td><td align="left"><code class="filename">ext/memory</code></td><td align="left"><code class="filename">ext/pb_ds/priority_queue.h</code></td><td align="left"><code class="filename">ext/stdio_filebuf.h</code></td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /><p></p><div class="table"><a id="id421980"></a><p class="title"><b>Table 3.9. Extension Debug Headers</b></p><div class="table-contents"><table summary="Extension Debug Headers" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col align="left" /></colgroup><tbody><tr><td align="left"><code class="filename">debug/bitset</code></td><td align="left"><code class="filename">debug/list</code></td><td align="left"><code class="filename">debug/set</code></td><td align="left"><code class="filename">debug/unordered_map</code></td><td align="left"><code class="filename">debug/vector</code></td></tr><tr><td align="left"><code class="filename">debug/deque</code></td><td align="left"><code class="filename">debug/map</code></td><td align="left"><code class="filename">debug/string</code></td><td align="left"><code class="filename">debug/unordered_set</code></td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /><p></p><div class="table"><a id="id362228"></a><p class="title"><b>Table 3.10. Extension Parallel Headers</b></p><div class="table-contents"><table summary="Extension Parallel Headers" border="1"><colgroup><col align="left" /><col align="left" /></colgroup><tbody><tr><td align="left"><code class="filename">parallel/algorithm</code></td><td align="left"><code class="filename">parallel/numeric</code></td></tr></tbody></table></div></div><br class="table-break" /></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="manual.intro.using.headers.mixing"></a>Mixing Headers</h3></div></div></div><p> A few simple rules.
  </p><p>First, mixing different dialects of the standard headers is not
  possible. It's an all-or-nothing affair. Thus, code like
  </p><pre class="programlisting">
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt01ch03s03.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt01ch03s03.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt01ch03s03.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt01ch03s03.html	Thu Apr 10 22:53:15 2008
***************
*** 2,8 ****
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
  <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Namespaces</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="using.html" title="Chapter 3. Using" /><link rel="prev" href="bk01pt01ch03s02.html" title="Headers" /><link rel="next" href="bk01pt01ch03s04.html" title="Macros" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Namespaces</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk01pt01ch03s02.html">Prev</a> </td><th width="60%" align="center">Chapter 3. Using</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt01ch03s04.html">Next</a></td></tr></table><hr /></div><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.using.namespaces"></a>Namespaces</h2></div></div></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="manual.intro.using.namespaces.all"></a>Available Namespaces</h3></div></div></div><p> There are three main namespaces.
  </p><div class="itemizedlist"><ul type="disc"><li><p>std</p><p>The ISO C++ standards specify that "all library entities are defined
! within namespace std." This includes namepaces nested
  within <code class="code">namespace std</code>, such as <code class="code">namespace
  std::tr1</code>.
  </p></li><li><p>abi</p><p>Specified by the C++ ABI. This ABI specifies a number of type and
--- 2,8 ----
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
  <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Namespaces</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="using.html" title="Chapter 3. Using" /><link rel="prev" href="bk01pt01ch03s02.html" title="Headers" /><link rel="next" href="bk01pt01ch03s04.html" title="Macros" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Namespaces</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk01pt01ch03s02.html">Prev</a> </td><th width="60%" align="center">Chapter 3. Using</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt01ch03s04.html">Next</a></td></tr></table><hr /></div><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.using.namespaces"></a>Namespaces</h2></div></div></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="manual.intro.using.namespaces.all"></a>Available Namespaces</h3></div></div></div><p> There are three main namespaces.
  </p><div class="itemizedlist"><ul type="disc"><li><p>std</p><p>The ISO C++ standards specify that "all library entities are defined
! within namespace std." This includes namespaces nested
  within <code class="code">namespace std</code>, such as <code class="code">namespace
  std::tr1</code>.
  </p></li><li><p>abi</p><p>Specified by the C++ ABI. This ABI specifies a number of type and
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt02pr01.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt02pr01.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt02pr01.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt02pr01.html	Thu Apr 10 22:53:15 2008
***************
*** 1,6 ****
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title></title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="support.html" title="Part II. Support" /><link rel="prev" href="support.html" title="Part II. Support" /><link rel="next" href="bk01pt02ch04.html" title="Chapter 4. Types" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center"></th></tr><tr><td width="20%" align="left"><a accesskey="p" href="support.html">Prev</a> </td><th width="60%" align="center">Part II. Support</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt02ch04.html">Next</a></td></tr></table><hr /></div><div class="preface" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="id394397"></a></h2></div></div></div><p>
      This part deals with the functions called and objects created
      automatically during the course of a program's existence.
    </p><p>
--- 1,6 ----
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title></title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="support.html" title="Part II. Support" /><link rel="prev" href="support.html" title="Part II. Support" /><link rel="next" href="bk01pt02ch04.html" title="Chapter 4. Types" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center"></th></tr><tr><td width="20%" align="left"><a accesskey="p" href="support.html">Prev</a> </td><th width="60%" align="center">Part II. Support</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt02ch04.html">Next</a></td></tr></table><hr /></div><div class="preface" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="id490700"></a></h2></div></div></div><p>
      This part deals with the functions called and objects created
      automatically during the course of a program's existence.
    </p><p>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt03ch07.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt03ch07.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt03ch07.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt03ch07.html	Thu Apr 10 22:53:15 2008
***************
*** 11,16 ****
        <code class="classname">string</code> member.
      </p><p>
        Derived from this are several classes that may have a
!       <code class="classname">string</code> member: a full heirarchy can be
        found in the <a class="ulink" href="http://gcc.gnu.org/onlinedocs/libstdc++/latest-doxygen/a00233.html" target="_top">source documentation</a>.
      </p></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="diagnostics.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="diagnostics.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="bk01pt03ch07s02.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Part III. Diagnostics </td><td width="20%" align="center"><a accesskey="h" href="../spine.html">Home</a></td><td width="40%" align="right" valign="top"> Adding Data to Exceptions</td></tr></table></div></body></html>
--- 11,16 ----
        <code class="classname">string</code> member.
      </p><p>
        Derived from this are several classes that may have a
!       <code class="classname">string</code> member: a full hierarchy can be
        found in the <a class="ulink" href="http://gcc.gnu.org/onlinedocs/libstdc++/latest-doxygen/a00233.html" target="_top">source documentation</a>.
      </p></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="diagnostics.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="diagnostics.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="bk01pt03ch07s02.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Part III. Diagnostics </td><td width="20%" align="center"><a accesskey="h" href="../spine.html">Home</a></td><td width="40%" align="right" valign="top"> Adding Data to Exceptions</td></tr></table></div></body></html>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt04ch11.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt04ch11.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt04ch11.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt04ch11.html	Thu Apr 10 22:53:15 2008
***************
*** 11,17 ****
   class template called <code class="classname">allocator</code>. The
   <code class="classname">allocator</code> abstraction is used throughout the
   library in <code class="classname">string</code>, container classes,
!  algorithnms, and parts of iostreams. This class, and base classes of
   it, are the superset of available free store (“<span class="quote">heap</span>”)
   management classes.
  </p><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="allocator.req"></a>Requirements</h3></div></div></div><p>
--- 11,17 ----
   class template called <code class="classname">allocator</code>. The
   <code class="classname">allocator</code> abstraction is used throughout the
   library in <code class="classname">string</code>, container classes,
!  algorithms, and parts of iostreams. This class, and base classes of
   it, are the superset of available free store (“<span class="quote">heap</span>”)
   management classes.
  </p><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="allocator.req"></a>Requirements</h3></div></div></div><p>
***************
*** 90,96 ****
      or loading and unloading shared objects in memory. As such, using
      caching allocators on systems that do not support
      <code class="function">abi::__cxa_atexit</code> is not recommended.
!   </p></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="allocator.impl"></a>Implementation</h3></div></div></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id419220"></a>Interface Design</h4></div></div></div><p>
       The only allocator interface that
       is support is the standard C++ interface. As such, all STL
       containers have been adjusted, and all external allocators have
--- 90,96 ----
      or loading and unloading shared objects in memory. As such, using
      caching allocators on systems that do not support
      <code class="function">abi::__cxa_atexit</code> is not recommended.
!   </p></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="allocator.impl"></a>Implementation</h3></div></div></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id425964"></a>Interface Design</h4></div></div></div><p>
       The only allocator interface that
       is support is the standard C++ interface. As such, all STL
       containers have been adjusted, and all external allocators have
***************
*** 103,109 ****
     </p><p> 
       The base class that <code class="classname">allocator</code> is derived from
       may not be user-configurable.
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id480984"></a>Selecting Default Allocation Policy</h4></div></div></div><p> 
       It's difficult to pick an allocation strategy that will provide
     maximum utility, without excessively penalizing some behavior. In
     fact, it's difficult just deciding which typical actions to measure
--- 103,109 ----
     </p><p> 
       The base class that <code class="classname">allocator</code> is derived from
       may not be user-configurable.
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id424963"></a>Selecting Default Allocation Policy</h4></div></div></div><p> 
       It's difficult to pick an allocation strategy that will provide
     maximum utility, without excessively penalizing some behavior. In
     fact, it's difficult just deciding which typical actions to measure
***************
*** 140,146 ****
       The current default choice for
       <code class="classname">allocator</code> is
       <code class="classname">__gnu_cxx::new_allocator</code>.
!    </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id411194"></a>Disabling Memory Caching</h4></div></div></div><p> 
        In use, <code class="classname">allocator</code> may allocate and
        deallocate using implementation-specified strategies and
        heuristics. Because of this, every call to an allocator object's
--- 140,146 ----
       The current default choice for
       <code class="classname">allocator</code> is
       <code class="classname">__gnu_cxx::new_allocator</code>.
!    </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id458581"></a>Disabling Memory Caching</h4></div></div></div><p> 
        In use, <code class="classname">allocator</code> may allocate and
        deallocate using implementation-specified strategies and
        heuristics. Because of this, every call to an allocator object's
***************
*** 161,167 ****
       directly, for every allocation. (See
       <code class="filename">include/ext/new_allocator.h</code>, for instance.)
       However, that option would involve changing source code to use
!      the a non-default allocator. Another option is to force the
       default allocator to remove caching and pools, and to directly
       allocate with every call of <code class="function">allocate</code> and
       directly deallocate with every call of
--- 161,167 ----
       directly, for every allocation. (See
       <code class="filename">include/ext/new_allocator.h</code>, for instance.)
       However, that option would involve changing source code to use
!      a non-default allocator. Another option is to force the
       default allocator to remove caching and pools, and to directly
       allocate with every call of <code class="function">allocate</code> and
       directly deallocate with every call of
***************
*** 245,251 ****
  	<code class="classname">throw_allocator</code>
  	</p><p> 
  	  Includes memory tracking and marking abilities as well as hooks for
! 	  throwing exceptinos at configurable intervals (including random,
  	  all, none). 
  	</p></li><li><p>
         <code class="classname">__pool_alloc</code>
--- 245,251 ----
  	<code class="classname">throw_allocator</code>
  	</p><p> 
  	  Includes memory tracking and marking abilities as well as hooks for
! 	  throwing exceptions at configurable intervals (including random,
  	  all, none). 
  	</p></li><li><p>
         <code class="classname">__pool_alloc</code>
***************
*** 282,294 ****
     </p><p>The <code class="varname">thr</code> boolean determines whether the
     pool should be manipulated atomically or not.  When
     <code class="varname">thr</code> = <code class="constant">true</code>, the allocator
!    is is threadsafe, while <code class="varname">thr</code> =
     <code class="constant">false</code>, and is slightly faster but unsafe for
     multiple threads.
     </p><p>
       For thread-enabled configurations, the pool is locked with a
       single big lock. In some situations, this implementation detail
!      may result in severe performance degredation.
     </p><p>
       (Note that the GCC thread abstraction layer allows us to provide
       safe zero-overhead stubs for the threading routines, if threads
--- 282,294 ----
     </p><p>The <code class="varname">thr</code> boolean determines whether the
     pool should be manipulated atomically or not.  When
     <code class="varname">thr</code> = <code class="constant">true</code>, the allocator
!    is is thread-safe, while <code class="varname">thr</code> =
     <code class="constant">false</code>, and is slightly faster but unsafe for
     multiple threads.
     </p><p>
       For thread-enabled configurations, the pool is locked with a
       single big lock. In some situations, this implementation detail
!      may result in severe performance degradation.
     </p><p>
       (Note that the GCC thread abstraction layer allows us to provide
       safe zero-overhead stubs for the threading routines, if threads
***************
*** 305,315 ****
  	 A high-performance allocator that uses a bit-map to keep track
  	 of the used and unused memory locations. It has its own
  	 documentation, found <a class="ulink" href="../ext/ballocator_doc.html" target="_top">here</a>.
!        </p></li></ol></div></div><div class="bibliography"><div class="titlepage"><div><div><h3 class="title"><a id="allocator.biblio"></a>Bibliography</h3></div></div></div><div class="biblioentry"><a id="id413478"></a><p><span class="title"><i>
      ISO/IEC 14882:1998 Programming languages - C++  
      </i>. </span>
        isoc++_1998
!     <span class="pagenums">20.4 Memory. </span></p></div><div class="biblioentry"><a id="id415484"></a><p><span class="title"><i>The Standard Librarian: What Are Allocators Good
      </i>. </span>
        austernm
      <span class="author"><span class="firstname">Matt</span> <span class="surname">Austern</span>. </span><span class="publisher"><span class="publishername">
--- 305,315 ----
  	 A high-performance allocator that uses a bit-map to keep track
  	 of the used and unused memory locations. It has its own
  	 documentation, found <a class="ulink" href="../ext/ballocator_doc.html" target="_top">here</a>.
!        </p></li></ol></div></div><div class="bibliography"><div class="titlepage"><div><div><h3 class="title"><a id="allocator.biblio"></a>Bibliography</h3></div></div></div><div class="biblioentry"><a id="id457599"></a><p><span class="title"><i>
      ISO/IEC 14882:1998 Programming languages - C++  
      </i>. </span>
        isoc++_1998
!     <span class="pagenums">20.4 Memory. </span></p></div><div class="biblioentry"><a id="id457613"></a><p><span class="title"><i>The Standard Librarian: What Are Allocators Good
      </i>. </span>
        austernm
      <span class="author"><span class="firstname">Matt</span> <span class="surname">Austern</span>. </span><span class="publisher"><span class="publishername">
***************
*** 317,344 ****
        . </span></span><span class="biblioid">
        <a class="ulink" href="http://www.cuj.com/documents/s=8000/cujcexp1812austern/" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id398891"></a><p><span class="title"><i>The Hoard Memory Allocator</i>. </span>
        emeryb
      <span class="author"><span class="firstname">Emery</span> <span class="surname">Berger</span>. </span><span class="biblioid">
        <a class="ulink" href="http://www.cs.umass.edu/~emery/hoard/" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id413375"></a><p><span class="title"><i>Reconsidering Custom Memory Allocation</i>. </span>
        bergerzorn
      <span class="author"><span class="firstname">Emery</span> <span class="surname">Berger</span>. </span><span class="author"><span class="firstname">Ben</span> <span class="surname">Zorn</span>. </span><span class="author"><span class="firstname">Kathryn</span> <span class="surname">McKinley</span>. </span><span class="copyright">Copyright © 2002 OOPSLA. </span><span class="biblioid">
        <a class="ulink" href="http://www.cs.umass.edu/~emery/pubs/berger-oopsla2002.pdf" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id425682"></a><p><span class="title"><i>Allocator Types</i>. </span>
        kreftlanger
      <span class="author"><span class="firstname">Klaus</span> <span class="surname">Kreft</span>. </span><span class="author"><span class="firstname">Angelika</span> <span class="surname">Langer</span>. </span><span class="publisher"><span class="publishername">
  	C/C++ Users Journal	
        . </span></span><span class="biblioid">
        <a class="ulink" href="http://www.langer.camelot.de/Articles/C++Report/Allocators/Allocators.html" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id420837"></a><p><span class="title"><i>The C++ Programming Language</i>. </span>
        tcpl
      <span class="author"><span class="firstname">Bjarne</span> <span class="surname">Stroustrup</span>. </span><span class="copyright">Copyright © 2000 . </span><span class="pagenums">19.4 Allocators. </span><span class="publisher"><span class="publishername">
  	Addison Wesley
!       . </span></span></p></div><div class="biblioentry"><a id="id423539"></a><p><span class="title"><i>Yalloc: A Recycling C++ Allocator</i>. </span>
        yenf
      <span class="author"><span class="firstname">Felix</span> <span class="surname">Yen</span>. </span><span class="copyright">Copyright ©  . </span><span class="biblioid">
        <a class="ulink" href="http://home.earthlink.net/~brimar/yalloc/" target="_top">
--- 317,344 ----
        . </span></span><span class="biblioid">
        <a class="ulink" href="http://www.cuj.com/documents/s=8000/cujcexp1812austern/" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id458630"></a><p><span class="title"><i>The Hoard Memory Allocator</i>. </span>
        emeryb
      <span class="author"><span class="firstname">Emery</span> <span class="surname">Berger</span>. </span><span class="biblioid">
        <a class="ulink" href="http://www.cs.umass.edu/~emery/hoard/" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id459380"></a><p><span class="title"><i>Reconsidering Custom Memory Allocation</i>. </span>
        bergerzorn
      <span class="author"><span class="firstname">Emery</span> <span class="surname">Berger</span>. </span><span class="author"><span class="firstname">Ben</span> <span class="surname">Zorn</span>. </span><span class="author"><span class="firstname">Kathryn</span> <span class="surname">McKinley</span>. </span><span class="copyright">Copyright © 2002 OOPSLA. </span><span class="biblioid">
        <a class="ulink" href="http://www.cs.umass.edu/~emery/pubs/berger-oopsla2002.pdf" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id470488"></a><p><span class="title"><i>Allocator Types</i>. </span>
        kreftlanger
      <span class="author"><span class="firstname">Klaus</span> <span class="surname">Kreft</span>. </span><span class="author"><span class="firstname">Angelika</span> <span class="surname">Langer</span>. </span><span class="publisher"><span class="publishername">
  	C/C++ Users Journal	
        . </span></span><span class="biblioid">
        <a class="ulink" href="http://www.langer.camelot.de/Articles/C++Report/Allocators/Allocators.html" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id454967"></a><p><span class="title"><i>The C++ Programming Language</i>. </span>
        tcpl
      <span class="author"><span class="firstname">Bjarne</span> <span class="surname">Stroustrup</span>. </span><span class="copyright">Copyright © 2000 . </span><span class="pagenums">19.4 Allocators. </span><span class="publisher"><span class="publishername">
  	Addison Wesley
!       . </span></span></p></div><div class="biblioentry"><a id="id453321"></a><p><span class="title"><i>Yalloc: A Recycling C++ Allocator</i>. </span>
        yenf
      <span class="author"><span class="firstname">Felix</span> <span class="surname">Yen</span>. </span><span class="copyright">Copyright ©  . </span><span class="biblioid">
        <a class="ulink" href="http://home.earthlink.net/~brimar/yalloc/" target="_top">
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt05ch13.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt05ch13.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt05ch13.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt05ch13.html	Thu Apr 10 22:53:15 2008
***************
*** 1,13 ****
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 13. String Classes</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="strings.html" title="Part V. Strings" /><link rel="prev" href="strings.html" title="Part V. Strings" /><link rel="next" href="bk01pt05ch13s02.html" title="Case Sensivitity" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 13. String Classes</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="strings.html">Prev</a> </td><th width="60%" align="center">Part V. Strings</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt05ch13s02.html">Next</a></td></tr></table><hr /></div><div class="chapter" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="manual.strings.string"></a>Chapter 13. String Classes</h2></div></div></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><span class="sect1"><a href="bk01pt05ch13.html#strings.string.simple">Simple Transformations</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s02.html">Case Sensivitity</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s03.html">Arbitrary Character Types</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s04.html">Tokenizing</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s05.html">Shrink to Fit</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s06.html">CString (MFC)</a></span></dt></dl></div><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="strings.string.simple"></a>Simple Transformations</h2></div></div></div><p>
        Here are Standard, simple, and portable ways to perform common
        transformations on a <code class="code">string</code> instance, such as
        "convert to all upper case." The word transformations
        is especially apt, because the standard template function
        <code class="code">transform&lt;&gt;</code> is used.
     </p><p>
!      This code will go through some iterations.  Here's a simiple
       version:
     </p><pre class="programlisting">
     #include &lt;string&gt;
--- 1,13 ----
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 13. String Classes</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="strings.html" title="Part V. Strings" /><link rel="prev" href="strings.html" title="Part V. Strings" /><link rel="next" href="bk01pt05ch13s02.html" title="Case Sensitivity" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 13. String Classes</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="strings.html">Prev</a> </td><th width="60%" align="center">Part V. Strings</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt05ch13s02.html">Next</a></td></tr></table><hr /></div><div class="chapter" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="manual.strings.string"></a>Chapter 13. String Classes</h2></div></div></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><span class="sect1"><a href="bk01pt05ch13.html#strings.string.simple">Simple Transformations</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s02.html">Case Sensitivity</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s03.html">Arbitrary Character Types</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s04.html">Tokenizing</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s05.html">Shrink to Fit</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s06.html">CString (MFC)</a></span></dt></dl></div><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="strings.string.simple"></a>Simple Transformations</h2></div></div></div><p>
        Here are Standard, simple, and portable ways to perform common
        transformations on a <code class="code">string</code> instance, such as
        "convert to all upper case." The word transformations
        is especially apt, because the standard template function
        <code class="code">transform&lt;&gt;</code> is used.
     </p><p>
!      This code will go through some iterations.  Here's a simple
       version:
     </p><pre class="programlisting">
     #include &lt;string&gt;
***************
*** 86,89 ****
     str.erase(notwhite+1); </pre><p>Obviously, the calls to <code class="code">find</code> could be inserted directly
        into the calls to <code class="code">erase</code>, in case your compiler does not
        optimize named temporaries out of existence.
!    </p></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="strings.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="strings.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="bk01pt05ch13s02.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Part V. Strings </td><td width="20%" align="center"><a accesskey="h" href="../spine.html">Home</a></td><td width="40%" align="right" valign="top"> Case Sensivitity</td></tr></table></div></body></html>
--- 86,89 ----
     str.erase(notwhite+1); </pre><p>Obviously, the calls to <code class="code">find</code> could be inserted directly
        into the calls to <code class="code">erase</code>, in case your compiler does not
        optimize named temporaries out of existence.
!    </p></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="strings.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="strings.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="bk01pt05ch13s02.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Part V. Strings </td><td width="20%" align="center"><a accesskey="h" href="../spine.html">Home</a></td><td width="40%" align="right" valign="top"> Case Sensitivity</td></tr></table></div></body></html>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt05ch13s02.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt05ch13s02.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt05ch13s02.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt05ch13s02.html	Thu Apr 10 22:53:15 2008
***************
*** 1,6 ****
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Case Sensivitity</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="bk01pt05ch13.html" title="Chapter 13. String Classes" /><link rel="prev" href="bk01pt05ch13.html" title="Chapter 13. String Classes" /><link rel="next" href="bk01pt05ch13s03.html" title="Arbitrary Character Types" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Case Sensivitity</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk01pt05ch13.html">Prev</a> </td><th width="60%" align="center">Chapter 13. String Classes</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt05ch13s03.html">Next</a></td></tr></table><hr /></div><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="strings.string.case"></a>Case Sensivitity</h2></div></div></div><p>
      </p><p>The well-known-and-if-it-isn't-well-known-it-ought-to-be
        <a class="ulink" href="http://www.gotw.ca/gotw/" target="_top">Guru of the Week</a>
        discussions held on Usenet covered this topic in January of 1998.
--- 1,6 ----
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Case Sensitivity</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="bk01pt05ch13.html" title="Chapter 13. String Classes" /><link rel="prev" href="bk01pt05ch13.html" title="Chapter 13. String Classes" /><link rel="next" href="bk01pt05ch13s03.html" title="Arbitrary Character Types" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Case Sensitivity</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk01pt05ch13.html">Prev</a> </td><th width="60%" align="center">Chapter 13. String Classes</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt05ch13s03.html">Next</a></td></tr></table><hr /></div><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="strings.string.case"></a>Case Sensitivity</h2></div></div></div><p>
      </p><p>The well-known-and-if-it-isn't-well-known-it-ought-to-be
        <a class="ulink" href="http://www.gotw.ca/gotw/" target="_top">Guru of the Week</a>
        discussions held on Usenet covered this topic in January of 1998.
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt05ch13s03.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt05ch13s03.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt05ch13s03.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt05ch13s03.html	Thu Apr 10 22:53:15 2008
***************
*** 1,6 ****
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Arbitrary Character Types</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="bk01pt05ch13.html" title="Chapter 13. String Classes" /><link rel="prev" href="bk01pt05ch13s02.html" title="Case Sensivitity" /><link rel="next" href="bk01pt05ch13s04.html" title="Tokenizing" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Arbitrary Character Types</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk01pt05ch13s02.html">Prev</a> </td><th width="60%" align="center">Chapter 13. String Classes</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt05ch13s04.html">Next</a></td></tr></table><hr /></div><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="strings.string.character_types"></a>Arbitrary Character Types</h2></div></div></div><p>
      </p><p>The <code class="code">std::basic_string</code> is tantalizingly general, in that
        it is parameterized on the type of the characters which it holds.
        In theory, you could whip up a Unicode character class and instantiate
--- 1,6 ----
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Arbitrary Character Types</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="bk01pt05ch13.html" title="Chapter 13. String Classes" /><link rel="prev" href="bk01pt05ch13s02.html" title="Case Sensitivity" /><link rel="next" href="bk01pt05ch13s04.html" title="Tokenizing" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Arbitrary Character Types</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk01pt05ch13s02.html">Prev</a> </td><th width="60%" align="center">Chapter 13. String Classes</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt05ch13s04.html">Next</a></td></tr></table><hr /></div><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="strings.string.character_types"></a>Arbitrary Character Types</h2></div></div></div><p>
      </p><p>The <code class="code">std::basic_string</code> is tantalizingly general, in that
        it is parameterized on the type of the characters which it holds.
        In theory, you could whip up a Unicode character class and instantiate
***************
*** 54,57 ****
        nice-looking first attempt</a> turned out to <a class="ulink" href="http://gcc.gnu.org/ml/libstdc++/2002-08/msg00242.html" target="_top">not
        be conforming C++</a>, due to the rule that CharT must be a POD.
        (See how tricky this is?)
!    </p></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="bk01pt05ch13s02.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="bk01pt05ch13.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="bk01pt05ch13s04.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Case Sensivitity </td><td width="20%" align="center"><a accesskey="h" href="../spine.html">Home</a></td><td width="40%" align="right" valign="top"> Tokenizing</td></tr></table></div></body></html>
--- 54,57 ----
        nice-looking first attempt</a> turned out to <a class="ulink" href="http://gcc.gnu.org/ml/libstdc++/2002-08/msg00242.html" target="_top">not
        be conforming C++</a>, due to the rule that CharT must be a POD.
        (See how tricky this is?)
!    </p></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="bk01pt05ch13s02.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="bk01pt05ch13.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="bk01pt05ch13s04.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Case Sensitivity </td><td width="20%" align="center"><a accesskey="h" href="../spine.html">Home</a></td><td width="40%" align="right" valign="top"> Tokenizing</td></tr></table></div></body></html>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt06ch14.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt06ch14.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt06ch14.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt06ch14.html	Thu Apr 10 22:53:15 2008
*************** thousands separator is in the German loc
*** 19,25 ****
  </p><p>
  Literally, a facet is strictly defined:
  </p><div class="itemizedlist"><ul type="disc"><li><p>
!       Dontaining the following public data member:
      </p><p>
        <code class="code">static locale::id id;</code>
      </p></li><li><p>
--- 19,25 ----
  </p><p>
  Literally, a facet is strictly defined:
  </p><div class="itemizedlist"><ul type="disc"><li><p>
!       Containing the following public data member:
      </p><p>
        <code class="code">static locale::id id;</code>
      </p></li><li><p>
*************** class id
*** 42,52 ****
  Provides an index for looking up specific facets.
  </p></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="locales.locale.design"></a>Design</h3></div></div></div><p>
  The major design challenge is fitting an object-orientated and
! non-global locale design ontop of POSIX and other relevant stanards,
  which include the Single Unix (nee X/Open.)
  </p><p>
  Because C and earlier versions of POSIX falls down so completely,
! portibility is an issue.
  </p></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="locales.locale.impl"></a>Implementation</h3></div></div></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="locale.impl.c"></a>Interacting with "C" locales</h4></div></div></div><div class="itemizedlist"><ul type="disc"><li><p> 
         <code class="code">`locale -a`</code> displays available locales. 
       </p><div class="blockquote"><blockquote class="blockquote"><pre class="programlisting">
--- 42,52 ----
  Provides an index for looking up specific facets.
  </p></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="locales.locale.design"></a>Design</h3></div></div></div><p>
  The major design challenge is fitting an object-orientated and
! non-global locale design on top of POSIX and other relevant standards,
  which include the Single Unix (nee X/Open.)
  </p><p>
  Because C and earlier versions of POSIX falls down so completely,
! portability is an issue.
  </p></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="locales.locale.impl"></a>Implementation</h3></div></div></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="locale.impl.c"></a>Interacting with "C" locales</h4></div></div></div><div class="itemizedlist"><ul type="disc"><li><p> 
         <code class="code">`locale -a`</code> displays available locales. 
       </p><div class="blockquote"><blockquote class="blockquote"><pre class="programlisting">
*************** relation (of the C++ locale mechanism) t
*** 372,378 ****
  global C locale is modified if a named C++ locale object is set as the
  global locale" (emphasis Paolo), that is:
  </p><pre class="programlisting">std::locale::global(std::locale(""));</pre><p>affects the C functions as if the following call was made:</p><pre class="programlisting">std::setlocale(LC_ALL, "");</pre><p>
!   On the other hand, there is *no* viceversa, that is, calling
    setlocale has *no* whatsoever on the C++ locale mechanism, in
    particular on the working of locale(""), which constructs the locale
    object from the environment of the running program, that is, in
--- 372,378 ----
  global C locale is modified if a named C++ locale object is set as the
  global locale" (emphasis Paolo), that is:
  </p><pre class="programlisting">std::locale::global(std::locale(""));</pre><p>affects the C functions as if the following call was made:</p><pre class="programlisting">std::setlocale(LC_ALL, "");</pre><p>
!   On the other hand, there is *no* vice versa, that is, calling
    setlocale has *no* whatsoever on the C++ locale mechanism, in
    particular on the working of locale(""), which constructs the locale
    object from the environment of the running program, that is, in
*************** global locale" (emphasis Paolo), that is
*** 383,389 ****
         has already taken place? 
       </p></li><li><p> 
         Document how named locales error check when filling data
!        members. Ie, a fr_FR locale that doesn't have
         numpunct::truename(): does it use "true"? Or is it a blank
         string? What's the convention? 
     </p></li><li><p> 
--- 383,389 ----
         has already taken place? 
       </p></li><li><p> 
         Document how named locales error check when filling data
!        members. I.e., a fr_FR locale that doesn't have
         numpunct::truename(): does it use "true"? Or is it a blank
         string? What's the convention? 
     </p></li><li><p> 
*************** global locale" (emphasis Paolo), that is
*** 393,419 ****
         language code and ISO country code (say, "de_DE"). 
       </p></li><li><p> 
         What should non-required facet instantiations do?  If the
!        generic implemenation is provided, then how to end-users
         provide specializations? 
!    </p></li></ul></div></div><div class="bibliography"><div class="titlepage"><div><div><h3 class="title"><a id="locales.locale.biblio"></a>Bibliography</h3></div></div></div><div class="biblioentry"><a id="id389722"></a><p><span class="title"><i>
        The GNU C Library
!     </i>. </span><span class="author"><span class="firstname">Roland</span> <span class="surname">McGrath</span>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2007 FSF. </span><span class="pagenums">Chapters 6 Character Set Handling and 7 Locales and Internationalization. </span></p></div><div class="biblioentry"><a id="id418042"></a><p><span class="title"><i>
        Correspondence
!     </i>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2002 . </span></p></div><div class="biblioentry"><a id="id495535"></a><p><span class="title"><i>
        ISO/IEC 14882:1998 Programming languages - C++
!     </i>. </span><span class="copyright">Copyright © 1998 ISO. </span></p></div><div class="biblioentry"><a id="id434429"></a><p><span class="title"><i>
        ISO/IEC 9899:1999 Programming languages - C
!     </i>. </span><span class="copyright">Copyright © 1999 ISO. </span></p></div><div class="biblioentry"><a id="id434447"></a><p><span class="title"><i>
        System Interface Definitions, Issue 6 (IEEE Std. 1003.1-200x)
      </i>. </span><span class="copyright">Copyright © 1999 
        The Open Group/The Institute of Electrical and Electronics Engineers, Inc.. </span><span class="biblioid">
        <a class="ulink" href="http://www.opennc.org/austin/docreg.html" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id415318"></a><p><span class="title"><i>
        The C++ Programming Language, Special Edition
      </i>. </span><span class="author"><span class="firstname">Bjarne</span> <span class="surname">Stroustrup</span>. </span><span class="copyright">Copyright © 2000 Addison Wesley, Inc.. </span><span class="pagenums">Appendix D. </span><span class="publisher"><span class="publishername">
  	Addison Wesley
!       . </span></span></p></div><div class="biblioentry"><a id="id424745"></a><p><span class="title"><i>
        Standard C++ IOStreams and Locales
      </i>. </span><span class="subtitle">
        Advanced Programmer's Guide and Reference
--- 393,419 ----
         language code and ISO country code (say, "de_DE"). 
       </p></li><li><p> 
         What should non-required facet instantiations do?  If the
!        generic implementation is provided, then how to end-users
         provide specializations? 
!    </p></li></ul></div></div><div class="bibliography"><div class="titlepage"><div><div><h3 class="title"><a id="locales.locale.biblio"></a>Bibliography</h3></div></div></div><div class="biblioentry"><a id="id412273"></a><p><span class="title"><i>
        The GNU C Library
!     </i>. </span><span class="author"><span class="firstname">Roland</span> <span class="surname">McGrath</span>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2007 FSF. </span><span class="pagenums">Chapters 6 Character Set Handling and 7 Locales and Internationalization. </span></p></div><div class="biblioentry"><a id="id398173"></a><p><span class="title"><i>
        Correspondence
!     </i>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2002 . </span></p></div><div class="biblioentry"><a id="id427688"></a><p><span class="title"><i>
        ISO/IEC 14882:1998 Programming languages - C++
!     </i>. </span><span class="copyright">Copyright © 1998 ISO. </span></p></div><div class="biblioentry"><a id="id427707"></a><p><span class="title"><i>
        ISO/IEC 9899:1999 Programming languages - C
!     </i>. </span><span class="copyright">Copyright © 1999 ISO. </span></p></div><div class="biblioentry"><a id="id406617"></a><p><span class="title"><i>
        System Interface Definitions, Issue 6 (IEEE Std. 1003.1-200x)
      </i>. </span><span class="copyright">Copyright © 1999 
        The Open Group/The Institute of Electrical and Electronics Engineers, Inc.. </span><span class="biblioid">
        <a class="ulink" href="http://www.opennc.org/austin/docreg.html" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id471678"></a><p><span class="title"><i>
        The C++ Programming Language, Special Edition
      </i>. </span><span class="author"><span class="firstname">Bjarne</span> <span class="surname">Stroustrup</span>. </span><span class="copyright">Copyright © 2000 Addison Wesley, Inc.. </span><span class="pagenums">Appendix D. </span><span class="publisher"><span class="publishername">
  	Addison Wesley
!       . </span></span></p></div><div class="biblioentry"><a id="id414572"></a><p><span class="title"><i>
        Standard C++ IOStreams and Locales
      </i>. </span><span class="subtitle">
        Advanced Programmer's Guide and Reference
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt06ch15.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt06ch15.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt06ch15.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt06ch15.html	Thu Apr 10 22:53:15 2008
***************
*** 1,6 ****
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 15. Facets aka Categories</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="localization.html" title="Part VI. Localization" /><link rel="prev" href="bk01pt06ch14.html" title="Chapter 14. Locales" /><link rel="next" href="codecvt.html" title="codecvt" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 15. Facets aka Categories</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk01pt06ch14.html">Prev</a> </td><th width="60%" align="center">Part VI. Localization</th><td width="20%" align="right"> <a accesskey="n" href="codecvt.html">Next</a></td></tr></table><hr /></div><div class="chapter" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="manual.localization.facet"></a>Chapter 15. Facets aka Categories</h2></div></div></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><span class="sect1"><a href="bk01pt06ch15.html#manual.localization.facet.ctype">ctype</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt06ch15.html#facet.ctype.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="bk01pt06ch15.html#facet.ctype.future">Future</a></span></dt></dl></dd><dt><span class="sect1"><a href="codecvt.html">codecvt</a></span></dt><dd><dl><dt><span class="sect2"><a href="codecvt.html#facet.codecvt.req">Requirements</a></span></dt><dt><span class="sect2"><a href="codecvt.html#facet.codecvt.design">Design</a></span></dt><dt><span class="sect2"><a href="codecvt.html#facet.codecvt.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="codecvt.html#facet.codecvt.use">Use</a></span></dt><dt><span class="sect2"><a href="codecvt.html#facet.codecvt.future">Future</a></span></dt></dl></dd><dt><span class="sect1"><a href="messages.html">messages</a></span></dt><dd><dl><dt><span class="sect2"><a href="messages.html#facet.messages.req">Requirements</a></span></dt><dt><span class="sect2"><a href="messages.html#facet.messages.design">Design</a></span></dt><dt><span class="sect2"><a href="messages.html#facet.messages.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="messages.html#facet.messages.use">Use</a></span></dt><dt><span class="sect2"><a href="messages.html#facet.messages.future">Future</a></span></dt></dl></dd></dl></div><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.localization.facet.ctype"></a>ctype</h2></div></div></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="facet.ctype.impl"></a>Implementation</h3></div></div></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id424267"></a>Specializations</h4></div></div></div><p>
  For the required specialization codecvt&lt;wchar_t, char, mbstate_t&gt; ,
  conversions are made between the internal character set (always UCS4
  on GNU/Linux) and whatever the currently selected locale for the
--- 1,6 ----
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 15. Facets aka Categories</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="localization.html" title="Part VI. Localization" /><link rel="prev" href="bk01pt06ch14.html" title="Chapter 14. Locales" /><link rel="next" href="codecvt.html" title="codecvt" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 15. Facets aka Categories</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk01pt06ch14.html">Prev</a> </td><th width="60%" align="center">Part VI. Localization</th><td width="20%" align="right"> <a accesskey="n" href="codecvt.html">Next</a></td></tr></table><hr /></div><div class="chapter" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="manual.localization.facet"></a>Chapter 15. Facets aka Categories</h2></div></div></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><span class="sect1"><a href="bk01pt06ch15.html#manual.localization.facet.ctype">ctype</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt06ch15.html#facet.ctype.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="bk01pt06ch15.html#facet.ctype.future">Future</a></span></dt></dl></dd><dt><span class="sect1"><a href="codecvt.html">codecvt</a></span></dt><dd><dl><dt><span class="sect2"><a href="codecvt.html#facet.codecvt.req">Requirements</a></span></dt><dt><span class="sect2"><a href="codecvt.html#facet.codecvt.design">Design</a></span></dt><dt><span class="sect2"><a href="codecvt.html#facet.codecvt.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="codecvt.html#facet.codecvt.use">Use</a></span></dt><dt><span class="sect2"><a href="codecvt.html#facet.codecvt.future">Future</a></span></dt></dl></dd><dt><span class="sect1"><a href="messages.html">messages</a></span></dt><dd><dl><dt><span class="sect2"><a href="messages.html#facet.messages.req">Requirements</a></span></dt><dt><span class="sect2"><a href="messages.html#facet.messages.design">Design</a></span></dt><dt><span class="sect2"><a href="messages.html#facet.messages.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="messages.html#facet.messages.use">Use</a></span></dt><dt><span class="sect2"><a href="messages.html#facet.messages.future">Future</a></span></dt></dl></dd></dl></div><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.localization.facet.ctype"></a>ctype</h2></div></div></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="facet.ctype.impl"></a>Implementation</h3></div></div></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id423514"></a>Specializations</h4></div></div></div><p>
  For the required specialization codecvt&lt;wchar_t, char, mbstate_t&gt; ,
  conversions are made between the internal character set (always UCS4
  on GNU/Linux) and whatever the currently selected locale for the
*************** characters.
*** 41,71 ****
         this class?  
     </p></li><li><p> 
         Get the ctype&lt;wchar_t&gt;::mask stuff under control. Need to
!        make some kind of static table, and not do lookup evertime
         somebody hits the do_is... functions. Too bad we can't just
         redefine mask for ctype&lt;wchar_t&gt; 
     </p></li><li><p> 
         Rename abstract base class. See if just smash-overriding is a
         better approach. Clarify, add sanity to naming.
!      </p></li></ul></div></div><div class="bibliography"><div class="titlepage"><div><div><h3 class="title"><a id="facet.ctype.biblio"></a>Bibliography</h3></div></div></div><div class="biblioentry"><a id="id428438"></a><p><span class="title"><i>
        The GNU C Library
!     </i>. </span><span class="author"><span class="firstname">Roland</span> <span class="surname">McGrath</span>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2007 FSF. </span><span class="pagenums">Chapters 6  Character Set Handling and 7 Locales and Internationalization. </span></p></div><div class="biblioentry"><a id="id406217"></a><p><span class="title"><i>
        Correspondence
!     </i>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2002 . </span></p></div><div class="biblioentry"><a id="id406246"></a><p><span class="title"><i>
        ISO/IEC 14882:1998 Programming languages - C++
!     </i>. </span><span class="copyright">Copyright © 1998 ISO. </span></p></div><div class="biblioentry"><a id="id424106"></a><p><span class="title"><i>
        ISO/IEC 9899:1999 Programming languages - C
!     </i>. </span><span class="copyright">Copyright © 1999 ISO. </span></p></div><div class="biblioentry"><a id="id424124"></a><p><span class="title"><i>
        System Interface Definitions, Issue 6 (IEEE Std. 1003.1-200x)
      </i>. </span><span class="copyright">Copyright © 1999 
        The Open Group/The Institute of Electrical and Electronics Engineers, Inc.. </span><span class="biblioid">
        <a class="ulink" href="http://www.opennc.org/austin/docreg.html" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id483804"></a><p><span class="title"><i>
        The C++ Programming Language, Special Edition
      </i>. </span><span class="author"><span class="firstname">Bjarne</span> <span class="surname">Stroustrup</span>. </span><span class="copyright">Copyright © 2000 Addison Wesley, Inc.. </span><span class="pagenums">Appendix D. </span><span class="publisher"><span class="publishername">
  	Addison Wesley
!       . </span></span></p></div><div class="biblioentry"><a id="id428016"></a><p><span class="title"><i>
        Standard C++ IOStreams and Locales
      </i>. </span><span class="subtitle">
        Advanced Programmer's Guide and Reference
--- 41,71 ----
         this class?  
     </p></li><li><p> 
         Get the ctype&lt;wchar_t&gt;::mask stuff under control. Need to
!        make some kind of static table, and not do lookup every time
         somebody hits the do_is... functions. Too bad we can't just
         redefine mask for ctype&lt;wchar_t&gt; 
     </p></li><li><p> 
         Rename abstract base class. See if just smash-overriding is a
         better approach. Clarify, add sanity to naming.
!      </p></li></ul></div></div><div class="bibliography"><div class="titlepage"><div><div><h3 class="title"><a id="facet.ctype.biblio"></a>Bibliography</h3></div></div></div><div class="biblioentry"><a id="id397038"></a><p><span class="title"><i>
        The GNU C Library
!     </i>. </span><span class="author"><span class="firstname">Roland</span> <span class="surname">McGrath</span>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2007 FSF. </span><span class="pagenums">Chapters 6  Character Set Handling and 7 Locales and Internationalization. </span></p></div><div class="biblioentry"><a id="id399816"></a><p><span class="title"><i>
        Correspondence
!     </i>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2002 . </span></p></div><div class="biblioentry"><a id="id419755"></a><p><span class="title"><i>
        ISO/IEC 14882:1998 Programming languages - C++
!     </i>. </span><span class="copyright">Copyright © 1998 ISO. </span></p></div><div class="biblioentry"><a id="id419773"></a><p><span class="title"><i>
        ISO/IEC 9899:1999 Programming languages - C
!     </i>. </span><span class="copyright">Copyright © 1999 ISO. </span></p></div><div class="biblioentry"><a id="id397810"></a><p><span class="title"><i>
        System Interface Definitions, Issue 6 (IEEE Std. 1003.1-200x)
      </i>. </span><span class="copyright">Copyright © 1999 
        The Open Group/The Institute of Electrical and Electronics Engineers, Inc.. </span><span class="biblioid">
        <a class="ulink" href="http://www.opennc.org/austin/docreg.html" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id397838"></a><p><span class="title"><i>
        The C++ Programming Language, Special Edition
      </i>. </span><span class="author"><span class="firstname">Bjarne</span> <span class="surname">Stroustrup</span>. </span><span class="copyright">Copyright © 2000 Addison Wesley, Inc.. </span><span class="pagenums">Appendix D. </span><span class="publisher"><span class="publishername">
  	Addison Wesley
!       . </span></span></p></div><div class="biblioentry"><a id="id362481"></a><p><span class="title"><i>
        Standard C++ IOStreams and Locales
      </i>. </span><span class="subtitle">
        Advanced Programmer's Guide and Reference
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt09pr02.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt09pr02.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt09pr02.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt09pr02.html	Thu Apr 10 22:53:15 2008
***************
*** 1,6 ****
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title></title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    , &#10;      algorithm&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="algorithms.html" title="Part IX. Algorithms" /><link rel="prev" href="algorithms.html" title="Part IX. Algorithms" /><link rel="next" href="bk01pt09ch20.html" title="Chapter 20. Mutating" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center"></th></tr><tr><td width="20%" align="left"><a accesskey="p" href="algorithms.html">Prev</a> </td><th width="60%" align="center">Part IX. Algorithms</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt09ch20.html">Next</a></td></tr></table><hr /></div><div class="preface" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="id405802"></a></h2></div></div></div><p>
    The neatest accomplishment of the algorithms chapter is that all the
    work is done via iterators, not containers directly.  This means two
    important things:
--- 1,6 ----
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title></title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    , &#10;      algorithm&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="algorithms.html" title="Part IX. Algorithms" /><link rel="prev" href="algorithms.html" title="Part IX. Algorithms" /><link rel="next" href="bk01pt09ch20.html" title="Chapter 20. Mutating" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center"></th></tr><tr><td width="20%" align="left"><a accesskey="p" href="algorithms.html">Prev</a> </td><th width="60%" align="center">Part IX. Algorithms</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt09ch20.html">Next</a></td></tr></table><hr /></div><div class="preface" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="id411081"></a></h2></div></div></div><p>
    The neatest accomplishment of the algorithms chapter is that all the
    work is done via iterators, not containers directly.  This means two
    important things:
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt12ch30s03.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt12ch30s03.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt12ch30s03.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt12ch30s03.html	Thu Apr 10 22:53:15 2008
***************
*** 19,24 ****
    mode or with debug mode. The
    following table provides the names and headers of the debugging
    containers:
! </p><div class="table"><a id="id400605"></a><p class="title"><b>Table 30.1. Debugging Containers</b></p><div class="table-contents"><table summary="Debugging Containers" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col /><col /></colgroup><thead><tr><th align="left">Container</th><th align="left">Header</th><th align="left">Debug container</th><th align="left">Debug header</th><td class="auto-generated"> </td><td class="auto-generated"> </td></tr></thead><tbody><tr><td align="left"><code class="classname">std::bitset</code></td><td align="left"><code class="filename">bitset</code></td><td align="left"><code class="classname">__gnu_debug::bitset</code></td><td align="left"><code class="filename">bitset</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::deque</code></td><td align="left"><code class="filename">deque</code></td><td align="left"><code class="classname">__gnu_debug::deque</code></td><td align="left"><code class="filename">deque</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::list</code></td><td align="left"><code class="filename">list</code></td><td align="left"><code class="classname">__gnu_debug::list</code></td><td align="left"><code class="filename">list</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::map</code></td><td align="left"><code class="filename">map</code></td><td align="left"><code class="classname">__gnu_debug::map</code></td><td align="left"><code class="filename">map</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::multimap</code></td><td align="left"><code class="filename">map</code></td><td align="left"><code class="classname">__gnu_debug::multimap</code></td><td align="left"><code class="filename">map</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::multiset</code></td><td align="left"><code class="filename">set</code></td><td align="left"><code class="classname">__gnu_debug::multiset</code></td><td align="left"><code class="filename">set</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::set</code></td><td align="left"><code class="filename">set</code></td><td align="left"><code class="classname">__gnu_debug::set</code></td><td align="left"><code class="filename">set</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::string</code></td><td align="left"><code class="filename">string</code></td><td align="left"><code class="classname">__gnu_debug::string</code></td><td align="left"><code class="filename">string</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::wstring</code></td><td align="left"><code class="filename">string</code></td><td align="left"><code class="classname">__gnu_debug::wstring</code></td><td align="left"><code class="filename">string</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::basic_string</code></td><td align="left"><code class="filename">string</code></td><td align="left"><code class="classname">__gnu_debug::basic_string</code></td><td align="left"><code class="filename">string</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::vector</code></td><td align="left"><code class="filename">vector</code></td><td align="left"><code class="classname">__gnu_debug::vector</code></td><td align="left"><code class="filename">vector</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /><p>In addition, when compiling in C++0x mode, these additional
  containers have additional debug capability.
! </p><div class="table"><a id="id452759"></a><p class="title"><b>Table 30.2. Debugging Containers C++0x</b></p><div class="table-contents"><table summary="Debugging Containers C++0x" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col /><col /></colgroup><thead><tr><th align="left">Container</th><th align="left">Header</th><th align="left">Debug container</th><th align="left">Debug header</th><td class="auto-generated"> </td><td class="auto-generated"> </td></tr></thead><tbody><tr><td align="left"><code class="classname">std::unordered_map</code></td><td align="left"><code class="filename">unordered_map</code></td><td align="left"><code class="classname">__gnu_debug::unordered_map</code></td><td align="left"><code class="filename">unordered_map</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::unordered_multimap</code></td><td align="left"><code class="filename">unordered_map</code></td><td align="left"><code class="classname">__gnu_debug::unordered_multimap</code></td><td align="left"><code class="filename">unordered_map</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::unordered_set</code></td><td align="left"><code class="filename">unordered_set</code></td><td align="left"><code class="classname">__gnu_debug::unordered_set</code></td><td align="left"><code class="filename">unordered_set</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::unordered_multiset</code></td><td align="left"><code class="filename">unordered_set</code></td><td align="left"><code class="classname">__gnu_debug::unordered_multiset</code></td><td align="left"><code class="filename">unordered_set</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="bk01pt12ch30s02.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="debug_mode.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="bk01pt12ch30s04.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Semantics </td><td width="20%" align="center"><a accesskey="h" href="../spine.html">Home</a></td><td width="40%" align="right" valign="top"> Design</td></tr></table></div></body></html>
--- 19,24 ----
    mode or with debug mode. The
    following table provides the names and headers of the debugging
    containers:
! </p><div class="table"><a id="id391620"></a><p class="title"><b>Table 30.1. Debugging Containers</b></p><div class="table-contents"><table summary="Debugging Containers" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col /><col /></colgroup><thead><tr><th align="left">Container</th><th align="left">Header</th><th align="left">Debug container</th><th align="left">Debug header</th><td class="auto-generated"> </td><td class="auto-generated"> </td></tr></thead><tbody><tr><td align="left"><code class="classname">std::bitset</code></td><td align="left"><code class="filename">bitset</code></td><td align="left"><code class="classname">__gnu_debug::bitset</code></td><td align="left"><code class="filename">bitset</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::deque</code></td><td align="left"><code class="filename">deque</code></td><td align="left"><code class="classname">__gnu_debug::deque</code></td><td align="left"><code class="filename">deque</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::list</code></td><td align="left"><code class="filename">list</code></td><td align="left"><code class="classname">__gnu_debug::list</code></td><td align="left"><code class="filename">list</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::map</code></td><td align="left"><code class="filename">map</code></td><td align="left"><code class="classname">__gnu_debug::map</code></td><td align="left"><code class="filename">map</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::multimap</code></td><td align="left"><code class="filename">map</code></td><td align="left"><code class="classname">__gnu_debug::multimap</code></td><td align="left"><code class="filename">map</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::multiset</code></td><td align="left"><code class="filename">set</code></td><td align="left"><code class="classname">__gnu_debug::multiset</code></td><td align="left"><code class="filename">set</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::set</code></td><td align="left"><code class="filename">set</code></td><td align="left"><code class="classname">__gnu_debug::set</code></td><td align="left"><code class="filename">set</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::string</code></td><td align="left"><code class="filename">string</code></td><td align="left"><code class="classname">__gnu_debug::string</code></td><td align="left"><code class="filename">string</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::wstring</code></td><td align="left"><code class="filename">string</code></td><td align="left"><code class="classname">__gnu_debug::wstring</code></td><td align="left"><code class="filename">string</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::basic_string</code></td><td align="left"><code class="filename">string</code></td><td align="left"><code class="classname">__gnu_debug::basic_string</code></td><td align="left"><code class="filename">string</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::vector</code></td><td align="left"><code class="filename">vector</code></td><td align="left"><code class="classname">__gnu_debug::vector</code></td><td align="left"><code class="filename">vector</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /><p>In addition, when compiling in C++0x mode, these additional
  containers have additional debug capability.
! </p><div class="table"><a id="id417569"></a><p class="title"><b>Table 30.2. Debugging Containers C++0x</b></p><div class="table-contents"><table summary="Debugging Containers C++0x" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /><col /><col /></colgroup><thead><tr><th align="left">Container</th><th align="left">Header</th><th align="left">Debug container</th><th align="left">Debug header</th><td class="auto-generated"> </td><td class="auto-generated"> </td></tr></thead><tbody><tr><td align="left"><code class="classname">std::unordered_map</code></td><td align="left"><code class="filename">unordered_map</code></td><td align="left"><code class="classname">__gnu_debug::unordered_map</code></td><td align="left"><code class="filename">unordered_map</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::unordered_multimap</code></td><td align="left"><code class="filename">unordered_map</code></td><td align="left"><code class="classname">__gnu_debug::unordered_multimap</code></td><td align="left"><code class="filename">unordered_map</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::unordered_set</code></td><td align="left"><code class="filename">unordered_set</code></td><td align="left"><code class="classname">__gnu_debug::unordered_set</code></td><td align="left"><code class="filename">unordered_set</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr><tr><td align="left"><code class="classname">std::unordered_multiset</code></td><td align="left"><code class="filename">unordered_set</code></td><td align="left"><code class="classname">__gnu_debug::unordered_multiset</code></td><td align="left"><code class="filename">unordered_set</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="bk01pt12ch30s02.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="debug_mode.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="bk01pt12ch30s04.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Semantics </td><td width="20%" align="center"><a accesskey="h" href="../spine.html">Home</a></td><td width="40%" align="right" valign="top"> Design</td></tr></table></div></body></html>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt12ch30s04.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt12ch30s04.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt12ch30s04.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt12ch30s04.html	Thu Apr 10 22:53:15 2008
*************** template&lt;typename _Tp, typename _Allo
*** 187,193 ****
    allows release-compiled and debug-compiled code to be linked and
    executed together without causing unpredictable behavior. This
    guarantee minimizes the recompilation that users are required to
!   perform, shortening the detect-compile-debug bughunting cycle
    and making the debug mode easier to incorporate into development
    environments by minimizing dependencies.</p><p>Achieving link- and run-time coexistence is not a trivial
    implementation task. To achieve this goal we required a small
--- 187,193 ----
    allows release-compiled and debug-compiled code to be linked and
    executed together without causing unpredictable behavior. This
    guarantee minimizes the recompilation that users are required to
!   perform, shortening the detect-compile-debug bug hunting cycle
    and making the debug mode easier to incorporate into development
    environments by minimizing dependencies.</p><p>Achieving link- and run-time coexistence is not a trivial
    implementation task. To achieve this goal we required a small
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt12ch31s02.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt12ch31s02.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt12ch31s02.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt12ch31s02.html	Thu Apr 10 22:53:15 2008
***************
*** 1,7 ****
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
  <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Semantics</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      C++&#10;    , &#10;      library&#10;    , &#10;      parallel&#10;    " /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="parallel_mode.html" title="Chapter 31. Parallel Mode" /><link rel="prev" href="parallel_mode.html" title="Chapter 31. Parallel Mode" /><link rel="next" href="bk01pt12ch31s03.html" title="Using" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Semantics</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="parallel_mode.html">Prev</a> </td><th width="60%" align="center">Chapter 31. Parallel Mode</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt12ch31s03.html">Next</a></td></tr></table><hr /></div><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.parallel_mode.semantics"></a>Semantics</h2></div></div></div><p> The parallel mode STL algorithms are currently not exception-safe,
! i. e. user-defined functors must not throw exceptions.
  </p><p> Since the current GCC OpenMP implementation does not support
  OpenMP parallel regions in concurrent threads,
  it is not possible to call parallel STL algorithm in
--- 1,7 ----
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
  <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Semantics</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      C++&#10;    , &#10;      library&#10;    , &#10;      parallel&#10;    " /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="parallel_mode.html" title="Chapter 31. Parallel Mode" /><link rel="prev" href="parallel_mode.html" title="Chapter 31. Parallel Mode" /><link rel="next" href="bk01pt12ch31s03.html" title="Using" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Semantics</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="parallel_mode.html">Prev</a> </td><th width="60%" align="center">Chapter 31. Parallel Mode</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt12ch31s03.html">Next</a></td></tr></table><hr /></div><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.parallel_mode.semantics"></a>Semantics</h2></div></div></div><p> The parallel mode STL algorithms are currently not exception-safe,
! i.e. user-defined functors must not throw exceptions.
  </p><p> Since the current GCC OpenMP implementation does not support
  OpenMP parallel regions in concurrent threads,
  it is not possible to call parallel STL algorithm in
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt12ch31s03.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt12ch31s03.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt12ch31s03.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt12ch31s03.html	Thu Apr 10 22:53:15 2008
***************
*** 1,20 ****
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Using</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      C++&#10;    , &#10;      library&#10;    , &#10;      parallel&#10;    " /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="parallel_mode.html" title="Chapter 31. Parallel Mode" /><link rel="prev" href="bk01pt12ch31s02.html" title="Semantics" /><link rel="next" href="bk01pt12ch31s04.html" title="Design" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Using</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk01pt12ch31s02.html">Prev</a> </td><th width="60%" align="center">Chapter 31. Parallel Mode</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt12ch31s04.html">Next</a></td></tr></table><hr /></div><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.parallel_mode.using"></a>Using</h2></div></div></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="parallel_mode.using.parallel_mode"></a>Using Parallel Mode</h3></div></div></div><p>To use the libstdc++ parallel mode, compile your application with
!   the compiler flag <code class="code">-D_GLIBCXX_PARALLEL -fopenmp</code>. This
!   will link in <code class="code">libgomp</code>, the GNU OpenMP <a class="ulink" href="http://gcc.gnu.org/onlinedocs/libgomp" target="_top">implementation</a>,
    whose presence is mandatory. In addition, hardware capable of atomic
    operations is mandatory. Actually activating these atomic
    operations may require explicit compiler flags on some targets
!   (like sparc and x86), such as <code class="code">-march=i686</code>,
!   <code class="code">-march=native</code> or <code class="code">-mcpu=v9</code>.
! </p><p>Note that the <code class="code">_GLIBCXX_PARALLEL</code> define may change the
    sizes and behavior of standard class templates such as
!   <code class="code">std::search</code>, and therefore one can only link code
    compiled with parallel mode and code compiled without parallel mode
    if no instantiation of a container is passed between the two
    translation units. Parallel mode functionality has distinct linkage,
!   and cannot be confused with normal mode symbols.</p></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="manual.ext.parallel_mode.usings"></a>Using Specific Parallel Components</h3></div></div></div><p>When it is not feasible to recompile your entire application, or
    only specific algorithms need to be parallel-aware, individual
    parallel algorithms can be made available explicitly. These
    parallel algorithms are functionally equivalent to the standard
--- 1,22 ----
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Using</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      C++&#10;    , &#10;      library&#10;    , &#10;      parallel&#10;    " /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="parallel_mode.html" title="Chapter 31. Parallel Mode" /><link rel="prev" href="bk01pt12ch31s02.html" title="Semantics" /><link rel="next" href="bk01pt12ch31s04.html" title="Design" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Using</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk01pt12ch31s02.html">Prev</a> </td><th width="60%" align="center">Chapter 31. Parallel Mode</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt12ch31s04.html">Next</a></td></tr></table><hr /></div><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.parallel_mode.using"></a>Using</h2></div></div></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="parallel_mode.using.parallel_mode"></a>Using Parallel Mode</h3></div></div></div><p>
!   To use the libstdc++ parallel mode, compile your application with
!   the compiler flag <code class="constant">-D_GLIBCXX_PARALLEL -fopenmp</code>. This
!   will link in <code class="code">libgomp</code>, the GNU OpenMP <a class="ulink" href="http://gcc.gnu.org/onlinedocs/libgomp/" target="_top">implementation</a>,
    whose presence is mandatory. In addition, hardware capable of atomic
    operations is mandatory. Actually activating these atomic
    operations may require explicit compiler flags on some targets
!   (like sparc and x86), such as <code class="literal">-march=i686</code>,
!   <code class="literal">-march=native</code> or <code class="literal">-mcpu=v9</code>.
! </p><p>Note that the <code class="constant">_GLIBCXX_PARALLEL</code> define may change the
    sizes and behavior of standard class templates such as
!   <code class="function">std::search</code>, and therefore one can only link code
    compiled with parallel mode and code compiled without parallel mode
    if no instantiation of a container is passed between the two
    translation units. Parallel mode functionality has distinct linkage,
!   and cannot be confused with normal mode symbols.
! </p></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="manual.ext.parallel_mode.usings"></a>Using Specific Parallel Components</h3></div></div></div><p>When it is not feasible to recompile your entire application, or
    only specific algorithms need to be parallel-aware, individual
    parallel algorithms can be made available explicitly. These
    parallel algorithms are functionally equivalent to the standard
***************
*** 23,26 ****
    compiled with either release mode or with parallel mode. The
    following table provides the names and headers of the parallel
    algorithms:
! </p><div class="table"><a id="id419374"></a><p class="title"><b>Table 31.1. Parallel Algorithms</b></p><div class="table-contents"><table summary="Parallel Algorithms" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /></colgroup><thead><tr><th align="left">Algorithm</th><th align="left">Header</th><th align="left">Parallel algorithm</th><th align="left">Parallel header</th></tr></thead><tbody><tr><td align="left"><code class="function">std::accumulate</code></td><td align="left"><code class="filename">numeric</code></td><td align="left"><code class="function">__gnu_parallel::accumulate</code></td><td align="left"><code class="filename">parallel/numeric</code></td></tr><tr><td align="left"><code class="function">std::adjacent_difference</code></td><td align="left"><code class="filename">numeric</code></td><td align="left"><code class="function">__gnu_parallel::adjacent_difference</code></td><td align="left"><code class="filename">parallel/numeric</code></td></tr><tr><td align="left"><code class="function">std::inner_product</code></td><td align="left"><code class="filename">numeric</code></td><td align="left"><code class="function">__gnu_parallel::inner_product</code></td><td align="left"><code class="filename">parallel/numeric</code></td></tr><tr><td align="left"><code class="function">std::partial_sum</code></td><td align="left"><code class="filename">numeric</code></td><td align="left"><code class="function">__gnu_parallel::partial_sum</code></td><td align="left"><code class="filename">parallel/numeric</code></td></tr><tr><td align="left"><code class="function">std::adjacent_find</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::adjacent_find</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::count</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::count</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::count_if</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::count_if</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::equal</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::equal</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::find</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::find</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::find_if</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::find_if</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::find_first_of</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::find_first_of</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::for_each</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::for_each</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::generate</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::generate</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::generate_n</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::generate_n</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::lexicographical_compare</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::lexicographical_compare</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::mismatch</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::mismatch</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::search</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::search</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::search_n</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::search_n</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::transform</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::transform</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::replace</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::replace</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::replace_if</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::replace_if</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::max_element</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::max_element</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::merge</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::merge</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::min_element</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::min_element</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::nth_element</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::nth_element</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::partial_sort</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::partial_sort</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::partition</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::partition</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::random_shuffle</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::random_shuffle</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::set_union</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::set_union</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::set_intersection</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::set_intersection</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::set_symmetric_difference</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::set_symmetric_difference</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::set_difference</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::set_difference</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::sort</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::sort</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::stable_sort</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::stable_sort</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::unique_copy</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::unique_copy</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr></tbody></table></div></div><br class="table-break" /></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="bk01pt12ch31s02.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="parallel_mode.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="bk01pt12ch31s04.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Semantics </td><td width="20%" align="center"><a accesskey="h" href="../spine.html">Home</a></td><td width="40%" align="right" valign="top"> Design</td></tr></table></div></body></html>
--- 25,28 ----
    compiled with either release mode or with parallel mode. The
    following table provides the names and headers of the parallel
    algorithms:
! </p><div class="table"><a id="id407416"></a><p class="title"><b>Table 31.1. Parallel Algorithms</b></p><div class="table-contents"><table summary="Parallel Algorithms" border="1"><colgroup><col align="left" /><col align="left" /><col align="left" /><col align="left" /></colgroup><thead><tr><th align="left">Algorithm</th><th align="left">Header</th><th align="left">Parallel algorithm</th><th align="left">Parallel header</th></tr></thead><tbody><tr><td align="left"><code class="function">std::accumulate</code></td><td align="left"><code class="filename">numeric</code></td><td align="left"><code class="function">__gnu_parallel::accumulate</code></td><td align="left"><code class="filename">parallel/numeric</code></td></tr><tr><td align="left"><code class="function">std::adjacent_difference</code></td><td align="left"><code class="filename">numeric</code></td><td align="left"><code class="function">__gnu_parallel::adjacent_difference</code></td><td align="left"><code class="filename">parallel/numeric</code></td></tr><tr><td align="left"><code class="function">std::inner_product</code></td><td align="left"><code class="filename">numeric</code></td><td align="left"><code class="function">__gnu_parallel::inner_product</code></td><td align="left"><code class="filename">parallel/numeric</code></td></tr><tr><td align="left"><code class="function">std::partial_sum</code></td><td align="left"><code class="filename">numeric</code></td><td align="left"><code class="function">__gnu_parallel::partial_sum</code></td><td align="left"><code class="filename">parallel/numeric</code></td></tr><tr><td align="left"><code class="function">std::adjacent_find</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::adjacent_find</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::count</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::count</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::count_if</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::count_if</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::equal</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::equal</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::find</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::find</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::find_if</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::find_if</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::find_first_of</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::find_first_of</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::for_each</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::for_each</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::generate</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::generate</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::generate_n</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::generate_n</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::lexicographical_compare</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::lexicographical_compare</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::mismatch</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::mismatch</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::search</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::search</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::search_n</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::search_n</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::transform</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::transform</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::replace</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::replace</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::replace_if</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::replace_if</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::max_element</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::max_element</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::merge</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::merge</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::min_element</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::min_element</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::nth_element</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::nth_element</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::partial_sort</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::partial_sort</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::partition</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::partition</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::random_shuffle</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::random_shuffle</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::set_union</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::set_union</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::set_intersection</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::set_intersection</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::set_symmetric_difference</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::set_symmetric_difference</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::set_difference</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::set_difference</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::sort</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::sort</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::stable_sort</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::stable_sort</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::unique_copy</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::unique_copy</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr></tbody></table></div></div><br class="table-break" /></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="bk01pt12ch31s02.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="parallel_mode.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="bk01pt12ch31s04.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Semantics </td><td width="20%" align="center"><a accesskey="h" href="../spine.html">Home</a></td><td width="40%" align="right" valign="top"> Design</td></tr></table></div></body></html>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt12ch31s04.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt12ch31s04.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt12ch31s04.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt12ch31s04.html	Thu Apr 10 22:53:15 2008
***************
*** 1,9 ****
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
  <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Design</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      C++&#10;    , &#10;      library&#10;    , &#10;      parallel&#10;    " /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="parallel_mode.html" title="Chapter 31. Parallel Mode" /><link rel="prev" href="bk01pt12ch31s03.html" title="Using" /><link rel="next" href="bk01pt12ch31s05.html" title="Testing" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Design</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk01pt12ch31s03.html">Prev</a> </td><th width="60%" align="center">Chapter 31. Parallel Mode</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt12ch31s05.html">Next</a></td></tr></table><hr /></div><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.parallel_mode.design"></a>Design</h2></div></div></div><p>
!   </p><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="manual.ext.parallel_mode.design.intro"></a>Interface Basics</h3></div></div></div><p>All parallel algorithms are intended to have signatures that are
  equivalent to the ISO C++ algorithms replaced. For instance, the
! <code class="code">std::adjacent_find</code> function is declared as:
  </p><pre class="programlisting">
  namespace std
  {
--- 1,10 ----
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
  <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Design</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      C++&#10;    , &#10;      library&#10;    , &#10;      parallel&#10;    " /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="parallel_mode.html" title="Chapter 31. Parallel Mode" /><link rel="prev" href="bk01pt12ch31s03.html" title="Using" /><link rel="next" href="bk01pt12ch31s05.html" title="Testing" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Design</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk01pt12ch31s03.html">Prev</a> </td><th width="60%" align="center">Chapter 31. Parallel Mode</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt12ch31s05.html">Next</a></td></tr></table><hr /></div><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.parallel_mode.design"></a>Design</h2></div></div></div><p>
!   </p><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="manual.ext.parallel_mode.design.intro"></a>Interface Basics</h3></div></div></div><p>
! All parallel algorithms are intended to have signatures that are
  equivalent to the ISO C++ algorithms replaced. For instance, the
! <code class="function">std::adjacent_find</code> function is declared as:
  </p><pre class="programlisting">
  namespace std
  {
*************** namespace std
*** 26,40 ****
      ...
    }
  }
! </pre><p>But.... why the elipses?
! </p><p> The elipses in the example above represent additional overloads
  required for the parallel version of the function. These additional
  overloads are used to dispatch calls from the ISO C++ function
  signature to the appropriate parallel function (or sequential
  function, if no parallel functions are deemed worthy), based on either
  compile-time or run-time conditions.
  </p><p> Compile-time conditions are referred to as "embarrassingly
! parallel," and are denoted with the appropriate dispatch object, ie
  one of <code class="code">__gnu_parallel::sequential_tag</code>,
  <code class="code">__gnu_parallel::parallel_tag</code>,
  <code class="code">__gnu_parallel::balanced_tag</code>,
--- 27,41 ----
      ...
    }
  }
! </pre><p>But.... why the ellipses?
! </p><p> The ellipses in the example above represent additional overloads
  required for the parallel version of the function. These additional
  overloads are used to dispatch calls from the ISO C++ function
  signature to the appropriate parallel function (or sequential
  function, if no parallel functions are deemed worthy), based on either
  compile-time or run-time conditions.
  </p><p> Compile-time conditions are referred to as "embarrassingly
! parallel," and are denoted with the appropriate dispatch object, i.e.,
  one of <code class="code">__gnu_parallel::sequential_tag</code>,
  <code class="code">__gnu_parallel::parallel_tag</code>,
  <code class="code">__gnu_parallel::balanced_tag</code>,
*************** parallel algorithms look like this:
*** 57,92 ****
  ISO C++ signature to the correct parallel version. Also, some of the
  algorithms do not have support for run-time conditions, so the last
  overload is therefore missing.
! </p></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="manual.ext.parallel_mode.design.tuning"></a>Configuration and Tuning</h3></div></div></div><p> Some algorithm variants can be enabled/disabled/selected at compile-time.
! See <a class="ulink" href="latest-doxygen/compiletime__settings_8h.html" target="_top">
! <code class="code">&lt;compiletime_settings.h&gt;</code></a> and
! See <a class="ulink" href="latest-doxygen/compiletime__settings_8h.html" target="_top">
! <code class="code">&lt;features.h&gt;</code></a> for details.
  </p><p>
! To specify the number of threads to be used for an algorithm,
! use <code class="code">omp_set_num_threads</code>.
! To force a function to execute sequentially,
! even though parallelism is switched on in general,
! add <code class="code">__gnu_parallel::sequential_tag()</code>
! to the end of the argument list.
  </p><p>
! Parallelism always incurs some overhead. Thus, it is not
! helpful to parallelize operations on very small sets of data.
! There are measures to avoid parallelizing stuff that is not worth it.
! For each algorithm, a minimum problem size can be stated,
! usually using the variable
! <code class="code">__gnu_parallel::Settings::[algorithm]_minimal_n</code>.
! Please see <a class="ulink" href="latest-doxygen/settings_8h.html" target="_top">
! <code class="code">&lt;settings.h&gt;</code></a> for details.</p></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="manual.ext.parallel_mode.design.impl"></a>Implementation Namespaces</h3></div></div></div><p> One namespace contain versions of code that are explicitly sequential:
  <code class="code">__gnu_serial</code>.
  </p><p> Two namespaces contain the parallel mode:
  <code class="code">std::__parallel</code> and <code class="code">__gnu_parallel</code>. 
  </p><p> Parallel implementations of standard components, including
  template helpers to select parallelism, are defined in <code class="code">namespace
! std::__parallel</code>. For instance, <code class="code">std::transform</code> from
! &lt;algorithm&gt; has a parallel counterpart in
! <code class="code">std::__parallel::transform</code> from
! &lt;parallel/algorithm&gt;. In addition, these parallel
  implementations are injected into <code class="code">namespace
  __gnu_parallel</code> with using declarations.
  </p><p> Support and general infrastructure is in <code class="code">namespace
--- 58,179 ----
  ISO C++ signature to the correct parallel version. Also, some of the
  algorithms do not have support for run-time conditions, so the last
  overload is therefore missing.
! </p></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="manual.ext.parallel_mode.design.tuning"></a>Configuration and Tuning</h3></div></div></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="parallel_mode.design.tuning.omp"></a>Setting up the OpenMP Environment</h4></div></div></div><p>
! Several aspects of the overall runtime environment can be manipulated
! by standard OpenMP function calls.
  </p><p>
! To specify the number of threads to be used for an algorithm, use the
! function <code class="function">omp_set_num_threads</code>. An example:
! </p><pre class="programlisting">
! #include &lt;stdlib.h&gt;
! #include &lt;omp.h&gt;
! 
! int main()
! {
!   // Explicitly set number of threads.
!   const int threads_wanted = 20;
!   omp_set_dynamic(false);
!   omp_set_num_threads(threads_wanted);
! 
!   // Do work.
! 
!   return 0;
! }
! </pre><p>
! Other parts of the runtime environment able to be manipulated include
! nested parallelism (<code class="function">omp_set_nested</code>), schedule kind
! (<code class="function">omp_set_schedule</code>), and others. See the OpenMP
! documentation for more information.
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="parallel_mode.design.tuning.compile"></a>Compile Time Switches</h4></div></div></div><p>
! To force an algorithm to execute sequentially, even though parallelism
! is switched on in general via the macro <code class="constant">_GLIBCXX_PARALLEL</code>,
! add <code class="classname">__gnu_parallel::sequential_tag()</code> to the end
! of the algorithm's argument list, or explicitly qualify the algorithm
! with the <code class="code">__gnu_parallel::</code> namespace.
  </p><p>
! Like so:
! </p><pre class="programlisting">
! std::sort(v.begin(), v.end(), __gnu_parallel::sequential_tag());
! </pre><p>
! or
! </p><pre class="programlisting">
! __gnu_serial::sort(v.begin(), v.end());
! </pre><p> 
! In addition, some parallel algorithm variants can be enabled/disabled/selected 
! at compile-time.
! </p><p>
! See <a class="ulink" href="http://gcc.gnu.org/onlinedocs/libstdc++/latest-doxygen/a00446.html" target="_top"><code class="filename">compiletime_settings.h</code></a> and
! See <a class="ulink" href="http://gcc.gnu.org/onlinedocs/libstdc++/latest-doxygen/a00505.html" target="_top"><code class="filename">features.h</code></a> for details.
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="parallel_mode.design.tuning.settings"></a>Run Time Settings and Defaults</h4></div></div></div><p>
! The default parallelization strategy, the choice of specific algorithm
! strategy, the minimum threshold limits for individual parallel
! algorithms, and aspects of the underlying hardware can be specified as
! desired via manipulation
! of <code class="classname">__gnu_parallel::_Settings</code> member data.
! </p><p>
! First off, the choice of parallelization strategy: serial, parallel,
! or implementation-deduced. This corresponds
! to <code class="code">__gnu_parallel::_Settings::algorithm_strategy</code> and is a
! value of enum <span class="type">__gnu_parallel::_AlgorithmStrategy</span>
! type. Choices
! include: <span class="type">heuristic</span>, <span class="type">force_sequential</span>,
! and <span class="type">force_parallel</span>. The default is
! implementation-deduced, i.e. <span class="type">heuristic</span>.
! </p><p>
! Next, the sub-choices for algorithm implementation. Specific
! algorithms like <code class="function">find</code> or <code class="function">sort</code>
! can be implemented in multiple ways: when this is the case,
! a <code class="classname">__gnu_parallel::_Settings</code> member exists to
! pick the default strategy. For
! example, <code class="code">__gnu_parallel::_Settings::sort_algorithm</code> can
! have any values of
! enum <span class="type">__gnu_parallel::_SortAlgorithm</span>: <span class="type">MWMS</span>, <span class="type">QS</span>,
! or <span class="type">QS_BALANCED</span>.
! </p><p>
! Likewise for setting the minimal threshold for algorithm
! parallelization.  Parallelism always incurs some overhead. Thus, it is
! not helpful to parallelize operations on very small sets of
! data. Because of this, measures are taken to avoid parallelizing below
! a certain, pre-determined threshold. For each algorithm, a minimum
! problem size is encoded as a variable in the
! active <code class="classname">__gnu_parallel::_Settings</code> object.  This
! threshold variable follows the following naming scheme:
! <code class="code">__gnu_parallel::_Settings::[algorithm]_minimal_n</code>.  So,
! for <code class="function">fill</code>, the threshold variable
! is <code class="code">__gnu_parallel::_Settings::fill_minimal_n</code>
! </p><p>
! Finally, hardware details like L1/L2 cache size can be hardwired
! via <code class="code">__gnu_parallel::_Settings::L1_cache_size</code> and friends.
! </p><p>
! All these configuration variables can be changed by the user, if
! desired.  Please
! see <a class="ulink" href="http://gcc.gnu.org/onlinedocs/libstdc++/latest-doxygen/a00640.html" target="_top"><code class="filename">settings.h</code></a>
! for complete details.
! </p><p>
! A small example of tuning the default:
! </p><pre class="programlisting">
! #include &lt;parallel/algorithm&gt;
! #include &lt;parallel/settings.h&gt;
! 
! int main()
! {
!   __gnu_parallel::_Settings s;
!   s.algorithm_strategy = __gnu_parallel::force_parallel;
!   __gnu_parallel::_Settings::set(s);
! 
!   // Do work... all algorithms will be parallelized, always.
! 
!   return 0;
! }
! </pre></div></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="manual.ext.parallel_mode.design.impl"></a>Implementation Namespaces</h3></div></div></div><p> One namespace contain versions of code that are always
! explicitly sequential:
  <code class="code">__gnu_serial</code>.
  </p><p> Two namespaces contain the parallel mode:
  <code class="code">std::__parallel</code> and <code class="code">__gnu_parallel</code>. 
  </p><p> Parallel implementations of standard components, including
  template helpers to select parallelism, are defined in <code class="code">namespace
! std::__parallel</code>. For instance, <code class="function">std::transform</code> from <code class="filename">algorithm</code> has a parallel counterpart in
! <code class="function">std::__parallel::transform</code> from <code class="filename">parallel/algorithm</code>. In addition, these parallel
  implementations are injected into <code class="code">namespace
  __gnu_parallel</code> with using declarations.
  </p><p> Support and general infrastructure is in <code class="code">namespace
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt12ch31s05.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt12ch31s05.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt12ch31s05.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt12ch31s05.html	Thu Apr 10 22:53:15 2008
***************
*** 10,24 ****
    <strong class="userinput"><code>make check-parallel</code></strong>
    </pre><p>
      The log and summary files for conformance testing are in the
!     <code class="code">testsuite/parallel</code> directory.
    </p><p> 
      To run the performance tests with the parallel mode active,
    </p><pre class="screen">
!   <strong class="userinput"><code>check-performance-parallel</code></strong>
    </pre><p>
      The result file for performance testing are in the
!     <code class="code">testsuite</code> directory, in the file
!     <code class="code">libstdc++_performance.sum</code>. In addition, the
      policy-based containers have their own visualizations, which have
      additional software dependencies than the usual bare-boned text
      file, and can be generated by using the <code class="code">make
--- 10,24 ----
    <strong class="userinput"><code>make check-parallel</code></strong>
    </pre><p>
      The log and summary files for conformance testing are in the
!     <code class="filename">testsuite/parallel</code> directory.
    </p><p> 
      To run the performance tests with the parallel mode active,
    </p><pre class="screen">
!   <strong class="userinput"><code>make check-performance-parallel</code></strong>
    </pre><p>
      The result file for performance testing are in the
!     <code class="filename">testsuite</code> directory, in the file
!     <code class="filename">libstdc++_performance.sum</code>. In addition, the
      policy-based containers have their own visualizations, which have
      additional software dependencies than the usual bare-boned text
      file, and can be generated by using the <code class="code">make
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt12ch35.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt12ch35.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt12ch35.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt12ch35.html	Thu Apr 10 22:53:15 2008
***************
*** 13,19 ****
  </p><p>25.3 (sorting 'n' heaps 'n' stuff) is extended with some helper
     predicates.  Look in the doxygen-generated pages for notes on these.
  </p><div class="itemizedlist"><ul type="disc"><li><p><code class="code">is_heap</code> tests whether or not a range is a heap.</p></li><li><p><code class="code">is_sorted</code> tests whether or not a range is sorted in
!         nondescending order.</p></li></ul></div><p>25.3.8 (lexigraphical_compare) is extended with
  </p><pre class="programlisting">
     lexicographical_compare_3way(_InputIter1 first1, _InputIter1 last1,
                                   _InputIter2 first2, _InputIter2 last2)</pre><p>which does... what?
--- 13,19 ----
  </p><p>25.3 (sorting 'n' heaps 'n' stuff) is extended with some helper
     predicates.  Look in the doxygen-generated pages for notes on these.
  </p><div class="itemizedlist"><ul type="disc"><li><p><code class="code">is_heap</code> tests whether or not a range is a heap.</p></li><li><p><code class="code">is_sorted</code> tests whether or not a range is sorted in
!         nondescending order.</p></li></ul></div><p>25.3.8 (lexicographical_compare) is extended with
  </p><pre class="programlisting">
     lexicographical_compare_3way(_InputIter1 first1, _InputIter1 last1,
                                   _InputIter2 first2, _InputIter2 last2)</pre><p>which does... what?
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt12ch39.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt12ch39.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt12ch39.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt12ch39.html	Thu Apr 10 22:53:15 2008
***************
*** 1,7 ****
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
  <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 39. Demangling</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="extensions.html" title="Part XII. Extensions" /><link rel="prev" href="bk01pt12ch38.html" title="Chapter 38. Input and Output" /><link rel="next" href="concurrency.html" title="Chapter 40. Concurrency" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 39. Demangling</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk01pt12ch38.html">Prev</a> </td><th width="60%" align="center">Part XII. Extensions</th><td width="20%" align="right"> <a accesskey="n" href="concurrency.html">Next</a></td></tr></table><hr /></div><div class="chapter" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.demangle"></a>Chapter 39. Demangling</h2></div></div></div><p>
!     Transforming C++ ABI itentifiers (like RTTI symbols) into the
      original C++ source identifiers is called
      “<span class="quote">demangling.</span>”
    </p><p>
--- 1,7 ----
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
  <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 39. Demangling</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="extensions.html" title="Part XII. Extensions" /><link rel="prev" href="bk01pt12ch38.html" title="Chapter 38. Input and Output" /><link rel="next" href="concurrency.html" title="Chapter 40. Concurrency" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 39. Demangling</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk01pt12ch38.html">Prev</a> </td><th width="60%" align="center">Part XII. Extensions</th><td width="20%" align="right"> <a accesskey="n" href="concurrency.html">Next</a></td></tr></table><hr /></div><div class="chapter" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.demangle"></a>Chapter 39. Demangling</h2></div></div></div><p>
!     Transforming C++ ABI identifiers (like RTTI symbols) into the
      original C++ source identifiers is called
      “<span class="quote">demangling.</span>”
    </p><p>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt12ch40s02.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt12ch40s02.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt12ch40s02.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt12ch40s02.html	Thu Apr 10 22:53:15 2008
***************
*** 1,6 ****
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Implementation</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="concurrency.html" title="Chapter 40. Concurrency" /><link rel="prev" href="concurrency.html" title="Chapter 40. Concurrency" /><link rel="next" href="bk01pt12ch40s03.html" title="Use" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Implementation</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="concurrency.html">Prev</a> </td><th width="60%" align="center">Chapter 40. Concurrency</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt12ch40s03.html">Next</a></td></tr></table><hr /></div><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.concurrency.impl"></a>Implementation</h2></div></div></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="manual.ext.concurrency.impl.atomic_fallbacks"></a>Using Builitin Atomic Functions</h3></div></div></div><p>The functions for atomic operations described above are either
  implemented via compiler intrinsics (if the underlying host is
  capable) or by library fallbacks.</p><p>Compiler intrinsics (builtins) are always preferred.  However, as
  the compiler builtins for atomics are not universally implemented,
--- 1,6 ----
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Implementation</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="concurrency.html" title="Chapter 40. Concurrency" /><link rel="prev" href="concurrency.html" title="Chapter 40. Concurrency" /><link rel="next" href="bk01pt12ch40s03.html" title="Use" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Implementation</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="concurrency.html">Prev</a> </td><th width="60%" align="center">Chapter 40. Concurrency</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt12ch40s03.html">Next</a></td></tr></table><hr /></div><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.concurrency.impl"></a>Implementation</h2></div></div></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="manual.ext.concurrency.impl.atomic_fallbacks"></a>Using Builtin Atomic Functions</h3></div></div></div><p>The functions for atomic operations described above are either
  implemented via compiler intrinsics (if the underlying host is
  capable) or by library fallbacks.</p><p>Compiler intrinsics (builtins) are always preferred.  However, as
  the compiler builtins for atomics are not universally implemented,
*************** hardware, hand-crafted assembly is selec
*** 22,28 ****
  </p><div class="itemizedlist"><ul type="disc"><li><p>cris</p></li><li><p>hppa</p></li><li><p>i386</p></li><li><p>i486</p></li><li><p>m48k</p></li><li><p>mips</p></li><li><p>sparc</p></li></ul></div><p>And for the rest, a simulated atomic lock via pthreads.
  </p><p> Detailed information about compiler intrinsics for atomic operations can be found in the GCC <a class="ulink" href="http://gcc.gnu.org/onlinedocs/gcc/Atomic-Builtins.html" target="_top"> documentation</a>.
  </p><p> More details on the library fallbacks from the porting <a class="ulink" href="http://gcc.gnu.org/onlinedocs/libstdc++/17_intro/porting.html#Thread%20safety" target="_top">section</a>.
! </p></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="manual.ext.concurrency.impl.thread"></a>Thread Abstraction</h3></div></div></div><p>A thin layer above IEEE 1003.1 (ie pthreads) is used to abstract
  the thread interface for GCC. This layer is called "gthread," and is
  comprised of one header file that wraps the host's default thread layer with
  a POSIX-like interface.
--- 22,28 ----
  </p><div class="itemizedlist"><ul type="disc"><li><p>cris</p></li><li><p>hppa</p></li><li><p>i386</p></li><li><p>i486</p></li><li><p>m48k</p></li><li><p>mips</p></li><li><p>sparc</p></li></ul></div><p>And for the rest, a simulated atomic lock via pthreads.
  </p><p> Detailed information about compiler intrinsics for atomic operations can be found in the GCC <a class="ulink" href="http://gcc.gnu.org/onlinedocs/gcc/Atomic-Builtins.html" target="_top"> documentation</a>.
  </p><p> More details on the library fallbacks from the porting <a class="ulink" href="http://gcc.gnu.org/onlinedocs/libstdc++/17_intro/porting.html#Thread%20safety" target="_top">section</a>.
! </p></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="manual.ext.concurrency.impl.thread"></a>Thread Abstraction</h3></div></div></div><p>A thin layer above IEEE 1003.1 (i.e. pthreads) is used to abstract
  the thread interface for GCC. This layer is called "gthread," and is
  comprised of one header file that wraps the host's default thread layer with
  a POSIX-like interface.
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt12pr03.html gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt12pr03.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/bk01pt12pr03.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/bk01pt12pr03.html	Thu Apr 10 22:53:15 2008
***************
*** 1,6 ****
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title></title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="extensions.html" title="Part XII. Extensions" /><link rel="prev" href="extensions.html" title="Part XII. Extensions" /><link rel="next" href="bk01pt12ch29.html" title="Chapter 29. Compile Time Checks" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center"></th></tr><tr><td width="20%" align="left"><a accesskey="p" href="extensions.html">Prev</a> </td><th width="60%" align="center">Part XII. Extensions</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt12ch29.html">Next</a></td></tr></table><hr /></div><div class="preface" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="id516952"></a></h2></div></div></div><p>
    Here we will make an attempt at describing the non-Standard extensions to
    the library.  Some of these are from SGI's STL, some of these are GNU's,
    and some just seemed to appear on the doorstep.
--- 1,6 ----
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title></title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="extensions.html" title="Part XII. Extensions" /><link rel="prev" href="extensions.html" title="Part XII. Extensions" /><link rel="next" href="bk01pt12ch29.html" title="Chapter 29. Compile Time Checks" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center"></th></tr><tr><td width="20%" align="left"><a accesskey="p" href="extensions.html">Prev</a> </td><th width="60%" align="center">Part XII. Extensions</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt12ch29.html">Next</a></td></tr></table><hr /></div><div class="preface" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="id418164"></a></h2></div></div></div><p>
    Here we will make an attempt at describing the non-Standard extensions to
    the library.  Some of these are from SGI's STL, some of these are GNU's,
    and some just seemed to appear on the doorstep.
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/codecvt.html gcc-4.3.1/libstdc++-v3/doc/html/manual/codecvt.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/codecvt.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/codecvt.html	Thu Apr 10 22:53:15 2008
*************** UCS2, UCS4, UNICODE, UNICODEBIG, UNICODE
*** 111,117 ****
  UTF-16, UTF8, UTF16).
  </pre></blockquote></div><p>
  For iconv-based implementations, string literals for each of the
! encodings (ie. "UCS-2" and "UTF-8") are necessary,
  although for other,
  non-iconv implementations a table of enumerated values or some other
  mechanism may be required.
--- 111,117 ----
  UTF-16, UTF8, UTF16).
  </pre></blockquote></div><p>
  For iconv-based implementations, string literals for each of the
! encodings (i.e. "UCS-2" and "UTF-8") are necessary,
  although for other,
  non-iconv implementations a table of enumerated values or some other
  mechanism may be required.
*************** mechanism may be required.
*** 130,136 ****
    conversion descriptor encodes more information than a simple encoding
    state type.
  </p></li><li><p>
!  Conversion descriptors for both directions of encoding. (ie, both
    UCS-2 to UTF-8 and UTF-8 to UCS-2.)
  </p></li><li><p>
   Something to indicate if the conversion requested if valid.
--- 130,136 ----
    conversion descriptor encodes more information than a simple encoding
    state type.
  </p></li><li><p>
!  Conversion descriptors for both directions of encoding. (i.e., both
    UCS-2 to UTF-8 and UTF-8 to UCS-2.)
  </p></li><li><p>
   Something to indicate if the conversion requested if valid.
*************** The two required specializations are imp
*** 179,185 ****
  codecvt&lt;char, char, mbstate_t&gt;
  </code>
  </p><p>
! This is a degenerate (ie, does nothing) specialization. Implementing
  this was a piece of cake.
  </p><p>
  <code class="code">
--- 179,185 ----
  codecvt&lt;char, char, mbstate_t&gt;
  </code>
  </p><p>
! This is a degenerate (i.e., does nothing) specialization. Implementing
  this was a piece of cake.
  </p><p>
  <code class="code">
*************** codecvt usage.
*** 337,377 ****
        </p></li><li><p>
        wchar_t/char internal buffers and conversions between
        internal/external buffers?
!       </p></li></ul></div></li></ul></div></div><div class="bibliography"><div class="titlepage"><div><div><h3 class="title"><a id="facet.codecvt.biblio"></a>Bibliography</h3></div></div></div><div class="biblioentry"><a id="id400718"></a><p><span class="title"><i>
        The GNU C Library
!     </i>. </span><span class="author"><span class="firstname">Roland</span> <span class="surname">McGrath</span>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2007 FSF. </span><span class="pagenums">Chapters 6 Character Set Handling and 7 Locales and Internationalization. </span></p></div><div class="biblioentry"><a id="id487971"></a><p><span class="title"><i>
        Correspondence
!     </i>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2002 . </span></p></div><div class="biblioentry"><a id="id452178"></a><p><span class="title"><i>
        ISO/IEC 14882:1998 Programming languages - C++
!     </i>. </span><span class="copyright">Copyright © 1998 ISO. </span></p></div><div class="biblioentry"><a id="id452196"></a><p><span class="title"><i>
        ISO/IEC 9899:1999 Programming languages - C
!     </i>. </span><span class="copyright">Copyright © 1999 ISO. </span></p></div><div class="biblioentry"><a id="id461282"></a><p><span class="title"><i>
        System Interface Definitions, Issue 6 (IEEE Std. 1003.1-200x)
      </i>. </span><span class="copyright">Copyright © 1999 
        The Open Group/The Institute of Electrical and Electronics Engineers, Inc.. </span><span class="biblioid">
        <a class="ulink" href="http://www.opennc.org/austin/docreg.html" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id461308"></a><p><span class="title"><i>
        The C++ Programming Language, Special Edition
      </i>. </span><span class="author"><span class="firstname">Bjarne</span> <span class="surname">Stroustrup</span>. </span><span class="copyright">Copyright © 2000 Addison Wesley, Inc.. </span><span class="pagenums">Appendix D. </span><span class="publisher"><span class="publishername">
  	Addison Wesley
!       . </span></span></p></div><div class="biblioentry"><a id="id494830"></a><p><span class="title"><i>
        Standard C++ IOStreams and Locales
      </i>. </span><span class="subtitle">
        Advanced Programmer's Guide and Reference
      . </span><span class="author"><span class="firstname">Angelika</span> <span class="surname">Langer</span>. </span><span class="author"><span class="firstname">Klaus</span> <span class="surname">Kreft</span>. </span><span class="copyright">Copyright © 2000 Addison Wesley Longman, Inc.. </span><span class="publisher"><span class="publishername">
  	Addison Wesley Longman
!       . </span></span></p></div><div class="biblioentry"><a id="id417572"></a><p><span class="title"><i>
        A brief description of Normative Addendum 1
      </i>. </span><span class="author"><span class="firstname">Clive</span> <span class="surname">Feather</span>. </span><span class="pagenums">Extended Character Sets. </span><span class="biblioid">
        <a class="ulink" href="http://www.lysator.liu.se/c/na1.html" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id417604"></a><p><span class="title"><i>
        The Unicode HOWTO
      </i>. </span><span class="author"><span class="firstname">Bruno</span> <span class="surname">Haible</span>. </span><span class="biblioid">
        <a class="ulink" href="ftp://ftp.ilog.fr/pub/Users/haible/utf8/Unicode-HOWTO.html" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id427552"></a><p><span class="title"><i>
        UTF-8 and Unicode FAQ for Unix/Linux
      </i>. </span><span class="author"><span class="firstname">Markus</span> <span class="surname">Khun</span>. </span><span class="biblioid">
        <a class="ulink" href="http://www.cl.cam.ac.uk/~mgk25/unicode.html" target="_top">
--- 337,377 ----
        </p></li><li><p>
        wchar_t/char internal buffers and conversions between
        internal/external buffers?
!       </p></li></ul></div></li></ul></div></div><div class="bibliography"><div class="titlepage"><div><div><h3 class="title"><a id="facet.codecvt.biblio"></a>Bibliography</h3></div></div></div><div class="biblioentry"><a id="id394270"></a><p><span class="title"><i>
        The GNU C Library
!     </i>. </span><span class="author"><span class="firstname">Roland</span> <span class="surname">McGrath</span>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2007 FSF. </span><span class="pagenums">Chapters 6 Character Set Handling and 7 Locales and Internationalization. </span></p></div><div class="biblioentry"><a id="id464999"></a><p><span class="title"><i>
        Correspondence
!     </i>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2002 . </span></p></div><div class="biblioentry"><a id="id465028"></a><p><span class="title"><i>
        ISO/IEC 14882:1998 Programming languages - C++
!     </i>. </span><span class="copyright">Copyright © 1998 ISO. </span></p></div><div class="biblioentry"><a id="id426183"></a><p><span class="title"><i>
        ISO/IEC 9899:1999 Programming languages - C
!     </i>. </span><span class="copyright">Copyright © 1999 ISO. </span></p></div><div class="biblioentry"><a id="id426202"></a><p><span class="title"><i>
        System Interface Definitions, Issue 6 (IEEE Std. 1003.1-200x)
      </i>. </span><span class="copyright">Copyright © 1999 
        The Open Group/The Institute of Electrical and Electronics Engineers, Inc.. </span><span class="biblioid">
        <a class="ulink" href="http://www.opennc.org/austin/docreg.html" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id402703"></a><p><span class="title"><i>
        The C++ Programming Language, Special Edition
      </i>. </span><span class="author"><span class="firstname">Bjarne</span> <span class="surname">Stroustrup</span>. </span><span class="copyright">Copyright © 2000 Addison Wesley, Inc.. </span><span class="pagenums">Appendix D. </span><span class="publisher"><span class="publishername">
  	Addison Wesley
!       . </span></span></p></div><div class="biblioentry"><a id="id413189"></a><p><span class="title"><i>
        Standard C++ IOStreams and Locales
      </i>. </span><span class="subtitle">
        Advanced Programmer's Guide and Reference
      . </span><span class="author"><span class="firstname">Angelika</span> <span class="surname">Langer</span>. </span><span class="author"><span class="firstname">Klaus</span> <span class="surname">Kreft</span>. </span><span class="copyright">Copyright © 2000 Addison Wesley Longman, Inc.. </span><span class="publisher"><span class="publishername">
  	Addison Wesley Longman
!       . </span></span></p></div><div class="biblioentry"><a id="id427920"></a><p><span class="title"><i>
        A brief description of Normative Addendum 1
      </i>. </span><span class="author"><span class="firstname">Clive</span> <span class="surname">Feather</span>. </span><span class="pagenums">Extended Character Sets. </span><span class="biblioid">
        <a class="ulink" href="http://www.lysator.liu.se/c/na1.html" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id458138"></a><p><span class="title"><i>
        The Unicode HOWTO
      </i>. </span><span class="author"><span class="firstname">Bruno</span> <span class="surname">Haible</span>. </span><span class="biblioid">
        <a class="ulink" href="ftp://ftp.ilog.fr/pub/Users/haible/utf8/Unicode-HOWTO.html" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id458167"></a><p><span class="title"><i>
        UTF-8 and Unicode FAQ for Unix/Linux
      </i>. </span><span class="author"><span class="firstname">Markus</span> <span class="surname">Khun</span>. </span><span class="biblioid">
        <a class="ulink" href="http://www.cl.cam.ac.uk/~mgk25/unicode.html" target="_top">
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/concurrency.html gcc-4.3.1/libstdc++-v3/doc/html/manual/concurrency.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/concurrency.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/concurrency.html	Thu Apr 10 22:53:15 2008
***************
*** 1,6 ****
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 40. Concurrency</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="extensions.html" title="Part XII. Extensions" /><link rel="prev" href="bk01pt12ch39.html" title="Chapter 39. Demangling" /><link rel="next" href="bk01pt12ch40s02.html" title="Implementation" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 40. Concurrency</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk01pt12ch39.html">Prev</a> </td><th width="60%" align="center">Part XII. Extensions</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt12ch40s02.html">Next</a></td></tr></table><hr /></div><div class="chapter" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.concurrency"></a>Chapter 40. Concurrency</h2></div></div></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><span class="sect1"><a href="concurrency.html#manual.ext.concurrency.design">Design</a></span></dt><dd><dl><dt><span class="sect2"><a href="concurrency.html#manual.ext.concurrency.design.threads">Interface to Locks and Mutexes</a></span></dt><dt><span class="sect2"><a href="concurrency.html#manual.ext.concurrency.design.atomics">Interface to Atomic Functions</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt12ch40s02.html">Implementation</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch40s02.html#manual.ext.concurrency.impl.atomic_fallbacks">Using Builitin Atomic Functions</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch40s02.html#manual.ext.concurrency.impl.thread">Thread Abstraction</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt12ch40s03.html">Use</a></span></dt></dl></div><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.concurrency.design"></a>Design</h2></div></div></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="manual.ext.concurrency.design.threads"></a>Interface to Locks and Mutexes</h3></div></div></div><p>The file &lt;ext/concurrence.h&gt; contains all the higher-level
  constructs for playing with threads. In contrast to the atomics layer,
  the concurrence layer consists largely of types. All types are defined within <code class="code">namespace __gnu_cxx</code>.
  </p><p>
--- 1,6 ----
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 40. Concurrency</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="extensions.html" title="Part XII. Extensions" /><link rel="prev" href="bk01pt12ch39.html" title="Chapter 39. Demangling" /><link rel="next" href="bk01pt12ch40s02.html" title="Implementation" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 40. Concurrency</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk01pt12ch39.html">Prev</a> </td><th width="60%" align="center">Part XII. Extensions</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt12ch40s02.html">Next</a></td></tr></table><hr /></div><div class="chapter" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.concurrency"></a>Chapter 40. Concurrency</h2></div></div></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><span class="sect1"><a href="concurrency.html#manual.ext.concurrency.design">Design</a></span></dt><dd><dl><dt><span class="sect2"><a href="concurrency.html#manual.ext.concurrency.design.threads">Interface to Locks and Mutexes</a></span></dt><dt><span class="sect2"><a href="concurrency.html#manual.ext.concurrency.design.atomics">Interface to Atomic Functions</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt12ch40s02.html">Implementation</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch40s02.html#manual.ext.concurrency.impl.atomic_fallbacks">Using Builtin Atomic Functions</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch40s02.html#manual.ext.concurrency.impl.thread">Thread Abstraction</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt12ch40s03.html">Use</a></span></dt></dl></div><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.concurrency.design"></a>Design</h2></div></div></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="manual.ext.concurrency.design.threads"></a>Interface to Locks and Mutexes</h3></div></div></div><p>The file &lt;ext/concurrence.h&gt; contains all the higher-level
  constructs for playing with threads. In contrast to the atomics layer,
  the concurrence layer consists largely of types. All types are defined within <code class="code">namespace __gnu_cxx</code>.
  </p><p>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/extensions.html gcc-4.3.1/libstdc++-v3/doc/html/manual/extensions.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/extensions.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/extensions.html	Thu Apr 10 22:53:15 2008
***************
*** 1,3 ****
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Part XII. Extensions</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="spine.html" title="The GNU C++ Library" /><link rel="prev" href="bk01pt11ch28s02.html" title="Performance" /><link rel="next" href="bk01pt12pr03.html" title="" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Part XII. Extensions</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk01pt11ch28s02.html">Prev</a> </td><th width="60%" align="center">The GNU C++ Library</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt12pr03.html">Next</a></td></tr></table><hr /></div><div class="part" lang="en" xml:lang="en"><div class="titlepage"><div><div><h1 class="title"><a id="manual.ext"></a>Part XII. Extensions</h1></div></div></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><span class="preface"><a href="bk01pt12pr03.html"></a></span></dt><dt><span class="chapter"><a href="bk01pt12ch29.html">29. Compile Time Checks</a></span></dt><dt><span class="chapter"><a href="debug_mode.html">30. Debug Mode</a></span></dt><dd><dl><dt><span class="sect1"><a href="debug_mode.html#manual.ext.debug_mode.intro">Intro</a></span></dt><dt><span class="sect1"><a href="bk01pt12ch30s02.html">Semantics</a></span></dt><dt><span class="sect1"><a href="bk01pt12ch30s03.html">Using</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch30s03.html#debug_mode.using.mode">Using the Debug Mode</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch30s03.html#debug_mode.using.specific">Using a Specific Debug Container</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt12ch30s04.html">Design</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch30s04.html#manual.ext.debug_mode.design.goals">Goals</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch30s04.html#manual.ext.debug_mode.design.methods">Methods</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch30s04.html#manual.ext.debug_mode.design.other">Other Implementations</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="parallel_mode.html">31. Parallel Mode</a></span></dt><dd><dl><dt><span class="sect1"><a href="parallel_mode.html#manual.ext.parallel_mode.intro">Intro</a></span></dt><dt><span class="sect1"><a href="bk01pt12ch31s02.html">Semantics</a></span></dt><dt><span class="sect1"><a href="bk01pt12ch31s03.html">Using</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch31s03.html#parallel_mode.using.parallel_mode">Using Parallel Mode</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch31s03.html#manual.ext.parallel_mode.usings">Using Specific Parallel Components</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt12ch31s04.html">Design</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch31s04.html#manual.ext.parallel_mode.design.intro">Interface Basics</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch31s04.html#manual.ext.parallel_mode.design.tuning">Configuration and Tuning</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch31s04.html#manual.ext.parallel_mode.design.impl">Implementation Namespaces</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt12ch31s05.html">Testing</a></span></dt><dt><span class="bibliography"><a href="parallel_mode.html#parallel_mode.biblio">Bibliography</a></span></dt></dl></dd><dt><span class="chapter"><a href="bk01pt12ch32.html">32. Allocators</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt12ch32.html#manual.ext.allocator.mt">mt_allocator</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch32.html#allocator.mt.intro">Intro</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch32.html#allocator.mt.design_issues">Design Issues</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch32.html#allocator.mt.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch32.html#allocator.mt.example_single">Single Thread Example</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch32.html#allocator.mt.example_multi">Multiple Thread Example</a></span></dt></dl></dd><dt><span class="sect1"><a href="bitmap_allocator.html">bitmap_allocator</a></span></dt><dd><dl><dt><span class="sect2"><a href="bitmap_allocator.html#allocator.bitmap.design">Design</a></span></dt><dt><span class="sect2"><a href="bitmap_allocator.html#allocator.bitmap.impl">Implementation</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="bk01pt12ch33.html">33. Containers</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt12ch33.html#manual.ext.containers.pbds">Policy Based Data Structures</a></span></dt><dt><span class="sect1"><a href="bk01pt12ch33s02.html">HP/SGI</a></span></dt><dt><span class="sect1"><a href="bk01pt12ch33s03.html">Deprecated HP/SGI</a></span></dt></dl></dd><dt><span class="chapter"><a href="bk01pt12ch34.html">34. Utilities</a></span></dt><dt><span class="chapter"><a href="bk01pt12ch35.html">35. Algorithms</a></span></dt><dt><span class="chapter"><a href="bk01pt12ch36.html">36. Numerics</a></span></dt><dt><span class="chapter"><a href="bk01pt12ch37.html">37. Iterators</a></span></dt><dt><span class="chapter"><a href="bk01pt12ch38.html">38. Input and Output</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt12ch38.html#manual.ext.io.filebuf_derived">Derived filebufs</a></span></dt></dl></dd><dt><span class="chapter"><a href="bk01pt12ch39.html">39. Demangling</a></span></dt><dt><span class="chapter"><a href="concurrency.html">40. Concurrency</a></span></dt><dd><dl><dt><span class="sect1"><a href="concurrency.html#manual.ext.concurrency.design">Design</a></span></dt><dd><dl><dt><span class="sect2"><a href="concurrency.html#manual.ext.concurrency.design.threads">Interface to Locks and Mutexes</a></span></dt><dt><span class="sect2"><a href="concurrency.html#manual.ext.concurrency.design.atomics">Interface to Atomic Functions</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt12ch40s02.html">Implementation</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch40s02.html#manual.ext.concurrency.impl.atomic_fallbacks">Using Builitin Atomic Functions</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch40s02.html#manual.ext.concurrency.impl.thread">Thread Abstraction</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt12ch40s03.html">Use</a></span></dt></dl></dd></dl></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="bk01pt11ch28s02.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="spine.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="bk01pt12pr03.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Performance </td><td width="20%" align="center"><a accesskey="h" href="../spine.html">Home</a></td><td width="40%" align="right" valign="top"> </td></tr></table></div></body></html>
--- 1,3 ----
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Part XII. Extensions</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="spine.html" title="The GNU C++ Library" /><link rel="prev" href="bk01pt11ch28s02.html" title="Performance" /><link rel="next" href="bk01pt12pr03.html" title="" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Part XII. Extensions</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk01pt11ch28s02.html">Prev</a> </td><th width="60%" align="center">The GNU C++ Library</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt12pr03.html">Next</a></td></tr></table><hr /></div><div class="part" lang="en" xml:lang="en"><div class="titlepage"><div><div><h1 class="title"><a id="manual.ext"></a>Part XII. Extensions</h1></div></div></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><span class="preface"><a href="bk01pt12pr03.html"></a></span></dt><dt><span class="chapter"><a href="bk01pt12ch29.html">29. Compile Time Checks</a></span></dt><dt><span class="chapter"><a href="debug_mode.html">30. Debug Mode</a></span></dt><dd><dl><dt><span class="sect1"><a href="debug_mode.html#manual.ext.debug_mode.intro">Intro</a></span></dt><dt><span class="sect1"><a href="bk01pt12ch30s02.html">Semantics</a></span></dt><dt><span class="sect1"><a href="bk01pt12ch30s03.html">Using</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch30s03.html#debug_mode.using.mode">Using the Debug Mode</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch30s03.html#debug_mode.using.specific">Using a Specific Debug Container</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt12ch30s04.html">Design</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch30s04.html#manual.ext.debug_mode.design.goals">Goals</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch30s04.html#manual.ext.debug_mode.design.methods">Methods</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch30s04.html#manual.ext.debug_mode.design.other">Other Implementations</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="parallel_mode.html">31. Parallel Mode</a></span></dt><dd><dl><dt><span class="sect1"><a href="parallel_mode.html#manual.ext.parallel_mode.intro">Intro</a></span></dt><dt><span class="sect1"><a href="bk01pt12ch31s02.html">Semantics</a></span></dt><dt><span class="sect1"><a href="bk01pt12ch31s03.html">Using</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch31s03.html#parallel_mode.using.parallel_mode">Using Parallel Mode</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch31s03.html#manual.ext.parallel_mode.usings">Using Specific Parallel Components</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt12ch31s04.html">Design</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch31s04.html#manual.ext.parallel_mode.design.intro">Interface Basics</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch31s04.html#manual.ext.parallel_mode.design.tuning">Configuration and Tuning</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch31s04.html#manual.ext.parallel_mode.design.impl">Implementation Namespaces</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt12ch31s05.html">Testing</a></span></dt><dt><span class="bibliography"><a href="parallel_mode.html#parallel_mode.biblio">Bibliography</a></span></dt></dl></dd><dt><span class="chapter"><a href="bk01pt12ch32.html">32. Allocators</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt12ch32.html#manual.ext.allocator.mt">mt_allocator</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch32.html#allocator.mt.intro">Intro</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch32.html#allocator.mt.design_issues">Design Issues</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch32.html#allocator.mt.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch32.html#allocator.mt.example_single">Single Thread Example</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch32.html#allocator.mt.example_multi">Multiple Thread Example</a></span></dt></dl></dd><dt><span class="sect1"><a href="bitmap_allocator.html">bitmap_allocator</a></span></dt><dd><dl><dt><span class="sect2"><a href="bitmap_allocator.html#allocator.bitmap.design">Design</a></span></dt><dt><span class="sect2"><a href="bitmap_allocator.html#allocator.bitmap.impl">Implementation</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="bk01pt12ch33.html">33. Containers</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt12ch33.html#manual.ext.containers.pbds">Policy Based Data Structures</a></span></dt><dt><span class="sect1"><a href="bk01pt12ch33s02.html">HP/SGI</a></span></dt><dt><span class="sect1"><a href="bk01pt12ch33s03.html">Deprecated HP/SGI</a></span></dt></dl></dd><dt><span class="chapter"><a href="bk01pt12ch34.html">34. Utilities</a></span></dt><dt><span class="chapter"><a href="bk01pt12ch35.html">35. Algorithms</a></span></dt><dt><span class="chapter"><a href="bk01pt12ch36.html">36. Numerics</a></span></dt><dt><span class="chapter"><a href="bk01pt12ch37.html">37. Iterators</a></span></dt><dt><span class="chapter"><a href="bk01pt12ch38.html">38. Input and Output</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt12ch38.html#manual.ext.io.filebuf_derived">Derived filebufs</a></span></dt></dl></dd><dt><span class="chapter"><a href="bk01pt12ch39.html">39. Demangling</a></span></dt><dt><span class="chapter"><a href="concurrency.html">40. Concurrency</a></span></dt><dd><dl><dt><span class="sect1"><a href="concurrency.html#manual.ext.concurrency.design">Design</a></span></dt><dd><dl><dt><span class="sect2"><a href="concurrency.html#manual.ext.concurrency.design.threads">Interface to Locks and Mutexes</a></span></dt><dt><span class="sect2"><a href="concurrency.html#manual.ext.concurrency.design.atomics">Interface to Atomic Functions</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt12ch40s02.html">Implementation</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch40s02.html#manual.ext.concurrency.impl.atomic_fallbacks">Using Builtin Atomic Functions</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch40s02.html#manual.ext.concurrency.impl.thread">Thread Abstraction</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt12ch40s03.html">Use</a></span></dt></dl></dd></dl></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="bk01pt11ch28s02.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="spine.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="bk01pt12pr03.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Performance </td><td width="20%" align="center"><a accesskey="h" href="../spine.html">Home</a></td><td width="40%" align="right" valign="top"> </td></tr></table></div></body></html>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/messages.html gcc-4.3.1/libstdc++-v3/doc/html/manual/messages.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/messages.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/messages.html	Thu Apr 10 22:53:15 2008
*************** model.
*** 133,139 ****
      library locale support is necessary for more than just the
      <code class="code">LC_MESSAGES</code> mask: <code class="code">LC_CTYPE</code> is also
      necessary. To avoid any unpleasantness, all bits of the "C" mask
!     (ie <code class="code">LC_ALL</code>) are set before retrieving messages.
    </p><p>
      Making the message catalogs can be initially tricky, but become
      quite simple with practice. For complete info, see the gettext
--- 133,139 ----
      library locale support is necessary for more than just the
      <code class="code">LC_MESSAGES</code> mask: <code class="code">LC_CTYPE</code> is also
      necessary. To avoid any unpleasantness, all bits of the "C" mask
!     (i.e. <code class="code">LC_ALL</code>) are set before retrieving messages.
    </p><p>
      Making the message catalogs can be initially tricky, but become
      quite simple with practice. For complete info, see the gettext
*************** void test01()
*** 205,211 ****
  	  There are issues with gettext needing the global locale set
  	  to extract a message. This dependence on the global locale
  	  makes the current "gnu" model non MT-safe. Future versions
! 	  of glibc, ie glibc 2.3.x will fix this, and the C++ library
  	  bits are already in place.
  	</p></li></ul></div></li><li><p>  
      Development versions of the GNU "C" library, glibc 2.3 will allow
--- 205,211 ----
  	  There are issues with gettext needing the global locale set
  	  to extract a message. This dependence on the global locale
  	  makes the current "gnu" model non MT-safe. Future versions
! 	  of glibc, i.e. glibc 2.3.x will fix this, and the C++ library
  	  bits are already in place.
  	</p></li></ul></div></li><li><p>  
      Development versions of the GNU "C" library, glibc 2.3 will allow
*************** void test01()
*** 218,224 ****
      library functionality.
    </p></li><li><p>
      At some point in the near future, std::numpunct will probably use
!     std::messages facilities to implement truename/falename
      correctly. This is currently not done, but entries in
      libstdc++.pot have already been made for "true" and "false" string
      literals, so all that remains is the std::numpunct coding and the
--- 218,224 ----
      library functionality.
    </p></li><li><p>
      At some point in the near future, std::numpunct will probably use
!     std::messages facilities to implement truename/falsename
      correctly. This is currently not done, but entries in
      libstdc++.pot have already been made for "true" and "false" string
      literals, so all that remains is the std::numpunct coding and the
*************** void test01()
*** 241,278 ****
     model. As of this writing, it is unknown how to query to see
     if a specified message catalog exists using the gettext
     package.
!    </p></li></ul></div></div><div class="bibliography"><div class="titlepage"><div><div><h3 class="title"><a id="facet.messages.biblio"></a>Bibliography</h3></div></div></div><div class="biblioentry"><a id="id486645"></a><p><span class="title"><i>
        The GNU C Library
      </i>. </span><span class="author"><span class="firstname">Roland</span> <span class="surname">McGrath</span>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2007 FSF. </span><span class="pagenums">Chapters 6 Character Set Handling, and 7 Locales and Internationalization
!     . </span></p></div><div class="biblioentry"><a id="id420122"></a><p><span class="title"><i>
        Correspondence
!     </i>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2002 . </span></p></div><div class="biblioentry"><a id="id420151"></a><p><span class="title"><i>
        ISO/IEC 14882:1998 Programming languages - C++
!     </i>. </span><span class="copyright">Copyright © 1998 ISO. </span></p></div><div class="biblioentry"><a id="id483860"></a><p><span class="title"><i>
        ISO/IEC 9899:1999 Programming languages - C
!     </i>. </span><span class="copyright">Copyright © 1999 ISO. </span></p></div><div class="biblioentry"><a id="id483878"></a><p><span class="title"><i>
        System Interface Definitions, Issue 6 (IEEE Std. 1003.1-200x)
      </i>. </span><span class="copyright">Copyright © 1999 
        The Open Group/The Institute of Electrical and Electronics Engineers, Inc.. </span><span class="biblioid">
        <a class="ulink" href="http://www.opennc.org/austin/docreg.html" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id428875"></a><p><span class="title"><i>
        The C++ Programming Language, Special Edition
      </i>. </span><span class="author"><span class="firstname">Bjarne</span> <span class="surname">Stroustrup</span>. </span><span class="copyright">Copyright © 2000 Addison Wesley, Inc.. </span><span class="pagenums">Appendix D. </span><span class="publisher"><span class="publishername">
  	Addison Wesley
!       . </span></span></p></div><div class="biblioentry"><a id="id420793"></a><p><span class="title"><i>
        Standard C++ IOStreams and Locales
      </i>. </span><span class="subtitle">
        Advanced Programmer's Guide and Reference
      . </span><span class="author"><span class="firstname">Angelika</span> <span class="surname">Langer</span>. </span><span class="author"><span class="firstname">Klaus</span> <span class="surname">Kreft</span>. </span><span class="copyright">Copyright © 2000 Addison Wesley Longman, Inc.. </span><span class="publisher"><span class="publishername">
  	Addison Wesley Longman
!       . </span></span></p></div><div class="biblioentry"><a id="id487716"></a><p><span class="title"><i>
        Java 2 Platform, Standard Edition, v 1.3.1 API Specification
      </i>. </span><span class="pagenums">java.util.Properties, java.text.MessageFormat,
  java.util.Locale, java.util.ResourceBundle. </span><span class="biblioid">
        <a class="ulink" href="http://java.sun.com/j2se/1.3/docs/api" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id487737"></a><p><span class="title"><i>
         GNU gettext tools, version 0.10.38, Native Language Support
  Library and Tools.
      </i>. </span><span class="biblioid">
--- 241,278 ----
     model. As of this writing, it is unknown how to query to see
     if a specified message catalog exists using the gettext
     package.
!    </p></li></ul></div></div><div class="bibliography"><div class="titlepage"><div><div><h3 class="title"><a id="facet.messages.biblio"></a>Bibliography</h3></div></div></div><div class="biblioentry"><a id="id413448"></a><p><span class="title"><i>
        The GNU C Library
      </i>. </span><span class="author"><span class="firstname">Roland</span> <span class="surname">McGrath</span>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2007 FSF. </span><span class="pagenums">Chapters 6 Character Set Handling, and 7 Locales and Internationalization
!     . </span></p></div><div class="biblioentry"><a id="id460385"></a><p><span class="title"><i>
        Correspondence
!     </i>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2002 . </span></p></div><div class="biblioentry"><a id="id434210"></a><p><span class="title"><i>
        ISO/IEC 14882:1998 Programming languages - C++
!     </i>. </span><span class="copyright">Copyright © 1998 ISO. </span></p></div><div class="biblioentry"><a id="id434229"></a><p><span class="title"><i>
        ISO/IEC 9899:1999 Programming languages - C
!     </i>. </span><span class="copyright">Copyright © 1999 ISO. </span></p></div><div class="biblioentry"><a id="id480692"></a><p><span class="title"><i>
        System Interface Definitions, Issue 6 (IEEE Std. 1003.1-200x)
      </i>. </span><span class="copyright">Copyright © 1999 
        The Open Group/The Institute of Electrical and Electronics Engineers, Inc.. </span><span class="biblioid">
        <a class="ulink" href="http://www.opennc.org/austin/docreg.html" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id480719"></a><p><span class="title"><i>
        The C++ Programming Language, Special Edition
      </i>. </span><span class="author"><span class="firstname">Bjarne</span> <span class="surname">Stroustrup</span>. </span><span class="copyright">Copyright © 2000 Addison Wesley, Inc.. </span><span class="pagenums">Appendix D. </span><span class="publisher"><span class="publishername">
  	Addison Wesley
!       . </span></span></p></div><div class="biblioentry"><a id="id410108"></a><p><span class="title"><i>
        Standard C++ IOStreams and Locales
      </i>. </span><span class="subtitle">
        Advanced Programmer's Guide and Reference
      . </span><span class="author"><span class="firstname">Angelika</span> <span class="surname">Langer</span>. </span><span class="author"><span class="firstname">Klaus</span> <span class="surname">Kreft</span>. </span><span class="copyright">Copyright © 2000 Addison Wesley Longman, Inc.. </span><span class="publisher"><span class="publishername">
  	Addison Wesley Longman
!       . </span></span></p></div><div class="biblioentry"><a id="id405725"></a><p><span class="title"><i>
        Java 2 Platform, Standard Edition, v 1.3.1 API Specification
      </i>. </span><span class="pagenums">java.util.Properties, java.text.MessageFormat,
  java.util.Locale, java.util.ResourceBundle. </span><span class="biblioid">
        <a class="ulink" href="http://java.sun.com/j2se/1.3/docs/api" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id421361"></a><p><span class="title"><i>
         GNU gettext tools, version 0.10.38, Native Language Support
  Library and Tools.
      </i>. </span><span class="biblioid">
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/parallel_mode.html gcc-4.3.1/libstdc++-v3/doc/html/manual/parallel_mode.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/parallel_mode.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/parallel_mode.html	Thu Apr 10 22:53:15 2008
***************
*** 4,21 ****
  implementation of many algorithms the C++ Standard Library.
  </p><p>
  Several of the standard algorithms, for instance
! <code class="code">std::sort</code>, are made parallel using OpenMP
  annotations. These parallel mode constructs and can be invoked by
  explicit source declaration or by compiling existing sources with a
  specific compiler flag.
  </p><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.parallel_mode.intro"></a>Intro</h2></div></div></div><p>The following library components in the include
! <code class="code">&lt;numeric&gt;</code> are included in the parallel mode:</p><div class="itemizedlist"><ul type="disc"><li><p><code class="code">std::accumulate</code></p></li><li><p><code class="code">std::adjacent_difference</code></p></li><li><p><code class="code">std::inner_product</code></p></li><li><p><code class="code">std::partial_sum</code></p></li></ul></div><p>The following library components in the include
! <code class="code">&lt;algorithm&gt;</code> are included in the parallel mode:</p><div class="itemizedlist"><ul type="disc"><li><p><code class="code">std::adjacent_find</code></p></li><li><p><code class="code">std::count</code></p></li><li><p><code class="code">std::count_if</code></p></li><li><p><code class="code">std::equal</code></p></li><li><p><code class="code">std::find</code></p></li><li><p><code class="code">std::find_if</code></p></li><li><p><code class="code">std::find_first_of</code></p></li><li><p><code class="code">std::for_each</code></p></li><li><p><code class="code">std::generate</code></p></li><li><p><code class="code">std::generate_n</code></p></li><li><p><code class="code">std::lexicographical_compare</code></p></li><li><p><code class="code">std::mismatch</code></p></li><li><p><code class="code">std::search</code></p></li><li><p><code class="code">std::search_n</code></p></li><li><p><code class="code">std::transform</code></p></li><li><p><code class="code">std::replace</code></p></li><li><p><code class="code">std::replace_if</code></p></li><li><p><code class="code">std::max_element</code></p></li><li><p><code class="code">std::merge</code></p></li><li><p><code class="code">std::min_element</code></p></li><li><p><code class="code">std::nth_element</code></p></li><li><p><code class="code">std::partial_sort</code></p></li><li><p><code class="code">std::partition</code></p></li><li><p><code class="code">std::random_shuffle</code></p></li><li><p><code class="code">std::set_union</code></p></li><li><p><code class="code">std::set_intersection</code></p></li><li><p><code class="code">std::set_symmetric_difference</code></p></li><li><p><code class="code">std::set_difference</code></p></li><li><p><code class="code">std::sort</code></p></li><li><p><code class="code">std::stable_sort</code></p></li><li><p><code class="code">std::unique_copy</code></p></li></ul></div><p>The following library components in the includes
! <code class="code">&lt;set&gt;</code> and <code class="code">&lt;map&gt;</code> are included in the parallel mode:</p><div class="itemizedlist"><ul type="disc"><li><p><code class="code">std::(multi_)map/set&lt;T&gt;::(multi_)map/set(Iterator begin, Iterator end)</code> (bulk construction)</p></li><li><p><code class="code">std::(multi_)map/set&lt;T&gt;::insert(Iterator begin, Iterator end)</code> (bulk insertion)</p></li></ul></div></div><div class="bibliography"><div class="titlepage"><div><div><h2 class="title"><a id="parallel_mode.biblio"></a>Bibliography</h2></div></div></div><div class="biblioentry"><a id="id343037"></a><p><span class="title"><i>
        Parallelization of Bulk Operations for STL Dictionaries
      </i>. </span><span class="author"><span class="firstname">Johannes</span> <span class="surname">Singler</span>. </span><span class="author"><span class="firstname">Leonor</span> <span class="surname">Frias</span>. </span><span class="copyright">Copyright © 2007 . </span><span class="publisher"><span class="publishername">
  	Workshop on Highly Parallel Processing on a Chip (HPPC) 2007. (LNCS)
!       . </span></span></p></div><div class="biblioentry"><a id="id343084"></a><p><span class="title"><i>
        The Multi-Core Standard Template Library
      </i>. </span><span class="author"><span class="firstname">Johannes</span> <span class="surname">Singler</span>. </span><span class="author"><span class="firstname">Peter</span> <span class="surname">Sanders</span>. </span><span class="author"><span class="firstname">Felix</span> <span class="surname">Putze</span>. </span><span class="copyright">Copyright © 2007 . </span><span class="publisher"><span class="publishername">
  	 Euro-Par 2007: Parallel Processing. (LNCS 4641)
--- 4,20 ----
  implementation of many algorithms the C++ Standard Library.
  </p><p>
  Several of the standard algorithms, for instance
! <code class="function">std::sort</code>, are made parallel using OpenMP
  annotations. These parallel mode constructs and can be invoked by
  explicit source declaration or by compiling existing sources with a
  specific compiler flag.
  </p><div class="sect1" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.parallel_mode.intro"></a>Intro</h2></div></div></div><p>The following library components in the include
! <code class="filename">numeric</code> are included in the parallel mode:</p><div class="itemizedlist"><ul type="disc"><li><p><code class="function">std::accumulate</code></p></li><li><p><code class="function">std::adjacent_difference</code></p></li><li><p><code class="function">std::inner_product</code></p></li><li><p><code class="function">std::partial_sum</code></p></li></ul></div><p>The following library components in the include
! <code class="filename">algorithm</code> are included in the parallel mode:</p><div class="itemizedlist"><ul type="disc"><li><p><code class="function">std::adjacent_find</code></p></li><li><p><code class="function">std::count</code></p></li><li><p><code class="function">std::count_if</code></p></li><li><p><code class="function">std::equal</code></p></li><li><p><code class="function">std::find</code></p></li><li><p><code class="function">std::find_if</code></p></li><li><p><code class="function">std::find_first_of</code></p></li><li><p><code class="function">std::for_each</code></p></li><li><p><code class="function">std::generate</code></p></li><li><p><code class="function">std::generate_n</code></p></li><li><p><code class="function">std::lexicographical_compare</code></p></li><li><p><code class="function">std::mismatch</code></p></li><li><p><code class="function">std::search</code></p></li><li><p><code class="function">std::search_n</code></p></li><li><p><code class="function">std::transform</code></p></li><li><p><code class="function">std::replace</code></p></li><li><p><code class="function">std::replace_if</code></p></li><li><p><code class="function">std::max_element</code></p></li><li><p><code class="function">std::merge</code></p></li><li><p><code class="function">std::min_element</code></p></li><li><p><code class="function">std::nth_element</code></p></li><li><p><code class="function">std::partial_sort</code></p></li><li><p><code class="function">std::partition</code></p></li><li><p><code class="function">std::random_shuffle</code></p></li><li><p><code class="function">std::set_union</code></p></li><li><p><code class="function">std::set_intersection</code></p></li><li><p><code class="function">std::set_symmetric_difference</code></p></li><li><p><code class="function">std::set_difference</code></p></li><li><p><code class="function">std::sort</code></p></li><li><p><code class="function">std::stable_sort</code></p></li><li><p><code class="function">std::unique_copy</code></p></li></ul></div></div><div class="bibliography"><div class="titlepage"><div><div><h2 class="title"><a id="parallel_mode.biblio"></a>Bibliography</h2></div></div></div><div class="biblioentry"><a id="id459041"></a><p><span class="title"><i>
        Parallelization of Bulk Operations for STL Dictionaries
      </i>. </span><span class="author"><span class="firstname">Johannes</span> <span class="surname">Singler</span>. </span><span class="author"><span class="firstname">Leonor</span> <span class="surname">Frias</span>. </span><span class="copyright">Copyright © 2007 . </span><span class="publisher"><span class="publishername">
  	Workshop on Highly Parallel Processing on a Chip (HPPC) 2007. (LNCS)
!       . </span></span></p></div><div class="biblioentry"><a id="id484021"></a><p><span class="title"><i>
        The Multi-Core Standard Template Library
      </i>. </span><span class="author"><span class="firstname">Johannes</span> <span class="surname">Singler</span>. </span><span class="author"><span class="firstname">Peter</span> <span class="surname">Sanders</span>. </span><span class="author"><span class="firstname">Felix</span> <span class="surname">Putze</span>. </span><span class="copyright">Copyright © 2007 . </span><span class="publisher"><span class="publishername">
  	 Euro-Par 2007: Parallel Processing. (LNCS 4641)
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/shared_ptr.html gcc-4.3.1/libstdc++-v3/doc/html/manual/shared_ptr.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/shared_ptr.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/shared_ptr.html	Thu Apr 10 22:53:15 2008
*************** drops to zero.
*** 29,35 ****
  Derived classes override those functions to destroy resources in a context
  where the correct dynamic type is known. This is an application of the
  technique known as type erasure.
!   </p></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="shared_ptr.impl"></a>Implementation</h3></div></div></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id461761"></a>Class Hierarchy</h4></div></div></div><p>
  A <code class="classname">shared_ptr&lt;T&gt;</code> contains a pointer of
  type <span class="type">T*</span> and an object of type
  <code class="classname">__shared_count</code>. The shared_count contains a
--- 29,35 ----
  Derived classes override those functions to destroy resources in a context
  where the correct dynamic type is known. This is an application of the
  technique known as type erasure.
!   </p></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="shared_ptr.impl"></a>Implementation</h3></div></div></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id407519"></a>Class Hierarchy</h4></div></div></div><p>
  A <code class="classname">shared_ptr&lt;T&gt;</code> contains a pointer of
  type <span class="type">T*</span> and an object of type
  <code class="classname">__shared_count</code>. The shared_count contains a
*************** be forwarded to <span class="type">Tp</s
*** 71,77 ****
  Unlike the other <code class="classname">_Sp_counted_*</code> classes, this one is parameterized on the
  type of object, not the type of pointer; this is purely a convenience
  that simplifies the implementation slightly.
!     </p></dd></dl></div></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id360970"></a>Thread Safety</h4></div></div></div><p>
  The interface of <code class="classname">tr1::shared_ptr</code> was extended for C++0x
  with support for rvalue-references and the other features from
  N2351. As with other libstdc++ headers shared by TR1 and C++0x,
--- 71,77 ----
  Unlike the other <code class="classname">_Sp_counted_*</code> classes, this one is parameterized on the
  type of object, not the type of pointer; this is purely a convenience
  that simplifies the implementation slightly.
!     </p></dd></dl></div></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id419862"></a>Thread Safety</h4></div></div></div><p>
  The interface of <code class="classname">tr1::shared_ptr</code> was extended for C++0x
  with support for rvalue-references and the other features from
  N2351. As with other libstdc++ headers shared by TR1 and C++0x,
*************** compiler, standard library, platform etc
*** 129,135 ****
  shared_ptr in libstdc++ the compiler and library are fixed, which
  makes things much simpler: we have an atomic CAS or we don't, see Lock
  Policy below for details.
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id396141"></a>Selecting Lock Policy</h4></div></div></div><p> 
      </p><p>
  There is a single <code class="classname">_Sp_counted_base</code> class,
  which is a template parameterized on the enum
--- 129,135 ----
  shared_ptr in libstdc++ the compiler and library are fixed, which
  makes things much simpler: we have an atomic CAS or we don't, see Lock
  Policy below for details.
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id395234"></a>Selecting Lock Policy</h4></div></div></div><p> 
      </p><p>
  There is a single <code class="classname">_Sp_counted_base</code> class,
  which is a template parameterized on the enum
*************** used when libstdc++ is built without <co
*** 170,176 ****
         <code class="filename">ext/atomicity.h</code>, which detect if the program
         is multi-threaded.  If only one thread of execution exists in
         the program then less expensive non-atomic operations are used.
!      </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id420953"></a>Dual C++0x and TR1 Implementation</h4></div></div></div><p>
  The classes derived from <code class="classname">_Sp_counted_base</code> (see Class Hierarchy
  below) and <code class="classname">__shared_count</code> are implemented separately for C++0x
  and TR1, in <code class="filename">bits/boost_sp_shared_count.h</code> and
--- 170,176 ----
         <code class="filename">ext/atomicity.h</code>, which detect if the program
         is multi-threaded.  If only one thread of execution exists in
         the program then less expensive non-atomic operations are used.
!      </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id427440"></a>Dual C++0x and TR1 Implementation</h4></div></div></div><p>
  The classes derived from <code class="classname">_Sp_counted_base</code> (see Class Hierarchy
  below) and <code class="classname">__shared_count</code> are implemented separately for C++0x
  and TR1, in <code class="filename">bits/boost_sp_shared_count.h</code> and
*************** The TR1 implementation is considered rel
*** 181,187 ****
  change unless bug fixes require it.  If the code that is common to both
  C++0x and TR1 modes needs to diverge further then it might be necessary to 
  duplicate additional classes and only make changes to the C++0x versions.
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id454146"></a>Related functions and classes</h4></div></div></div><div class="variablelist"><dl><dt><span class="term"><code class="code">dynamic_pointer_cast</code>, <code class="code">static_pointer_cast</code>,
  <code class="code">const_pointer_cast</code></span></dt><dd><p>
  As noted in N2351, these functions can be implemented non-intrusively using
  the alias constructor.  However the aliasing constructor is only available
--- 181,187 ----
  change unless bug fixes require it.  If the code that is common to both
  C++0x and TR1 modes needs to diverge further then it might be necessary to 
  duplicate additional classes and only make changes to the C++0x versions.
! </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id420169"></a>Related functions and classes</h4></div></div></div><div class="variablelist"><dl><dt><span class="term"><code class="code">dynamic_pointer_cast</code>, <code class="code">static_pointer_cast</code>,
  <code class="code">const_pointer_cast</code></span></dt><dd><p>
  As noted in N2351, these functions can be implemented non-intrusively using
  the alias constructor.  However the aliasing constructor is only available
*************** is called.  Users should not try to use 
*** 214,223 ****
  As well as the extra constructors, this implementation also needs some
  members of _Sp_counted_deleter to be protected where they could otherwise
  be private.
!     </p></dd></dl></div></div></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="shared_ptr.using"></a>Use</h3></div></div></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id404984"></a>Examples</h4></div></div></div><p> 
        Examples of use can be found in the testsuite, under
        <code class="filename">testsuite/tr1/2_general_utilities/shared_ptr</code>.
!     </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id398405"></a>Unresolved Issues</h4></div></div></div><p> 
        The resolution to C++ Standard Library issue <a class="ulink" href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#674" target="_top">674</a>,
        "shared_ptr interface changes for consistency with N1856" will
        need to be implemented after it is accepted into the working
--- 214,223 ----
  As well as the extra constructors, this implementation also needs some
  members of _Sp_counted_deleter to be protected where they could otherwise
  be private.
!     </p></dd></dl></div></div></div><div class="sect2" lang="en" xml:lang="en"><div class="titlepage"><div><div><h3 class="title"><a id="shared_ptr.using"></a>Use</h3></div></div></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id457752"></a>Examples</h4></div></div></div><p> 
        Examples of use can be found in the testsuite, under
        <code class="filename">testsuite/tr1/2_general_utilities/shared_ptr</code>.
!     </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="id457768"></a>Unresolved Issues</h4></div></div></div><p> 
        The resolution to C++ Standard Library issue <a class="ulink" href="http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#674" target="_top">674</a>,
        "shared_ptr interface changes for consistency with N1856" will
        need to be implemented after it is accepted into the working
*************** be private.
*** 265,271 ****
      code to work with, Peter Dimov in particular for his help and
      invaluable advice on thread safety.  Phillip Jordan and Paolo
      Carlini for the lock policy implementation.
!   </p></div><div class="bibliography"><div class="titlepage"><div><div><h3 class="title"><a id="shared_ptr.biblio"></a>Bibliography</h3></div></div></div><div class="biblioentry"><a id="id485662"></a><p>[<abbr class="abbrev">
        n2351
      </abbr>] <span class="title"><i>
        Improving shared_ptr for C++0x, Revision 2
--- 265,271 ----
      code to work with, Peter Dimov in particular for his help and
      invaluable advice on thread safety.  Phillip Jordan and Paolo
      Carlini for the lock policy implementation.
!   </p></div><div class="bibliography"><div class="titlepage"><div><div><h3 class="title"><a id="shared_ptr.biblio"></a>Bibliography</h3></div></div></div><div class="biblioentry"><a id="id419191"></a><p>[<abbr class="abbrev">
        n2351
      </abbr>] <span class="title"><i>
        Improving shared_ptr for C++0x, Revision 2
*************** be private.
*** 274,280 ****
      . </span><span class="biblioid">
        <a class="ulink" href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2351.htm" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id485686"></a><p>[<abbr class="abbrev">
        n2456
      </abbr>] <span class="title"><i>
        C++ Standard Library Active Issues List (Revision R52)
--- 274,280 ----
      . </span><span class="biblioid">
        <a class="ulink" href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2351.htm" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id405886"></a><p>[<abbr class="abbrev">
        n2456
      </abbr>] <span class="title"><i>
        C++ Standard Library Active Issues List (Revision R52)
*************** be private.
*** 283,289 ****
      . </span><span class="biblioid">
        <a class="ulink" href="http://open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2456.html" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id403091"></a><p>[<abbr class="abbrev">
        n2461
      </abbr>] <span class="title"><i>
        Working Draft, Standard for Programming Language C++
--- 283,289 ----
      . </span><span class="biblioid">
        <a class="ulink" href="http://open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2456.html" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id411352"></a><p>[<abbr class="abbrev">
        n2461
      </abbr>] <span class="title"><i>
        Working Draft, Standard for Programming Language C++
*************** be private.
*** 292,298 ****
      . </span><span class="biblioid">
        <a class="ulink" href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2461.pdf" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id514547"></a><p>[<abbr class="abbrev">
        boostshared_ptr
      </abbr>] <span class="title"><i>
        Boost C++ Libraries documentation - shared_ptr class template
--- 292,298 ----
      . </span><span class="biblioid">
        <a class="ulink" href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2461.pdf" target="_top">
        </a>
!     . </span></p></div><div class="biblioentry"><a id="id400175"></a><p>[<abbr class="abbrev">
        boostshared_ptr
      </abbr>] <span class="title"><i>
        Boost C++ Libraries documentation - shared_ptr class template
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/spine.html gcc-4.3.1/libstdc++-v3/doc/html/manual/spine.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/spine.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/spine.html	Thu Apr 10 22:53:15 2008
***************
*** 2,7 ****
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
  <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>The GNU C++ Library</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="prev" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="next" href="intro.html" title="Part I. Introduction" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">The GNU C++ Library</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="../spine.html">Prev</a> </td><th width="60%" align="center"> </th><td width="20%" align="right"> <a accesskey="n" href="intro.html">Next</a></td></tr></table><hr /></div><div class="book" lang="en" xml:lang="en"><div class="titlepage"><div><div><h1 class="title"><a id="manual-index"></a>The GNU C++ Library</h1></div><div><p class="copyright">Copyright © 2008 
        <a class="ulink" href="http://fsf.org" target="_top">FSF</a>
!     </p></div><div><div class="legalnotice"><a id="id471282"></a><p>
        <a class="ulink" href="17_intro/license.html" target="_top">License</a>
!     </p></div></div></div><hr /></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><span class="part"><a href="intro.html">I. Introduction</a></span></dt><dd><dl><dt><span class="chapter"><a href="bk01pt01ch01.html">1. Status</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt01ch01.html#manual.intro.status.standard">Implementation Status</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt01ch01.html#manual.intro.status.standard.1998">C++ 1998</a></span></dt><dt><span class="sect2"><a href="bk01pt01ch01.html#manual.intro.status.standard.tr1">C++ TR1</a></span></dt><dt><span class="sect2"><a href="bk01pt01ch01.html#manual.intro.status.standard.200x">C++ 200x</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt01ch01s02.html">License</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt01ch01s02.html#manual.intro.status.license.gpl">The Code: GPL</a></span></dt><dt><span class="sect2"><a href="bk01pt01ch01s02.html#manual.intro.status.license.fdl">The Documentation: GPL, FDL</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt01ch01s03.html">Bugs</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt01ch01s03.html#manual.intro.status.bugs.impl">Implementation Bugs</a></span></dt><dt><span class="sect2"><a href="bk01pt01ch01s03.html#manual.intro.status.bugs.iso">Standard Bugs</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="bk01pt01ch02.html">2. Setup</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt01ch02.html#manual.intro.setup.configure">Configure</a></span></dt><dt><span class="sect1"><a href="build.html">Build</a></span></dt><dd><dl><dt><span class="sect2"><a href="build.html#build.prereq">Prerequisites</a></span></dt><dt><span class="sect2"><a href="build.html#build.configure">Make</a></span></dt></dl></dd><dt><span class="sect1"><a href="test.html">Test</a></span></dt><dd><dl><dt><span class="sect2"><a href="test.html#test.organization">Organization</a></span></dt><dt><span class="sect2"><a href="test.html#test.naming">Naming Conventions</a></span></dt><dt><span class="sect2"><a href="test.html#test.utils">Utilities</a></span></dt><dt><span class="sect2"><a href="test.html#test.run">Running the Testsuite</a></span></dt><dt><span class="sect2"><a href="test.html#test.new_tests">New Test Cases</a></span></dt><dt><span class="sect2"><a href="test.html#test.dejagnu">Test Harness Details</a></span></dt><dt><span class="sect2"><a href="test.html#test.future">Future</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="using.html">3. Using</a></span></dt><dd><dl><dt><span class="sect1"><a href="using.html#manual.intro.using.lib">Linking Library Binary Files</a></span></dt><dt><span class="sect1"><a href="bk01pt01ch03s02.html">Headers</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt01ch03s02.html#manual.intro.using.headers.all">Header Files</a></span></dt><dt><span class="sect2"><a href="bk01pt01ch03s02.html#manual.intro.using.headers.mixing">Mixing Headers</a></span></dt><dt><span class="sect2"><a href="bk01pt01ch03s02.html#manual.intro.using.headers.cheaders">The C Headers and <code class="code">namespace std</code></a></span></dt><dt><span class="sect2"><a href="bk01pt01ch03s02.html#manual.intro.using.headers.pre">Precompiled Headers</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt01ch03s03.html">Namespaces</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt01ch03s03.html#manual.intro.using.namespaces.all">Available Namespaces</a></span></dt><dt><span class="sect2"><a href="bk01pt01ch03s03.html#manual.intro.using.namespaces.std">namespace std</a></span></dt><dt><span class="sect2"><a href="bk01pt01ch03s03.html#manual.intro.using.namespaces.comp">Using Namespace Composition</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt01ch03s04.html">Macros</a></span></dt><dt><span class="sect1"><a href="bk01pt01ch03s05.html">Concurrency</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt01ch03s05.html#manual.intro.using.concurrency.prereq">Prerequisites</a></span></dt><dt><span class="sect2"><a href="bk01pt01ch03s05.html#manual.intro.using.concurrency.thread_safety">Thread Safety</a></span></dt><dt><span class="sect2"><a href="bk01pt01ch03s05.html#manual.intro.using.concurrency.atomics">Atomics</a></span></dt><dt><span class="sect2"><a href="bk01pt01ch03s05.html#manual.intro.using.concurrency.io">IO</a></span></dt><dt><span class="sect2"><a href="bk01pt01ch03s05.html#manual.intro.using.concurrency.containers">Containers</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt01ch03s06.html">Exception Safety</a></span></dt><dt><span class="sect1"><a href="debug.html">Debugging Support</a></span></dt><dd><dl><dt><span class="sect2"><a href="debug.html#debug.compiler">Using <span class="command"><strong>g++</strong></span></a></span></dt><dt><span class="sect2"><a href="debug.html#debug.req">Debug Versions of Library Binary Files</a></span></dt><dt><span class="sect2"><a href="debug.html#debug.memory">Memory Leak Hunting</a></span></dt><dt><span class="sect2"><a href="debug.html#debug.gdb">Using <span class="command"><strong>gdb</strong></span></a></span></dt><dt><span class="sect2"><a href="debug.html#debug.exceptions">Tracking uncaught exceptions</a></span></dt><dt><span class="sect2"><a href="debug.html#debug.debug_mode">Debug Mode</a></span></dt><dt><span class="sect2"><a href="debug.html#debug.compile_time_checks">Compile Time Checking</a></span></dt></dl></dd></dl></dd></dl></dd><dt><span class="part"><a href="support.html">II. Support</a></span></dt><dd><dl><dt><span class="preface"><a href="bk01pt02pr01.html"></a></span></dt><dt><span class="chapter"><a href="bk01pt02ch04.html">4. Types</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt02ch04.html#manual.support.types.fundamental">Fundamental Types</a></span></dt><dt><span class="sect1"><a href="bk01pt02ch04s02.html">Numeric Properties</a></span></dt><dt><span class="sect1"><a href="bk01pt02ch04s03.html">NULL</a></span></dt></dl></dd><dt><span class="chapter"><a href="bk01pt02ch05.html">5. Dynamic Memory</a></span></dt><dt><span class="chapter"><a href="bk01pt02ch06.html">6. Termination</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt02ch06.html#support.termination.handlers">Termination Handlers</a></span></dt><dt><span class="sect1"><a href="bk01pt02ch06s02.html">Verbose Terminate Handler</a></span></dt></dl></dd></dl></dd><dt><span class="part"><a href="diagnostics.html">III. Diagnostics</a></span></dt><dd><dl><dt><span class="chapter"><a href="bk01pt03ch07.html">7. Exceptions</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt03ch07.html#manual.diagnostics.exceptions.hierarchy">Exception Classes</a></span></dt><dt><span class="sect1"><a href="bk01pt03ch07s02.html">Adding Data to Exceptions</a></span></dt><dt><span class="sect1"><a href="bk01pt03ch07s03.html">Cancellation</a></span></dt></dl></dd><dt><span class="chapter"><a href="bk01pt03ch08.html">8. Concept Checking</a></span></dt></dl></dd><dt><span class="part"><a href="utilities.html">IV. Utilities</a></span></dt><dd><dl><dt><span class="chapter"><a href="bk01pt04ch09.html">9. Functors</a></span></dt><dt><span class="chapter"><a href="bk01pt04ch10.html">10. Pairs</a></span></dt><dt><span class="chapter"><a href="bk01pt04ch11.html">11. Memory</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt04ch11.html#manual.util.memory.allocator">Allocators</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt04ch11.html#allocator.req">Requirements</a></span></dt><dt><span class="sect2"><a href="bk01pt04ch11.html#allocator.design_issues">Design Issues</a></span></dt><dt><span class="sect2"><a href="bk01pt04ch11.html#allocator.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="bk01pt04ch11.html#allocator.using">Using a Specific Allocator</a></span></dt><dt><span class="sect2"><a href="bk01pt04ch11.html#allocator.custom">Custom Allocators</a></span></dt><dt><span class="sect2"><a href="bk01pt04ch11.html#allocator.ext">Extension Allocators</a></span></dt></dl></dd><dt><span class="sect1"><a href="auto_ptr.html">auto_ptr</a></span></dt><dd><dl><dt><span class="sect2"><a href="auto_ptr.html#auto_ptr.limitations">Limitations</a></span></dt><dt><span class="sect2"><a href="auto_ptr.html#auto_ptr.using">Use in Containers</a></span></dt></dl></dd><dt><span class="sect1"><a href="shared_ptr.html">shared_ptr</a></span></dt><dd><dl><dt><span class="sect2"><a href="shared_ptr.html#shared_ptr.req">Requirements</a></span></dt><dt><span class="sect2"><a href="shared_ptr.html#shared_ptr.design_issues">Design Issues</a></span></dt><dt><span class="sect2"><a href="shared_ptr.html#shared_ptr.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="shared_ptr.html#shared_ptr.using">Use</a></span></dt><dt><span class="sect2"><a href="shared_ptr.html#shared_ptr.ack">Acknowledgments</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="bk01pt04ch12.html">12. Traits</a></span></dt></dl></dd><dt><span class="part"><a href="strings.html">V. Strings</a></span></dt><dd><dl><dt><span class="chapter"><a href="bk01pt05ch13.html">13. String Classes</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt05ch13.html#strings.string.simple">Simple Transformations</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s02.html">Case Sensivitity</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s03.html">Arbitrary Character Types</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s04.html">Tokenizing</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s05.html">Shrink to Fit</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s06.html">CString (MFC)</a></span></dt></dl></dd></dl></dd><dt><span class="part"><a href="localization.html">VI. Localization</a></span></dt><dd><dl><dt><span class="chapter"><a href="bk01pt06ch14.html">14. Locales</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt06ch14.html#manual.localization.locales.locale">locale</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt06ch14.html#locales.locale.req">Requirements</a></span></dt><dt><span class="sect2"><a href="bk01pt06ch14.html#locales.locale.design">Design</a></span></dt><dt><span class="sect2"><a href="bk01pt06ch14.html#locales.locale.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="bk01pt06ch14.html#locales.locale.future">Future</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="bk01pt06ch15.html">15. Facets aka Categories</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt06ch15.html#manual.localization.facet.ctype">ctype</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt06ch15.html#facet.ctype.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="bk01pt06ch15.html#facet.ctype.future">Future</a></span></dt></dl></dd><dt><span class="sect1"><a href="codecvt.html">codecvt</a></span></dt><dd><dl><dt><span class="sect2"><a href="codecvt.html#facet.codecvt.req">Requirements</a></span></dt><dt><span class="sect2"><a href="codecvt.html#facet.codecvt.design">Design</a></span></dt><dt><span class="sect2"><a href="codecvt.html#facet.codecvt.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="codecvt.html#facet.codecvt.use">Use</a></span></dt><dt><span class="sect2"><a href="codecvt.html#facet.codecvt.future">Future</a></span></dt></dl></dd><dt><span class="sect1"><a href="messages.html">messages</a></span></dt><dd><dl><dt><span class="sect2"><a href="messages.html#facet.messages.req">Requirements</a></span></dt><dt><span class="sect2"><a href="messages.html#facet.messages.design">Design</a></span></dt><dt><span class="sect2"><a href="messages.html#facet.messages.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="messages.html#facet.messages.use">Use</a></span></dt><dt><span class="sect2"><a href="messages.html#facet.messages.future">Future</a></span></dt></dl></dd></dl></dd></dl></dd><dt><span class="part"><a href="containers.html">VII. Containers</a></span></dt><dd><dl><dt><span class="chapter"><a href="bk01pt07ch16.html">16. Sequences</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt07ch16.html#containers.sequences.list">list</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt07ch16.html#sequences.list.size">list::size() is O(n)</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt07ch16s02.html">vector</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt07ch16s02.html#sequences.vector.management">Space Overhead Management</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="bk01pt07ch17.html">17. Associative</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt07ch17.html#containers.associative.insert_hints">Insertion Hints</a></span></dt><dt><span class="sect1"><a href="bk01pt07ch17s02.html">bitset</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt07ch17s02.html#associative.bitset.size_variable">Size Variable</a></span></dt><dt><span class="sect2"><a href="bk01pt07ch17s02.html#associative.bitset.type_string">Type String</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="bk01pt07ch18.html">18. Interacting with C</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt07ch18.html#containers.c.vs_array">Containers vs. Arrays</a></span></dt></dl></dd></dl></dd><dt><span class="part"><a href="iterators.html">VIII. Iterators</a></span></dt><dd><dl><dt><span class="chapter"><a href="bk01pt08ch19.html">19. Predefined</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt08ch19.html#iterators.predefined.vs_pointers">Iterators vs. Pointers</a></span></dt><dt><span class="sect1"><a href="bk01pt08ch19s02.html">One Past the End</a></span></dt></dl></dd></dl></dd><dt><span class="part"><a href="algorithms.html">IX. Algorithms</a></span></dt><dd><dl><dt><span class="preface"><a href="bk01pt09pr02.html"></a></span></dt><dt><span class="chapter"><a href="bk01pt09ch20.html">20. Mutating</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt09ch20.html#algorithms.mutating.swap"><code class="function">swap</code></a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt09ch20.html#algorithms.swap.specializations">Specializations</a></span></dt></dl></dd></dl></dd></dl></dd><dt><span class="part"><a href="numerics.html">X. Numerics</a></span></dt><dd><dl><dt><span class="chapter"><a href="bk01pt10ch21.html">21. Complex</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt10ch21.html#numerics.complex.processing">complex Processing</a></span></dt></dl></dd><dt><span class="chapter"><a href="bk01pt10ch22.html">22. Generalized Operations</a></span></dt><dt><span class="chapter"><a href="bk01pt10ch23.html">23. Interacting with C</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt10ch23.html#numerics.c.array">Numerics vs. Arrays</a></span></dt><dt><span class="sect1"><a href="bk01pt10ch23s02.html">C99</a></span></dt></dl></dd></dl></dd><dt><span class="part"><a href="io.html">XI. Input and Output</a></span></dt><dd><dl><dt><span class="chapter"><a href="bk01pt11ch24.html">24. Iostream Objects</a></span></dt><dt><span class="chapter"><a href="bk01pt11ch25.html">25. Stream Buffers</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt11ch25.html#io.streambuf.derived">Derived streambuf Classes</a></span></dt><dt><span class="sect1"><a href="bk01pt11ch25s02.html">Buffering</a></span></dt></dl></dd><dt><span class="chapter"><a href="bk01pt11ch26.html">26. Memory Based Streams</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt11ch26.html#manual.io.memstreams.compat">Compatibility With strstream</a></span></dt></dl></dd><dt><span class="chapter"><a href="bk01pt11ch27.html">27. File Based Streams</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt11ch27.html#manual.io.filestreams.copying_a_file">Copying a File</a></span></dt><dt><span class="sect1"><a href="bk01pt11ch27s02.html">Binary Input and Output</a></span></dt><dt><span class="sect1"><a href="bk01pt11ch27s03.html">More Binary Input and Output</a></span></dt></dl></dd><dt><span class="chapter"><a href="bk01pt11ch28.html">28. Interacting with C</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt11ch28.html#manual.io.c.FILE">Using FILE* and file descriptors</a></span></dt><dt><span class="sect1"><a href="bk01pt11ch28s02.html">Performance</a></span></dt></dl></dd></dl></dd><dt><span class="part"><a href="extensions.html">XII. Extensions</a></span></dt><dd><dl><dt><span class="preface"><a href="bk01pt12pr03.html"></a></span></dt><dt><span class="chapter"><a href="bk01pt12ch29.html">29. Compile Time Checks</a></span></dt><dt><span class="chapter"><a href="debug_mode.html">30. Debug Mode</a></span></dt><dd><dl><dt><span class="sect1"><a href="debug_mode.html#manual.ext.debug_mode.intro">Intro</a></span></dt><dt><span class="sect1"><a href="bk01pt12ch30s02.html">Semantics</a></span></dt><dt><span class="sect1"><a href="bk01pt12ch30s03.html">Using</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch30s03.html#debug_mode.using.mode">Using the Debug Mode</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch30s03.html#debug_mode.using.specific">Using a Specific Debug Container</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt12ch30s04.html">Design</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch30s04.html#manual.ext.debug_mode.design.goals">Goals</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch30s04.html#manual.ext.debug_mode.design.methods">Methods</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch30s04.html#manual.ext.debug_mode.design.other">Other Implementations</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="parallel_mode.html">31. Parallel Mode</a></span></dt><dd><dl><dt><span class="sect1"><a href="parallel_mode.html#manual.ext.parallel_mode.intro">Intro</a></span></dt><dt><span class="sect1"><a href="bk01pt12ch31s02.html">Semantics</a></span></dt><dt><span class="sect1"><a href="bk01pt12ch31s03.html">Using</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch31s03.html#parallel_mode.using.parallel_mode">Using Parallel Mode</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch31s03.html#manual.ext.parallel_mode.usings">Using Specific Parallel Components</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt12ch31s04.html">Design</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch31s04.html#manual.ext.parallel_mode.design.intro">Interface Basics</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch31s04.html#manual.ext.parallel_mode.design.tuning">Configuration and Tuning</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch31s04.html#manual.ext.parallel_mode.design.impl">Implementation Namespaces</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt12ch31s05.html">Testing</a></span></dt><dt><span class="bibliography"><a href="parallel_mode.html#parallel_mode.biblio">Bibliography</a></span></dt></dl></dd><dt><span class="chapter"><a href="bk01pt12ch32.html">32. Allocators</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt12ch32.html#manual.ext.allocator.mt">mt_allocator</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch32.html#allocator.mt.intro">Intro</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch32.html#allocator.mt.design_issues">Design Issues</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch32.html#allocator.mt.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch32.html#allocator.mt.example_single">Single Thread Example</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch32.html#allocator.mt.example_multi">Multiple Thread Example</a></span></dt></dl></dd><dt><span class="sect1"><a href="bitmap_allocator.html">bitmap_allocator</a></span></dt><dd><dl><dt><span class="sect2"><a href="bitmap_allocator.html#allocator.bitmap.design">Design</a></span></dt><dt><span class="sect2"><a href="bitmap_allocator.html#allocator.bitmap.impl">Implementation</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="bk01pt12ch33.html">33. Containers</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt12ch33.html#manual.ext.containers.pbds">Policy Based Data Structures</a></span></dt><dt><span class="sect1"><a href="bk01pt12ch33s02.html">HP/SGI</a></span></dt><dt><span class="sect1"><a href="bk01pt12ch33s03.html">Deprecated HP/SGI</a></span></dt></dl></dd><dt><span class="chapter"><a href="bk01pt12ch34.html">34. Utilities</a></span></dt><dt><span class="chapter"><a href="bk01pt12ch35.html">35. Algorithms</a></span></dt><dt><span class="chapter"><a href="bk01pt12ch36.html">36. Numerics</a></span></dt><dt><span class="chapter"><a href="bk01pt12ch37.html">37. Iterators</a></span></dt><dt><span class="chapter"><a href="bk01pt12ch38.html">38. Input and Output</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt12ch38.html#manual.ext.io.filebuf_derived">Derived filebufs</a></span></dt></dl></dd><dt><span class="chapter"><a href="bk01pt12ch39.html">39. Demangling</a></span></dt><dt><span class="chapter"><a href="concurrency.html">40. Concurrency</a></span></dt><dd><dl><dt><span class="sect1"><a href="concurrency.html#manual.ext.concurrency.design">Design</a></span></dt><dd><dl><dt><span class="sect2"><a href="concurrency.html#manual.ext.concurrency.design.threads">Interface to Locks and Mutexes</a></span></dt><dt><span class="sect2"><a href="concurrency.html#manual.ext.concurrency.design.atomics">Interface to Atomic Functions</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt12ch40s02.html">Implementation</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch40s02.html#manual.ext.concurrency.impl.atomic_fallbacks">Using Builitin Atomic Functions</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch40s02.html#manual.ext.concurrency.impl.thread">Thread Abstraction</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt12ch40s03.html">Use</a></span></dt></dl></dd></dl></dd><dt><span class="appendix"><a href="appendix_contributing.html">A. Contributing</a></span></dt><dd><dl><dt><span class="sect1"><a href="appendix_contributing.html#contrib.list">Contributor Checklist</a></span></dt><dd><dl><dt><span class="sect2"><a href="appendix_contributing.html#list.reading">Reading</a></span></dt><dt><span class="sect2"><a href="appendix_contributing.html#list.copyright">Assignment</a></span></dt><dt><span class="sect2"><a href="appendix_contributing.html#list.getting">Getting Sources</a></span></dt><dt><span class="sect2"><a href="appendix_contributing.html#list.patches">Submitting Patches</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01apas02.html">Directory Layout and Source Conventions</a></span></dt><dt><span class="sect1"><a href="bk01apas03.html">Coding Style</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01apas03.html#coding_style.bad_identifiers">Bad Itentifiers</a></span></dt><dt><span class="sect2"><a href="bk01apas03.html#coding_style.example">By Example</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01apas04.html">Documentation Style</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01apas04.html#doc_style.doxygen">Doxygen</a></span></dt><dt><span class="sect2"><a href="bk01apas04.html#doc_style.docbook">Docbook</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01apas05.html">Design Notes</a></span></dt></dl></dd><dt><span class="appendix"><a href="appendix_porting.html">B. Porting and Maintenance</a></span></dt><dd><dl><dt><span class="sect1"><a href="appendix_porting.html#appendix.porting.build_hacking">Configure and Build Hacking</a></span></dt><dd><dl><dt><span class="sect2"><a href="appendix_porting.html#build_hacking.prereq">Prerequisites</a></span></dt><dt><span class="sect2"><a href="appendix_porting.html#build_hacking.map">Overview: What Comes from Where</a></span></dt><dt><span class="sect2"><a href="appendix_porting.html#build_hacking.scripts">Storing Information in non-AC files (like configure.host)</a></span></dt><dt><span class="sect2"><a href="appendix_porting.html#build_hacking.conventions">Coding and Commenting Conventions</a></span></dt><dt><span class="sect2"><a href="appendix_porting.html#build_hacking.acinclude">The acinclude.m4 layout</a></span></dt><dt><span class="sect2"><a href="appendix_porting.html#build_hacking.enable"><code class="constant">GLIBCXX_ENABLE</code>, the <code class="literal">--enable</code> maker</a></span></dt></dl></dd><dt><span class="sect1"><a href="internals.html">Porting to New Hardware or Operating Systems</a></span></dt><dd><dl><dt><span class="sect2"><a href="internals.html#internals.os">Operating System</a></span></dt><dt><span class="sect2"><a href="internals.html#internals.cpu">CPU</a></span></dt><dt><span class="sect2"><a href="internals.html#internals.char_types">Character Types</a></span></dt><dt><span class="sect2"><a href="internals.html#internals.thread_safety">Thread Safety</a></span></dt><dt><span class="sect2"><a href="internals.html#internals.numeric_limits">Numeric Limits</a></span></dt><dt><span class="sect2"><a href="internals.html#internals.libtool">Libtool</a></span></dt></dl></dd><dt><span class="sect1"><a href="abi.html">ABI Policy and Guidelines</a></span></dt><dd><dl><dt><span class="sect2"><a href="abi.html#abi.cxx_interface">The C++ Interface</a></span></dt><dt><span class="sect2"><a href="abi.html#abi.versioning">Versioning</a></span></dt><dt><span class="sect2"><a href="abi.html#abi.changes_allowed">Allowed Changes</a></span></dt><dt><span class="sect2"><a href="abi.html#abi.changes_no">Prohibited Changes</a></span></dt><dt><span class="sect2"><a href="abi.html#abi.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="abi.html#abi.testing">Testing</a></span></dt><dt><span class="sect2"><a href="abi.html#abi.issues">Outstanding Issues</a></span></dt></dl></dd><dt><span class="sect1"><a href="api.html">API Evolution and Deprecation History</a></span></dt><dd><dl><dt><span class="sect2"><a href="api.html#api.rel_300"><code class="constant">3.0</code></a></span></dt><dt><span class="sect2"><a href="api.html#api.rel_310"><code class="constant">3.1</code></a></span></dt><dt><span class="sect2"><a href="api.html#api.rel_320"><code class="constant">3.2</code></a></span></dt><dt><span class="sect2"><a href="api.html#api.rel_330"><code class="constant">3.3</code></a></span></dt><dt><span class="sect2"><a href="api.html#api.rel_340"><code class="constant">3.4</code></a></span></dt><dt><span class="sect2"><a href="api.html#api.rel_400"><code class="constant">4.0</code></a></span></dt><dt><span class="sect2"><a href="api.html#api.rel_410"><code class="constant">4.1</code></a></span></dt><dt><span class="sect2"><a href="api.html#api.rel_420"><code class="constant">4.2</code></a></span></dt><dt><span class="sect2"><a href="api.html#api.rel_430"><code class="constant">4.3</code></a></span></dt></dl></dd><dt><span class="sect1"><a href="backwards.html">Backwards Compatibility</a></span></dt><dd><dl><dt><span class="sect2"><a href="backwards.html#backwards.first">First</a></span></dt><dt><span class="sect2"><a href="backwards.html#backwards.second">Second</a></span></dt><dt><span class="sect2"><a href="backwards.html#backwards.third">Third</a></span></dt></dl></dd></dl></dd><dt><span class="appendix"><a href="appendix_free.html">C. Free Software Needs Free Documentation</a></span></dt><dt><span class="appendix"><a href="bk01apd.html">D. GNU General Public License</a></span></dt><dd><dl><dt><span class="section"><a href="bk01apd.html#gpl-1">Preamble</a></span></dt><dt><span class="section"><a href="bk01apds02.html">TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION</a></span></dt><dd><dl><dt><span class="section"><a href="bk01apds02.html#gpl-2-0">Section 0</a></span></dt><dt><span class="section"><a href="bk01apds02.html#gpl-2-1">Section 1</a></span></dt><dt><span class="section"><a href="bk01apds02.html#gpl-2-2">Section 2</a></span></dt><dt><span class="section"><a href="bk01apds02.html#gpl-2-3">Section 3</a></span></dt><dt><span class="section"><a href="bk01apds02.html#gpl-2-4">Section 4</a></span></dt><dt><span class="section"><a href="bk01apds02.html#gpl-2-5">Section 5</a></span></dt><dt><span class="section"><a href="bk01apds02.html#gpl-2-6">Section 6</a></span></dt><dt><span class="section"><a href="bk01apds02.html#gpl-2-7">Section 7</a></span></dt><dt><span class="section"><a href="bk01apds02.html#gpl-2-8">Section 8</a></span></dt><dt><span class="section"><a href="bk01apds02.html#gpl-2-9">Section 9</a></span></dt><dt><span class="section"><a href="bk01apds02.html#gpl-2-10">Section 10</a></span></dt><dt><span class="section"><a href="bk01apds02.html#gpl-2-11">NO WARRANTY Section 11</a></span></dt><dt><span class="section"><a href="bk01apds02.html#gpl-2-12">Section 12</a></span></dt></dl></dd><dt><span class="section"><a href="bk01apds03.html">How to Apply These Terms to Your New Programs</a></span></dt></dl></dd><dt><span class="appendix"><a href="bk01ape.html">E. GNU Free Documentation License</a></span></dt></dl></div><div class="list-of-tables"><p><b>List of Tables</b></p><dl><dt>1.1. <a href="bk01pt01ch01.html#id395297">C++ TR1 Implementation Status</a></dt><dt>1.2. <a href="bk01pt01ch01.html#id472768">C++ 200x Implementation Status</a></dt><dt>3.1. <a href="bk01pt01ch03s02.html#id398035">C++ 1998 Library Headers</a></dt><dt>3.2. <a href="bk01pt01ch03s02.html#id397982">C++ 1998 Library Headers for C Library Facilities</a></dt><dt>3.3. <a href="bk01pt01ch03s02.html#id399447">C++ 200x Library Headers</a></dt><dt>3.4. <a href="bk01pt01ch03s02.html#id394222">C++ 200x Library Headers for C Library Facilities</a></dt><dt>3.5. <a href="bk01pt01ch03s02.html#id485624">C++ TR1 Library Headers</a></dt><dt>3.6. <a href="bk01pt01ch03s02.html#id407403">C++ TR1 Library Headers for C Library Facilities</a></dt><dt>3.7. <a href="bk01pt01ch03s02.html#id420398">C++ ABI Headers</a></dt><dt>3.8. <a href="bk01pt01ch03s02.html#id414207">Extension Headers</a></dt><dt>3.9. <a href="bk01pt01ch03s02.html#id458275">Extension Debug Headers</a></dt><dt>3.10. <a href="bk01pt01ch03s02.html#id428288">Extension Parallel Headers</a></dt><dt>30.1. <a href="bk01pt12ch30s03.html#id400605">Debugging Containers</a></dt><dt>30.2. <a href="bk01pt12ch30s03.html#id452759">Debugging Containers C++0x</a></dt><dt>31.1. <a href="bk01pt12ch31s03.html#id419374">Parallel Algorithms</a></dt><dt>32.1. <a href="bitmap_allocator.html#id510462">Bitmap Allocator Memory Map</a></dt><dt>B.1. <a href="api.html#id456920">Extension Allocators</a></dt><dt>B.2. <a href="api.html#id408028">Extension Allocators Continued</a></dt></dl></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="../spine.html">Prev</a> </td><td width="20%" align="center"> </td><td width="40%" align="right"> <a accesskey="n" href="intro.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">The GNU C++ Library Documentation </td><td width="20%" align="center"><a accesskey="h" href="../spine.html">Home</a></td><td width="40%" align="right" valign="top"> Part I. Introduction</td></tr></table></div></body></html>
--- 2,7 ----
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
  <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>The GNU C++ Library</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="prev" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="next" href="intro.html" title="Part I. Introduction" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">The GNU C++ Library</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="../spine.html">Prev</a> </td><th width="60%" align="center"> </th><td width="20%" align="right"> <a accesskey="n" href="intro.html">Next</a></td></tr></table><hr /></div><div class="book" lang="en" xml:lang="en"><div class="titlepage"><div><div><h1 class="title"><a id="manual-index"></a>The GNU C++ Library</h1></div><div><p class="copyright">Copyright © 2008 
        <a class="ulink" href="http://fsf.org" target="_top">FSF</a>
!     </p></div><div><div class="legalnotice"><a id="id455107"></a><p>
        <a class="ulink" href="17_intro/license.html" target="_top">License</a>
!     </p></div></div></div><hr /></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><span class="part"><a href="intro.html">I. Introduction</a></span></dt><dd><dl><dt><span class="chapter"><a href="bk01pt01ch01.html">1. Status</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt01ch01.html#manual.intro.status.standard">Implementation Status</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt01ch01.html#manual.intro.status.standard.1998">C++ 1998</a></span></dt><dt><span class="sect2"><a href="bk01pt01ch01.html#manual.intro.status.standard.tr1">C++ TR1</a></span></dt><dt><span class="sect2"><a href="bk01pt01ch01.html#manual.intro.status.standard.200x">C++ 200x</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt01ch01s02.html">License</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt01ch01s02.html#manual.intro.status.license.gpl">The Code: GPL</a></span></dt><dt><span class="sect2"><a href="bk01pt01ch01s02.html#manual.intro.status.license.fdl">The Documentation: GPL, FDL</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt01ch01s03.html">Bugs</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt01ch01s03.html#manual.intro.status.bugs.impl">Implementation Bugs</a></span></dt><dt><span class="sect2"><a href="bk01pt01ch01s03.html#manual.intro.status.bugs.iso">Standard Bugs</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="bk01pt01ch02.html">2. Setup</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt01ch02.html#manual.intro.setup.configure">Configure</a></span></dt><dt><span class="sect1"><a href="build.html">Build</a></span></dt><dd><dl><dt><span class="sect2"><a href="build.html#build.prereq">Prerequisites</a></span></dt><dt><span class="sect2"><a href="build.html#build.configure">Make</a></span></dt></dl></dd><dt><span class="sect1"><a href="test.html">Test</a></span></dt><dd><dl><dt><span class="sect2"><a href="test.html#test.organization">Organization</a></span></dt><dt><span class="sect2"><a href="test.html#test.naming">Naming Conventions</a></span></dt><dt><span class="sect2"><a href="test.html#test.utils">Utilities</a></span></dt><dt><span class="sect2"><a href="test.html#test.run">Running the Testsuite</a></span></dt><dt><span class="sect2"><a href="test.html#test.new_tests">New Test Cases</a></span></dt><dt><span class="sect2"><a href="test.html#test.dejagnu">Test Harness Details</a></span></dt><dt><span class="sect2"><a href="test.html#test.future">Future</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="using.html">3. Using</a></span></dt><dd><dl><dt><span class="sect1"><a href="using.html#manual.intro.using.lib">Linking Library Binary Files</a></span></dt><dt><span class="sect1"><a href="bk01pt01ch03s02.html">Headers</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt01ch03s02.html#manual.intro.using.headers.all">Header Files</a></span></dt><dt><span class="sect2"><a href="bk01pt01ch03s02.html#manual.intro.using.headers.mixing">Mixing Headers</a></span></dt><dt><span class="sect2"><a href="bk01pt01ch03s02.html#manual.intro.using.headers.cheaders">The C Headers and <code class="code">namespace std</code></a></span></dt><dt><span class="sect2"><a href="bk01pt01ch03s02.html#manual.intro.using.headers.pre">Precompiled Headers</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt01ch03s03.html">Namespaces</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt01ch03s03.html#manual.intro.using.namespaces.all">Available Namespaces</a></span></dt><dt><span class="sect2"><a href="bk01pt01ch03s03.html#manual.intro.using.namespaces.std">namespace std</a></span></dt><dt><span class="sect2"><a href="bk01pt01ch03s03.html#manual.intro.using.namespaces.comp">Using Namespace Composition</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt01ch03s04.html">Macros</a></span></dt><dt><span class="sect1"><a href="bk01pt01ch03s05.html">Concurrency</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt01ch03s05.html#manual.intro.using.concurrency.prereq">Prerequisites</a></span></dt><dt><span class="sect2"><a href="bk01pt01ch03s05.html#manual.intro.using.concurrency.thread_safety">Thread Safety</a></span></dt><dt><span class="sect2"><a href="bk01pt01ch03s05.html#manual.intro.using.concurrency.atomics">Atomics</a></span></dt><dt><span class="sect2"><a href="bk01pt01ch03s05.html#manual.intro.using.concurrency.io">IO</a></span></dt><dt><span class="sect2"><a href="bk01pt01ch03s05.html#manual.intro.using.concurrency.containers">Containers</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt01ch03s06.html">Exception Safety</a></span></dt><dt><span class="sect1"><a href="debug.html">Debugging Support</a></span></dt><dd><dl><dt><span class="sect2"><a href="debug.html#debug.compiler">Using <span class="command"><strong>g++</strong></span></a></span></dt><dt><span class="sect2"><a href="debug.html#debug.req">Debug Versions of Library Binary Files</a></span></dt><dt><span class="sect2"><a href="debug.html#debug.memory">Memory Leak Hunting</a></span></dt><dt><span class="sect2"><a href="debug.html#debug.gdb">Using <span class="command"><strong>gdb</strong></span></a></span></dt><dt><span class="sect2"><a href="debug.html#debug.exceptions">Tracking uncaught exceptions</a></span></dt><dt><span class="sect2"><a href="debug.html#debug.debug_mode">Debug Mode</a></span></dt><dt><span class="sect2"><a href="debug.html#debug.compile_time_checks">Compile Time Checking</a></span></dt></dl></dd></dl></dd></dl></dd><dt><span class="part"><a href="support.html">II. Support</a></span></dt><dd><dl><dt><span class="preface"><a href="bk01pt02pr01.html"></a></span></dt><dt><span class="chapter"><a href="bk01pt02ch04.html">4. Types</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt02ch04.html#manual.support.types.fundamental">Fundamental Types</a></span></dt><dt><span class="sect1"><a href="bk01pt02ch04s02.html">Numeric Properties</a></span></dt><dt><span class="sect1"><a href="bk01pt02ch04s03.html">NULL</a></span></dt></dl></dd><dt><span class="chapter"><a href="bk01pt02ch05.html">5. Dynamic Memory</a></span></dt><dt><span class="chapter"><a href="bk01pt02ch06.html">6. Termination</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt02ch06.html#support.termination.handlers">Termination Handlers</a></span></dt><dt><span class="sect1"><a href="bk01pt02ch06s02.html">Verbose Terminate Handler</a></span></dt></dl></dd></dl></dd><dt><span class="part"><a href="diagnostics.html">III. Diagnostics</a></span></dt><dd><dl><dt><span class="chapter"><a href="bk01pt03ch07.html">7. Exceptions</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt03ch07.html#manual.diagnostics.exceptions.hierarchy">Exception Classes</a></span></dt><dt><span class="sect1"><a href="bk01pt03ch07s02.html">Adding Data to Exceptions</a></span></dt><dt><span class="sect1"><a href="bk01pt03ch07s03.html">Cancellation</a></span></dt></dl></dd><dt><span class="chapter"><a href="bk01pt03ch08.html">8. Concept Checking</a></span></dt></dl></dd><dt><span class="part"><a href="utilities.html">IV. Utilities</a></span></dt><dd><dl><dt><span class="chapter"><a href="bk01pt04ch09.html">9. Functors</a></span></dt><dt><span class="chapter"><a href="bk01pt04ch10.html">10. Pairs</a></span></dt><dt><span class="chapter"><a href="bk01pt04ch11.html">11. Memory</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt04ch11.html#manual.util.memory.allocator">Allocators</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt04ch11.html#allocator.req">Requirements</a></span></dt><dt><span class="sect2"><a href="bk01pt04ch11.html#allocator.design_issues">Design Issues</a></span></dt><dt><span class="sect2"><a href="bk01pt04ch11.html#allocator.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="bk01pt04ch11.html#allocator.using">Using a Specific Allocator</a></span></dt><dt><span class="sect2"><a href="bk01pt04ch11.html#allocator.custom">Custom Allocators</a></span></dt><dt><span class="sect2"><a href="bk01pt04ch11.html#allocator.ext">Extension Allocators</a></span></dt></dl></dd><dt><span class="sect1"><a href="auto_ptr.html">auto_ptr</a></span></dt><dd><dl><dt><span class="sect2"><a href="auto_ptr.html#auto_ptr.limitations">Limitations</a></span></dt><dt><span class="sect2"><a href="auto_ptr.html#auto_ptr.using">Use in Containers</a></span></dt></dl></dd><dt><span class="sect1"><a href="shared_ptr.html">shared_ptr</a></span></dt><dd><dl><dt><span class="sect2"><a href="shared_ptr.html#shared_ptr.req">Requirements</a></span></dt><dt><span class="sect2"><a href="shared_ptr.html#shared_ptr.design_issues">Design Issues</a></span></dt><dt><span class="sect2"><a href="shared_ptr.html#shared_ptr.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="shared_ptr.html#shared_ptr.using">Use</a></span></dt><dt><span class="sect2"><a href="shared_ptr.html#shared_ptr.ack">Acknowledgments</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="bk01pt04ch12.html">12. Traits</a></span></dt></dl></dd><dt><span class="part"><a href="strings.html">V. Strings</a></span></dt><dd><dl><dt><span class="chapter"><a href="bk01pt05ch13.html">13. String Classes</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt05ch13.html#strings.string.simple">Simple Transformations</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s02.html">Case Sensitivity</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s03.html">Arbitrary Character Types</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s04.html">Tokenizing</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s05.html">Shrink to Fit</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s06.html">CString (MFC)</a></span></dt></dl></dd></dl></dd><dt><span class="part"><a href="localization.html">VI. Localization</a></span></dt><dd><dl><dt><span class="chapter"><a href="bk01pt06ch14.html">14. Locales</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt06ch14.html#manual.localization.locales.locale">locale</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt06ch14.html#locales.locale.req">Requirements</a></span></dt><dt><span class="sect2"><a href="bk01pt06ch14.html#locales.locale.design">Design</a></span></dt><dt><span class="sect2"><a href="bk01pt06ch14.html#locales.locale.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="bk01pt06ch14.html#locales.locale.future">Future</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="bk01pt06ch15.html">15. Facets aka Categories</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt06ch15.html#manual.localization.facet.ctype">ctype</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt06ch15.html#facet.ctype.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="bk01pt06ch15.html#facet.ctype.future">Future</a></span></dt></dl></dd><dt><span class="sect1"><a href="codecvt.html">codecvt</a></span></dt><dd><dl><dt><span class="sect2"><a href="codecvt.html#facet.codecvt.req">Requirements</a></span></dt><dt><span class="sect2"><a href="codecvt.html#facet.codecvt.design">Design</a></span></dt><dt><span class="sect2"><a href="codecvt.html#facet.codecvt.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="codecvt.html#facet.codecvt.use">Use</a></span></dt><dt><span class="sect2"><a href="codecvt.html#facet.codecvt.future">Future</a></span></dt></dl></dd><dt><span class="sect1"><a href="messages.html">messages</a></span></dt><dd><dl><dt><span class="sect2"><a href="messages.html#facet.messages.req">Requirements</a></span></dt><dt><span class="sect2"><a href="messages.html#facet.messages.design">Design</a></span></dt><dt><span class="sect2"><a href="messages.html#facet.messages.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="messages.html#facet.messages.use">Use</a></span></dt><dt><span class="sect2"><a href="messages.html#facet.messages.future">Future</a></span></dt></dl></dd></dl></dd></dl></dd><dt><span class="part"><a href="containers.html">VII. Containers</a></span></dt><dd><dl><dt><span class="chapter"><a href="bk01pt07ch16.html">16. Sequences</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt07ch16.html#containers.sequences.list">list</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt07ch16.html#sequences.list.size">list::size() is O(n)</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt07ch16s02.html">vector</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt07ch16s02.html#sequences.vector.management">Space Overhead Management</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="bk01pt07ch17.html">17. Associative</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt07ch17.html#containers.associative.insert_hints">Insertion Hints</a></span></dt><dt><span class="sect1"><a href="bk01pt07ch17s02.html">bitset</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt07ch17s02.html#associative.bitset.size_variable">Size Variable</a></span></dt><dt><span class="sect2"><a href="bk01pt07ch17s02.html#associative.bitset.type_string">Type String</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="bk01pt07ch18.html">18. Interacting with C</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt07ch18.html#containers.c.vs_array">Containers vs. Arrays</a></span></dt></dl></dd></dl></dd><dt><span class="part"><a href="iterators.html">VIII. Iterators</a></span></dt><dd><dl><dt><span class="chapter"><a href="bk01pt08ch19.html">19. Predefined</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt08ch19.html#iterators.predefined.vs_pointers">Iterators vs. Pointers</a></span></dt><dt><span class="sect1"><a href="bk01pt08ch19s02.html">One Past the End</a></span></dt></dl></dd></dl></dd><dt><span class="part"><a href="algorithms.html">IX. Algorithms</a></span></dt><dd><dl><dt><span class="preface"><a href="bk01pt09pr02.html"></a></span></dt><dt><span class="chapter"><a href="bk01pt09ch20.html">20. Mutating</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt09ch20.html#algorithms.mutating.swap"><code class="function">swap</code></a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt09ch20.html#algorithms.swap.specializations">Specializations</a></span></dt></dl></dd></dl></dd></dl></dd><dt><span class="part"><a href="numerics.html">X. Numerics</a></span></dt><dd><dl><dt><span class="chapter"><a href="bk01pt10ch21.html">21. Complex</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt10ch21.html#numerics.complex.processing">complex Processing</a></span></dt></dl></dd><dt><span class="chapter"><a href="bk01pt10ch22.html">22. Generalized Operations</a></span></dt><dt><span class="chapter"><a href="bk01pt10ch23.html">23. Interacting with C</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt10ch23.html#numerics.c.array">Numerics vs. Arrays</a></span></dt><dt><span class="sect1"><a href="bk01pt10ch23s02.html">C99</a></span></dt></dl></dd></dl></dd><dt><span class="part"><a href="io.html">XI. Input and Output</a></span></dt><dd><dl><dt><span class="chapter"><a href="bk01pt11ch24.html">24. Iostream Objects</a></span></dt><dt><span class="chapter"><a href="bk01pt11ch25.html">25. Stream Buffers</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt11ch25.html#io.streambuf.derived">Derived streambuf Classes</a></span></dt><dt><span class="sect1"><a href="bk01pt11ch25s02.html">Buffering</a></span></dt></dl></dd><dt><span class="chapter"><a href="bk01pt11ch26.html">26. Memory Based Streams</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt11ch26.html#manual.io.memstreams.compat">Compatibility With strstream</a></span></dt></dl></dd><dt><span class="chapter"><a href="bk01pt11ch27.html">27. File Based Streams</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt11ch27.html#manual.io.filestreams.copying_a_file">Copying a File</a></span></dt><dt><span class="sect1"><a href="bk01pt11ch27s02.html">Binary Input and Output</a></span></dt><dt><span class="sect1"><a href="bk01pt11ch27s03.html">More Binary Input and Output</a></span></dt></dl></dd><dt><span class="chapter"><a href="bk01pt11ch28.html">28. Interacting with C</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt11ch28.html#manual.io.c.FILE">Using FILE* and file descriptors</a></span></dt><dt><span class="sect1"><a href="bk01pt11ch28s02.html">Performance</a></span></dt></dl></dd></dl></dd><dt><span class="part"><a href="extensions.html">XII. Extensions</a></span></dt><dd><dl><dt><span class="preface"><a href="bk01pt12pr03.html"></a></span></dt><dt><span class="chapter"><a href="bk01pt12ch29.html">29. Compile Time Checks</a></span></dt><dt><span class="chapter"><a href="debug_mode.html">30. Debug Mode</a></span></dt><dd><dl><dt><span class="sect1"><a href="debug_mode.html#manual.ext.debug_mode.intro">Intro</a></span></dt><dt><span class="sect1"><a href="bk01pt12ch30s02.html">Semantics</a></span></dt><dt><span class="sect1"><a href="bk01pt12ch30s03.html">Using</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch30s03.html#debug_mode.using.mode">Using the Debug Mode</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch30s03.html#debug_mode.using.specific">Using a Specific Debug Container</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt12ch30s04.html">Design</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch30s04.html#manual.ext.debug_mode.design.goals">Goals</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch30s04.html#manual.ext.debug_mode.design.methods">Methods</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch30s04.html#manual.ext.debug_mode.design.other">Other Implementations</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="parallel_mode.html">31. Parallel Mode</a></span></dt><dd><dl><dt><span class="sect1"><a href="parallel_mode.html#manual.ext.parallel_mode.intro">Intro</a></span></dt><dt><span class="sect1"><a href="bk01pt12ch31s02.html">Semantics</a></span></dt><dt><span class="sect1"><a href="bk01pt12ch31s03.html">Using</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch31s03.html#parallel_mode.using.parallel_mode">Using Parallel Mode</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch31s03.html#manual.ext.parallel_mode.usings">Using Specific Parallel Components</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt12ch31s04.html">Design</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch31s04.html#manual.ext.parallel_mode.design.intro">Interface Basics</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch31s04.html#manual.ext.parallel_mode.design.tuning">Configuration and Tuning</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch31s04.html#manual.ext.parallel_mode.design.impl">Implementation Namespaces</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt12ch31s05.html">Testing</a></span></dt><dt><span class="bibliography"><a href="parallel_mode.html#parallel_mode.biblio">Bibliography</a></span></dt></dl></dd><dt><span class="chapter"><a href="bk01pt12ch32.html">32. Allocators</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt12ch32.html#manual.ext.allocator.mt">mt_allocator</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch32.html#allocator.mt.intro">Intro</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch32.html#allocator.mt.design_issues">Design Issues</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch32.html#allocator.mt.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch32.html#allocator.mt.example_single">Single Thread Example</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch32.html#allocator.mt.example_multi">Multiple Thread Example</a></span></dt></dl></dd><dt><span class="sect1"><a href="bitmap_allocator.html">bitmap_allocator</a></span></dt><dd><dl><dt><span class="sect2"><a href="bitmap_allocator.html#allocator.bitmap.design">Design</a></span></dt><dt><span class="sect2"><a href="bitmap_allocator.html#allocator.bitmap.impl">Implementation</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="bk01pt12ch33.html">33. Containers</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt12ch33.html#manual.ext.containers.pbds">Policy Based Data Structures</a></span></dt><dt><span class="sect1"><a href="bk01pt12ch33s02.html">HP/SGI</a></span></dt><dt><span class="sect1"><a href="bk01pt12ch33s03.html">Deprecated HP/SGI</a></span></dt></dl></dd><dt><span class="chapter"><a href="bk01pt12ch34.html">34. Utilities</a></span></dt><dt><span class="chapter"><a href="bk01pt12ch35.html">35. Algorithms</a></span></dt><dt><span class="chapter"><a href="bk01pt12ch36.html">36. Numerics</a></span></dt><dt><span class="chapter"><a href="bk01pt12ch37.html">37. Iterators</a></span></dt><dt><span class="chapter"><a href="bk01pt12ch38.html">38. Input and Output</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt12ch38.html#manual.ext.io.filebuf_derived">Derived filebufs</a></span></dt></dl></dd><dt><span class="chapter"><a href="bk01pt12ch39.html">39. Demangling</a></span></dt><dt><span class="chapter"><a href="concurrency.html">40. Concurrency</a></span></dt><dd><dl><dt><span class="sect1"><a href="concurrency.html#manual.ext.concurrency.design">Design</a></span></dt><dd><dl><dt><span class="sect2"><a href="concurrency.html#manual.ext.concurrency.design.threads">Interface to Locks and Mutexes</a></span></dt><dt><span class="sect2"><a href="concurrency.html#manual.ext.concurrency.design.atomics">Interface to Atomic Functions</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt12ch40s02.html">Implementation</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01pt12ch40s02.html#manual.ext.concurrency.impl.atomic_fallbacks">Using Builtin Atomic Functions</a></span></dt><dt><span class="sect2"><a href="bk01pt12ch40s02.html#manual.ext.concurrency.impl.thread">Thread Abstraction</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01pt12ch40s03.html">Use</a></span></dt></dl></dd></dl></dd><dt><span class="appendix"><a href="appendix_contributing.html">A. Contributing</a></span></dt><dd><dl><dt><span class="sect1"><a href="appendix_contributing.html#contrib.list">Contributor Checklist</a></span></dt><dd><dl><dt><span class="sect2"><a href="appendix_contributing.html#list.reading">Reading</a></span></dt><dt><span class="sect2"><a href="appendix_contributing.html#list.copyright">Assignment</a></span></dt><dt><span class="sect2"><a href="appendix_contributing.html#list.getting">Getting Sources</a></span></dt><dt><span class="sect2"><a href="appendix_contributing.html#list.patches">Submitting Patches</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01apas02.html">Directory Layout and Source Conventions</a></span></dt><dt><span class="sect1"><a href="bk01apas03.html">Coding Style</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01apas03.html#coding_style.bad_identifiers">Bad Identifiers</a></span></dt><dt><span class="sect2"><a href="bk01apas03.html#coding_style.example">By Example</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01apas04.html">Documentation Style</a></span></dt><dd><dl><dt><span class="sect2"><a href="bk01apas04.html#doc_style.doxygen">Doxygen</a></span></dt><dt><span class="sect2"><a href="bk01apas04.html#doc_style.docbook">Docbook</a></span></dt></dl></dd><dt><span class="sect1"><a href="bk01apas05.html">Design Notes</a></span></dt></dl></dd><dt><span class="appendix"><a href="appendix_porting.html">B. Porting and Maintenance</a></span></dt><dd><dl><dt><span class="sect1"><a href="appendix_porting.html#appendix.porting.build_hacking">Configure and Build Hacking</a></span></dt><dd><dl><dt><span class="sect2"><a href="appendix_porting.html#build_hacking.prereq">Prerequisites</a></span></dt><dt><span class="sect2"><a href="appendix_porting.html#build_hacking.map">Overview: What Comes from Where</a></span></dt><dt><span class="sect2"><a href="appendix_porting.html#build_hacking.scripts">Storing Information in non-AC files (like configure.host)</a></span></dt><dt><span class="sect2"><a href="appendix_porting.html#build_hacking.conventions">Coding and Commenting Conventions</a></span></dt><dt><span class="sect2"><a href="appendix_porting.html#build_hacking.acinclude">The acinclude.m4 layout</a></span></dt><dt><span class="sect2"><a href="appendix_porting.html#build_hacking.enable"><code class="constant">GLIBCXX_ENABLE</code>, the <code class="literal">--enable</code> maker</a></span></dt></dl></dd><dt><span class="sect1"><a href="internals.html">Porting to New Hardware or Operating Systems</a></span></dt><dd><dl><dt><span class="sect2"><a href="internals.html#internals.os">Operating System</a></span></dt><dt><span class="sect2"><a href="internals.html#internals.cpu">CPU</a></span></dt><dt><span class="sect2"><a href="internals.html#internals.char_types">Character Types</a></span></dt><dt><span class="sect2"><a href="internals.html#internals.thread_safety">Thread Safety</a></span></dt><dt><span class="sect2"><a href="internals.html#internals.numeric_limits">Numeric Limits</a></span></dt><dt><span class="sect2"><a href="internals.html#internals.libtool">Libtool</a></span></dt></dl></dd><dt><span class="sect1"><a href="abi.html">ABI Policy and Guidelines</a></span></dt><dd><dl><dt><span class="sect2"><a href="abi.html#abi.cxx_interface">The C++ Interface</a></span></dt><dt><span class="sect2"><a href="abi.html#abi.versioning">Versioning</a></span></dt><dt><span class="sect2"><a href="abi.html#abi.changes_allowed">Allowed Changes</a></span></dt><dt><span class="sect2"><a href="abi.html#abi.changes_no">Prohibited Changes</a></span></dt><dt><span class="sect2"><a href="abi.html#abi.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="abi.html#abi.testing">Testing</a></span></dt><dt><span class="sect2"><a href="abi.html#abi.issues">Outstanding Issues</a></span></dt></dl></dd><dt><span class="sect1"><a href="api.html">API Evolution and Deprecation History</a></span></dt><dd><dl><dt><span class="sect2"><a href="api.html#api.rel_300"><code class="constant">3.0</code></a></span></dt><dt><span class="sect2"><a href="api.html#api.rel_310"><code class="constant">3.1</code></a></span></dt><dt><span class="sect2"><a href="api.html#api.rel_320"><code class="constant">3.2</code></a></span></dt><dt><span class="sect2"><a href="api.html#api.rel_330"><code class="constant">3.3</code></a></span></dt><dt><span class="sect2"><a href="api.html#api.rel_340"><code class="constant">3.4</code></a></span></dt><dt><span class="sect2"><a href="api.html#api.rel_400"><code class="constant">4.0</code></a></span></dt><dt><span class="sect2"><a href="api.html#api.rel_410"><code class="constant">4.1</code></a></span></dt><dt><span class="sect2"><a href="api.html#api.rel_420"><code class="constant">4.2</code></a></span></dt><dt><span class="sect2"><a href="api.html#api.rel_430"><code class="constant">4.3</code></a></span></dt></dl></dd><dt><span class="sect1"><a href="backwards.html">Backwards Compatibility</a></span></dt><dd><dl><dt><span class="sect2"><a href="backwards.html#backwards.first">First</a></span></dt><dt><span class="sect2"><a href="backwards.html#backwards.second">Second</a></span></dt><dt><span class="sect2"><a href="backwards.html#backwards.third">Third</a></span></dt></dl></dd></dl></dd><dt><span class="appendix"><a href="appendix_free.html">C. Free Software Needs Free Documentation</a></span></dt><dt><span class="appendix"><a href="bk01apd.html">D. GNU General Public License</a></span></dt><dd><dl><dt><span class="section"><a href="bk01apd.html#gpl-1">Preamble</a></span></dt><dt><span class="section"><a href="bk01apds02.html">TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION</a></span></dt><dd><dl><dt><span class="section"><a href="bk01apds02.html#gpl-2-0">Section 0</a></span></dt><dt><span class="section"><a href="bk01apds02.html#gpl-2-1">Section 1</a></span></dt><dt><span class="section"><a href="bk01apds02.html#gpl-2-2">Section 2</a></span></dt><dt><span class="section"><a href="bk01apds02.html#gpl-2-3">Section 3</a></span></dt><dt><span class="section"><a href="bk01apds02.html#gpl-2-4">Section 4</a></span></dt><dt><span class="section"><a href="bk01apds02.html#gpl-2-5">Section 5</a></span></dt><dt><span class="section"><a href="bk01apds02.html#gpl-2-6">Section 6</a></span></dt><dt><span class="section"><a href="bk01apds02.html#gpl-2-7">Section 7</a></span></dt><dt><span class="section"><a href="bk01apds02.html#gpl-2-8">Section 8</a></span></dt><dt><span class="section"><a href="bk01apds02.html#gpl-2-9">Section 9</a></span></dt><dt><span class="section"><a href="bk01apds02.html#gpl-2-10">Section 10</a></span></dt><dt><span class="section"><a href="bk01apds02.html#gpl-2-11">NO WARRANTY Section 11</a></span></dt><dt><span class="section"><a href="bk01apds02.html#gpl-2-12">Section 12</a></span></dt></dl></dd><dt><span class="section"><a href="bk01apds03.html">How to Apply These Terms to Your New Programs</a></span></dt></dl></dd><dt><span class="appendix"><a href="bk01ape.html">E. GNU Free Documentation License</a></span></dt></dl></div><div class="list-of-tables"><p><b>List of Tables</b></p><dl><dt>1.1. <a href="bk01pt01ch01.html#id405938">C++ TR1 Implementation Status</a></dt><dt>1.2. <a href="bk01pt01ch01.html#id428196">C++ 200x Implementation Status</a></dt><dt>3.1. <a href="bk01pt01ch03s02.html#id424211">C++ 1998 Library Headers</a></dt><dt>3.2. <a href="bk01pt01ch03s02.html#id410652">C++ 1998 Library Headers for C Library Facilities</a></dt><dt>3.3. <a href="bk01pt01ch03s02.html#id411001">C++ 200x Library Headers</a></dt><dt>3.4. <a href="bk01pt01ch03s02.html#id456739">C++ 200x Library Headers for C Library Facilities</a></dt><dt>3.5. <a href="bk01pt01ch03s02.html#id420313">C++ TR1 Library Headers</a></dt><dt>3.6. <a href="bk01pt01ch03s02.html#id362939">C++ TR1 Library Headers for C Library Facilities</a></dt><dt>3.7. <a href="bk01pt01ch03s02.html#id429435">C++ ABI Headers</a></dt><dt>3.8. <a href="bk01pt01ch03s02.html#id490019">Extension Headers</a></dt><dt>3.9. <a href="bk01pt01ch03s02.html#id421980">Extension Debug Headers</a></dt><dt>3.10. <a href="bk01pt01ch03s02.html#id362228">Extension Parallel Headers</a></dt><dt>30.1. <a href="bk01pt12ch30s03.html#id391620">Debugging Containers</a></dt><dt>30.2. <a href="bk01pt12ch30s03.html#id417569">Debugging Containers C++0x</a></dt><dt>31.1. <a href="bk01pt12ch31s03.html#id407416">Parallel Algorithms</a></dt><dt>32.1. <a href="bitmap_allocator.html#id362834">Bitmap Allocator Memory Map</a></dt><dt>B.1. <a href="api.html#id521812">Extension Allocators</a></dt><dt>B.2. <a href="api.html#id422487">Extension Allocators Continued</a></dt></dl></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="../spine.html">Prev</a> </td><td width="20%" align="center"> </td><td width="40%" align="right"> <a accesskey="n" href="intro.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">The GNU C++ Library Documentation </td><td width="20%" align="center"><a accesskey="h" href="../spine.html">Home</a></td><td width="40%" align="right" valign="top"> Part I. Introduction</td></tr></table></div></body></html>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/strings.html gcc-4.3.1/libstdc++-v3/doc/html/manual/strings.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/strings.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/strings.html	Thu Apr 10 22:53:15 2008
***************
*** 1,3 ****
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Part V. Strings</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="spine.html" title="The GNU C++ Library" /><link rel="prev" href="shared_ptr.html" title="shared_ptr" /><link rel="next" href="bk01pt05ch13.html" title="Chapter 13. String Classes" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Part V. Strings</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="shared_ptr.html">Prev</a> </td><th width="60%" align="center">The GNU C++ Library</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt05ch13.html">Next</a></td></tr></table><hr /></div><div class="part" lang="en" xml:lang="en"><div class="titlepage"><div><div><h1 class="title"><a id="manual.strings"></a>Part V. Strings</h1></div></div></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><span class="chapter"><a href="bk01pt05ch13.html">13. String Classes</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt05ch13.html#strings.string.simple">Simple Transformations</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s02.html">Case Sensivitity</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s03.html">Arbitrary Character Types</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s04.html">Tokenizing</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s05.html">Shrink to Fit</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s06.html">CString (MFC)</a></span></dt></dl></dd></dl></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="shared_ptr.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="spine.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="bk01pt05ch13.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">shared_ptr </td><td width="20%" align="center"><a accesskey="h" href="../spine.html">Home</a></td><td width="40%" align="right" valign="top"> Chapter 13. String Classes</td></tr></table></div></body></html>
--- 1,3 ----
  <?xml version="1.0" encoding="UTF-8" standalone="no"?>
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
! <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Part V. Strings</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><meta name="keywords" content="&#10;      ISO C++&#10;    , &#10;      library&#10;    " /><link rel="start" href="../spine.html" title="The GNU C++ Library Documentation" /><link rel="up" href="spine.html" title="The GNU C++ Library" /><link rel="prev" href="shared_ptr.html" title="shared_ptr" /><link rel="next" href="bk01pt05ch13.html" title="Chapter 13. String Classes" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Part V. Strings</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="shared_ptr.html">Prev</a> </td><th width="60%" align="center">The GNU C++ Library</th><td width="20%" align="right"> <a accesskey="n" href="bk01pt05ch13.html">Next</a></td></tr></table><hr /></div><div class="part" lang="en" xml:lang="en"><div class="titlepage"><div><div><h1 class="title"><a id="manual.strings"></a>Part V. Strings</h1></div></div></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><span class="chapter"><a href="bk01pt05ch13.html">13. String Classes</a></span></dt><dd><dl><dt><span class="sect1"><a href="bk01pt05ch13.html#strings.string.simple">Simple Transformations</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s02.html">Case Sensitivity</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s03.html">Arbitrary Character Types</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s04.html">Tokenizing</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s05.html">Shrink to Fit</a></span></dt><dt><span class="sect1"><a href="bk01pt05ch13s06.html">CString (MFC)</a></span></dt></dl></dd></dl></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="shared_ptr.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="spine.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="bk01pt05ch13.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">shared_ptr </td><td width="20%" align="center"><a accesskey="h" href="../spine.html">Home</a></td><td width="40%" align="right" valign="top"> Chapter 13. String Classes</td></tr></table></div></body></html>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/manual/test.html gcc-4.3.1/libstdc++-v3/doc/html/manual/test.html
*** gcc-4.3.0/libstdc++-v3/doc/html/manual/test.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/manual/test.html	Thu Apr 10 22:53:15 2008
*************** runtest --tool libstdc++ --srcdir=/path/
*** 293,299 ****
  	 <span class="emphasis"><em>testsuite_thread</em></span>
         </p><p> 
  	 This file indicates that the host system can run tests which
! 	 incolved multiple threads.
         </p></li><li><p>
  	 <span class="emphasis"><em>testsuite_wchar_t</em></span>
         </p><p> 
--- 293,299 ----
  	 <span class="emphasis"><em>testsuite_thread</em></span>
         </p><p> 
  	 This file indicates that the host system can run tests which
! 	 involved multiple threads.
         </p></li><li><p>
  	 <span class="emphasis"><em>testsuite_wchar_t</em></span>
         </p><p> 
*************** runtest --tool libstdc++ --srcdir=/path/
*** 324,330 ****
       flux.
     </p><p>
        We are interested in any strange failures of the testsuite;
!       please email the main libstdc++ mainling list if you see
        something odd or have questions.
     </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="test.run.permutations"></a>Test Permutations</h4></div></div></div><p>
        To run the libstdc++ test suite under the <a class="link" href="debug_mode.html" title="Chapter 30. Debug Mode">debug mode</a>, edit
--- 324,330 ----
       flux.
     </p><p>
        We are interested in any strange failures of the testsuite;
!       please email the main libstdc++ mailing list if you see
        something odd or have questions.
     </p></div><div class="sect3" lang="en" xml:lang="en"><div class="titlepage"><div><div><h4 class="title"><a id="test.run.permutations"></a>Test Permutations</h4></div></div></div><p>
        To run the libstdc++ test suite under the <a class="link" href="debug_mode.html" title="Chapter 30. Debug Mode">debug mode</a>, edit
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/html/spine.html gcc-4.3.1/libstdc++-v3/doc/html/spine.html
*** gcc-4.3.0/libstdc++-v3/doc/html/spine.html	Tue Feb 12 02:39:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/html/spine.html	Thu Apr 10 22:53:15 2008
***************
*** 2,5 ****
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
  <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>The GNU C++ Library Documentation</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><link rel="start" href="spine.html" title="The GNU C++ Library Documentation" /><link rel="next" href="manual/spine.html" title="The GNU C++ Library" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">The GNU C++ Library Documentation</th></tr><tr><td width="20%" align="left"> </td><th width="60%" align="center"> </th><td width="20%" align="right"> <a accesskey="n" href="manual/spine.html">Next</a></td></tr></table><hr /></div><div class="set" lang="en" xml:lang="en"><div class="titlepage"><div><div><h1 class="title"><a id="set-index"></a>The GNU C++ Library Documentation</h1></div><div><div class="authorgroup"><div class="author"><h3 class="author"><span class="firstname">Paolo</span> <span class="surname">Carlini</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Phil</span> <span class="surname">Edwards</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Doug</span> <span class="surname">Gregor</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Benjamin</span> <span class="surname">Kosnik</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Dhruv</span> <span class="surname">Matani</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Jason</span> <span class="surname">Merrill</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Mark</span> <span class="surname">Mitchell</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Nathan</span> <span class="surname">Myers</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Felix</span> <span class="surname">Natter</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Stefan</span> <span class="surname">Olsson</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Johannes</span> <span class="surname">Singler</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Ami</span> <span class="surname">Tavory</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Jonathan</span> <span class="surname">Wakely</span></h3></div></div></div><div><p class="copyright">Copyright © 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 
        <a class="ulink" href="http://fsf.org" target="_top">FSF</a>
!     </p></div></div><hr /></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><span class="book"><a href="manual/spine.html">The GNU C++ Library</a></span></dt><dd><dl><dt><span class="part"><a href="manual/intro.html">I. Introduction</a></span></dt><dd><dl><dt><span class="chapter"><a href="manual/bk01pt01ch01.html">1. Status</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt01ch01.html#manual.intro.status.standard">Implementation Status</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt01ch01.html#manual.intro.status.standard.1998">C++ 1998</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch01.html#manual.intro.status.standard.tr1">C++ TR1</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch01.html#manual.intro.status.standard.200x">C++ 200x</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01pt01ch01s02.html">License</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt01ch01s02.html#manual.intro.status.license.gpl">The Code: GPL</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch01s02.html#manual.intro.status.license.fdl">The Documentation: GPL, FDL</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01pt01ch01s03.html">Bugs</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt01ch01s03.html#manual.intro.status.bugs.impl">Implementation Bugs</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch01s03.html#manual.intro.status.bugs.iso">Standard Bugs</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="manual/bk01pt01ch02.html">2. Setup</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt01ch02.html#manual.intro.setup.configure">Configure</a></span></dt><dt><span class="sect1"><a href="manual/build.html">Build</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/build.html#build.prereq">Prerequisites</a></span></dt><dt><span class="sect2"><a href="manual/build.html#build.configure">Make</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/test.html">Test</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/test.html#test.organization">Organization</a></span></dt><dt><span class="sect2"><a href="manual/test.html#test.naming">Naming Conventions</a></span></dt><dt><span class="sect2"><a href="manual/test.html#test.utils">Utilities</a></span></dt><dt><span class="sect2"><a href="manual/test.html#test.run">Running the Testsuite</a></span></dt><dt><span class="sect2"><a href="manual/test.html#test.new_tests">New Test Cases</a></span></dt><dt><span class="sect2"><a href="manual/test.html#test.dejagnu">Test Harness Details</a></span></dt><dt><span class="sect2"><a href="manual/test.html#test.future">Future</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="manual/using.html">3. Using</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/using.html#manual.intro.using.lib">Linking Library Binary Files</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt01ch03s02.html">Headers</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt01ch03s02.html#manual.intro.using.headers.all">Header Files</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch03s02.html#manual.intro.using.headers.mixing">Mixing Headers</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch03s02.html#manual.intro.using.headers.cheaders">The C Headers and <code class="code">namespace std</code></a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch03s02.html#manual.intro.using.headers.pre">Precompiled Headers</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01pt01ch03s03.html">Namespaces</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt01ch03s03.html#manual.intro.using.namespaces.all">Available Namespaces</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch03s03.html#manual.intro.using.namespaces.std">namespace std</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch03s03.html#manual.intro.using.namespaces.comp">Using Namespace Composition</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01pt01ch03s04.html">Macros</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt01ch03s05.html">Concurrency</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt01ch03s05.html#manual.intro.using.concurrency.prereq">Prerequisites</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch03s05.html#manual.intro.using.concurrency.thread_safety">Thread Safety</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch03s05.html#manual.intro.using.concurrency.atomics">Atomics</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch03s05.html#manual.intro.using.concurrency.io">IO</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch03s05.html#manual.intro.using.concurrency.containers">Containers</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01pt01ch03s06.html">Exception Safety</a></span></dt><dt><span class="sect1"><a href="manual/debug.html">Debugging Support</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/debug.html#debug.compiler">Using <span class="command"><strong>g++</strong></span></a></span></dt><dt><span class="sect2"><a href="manual/debug.html#debug.req">Debug Versions of Library Binary Files</a></span></dt><dt><span class="sect2"><a href="manual/debug.html#debug.memory">Memory Leak Hunting</a></span></dt><dt><span class="sect2"><a href="manual/debug.html#debug.gdb">Using <span class="command"><strong>gdb</strong></span></a></span></dt><dt><span class="sect2"><a href="manual/debug.html#debug.exceptions">Tracking uncaught exceptions</a></span></dt><dt><span class="sect2"><a href="manual/debug.html#debug.debug_mode">Debug Mode</a></span></dt><dt><span class="sect2"><a href="manual/debug.html#debug.compile_time_checks">Compile Time Checking</a></span></dt></dl></dd></dl></dd></dl></dd><dt><span class="part"><a href="manual/support.html">II. Support</a></span></dt><dd><dl><dt><span class="preface"><a href="manual/bk01pt02pr01.html"></a></span></dt><dt><span class="chapter"><a href="manual/bk01pt02ch04.html">4. Types</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt02ch04.html#manual.support.types.fundamental">Fundamental Types</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt02ch04s02.html">Numeric Properties</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt02ch04s03.html">NULL</a></span></dt></dl></dd><dt><span class="chapter"><a href="manual/bk01pt02ch05.html">5. Dynamic Memory</a></span></dt><dt><span class="chapter"><a href="manual/bk01pt02ch06.html">6. Termination</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt02ch06.html#support.termination.handlers">Termination Handlers</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt02ch06s02.html">Verbose Terminate Handler</a></span></dt></dl></dd></dl></dd><dt><span class="part"><a href="manual/diagnostics.html">III. Diagnostics</a></span></dt><dd><dl><dt><span class="chapter"><a href="manual/bk01pt03ch07.html">7. Exceptions</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt03ch07.html#manual.diagnostics.exceptions.hierarchy">Exception Classes</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt03ch07s02.html">Adding Data to Exceptions</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt03ch07s03.html">Cancellation</a></span></dt></dl></dd><dt><span class="chapter"><a href="manual/bk01pt03ch08.html">8. Concept Checking</a></span></dt></dl></dd><dt><span class="part"><a href="manual/utilities.html">IV. Utilities</a></span></dt><dd><dl><dt><span class="chapter"><a href="manual/bk01pt04ch09.html">9. Functors</a></span></dt><dt><span class="chapter"><a href="manual/bk01pt04ch10.html">10. Pairs</a></span></dt><dt><span class="chapter"><a href="manual/bk01pt04ch11.html">11. Memory</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt04ch11.html#manual.util.memory.allocator">Allocators</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt04ch11.html#allocator.req">Requirements</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt04ch11.html#allocator.design_issues">Design Issues</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt04ch11.html#allocator.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt04ch11.html#allocator.using">Using a Specific Allocator</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt04ch11.html#allocator.custom">Custom Allocators</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt04ch11.html#allocator.ext">Extension Allocators</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/auto_ptr.html">auto_ptr</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/auto_ptr.html#auto_ptr.limitations">Limitations</a></span></dt><dt><span class="sect2"><a href="manual/auto_ptr.html#auto_ptr.using">Use in Containers</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/shared_ptr.html">shared_ptr</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/shared_ptr.html#shared_ptr.req">Requirements</a></span></dt><dt><span class="sect2"><a href="manual/shared_ptr.html#shared_ptr.design_issues">Design Issues</a></span></dt><dt><span class="sect2"><a href="manual/shared_ptr.html#shared_ptr.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="manual/shared_ptr.html#shared_ptr.using">Use</a></span></dt><dt><span class="sect2"><a href="manual/shared_ptr.html#shared_ptr.ack">Acknowledgments</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="manual/bk01pt04ch12.html">12. Traits</a></span></dt></dl></dd><dt><span class="part"><a href="manual/strings.html">V. Strings</a></span></dt><dd><dl><dt><span class="chapter"><a href="manual/bk01pt05ch13.html">13. String Classes</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt05ch13.html#strings.string.simple">Simple Transformations</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt05ch13s02.html">Case Sensivitity</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt05ch13s03.html">Arbitrary Character Types</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt05ch13s04.html">Tokenizing</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt05ch13s05.html">Shrink to Fit</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt05ch13s06.html">CString (MFC)</a></span></dt></dl></dd></dl></dd><dt><span class="part"><a href="manual/localization.html">VI. Localization</a></span></dt><dd><dl><dt><span class="chapter"><a href="manual/bk01pt06ch14.html">14. Locales</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt06ch14.html#manual.localization.locales.locale">locale</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt06ch14.html#locales.locale.req">Requirements</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt06ch14.html#locales.locale.design">Design</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt06ch14.html#locales.locale.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt06ch14.html#locales.locale.future">Future</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="manual/bk01pt06ch15.html">15. Facets aka Categories</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt06ch15.html#manual.localization.facet.ctype">ctype</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt06ch15.html#facet.ctype.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt06ch15.html#facet.ctype.future">Future</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/codecvt.html">codecvt</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/codecvt.html#facet.codecvt.req">Requirements</a></span></dt><dt><span class="sect2"><a href="manual/codecvt.html#facet.codecvt.design">Design</a></span></dt><dt><span class="sect2"><a href="manual/codecvt.html#facet.codecvt.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="manual/codecvt.html#facet.codecvt.use">Use</a></span></dt><dt><span class="sect2"><a href="manual/codecvt.html#facet.codecvt.future">Future</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/messages.html">messages</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/messages.html#facet.messages.req">Requirements</a></span></dt><dt><span class="sect2"><a href="manual/messages.html#facet.messages.design">Design</a></span></dt><dt><span class="sect2"><a href="manual/messages.html#facet.messages.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="manual/messages.html#facet.messages.use">Use</a></span></dt><dt><span class="sect2"><a href="manual/messages.html#facet.messages.future">Future</a></span></dt></dl></dd></dl></dd></dl></dd><dt><span class="part"><a href="manual/containers.html">VII. Containers</a></span></dt><dd><dl><dt><span class="chapter"><a href="manual/bk01pt07ch16.html">16. Sequences</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt07ch16.html#containers.sequences.list">list</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt07ch16.html#sequences.list.size">list::size() is O(n)</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01pt07ch16s02.html">vector</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt07ch16s02.html#sequences.vector.management">Space Overhead Management</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="manual/bk01pt07ch17.html">17. Associative</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt07ch17.html#containers.associative.insert_hints">Insertion Hints</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt07ch17s02.html">bitset</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt07ch17s02.html#associative.bitset.size_variable">Size Variable</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt07ch17s02.html#associative.bitset.type_string">Type String</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="manual/bk01pt07ch18.html">18. Interacting with C</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt07ch18.html#containers.c.vs_array">Containers vs. Arrays</a></span></dt></dl></dd></dl></dd><dt><span class="part"><a href="manual/iterators.html">VIII. Iterators</a></span></dt><dd><dl><dt><span class="chapter"><a href="manual/bk01pt08ch19.html">19. Predefined</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt08ch19.html#iterators.predefined.vs_pointers">Iterators vs. Pointers</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt08ch19s02.html">One Past the End</a></span></dt></dl></dd></dl></dd><dt><span class="part"><a href="manual/algorithms.html">IX. Algorithms</a></span></dt><dd><dl><dt><span class="preface"><a href="manual/bk01pt09pr02.html"></a></span></dt><dt><span class="chapter"><a href="manual/bk01pt09ch20.html">20. Mutating</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt09ch20.html#algorithms.mutating.swap"><code class="function">swap</code></a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt09ch20.html#algorithms.swap.specializations">Specializations</a></span></dt></dl></dd></dl></dd></dl></dd><dt><span class="part"><a href="manual/numerics.html">X. Numerics</a></span></dt><dd><dl><dt><span class="chapter"><a href="manual/bk01pt10ch21.html">21. Complex</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt10ch21.html#numerics.complex.processing">complex Processing</a></span></dt></dl></dd><dt><span class="chapter"><a href="manual/bk01pt10ch22.html">22. Generalized Operations</a></span></dt><dt><span class="chapter"><a href="manual/bk01pt10ch23.html">23. Interacting with C</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt10ch23.html#numerics.c.array">Numerics vs. Arrays</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt10ch23s02.html">C99</a></span></dt></dl></dd></dl></dd><dt><span class="part"><a href="manual/io.html">XI. Input and Output</a></span></dt><dd><dl><dt><span class="chapter"><a href="manual/bk01pt11ch24.html">24. Iostream Objects</a></span></dt><dt><span class="chapter"><a href="manual/bk01pt11ch25.html">25. Stream Buffers</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt11ch25.html#io.streambuf.derived">Derived streambuf Classes</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt11ch25s02.html">Buffering</a></span></dt></dl></dd><dt><span class="chapter"><a href="manual/bk01pt11ch26.html">26. Memory Based Streams</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt11ch26.html#manual.io.memstreams.compat">Compatibility With strstream</a></span></dt></dl></dd><dt><span class="chapter"><a href="manual/bk01pt11ch27.html">27. File Based Streams</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt11ch27.html#manual.io.filestreams.copying_a_file">Copying a File</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt11ch27s02.html">Binary Input and Output</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt11ch27s03.html">More Binary Input and Output</a></span></dt></dl></dd><dt><span class="chapter"><a href="manual/bk01pt11ch28.html">28. Interacting with C</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt11ch28.html#manual.io.c.FILE">Using FILE* and file descriptors</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt11ch28s02.html">Performance</a></span></dt></dl></dd></dl></dd><dt><span class="part"><a href="manual/extensions.html">XII. Extensions</a></span></dt><dd><dl><dt><span class="preface"><a href="manual/bk01pt12pr03.html"></a></span></dt><dt><span class="chapter"><a href="manual/bk01pt12ch29.html">29. Compile Time Checks</a></span></dt><dt><span class="chapter"><a href="manual/debug_mode.html">30. Debug Mode</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/debug_mode.html#manual.ext.debug_mode.intro">Intro</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt12ch30s02.html">Semantics</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt12ch30s03.html">Using</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt12ch30s03.html#debug_mode.using.mode">Using the Debug Mode</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt12ch30s03.html#debug_mode.using.specific">Using a Specific Debug Container</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01pt12ch30s04.html">Design</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt12ch30s04.html#manual.ext.debug_mode.design.goals">Goals</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt12ch30s04.html#manual.ext.debug_mode.design.methods">Methods</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt12ch30s04.html#manual.ext.debug_mode.design.other">Other Implementations</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="manual/parallel_mode.html">31. Parallel Mode</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/parallel_mode.html#manual.ext.parallel_mode.intro">Intro</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt12ch31s02.html">Semantics</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt12ch31s03.html">Using</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt12ch31s03.html#parallel_mode.using.parallel_mode">Using Parallel Mode</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt12ch31s03.html#manual.ext.parallel_mode.usings">Using Specific Parallel Components</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01pt12ch31s04.html">Design</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt12ch31s04.html#manual.ext.parallel_mode.design.intro">Interface Basics</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt12ch31s04.html#manual.ext.parallel_mode.design.tuning">Configuration and Tuning</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt12ch31s04.html#manual.ext.parallel_mode.design.impl">Implementation Namespaces</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01pt12ch31s05.html">Testing</a></span></dt><dt><span class="bibliography"><a href="manual/parallel_mode.html#parallel_mode.biblio">Bibliography</a></span></dt></dl></dd><dt><span class="chapter"><a href="manual/bk01pt12ch32.html">32. Allocators</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt12ch32.html#manual.ext.allocator.mt">mt_allocator</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt12ch32.html#allocator.mt.intro">Intro</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt12ch32.html#allocator.mt.design_issues">Design Issues</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt12ch32.html#allocator.mt.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt12ch32.html#allocator.mt.example_single">Single Thread Example</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt12ch32.html#allocator.mt.example_multi">Multiple Thread Example</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bitmap_allocator.html">bitmap_allocator</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bitmap_allocator.html#allocator.bitmap.design">Design</a></span></dt><dt><span class="sect2"><a href="manual/bitmap_allocator.html#allocator.bitmap.impl">Implementation</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="manual/bk01pt12ch33.html">33. Containers</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt12ch33.html#manual.ext.containers.pbds">Policy Based Data Structures</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt12ch33s02.html">HP/SGI</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt12ch33s03.html">Deprecated HP/SGI</a></span></dt></dl></dd><dt><span class="chapter"><a href="manual/bk01pt12ch34.html">34. Utilities</a></span></dt><dt><span class="chapter"><a href="manual/bk01pt12ch35.html">35. Algorithms</a></span></dt><dt><span class="chapter"><a href="manual/bk01pt12ch36.html">36. Numerics</a></span></dt><dt><span class="chapter"><a href="manual/bk01pt12ch37.html">37. Iterators</a></span></dt><dt><span class="chapter"><a href="manual/bk01pt12ch38.html">38. Input and Output</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt12ch38.html#manual.ext.io.filebuf_derived">Derived filebufs</a></span></dt></dl></dd><dt><span class="chapter"><a href="manual/bk01pt12ch39.html">39. Demangling</a></span></dt><dt><span class="chapter"><a href="manual/concurrency.html">40. Concurrency</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/concurrency.html#manual.ext.concurrency.design">Design</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/concurrency.html#manual.ext.concurrency.design.threads">Interface to Locks and Mutexes</a></span></dt><dt><span class="sect2"><a href="manual/concurrency.html#manual.ext.concurrency.design.atomics">Interface to Atomic Functions</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01pt12ch40s02.html">Implementation</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt12ch40s02.html#manual.ext.concurrency.impl.atomic_fallbacks">Using Builitin Atomic Functions</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt12ch40s02.html#manual.ext.concurrency.impl.thread">Thread Abstraction</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01pt12ch40s03.html">Use</a></span></dt></dl></dd></dl></dd><dt><span class="appendix"><a href="manual/appendix_contributing.html">A. Contributing</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/appendix_contributing.html#contrib.list">Contributor Checklist</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/appendix_contributing.html#list.reading">Reading</a></span></dt><dt><span class="sect2"><a href="manual/appendix_contributing.html#list.copyright">Assignment</a></span></dt><dt><span class="sect2"><a href="manual/appendix_contributing.html#list.getting">Getting Sources</a></span></dt><dt><span class="sect2"><a href="manual/appendix_contributing.html#list.patches">Submitting Patches</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01apas02.html">Directory Layout and Source Conventions</a></span></dt><dt><span class="sect1"><a href="manual/bk01apas03.html">Coding Style</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01apas03.html#coding_style.bad_identifiers">Bad Itentifiers</a></span></dt><dt><span class="sect2"><a href="manual/bk01apas03.html#coding_style.example">By Example</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01apas04.html">Documentation Style</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01apas04.html#doc_style.doxygen">Doxygen</a></span></dt><dt><span class="sect2"><a href="manual/bk01apas04.html#doc_style.docbook">Docbook</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01apas05.html">Design Notes</a></span></dt></dl></dd><dt><span class="appendix"><a href="manual/appendix_porting.html">B. Porting and Maintenance</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/appendix_porting.html#appendix.porting.build_hacking">Configure and Build Hacking</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/appendix_porting.html#build_hacking.prereq">Prerequisites</a></span></dt><dt><span class="sect2"><a href="manual/appendix_porting.html#build_hacking.map">Overview: What Comes from Where</a></span></dt><dt><span class="sect2"><a href="manual/appendix_porting.html#build_hacking.scripts">Storing Information in non-AC files (like configure.host)</a></span></dt><dt><span class="sect2"><a href="manual/appendix_porting.html#build_hacking.conventions">Coding and Commenting Conventions</a></span></dt><dt><span class="sect2"><a href="manual/appendix_porting.html#build_hacking.acinclude">The acinclude.m4 layout</a></span></dt><dt><span class="sect2"><a href="manual/appendix_porting.html#build_hacking.enable"><code class="constant">GLIBCXX_ENABLE</code>, the <code class="literal">--enable</code> maker</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/internals.html">Porting to New Hardware or Operating Systems</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/internals.html#internals.os">Operating System</a></span></dt><dt><span class="sect2"><a href="manual/internals.html#internals.cpu">CPU</a></span></dt><dt><span class="sect2"><a href="manual/internals.html#internals.char_types">Character Types</a></span></dt><dt><span class="sect2"><a href="manual/internals.html#internals.thread_safety">Thread Safety</a></span></dt><dt><span class="sect2"><a href="manual/internals.html#internals.numeric_limits">Numeric Limits</a></span></dt><dt><span class="sect2"><a href="manual/internals.html#internals.libtool">Libtool</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/abi.html">ABI Policy and Guidelines</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/abi.html#abi.cxx_interface">The C++ Interface</a></span></dt><dt><span class="sect2"><a href="manual/abi.html#abi.versioning">Versioning</a></span></dt><dt><span class="sect2"><a href="manual/abi.html#abi.changes_allowed">Allowed Changes</a></span></dt><dt><span class="sect2"><a href="manual/abi.html#abi.changes_no">Prohibited Changes</a></span></dt><dt><span class="sect2"><a href="manual/abi.html#abi.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="manual/abi.html#abi.testing">Testing</a></span></dt><dt><span class="sect2"><a href="manual/abi.html#abi.issues">Outstanding Issues</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/api.html">API Evolution and Deprecation History</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/api.html#api.rel_300"><code class="constant">3.0</code></a></span></dt><dt><span class="sect2"><a href="manual/api.html#api.rel_310"><code class="constant">3.1</code></a></span></dt><dt><span class="sect2"><a href="manual/api.html#api.rel_320"><code class="constant">3.2</code></a></span></dt><dt><span class="sect2"><a href="manual/api.html#api.rel_330"><code class="constant">3.3</code></a></span></dt><dt><span class="sect2"><a href="manual/api.html#api.rel_340"><code class="constant">3.4</code></a></span></dt><dt><span class="sect2"><a href="manual/api.html#api.rel_400"><code class="constant">4.0</code></a></span></dt><dt><span class="sect2"><a href="manual/api.html#api.rel_410"><code class="constant">4.1</code></a></span></dt><dt><span class="sect2"><a href="manual/api.html#api.rel_420"><code class="constant">4.2</code></a></span></dt><dt><span class="sect2"><a href="manual/api.html#api.rel_430"><code class="constant">4.3</code></a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/backwards.html">Backwards Compatibility</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/backwards.html#backwards.first">First</a></span></dt><dt><span class="sect2"><a href="manual/backwards.html#backwards.second">Second</a></span></dt><dt><span class="sect2"><a href="manual/backwards.html#backwards.third">Third</a></span></dt></dl></dd></dl></dd><dt><span class="appendix"><a href="manual/appendix_free.html">C. Free Software Needs Free Documentation</a></span></dt><dt><span class="appendix"><a href="manual/bk01apd.html">D. GNU General Public License</a></span></dt><dd><dl><dt><span class="section"><a href="manual/bk01apd.html#gpl-1">Preamble</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html">TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION</a></span></dt><dd><dl><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-0">Section 0</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-1">Section 1</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-2">Section 2</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-3">Section 3</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-4">Section 4</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-5">Section 5</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-6">Section 6</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-7">Section 7</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-8">Section 8</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-9">Section 9</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-10">Section 10</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-11">NO WARRANTY Section 11</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-12">Section 12</a></span></dt></dl></dd><dt><span class="section"><a href="manual/bk01apds03.html">How to Apply These Terms to Your New Programs</a></span></dt></dl></dd><dt><span class="appendix"><a href="manual/bk01ape.html">E. GNU Free Documentation License</a></span></dt></dl></dd><dt><span class="book"><a href="bk02.html"></a></span></dt><dd><dl><dt><span class="article"><a href="api.html">API and Source Level Documentation</a></span></dt></dl></dd><dt><span class="book"><a href="bk03.html"></a></span></dt><dd><dl><dt><span class="article"><a href="faq.html">Frequently Asked Questions</a></span></dt></dl></dd></dl></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"> </td><td width="20%" align="center"> </td><td width="40%" align="right"> <a accesskey="n" href="manual/spine.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top"> </td><td width="20%" align="center"> </td><td width="40%" align="right" valign="top"> The GNU C++ Library</td></tr></table></div></body></html>
--- 2,5 ----
  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
  <html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>The GNU C++ Library Documentation</title><meta name="generator" content="DocBook XSL Stylesheets V1.73.2" /><link rel="start" href="spine.html" title="The GNU C++ Library Documentation" /><link rel="next" href="manual/spine.html" title="The GNU C++ Library" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">The GNU C++ Library Documentation</th></tr><tr><td width="20%" align="left"> </td><th width="60%" align="center"> </th><td width="20%" align="right"> <a accesskey="n" href="manual/spine.html">Next</a></td></tr></table><hr /></div><div class="set" lang="en" xml:lang="en"><div class="titlepage"><div><div><h1 class="title"><a id="set-index"></a>The GNU C++ Library Documentation</h1></div><div><div class="authorgroup"><div class="author"><h3 class="author"><span class="firstname">Paolo</span> <span class="surname">Carlini</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Phil</span> <span class="surname">Edwards</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Doug</span> <span class="surname">Gregor</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Benjamin</span> <span class="surname">Kosnik</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Dhruv</span> <span class="surname">Matani</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Jason</span> <span class="surname">Merrill</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Mark</span> <span class="surname">Mitchell</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Nathan</span> <span class="surname">Myers</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Felix</span> <span class="surname">Natter</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Stefan</span> <span class="surname">Olsson</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Johannes</span> <span class="surname">Singler</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Ami</span> <span class="surname">Tavory</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Jonathan</span> <span class="surname">Wakely</span></h3></div></div></div><div><p class="copyright">Copyright © 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 
        <a class="ulink" href="http://fsf.org" target="_top">FSF</a>
!     </p></div></div><hr /></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><span class="book"><a href="manual/spine.html">The GNU C++ Library</a></span></dt><dd><dl><dt><span class="part"><a href="manual/intro.html">I. Introduction</a></span></dt><dd><dl><dt><span class="chapter"><a href="manual/bk01pt01ch01.html">1. Status</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt01ch01.html#manual.intro.status.standard">Implementation Status</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt01ch01.html#manual.intro.status.standard.1998">C++ 1998</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch01.html#manual.intro.status.standard.tr1">C++ TR1</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch01.html#manual.intro.status.standard.200x">C++ 200x</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01pt01ch01s02.html">License</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt01ch01s02.html#manual.intro.status.license.gpl">The Code: GPL</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch01s02.html#manual.intro.status.license.fdl">The Documentation: GPL, FDL</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01pt01ch01s03.html">Bugs</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt01ch01s03.html#manual.intro.status.bugs.impl">Implementation Bugs</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch01s03.html#manual.intro.status.bugs.iso">Standard Bugs</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="manual/bk01pt01ch02.html">2. Setup</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt01ch02.html#manual.intro.setup.configure">Configure</a></span></dt><dt><span class="sect1"><a href="manual/build.html">Build</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/build.html#build.prereq">Prerequisites</a></span></dt><dt><span class="sect2"><a href="manual/build.html#build.configure">Make</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/test.html">Test</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/test.html#test.organization">Organization</a></span></dt><dt><span class="sect2"><a href="manual/test.html#test.naming">Naming Conventions</a></span></dt><dt><span class="sect2"><a href="manual/test.html#test.utils">Utilities</a></span></dt><dt><span class="sect2"><a href="manual/test.html#test.run">Running the Testsuite</a></span></dt><dt><span class="sect2"><a href="manual/test.html#test.new_tests">New Test Cases</a></span></dt><dt><span class="sect2"><a href="manual/test.html#test.dejagnu">Test Harness Details</a></span></dt><dt><span class="sect2"><a href="manual/test.html#test.future">Future</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="manual/using.html">3. Using</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/using.html#manual.intro.using.lib">Linking Library Binary Files</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt01ch03s02.html">Headers</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt01ch03s02.html#manual.intro.using.headers.all">Header Files</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch03s02.html#manual.intro.using.headers.mixing">Mixing Headers</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch03s02.html#manual.intro.using.headers.cheaders">The C Headers and <code class="code">namespace std</code></a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch03s02.html#manual.intro.using.headers.pre">Precompiled Headers</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01pt01ch03s03.html">Namespaces</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt01ch03s03.html#manual.intro.using.namespaces.all">Available Namespaces</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch03s03.html#manual.intro.using.namespaces.std">namespace std</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch03s03.html#manual.intro.using.namespaces.comp">Using Namespace Composition</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01pt01ch03s04.html">Macros</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt01ch03s05.html">Concurrency</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt01ch03s05.html#manual.intro.using.concurrency.prereq">Prerequisites</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch03s05.html#manual.intro.using.concurrency.thread_safety">Thread Safety</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch03s05.html#manual.intro.using.concurrency.atomics">Atomics</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch03s05.html#manual.intro.using.concurrency.io">IO</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt01ch03s05.html#manual.intro.using.concurrency.containers">Containers</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01pt01ch03s06.html">Exception Safety</a></span></dt><dt><span class="sect1"><a href="manual/debug.html">Debugging Support</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/debug.html#debug.compiler">Using <span class="command"><strong>g++</strong></span></a></span></dt><dt><span class="sect2"><a href="manual/debug.html#debug.req">Debug Versions of Library Binary Files</a></span></dt><dt><span class="sect2"><a href="manual/debug.html#debug.memory">Memory Leak Hunting</a></span></dt><dt><span class="sect2"><a href="manual/debug.html#debug.gdb">Using <span class="command"><strong>gdb</strong></span></a></span></dt><dt><span class="sect2"><a href="manual/debug.html#debug.exceptions">Tracking uncaught exceptions</a></span></dt><dt><span class="sect2"><a href="manual/debug.html#debug.debug_mode">Debug Mode</a></span></dt><dt><span class="sect2"><a href="manual/debug.html#debug.compile_time_checks">Compile Time Checking</a></span></dt></dl></dd></dl></dd></dl></dd><dt><span class="part"><a href="manual/support.html">II. Support</a></span></dt><dd><dl><dt><span class="preface"><a href="manual/bk01pt02pr01.html"></a></span></dt><dt><span class="chapter"><a href="manual/bk01pt02ch04.html">4. Types</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt02ch04.html#manual.support.types.fundamental">Fundamental Types</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt02ch04s02.html">Numeric Properties</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt02ch04s03.html">NULL</a></span></dt></dl></dd><dt><span class="chapter"><a href="manual/bk01pt02ch05.html">5. Dynamic Memory</a></span></dt><dt><span class="chapter"><a href="manual/bk01pt02ch06.html">6. Termination</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt02ch06.html#support.termination.handlers">Termination Handlers</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt02ch06s02.html">Verbose Terminate Handler</a></span></dt></dl></dd></dl></dd><dt><span class="part"><a href="manual/diagnostics.html">III. Diagnostics</a></span></dt><dd><dl><dt><span class="chapter"><a href="manual/bk01pt03ch07.html">7. Exceptions</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt03ch07.html#manual.diagnostics.exceptions.hierarchy">Exception Classes</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt03ch07s02.html">Adding Data to Exceptions</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt03ch07s03.html">Cancellation</a></span></dt></dl></dd><dt><span class="chapter"><a href="manual/bk01pt03ch08.html">8. Concept Checking</a></span></dt></dl></dd><dt><span class="part"><a href="manual/utilities.html">IV. Utilities</a></span></dt><dd><dl><dt><span class="chapter"><a href="manual/bk01pt04ch09.html">9. Functors</a></span></dt><dt><span class="chapter"><a href="manual/bk01pt04ch10.html">10. Pairs</a></span></dt><dt><span class="chapter"><a href="manual/bk01pt04ch11.html">11. Memory</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt04ch11.html#manual.util.memory.allocator">Allocators</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt04ch11.html#allocator.req">Requirements</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt04ch11.html#allocator.design_issues">Design Issues</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt04ch11.html#allocator.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt04ch11.html#allocator.using">Using a Specific Allocator</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt04ch11.html#allocator.custom">Custom Allocators</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt04ch11.html#allocator.ext">Extension Allocators</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/auto_ptr.html">auto_ptr</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/auto_ptr.html#auto_ptr.limitations">Limitations</a></span></dt><dt><span class="sect2"><a href="manual/auto_ptr.html#auto_ptr.using">Use in Containers</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/shared_ptr.html">shared_ptr</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/shared_ptr.html#shared_ptr.req">Requirements</a></span></dt><dt><span class="sect2"><a href="manual/shared_ptr.html#shared_ptr.design_issues">Design Issues</a></span></dt><dt><span class="sect2"><a href="manual/shared_ptr.html#shared_ptr.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="manual/shared_ptr.html#shared_ptr.using">Use</a></span></dt><dt><span class="sect2"><a href="manual/shared_ptr.html#shared_ptr.ack">Acknowledgments</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="manual/bk01pt04ch12.html">12. Traits</a></span></dt></dl></dd><dt><span class="part"><a href="manual/strings.html">V. Strings</a></span></dt><dd><dl><dt><span class="chapter"><a href="manual/bk01pt05ch13.html">13. String Classes</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt05ch13.html#strings.string.simple">Simple Transformations</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt05ch13s02.html">Case Sensitivity</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt05ch13s03.html">Arbitrary Character Types</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt05ch13s04.html">Tokenizing</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt05ch13s05.html">Shrink to Fit</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt05ch13s06.html">CString (MFC)</a></span></dt></dl></dd></dl></dd><dt><span class="part"><a href="manual/localization.html">VI. Localization</a></span></dt><dd><dl><dt><span class="chapter"><a href="manual/bk01pt06ch14.html">14. Locales</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt06ch14.html#manual.localization.locales.locale">locale</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt06ch14.html#locales.locale.req">Requirements</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt06ch14.html#locales.locale.design">Design</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt06ch14.html#locales.locale.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt06ch14.html#locales.locale.future">Future</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="manual/bk01pt06ch15.html">15. Facets aka Categories</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt06ch15.html#manual.localization.facet.ctype">ctype</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt06ch15.html#facet.ctype.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt06ch15.html#facet.ctype.future">Future</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/codecvt.html">codecvt</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/codecvt.html#facet.codecvt.req">Requirements</a></span></dt><dt><span class="sect2"><a href="manual/codecvt.html#facet.codecvt.design">Design</a></span></dt><dt><span class="sect2"><a href="manual/codecvt.html#facet.codecvt.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="manual/codecvt.html#facet.codecvt.use">Use</a></span></dt><dt><span class="sect2"><a href="manual/codecvt.html#facet.codecvt.future">Future</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/messages.html">messages</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/messages.html#facet.messages.req">Requirements</a></span></dt><dt><span class="sect2"><a href="manual/messages.html#facet.messages.design">Design</a></span></dt><dt><span class="sect2"><a href="manual/messages.html#facet.messages.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="manual/messages.html#facet.messages.use">Use</a></span></dt><dt><span class="sect2"><a href="manual/messages.html#facet.messages.future">Future</a></span></dt></dl></dd></dl></dd></dl></dd><dt><span class="part"><a href="manual/containers.html">VII. Containers</a></span></dt><dd><dl><dt><span class="chapter"><a href="manual/bk01pt07ch16.html">16. Sequences</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt07ch16.html#containers.sequences.list">list</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt07ch16.html#sequences.list.size">list::size() is O(n)</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01pt07ch16s02.html">vector</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt07ch16s02.html#sequences.vector.management">Space Overhead Management</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="manual/bk01pt07ch17.html">17. Associative</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt07ch17.html#containers.associative.insert_hints">Insertion Hints</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt07ch17s02.html">bitset</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt07ch17s02.html#associative.bitset.size_variable">Size Variable</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt07ch17s02.html#associative.bitset.type_string">Type String</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="manual/bk01pt07ch18.html">18. Interacting with C</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt07ch18.html#containers.c.vs_array">Containers vs. Arrays</a></span></dt></dl></dd></dl></dd><dt><span class="part"><a href="manual/iterators.html">VIII. Iterators</a></span></dt><dd><dl><dt><span class="chapter"><a href="manual/bk01pt08ch19.html">19. Predefined</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt08ch19.html#iterators.predefined.vs_pointers">Iterators vs. Pointers</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt08ch19s02.html">One Past the End</a></span></dt></dl></dd></dl></dd><dt><span class="part"><a href="manual/algorithms.html">IX. Algorithms</a></span></dt><dd><dl><dt><span class="preface"><a href="manual/bk01pt09pr02.html"></a></span></dt><dt><span class="chapter"><a href="manual/bk01pt09ch20.html">20. Mutating</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt09ch20.html#algorithms.mutating.swap"><code class="function">swap</code></a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt09ch20.html#algorithms.swap.specializations">Specializations</a></span></dt></dl></dd></dl></dd></dl></dd><dt><span class="part"><a href="manual/numerics.html">X. Numerics</a></span></dt><dd><dl><dt><span class="chapter"><a href="manual/bk01pt10ch21.html">21. Complex</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt10ch21.html#numerics.complex.processing">complex Processing</a></span></dt></dl></dd><dt><span class="chapter"><a href="manual/bk01pt10ch22.html">22. Generalized Operations</a></span></dt><dt><span class="chapter"><a href="manual/bk01pt10ch23.html">23. Interacting with C</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt10ch23.html#numerics.c.array">Numerics vs. Arrays</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt10ch23s02.html">C99</a></span></dt></dl></dd></dl></dd><dt><span class="part"><a href="manual/io.html">XI. Input and Output</a></span></dt><dd><dl><dt><span class="chapter"><a href="manual/bk01pt11ch24.html">24. Iostream Objects</a></span></dt><dt><span class="chapter"><a href="manual/bk01pt11ch25.html">25. Stream Buffers</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt11ch25.html#io.streambuf.derived">Derived streambuf Classes</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt11ch25s02.html">Buffering</a></span></dt></dl></dd><dt><span class="chapter"><a href="manual/bk01pt11ch26.html">26. Memory Based Streams</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt11ch26.html#manual.io.memstreams.compat">Compatibility With strstream</a></span></dt></dl></dd><dt><span class="chapter"><a href="manual/bk01pt11ch27.html">27. File Based Streams</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt11ch27.html#manual.io.filestreams.copying_a_file">Copying a File</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt11ch27s02.html">Binary Input and Output</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt11ch27s03.html">More Binary Input and Output</a></span></dt></dl></dd><dt><span class="chapter"><a href="manual/bk01pt11ch28.html">28. Interacting with C</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt11ch28.html#manual.io.c.FILE">Using FILE* and file descriptors</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt11ch28s02.html">Performance</a></span></dt></dl></dd></dl></dd><dt><span class="part"><a href="manual/extensions.html">XII. Extensions</a></span></dt><dd><dl><dt><span class="preface"><a href="manual/bk01pt12pr03.html"></a></span></dt><dt><span class="chapter"><a href="manual/bk01pt12ch29.html">29. Compile Time Checks</a></span></dt><dt><span class="chapter"><a href="manual/debug_mode.html">30. Debug Mode</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/debug_mode.html#manual.ext.debug_mode.intro">Intro</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt12ch30s02.html">Semantics</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt12ch30s03.html">Using</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt12ch30s03.html#debug_mode.using.mode">Using the Debug Mode</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt12ch30s03.html#debug_mode.using.specific">Using a Specific Debug Container</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01pt12ch30s04.html">Design</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt12ch30s04.html#manual.ext.debug_mode.design.goals">Goals</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt12ch30s04.html#manual.ext.debug_mode.design.methods">Methods</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt12ch30s04.html#manual.ext.debug_mode.design.other">Other Implementations</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="manual/parallel_mode.html">31. Parallel Mode</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/parallel_mode.html#manual.ext.parallel_mode.intro">Intro</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt12ch31s02.html">Semantics</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt12ch31s03.html">Using</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt12ch31s03.html#parallel_mode.using.parallel_mode">Using Parallel Mode</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt12ch31s03.html#manual.ext.parallel_mode.usings">Using Specific Parallel Components</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01pt12ch31s04.html">Design</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt12ch31s04.html#manual.ext.parallel_mode.design.intro">Interface Basics</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt12ch31s04.html#manual.ext.parallel_mode.design.tuning">Configuration and Tuning</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt12ch31s04.html#manual.ext.parallel_mode.design.impl">Implementation Namespaces</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01pt12ch31s05.html">Testing</a></span></dt><dt><span class="bibliography"><a href="manual/parallel_mode.html#parallel_mode.biblio">Bibliography</a></span></dt></dl></dd><dt><span class="chapter"><a href="manual/bk01pt12ch32.html">32. Allocators</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt12ch32.html#manual.ext.allocator.mt">mt_allocator</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt12ch32.html#allocator.mt.intro">Intro</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt12ch32.html#allocator.mt.design_issues">Design Issues</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt12ch32.html#allocator.mt.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt12ch32.html#allocator.mt.example_single">Single Thread Example</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt12ch32.html#allocator.mt.example_multi">Multiple Thread Example</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bitmap_allocator.html">bitmap_allocator</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bitmap_allocator.html#allocator.bitmap.design">Design</a></span></dt><dt><span class="sect2"><a href="manual/bitmap_allocator.html#allocator.bitmap.impl">Implementation</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="manual/bk01pt12ch33.html">33. Containers</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt12ch33.html#manual.ext.containers.pbds">Policy Based Data Structures</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt12ch33s02.html">HP/SGI</a></span></dt><dt><span class="sect1"><a href="manual/bk01pt12ch33s03.html">Deprecated HP/SGI</a></span></dt></dl></dd><dt><span class="chapter"><a href="manual/bk01pt12ch34.html">34. Utilities</a></span></dt><dt><span class="chapter"><a href="manual/bk01pt12ch35.html">35. Algorithms</a></span></dt><dt><span class="chapter"><a href="manual/bk01pt12ch36.html">36. Numerics</a></span></dt><dt><span class="chapter"><a href="manual/bk01pt12ch37.html">37. Iterators</a></span></dt><dt><span class="chapter"><a href="manual/bk01pt12ch38.html">38. Input and Output</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/bk01pt12ch38.html#manual.ext.io.filebuf_derived">Derived filebufs</a></span></dt></dl></dd><dt><span class="chapter"><a href="manual/bk01pt12ch39.html">39. Demangling</a></span></dt><dt><span class="chapter"><a href="manual/concurrency.html">40. Concurrency</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/concurrency.html#manual.ext.concurrency.design">Design</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/concurrency.html#manual.ext.concurrency.design.threads">Interface to Locks and Mutexes</a></span></dt><dt><span class="sect2"><a href="manual/concurrency.html#manual.ext.concurrency.design.atomics">Interface to Atomic Functions</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01pt12ch40s02.html">Implementation</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01pt12ch40s02.html#manual.ext.concurrency.impl.atomic_fallbacks">Using Builtin Atomic Functions</a></span></dt><dt><span class="sect2"><a href="manual/bk01pt12ch40s02.html#manual.ext.concurrency.impl.thread">Thread Abstraction</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01pt12ch40s03.html">Use</a></span></dt></dl></dd></dl></dd><dt><span class="appendix"><a href="manual/appendix_contributing.html">A. Contributing</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/appendix_contributing.html#contrib.list">Contributor Checklist</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/appendix_contributing.html#list.reading">Reading</a></span></dt><dt><span class="sect2"><a href="manual/appendix_contributing.html#list.copyright">Assignment</a></span></dt><dt><span class="sect2"><a href="manual/appendix_contributing.html#list.getting">Getting Sources</a></span></dt><dt><span class="sect2"><a href="manual/appendix_contributing.html#list.patches">Submitting Patches</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01apas02.html">Directory Layout and Source Conventions</a></span></dt><dt><span class="sect1"><a href="manual/bk01apas03.html">Coding Style</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01apas03.html#coding_style.bad_identifiers">Bad Identifiers</a></span></dt><dt><span class="sect2"><a href="manual/bk01apas03.html#coding_style.example">By Example</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01apas04.html">Documentation Style</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/bk01apas04.html#doc_style.doxygen">Doxygen</a></span></dt><dt><span class="sect2"><a href="manual/bk01apas04.html#doc_style.docbook">Docbook</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/bk01apas05.html">Design Notes</a></span></dt></dl></dd><dt><span class="appendix"><a href="manual/appendix_porting.html">B. Porting and Maintenance</a></span></dt><dd><dl><dt><span class="sect1"><a href="manual/appendix_porting.html#appendix.porting.build_hacking">Configure and Build Hacking</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/appendix_porting.html#build_hacking.prereq">Prerequisites</a></span></dt><dt><span class="sect2"><a href="manual/appendix_porting.html#build_hacking.map">Overview: What Comes from Where</a></span></dt><dt><span class="sect2"><a href="manual/appendix_porting.html#build_hacking.scripts">Storing Information in non-AC files (like configure.host)</a></span></dt><dt><span class="sect2"><a href="manual/appendix_porting.html#build_hacking.conventions">Coding and Commenting Conventions</a></span></dt><dt><span class="sect2"><a href="manual/appendix_porting.html#build_hacking.acinclude">The acinclude.m4 layout</a></span></dt><dt><span class="sect2"><a href="manual/appendix_porting.html#build_hacking.enable"><code class="constant">GLIBCXX_ENABLE</code>, the <code class="literal">--enable</code> maker</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/internals.html">Porting to New Hardware or Operating Systems</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/internals.html#internals.os">Operating System</a></span></dt><dt><span class="sect2"><a href="manual/internals.html#internals.cpu">CPU</a></span></dt><dt><span class="sect2"><a href="manual/internals.html#internals.char_types">Character Types</a></span></dt><dt><span class="sect2"><a href="manual/internals.html#internals.thread_safety">Thread Safety</a></span></dt><dt><span class="sect2"><a href="manual/internals.html#internals.numeric_limits">Numeric Limits</a></span></dt><dt><span class="sect2"><a href="manual/internals.html#internals.libtool">Libtool</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/abi.html">ABI Policy and Guidelines</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/abi.html#abi.cxx_interface">The C++ Interface</a></span></dt><dt><span class="sect2"><a href="manual/abi.html#abi.versioning">Versioning</a></span></dt><dt><span class="sect2"><a href="manual/abi.html#abi.changes_allowed">Allowed Changes</a></span></dt><dt><span class="sect2"><a href="manual/abi.html#abi.changes_no">Prohibited Changes</a></span></dt><dt><span class="sect2"><a href="manual/abi.html#abi.impl">Implementation</a></span></dt><dt><span class="sect2"><a href="manual/abi.html#abi.testing">Testing</a></span></dt><dt><span class="sect2"><a href="manual/abi.html#abi.issues">Outstanding Issues</a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/api.html">API Evolution and Deprecation History</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/api.html#api.rel_300"><code class="constant">3.0</code></a></span></dt><dt><span class="sect2"><a href="manual/api.html#api.rel_310"><code class="constant">3.1</code></a></span></dt><dt><span class="sect2"><a href="manual/api.html#api.rel_320"><code class="constant">3.2</code></a></span></dt><dt><span class="sect2"><a href="manual/api.html#api.rel_330"><code class="constant">3.3</code></a></span></dt><dt><span class="sect2"><a href="manual/api.html#api.rel_340"><code class="constant">3.4</code></a></span></dt><dt><span class="sect2"><a href="manual/api.html#api.rel_400"><code class="constant">4.0</code></a></span></dt><dt><span class="sect2"><a href="manual/api.html#api.rel_410"><code class="constant">4.1</code></a></span></dt><dt><span class="sect2"><a href="manual/api.html#api.rel_420"><code class="constant">4.2</code></a></span></dt><dt><span class="sect2"><a href="manual/api.html#api.rel_430"><code class="constant">4.3</code></a></span></dt></dl></dd><dt><span class="sect1"><a href="manual/backwards.html">Backwards Compatibility</a></span></dt><dd><dl><dt><span class="sect2"><a href="manual/backwards.html#backwards.first">First</a></span></dt><dt><span class="sect2"><a href="manual/backwards.html#backwards.second">Second</a></span></dt><dt><span class="sect2"><a href="manual/backwards.html#backwards.third">Third</a></span></dt></dl></dd></dl></dd><dt><span class="appendix"><a href="manual/appendix_free.html">C. Free Software Needs Free Documentation</a></span></dt><dt><span class="appendix"><a href="manual/bk01apd.html">D. GNU General Public License</a></span></dt><dd><dl><dt><span class="section"><a href="manual/bk01apd.html#gpl-1">Preamble</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html">TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION</a></span></dt><dd><dl><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-0">Section 0</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-1">Section 1</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-2">Section 2</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-3">Section 3</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-4">Section 4</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-5">Section 5</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-6">Section 6</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-7">Section 7</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-8">Section 8</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-9">Section 9</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-10">Section 10</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-11">NO WARRANTY Section 11</a></span></dt><dt><span class="section"><a href="manual/bk01apds02.html#gpl-2-12">Section 12</a></span></dt></dl></dd><dt><span class="section"><a href="manual/bk01apds03.html">How to Apply These Terms to Your New Programs</a></span></dt></dl></dd><dt><span class="appendix"><a href="manual/bk01ape.html">E. GNU Free Documentation License</a></span></dt></dl></dd><dt><span class="book"><a href="bk02.html"></a></span></dt><dd><dl><dt><span class="article"><a href="api.html">API and Source Level Documentation</a></span></dt></dl></dd><dt><span class="book"><a href="bk03.html"></a></span></dt><dd><dl><dt><span class="article"><a href="faq.html">Frequently Asked Questions</a></span></dt></dl></dd></dl></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"> </td><td width="20%" align="center"> </td><td width="40%" align="right"> <a accesskey="n" href="manual/spine.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top"> </td><td width="20%" align="center"> </td><td width="40%" align="right" valign="top"> The GNU C++ Library</td></tr></table></div></body></html>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/xml/api.xml gcc-4.3.1/libstdc++-v3/doc/xml/api.xml
*** gcc-4.3.0/libstdc++-v3/doc/xml/api.xml	Mon Feb 11 00:01:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/xml/api.xml	Wed Mar 26 23:21:44 2008
***************
*** 15,21 ****
        2008
      </year>
      <holder>
!       <ulink url="http://fsf.org">FSF
        </ulink>
      </holder>
    </copyright>
--- 15,21 ----
        2008
      </year>
      <holder>
!       <ulink url="http://www.fsf.org/">FSF
        </ulink>
      </holder>
    </copyright>
*************** viewed online:
*** 63,68 ****
--- 63,74 ----
    </listitem>
    <listitem>
      <para>
+       <ulink url="libstdc++-html-USERS-4.3/index.html">for the 4.3 release
+       </ulink>
+     </para>
+   </listitem>
+   <listitem>
+     <para>
        <ulink url="latest-doxygen/index.html">&quot;the latest collection&quot;
        </ulink>
        (For the main development tree; see the date on the first page.)
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/xml/authors.xml gcc-4.3.1/libstdc++-v3/doc/xml/authors.xml
*** gcc-4.3.0/libstdc++-v3/doc/xml/authors.xml	Mon Feb 11 00:01:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/xml/authors.xml	Thu Apr 10 22:53:15 2008
***************
*** 154,160 ****
  
      <authorblurb>
        <para>
! 	Policy Based Datastructures, Associative Containers, Unordered
  	Containers.
        </para>
      </authorblurb>
--- 154,160 ----
  
      <authorblurb>
        <para>
! 	Policy Based Data Structures, Associative Containers, Unordered
  	Containers.
        </para>
      </authorblurb>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/xml/faq.xml gcc-4.3.1/libstdc++-v3/doc/xml/faq.xml
*** gcc-4.3.0/libstdc++-v3/doc/xml/faq.xml	Mon Feb 11 00:01:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/xml/faq.xml	Thu Apr 10 22:53:15 2008
***************
*** 130,137 ****
    </question>
    <answer id="a-how">
      <para>
!     Here is <ulink url="../17_intro/contribute.html">a page devoted to
!     this topic</ulink>. Subscribing to the mailing list (see above, or
      the homepage) is a very good idea if you have something to
      contribute, or if you have spare time and want to
      help. Contributions don't have to be in the form of source code;
--- 130,137 ----
    </question>
    <answer id="a-how">
      <para>
!     Here is <link linkend="appendix.contrib">a page devoted to
!     this topic</link>. Subscribing to the mailing list (see above, or
      the homepage) is a very good idea if you have something to
      contribute, or if you have spare time and want to
      help. Contributions don't have to be in the form of source code;
***************
*** 400,406 ****
      <para>
        If the only functions from <filename>libstdc++.a</filename>
        which you need are language support functions (those listed in
!       <ulink url="../18_support/howto.html">clause 18</ulink> of the
        standard, e.g., <function>new</function> and
        <function>delete</function>), then try linking against
        <filename>libsupc++.a</filename>, which is a subset of
--- 400,406 ----
      <para>
        If the only functions from <filename>libstdc++.a</filename>
        which you need are language support functions (those listed in
!       <link linkend="manual.support">clause 18</link> of the
        standard, e.g., <function>new</function> and
        <function>delete</function>), then try linking against
        <filename>libsupc++.a</filename>, which is a subset of
***************
*** 461,467 ****
  </qandadiv>
  
  
! <!-- Platorm-Specific Issues -->
  <qandadiv id="faq.platform-specific" xreflabel="Platform-Specific Issues">
  <title>Platform-Specific Issues</title>
  
--- 461,467 ----
  </qandadiv>
  
  
! <!-- Platform-Specific Issues -->
  <qandadiv id="faq.platform-specific" xreflabel="Platform-Specific Issues">
  <title>Platform-Specific Issues</title>
  
***************
*** 661,667 ****
      enough to detect when the minimal support to
      enable <type>wchar_t</type> and C++ library structures
      like <classname>wstring</classname> were present. This impacted Solaris,
!     Darwin, and BSD varients, and is fixed in libstdc++ versions post 4.1.0.
      </para> 
      <para> 
      </para> 
--- 661,667 ----
      enough to detect when the minimal support to
      enable <type>wchar_t</type> and C++ library structures
      like <classname>wstring</classname> were present. This impacted Solaris,
!     Darwin, and BSD variants, and is fixed in libstdc++ versions post 4.1.0.
      </para> 
      <para> 
      </para> 
***************
*** 785,797 ****
      reason is that the state flags are <emphasis>not</emphasis> cleared
      on a successful call to open().  The standard unfortunately did
      not specify behavior in this case, and to everybody's great sorrow,
!     the <ulink url="../ext/howto.html#5">proposed LWG resolution in
!       DR #22</ulink> is to leave the flags unchanged.  You must insert a call
      to <function>fs.clear()</function> between the calls to close() and open(),
      and then everything will work like we all expect it to work.
      <emphasis>Update:</emphasis> for GCC 4.0 we implemented the resolution
!     of <ulink url="../ext/howto.html#5">DR #409</ulink> and open() now calls
!     <function>clear()</function> on success!
      </para> 
    </answer>
  </qandaentry>
--- 785,797 ----
      reason is that the state flags are <emphasis>not</emphasis> cleared
      on a successful call to open().  The standard unfortunately did
      not specify behavior in this case, and to everybody's great sorrow,
!     the <link linkend="manual.intro.status.bugs">proposed LWG resolution in
!       DR #22</link> is to leave the flags unchanged.  You must insert a call
      to <function>fs.clear()</function> between the calls to close() and open(),
      and then everything will work like we all expect it to work.
      <emphasis>Update:</emphasis> for GCC 4.0 we implemented the resolution
!     of <link linkend="manual.intro.status.bugs">DR #409</link> and open() 
!     now calls <function>clear()</function> on success!
      </para> 
    </answer>
  </qandaentry>
***************
*** 895,901 ****
      <para>
      More information, including how to optionally enable/disable the
      checks, is available
!     <ulink url="../19_diagnostics/howto.html#3">here</ulink>.
      </para> 
    </answer>
  </qandaentry>
--- 895,901 ----
      <para>
      More information, including how to optionally enable/disable the
      checks, is available
!     <link linkend="manual.diagnostics.concept_checking">here</link>.
      </para> 
    </answer>
  </qandaentry>
***************
*** 940,952 ****
      <para>
      A few people have reported that the standard containers appear
      to leak memory when tested with memory checkers such as
!     <ulink url="http://developer.kde.org/~sewardj/">valgrind</ulink>.
      The library's default allocators keep free memory in a pool
      for later reuse, rather than returning it to the OS.  Although
      this memory is always reachable by the library and is never
      lost, memory debugging tools can report it as a leak.  If you
      want to test the library for memory leaks please read
!     <ulink url="../debug.html#mem">Tips for memory leak hunting</ulink>
      first.
      </para> 
    </answer>
--- 940,952 ----
      <para>
      A few people have reported that the standard containers appear
      to leak memory when tested with memory checkers such as
!     <ulink url="http://valgrind.org/">valgrind</ulink>.
      The library's default allocators keep free memory in a pool
      for later reuse, rather than returning it to the OS.  Although
      this memory is always reachable by the library and is never
      lost, memory debugging tools can report it as a leak.  If you
      want to test the library for memory leaks please read
!     <link linkend="debug.memory">Tips for memory leak hunting</link>
      first.
      </para> 
    </answer>
***************
*** 961,967 ****
    <answer id="a-list_size_on">
      <para>
      See
!     the <ulink url="../23_containers/howto.html#6">Containers</ulink>
      chapter.
      </para> 
    </answer>
--- 961,967 ----
    <answer id="a-list_size_on">
      <para>
      See
!     the <link linkend="manual.containers">Containers</link>
      chapter.
      </para> 
    </answer>
***************
*** 981,987 ****
      patches</ulink> that covers the procedure, but for libstdc++ you
      should also send the patch to our mailing list in addition to
      the GCC patches mailing list.  The libstdc++
!     <ulink url="../17_intro/contribute.html">contributors' page</ulink>
      also talks about how to submit patches.
      </para>
      <para>
--- 981,987 ----
      patches</ulink> that covers the procedure, but for libstdc++ you
      should also send the patch to our mailing list in addition to
      the GCC patches mailing list.  The libstdc++
!     <link linkend="appendix.contrib">contributors' page</link>
      also talks about how to submit patches.
      </para>
      <para>
***************
*** 1098,1104 ****
    </question>
    <answer id="a-extensions_and_backwards_compat">
      <para>
!       See the <link linkend="manual.appendix.porting.backwards">link</link> on backwards compatiblity and <link linkend="appendix.porting.api">link</link> on evolution.
      </para> 
    </answer>
  </qandaentry>
--- 1098,1104 ----
    </question>
    <answer id="a-extensions_and_backwards_compat">
      <para>
!       See the <link linkend="manual.appendix.porting.backwards">link</link> on backwards compatibility and <link linkend="appendix.porting.api">link</link> on evolution.
      </para> 
    </answer>
  </qandaentry>
***************
*** 1237,1244 ****
      The copy will take O(n) time and the swap is constant time.
      </para>
      <para>
!     See <ulink url="../21_strings/howto.html#6">Shrink-to-fit
!     strings</ulink> for a similar solution for strings.
      </para> 
    </answer>
  </qandaentry>
--- 1237,1244 ----
      The copy will take O(n) time and the swap is constant time.
      </para>
      <para>
!     See <link linkend="strings.string.shrink">Shrink-to-fit
!     strings</link> for a similar solution for strings.
      </para> 
    </answer>
  </qandaentry>
***************
*** 1251,1254 ****
  
  </article>
  
! </book>
\ No newline at end of file
--- 1251,1254 ----
  
  </article>
  
! </book>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/xml/manual/abi.xml gcc-4.3.1/libstdc++-v3/doc/xml/manual/abi.xml
*** gcc-4.3.0/libstdc++-v3/doc/xml/manual/abi.xml	Mon Feb 11 00:01:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/xml/manual/abi.xml	Thu Apr 10 22:53:15 2008
*************** given compiler ABI. In a nutshell:
*** 99,105 ****
  
  <para>
    To use a specific version of the C++ ABI, one must use a
!   corresponding GNU C++ toolchain (Ie, g++ and libstdc++) that
    implements the C++ ABI in question.
  </para>
  
--- 99,105 ----
  
  <para>
    To use a specific version of the C++ ABI, one must use a
!   corresponding GNU C++ toolchain (i.e., g++ and libstdc++) that
    implements the C++ ABI in question.
  </para>
  
*************** release of the series to remain link com
*** 183,189 ****
      <para>It is versioned with the following labels and version
     definitions, where the version definition is the maximum for a
     particular release. Labels are cumulative. If a particular release
!    is not listed, it has the same version labels as the preceeding
     release.</para>
  
      <para>This corresponds to the mapfile: gcc/libgcc-std.ver</para>
--- 183,189 ----
      <para>It is versioned with the following labels and version
     definitions, where the version definition is the maximum for a
     particular release. Labels are cumulative. If a particular release
!    is not listed, it has the same version labels as the preceding
     release.</para>
  
      <para>This corresponds to the mapfile: gcc/libgcc-std.ver</para>
*************** release of the series to remain link com
*** 252,258 ****
     gcc-3.2.1 release, which has GLIBCPP_3.2.1 for new symbols and
     GLIBCPP_3.2 for symbols that were introduced in the gcc-3.2.0
     release.) If a particular release is not listed, it has the same
!    version labels as the preceeding release.
     </para>
      <itemizedlist>
      <listitem><para>gcc-3.0.0: (Error, not versioned)</para></listitem>
--- 252,258 ----
     gcc-3.2.1 release, which has GLIBCPP_3.2.1 for new symbols and
     GLIBCPP_3.2 for symbols that were introduced in the gcc-3.2.0
     release.) If a particular release is not listed, it has the same
!    version labels as the preceding release.
     </para>
      <itemizedlist>
      <listitem><para>gcc-3.0.0: (Error, not versioned)</para></listitem>
*************** class in registers, the compiler will be
*** 737,743 ****
    <varlistentry>
  <term><code>namespace std</code></term>
  <listitem><para> Defaults to exporting all symbols in label
! <code>GLIBCXX</code> that do not begin with an underscore, ie
  <code>__test_func</code> would not be exported by default. Select
  exceptional symbols are allowed to be visible.</para></listitem>
    </varlistentry>
--- 737,743 ----
    <varlistentry>
  <term><code>namespace std</code></term>
  <listitem><para> Defaults to exporting all symbols in label
! <code>GLIBCXX</code> that do not begin with an underscore, i.e.,
  <code>__test_func</code> would not be exported by default. Select
  exceptional symbols are allowed to be visible.</para></listitem>
    </varlistentry>
*************** gcc test.c -g -O2 -L. -lone -ltwo /usr/l
*** 972,978 ****
    difficult. In particular, compiler generated constructs such as
    implicit instantiations for templates, typeinfo information, and
    virtual tables all may cause ABI leakage across shared library
!   boundaries. Because of this, mixing C++ ABI's is not recommended at
    this time.
  </para>
  
--- 972,978 ----
    difficult. In particular, compiler generated constructs such as
    implicit instantiations for templates, typeinfo information, and
    virtual tables all may cause ABI leakage across shared library
!   boundaries. Because of this, mixing C++ ABIs is not recommended at
    this time.
  </para>
  
*************** gcc test.c -g -O2 -L. -lone -ltwo /usr/l
*** 1127,1130 ****
  
  </bibliography>
  
! </sect1>
\ No newline at end of file
--- 1127,1130 ----
  
  </bibliography>
  
! </sect1>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/xml/manual/allocator.xml gcc-4.3.1/libstdc++-v3/doc/xml/manual/allocator.xml
*** gcc-4.3.0/libstdc++-v3/doc/xml/manual/allocator.xml	Mon Feb 11 00:01:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/xml/manual/allocator.xml	Thu Apr 10 22:53:15 2008
***************
*** 19,25 ****
   class template called <classname>allocator</classname>. The
   <classname>allocator</classname> abstraction is used throughout the
   library in <classname>string</classname>, container classes,
!  algorithnms, and parts of iostreams. This class, and base classes of
   it, are the superset of available free store (<quote>heap</quote>)
   management classes.
  </para>
--- 19,25 ----
   class template called <classname>allocator</classname>. The
   <classname>allocator</classname> abstraction is used throughout the
   library in <classname>string</classname>, container classes,
!  algorithms, and parts of iostreams. This class, and base classes of
   it, are the superset of available free store (<quote>heap</quote>)
   management classes.
  </para>
***************
*** 261,267 ****
       directly, for every allocation. (See
       <filename>include/ext/new_allocator.h</filename>, for instance.)
       However, that option would involve changing source code to use
!      the a non-default allocator. Another option is to force the
       default allocator to remove caching and pools, and to directly
       allocate with every call of <function>allocate</function> and
       directly deallocate with every call of
--- 261,267 ----
       directly, for every allocation. (See
       <filename>include/ext/new_allocator.h</filename>, for instance.)
       However, that option would involve changing source code to use
!      a non-default allocator. Another option is to force the
       default allocator to remove caching and pools, and to directly
       allocate with every call of <function>allocate</function> and
       directly deallocate with every call of
***************
*** 397,403 ****
  	</para>
  	<para> 
  	  Includes memory tracking and marking abilities as well as hooks for
! 	  throwing exceptinos at configurable intervals (including random,
  	  all, none). 
  	</para>
        </listitem>
--- 397,403 ----
  	</para>
  	<para> 
  	  Includes memory tracking and marking abilities as well as hooks for
! 	  throwing exceptions at configurable intervals (including random,
  	  all, none). 
  	</para>
        </listitem>
***************
*** 447,453 ****
     <para>The <varname>thr</varname> boolean determines whether the
     pool should be manipulated atomically or not.  When
     <varname>thr</varname> = <constant>true</constant>, the allocator
!    is is threadsafe, while <varname>thr</varname> =
     <constant>false</constant>, and is slightly faster but unsafe for
     multiple threads.
     </para>
--- 447,453 ----
     <para>The <varname>thr</varname> boolean determines whether the
     pool should be manipulated atomically or not.  When
     <varname>thr</varname> = <constant>true</constant>, the allocator
!    is is thread-safe, while <varname>thr</varname> =
     <constant>false</constant>, and is slightly faster but unsafe for
     multiple threads.
     </para>
***************
*** 455,461 ****
     <para>
       For thread-enabled configurations, the pool is locked with a
       single big lock. In some situations, this implementation detail
!      may result in severe performance degredation.
     </para>
  
     <para>
--- 455,461 ----
     <para>
       For thread-enabled configurations, the pool is locked with a
       single big lock. In some situations, this implementation detail
!      may result in severe performance degradation.
     </para>
  
     <para>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/xml/manual/appendix_contributing.xml gcc-4.3.1/libstdc++-v3/doc/xml/manual/appendix_contributing.xml
*** gcc-4.3.0/libstdc++-v3/doc/xml/manual/appendix_contributing.xml	Tue Feb 12 02:10:57 2008
--- gcc-4.3.1/libstdc++-v3/doc/xml/manual/appendix_contributing.xml	Thu Apr 10 22:53:15 2008
*************** indicate a place that may require attent
*** 316,322 ****
    <para>
    </para>
    <sect2 id="coding_style.bad_identifiers" xreflabel="coding_style.bad">
!     <title>Bad Itentifiers</title>
      <para>
        Identifiers that conflict and should be avoided.
      </para>
--- 316,322 ----
    <para>
    </para>
    <sect2 id="coding_style.bad_identifiers" xreflabel="coding_style.bad">
!     <title>Bad Identifiers</title>
      <para>
        Identifiers that conflict and should be avoided.
      </para>
*************** indicate a place that may require attent
*** 653,659 ****
        for definitions. For C++, where we have member functions that can
        be either inline definitions or declarations, keeping to this
        standard allows all member function names for a given class to be
!       aligned to the same margin, increasing readibility.
  
  
        10. Invocation of member functions with "this-&gt;"
--- 653,659 ----
        for definitions. For C++, where we have member functions that can
        be either inline definitions or declarations, keeping to this
        standard allows all member function names for a given class to be
!       aligned to the same margin, increasing readability.
  
  
        10. Invocation of member functions with "this-&gt;"
*************** indicate a place that may require attent
*** 679,685 ****
  
        12. Spacing under protected and private in class declarations:
        space above, none below
!       ie
  
        public:
        int foo;
--- 679,685 ----
  
        12. Spacing under protected and private in class declarations:
        space above, none below
!       i.e.
  
        public:
        int foo;
*************** indicate a place that may require attent
*** 691,697 ****
  
        13. Spacing WRT return statements.
        no extra spacing before returns, no parenthesis
!       ie
  
        }
        return __ret;
--- 691,697 ----
  
        13. Spacing WRT return statements.
        no extra spacing before returns, no parenthesis
!       i.e.
  
        }
        return __ret;
*************** indicate a place that may require attent
*** 708,714 ****
  
  
        14. Location of global variables.
!       All global variables of class type, whether in the "user visable"
        space (e.g., cin) or the implementation namespace, must be defined
        as a character array with the appropriate alignment and then later
        re-initialized to the correct value.
--- 708,714 ----
  
  
        14. Location of global variables.
!       All global variables of class type, whether in the "user visible"
        space (e.g., cin) or the implementation namespace, must be defined
        as a character array with the appropriate alignment and then later
        re-initialized to the correct value.
*************** indicate a place that may require attent
*** 1055,1061 ****
        <title>Prerequisites</title>
        <para>
  	Editing the DocBook sources requires an XML editor. Many
! 	exist: some noteable options
  	include <command>emacs</command>, <application>Kate</application>,
  	or <application>Conglomerate</application>.
        </para>
--- 1055,1061 ----
        <title>Prerequisites</title>
        <para>
  	Editing the DocBook sources requires an XML editor. Many
! 	exist: some notable options
  	include <command>emacs</command>, <application>Kate</application>,
  	or <application>Conglomerate</application>.
        </para>
*************** indicate a place that may require attent
*** 1083,1089 ****
        </para>
  
        <para>
! 	For procesessing XML, an XML processor and some style
  	sheets are necessary. Defaults are <command>xsltproc</command>
  	provided by <filename>libxslt</filename>.
        </para>
--- 1083,1089 ----
        </para>
  
        <para>
! 	For processing XML, an XML processor and some style
  	sheets are necessary. Defaults are <command>xsltproc</command>
  	provided by <filename>libxslt</filename>.
        </para>
*************** xmllint --noout --valid <filename>xml/in
*** 1163,1172 ****
        faq.xml  		- index to FAQ
        api.xml  		- index to source level / API 
  
!       All *.txml files are template xml files, ie otherwise empty files with
        the correct structure, suitable for filling in with new information.
  
!       <emphasis>Cannonical Writing Style</emphasis>
  
        class template
        function template
--- 1163,1172 ----
        faq.xml  		- index to FAQ
        api.xml  		- index to source level / API 
  
!       All *.txml files are template xml files, i.e., otherwise empty files with
        the correct structure, suitable for filling in with new information.
  
!       <emphasis>Canonical Writing Style</emphasis>
  
        class template
        function template
*************** xmllint --noout --valid <filename>xml/in
*** 1496,1502 ****
      "export") is badly needed.
  
      When building a shared library, the current compiler/linker cannot
!     automatically generate the instantiatiations needed. This creates a
      miserable situation; it means any time something is changed in the
      library, before a shared library can be built someone must manually
      copy the declarations of all templates that are needed by other parts
--- 1496,1502 ----
      "export") is badly needed.
  
      When building a shared library, the current compiler/linker cannot
!     automatically generate the instantiations needed. This creates a
      miserable situation; it means any time something is changed in the
      library, before a shared library can be built someone must manually
      copy the declarations of all templates that are needed by other parts
*************** xmllint --noout --valid <filename>xml/in
*** 2100,2106 ****
      by filebuf. These wrappings have not been completed, though there
      is scaffolding in place.
  
!     The encapulation of certain C header &lt;cstdio&gt; names presents an
      interesting problem. It is possible to define an inline std::fprintf()
      implemented in terms of the 'extern "C"' vfprintf(), but there is no
      standard vfscanf() to use to implement std::fscanf(). It appears that
--- 2100,2106 ----
      by filebuf. These wrappings have not been completed, though there
      is scaffolding in place.
  
!     The encapsulation of certain C header &lt;cstdio&gt; names presents an
      interesting problem. It is possible to define an inline std::fprintf()
      implemented in terms of the 'extern "C"' vfprintf(), but there is no
      standard vfscanf() to use to implement std::fscanf(). It appears that
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/xml/manual/backwards_compatibility.xml gcc-4.3.1/libstdc++-v3/doc/xml/manual/backwards_compatibility.xml
*** gcc-4.3.0/libstdc++-v3/doc/xml/manual/backwards_compatibility.xml	Mon Feb 11 00:01:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/xml/manual/backwards_compatibility.xml	Thu Apr 10 22:53:15 2008
*************** considered replaced and rewritten.
*** 148,154 ****
      then using that to set a value for the <code>NAMESPACE_STD</code>
      macro.  At that point, one is able to use
      <code>NAMESPACE_STD::string</code>, which will evaluate to
!     <code>std::string</code> or <code>::string</code> (ie, in the
      global namespace on systems that do not put <code>string</code> in
      <code>std::</code>).
    </para>
--- 148,154 ----
      then using that to set a value for the <code>NAMESPACE_STD</code>
      macro.  At that point, one is able to use
      <code>NAMESPACE_STD::string</code>, which will evaluate to
!     <code>std::string</code> or <code>::string</code> (i.e., in the
      global namespace on systems that do not put <code>string</code> in
      <code>std::</code>).
    </para>
*************** erase(size_type __pos = 0, size_type __n
*** 346,352 ****
  </programlisting>
  
  <para>
!   Unfortunately, ut <code>clear</code> is not implemented in this
    version, so you should use <code>erase</code> (which is probably
    faster than <code>operator=(charT*)</code>).
  </para>
--- 346,352 ----
  </programlisting>
  
  <para>
!   Unfortunately, <code>clear</code> is not implemented in this
    version, so you should use <code>erase</code> (which is probably
    faster than <code>operator=(charT*)</code>).
  </para>
*************** No <code>stream::attach(int fd)</code>
*** 815,821 ****
  
  <para>
        For a portable solution (among systems which use
!       filedescriptors), you need to implement a subclass of
        <code>std::streambuf</code> (or
        <code>std::basic_streambuf&lt;..&gt;</code>) which opens a file
        given a descriptor, and then pass an instance of this to the
--- 815,821 ----
  
  <para>
        For a portable solution (among systems which use
!       file descriptors), you need to implement a subclass of
        <code>std::streambuf</code> (or
        <code>std::basic_streambuf&lt;..&gt;</code>) which opens a file
        given a descriptor, and then pass an instance of this to the
*************** AC_DEFUN([AC_HEADER_UNORDERED_SET], [
*** 1312,1315 ****
  
  </bibliography>
  
! </sect1>
\ No newline at end of file
--- 1312,1315 ----
  
  </bibliography>
  
! </sect1>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/xml/manual/bitmap_allocator.xml gcc-4.3.1/libstdc++-v3/doc/xml/manual/bitmap_allocator.xml
*** gcc-4.3.0/libstdc++-v3/doc/xml/manual/bitmap_allocator.xml	Mon Feb 11 00:01:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/xml/manual/bitmap_allocator.xml	Thu Apr 10 22:53:15 2008
*************** else return false.</para></listitem>
*** 240,247 ****
    </para>
  
    <para>
!     Where, k =&gt; The constant overhead per node. eg. for list, it is
!     8 bytes, and for map it is 12 bytes. c =&gt; The size of the
      base type on which the map/list is instantiated. Thus, suppose the
      type1 is int and type2 is double, they are related by the relation
      sizeof(double) == 2*sizeof(int). Thus, all types must have this
--- 240,247 ----
    </para>
  
    <para>
!     where k is the constant overhead per node (e.g., for list, it is
!     8 bytes, and for map it is 12 bytes) and c is the size of the
      base type on which the map/list is instantiated. Thus, suppose the
      type1 is int and type2 is double, they are related by the relation
      sizeof(double) == 2*sizeof(int). Thus, all types must have this
*************** equivalent.</para></listitem>
*** 556,559 ****
  
  </sect2>
   
! </sect1>
\ No newline at end of file
--- 556,559 ----
  
  </sect2>
   
! </sect1>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/xml/manual/build_hacking.xml gcc-4.3.1/libstdc++-v3/doc/xml/manual/build_hacking.xml
*** gcc-4.3.0/libstdc++-v3/doc/xml/manual/build_hacking.xml	Mon Feb 11 00:01:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/xml/manual/build_hacking.xml	Thu Apr 10 22:53:15 2008
***************
*** 104,110 ****
  
    <para>
      Most comments should use {octothorpes, shibboleths, hash marks,
!     pound signs, whatevers} rather than "dnl".  Nearly all comments in
      configure.ac should.  Comments inside macros written in ancilliary
      .m4 files should.  About the only comments which should
      <emphasis>not</emphasis> use #, but use dnl instead, are comments
--- 104,110 ----
  
    <para>
      Most comments should use {octothorpes, shibboleths, hash marks,
!     pound signs, whatever} rather than "dnl".  Nearly all comments in
      configure.ac should.  Comments inside macros written in ancilliary
      .m4 files should.  About the only comments which should
      <emphasis>not</emphasis> use #, but use dnl instead, are comments
***************
*** 351,354 ****
  
  </sect2>
  
! </sect1>
\ No newline at end of file
--- 351,354 ----
  
  </sect2>
  
! </sect1>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/xml/manual/codecvt.xml gcc-4.3.1/libstdc++-v3/doc/xml/manual/codecvt.xml
*** gcc-4.3.0/libstdc++-v3/doc/xml/manual/codecvt.xml	Mon Feb 11 00:01:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/xml/manual/codecvt.xml	Thu Apr 10 22:53:15 2008
*************** UTF-16, UTF8, UTF16).
*** 190,196 ****
  
  <para>
  For iconv-based implementations, string literals for each of the
! encodings (ie. &quot;UCS-2&quot; and &quot;UTF-8&quot;) are necessary,
  although for other,
  non-iconv implementations a table of enumerated values or some other
  mechanism may be required.
--- 190,196 ----
  
  <para>
  For iconv-based implementations, string literals for each of the
! encodings (i.e. &quot;UCS-2&quot; and &quot;UTF-8&quot;) are necessary,
  although for other,
  non-iconv implementations a table of enumerated values or some other
  mechanism may be required.
*************** mechanism may be required.
*** 218,224 ****
  </para></listitem>
  
  <listitem><para>
!  Conversion descriptors for both directions of encoding. (ie, both
    UCS-2 to UTF-8 and UTF-8 to UCS-2.)
  </para></listitem>
  
--- 218,224 ----
  </para></listitem>
  
  <listitem><para>
!  Conversion descriptors for both directions of encoding. (i.e., both
    UCS-2 to UTF-8 and UTF-8 to UCS-2.)
  </para></listitem>
  
*************** codecvt&lt;char, char, mbstate_t&gt;
*** 301,307 ****
  </code>
  </para>
  <para>
! This is a degenerate (ie, does nothing) specialization. Implementing
  this was a piece of cake.
  </para>
  
--- 301,307 ----
  </code>
  </para>
  <para>
! This is a degenerate (i.e., does nothing) specialization. Implementing
  this was a piece of cake.
  </para>
  
*************** codecvt usage.
*** 727,730 ****
  
  </bibliography>
  
! </sect1>
\ No newline at end of file
--- 727,730 ----
  
  </bibliography>
  
! </sect1>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/xml/manual/concurrency.xml gcc-4.3.1/libstdc++-v3/doc/xml/manual/concurrency.xml
*** gcc-4.3.0/libstdc++-v3/doc/xml/manual/concurrency.xml	Mon Feb 11 00:01:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/xml/manual/concurrency.xml	Thu Apr 10 22:53:15 2008
*************** host hardware and operating system.
*** 194,200 ****
  <sect1 id="manual.ext.concurrency.impl" xreflabel="Implementation">
    <title>Implementation</title>
    <sect2 id="manual.ext.concurrency.impl.atomic_fallbacks" xreflabel="Atomic F">
!     <title>Using Builitin Atomic Functions</title>
      
  <para>The functions for atomic operations described above are either
  implemented via compiler intrinsics (if the underlying host is
--- 194,200 ----
  <sect1 id="manual.ext.concurrency.impl" xreflabel="Implementation">
    <title>Implementation</title>
    <sect2 id="manual.ext.concurrency.impl.atomic_fallbacks" xreflabel="Atomic F">
!     <title>Using Builtin Atomic Functions</title>
      
  <para>The functions for atomic operations described above are either
  implemented via compiler intrinsics (if the underlying host is
*************** hardware, hand-crafted assembly is selec
*** 261,267 ****
    <sect2 id="manual.ext.concurrency.impl.thread" xreflabel="Pthread">
      <title>Thread Abstraction</title>
  
! <para>A thin layer above IEEE 1003.1 (ie pthreads) is used to abstract
  the thread interface for GCC. This layer is called "gthread," and is
  comprised of one header file that wraps the host's default thread layer with
  a POSIX-like interface.
--- 261,267 ----
    <sect2 id="manual.ext.concurrency.impl.thread" xreflabel="Pthread">
      <title>Thread Abstraction</title>
  
! <para>A thin layer above IEEE 1003.1 (i.e. pthreads) is used to abstract
  the thread interface for GCC. This layer is called "gthread," and is
  comprised of one header file that wraps the host's default thread layer with
  a POSIX-like interface.
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/xml/manual/ctype.xml gcc-4.3.1/libstdc++-v3/doc/xml/manual/ctype.xml
*** gcc-4.3.0/libstdc++-v3/doc/xml/manual/ctype.xml	Mon Feb 11 00:01:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/xml/manual/ctype.xml	Thu Apr 10 22:53:15 2008
*************** characters.
*** 99,105 ****
     <listitem>
       <para> 
         Get the ctype&lt;wchar_t&gt;::mask stuff under control. Need to
!        make some kind of static table, and not do lookup evertime
         somebody hits the do_is... functions. Too bad we can't just
         redefine mask for ctype&lt;wchar_t&gt; 
     </para></listitem>
--- 99,105 ----
     <listitem>
       <para> 
         Get the ctype&lt;wchar_t&gt;::mask stuff under control. Need to
!        make some kind of static table, and not do lookup every time
         somebody hits the do_is... functions. Too bad we can't just
         redefine mask for ctype&lt;wchar_t&gt; 
     </para></listitem>
*************** characters.
*** 256,259 ****
  
  </bibliography>
  
! </sect1>
\ No newline at end of file
--- 256,259 ----
  
  </bibliography>
  
! </sect1>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/xml/manual/debug_mode.xml gcc-4.3.1/libstdc++-v3/doc/xml/manual/debug_mode.xml
*** gcc-4.3.0/libstdc++-v3/doc/xml/manual/debug_mode.xml	Mon Feb 11 00:01:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/xml/manual/debug_mode.xml	Thu Apr 10 22:53:15 2008
*************** template&lt;typename _Tp, typename _Allo
*** 582,588 ****
    allows release-compiled and debug-compiled code to be linked and
    executed together without causing unpredictable behavior. This
    guarantee minimizes the recompilation that users are required to
!   perform, shortening the detect-compile-debug bughunting cycle
    and making the debug mode easier to incorporate into development
    environments by minimizing dependencies.</para>
  
--- 582,588 ----
    allows release-compiled and debug-compiled code to be linked and
    executed together without causing unpredictable behavior. This
    guarantee minimizes the recompilation that users are required to
!   perform, shortening the detect-compile-debug bug hunting cycle
    and making the debug mode easier to incorporate into development
    environments by minimizing dependencies.</para>
  
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/xml/manual/diagnostics.xml gcc-4.3.1/libstdc++-v3/doc/xml/manual/diagnostics.xml
*** gcc-4.3.0/libstdc++-v3/doc/xml/manual/diagnostics.xml	Mon Feb 11 00:01:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/xml/manual/diagnostics.xml	Thu Apr 10 22:53:15 2008
***************
*** 39,45 ****
  
      <para>
        Derived from this are several classes that may have a
!       <classname>string</classname> member: a full heirarchy can be
        found in the <ulink url="http://gcc.gnu.org/onlinedocs/libstdc++/latest-doxygen/a00233.html">source documentation</ulink>.
      </para>
  
--- 39,45 ----
  
      <para>
        Derived from this are several classes that may have a
!       <classname>string</classname> member: a full hierarchy can be
        found in the <ulink url="http://gcc.gnu.org/onlinedocs/libstdc++/latest-doxygen/a00233.html">source documentation</ulink>.
      </para>
  
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/xml/manual/evolution.xml gcc-4.3.1/libstdc++-v3/doc/xml/manual/evolution.xml
*** gcc-4.3.0/libstdc++-v3/doc/xml/manual/evolution.xml	Mon Feb 11 00:01:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/xml/manual/evolution.xml	Thu Apr 10 22:53:15 2008
***************
*** 14,20 ****
  <title>API Evolution and Deprecation History</title>
  
  <para>
! A list of user-visible changes, in cronological order
  </para>
  
  <sect2 id="api.rel_300" xreflabel="api.rel_300">
--- 14,20 ----
  <title>API Evolution and Deprecation History</title>
  
  <para>
! A list of user-visible changes, in chronological order
  </para>
  
  <sect2 id="api.rel_300" xreflabel="api.rel_300">
*************** _Alloc_traits</code> have been removed.
*** 135,141 ****
  <para>
     Previous versions prior to 3.4 cache allocations in a memory
     pool, instead of passing through to call the global allocation
!    operators (ie, <classname>__gnu_cxx::pool_allocator</classname>).  More
     recent versions default to the
     simpler <classname>__gnu_cxx::new_allocator</classname>.
  </para>
--- 135,141 ----
  <para>
     Previous versions prior to 3.4 cache allocations in a memory
     pool, instead of passing through to call the global allocation
!    operators (i.e., <classname>__gnu_cxx::pool_allocator</classname>).  More
     recent versions default to the
     simpler <classname>__gnu_cxx::new_allocator</classname>.
  </para>
*************** Namespace pb_ds moved to __gnu_pb_ds.
*** 449,452 ****
  
  </sect2>
  
! </sect1>
\ No newline at end of file
--- 449,452 ----
  
  </sect2>
  
! </sect1>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/xml/manual/extensions.xml gcc-4.3.1/libstdc++-v3/doc/xml/manual/extensions.xml
*** gcc-4.3.0/libstdc++-v3/doc/xml/manual/extensions.xml	Mon Feb 11 00:01:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/xml/manual/extensions.xml	Thu Apr 10 22:53:15 2008
*************** get_temporary_buffer(5, (int*)0);
*** 357,363 ****
      <listitem><para><code>is_sorted</code> tests whether or not a range is sorted in
          nondescending order.</para></listitem>
     </itemizedlist>
! <para>25.3.8 (lexigraphical_compare) is extended with
  </para>
     <programlisting>
     lexicographical_compare_3way(_InputIter1 first1, _InputIter1 last1,
--- 357,363 ----
      <listitem><para><code>is_sorted</code> tests whether or not a range is sorted in
          nondescending order.</para></listitem>
     </itemizedlist>
! <para>25.3.8 (lexicographical_compare) is extended with
  </para>
     <programlisting>
     lexicographical_compare_3way(_InputIter1 first1, _InputIter1 last1,
*************** get_temporary_buffer(5, (int*)0);
*** 488,494 ****
  <chapter id="manual.ext.demangle" xreflabel="Demangling">
    <title>Demangling</title>
    <para>
!     Transforming C++ ABI itentifiers (like RTTI symbols) into the
      original C++ source identifiers is called
      <quote>demangling.</quote>
    </para>
--- 488,494 ----
  <chapter id="manual.ext.demangle" xreflabel="Demangling">
    <title>Demangling</title>
    <para>
!     Transforming C++ ABI identifiers (like RTTI symbols) into the
      original C++ source identifiers is called
      <quote>demangling.</quote>
    </para>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/xml/manual/locale.xml gcc-4.3.1/libstdc++-v3/doc/xml/manual/locale.xml
*** gcc-4.3.0/libstdc++-v3/doc/xml/manual/locale.xml	Mon Feb 11 00:01:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/xml/manual/locale.xml	Thu Apr 10 22:53:15 2008
*************** Literally, a facet is strictly defined:
*** 50,56 ****
  <itemizedlist>
    <listitem>
      <para>
!       Dontaining the following public data member:
      </para>
      <para>
        <code>static locale::id id;</code>
--- 50,56 ----
  <itemizedlist>
    <listitem>
      <para>
!       Containing the following public data member:
      </para>
      <para>
        <code>static locale::id id;</code>
*************** Provides an index for looking up specifi
*** 95,107 ****
  
  <para>
  The major design challenge is fitting an object-orientated and
! non-global locale design ontop of POSIX and other relevant stanards,
  which include the Single Unix (nee X/Open.)
  </para>
  
  <para>
  Because C and earlier versions of POSIX falls down so completely,
! portibility is an issue.
  </para>
  
  </sect2>
--- 95,107 ----
  
  <para>
  The major design challenge is fitting an object-orientated and
! non-global locale design on top of POSIX and other relevant standards,
  which include the Single Unix (nee X/Open.)
  </para>
  
  <para>
  Because C and earlier versions of POSIX falls down so completely,
! portability is an issue.
  </para>
  
  </sect2>
*************** global locale" (emphasis Paolo), that is
*** 461,467 ****
  <programlisting>std::setlocale(LC_ALL, "");</programlisting>
  
  <para>
!   On the other hand, there is *no* viceversa, that is, calling
    setlocale has *no* whatsoever on the C++ locale mechanism, in
    particular on the working of locale(""), which constructs the locale
    object from the environment of the running program, that is, in
--- 461,467 ----
  <programlisting>std::setlocale(LC_ALL, "");</programlisting>
  
  <para>
!   On the other hand, there is *no* vice versa, that is, calling
    setlocale has *no* whatsoever on the C++ locale mechanism, in
    particular on the working of locale(""), which constructs the locale
    object from the environment of the running program, that is, in
*************** global locale" (emphasis Paolo), that is
*** 486,492 ****
     <listitem>
       <para> 
         Document how named locales error check when filling data
!        members. Ie, a fr_FR locale that doesn't have
         numpunct::truename(): does it use "true"? Or is it a blank
         string? What's the convention? 
     </para>
--- 486,492 ----
     <listitem>
       <para> 
         Document how named locales error check when filling data
!        members. I.e., a fr_FR locale that doesn't have
         numpunct::truename(): does it use "true"? Or is it a blank
         string? What's the convention? 
     </para>
*************** global locale" (emphasis Paolo), that is
*** 504,510 ****
     <listitem>
       <para> 
         What should non-required facet instantiations do?  If the
!        generic implemenation is provided, then how to end-users
         provide specializations? 
     </para>
     </listitem>
--- 504,510 ----
     <listitem>
       <para> 
         What should non-required facet instantiations do?  If the
!        generic implementation is provided, then how to end-users
         provide specializations? 
     </para>
     </listitem>
*************** global locale" (emphasis Paolo), that is
*** 650,653 ****
  
  </bibliography>
  
! </sect1>
\ No newline at end of file
--- 650,653 ----
  
  </bibliography>
  
! </sect1>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/xml/manual/messages.xml gcc-4.3.1/libstdc++-v3/doc/xml/manual/messages.xml
*** gcc-4.3.0/libstdc++-v3/doc/xml/manual/messages.xml	Mon Feb 11 00:01:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/xml/manual/messages.xml	Thu Apr 10 22:53:15 2008
*************** model.
*** 238,244 ****
      library locale support is necessary for more than just the
      <code>LC_MESSAGES</code> mask: <code>LC_CTYPE</code> is also
      necessary. To avoid any unpleasantness, all bits of the "C" mask
!     (ie <code>LC_ALL</code>) are set before retrieving messages.
    </para>
  
    <para>
--- 238,244 ----
      library locale support is necessary for more than just the
      <code>LC_MESSAGES</code> mask: <code>LC_CTYPE</code> is also
      necessary. To avoid any unpleasantness, all bits of the "C" mask
!     (i.e. <code>LC_ALL</code>) are set before retrieving messages.
    </para>
  
    <para>
*************** void test01()
*** 377,383 ****
  	  There are issues with gettext needing the global locale set
  	  to extract a message. This dependence on the global locale
  	  makes the current "gnu" model non MT-safe. Future versions
! 	  of glibc, ie glibc 2.3.x will fix this, and the C++ library
  	  bits are already in place.
  	</para>
        </listitem>
--- 377,383 ----
  	  There are issues with gettext needing the global locale set
  	  to extract a message. This dependence on the global locale
  	  makes the current "gnu" model non MT-safe. Future versions
! 	  of glibc, i.e. glibc 2.3.x will fix this, and the C++ library
  	  bits are already in place.
  	</para>
        </listitem>
*************** void test01()
*** 399,405 ****
  <listitem>
    <para>
      At some point in the near future, std::numpunct will probably use
!     std::messages facilities to implement truename/falename
      correctly. This is currently not done, but entries in
      libstdc++.pot have already been made for "true" and "false" string
      literals, so all that remains is the std::numpunct coding and the
--- 399,405 ----
  <listitem>
    <para>
      At some point in the near future, std::numpunct will probably use
!     std::messages facilities to implement truename/falsename
      correctly. This is currently not done, but entries in
      libstdc++.pot have already been made for "true" and "false" string
      literals, so all that remains is the std::numpunct coding and the
*************** Library and Tools.
*** 601,604 ****
  
  </bibliography>
  
! </sect1>
\ No newline at end of file
--- 601,604 ----
  
  </bibliography>
  
! </sect1>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/xml/manual/parallel_mode.xml gcc-4.3.1/libstdc++-v3/doc/xml/manual/parallel_mode.xml
*** gcc-4.3.0/libstdc++-v3/doc/xml/manual/parallel_mode.xml	Mon Feb 11 00:01:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/xml/manual/parallel_mode.xml	Thu May 15 07:51:00 2008
*************** implementation of many algorithms the C+
*** 28,34 ****
  
  <para>
  Several of the standard algorithms, for instance
! <code>std::sort</code>, are made parallel using OpenMP
  annotations. These parallel mode constructs and can be invoked by
  explicit source declaration or by compiling existing sources with a
  specific compiler flag.
--- 28,34 ----
  
  <para>
  Several of the standard algorithms, for instance
! <function>std::sort</function>, are made parallel using OpenMP
  annotations. These parallel mode constructs and can be invoked by
  explicit source declaration or by compiling existing sources with a
  specific compiler flag.
*************** specific compiler flag.
*** 39,93 ****
    <title>Intro</title>
  
  <para>The following library components in the include
! <code>&lt;numeric&gt;</code> are included in the parallel mode:</para>
  <itemizedlist>
!   <listitem><para><code>std::accumulate</code></para></listitem>
!   <listitem><para><code>std::adjacent_difference</code></para></listitem>
!   <listitem><para><code>std::inner_product</code></para></listitem>
!   <listitem><para><code>std::partial_sum</code></para></listitem>
  </itemizedlist>
  
  <para>The following library components in the include
! <code>&lt;algorithm&gt;</code> are included in the parallel mode:</para>
! <itemizedlist>
!   <listitem><para><code>std::adjacent_find</code></para></listitem>
!   <listitem><para><code>std::count</code></para></listitem>
!   <listitem><para><code>std::count_if</code></para></listitem>
!   <listitem><para><code>std::equal</code></para></listitem>
!   <listitem><para><code>std::find</code></para></listitem>
!   <listitem><para><code>std::find_if</code></para></listitem>
!   <listitem><para><code>std::find_first_of</code></para></listitem>
!   <listitem><para><code>std::for_each</code></para></listitem>
!   <listitem><para><code>std::generate</code></para></listitem>
!   <listitem><para><code>std::generate_n</code></para></listitem>
!   <listitem><para><code>std::lexicographical_compare</code></para></listitem>
!   <listitem><para><code>std::mismatch</code></para></listitem>
!   <listitem><para><code>std::search</code></para></listitem>
!   <listitem><para><code>std::search_n</code></para></listitem>
!   <listitem><para><code>std::transform</code></para></listitem>
!   <listitem><para><code>std::replace</code></para></listitem>
!   <listitem><para><code>std::replace_if</code></para></listitem>
!   <listitem><para><code>std::max_element</code></para></listitem>
!   <listitem><para><code>std::merge</code></para></listitem>
!   <listitem><para><code>std::min_element</code></para></listitem>
!   <listitem><para><code>std::nth_element</code></para></listitem>
!   <listitem><para><code>std::partial_sort</code></para></listitem>
!   <listitem><para><code>std::partition</code></para></listitem>
!   <listitem><para><code>std::random_shuffle</code></para></listitem>
!   <listitem><para><code>std::set_union</code></para></listitem>
!   <listitem><para><code>std::set_intersection</code></para></listitem>
!   <listitem><para><code>std::set_symmetric_difference</code></para></listitem>
!   <listitem><para><code>std::set_difference</code></para></listitem>
!   <listitem><para><code>std::sort</code></para></listitem>
!   <listitem><para><code>std::stable_sort</code></para></listitem>
!   <listitem><para><code>std::unique_copy</code></para></listitem>
! </itemizedlist>
! 
! <para>The following library components in the includes
! <code>&lt;set&gt;</code> and <code>&lt;map&gt;</code> are included in the parallel mode:</para>
  <itemizedlist>
!   <listitem><para><code>std::(multi_)map/set&lt;T&gt;::(multi_)map/set(Iterator begin, Iterator end)</code> (bulk construction)</para></listitem>
!   <listitem><para><code>std::(multi_)map/set&lt;T&gt;::insert(Iterator begin, Iterator end)</code> (bulk insertion)</para></listitem>
  </itemizedlist>
  
  </sect1>
--- 39,86 ----
    <title>Intro</title>
  
  <para>The following library components in the include
! <filename class="headerfile">numeric</filename> are included in the parallel mode:</para>
  <itemizedlist>
!   <listitem><para><function>std::accumulate</function></para></listitem>
!   <listitem><para><function>std::adjacent_difference</function></para></listitem>
!   <listitem><para><function>std::inner_product</function></para></listitem>
!   <listitem><para><function>std::partial_sum</function></para></listitem>
  </itemizedlist>
  
  <para>The following library components in the include
! <filename class="headerfile">algorithm</filename> are included in the parallel mode:</para>
  <itemizedlist>
!   <listitem><para><function>std::adjacent_find</function></para></listitem>
!   <listitem><para><function>std::count</function></para></listitem>
!   <listitem><para><function>std::count_if</function></para></listitem>
!   <listitem><para><function>std::equal</function></para></listitem>
!   <listitem><para><function>std::find</function></para></listitem>
!   <listitem><para><function>std::find_if</function></para></listitem>
!   <listitem><para><function>std::find_first_of</function></para></listitem>
!   <listitem><para><function>std::for_each</function></para></listitem>
!   <listitem><para><function>std::generate</function></para></listitem>
!   <listitem><para><function>std::generate_n</function></para></listitem>
!   <listitem><para><function>std::lexicographical_compare</function></para></listitem>
!   <listitem><para><function>std::mismatch</function></para></listitem>
!   <listitem><para><function>std::search</function></para></listitem>
!   <listitem><para><function>std::search_n</function></para></listitem>
!   <listitem><para><function>std::transform</function></para></listitem>
!   <listitem><para><function>std::replace</function></para></listitem>
!   <listitem><para><function>std::replace_if</function></para></listitem>
!   <listitem><para><function>std::max_element</function></para></listitem>
!   <listitem><para><function>std::merge</function></para></listitem>
!   <listitem><para><function>std::min_element</function></para></listitem>
!   <listitem><para><function>std::nth_element</function></para></listitem>
!   <listitem><para><function>std::partial_sort</function></para></listitem>
!   <listitem><para><function>std::partition</function></para></listitem>
!   <listitem><para><function>std::random_shuffle</function></para></listitem>
!   <listitem><para><function>std::set_union</function></para></listitem>
!   <listitem><para><function>std::set_intersection</function></para></listitem>
!   <listitem><para><function>std::set_symmetric_difference</function></para></listitem>
!   <listitem><para><function>std::set_difference</function></para></listitem>
!   <listitem><para><function>std::sort</function></para></listitem>
!   <listitem><para><function>std::stable_sort</function></para></listitem>
!   <listitem><para><function>std::unique_copy</function></para></listitem>
  </itemizedlist>
  
  </sect1>
*************** specific compiler flag.
*** 96,102 ****
    <title>Semantics</title>
  
  <para> The parallel mode STL algorithms are currently not exception-safe,
! i. e. user-defined functors must not throw exceptions.
  </para>
  
  <para> Since the current GCC OpenMP implementation does not support
--- 89,97 ----
    <title>Semantics</title>
  
  <para> The parallel mode STL algorithms are currently not exception-safe,
! i.e. user-defined functors must not throw exceptions.
! Also, the order of execution is not guaranteed for some functions, of course.
! Therefore, user-defined functors should not have any concurrent side effects.
  </para>
  
  <para> Since the current GCC OpenMP implementation does not support
*************** It might work with other compilers, thou
*** 113,135 ****
  <sect2 id="parallel_mode.using.parallel_mode" xreflabel="using.parallel_mode">
    <title>Using Parallel Mode</title>
  
! <para>To use the libstdc++ parallel mode, compile your application with
!   the compiler flag <code>-D_GLIBCXX_PARALLEL -fopenmp</code>. This
!   will link in <code>libgomp</code>, the GNU OpenMP <ulink url="http://gcc.gnu.org/onlinedocs/libgomp">implementation</ulink>,
    whose presence is mandatory. In addition, hardware capable of atomic
    operations is mandatory. Actually activating these atomic
    operations may require explicit compiler flags on some targets
!   (like sparc and x86), such as <code>-march=i686</code>,
!   <code>-march=native</code> or <code>-mcpu=v9</code>.
  </para>
  
! <para>Note that the <code>_GLIBCXX_PARALLEL</code> define may change the
    sizes and behavior of standard class templates such as
!   <code>std::search</code>, and therefore one can only link code
    compiled with parallel mode and code compiled without parallel mode
    if no instantiation of a container is passed between the two
    translation units. Parallel mode functionality has distinct linkage,
!   and cannot be confused with normal mode symbols.</para>
  </sect2>
  
  <sect2 id="manual.ext.parallel_mode.usings" xreflabel="using.specific">
--- 108,132 ----
  <sect2 id="parallel_mode.using.parallel_mode" xreflabel="using.parallel_mode">
    <title>Using Parallel Mode</title>
  
! <para>
!   To use the libstdc++ parallel mode, compile your application with
!   the compiler flag <constant>-D_GLIBCXX_PARALLEL -fopenmp</constant>. This
!   will link in <code>libgomp</code>, the GNU OpenMP <ulink url="http://gcc.gnu.org/onlinedocs/libgomp/">implementation</ulink>,
    whose presence is mandatory. In addition, hardware capable of atomic
    operations is mandatory. Actually activating these atomic
    operations may require explicit compiler flags on some targets
!   (like sparc and x86), such as <literal>-march=i686</literal>,
!   <literal>-march=native</literal> or <literal>-mcpu=v9</literal>.
  </para>
  
! <para>Note that the <constant>_GLIBCXX_PARALLEL</constant> define may change the
    sizes and behavior of standard class templates such as
!   <function>std::search</function>, and therefore one can only link code
    compiled with parallel mode and code compiled without parallel mode
    if no instantiation of a container is passed between the two
    translation units. Parallel mode functionality has distinct linkage,
!   and cannot be confused with normal mode symbols.
! </para>
  </sect2>
  
  <sect2 id="manual.ext.parallel_mode.usings" xreflabel="using.specific">
*************** It might work with other compilers, thou
*** 420,428 ****
    <title>Interface Basics</title>
  
  
! <para>All parallel algorithms are intended to have signatures that are
  equivalent to the ISO C++ algorithms replaced. For instance, the
! <code>std::adjacent_find</code> function is declared as:
  </para>
  <programlisting>
  namespace std
--- 417,426 ----
    <title>Interface Basics</title>
  
  
! <para>
! All parallel algorithms are intended to have signatures that are
  equivalent to the ISO C++ algorithms replaced. For instance, the
! <function>std::adjacent_find</function> function is declared as:
  </para>
  <programlisting>
  namespace std
*************** namespace std
*** 452,461 ****
  }
  </programlisting>
  
! <para>But.... why the elipses?
  </para>
  
! <para> The elipses in the example above represent additional overloads
  required for the parallel version of the function. These additional
  overloads are used to dispatch calls from the ISO C++ function
  signature to the appropriate parallel function (or sequential
--- 450,459 ----
  }
  </programlisting>
  
! <para>But.... why the ellipses?
  </para>
  
! <para> The ellipses in the example above represent additional overloads
  required for the parallel version of the function. These additional
  overloads are used to dispatch calls from the ISO C++ function
  signature to the appropriate parallel function (or sequential
*************** function, if no parallel functions are d
*** 463,496 ****
  compile-time or run-time conditions.
  </para>
  
! <para> Compile-time conditions are referred to as "embarrassingly
! parallel," and are denoted with the appropriate dispatch object, ie
! one of <code>__gnu_parallel::sequential_tag</code>,
! <code>__gnu_parallel::parallel_tag</code>,
! <code>__gnu_parallel::balanced_tag</code>,
! <code>__gnu_parallel::unbalanced_tag</code>,
! <code>__gnu_parallel::omp_loop_tag</code>, or
! <code>__gnu_parallel::omp_loop_static_tag</code>.
! </para>
! 
! <para> Run-time conditions depend on the hardware being used, the number
! of threads available, etc., and are denoted by the use of the enum
! <code>__gnu_parallel::parallelism</code>. Values of this enum include
! <code>__gnu_parallel::sequential</code>,
! <code>__gnu_parallel::parallel_unbalanced</code>,
! <code>__gnu_parallel::parallel_balanced</code>,
! <code>__gnu_parallel::parallel_omp_loop</code>,
! <code>__gnu_parallel::parallel_omp_loop_static</code>, or
! <code>__gnu_parallel::parallel_taskqueue</code>.
! </para>
  
! <para> Putting all this together, the general view of overloads for the
! parallel algorithms look like this:
  </para>
  <itemizedlist>
     <listitem><para>ISO C++ signature</para></listitem>
     <listitem><para>ISO C++ signature + sequential_tag argument</para></listitem>
!    <listitem><para>ISO C++ signature + parallelism argument</para></listitem>
  </itemizedlist>
  
  <para> Please note that the implementation may use additional functions
--- 461,476 ----
  compile-time or run-time conditions.
  </para>
  
! <para> The available signature options are specific for the different
! algorithms/algorithm classes.</para>
  
! <para> The general view of overloads for the parallel algorithms look like this:
  </para>
  <itemizedlist>
     <listitem><para>ISO C++ signature</para></listitem>
     <listitem><para>ISO C++ signature + sequential_tag argument</para></listitem>
!    <listitem><para>ISO C++ signature + algorithm-specific tag type
!     (several signatures)</para></listitem>
  </itemizedlist>
  
  <para> Please note that the implementation may use additional functions
*************** overload is therefore missing.
*** 506,544 ****
  <sect2 id="manual.ext.parallel_mode.design.tuning" xreflabel="Tuning">
    <title>Configuration and Tuning</title>
  
! <para> Some algorithm variants can be enabled/disabled/selected at compile-time.
! See <ulink url="latest-doxygen/compiletime__settings_8h.html">
! <code>&lt;compiletime_settings.h&gt;</code></ulink> and
! See <ulink url="latest-doxygen/compiletime__settings_8h.html">
! <code>&lt;features.h&gt;</code></ulink> for details.
  </para>
  
  <para>
! To specify the number of threads to be used for an algorithm,
! use <code>omp_set_num_threads</code>.
! To force a function to execute sequentially,
! even though parallelism is switched on in general,
! add <code>__gnu_parallel::sequential_tag()</code>
! to the end of the argument list.
  </para>
  
  <para>
! Parallelism always incurs some overhead. Thus, it is not
! helpful to parallelize operations on very small sets of data.
! There are measures to avoid parallelizing stuff that is not worth it.
! For each algorithm, a minimum problem size can be stated,
! usually using the variable
! <code>__gnu_parallel::Settings::[algorithm]_minimal_n</code>.
! Please see <ulink url="latest-doxygen/settings_8h.html">
! <code>&lt;settings.h&gt;</code></ulink> for details.</para>
  
  
  </sect2>
  
  <sect2 id="manual.ext.parallel_mode.design.impl" xreflabel="Impl">
    <title>Implementation Namespaces</title>
  
! <para> One namespace contain versions of code that are explicitly sequential:
  <code>__gnu_serial</code>.
  </para>
  
--- 486,681 ----
  <sect2 id="manual.ext.parallel_mode.design.tuning" xreflabel="Tuning">
    <title>Configuration and Tuning</title>
  
! 
! <sect3 id="parallel_mode.design.tuning.omp" xreflabel="OpenMP Environment">
!   <title>Setting up the OpenMP Environment</title>
! 
! <para>
! Several aspects of the overall runtime environment can be manipulated
! by standard OpenMP function calls.
  </para>
  
  <para>
! To specify the number of threads to be used for the algorithms globally,
! use the function <function>omp_set_num_threads</function>. An example:
  </para>
  
+ <programlisting>
+ #include &lt;stdlib.h&gt;
+ #include &lt;omp.h&gt;
+ 
+ int main()
+ {
+   // Explicitly set number of threads.
+   const int threads_wanted = 20;
+   omp_set_dynamic(false);
+   omp_set_num_threads(threads_wanted);
+ 
+   // Call parallel mode algorithms.
+ 
+   return 0;
+ }
+ </programlisting>
+ 
  <para>
!  Some algorithms allow the number of threads being set for a particular call,
!  by augmenting the algorithm variant.
!  See the next section for further information.
! </para>
! 
! <para>
! Other parts of the runtime environment able to be manipulated include
! nested parallelism (<function>omp_set_nested</function>), schedule kind
! (<function>omp_set_schedule</function>), and others. See the OpenMP
! documentation for more information.
! </para>
! 
! </sect3>
! 
! <sect3 id="parallel_mode.design.tuning.compile" xreflabel="Compile Switches">
!   <title>Compile Time Switches</title>
! 
! <para>
! To force an algorithm to execute sequentially, even though parallelism
! is switched on in general via the macro <constant>_GLIBCXX_PARALLEL</constant>,
! add <classname>__gnu_parallel::sequential_tag()</classname> to the end
! of the algorithm's argument list.
! </para>
! 
! <para>
! Like so:
! </para>
! 
! <programlisting>
! std::sort(v.begin(), v.end(), __gnu_parallel::sequential_tag());
! </programlisting>
! 
! <para>
! Some parallel algorithm variants can be excluded from compilation by
! preprocessor defines. See the doxygen documentation on
! <code>compiletime_settings.h</code> and <code>features.h</code> for details.
! </para>
! 
! <para>
! For some algorithms, the desired variant can be chosen at compile-time by
! appending a tag object. The available options are specific to the particular
! algorithm (class).
! </para>
! 
! <para>
! For the "embarrassingly parallel" algorithms, there is only one "tag object
! type", the enum _Parallelism.
! It takes one of the following values,
! <code>__gnu_parallel::parallel_tag</code>,
! <code>__gnu_parallel::balanced_tag</code>,
! <code>__gnu_parallel::unbalanced_tag</code>,
! <code>__gnu_parallel::omp_loop_tag</code>,
! <code>__gnu_parallel::omp_loop_static_tag</code>.
! This means that the actual parallelization strategy is chosen at run-time.
! (Choosing the variants at compile-time will come soon.)
! </para>
! 
! </sect3>
! 
! <sect3 id="parallel_mode.design.tuning.settings" xreflabel="_Settings">
!   <title>Run Time Settings and Defaults</title>
! 
! <para>
! The default parallelization strategy, the choice of specific algorithm
! strategy, the minimum threshold limits for individual parallel
! algorithms, and aspects of the underlying hardware can be specified as
! desired via manipulation
! of <classname>__gnu_parallel::_Settings</classname> member data.
! </para>
! 
! <para>
! First off, the choice of parallelization strategy: serial, parallel,
! or heuristically deduced. This corresponds
! to <code>__gnu_parallel::_Settings::algorithm_strategy</code> and is a
! value of enum <type>__gnu_parallel::_AlgorithmStrategy</type>
! type. Choices
! include: <type>heuristic</type>, <type>force_sequential</type>,
! and <type>force_parallel</type>. The default is <type>heuristic</type>.
! </para>
! 
! 
! <para>
! Next, the sub-choices for algorithm variant, if not fixed at compile-time.
! Specific algorithms like <function>find</function> or <function>sort</function>
! can be implemented in multiple ways: when this is the case,
! a <classname>__gnu_parallel::_Settings</classname> member exists to
! pick the default strategy. For
! example, <code>__gnu_parallel::_Settings::sort_algorithm</code> can
! have any values of
! enum <type>__gnu_parallel::_SortAlgorithm</type>: <type>MWMS</type>, <type>QS</type>,
! or <type>QS_BALANCED</type>.
! </para>
! 
! <para>
! Likewise for setting the minimal threshold for algorithm
! parallelization.  Parallelism always incurs some overhead. Thus, it is
! not helpful to parallelize operations on very small sets of
! data. Because of this, measures are taken to avoid parallelizing below
! a certain, pre-determined threshold. For each algorithm, a minimum
! problem size is encoded as a variable in the
! active <classname>__gnu_parallel::_Settings</classname> object.  This
! threshold variable follows the following naming scheme:
! <code>__gnu_parallel::_Settings::[algorithm]_minimal_n</code>.  So,
! for <function>fill</function>, the threshold variable
! is <code>__gnu_parallel::_Settings::fill_minimal_n</code>,
! </para>
! 
! <para>
! Finally, hardware details like L1/L2 cache size can be hardwired
! via <code>__gnu_parallel::_Settings::L1_cache_size</code> and friends.
! </para>
! 
! <para>
! </para>
! 
! <para>
! All these configuration variables can be changed by the user, if
! desired.
! There exists one global instance of the class <classname>_Settings</classname>,
! i. e. it is a singleton. It can be read and written by calling
! <code>__gnu_parallel::_Settings::get</code> and
! <code>__gnu_parallel::_Settings::set</code>, respectively.
! Please note that the first call return a const object, so direct manipulation
! is forbidden.
! See <ulink url="http://gcc.gnu.org/onlinedocs/libstdc++/latest-doxygen/a00640.html">
!   <filename class="headerfile">settings.h</filename></ulink>
! for complete details.
! </para>
! 
! <para>
! A small example of tuning the default:
! </para>
! 
! <programlisting>
! #include &lt;parallel/algorithm&gt;
! #include &lt;parallel/settings.h&gt;
! 
! int main()
! {
!   __gnu_parallel::_Settings s;
!   s.algorithm_strategy = __gnu_parallel::force_parallel;
!   __gnu_parallel::_Settings::set(s);
! 
!   // Do work... all algorithms will be parallelized, always.
  
+   return 0;
+ }
+ </programlisting>
+ 
+ </sect3>
  
  </sect2>
  
  <sect2 id="manual.ext.parallel_mode.design.impl" xreflabel="Impl">
    <title>Implementation Namespaces</title>
  
! <para> One namespace contain versions of code that are always
! explicitly sequential:
  <code>__gnu_serial</code>.
  </para>
  
*************** Please see <ulink url="latest-doxygen/se
*** 548,557 ****
  
  <para> Parallel implementations of standard components, including
  template helpers to select parallelism, are defined in <code>namespace
! std::__parallel</code>. For instance, <code>std::transform</code> from
! &lt;algorithm&gt; has a parallel counterpart in
! <code>std::__parallel::transform</code> from
! &lt;parallel/algorithm&gt;. In addition, these parallel
  implementations are injected into <code>namespace
  __gnu_parallel</code> with using declarations.
  </para>
--- 685,692 ----
  
  <para> Parallel implementations of standard components, including
  template helpers to select parallelism, are defined in <code>namespace
! std::__parallel</code>. For instance, <function>std::transform</function> from <filename class="headerfile">algorithm</filename> has a parallel counterpart in
! <function>std::__parallel::transform</function> from <filename class="headerfile">parallel/algorithm</filename>. In addition, these parallel
  implementations are injected into <code>namespace
  __gnu_parallel</code> with using declarations.
  </para>
*************** the generated source documentation.
*** 588,594 ****
    
    <para>
      The log and summary files for conformance testing are in the
!     <code>testsuite/parallel</code> directory.
    </para>
  
    <para> 
--- 723,729 ----
    
    <para>
      The log and summary files for conformance testing are in the
!     <filename class="directory">testsuite/parallel</filename> directory.
    </para>
  
    <para> 
*************** the generated source documentation.
*** 596,608 ****
    </para>
  
    <screen>
!   <userinput>check-performance-parallel</userinput>
    </screen>
  
    <para>
      The result file for performance testing are in the
!     <code>testsuite</code> directory, in the file
!     <code>libstdc++_performance.sum</code>. In addition, the
      policy-based containers have their own visualizations, which have
      additional software dependencies than the usual bare-boned text
      file, and can be generated by using the <code>make
--- 731,743 ----
    </para>
  
    <screen>
!   <userinput>make check-performance-parallel</userinput>
    </screen>
  
    <para>
      The result file for performance testing are in the
!     <filename class="directory">testsuite</filename> directory, in the file
!     <filename>libstdc++_performance.sum</filename>. In addition, the
      policy-based containers have their own visualizations, which have
      additional software dependencies than the usual bare-boned text
      file, and can be generated by using the <code>make
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/xml/manual/status_cxx200x.xml gcc-4.3.1/libstdc++-v3/doc/xml/manual/status_cxx200x.xml
*** gcc-4.3.0/libstdc++-v3/doc/xml/manual/status_cxx200x.xml	Mon Feb 11 00:01:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/xml/manual/status_cxx200x.xml	Thu Apr 10 22:53:15 2008
*************** particular release.
*** 1052,1058 ****
      </row>
      <row>
        <entry>26.4.7.2</entry>
!       <entry>Function template <code>generate_cannonical</code></entry>
        <entry></entry>
        <entry></entry>
        <entry>missing</entry>
--- 1052,1058 ----
      </row>
      <row>
        <entry>26.4.7.2</entry>
!       <entry>Function template <code>generate_canonical</code></entry>
        <entry></entry>
        <entry></entry>
        <entry>missing</entry>
*************** Footnotes
*** 2238,2241 ****
      shared_ptr</ulink> library.
  </para>  
  
! </sect2>
\ No newline at end of file
--- 2238,2241 ----
      shared_ptr</ulink> library.
  </para>  
  
! </sect2>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/xml/manual/strings.xml gcc-4.3.1/libstdc++-v3/doc/xml/manual/strings.xml
*** gcc-4.3.0/libstdc++-v3/doc/xml/manual/strings.xml	Mon Feb 11 00:01:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/xml/manual/strings.xml	Thu Apr 10 22:53:15 2008
***************
*** 35,41 ****
        <code>transform&lt;&gt;</code> is used.
     </para>
     <para>
!      This code will go through some iterations.  Here's a simiple
       version:
     </para>
     <programlisting>
--- 35,41 ----
        <code>transform&lt;&gt;</code> is used.
     </para>
     <para>
!      This code will go through some iterations.  Here's a simple
       version:
     </para>
     <programlisting>
***************
*** 126,132 ****
   
    </sect1>
    <sect1 id="strings.string.case" xreflabel="Case Sensitivity">
!     <title>Case Sensivitity</title>
      <para>
      </para>
  
--- 126,132 ----
   
    </sect1>
    <sect1 id="strings.string.case" xreflabel="Case Sensitivity">
!     <title>Case Sensitivity</title>
      <para>
      </para>
  
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/xml/manual/support.xml gcc-4.3.1/libstdc++-v3/doc/xml/manual/support.xml
*** gcc-4.3.0/libstdc++-v3/doc/xml/manual/support.xml	Mon Feb 11 00:01:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/xml/manual/support.xml	Thu Apr 10 22:53:15 2008
***************
*** 98,104 ****
      </para>
      
    </sect1>
!   <sect1 id="manual.support.types.numeric_limits" xreflabel="Numeric Properites">
      <title>Numeric Properties</title>
  
  
--- 98,104 ----
      </para>
      
    </sect1>
!   <sect1 id="manual.support.types.numeric_limits" xreflabel="Numeric Properties">
      <title>Numeric Properties</title>
  
  
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/xml/manual/test.xml gcc-4.3.1/libstdc++-v3/doc/xml/manual/test.xml
*** gcc-4.3.0/libstdc++-v3/doc/xml/manual/test.xml	Mon Feb 11 00:01:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/xml/manual/test.xml	Thu Apr 10 22:53:15 2008
*************** runtest --tool libstdc++ --srcdir=/path/
*** 511,517 ****
         </para>
         <para> 
  	 This file indicates that the host system can run tests which
! 	 incolved multiple threads.
         </para>
       </listitem>
  
--- 511,517 ----
         </para>
         <para> 
  	 This file indicates that the host system can run tests which
! 	 involved multiple threads.
         </para>
       </listitem>
  
*************** runtest --tool libstdc++ --srcdir=/path/
*** 563,569 ****
  
     <para>
        We are interested in any strange failures of the testsuite;
!       please email the main libstdc++ mainling list if you see
        something odd or have questions.
     </para>
    </sect3>
--- 563,569 ----
  
     <para>
        We are interested in any strange failures of the testsuite;
!       please email the main libstdc++ mailing list if you see
        something odd or have questions.
     </para>
    </sect3>
*************** Currently plans for supported keywords i
*** 820,823 ****
  
  </sect2>
  
! </sect1>
\ No newline at end of file
--- 820,823 ----
  
  </sect2>
  
! </sect1>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/doc/xml/manual/using.xml gcc-4.3.1/libstdc++-v3/doc/xml/manual/using.xml
*** gcc-4.3.0/libstdc++-v3/doc/xml/manual/using.xml	Mon Feb 11 00:01:33 2008
--- gcc-4.3.1/libstdc++-v3/doc/xml/manual/using.xml	Thu Apr 10 22:53:15 2008
***************
*** 110,116 ****
     </para>
  
     <para>
!      C++98/03 include files. These are available in the default compilation mode, ie <code>-std=c++98</code> or <code>-std=gnu++98</code>. 
     </para>
  
  <table frame='all'>
--- 110,116 ----
     </para>
  
     <para>
!      C++98/03 include files. These are available in the default compilation mode, i.e. <code>-std=c++98</code> or <code>-std=gnu++98</code>.
     </para>
  
  <table frame='all'>
***************
*** 149,155 ****
  </tgroup>
  </table>
  
! <para>C++0x include files. These are only available in C++0x compilation mode, ie <code>-std=c++0x</code> or <code>-std=gnu++0x</code>. 
  </para>
  
  <para></para>
--- 149,155 ----
  </tgroup>
  </table>
  
! <para>C++0x include files. These are only available in C++0x compilation mode, i.e. <code>-std=c++0x</code> or <code>-std=gnu++0x</code>.
  </para>
  
  <para></para>
*************** g++ -Winvalid-pch -I. -include stdc++.h 
*** 470,476 ****
  <itemizedlist>
    <listitem><para>std</para>
  <para>The ISO C++ standards specify that "all library entities are defined
! within namespace std." This includes namepaces nested
  within <code>namespace std</code>, such as <code>namespace
  std::tr1</code>.
  </para>
--- 470,476 ----
  <itemizedlist>
    <listitem><para>std</para>
  <para>The ISO C++ standards specify that "all library entities are defined
! within namespace std." This includes namespaces nested
  within <code>namespace std</code>, such as <code>namespace
  std::tr1</code>.
  </para>
*************** cases where the qualified verbiage becom
*** 521,527 ****
  
      </sect2>
  
!     <sect2 id="manual.intro.using.namespaces.comp" xreflabel="Using Namepace Composition">
        <title>Using Namespace Composition</title>
  
  <para>
--- 521,527 ----
  
      </sect2>
  
!     <sect2 id="manual.intro.using.namespaces.comp" xreflabel="Using Namespace Composition">
        <title>Using Namespace Composition</title>
  
  <para>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/Makefile.am gcc-4.3.1/libstdc++-v3/include/Makefile.am
*** gcc-4.3.0/libstdc++-v3/include/Makefile.am	Fri Feb 29 00:00:39 2008
--- gcc-4.3.1/libstdc++-v3/include/Makefile.am	Mon Apr 28 21:38:19 2008
*************** allcreated = \
*** 853,924 ****
  # Here are the rules for building the headers
  all-local: ${allstamped} ${allcreated}
  
! # This rule is slightly different, in that we must change the name of the
! # local file from std_foo.h to foo.
  stamp-std: ${std_headers}
! 	@if [ ! -d "${std_builddir}" ]; then \
! 	  mkdir -p ${std_builddir} ;\
! 	fi ;\
! 	if [ ! -f stamp-std ]; then \
! 	  (cd ${std_builddir} && $(LN_S) $? . || true) ;\
! 	fi ;\
! 	$(STAMP) stamp-std
  
  stamp-bits: ${bits_headers}
! 	@if [ ! -d "${bits_builddir}" ]; then \
! 	  mkdir -p ${bits_builddir} ;\
! 	fi ;\
! 	if [ ! -f stamp-bits ]; then \
! 	  (cd ${bits_builddir} && $(LN_S) $? . || true) ;\
! 	fi ;\
! 	$(STAMP) stamp-bits
  
! stamp-c_base: ${c_base_headers} 
! 	@if [ ! -d "${c_base_builddir}" ]; then \
! 	  mkdir -p ${c_base_builddir} ;\
! 	fi ;\
! 	if [ ! -f stamp-c_base ]; then \
! 	  (cd ${c_base_builddir} && $(LN_S) $? . || true) ;\
! 	fi ;\
! 	$(STAMP) stamp-c_base
  
  stamp-c_base_extra: ${c_base_headers_extra}
! 	@if [ ! -d "${bits_builddir}" ]; then \
! 	  mkdir -p ${bits_builddir} ;\
! 	fi ;\
! 	if [ ! -f stamp-c_base_extra ]; then \
! 	  (cd ${bits_builddir} && $(LN_S) $? . || true) ;\
! 	fi ;\
! 	$(STAMP) stamp-c_base_extra
  
  stamp-c_compatibility: ${c_compatibility_headers_extra}
! 	@if [ ! -d "${c_compatibility_builddir}" ]; then \
! 	  mkdir -p ${c_compatibility_builddir} ;\
! 	fi ;\
! 	if [ ! -f stamp-c_compatibility ]; then \
! 	  if [ ! -z "${c_compatibility_headers_extra}" ]; then \
! 	    (cd ${c_compatibility_builddir} && $(LN_S) $? . || true) ;\
! 	  fi ;\
! 	fi ;\
! 	$(STAMP) stamp-c_compatibility
  
  stamp-backward: ${backward_headers}
! 	@if [ ! -d "${backward_builddir}" ]; then \
! 	  mkdir -p ${backward_builddir} ;\
! 	fi ;\
! 	if [ ! -f stamp-backward ]; then \
! 	  (cd ${backward_builddir} && $(LN_S) $? . || true) ;\
! 	fi ;\
! 	$(STAMP) stamp-backward
  
  stamp-ext: ${ext_headers}
! 	@if [ ! -d "${ext_builddir}" ]; then \
! 	    mkdir -p ${ext_builddir} ;\
! 	fi ;\
! 	if [ ! -f stamp-ext ]; then \
! 	  (cd ${ext_builddir} && $(LN_S) $? . || true) ;\
! 	fi ;\
! 	$(STAMP) stamp-ext
  
  # Have to deal with nested include directories, gah! Strip off source
  # directory before making the link.
--- 853,898 ----
  # Here are the rules for building the headers
  all-local: ${allstamped} ${allcreated}
  
! # Ignore errors from 'mkdir -p' to avoid parallel make failure on
! # systems with broken mkdir.  Call mkdir unconditionally because
! # it is just as cheap to avoid going through the shell.
! # Ignore errors from $(LN_S) because the links may already exist.
  stamp-std: ${std_headers}
! 	@-mkdir -p ${std_builddir}
! 	@-cd ${std_builddir} && $(LN_S) $? . 2>/dev/null
! 	@$(STAMP) stamp-std
  
  stamp-bits: ${bits_headers}
! 	@-mkdir -p ${bits_builddir}
! 	@-cd ${bits_builddir} && $(LN_S) $? . 2>/dev/null
! 	@$(STAMP) stamp-bits
  
! stamp-c_base: ${c_base_headers}
! 	@-mkdir -p ${c_base_builddir}
! 	@-cd ${c_base_builddir} && $(LN_S) $? . 2>/dev/null
! 	@$(STAMP) stamp-c_base
  
  stamp-c_base_extra: ${c_base_headers_extra}
! 	@-mkdir -p ${bits_builddir}
! 	@-cd ${bits_builddir} && $(LN_S) $? . 2>/dev/null
! 	@$(STAMP) stamp-c_base_extra
  
  stamp-c_compatibility: ${c_compatibility_headers_extra}
! 	@-mkdir -p ${c_compatibility_builddir}
! 	@-if [ ! -z "${c_compatibility_headers_extra}" ]; then \
! 	  cd ${c_compatibility_builddir} && $(LN_S) $? . 2>/dev/null ;\
! 	fi
! 	@$(STAMP) stamp-c_compatibility
  
  stamp-backward: ${backward_headers}
! 	@-mkdir -p ${backward_builddir}
! 	@-cd ${backward_builddir} && $(LN_S) $? . 2>/dev/null
! 	@$(STAMP) stamp-backward
  
  stamp-ext: ${ext_headers}
! 	@-mkdir -p ${ext_builddir}
! 	@-cd ${ext_builddir} && $(LN_S) $? . 2>/dev/null
! 	@$(STAMP) stamp-ext
  
  # Have to deal with nested include directories, gah! Strip off source
  # directory before making the link.
*************** stamp-pb:
*** 972,1023 ****
  	$(STAMP) stamp-pb
  
  stamp-tr1: ${tr1_headers}
! 	@if [ ! -d "${tr1_builddir}" ]; then \
! 	    mkdir -p ${tr1_builddir} ;\
! 	fi ;\
! 	if [ ! -f stamp-tr1 ]; then \
! 	  (cd ${tr1_builddir} && $(LN_S) $? . || true) ;\
! 	fi ;\
! 	$(STAMP) stamp-tr1
  
  stamp-tr1-impl: ${tr1_impl_headers}
! 	@if [ ! -d "${tr1_impl_builddir}" ]; then \
! 	    mkdir -p ${tr1_impl_builddir} ;\
! 	fi ;\
! 	if [ ! -f stamp-tr1-impl ]; then \
! 	  (cd ${tr1_impl_builddir} && $(LN_S) $? . || true) ;\
! 	fi ;\
! 	$(STAMP) stamp-tr1-impl
  
  stamp-debug: ${debug_headers}
! 	@if [ ! -d "${debug_builddir}" ]; then \
! 	  mkdir -p ${debug_builddir} ;\
! 	fi ;\
! 	if [ ! -f stamp-debug ]; then \
! 	  (cd ${debug_builddir} && @LN_S@ $? . || true) ;\
! 	fi ;\
! 	$(STAMP) stamp-debug
  
  stamp-parallel: ${parallel_headers}
! 	@if [ ! -d "${parallel_builddir}" ]; then \
! 	  mkdir -p ${parallel_builddir} ;\
! 	fi ;\
! 	if [ ! -f stamp-parallel ]; then \
! 	  (cd ${parallel_builddir} && @LN_S@ $? . || true) ;\
! 	fi ;\
! 	$(STAMP) stamp-parallel
  
  stamp-${host_alias}:
! 	@if [ ! -d ${host_builddir} ]; then \
! 	  mkdir -p ${host_builddir} ;\
! 	fi ;\
! 	$(STAMP) stamp-${host_alias}
  
  # Host includes static.
  # XXX Missing dependency info for {host_headers_extra}
  stamp-host: ${host_headers} ${host_headers_noinst} stamp-${host_alias}
! 	@if [ ! -f stamp-host ]; then \
! 	  (cd ${host_builddir} ;\
  	  $(LN_S) ${host_headers} . || true ;\
  	  $(LN_S) ${glibcxx_srcdir}/$(BASIC_FILE_H) basic_file.h || true ;\
  	  $(LN_S) ${glibcxx_srcdir}/$(ALLOCATOR_H) c++allocator.h || true ;\
--- 946,978 ----
  	$(STAMP) stamp-pb
  
  stamp-tr1: ${tr1_headers}
! 	@-mkdir -p ${tr1_builddir}
! 	@-cd ${tr1_builddir} && $(LN_S) $? . 2>/dev/null
! 	@$(STAMP) stamp-tr1
  
  stamp-tr1-impl: ${tr1_impl_headers}
! 	@-mkdir -p ${tr1_impl_builddir}
! 	@-cd ${tr1_impl_builddir} && $(LN_S) $? . 2>/dev/null
! 	@$(STAMP) stamp-tr1-impl
  
  stamp-debug: ${debug_headers}
! 	@-mkdir -p ${debug_builddir}
! 	@-cd ${debug_builddir} && $(LN_S) $? . 2>/dev/null
! 	@$(STAMP) stamp-debug
  
  stamp-parallel: ${parallel_headers}
! 	@-mkdir -p ${parallel_builddir}
! 	@-cd ${parallel_builddir} && $(LN_S) $? . 2>/dev/null
! 	@$(STAMP) stamp-parallel
  
  stamp-${host_alias}:
! 	@-mkdir -p ${host_builddir}
! 	@$(STAMP) stamp-${host_alias}
  
  # Host includes static.
  # XXX Missing dependency info for {host_headers_extra}
  stamp-host: ${host_headers} ${host_headers_noinst} stamp-${host_alias}
! 	@cd ${host_builddir} && {\
  	  $(LN_S) ${host_headers} . || true ;\
  	  $(LN_S) ${glibcxx_srcdir}/$(BASIC_FILE_H) basic_file.h || true ;\
  	  $(LN_S) ${glibcxx_srcdir}/$(ALLOCATOR_H) c++allocator.h || true ;\
*************** stamp-host: ${host_headers} ${host_heade
*** 1026,1033 ****
  	  $(LN_S) ${glibcxx_srcdir}/$(CLOCALE_INTERNAL_H) . || true ;\
  	  $(LN_S) ${glibcxx_srcdir}/$(COMPATIBILITY_H) . || true ;\
  	  $(LN_S) ${glibcxx_srcdir}/$(CMESSAGES_H) messages_members.h || true ;\
! 	  $(LN_S) ${glibcxx_srcdir}/$(CTIME_H) time_members.h || true);\
! 	fi ;\
  	$(STAMP) stamp-host
  
  # Host includes dynamic.
--- 981,988 ----
  	  $(LN_S) ${glibcxx_srcdir}/$(CLOCALE_INTERNAL_H) . || true ;\
  	  $(LN_S) ${glibcxx_srcdir}/$(COMPATIBILITY_H) . || true ;\
  	  $(LN_S) ${glibcxx_srcdir}/$(CMESSAGES_H) messages_members.h || true ;\
! 	  $(LN_S) ${glibcxx_srcdir}/$(CTIME_H) time_members.h || true;\
! 	} 2>/dev/null
  	$(STAMP) stamp-host
  
  # Host includes dynamic.
*************** ${host_builddir}/gthr-default.h: ${tople
*** 1120,1153 ****
  
  # Build two precompiled C++ includes, stdc++.h.gch/*.gch
  ${pch1a_output}: ${allstamped} ${host_builddir}/c++config.h ${pch1_source}
! 	if [ ! -d "${pch1_output_builddir}" ]; then \
! 	  mkdir -p ${pch1_output_builddir}; \
! 	fi; \
  	$(CXX) $(PCHFLAGS) $(AM_CPPFLAGS) -O0 -g ${pch1_source} -o $@
- 	touch ${pch1_output_anchor}
  
  ${pch1b_output}: ${allstamped} ${host_builddir}/c++config.h ${pch1_source}
! 	if [ ! -d "${pch1_output_builddir}" ]; then \
! 	  mkdir -p ${pch1_output_builddir}; \
! 	fi; \
  	$(CXX) $(PCHFLAGS) $(AM_CPPFLAGS) -O2 -g ${pch1_source} -o $@
- 	touch ${pch1_output_anchor}
  
  # Build a precompiled TR1 include, stdtr1c++.h.gch/O2.gch
  ${pch2_output}: ${pch2_source} ${pch1_output}
! 	if [ ! -d "${pch2_output_builddir}" ]; then \
! 	  mkdir -p ${pch2_output_builddir}; \
! 	fi; \
  	$(CXX) $(PCHFLAGS) $(AM_CPPFLAGS) -O2 -g ${pch2_source} -o $@
- 	touch ${pch2_output_anchor}
  
  # Build a precompiled extension include, extc++.h.gch/O2.gch
  ${pch3_output}: ${pch3_source} ${pch2_output}
! 	if [ ! -d "${pch3_output_builddir}" ]; then \
! 	  mkdir -p ${pch3_output_builddir}; \
! 	fi; \
  	$(CXX) $(PCHFLAGS) $(AM_CPPFLAGS) -O2 -g ${pch3_source} -o $@
- 	touch ${pch3_output_anchor}
  
  # For robustness sake (in light of junk files or in-source
  # configuration), copy from the build or source tree to the install
--- 1075,1096 ----
  
  # Build two precompiled C++ includes, stdc++.h.gch/*.gch
  ${pch1a_output}: ${allstamped} ${host_builddir}/c++config.h ${pch1_source}
! 	-mkdir -p ${pch1_output_builddir}
  	$(CXX) $(PCHFLAGS) $(AM_CPPFLAGS) -O0 -g ${pch1_source} -o $@
  
  ${pch1b_output}: ${allstamped} ${host_builddir}/c++config.h ${pch1_source}
! 	-mkdir -p ${pch1_output_builddir}
  	$(CXX) $(PCHFLAGS) $(AM_CPPFLAGS) -O2 -g ${pch1_source} -o $@
  
  # Build a precompiled TR1 include, stdtr1c++.h.gch/O2.gch
  ${pch2_output}: ${pch2_source} ${pch1_output}
! 	-mkdir -p ${pch2_output_builddir}
  	$(CXX) $(PCHFLAGS) $(AM_CPPFLAGS) -O2 -g ${pch2_source} -o $@
  
  # Build a precompiled extension include, extc++.h.gch/O2.gch
  ${pch3_output}: ${pch3_source} ${pch2_output}
! 	-mkdir -p ${pch3_output_builddir}
  	$(CXX) $(PCHFLAGS) $(AM_CPPFLAGS) -O2 -g ${pch3_source} -o $@
  
  # For robustness sake (in light of junk files or in-source
  # configuration), copy from the build or source tree to the install
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/Makefile.in gcc-4.3.1/libstdc++-v3/include/Makefile.in
*** gcc-4.3.0/libstdc++-v3/include/Makefile.in	Fri Feb 29 00:00:39 2008
--- gcc-4.3.1/libstdc++-v3/include/Makefile.in	Mon Apr 28 21:38:19 2008
*************** uninstall-am: uninstall-info-am
*** 1253,1324 ****
  # Here are the rules for building the headers
  all-local: ${allstamped} ${allcreated}
  
! # This rule is slightly different, in that we must change the name of the
! # local file from std_foo.h to foo.
  stamp-std: ${std_headers}
! 	@if [ ! -d "${std_builddir}" ]; then \
! 	  mkdir -p ${std_builddir} ;\
! 	fi ;\
! 	if [ ! -f stamp-std ]; then \
! 	  (cd ${std_builddir} && $(LN_S) $? . || true) ;\
! 	fi ;\
! 	$(STAMP) stamp-std
  
  stamp-bits: ${bits_headers}
! 	@if [ ! -d "${bits_builddir}" ]; then \
! 	  mkdir -p ${bits_builddir} ;\
! 	fi ;\
! 	if [ ! -f stamp-bits ]; then \
! 	  (cd ${bits_builddir} && $(LN_S) $? . || true) ;\
! 	fi ;\
! 	$(STAMP) stamp-bits
  
! stamp-c_base: ${c_base_headers} 
! 	@if [ ! -d "${c_base_builddir}" ]; then \
! 	  mkdir -p ${c_base_builddir} ;\
! 	fi ;\
! 	if [ ! -f stamp-c_base ]; then \
! 	  (cd ${c_base_builddir} && $(LN_S) $? . || true) ;\
! 	fi ;\
! 	$(STAMP) stamp-c_base
  
  stamp-c_base_extra: ${c_base_headers_extra}
! 	@if [ ! -d "${bits_builddir}" ]; then \
! 	  mkdir -p ${bits_builddir} ;\
! 	fi ;\
! 	if [ ! -f stamp-c_base_extra ]; then \
! 	  (cd ${bits_builddir} && $(LN_S) $? . || true) ;\
! 	fi ;\
! 	$(STAMP) stamp-c_base_extra
  
  stamp-c_compatibility: ${c_compatibility_headers_extra}
! 	@if [ ! -d "${c_compatibility_builddir}" ]; then \
! 	  mkdir -p ${c_compatibility_builddir} ;\
! 	fi ;\
! 	if [ ! -f stamp-c_compatibility ]; then \
! 	  if [ ! -z "${c_compatibility_headers_extra}" ]; then \
! 	    (cd ${c_compatibility_builddir} && $(LN_S) $? . || true) ;\
! 	  fi ;\
! 	fi ;\
! 	$(STAMP) stamp-c_compatibility
  
  stamp-backward: ${backward_headers}
! 	@if [ ! -d "${backward_builddir}" ]; then \
! 	  mkdir -p ${backward_builddir} ;\
! 	fi ;\
! 	if [ ! -f stamp-backward ]; then \
! 	  (cd ${backward_builddir} && $(LN_S) $? . || true) ;\
! 	fi ;\
! 	$(STAMP) stamp-backward
  
  stamp-ext: ${ext_headers}
! 	@if [ ! -d "${ext_builddir}" ]; then \
! 	    mkdir -p ${ext_builddir} ;\
! 	fi ;\
! 	if [ ! -f stamp-ext ]; then \
! 	  (cd ${ext_builddir} && $(LN_S) $? . || true) ;\
! 	fi ;\
! 	$(STAMP) stamp-ext
  
  # Have to deal with nested include directories, gah! Strip off source
  # directory before making the link.
--- 1253,1298 ----
  # Here are the rules for building the headers
  all-local: ${allstamped} ${allcreated}
  
! # Ignore errors from 'mkdir -p' to avoid parallel make failure on
! # systems with broken mkdir.  Call mkdir unconditionally because
! # it is just as cheap to avoid going through the shell.
! # Ignore errors from $(LN_S) because the links may already exist.
  stamp-std: ${std_headers}
! 	@-mkdir -p ${std_builddir}
! 	@-cd ${std_builddir} && $(LN_S) $? . 2>/dev/null
! 	@$(STAMP) stamp-std
  
  stamp-bits: ${bits_headers}
! 	@-mkdir -p ${bits_builddir}
! 	@-cd ${bits_builddir} && $(LN_S) $? . 2>/dev/null
! 	@$(STAMP) stamp-bits
  
! stamp-c_base: ${c_base_headers}
! 	@-mkdir -p ${c_base_builddir}
! 	@-cd ${c_base_builddir} && $(LN_S) $? . 2>/dev/null
! 	@$(STAMP) stamp-c_base
  
  stamp-c_base_extra: ${c_base_headers_extra}
! 	@-mkdir -p ${bits_builddir}
! 	@-cd ${bits_builddir} && $(LN_S) $? . 2>/dev/null
! 	@$(STAMP) stamp-c_base_extra
  
  stamp-c_compatibility: ${c_compatibility_headers_extra}
! 	@-mkdir -p ${c_compatibility_builddir}
! 	@-if [ ! -z "${c_compatibility_headers_extra}" ]; then \
! 	  cd ${c_compatibility_builddir} && $(LN_S) $? . 2>/dev/null ;\
! 	fi
! 	@$(STAMP) stamp-c_compatibility
  
  stamp-backward: ${backward_headers}
! 	@-mkdir -p ${backward_builddir}
! 	@-cd ${backward_builddir} && $(LN_S) $? . 2>/dev/null
! 	@$(STAMP) stamp-backward
  
  stamp-ext: ${ext_headers}
! 	@-mkdir -p ${ext_builddir}
! 	@-cd ${ext_builddir} && $(LN_S) $? . 2>/dev/null
! 	@$(STAMP) stamp-ext
  
  # Have to deal with nested include directories, gah! Strip off source
  # directory before making the link.
*************** stamp-pb:
*** 1372,1423 ****
  	$(STAMP) stamp-pb
  
  stamp-tr1: ${tr1_headers}
! 	@if [ ! -d "${tr1_builddir}" ]; then \
! 	    mkdir -p ${tr1_builddir} ;\
! 	fi ;\
! 	if [ ! -f stamp-tr1 ]; then \
! 	  (cd ${tr1_builddir} && $(LN_S) $? . || true) ;\
! 	fi ;\
! 	$(STAMP) stamp-tr1
  
  stamp-tr1-impl: ${tr1_impl_headers}
! 	@if [ ! -d "${tr1_impl_builddir}" ]; then \
! 	    mkdir -p ${tr1_impl_builddir} ;\
! 	fi ;\
! 	if [ ! -f stamp-tr1-impl ]; then \
! 	  (cd ${tr1_impl_builddir} && $(LN_S) $? . || true) ;\
! 	fi ;\
! 	$(STAMP) stamp-tr1-impl
  
  stamp-debug: ${debug_headers}
! 	@if [ ! -d "${debug_builddir}" ]; then \
! 	  mkdir -p ${debug_builddir} ;\
! 	fi ;\
! 	if [ ! -f stamp-debug ]; then \
! 	  (cd ${debug_builddir} && @LN_S@ $? . || true) ;\
! 	fi ;\
! 	$(STAMP) stamp-debug
  
  stamp-parallel: ${parallel_headers}
! 	@if [ ! -d "${parallel_builddir}" ]; then \
! 	  mkdir -p ${parallel_builddir} ;\
! 	fi ;\
! 	if [ ! -f stamp-parallel ]; then \
! 	  (cd ${parallel_builddir} && @LN_S@ $? . || true) ;\
! 	fi ;\
! 	$(STAMP) stamp-parallel
  
  stamp-${host_alias}:
! 	@if [ ! -d ${host_builddir} ]; then \
! 	  mkdir -p ${host_builddir} ;\
! 	fi ;\
! 	$(STAMP) stamp-${host_alias}
  
  # Host includes static.
  # XXX Missing dependency info for {host_headers_extra}
  stamp-host: ${host_headers} ${host_headers_noinst} stamp-${host_alias}
! 	@if [ ! -f stamp-host ]; then \
! 	  (cd ${host_builddir} ;\
  	  $(LN_S) ${host_headers} . || true ;\
  	  $(LN_S) ${glibcxx_srcdir}/$(BASIC_FILE_H) basic_file.h || true ;\
  	  $(LN_S) ${glibcxx_srcdir}/$(ALLOCATOR_H) c++allocator.h || true ;\
--- 1346,1378 ----
  	$(STAMP) stamp-pb
  
  stamp-tr1: ${tr1_headers}
! 	@-mkdir -p ${tr1_builddir}
! 	@-cd ${tr1_builddir} && $(LN_S) $? . 2>/dev/null
! 	@$(STAMP) stamp-tr1
  
  stamp-tr1-impl: ${tr1_impl_headers}
! 	@-mkdir -p ${tr1_impl_builddir}
! 	@-cd ${tr1_impl_builddir} && $(LN_S) $? . 2>/dev/null
! 	@$(STAMP) stamp-tr1-impl
  
  stamp-debug: ${debug_headers}
! 	@-mkdir -p ${debug_builddir}
! 	@-cd ${debug_builddir} && $(LN_S) $? . 2>/dev/null
! 	@$(STAMP) stamp-debug
  
  stamp-parallel: ${parallel_headers}
! 	@-mkdir -p ${parallel_builddir}
! 	@-cd ${parallel_builddir} && $(LN_S) $? . 2>/dev/null
! 	@$(STAMP) stamp-parallel
  
  stamp-${host_alias}:
! 	@-mkdir -p ${host_builddir}
! 	@$(STAMP) stamp-${host_alias}
  
  # Host includes static.
  # XXX Missing dependency info for {host_headers_extra}
  stamp-host: ${host_headers} ${host_headers_noinst} stamp-${host_alias}
! 	@cd ${host_builddir} && {\
  	  $(LN_S) ${host_headers} . || true ;\
  	  $(LN_S) ${glibcxx_srcdir}/$(BASIC_FILE_H) basic_file.h || true ;\
  	  $(LN_S) ${glibcxx_srcdir}/$(ALLOCATOR_H) c++allocator.h || true ;\
*************** stamp-host: ${host_headers} ${host_heade
*** 1426,1433 ****
  	  $(LN_S) ${glibcxx_srcdir}/$(CLOCALE_INTERNAL_H) . || true ;\
  	  $(LN_S) ${glibcxx_srcdir}/$(COMPATIBILITY_H) . || true ;\
  	  $(LN_S) ${glibcxx_srcdir}/$(CMESSAGES_H) messages_members.h || true ;\
! 	  $(LN_S) ${glibcxx_srcdir}/$(CTIME_H) time_members.h || true);\
! 	fi ;\
  	$(STAMP) stamp-host
  
  # Host includes dynamic.
--- 1381,1388 ----
  	  $(LN_S) ${glibcxx_srcdir}/$(CLOCALE_INTERNAL_H) . || true ;\
  	  $(LN_S) ${glibcxx_srcdir}/$(COMPATIBILITY_H) . || true ;\
  	  $(LN_S) ${glibcxx_srcdir}/$(CMESSAGES_H) messages_members.h || true ;\
! 	  $(LN_S) ${glibcxx_srcdir}/$(CTIME_H) time_members.h || true;\
! 	} 2>/dev/null
  	$(STAMP) stamp-host
  
  # Host includes dynamic.
*************** ${host_builddir}/gthr-default.h: ${tople
*** 1511,1544 ****
  
  # Build two precompiled C++ includes, stdc++.h.gch/*.gch
  ${pch1a_output}: ${allstamped} ${host_builddir}/c++config.h ${pch1_source}
! 	if [ ! -d "${pch1_output_builddir}" ]; then \
! 	  mkdir -p ${pch1_output_builddir}; \
! 	fi; \
  	$(CXX) $(PCHFLAGS) $(AM_CPPFLAGS) -O0 -g ${pch1_source} -o $@
- 	touch ${pch1_output_anchor}
  
  ${pch1b_output}: ${allstamped} ${host_builddir}/c++config.h ${pch1_source}
! 	if [ ! -d "${pch1_output_builddir}" ]; then \
! 	  mkdir -p ${pch1_output_builddir}; \
! 	fi; \
  	$(CXX) $(PCHFLAGS) $(AM_CPPFLAGS) -O2 -g ${pch1_source} -o $@
- 	touch ${pch1_output_anchor}
  
  # Build a precompiled TR1 include, stdtr1c++.h.gch/O2.gch
  ${pch2_output}: ${pch2_source} ${pch1_output}
! 	if [ ! -d "${pch2_output_builddir}" ]; then \
! 	  mkdir -p ${pch2_output_builddir}; \
! 	fi; \
  	$(CXX) $(PCHFLAGS) $(AM_CPPFLAGS) -O2 -g ${pch2_source} -o $@
- 	touch ${pch2_output_anchor}
  
  # Build a precompiled extension include, extc++.h.gch/O2.gch
  ${pch3_output}: ${pch3_source} ${pch2_output}
! 	if [ ! -d "${pch3_output_builddir}" ]; then \
! 	  mkdir -p ${pch3_output_builddir}; \
! 	fi; \
  	$(CXX) $(PCHFLAGS) $(AM_CPPFLAGS) -O2 -g ${pch3_source} -o $@
- 	touch ${pch3_output_anchor}
  
  # For robustness sake (in light of junk files or in-source
  # configuration), copy from the build or source tree to the install
--- 1466,1487 ----
  
  # Build two precompiled C++ includes, stdc++.h.gch/*.gch
  ${pch1a_output}: ${allstamped} ${host_builddir}/c++config.h ${pch1_source}
! 	-mkdir -p ${pch1_output_builddir}
  	$(CXX) $(PCHFLAGS) $(AM_CPPFLAGS) -O0 -g ${pch1_source} -o $@
  
  ${pch1b_output}: ${allstamped} ${host_builddir}/c++config.h ${pch1_source}
! 	-mkdir -p ${pch1_output_builddir}
  	$(CXX) $(PCHFLAGS) $(AM_CPPFLAGS) -O2 -g ${pch1_source} -o $@
  
  # Build a precompiled TR1 include, stdtr1c++.h.gch/O2.gch
  ${pch2_output}: ${pch2_source} ${pch1_output}
! 	-mkdir -p ${pch2_output_builddir}
  	$(CXX) $(PCHFLAGS) $(AM_CPPFLAGS) -O2 -g ${pch2_source} -o $@
  
  # Build a precompiled extension include, extc++.h.gch/O2.gch
  ${pch3_output}: ${pch3_source} ${pch2_output}
! 	-mkdir -p ${pch3_output_builddir}
  	$(CXX) $(PCHFLAGS) $(AM_CPPFLAGS) -O2 -g ${pch3_source} -o $@
  
  # For robustness sake (in light of junk files or in-source
  # configuration), copy from the build or source tree to the install
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/bits/allocator.h gcc-4.3.1/libstdc++-v3/include/bits/allocator.h
*** gcc-4.3.0/libstdc++-v3/include/bits/allocator.h	Thu Oct 18 19:31:22 2007
--- gcc-4.3.1/libstdc++-v3/include/bits/allocator.h	Wed Mar 26 23:21:44 2008
***************
*** 1,6 ****
  // Allocators -*- C++ -*-
  
! // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
--- 1,6 ----
  // Allocators -*- C++ -*-
  
! // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
*************** _GLIBCXX_BEGIN_NAMESPACE(std)
*** 77,83 ****
     * @brief  The "standard" allocator, as per [20.4].
     *
     *  Further details:
!    *  http://gcc.gnu.org/onlinedocs/libstdc++/20_util/allocator.html
     */
    template<typename _Tp>
      class allocator: public __glibcxx_base_allocator<_Tp>
--- 77,83 ----
     * @brief  The "standard" allocator, as per [20.4].
     *
     *  Further details:
!    *  http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt04ch11.html
     */
    template<typename _Tp>
      class allocator: public __glibcxx_base_allocator<_Tp>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/bits/char_traits.h gcc-4.3.1/libstdc++-v3/include/bits/char_traits.h
*** gcc-4.3.0/libstdc++-v3/include/bits/char_traits.h	Thu Jan 31 18:44:55 2008
--- gcc-4.3.1/libstdc++-v3/include/bits/char_traits.h	Wed Mar 26 23:21:44 2008
*************** _GLIBCXX_BEGIN_NAMESPACE(std)
*** 231,237 ****
      { };
  
  
!   /// @brief  21.1.3.1  char_traits specializations
    template<>
      struct char_traits<char>
      {
--- 231,237 ----
      { };
  
  
!   /// 21.1.3.1  char_traits specializations
    template<>
      struct char_traits<char>
      {
*************** _GLIBCXX_BEGIN_NAMESPACE(std)
*** 301,307 ****
  
  
  #ifdef _GLIBCXX_USE_WCHAR_T
!   /// @brief  21.1.3.2  char_traits specializations
    template<>
      struct char_traits<wchar_t>
      {
--- 301,307 ----
  
  
  #ifdef _GLIBCXX_USE_WCHAR_T
!   /// 21.1.3.2  char_traits specializations
    template<>
      struct char_traits<wchar_t>
      {
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/bits/codecvt.h gcc-4.3.1/libstdc++-v3/include/bits/codecvt.h
*** gcc-4.3.0/libstdc++-v3/include/bits/codecvt.h	Thu Jan 31 18:44:55 2008
--- gcc-4.3.1/libstdc++-v3/include/bits/codecvt.h	Wed Mar 26 23:21:44 2008
***************
*** 1,6 ****
  // Locale support (codecvt) -*- C++ -*-
  
! // Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007
  //  Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
--- 1,6 ----
  // Locale support (codecvt) -*- C++ -*-
  
! // Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
  //  Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
***************
*** 46,52 ****
  
  _GLIBCXX_BEGIN_NAMESPACE(std)
  
!   /// @brief  Empty base class for codecvt facet [22.2.1.5].
    class codecvt_base
    {
    public:
--- 46,52 ----
  
  _GLIBCXX_BEGIN_NAMESPACE(std)
  
!   /// Empty base class for codecvt facet [22.2.1.5].
    class codecvt_base
    {
    public:
*************** _GLIBCXX_BEGIN_NAMESPACE(std)
*** 330,336 ****
    template<typename _InternT, typename _ExternT, typename _StateT>
      locale::id codecvt<_InternT, _ExternT, _StateT>::id;
  
!   /// @brief class codecvt<char, char, mbstate_t> specialization.
    template<>
      class codecvt<char, char, mbstate_t>
      : public __codecvt_abstract_base<char, char, mbstate_t>
--- 330,336 ----
    template<typename _InternT, typename _ExternT, typename _StateT>
      locale::id codecvt<_InternT, _ExternT, _StateT>::id;
  
!   /// class codecvt<char, char, mbstate_t> specialization.
    template<>
      class codecvt<char, char, mbstate_t>
      : public __codecvt_abstract_base<char, char, mbstate_t>
*************** _GLIBCXX_BEGIN_NAMESPACE(std)
*** 388,394 ****
    };
  
  #ifdef _GLIBCXX_USE_WCHAR_T
!   /// @brief  class codecvt<wchar_t, char, mbstate_t> specialization.
    template<>
      class codecvt<wchar_t, char, mbstate_t>
      : public __codecvt_abstract_base<wchar_t, char, mbstate_t>
--- 388,394 ----
    };
  
  #ifdef _GLIBCXX_USE_WCHAR_T
!   /// class codecvt<wchar_t, char, mbstate_t> specialization.
    template<>
      class codecvt<wchar_t, char, mbstate_t>
      : public __codecvt_abstract_base<wchar_t, char, mbstate_t>
*************** _GLIBCXX_BEGIN_NAMESPACE(std)
*** 448,454 ****
      };
  #endif //_GLIBCXX_USE_WCHAR_T
  
!   /// @brief class codecvt_byname [22.2.1.6].
    template<typename _InternT, typename _ExternT, typename _StateT>
      class codecvt_byname : public codecvt<_InternT, _ExternT, _StateT>
      {
--- 448,454 ----
      };
  #endif //_GLIBCXX_USE_WCHAR_T
  
!   /// class codecvt_byname [22.2.1.6].
    template<typename _InternT, typename _ExternT, typename _StateT>
      class codecvt_byname : public codecvt<_InternT, _ExternT, _StateT>
      {
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/bits/locale_classes.h gcc-4.3.1/libstdc++-v3/include/bits/locale_classes.h
*** gcc-4.3.0/libstdc++-v3/include/bits/locale_classes.h	Fri Jan 18 08:16:51 2008
--- gcc-4.3.1/libstdc++-v3/include/bits/locale_classes.h	Wed Mar 26 23:21:44 2008
*************** _GLIBCXX_BEGIN_NAMESPACE(std)
*** 780,786 ****
      collate<wchar_t>::_M_transform(wchar_t*, const wchar_t*, size_t) const;
  #endif
  
!   /// @brief  class collate_byname [22.2.4.2].
    template<typename _CharT>
      class collate_byname : public collate<_CharT>
      {
--- 780,786 ----
      collate<wchar_t>::_M_transform(wchar_t*, const wchar_t*, size_t) const;
  #endif
  
!   /// class collate_byname [22.2.4.2].
    template<typename _CharT>
      class collate_byname : public collate<_CharT>
      {
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/bits/locale_facets.h gcc-4.3.1/libstdc++-v3/include/bits/locale_facets.h
*** gcc-4.3.0/libstdc++-v3/include/bits/locale_facets.h	Thu Jan 31 18:44:55 2008
--- gcc-4.3.1/libstdc++-v3/include/bits/locale_facets.h	Wed Mar 26 23:21:44 2008
*************** _GLIBCXX_BEGIN_NAMESPACE(std)
*** 1511,1517 ****
      use_facet<ctype<wchar_t> >(const locale& __loc);
  #endif //_GLIBCXX_USE_WCHAR_T
  
!   /// @brief  class ctype_byname [22.2.1.2].
    template<typename _CharT>
      class ctype_byname : public ctype<_CharT>
      {
--- 1511,1517 ----
      use_facet<ctype<wchar_t> >(const locale& __loc);
  #endif //_GLIBCXX_USE_WCHAR_T
  
!   /// class ctype_byname [22.2.1.2].
    template<typename _CharT>
      class ctype_byname : public ctype<_CharT>
      {
*************** _GLIBCXX_BEGIN_NAMESPACE(std)
*** 1912,1918 ****
      numpunct<wchar_t>::_M_initialize_numpunct(__c_locale __cloc);
  #endif
  
!   /// @brief  class numpunct_byname [22.2.3.2].
    template<typename _CharT>
      class numpunct_byname : public numpunct<_CharT>
      {
--- 1912,1918 ----
      numpunct<wchar_t>::_M_initialize_numpunct(__c_locale __cloc);
  #endif
  
!   /// class numpunct_byname [22.2.3.2].
    template<typename _CharT>
      class numpunct_byname : public numpunct<_CharT>
      {
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/bits/locale_facets_nonio.h gcc-4.3.1/libstdc++-v3/include/bits/locale_facets_nonio.h
*** gcc-4.3.0/libstdc++-v3/include/bits/locale_facets_nonio.h	Fri May 11 18:58:08 2007
--- gcc-4.3.1/libstdc++-v3/include/bits/locale_facets_nonio.h	Wed Mar 26 23:21:44 2008
*************** _GLIBCXX_BEGIN_NAMESPACE(std)
*** 674,680 ****
    template<typename _CharT, typename _InIter>
      locale::id time_get<_CharT, _InIter>::id;
  
!   /// @brief  class time_get_byname [22.2.5.2].
    template<typename _CharT, typename _InIter>
      class time_get_byname : public time_get<_CharT, _InIter>
      {
--- 674,680 ----
    template<typename _CharT, typename _InIter>
      locale::id time_get<_CharT, _InIter>::id;
  
!   /// class time_get_byname [22.2.5.2].
    template<typename _CharT, typename _InIter>
      class time_get_byname : public time_get<_CharT, _InIter>
      {
*************** _GLIBCXX_BEGIN_NAMESPACE(std)
*** 798,804 ****
    template<typename _CharT, typename _OutIter>
      locale::id time_put<_CharT, _OutIter>::id;
  
!   /// @brief  class time_put_byname [22.2.5.4].
    template<typename _CharT, typename _OutIter>
      class time_put_byname : public time_put<_CharT, _OutIter>
      {
--- 798,804 ----
    template<typename _CharT, typename _OutIter>
      locale::id time_put<_CharT, _OutIter>::id;
  
!   /// class time_put_byname [22.2.5.4].
    template<typename _CharT, typename _OutIter>
      class time_put_byname : public time_put<_CharT, _OutIter>
      {
*************** _GLIBCXX_BEGIN_NAMESPACE(std)
*** 1306,1312 ****
  							 const char*);
  #endif
  
!   /// @brief  class moneypunct_byname [22.2.6.4].
    template<typename _CharT, bool _Intl>
      class moneypunct_byname : public moneypunct<_CharT, _Intl>
      {
--- 1306,1312 ----
  							 const char*);
  #endif
  
!   /// class moneypunct_byname [22.2.6.4].
    template<typename _CharT, bool _Intl>
      class moneypunct_byname : public moneypunct<_CharT, _Intl>
      {
*************** _GLIBCXX_END_LDBL_NAMESPACE
*** 1887,1893 ****
      messages<wchar_t>::do_get(catalog, int, int, const wstring&) const;
  #endif
  
!    /// @brief class messages_byname [22.2.7.2].
     template<typename _CharT>
      class messages_byname : public messages<_CharT>
      {
--- 1887,1893 ----
      messages<wchar_t>::do_get(catalog, int, int, const wstring&) const;
  #endif
  
!    /// class messages_byname [22.2.7.2].
     template<typename _CharT>
      class messages_byname : public messages<_CharT>
      {
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/bits/stl_algobase.h gcc-4.3.1/libstdc++-v3/include/bits/stl_algobase.h
*** gcc-4.3.0/libstdc++-v3/include/bits/stl_algobase.h	Wed Dec 26 21:58:49 2007
--- gcc-4.3.1/libstdc++-v3/include/bits/stl_algobase.h	Sat Mar 29 22:38:36 2008
***************
*** 1,6 ****
  // Core algorithmic facilities -*- C++ -*-
  
! // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
--- 1,6 ----
  // Core algorithmic facilities -*- C++ -*-
  
! // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
*************** _GLIBCXX_BEGIN_NAMESPACE(std)
*** 689,707 ****
    template<typename _ForwardIterator, typename _Tp>
      inline typename
      __gnu_cxx::__enable_if<__is_scalar<_Tp>::__value, void>::__type
!     __fill_a(_ForwardIterator __first, _ForwardIterator __last, _Tp __value)
      {
        for (; __first != __last; ++__first)
! 	*__first = __value;
      }
  
    // Specialization: for char types we can use memset.
    template<typename _Tp>
      inline typename
      __gnu_cxx::__enable_if<__is_byte<_Tp>::__value, void>::__type
!     __fill_a(_Tp* __first, _Tp* __last, _Tp __c)
!     { __builtin_memset(__first, static_cast<unsigned char>(__c),
! 		       __last - __first); }
  
    /**
     *  @brief Fills the range [first,last) with copies of value.
--- 689,712 ----
    template<typename _ForwardIterator, typename _Tp>
      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<typename _Tp>
      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<unsigned char>(__tmp),
! 		       __last - __first);
!     }
  
    /**
     *  @brief Fills the range [first,last) with copies of value.
*************** _GLIBCXX_BEGIN_NAMESPACE(std)
*** 740,756 ****
    template<typename _OutputIterator, typename _Size, typename _Tp>
      inline typename
      __gnu_cxx::__enable_if<__is_scalar<_Tp>::__value, _OutputIterator>::__type
!     __fill_n_a(_OutputIterator __first, _Size __n, _Tp __value)
      {
        for (; __n > 0; --__n, ++__first)
! 	*__first = __value;
        return __first;
      }
  
    template<typename _Size, typename _Tp>
      inline typename
      __gnu_cxx::__enable_if<__is_byte<_Tp>::__value, _Tp*>::__type
!     __fill_n_a(_Tp* __first, _Size __n, _Tp __c)
      {
        std::__fill_a(__first, __first + __n, __c);
        return __first + __n;
--- 745,762 ----
    template<typename _OutputIterator, typename _Size, typename _Tp>
      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<typename _Size, typename _Tp>
      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;
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/bits/stl_multimap.h gcc-4.3.1/libstdc++-v3/include/bits/stl_multimap.h
*** gcc-4.3.0/libstdc++-v3/include/bits/stl_multimap.h	Thu Jan 31 18:44:55 2008
--- gcc-4.3.1/libstdc++-v3/include/bits/stl_multimap.h	Thu Mar 13 17:48:42 2008
*************** _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GL
*** 197,203 ****
        template<typename _InputIterator>
          multimap(_InputIterator __first, _InputIterator __last)
  	: _M_t()
!         { _M_t._M_insert_unique(__first, __last); }
  
        /**
         *  @brief  Builds a %multimap from a range.
--- 197,203 ----
        template<typename _InputIterator>
          multimap(_InputIterator __first, _InputIterator __last)
  	: _M_t()
!         { _M_t._M_insert_equal(__first, __last); }
  
        /**
         *  @brief  Builds a %multimap from a range.
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/debug/debug.h gcc-4.3.1/libstdc++-v3/include/debug/debug.h
*** gcc-4.3.0/libstdc++-v3/include/debug/debug.h	Sun Jan 13 01:34:58 2008
--- gcc-4.3.1/libstdc++-v3/include/debug/debug.h	Wed Mar 26 23:21:44 2008
***************
*** 44,54 ****
--- 44,62 ----
  */
  
  // 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;
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/debug/functions.h gcc-4.3.1/libstdc++-v3/include/debug/functions.h
*** gcc-4.3.0/libstdc++-v3/include/debug/functions.h	Sun Jan 13 01:34:58 2008
--- gcc-4.3.1/libstdc++-v3/include/debug/functions.h	Thu Mar 13 17:36:02 2008
*************** namespace __gnu_debug
*** 268,302 ****
        return __check_sorted_aux(__first, __last, __pred, _Category());
      }
  
!   template<typename _InputIterator1, typename _InputIterator2>
      inline bool
!     __check_sorted_set_aux(const _InputIterator1& __first,
! 			   const _InputIterator1& __last,
! 			   const _InputIterator2&, std::__true_type)
      { return __check_sorted(__first, __last); }
  
!   template<typename _InputIterator1, typename _InputIterator2>
      inline bool
!     __check_sorted_set_aux(const _InputIterator1&,
! 			   const _InputIterator1&,
! 			   const _InputIterator2&, std::__false_type)
      { return true; }
  
!   template<typename _InputIterator1, typename _InputIterator2,
! 	   typename _Predicate>
      inline bool
!     __check_sorted_set_aux(const _InputIterator1& __first,
! 			   const _InputIterator1& __last,
! 			   const _InputIterator2&, _Predicate __pred,
! 			   std::__true_type)
      { return __check_sorted(__first, __last, __pred); }
  
!   template<typename _InputIterator1, typename _InputIterator2,
! 	   typename _Predicate>
      inline bool
!     __check_sorted_set_aux(const _InputIterator1&,
! 			   const _InputIterator1&,
! 			   const _InputIterator2&, _Predicate,
  			   std::__false_type)
      { return true; }
  
--- 268,298 ----
        return __check_sorted_aux(__first, __last, __pred, _Category());
      }
  
!   template<typename _InputIterator>
      inline bool
!     __check_sorted_set_aux(const _InputIterator& __first,
! 			   const _InputIterator& __last,
! 			   std::__true_type)
      { return __check_sorted(__first, __last); }
  
!   template<typename _InputIterator>
      inline bool
!     __check_sorted_set_aux(const _InputIterator&,
! 			   const _InputIterator&,
! 			   std::__false_type)
      { return true; }
  
!   template<typename _InputIterator, typename _Predicate>
      inline bool
!     __check_sorted_set_aux(const _InputIterator& __first,
! 			   const _InputIterator& __last,
! 			   _Predicate __pred, std::__true_type)
      { return __check_sorted(__first, __last, __pred); }
  
!   template<typename _InputIterator, typename _Predicate>
      inline bool
!     __check_sorted_set_aux(const _InputIterator&,
! 			   const _InputIterator&, _Predicate,
  			   std::__false_type)
      { return true; }
  
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/debug/vector gcc-4.3.1/libstdc++-v3/include/debug/vector
*** gcc-4.3.0/libstdc++-v3/include/debug/vector	Fri Nov 23 11:49:07 2007
--- gcc-4.3.1/libstdc++-v3/include/debug/vector	Mon May 12 10:13:56 2008
***************
*** 1,6 ****
  // Debugging vector implementation -*- C++ -*-
  
! // Copyright (C) 2003, 2004, 2005, 2006, 2007
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
--- 1,6 ----
  // Debugging vector implementation -*- C++ -*-
  
! // Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/ext/array_allocator.h gcc-4.3.1/libstdc++-v3/include/ext/array_allocator.h
*** gcc-4.3.0/libstdc++-v3/include/ext/array_allocator.h	Sat Oct 27 00:41:21 2007
--- gcc-4.3.1/libstdc++-v3/include/ext/array_allocator.h	Wed Mar 26 23:21:44 2008
*************** _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
*** 45,51 ****
   using std::size_t;
   using std::ptrdiff_t;
  
!   /// @brief  Base class.
   template<typename _Tp>
      class array_allocator_base
      {
--- 45,51 ----
   using std::size_t;
   using std::ptrdiff_t;
  
!   /// Base class.
   template<typename _Tp>
      class array_allocator_base
      {
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/ext/bitmap_allocator.h gcc-4.3.1/libstdc++-v3/include/ext/bitmap_allocator.h
*** gcc-4.3.0/libstdc++-v3/include/ext/bitmap_allocator.h	Thu Jan 31 18:44:55 2008
--- gcc-4.3.1/libstdc++-v3/include/ext/bitmap_allocator.h	Wed Mar 26 23:21:44 2008
*************** _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
*** 706,711 ****
--- 706,712 ----
  	};
      };
  
+   /// Primary template
    template<typename _Tp>
      class bitmap_allocator : private free_list
      {
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/ext/codecvt_specializations.h gcc-4.3.1/libstdc++-v3/include/ext/codecvt_specializations.h
*** gcc-4.3.0/libstdc++-v3/include/ext/codecvt_specializations.h	Thu Jan 31 18:44:55 2008
--- gcc-4.3.1/libstdc++-v3/include/ext/codecvt_specializations.h	Wed Mar 26 23:21:44 2008
***************
*** 47,53 ****
  
  _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
  
!   /// @brief  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.
--- 47,53 ----
  
  _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.
*************** _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
*** 206,212 ****
      }
    };
  
!   /// @brief  encoding_char_traits.
    // Custom traits type with encoding_state for the state type, and the
    // associated fpos<encoding_state> for the position type, all other
    // bits equivalent to the required char_traits instantiations.
--- 206,212 ----
      }
    };
  
!   /// encoding_char_traits
    // Custom traits type with encoding_state for the state type, and the
    // associated fpos<encoding_state> for the position type, all other
    // bits equivalent to the required char_traits instantiations.
*************** _GLIBCXX_BEGIN_NAMESPACE(std)
*** 224,230 ****
  
    using __gnu_cxx::encoding_state;
  
!   /// @brief  codecvt<InternT, _ExternT, encoding_state> specialization.
    // This partial specialization takes advantage of iconv to provide
    // code conversions between a large number of character encodings.
    template<typename _InternT, typename _ExternT>
--- 224,230 ----
  
    using __gnu_cxx::encoding_state;
  
!   /// codecvt<InternT, _ExternT, encoding_state> specialization.
    // This partial specialization takes advantage of iconv to provide
    // code conversions between a large number of character encodings.
    template<typename _InternT, typename _ExternT>
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/ext/concurrence.h gcc-4.3.1/libstdc++-v3/include/ext/concurrence.h
*** gcc-4.3.0/libstdc++-v3/include/ext/concurrence.h	Fri Oct  5 05:35:46 2007
--- gcc-4.3.1/libstdc++-v3/include/ext/concurrence.h	Wed Mar 26 23:21:44 2008
*************** _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
*** 240,246 ****
        { return &_M_mutex; }
    };
  
!   /// @brief  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
--- 240,246 ----
        { 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
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/ext/enc_filebuf.h gcc-4.3.1/libstdc++-v3/include/ext/enc_filebuf.h
*** gcc-4.3.0/libstdc++-v3/include/ext/enc_filebuf.h	Mon Jan 29 18:22:37 2007
--- gcc-4.3.1/libstdc++-v3/include/ext/enc_filebuf.h	Wed Mar 26 23:21:44 2008
***************
*** 40,46 ****
  
  _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
  
!   /// @brief  class enc_filebuf.
    template<typename _CharT>
      class enc_filebuf
      : public std::basic_filebuf<_CharT, encoding_char_traits<_CharT> >
--- 40,46 ----
  
  _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
  
!   /// class enc_filebuf.
    template<typename _CharT>
      class enc_filebuf
      : public std::basic_filebuf<_CharT, encoding_char_traits<_CharT> >
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/ext/mt_allocator.h gcc-4.3.1/libstdc++-v3/include/ext/mt_allocator.h
*** gcc-4.3.0/libstdc++-v3/include/ext/mt_allocator.h	Thu Jan 31 18:44:55 2008
--- gcc-4.3.1/libstdc++-v3/include/ext/mt_allocator.h	Wed Mar 26 23:21:44 2008
*************** _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
*** 47,53 ****
  
    typedef void (*__destroy_handler)(void*);
  
!   /// @brief  Base class for pool object.
    struct __pool_base
    {
      // Using short int as type for the binmap implies we are never
--- 47,53 ----
  
    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
*************** _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
*** 455,461 ****
      };
  #endif
  
!   /// @brief  Policy for shared __pool objects.
    template<template <bool> class _PoolTp, bool _Thread>
      struct __common_pool_policy : public __common_pool_base<_PoolTp, _Thread>
      {
--- 455,461 ----
      };
  #endif
  
!   /// Policy for shared __pool objects.
    template<template <bool> class _PoolTp, bool _Thread>
      struct __common_pool_policy : public __common_pool_base<_PoolTp, _Thread>
      {
*************** _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
*** 550,556 ****
      };
  #endif
  
!   /// @brief  Policy for individual __pool objects.
    template<typename _Tp, template <bool> class _PoolTp, bool _Thread>
      struct __per_type_pool_policy 
      : public __per_type_pool_base<_Tp, _PoolTp, _Thread>
--- 550,556 ----
      };
  #endif
  
!   /// Policy for individual __pool objects.
    template<typename _Tp, template <bool> class _PoolTp, bool _Thread>
      struct __per_type_pool_policy 
      : public __per_type_pool_base<_Tp, _PoolTp, _Thread>
*************** _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
*** 565,571 ****
    };
  
  
!   /// @brief  Base class for _Tp dependent member functions.
    template<typename _Tp>
      class __mt_alloc_base 
      {
--- 565,571 ----
    };
  
  
!   /// Base class for _Tp dependent member functions.
    template<typename _Tp>
      class __mt_alloc_base 
      {
*************** _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
*** 621,627 ****
     *  the "global" list).
     *
     *  Further details:
!    *  http://gcc.gnu.org/onlinedocs/libstdc++/ext/mt_allocator.html
     */
    template<typename _Tp, 
  	   typename _Poolp = __common_pool_policy<__pool, __thread_default> >
--- 621,627 ----
     *  the "global" list).
     *
     *  Further details:
!    *  http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt12ch32.html
     */
    template<typename _Tp, 
  	   typename _Poolp = __common_pool_policy<__pool, __thread_default> >
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/ext/pb_ds/tag_and_trait.hpp gcc-4.3.1/libstdc++-v3/include/ext/pb_ds/tag_and_trait.hpp
*** gcc-4.3.0/libstdc++-v3/include/ext/pb_ds/tag_and_trait.hpp	Wed Sep 12 23:06:27 2007
--- gcc-4.3.1/libstdc++-v3/include/ext/pb_ds/tag_and_trait.hpp	Wed Mar 26 23:21:44 2008
***************
*** 52,60 ****
  
  /**
   * @namespace __gnu_pbds
!  * @brief GNU extension policy-based data structures for public use.
   */
- 
  namespace __gnu_pbds
  {
    // A trivial iterator tag. Signifies that the iterators has none of
--- 52,59 ----
  
  /**
   * @namespace __gnu_pbds
!  * @brief GNU extensions for policy-based data structures for public use.
   */
  namespace __gnu_pbds
  {
    // A trivial iterator tag. Signifies that the iterators has none of
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/ext/pool_allocator.h gcc-4.3.1/libstdc++-v3/include/ext/pool_allocator.h
*** gcc-4.3.0/libstdc++-v3/include/ext/pool_allocator.h	Fri Jan 18 08:16:51 2008
--- gcc-4.3.1/libstdc++-v3/include/ext/pool_allocator.h	Wed Mar 26 23:21:44 2008
*************** _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
*** 119,125 ****
      };
  
  
!   /// @brief  class __pool_alloc.
    template<typename _Tp>
      class __pool_alloc : private __pool_alloc_base
      {
--- 119,125 ----
      };
  
  
!   /// class __pool_alloc.
    template<typename _Tp>
      class __pool_alloc : private __pool_alloc_base
      {
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/ext/stdio_sync_filebuf.h gcc-4.3.1/libstdc++-v3/include/ext/stdio_sync_filebuf.h
*** gcc-4.3.0/libstdc++-v3/include/ext/stdio_sync_filebuf.h	Sun Mar 11 12:03:34 2007
--- gcc-4.3.1/libstdc++-v3/include/ext/stdio_sync_filebuf.h	Wed Mar 26 23:21:44 2008
***************
*** 47,53 ****
  
  _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
  
!   /// @brief  class stdio_sync_filebuf.
    template<typename _CharT, typename _Traits = std::char_traits<_CharT> >
      class stdio_sync_filebuf : public std::basic_streambuf<_CharT, _Traits>
      {
--- 47,53 ----
  
  _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
  
!   /// class stdio_sync_filebuf.
    template<typename _CharT, typename _Traits = std::char_traits<_CharT> >
      class stdio_sync_filebuf : public std::basic_streambuf<_CharT, _Traits>
      {
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/ext/throw_allocator.h gcc-4.3.1/libstdc++-v3/include/ext/throw_allocator.h
*** gcc-4.3.0/libstdc++-v3/include/ext/throw_allocator.h	Mon Dec 10 13:53:10 2007
--- gcc-4.3.1/libstdc++-v3/include/ext/throw_allocator.h	Wed Mar 26 23:21:44 2008
*************** _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
*** 80,85 ****
--- 80,86 ----
      std::tr1::mt19937 _M_generator;
    };
  
+   /// Thown by throw_allocator.
    struct forced_exception_error : public std::exception
    { };
  
*************** _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
*** 94,99 ****
--- 95,101 ----
  #endif
    }
  
+   /// Base class.
    class throw_allocator_base
    {
    public:
*************** _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
*** 184,190 ****
      static size_t 		_S_label;
    };
  
! 
    template<typename T>
      class throw_allocator : public throw_allocator_base
      {
--- 186,192 ----
      static size_t 		_S_label;
    };
  
!   /// Allocator class with logging and exception control.
    template<typename T>
      class throw_allocator : public throw_allocator_base
      {
*************** _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
*** 309,315 ****
  
    twister_rand_gen throw_allocator_base::_S_g;
  
!   throw_allocator_base::map_type
    throw_allocator_base::_S_map;
  
    double throw_allocator_base::_S_throw_prob;
--- 311,317 ----
  
    twister_rand_gen throw_allocator_base::_S_g;
  
!   throw_allocator_base::map_type 
    throw_allocator_base::_S_map;
  
    double throw_allocator_base::_S_throw_prob;
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/ext/typelist.h gcc-4.3.1/libstdc++-v3/include/ext/typelist.h
*** gcc-4.3.0/libstdc++-v3/include/ext/typelist.h	Thu Sep 28 01:23:58 2006
--- gcc-4.3.1/libstdc++-v3/include/ext/typelist.h	Wed Mar 26 23:21:44 2008
***************
*** 50,55 ****
--- 50,58 ----
  
  _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
  
+ /** @namespace __gnu_cxx::typelist
+  *  @brief GNU typelist extensions for public compile-time use.
+ */
  namespace typelist
  {
    struct null_type { };
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/parallel/algo.h gcc-4.3.1/libstdc++-v3/include/parallel/algo.h
*** gcc-4.3.0/libstdc++-v3/include/parallel/algo.h	Mon Feb 18 00:00:00 2008
--- gcc-4.3.1/libstdc++-v3/include/parallel/algo.h	Thu Jun  5 15:45:10 2008
*************** namespace __parallel
*** 1647,1653 ****
      {
        c_rand_number<> r;
        // Parallelization still possible.
!       random_shuffle(begin, end, r);
      }
  
    // Parallel algorithm for random access iterators.
--- 1647,1653 ----
      {
        c_rand_number<> r;
        // Parallelization still possible.
!       __gnu_parallel::random_shuffle(begin, end, r);
      }
  
    // Parallel algorithm for random access iterators.
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/parallel/base.h gcc-4.3.1/libstdc++-v3/include/parallel/base.h
*** gcc-4.3.0/libstdc++-v3/include/parallel/base.h	Mon Feb 18 00:00:00 2008
--- gcc-4.3.1/libstdc++-v3/include/parallel/base.h	Wed Mar 26 23:21:44 2008
***************
*** 47,52 ****
--- 47,57 ----
  
  
  // Parallel mode namespaces.
+ 
+ /**
+  * @namespace std::__parallel
+  * @brief GNU parallel code, replaces standard behavior with parallel behavior.
+  */
  namespace std 
  { 
    namespace __parallel { } 
*************** namespace std 
*** 54,60 ****
  
  /**
   * @namespace __gnu_parallel
!  * @brief GNU parallel classes for public use.
   */
  namespace __gnu_parallel
  {
--- 59,65 ----
  
  /**
   * @namespace __gnu_parallel
!  * @brief GNU parallel code for public use.
   */
  namespace __gnu_parallel
  {
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/parallel/compiletime_settings.h gcc-4.3.1/libstdc++-v3/include/parallel/compiletime_settings.h
*** gcc-4.3.0/libstdc++-v3/include/parallel/compiletime_settings.h	Thu Nov 22 10:13:08 2007
--- gcc-4.3.1/libstdc++-v3/include/parallel/compiletime_settings.h	Wed Apr  9 16:47:00 2008
***************
*** 73,89 ****
   *  __gnu_parallel::parallel_random_shuffle(). */
  #define _GLIBCXX_RANDOM_SHUFFLE_CONSIDER_L1 0
  #endif
! #ifndef _GLIBCXX_RANDOM_SHUFFLE_CONSIDER_TLB 
  /** @brief Switch on many _GLIBCXX_PARALLEL_ASSERTions in parallel code.
   *  Consider the size of the TLB for
   *  __gnu_parallel::parallel_random_shuffle(). */
  #define _GLIBCXX_RANDOM_SHUFFLE_CONSIDER_TLB 0
  #endif
- 
- #ifndef _GLIBCXX_MULTIWAY_MERGESORT_COPY_LAST
- /** @brief First copy the data, sort it locally, and merge it back
-  * (0); or copy it back after everything is done (1).
-  *
-  *  Recommendation: 0 */
- #define _GLIBCXX_MULTIWAY_MERGESORT_COPY_LAST 0
- #endif
--- 73,81 ----
   *  __gnu_parallel::parallel_random_shuffle(). */
  #define _GLIBCXX_RANDOM_SHUFFLE_CONSIDER_L1 0
  #endif
! #ifndef _GLIBCXX_RANDOM_SHUFFLE_CONSIDER_TLB
  /** @brief Switch on many _GLIBCXX_PARALLEL_ASSERTions in parallel code.
   *  Consider the size of the TLB for
   *  __gnu_parallel::parallel_random_shuffle(). */
  #define _GLIBCXX_RANDOM_SHUFFLE_CONSIDER_TLB 0
  #endif
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/parallel/features.h gcc-4.3.1/libstdc++-v3/include/parallel/features.h
*** gcc-4.3.0/libstdc++-v3/include/parallel/features.h	Mon Feb 18 00:00:00 2008
--- gcc-4.3.1/libstdc++-v3/include/parallel/features.h	Wed Apr  9 16:47:00 2008
***************
*** 61,126 ****
  #define _GLIBCXX_BAL_QUICKSORT 1
  #endif
  
- #ifndef _GLIBCXX_LOSER_TREE
- /** @def _GLIBCXX_LOSER_TREE
-  *  @brief Include guarded (sequences may run empty) loser tree,
-  *  moving objects.
-  *  @see __gnu_parallel::_Settings multiway_merge_algorithm */
- #define _GLIBCXX_LOSER_TREE 1
- #endif
- 
- #ifndef _GLIBCXX_LOSER_TREE_EXPLICIT
- /** @def _GLIBCXX_LOSER_TREE_EXPLICIT
-  *  @brief Include standard loser tree, storing two flags for infimum
-  *  and supremum.
-  *  @see __gnu_parallel::_Settings multiway_merge_algorithm */
- #define _GLIBCXX_LOSER_TREE_EXPLICIT 0
- #endif
- 
- #ifndef _GLIBCXX_LOSER_TREE_REFERENCE
- /** @def _GLIBCXX_LOSER_TREE_REFERENCE
-  *  @brief Include some loser tree variant.
-  *  @see __gnu_parallel::_Settings multiway_merge_algorithm */
- #define _GLIBCXX_LOSER_TREE_REFERENCE 0
- #endif
- 
- #ifndef _GLIBCXX_LOSER_TREE_POINTER
- /** @def _GLIBCXX_LOSER_TREE_POINTER
-  *  @brief Include some loser tree variant.
-  *  @see __gnu_parallel::_Settings multiway_merge_algorithm */
- #define _GLIBCXX_LOSER_TREE_POINTER 1
- #endif
- 
- #ifndef _GLIBCXX_LOSER_TREE_UNGUARDED
- /** @def _GLIBCXX_LOSER_TREE_UNGUARDED
-  *  @brief Include unguarded (sequences must not run empty) loser
-  *  tree, moving objects.
-  *  @see __gnu_parallel::_Settings multiway_merge_algorithm */
- #define _GLIBCXX_LOSER_TREE_UNGUARDED 0
- #endif
- 
- #ifndef _GLIBCXX_LOSER_TREE_POINTER_UNGUARDED
- /** @def _GLIBCXX_LOSER_TREE_POINTER_UNGUARDED
-  *  @brief Include some loser tree variant.
-  *  @see __gnu_parallel::_Settings multiway_merge_algorithm */
- #define _GLIBCXX_LOSER_TREE_POINTER_UNGUARDED 1
- #endif
- 
- #ifndef _GLIBCXX_LOSER_TREE_COMBINED
- /** @def _GLIBCXX_LOSER_TREE_COMBINED
-  *  @brief Include some loser tree variant.
-  *  @see __gnu_parallel::_Settings multiway_merge_algorithm */
- #define _GLIBCXX_LOSER_TREE_COMBINED 0
- #endif
- 
- #ifndef _GLIBCXX_LOSER_TREE_SENTINEL
- /** @def _GLIBCXX_LOSER_TREE_SENTINEL
-  *  @brief Include some loser tree variant.
-  *  @see __gnu_parallel::_Settings multiway_merge_algorithm */
- #define _GLIBCXX_LOSER_TREE_SENTINEL 0
- #endif
- 
- 
  #ifndef _GLIBCXX_FIND_GROWING_BLOCKS
  /** @brief Include the growing blocks variant for std::find.
   *  @see __gnu_parallel::_Settings::find_algorithm */
--- 61,66 ----
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/parallel/losertree.h gcc-4.3.1/libstdc++-v3/include/parallel/losertree.h
*** gcc-4.3.0/libstdc++-v3/include/parallel/losertree.h	Thu Jan 10 02:07:41 2008
--- gcc-4.3.1/libstdc++-v3/include/parallel/losertree.h	Tue May  6 08:56:35 2008
***************
*** 47,1100 ****
  namespace __gnu_parallel
  {
  
! #if _GLIBCXX_LOSER_TREE_EXPLICIT
! 
! /** @brief Guarded loser tree, copying the whole element into the
! * tree structure.
! *
! *  Guarding is done explicitly through two flags per element, inf
! *  and sup This is a quite slow variant.
! */
! template<typename T, typename Comparator = std::less<T> >
!   class LoserTreeExplicit
    {
!   private:
!     struct Loser
!     {
!       // The relevant element.
!       T key;
! 
!       // Is this an infimum or supremum element?
!       bool inf, sup;
  
!       // Number of the sequence the element comes from.
!       int source;
!     };
  
!     unsigned int size, offset;
!     Loser* losers;
!     Comparator comp;
  
!   public:
!     LoserTreeExplicit(unsigned int _size, Comparator _comp = std::less<T>())
!     : comp(_comp)
!     {
!       size = _size;
!       offset = size;
!       losers = new Loser[size];
!       for (unsigned int l = 0; l < size; ++l)
!         {
!           //losers[l].key = ... 	stays unset
!           losers[l].inf = true;
!           losers[l].sup = false;
!           //losers[l].source = -1;	//sentinel
!         }
!     }
  
!     ~LoserTreeExplicit()
!     { delete[] losers; }
  
!     int
!     get_min_source()
!     { return losers[0].source; }
  
!     void
!     insert_start(T key, int source, bool sup)
!     {
!       bool inf = false;
!       for (unsigned int pos = (offset + source) / 2; pos > 0; pos /= 2)
!         {
!           if ((!inf && !losers[pos].inf && !sup && !losers[pos].sup
!                && comp(losers[pos].key, key)) || losers[pos].inf || sup)
!             {
!               // The other one is smaller.
!               std::swap(losers[pos].key, key);
!               std::swap(losers[pos].inf, inf);
!               std::swap(losers[pos].sup, sup);
!               std::swap(losers[pos].source, source);
!             }
!         }
  
!       losers[0].key = key;
!       losers[0].inf = inf;
!       losers[0].sup = sup;
!       losers[0].source = source;
!     }
  
!     void
!     init() { }
  
!     void
!     delete_min_insert(T key, bool sup)
!     {
!       bool inf = false;
!       int source = losers[0].source;
!       for (unsigned int pos = (offset + source) / 2; pos > 0; pos /= 2)
!         {
!           // The smaller one gets promoted.
!           if ((!inf && !losers[pos].inf && !sup && !losers[pos].sup
!               && comp(losers[pos].key, key))
!               || losers[pos].inf || sup)
!             {
!               // The other one is smaller.
!               std::swap(losers[pos].key, key);
!               std::swap(losers[pos].inf, inf);
!               std::swap(losers[pos].sup, sup);
!               std::swap(losers[pos].source, source);
!             }
!         }
  
!       losers[0].key = key;
!       losers[0].inf = inf;
!       losers[0].sup = sup;
!       losers[0].source = source;
!     }
  
!     void
!     insert_start_stable(T key, int source, bool sup)
!     {
!       bool inf = false;
!       for (unsigned int pos = (offset + source) / 2; pos > 0; pos /= 2)
!         {
!           if ((!inf && !losers[pos].inf && !sup && !losers[pos].sup
! 	       && ((comp(losers[pos].key, key))
! 		   || (!comp(key, losers[pos].key)
! 		       && losers[pos].source < source)))
!               || losers[pos].inf || sup)
!             {
!               // Take next key.
!               std::swap(losers[pos].key, key);
!               std::swap(losers[pos].inf, inf);
!               std::swap(losers[pos].sup, sup);
!               std::swap(losers[pos].source, source);
!             }
!         }
  
!       losers[0].key = key;
!       losers[0].inf = inf;
!       losers[0].sup = sup;
!       losers[0].source = source;
!     }
  
!     void
!     init_stable() { }
  
!     void
!     delete_min_insert_stable(T key, bool sup)
!     {
!       bool inf = false;
!       int source = losers[0].source;
!       for (unsigned int pos = (offset + source) / 2; pos > 0; pos /= 2)
!         {
!           if ((!inf && !losers[pos].inf && !sup && !losers[pos].sup
!               && ((comp(losers[pos].key, key))
! 		  || (!comp(key, losers[pos].key)
! 		      && losers[pos].source < source)))
!               || losers[pos].inf || sup)
!             {
!               std::swap(losers[pos].key, key);
!               std::swap(losers[pos].inf, inf);
!               std::swap(losers[pos].sup, sup);
!               std::swap(losers[pos].source, source);
!             }
!         }
  
!       losers[0].key = key;
!       losers[0].inf = inf;
!       losers[0].sup = sup;
!       losers[0].source = source;
!     }
!   };
  
! #endif
  
! #if _GLIBCXX_LOSER_TREE
  
! /** @brief Guarded loser tree, either copying the whole element into
! * the tree structure, or looking up the element via the index.
! *
! *  Guarding is done explicitly through one flag sup per element,
! *  inf is not needed due to a better initialization routine.  This
! *  is a well-performing variant.
! */
! template<typename T, typename Comparator = std::less<T> >
!   class LoserTree
    {
!   private:
!     struct Loser
!     {
!       bool sup;
!       int source;
!       T key;
!     };
  
!     unsigned int ik, k, offset;
!     Loser* losers;
!     Comparator comp;
!     bool first_insert;
  
!   public:
!     LoserTree(unsigned int _k, Comparator _comp = std::less<T>())
!     : comp(_comp)
!     {
!       ik = _k;
  
!       // Next greater power of 2.
!       k = 1 << (log2(ik - 1) + 1);
!       offset = k;
!       // Avoid default-constructing losers[].key
!       losers = static_cast<Loser*>(::operator new(2 * k * sizeof(Loser)));
!       for (unsigned int i = ik - 1; i < k; ++i)
!         losers[i + k].sup = true;
  
!       first_insert = true;
!     }
  
!     ~LoserTree()
!     { ::operator delete(losers); }
  
!     int
!     get_min_source()
!     { return losers[0].source; }
  
!     void
!     insert_start(const T& key, int source, bool sup)
!     {
!       unsigned int pos = k + source;
  
!       if(first_insert)
!         {
!           // Construct all keys, so we can easily deconstruct them.
!           for (unsigned int i = 0; i < (2 * k); ++i)
!             ::new(&(losers[i].key)) T(key);
!           first_insert = false;
!         }
!       else
!         ::new(&(losers[pos].key)) T(key);
  
!       losers[pos].sup = sup;
!       losers[pos].source = source;
!     }
  
!     unsigned int
!     init_winner (unsigned int root)
      {
!       if (root >= k)
!         {
!           return root;
!         }
!       else
!         {
!           unsigned int left = init_winner (2 * root);
!           unsigned int right = init_winner (2 * root + 1);
!           if (losers[right].sup
! 	      || (!losers[left].sup
! 		  && !comp(losers[right].key, losers[left].key)))
!             {
!               // Left one is less or equal.
!               losers[root] = losers[right];
!               return left;
!             }
!           else
!             {
!               // Right one is less.
!               losers[root] = losers[left];
!               return right;
!             }
!         }
      }
  
!     void
!     init()
!     { losers[0] = losers[init_winner(1)]; }
  
-     // Do not pass const reference since key will be used as local variable.
-     void
-     delete_min_insert(T key, bool sup)
-     {
-       int source = losers[0].source;
-       for (unsigned int pos = (k + source) / 2; pos > 0; pos /= 2)
-         {
-           // The smaller one gets promoted.
-           if (sup || (!losers[pos].sup && comp(losers[pos].key, key)))
-             {
-               // The other one is smaller.
-               std::swap(losers[pos].sup, sup);
-               std::swap(losers[pos].source, source);
-               std::swap(losers[pos].key, key);
-             }
-         }
  
!       losers[0].sup = sup;
!       losers[0].source = source;
!       losers[0].key = key;
!     }
  
!     void
!     insert_start_stable(const T& key, int source, bool sup)
!     { return insert_start(key, source, sup); }
  
!     unsigned int
!     init_winner_stable (unsigned int root)
!     {
!       if (root >= k)
!         {
!           return root;
!         }
!       else
!         {
!           unsigned int left = init_winner (2 * root);
!           unsigned int right = init_winner (2 * root + 1);
!           if (losers[right].sup
!               || (!losers[left].sup
! 		  && !comp(losers[right].key, losers[left].key)))
!             {
!               // Left one is less or equal.
!               losers[root] = losers[right];
!               return left;
!             }
!           else
!             {
!               // Right one is less.
!               losers[root] = losers[left];
!               return right;
!             }
!         }
!     }
  
!     void
!     init_stable()
!     { losers[0] = losers[init_winner_stable(1)]; }
  
!     // Do not pass const reference since key will be used as local variable.
!     void
!     delete_min_insert_stable(T key, bool sup)
!     {
!       int source = losers[0].source;
!       for (unsigned int pos = (k + source) / 2; pos > 0; pos /= 2)
!         {
!           // The smaller one gets promoted, ties are broken by source.
!           if (	(sup && (!losers[pos].sup || losers[pos].source < source))
!                 || (!sup && !losers[pos].sup
!                   && ((comp(losers[pos].key, key))
!                     || (!comp(key, losers[pos].key)
!                       && losers[pos].source < source))))
!             {
!               // The other one is smaller.
!               std::swap(losers[pos].sup, sup);
!               std::swap(losers[pos].source, source);
!               std::swap(losers[pos].key, key);
!             }
!         }
  
!       losers[0].sup = sup;
!       losers[0].source = source;
!       losers[0].key = key;
!     }
!   };
  
! #endif
  
! #if _GLIBCXX_LOSER_TREE_REFERENCE
  
! /** @brief Guarded loser tree, either copying the whole element into
! * the tree structure, or looking up the element via the index.
! *
! *  Guarding is done explicitly through one flag sup per element,
! *  inf is not needed due to a better initialization routine.  This
! *  is a well-performing variant.
! */
! template<typename T, typename Comparator = std::less<T> >
!   class LoserTreeReference
!   {
! #undef COPY
! #ifdef COPY
! #define KEY(i) losers[i].key
! #define KEY_SOURCE(i) key
! #else
! #define KEY(i) keys[losers[i].source]
! #define KEY_SOURCE(i) keys[i]
! #endif
!   private:
!     struct Loser
!     {
!       bool sup;
!       int source;
! #ifdef COPY
!       T key;
! #endif
!     };
  
!     unsigned int ik, k, offset;
!     Loser* losers;
! #ifndef COPY
!     T* keys;
! #endif
!     Comparator comp;
  
!   public:
!     LoserTreeReference(unsigned int _k, Comparator _comp = std::less<T>())
!     : comp(_comp)
!     {
!       ik = _k;
  
!       // Next greater power of 2.
!       k = 1 << (log2(ik - 1) + 1);
!       offset = k;
!       losers = new Loser[k * 2];
! #ifndef COPY
!       keys = new T[ik];
! #endif
!       for (unsigned int i = ik - 1; i < k; ++i)
!         losers[i + k].sup = true;
!     }
  
!     ~LoserTreeReference()
!     {
!       delete[] losers;
! #ifndef COPY
!       delete[] keys;
  #endif
-     }
  
!     int
!     get_min_source()
!     { return losers[0].source; }
  
!     void
!     insert_start(T key, int source, bool sup)
!     {
!       unsigned int pos = k + source;
  
!       losers[pos].sup = sup;
!       losers[pos].source = source;
!       KEY(pos) = key;
!     }
  
!     unsigned int
!     init_winner(unsigned int root)
!     {
!       if (root >= k)
!         {
!           return root;
!         }
!       else
!         {
!           unsigned int left = init_winner (2 * root);
!           unsigned int right = init_winner (2 * root + 1);
!           if (	losers[right].sup ||
!                 (!losers[left].sup && !comp(KEY(right), KEY(left))))
!             {
!               // Left one is less or equal.
!               losers[root] = losers[right];
!               return left;
!             }
!           else
!             {
!               // Right one is less.
!               losers[root] = losers[left];
!               return right;
!             }
!         }
!     }
  
!     void
!     init()
!     {
!       losers[0] = losers[init_winner(1)];
!     }
  
!     void
!     delete_min_insert(T key, bool sup)
!     {
!       int source = losers[0].source;
!       for (unsigned int pos = (k + source) / 2; pos > 0; pos /= 2)
!         {
!           // The smaller one gets promoted.
!           if (sup || (!losers[pos].sup && comp(KEY(pos), KEY_SOURCE(source))))
!             {
!               // The other one is smaller.
!               std::swap(losers[pos].sup, sup);
!               std::swap(losers[pos].source, source);
! #ifdef COPY
!               std::swap(KEY(pos), KEY_SOURCE(source));
! #endif
!             }
!         }
  
!       losers[0].sup = sup;
!       losers[0].source = source;
! #ifdef COPY
!       KEY(0) = KEY_SOURCE(source);
  #endif
-     }
  
!     void
!     insert_start_stable(T key, int source, bool sup)
!     { return insert_start(key, source, sup); }
  
!     unsigned int
!     init_winner_stable(unsigned int root)
!     {
!       if (root >= k)
!         {
!           return root;
!         }
!       else
!         {
!           unsigned int left = init_winner (2 * root);
!           unsigned int right = init_winner (2 * root + 1);
!           if (losers[right].sup
!               || (!losers[left].sup && !comp(KEY(right), KEY(left))))
!             {
!               // Left one is less or equal.
!               losers[root] = losers[right];
!               return left;
!             }
!           else
!             {
!               // Right one is less.
!               losers[root] = losers[left];
!               return right;
!             }
!         }
!     }
  
!     void
!     init_stable()
!     { losers[0] = losers[init_winner_stable(1)]; }
  
!     void
!     delete_min_insert_stable(T key, bool sup)
!     {
!       int source = losers[0].source;
!       for (unsigned int pos = (k + source) / 2; pos > 0; pos /= 2)
!         {
!           // The smaller one gets promoted, ties are broken by source.
!           if ((sup && (!losers[pos].sup || losers[pos].source < source))
! 	      || (!sup && !losers[pos].sup
! 		  && ((comp(KEY(pos), KEY_SOURCE(source)))
! 		      || (!comp(KEY_SOURCE(source), KEY(pos))
! 			  && losers[pos].source < source))))
!             {
!               // The other one is smaller.
!               std::swap(losers[pos].sup, sup);
!               std::swap(losers[pos].source, source);
! #ifdef COPY
!               std::swap(KEY(pos), KEY_SOURCE(source));
! #endif
!             }
!         }
  
!       losers[0].sup = sup;
!       losers[0].source = source;
! #ifdef COPY
!       KEY(0) = KEY_SOURCE(source);
! #endif
!     }
!   };
! #undef KEY
! #undef KEY_SOURCE
  
! #endif
  
! #if _GLIBCXX_LOSER_TREE_POINTER
  
! /** @brief Guarded loser tree, either copying the whole element into
!     the tree structure, or looking up the element via the index.
! *  Guarding is done explicitly through one flag sup per element,
! *  inf is not needed due to a better initialization routine.
! *  This is a well-performing variant.
! */
! template<typename T, typename Comparator = std::less<T> >
!   class LoserTreePointer
    {
!   private:
!     struct Loser
!     {
!       bool sup;
!       int source;
!       const T* keyp;
!     };
  
!     unsigned int ik, k, offset;
!     Loser* losers;
!     Comparator comp;
  
!   public:
!     LoserTreePointer(unsigned int _k, Comparator _comp = std::less<T>())
!       : comp(_comp)
!     {
!       ik = _k;
  
!       // Next greater power of 2.
!       k = 1 << (log2(ik - 1) + 1);
!       offset = k;
!       losers = new Loser[k * 2];
!       for (unsigned int i = ik - 1; i < k; ++i)
!         losers[i + k].sup = true;
!     }
  
!     ~LoserTreePointer()
!     { delete[] losers; }
  
!     int
!     get_min_source()
!     { return losers[0].source; }
  
!     void
!     insert_start(const T& key, int source, bool sup)
!     {
!       unsigned int pos = k + source;
  
!       losers[pos].sup = sup;
!       losers[pos].source = source;
!       losers[pos].keyp = &key;
!     }
  
!     unsigned int
!     init_winner(unsigned int root)
!     {
!       if (root >= k)
! 	return root;
!       else
!         {
!           unsigned int left = init_winner (2 * root);
!           unsigned int right = init_winner (2 * root + 1);
!           if (losers[right].sup
!                 || (!losers[left].sup
!                   && !comp(*losers[right].keyp, *losers[left].keyp)))
!             {
!               // Left one is less or equal.
!               losers[root] = losers[right];
!               return left;
!             }
!           else
!             {
!               // Right one is less.
!               losers[root] = losers[left];
!               return right;
!             }
!         }
!     }
  
!     void
!     init()
!     { losers[0] = losers[init_winner(1)]; }
  
!     void
!     delete_min_insert(const T& key, bool sup)
!     {
!       const T* keyp = &key;
!       int source = losers[0].source;
!       for (unsigned int pos = (k + source) / 2; pos > 0; pos /= 2)
!         {
!           // The smaller one gets promoted.
!           if (sup || (!losers[pos].sup && comp(*losers[pos].keyp, *keyp)))
!             {
!               // The other one is smaller.
!               std::swap(losers[pos].sup, sup);
!               std::swap(losers[pos].source, source);
!               std::swap(losers[pos].keyp, keyp);
!             }
!         }
  
!       losers[0].sup = sup;
!       losers[0].source = source;
!       losers[0].keyp = keyp;
!     }
  
!     void
!     insert_start_stable(const T& key, int source, bool sup)
!     { return insert_start(key, source, sup); }
  
!     unsigned int
!     init_winner_stable(unsigned int root)
!     {
!       if (root >= k)
!         {
!           return root;
!         }
!       else
!         {
!           unsigned int left = init_winner (2 * root);
!           unsigned int right = init_winner (2 * root + 1);
!           if (losers[right].sup
!               || (!losers[left].sup && !comp(*losers[right].keyp,
!                                             *losers[left].keyp)))
!             {
!               // Left one is less or equal.
!               losers[root] = losers[right];
!               return left;
!             }
!           else
!             {
!               // Right one is less.
!               losers[root] = losers[left];
!               return right;
!             }
!         }
!     }
  
!     void
!     init_stable()
!     { losers[0] = losers[init_winner_stable(1)]; }
  
!     void
!     delete_min_insert_stable(const T& key, bool sup)
!     {
!       const T* keyp = &key;
!       int source = losers[0].source;
!       for (unsigned int pos = (k + source) / 2; pos > 0; pos /= 2)
!         {
!           // The smaller one gets promoted, ties are broken by source.
!           if (	(sup && (!losers[pos].sup || losers[pos].source < source))
! 		|| (!sup && !losers[pos].sup &&
! 		    ((comp(*losers[pos].keyp, *keyp))
! 		     || (!comp(*keyp, *losers[pos].keyp)
! 			 && losers[pos].source < source))))
!             {
!               // The other one is smaller.
!               std::swap(losers[pos].sup, sup);
!               std::swap(losers[pos].source, source);
!               std::swap(losers[pos].keyp, keyp);
!             }
!         }
  
!       losers[0].sup = sup;
!       losers[0].source = source;
!       losers[0].keyp = keyp;
!     }
!   };
  
  #endif
  
! #if _GLIBCXX_LOSER_TREE_UNGUARDED
  
! /** @brief Unguarded loser tree, copying the whole element into the
! * tree structure.
  *
  *  No guarding is done, therefore not a single input sequence must
  *  run empty.  This is a very fast variant.
  */
! template<typename T, typename Comparator = std::less<T> >
!   class LoserTreeUnguarded
    {
!   private:
!     struct Loser
!     {
!       int source;
!       T key;
!     };
  
!     unsigned int ik, k, offset;
!     unsigned int* mapping;
!     Loser* losers;
!     Comparator comp;
  
!     void
!     map(unsigned int root, unsigned int begin, unsigned int end)
!     {
!       if (begin + 1 == end)
!         mapping[begin] = root;
!       else
!         {
!           // Next greater or equal power of 2.
!           unsigned int left = 1 << (log2(end - begin - 1));
!           map(root * 2, begin, begin + left);
!           map(root * 2 + 1, begin + left, end);
!         }
!     }
  
!   public:
!     LoserTreeUnguarded(unsigned int _k, Comparator _comp = std::less<T>())
      : comp(_comp)
!     {
!       ik = _k;
!       // Next greater or equal power of 2.
!       k = 1 << (log2(ik - 1) + 1);
!       offset = k;
!       losers = new Loser[k + ik];
!       mapping = new unsigned int[ik];
!       map(1, 0, ik);
!     }
! 
!     ~LoserTreeUnguarded()
!     {
!       delete[] losers;
!       delete[] mapping;
!     }
! 
!     int
!     get_min_source()
!     { return losers[0].source; }
! 
!     void
!     insert_start(const T& key, int source, bool)
!     {
!       unsigned int pos = mapping[source];
!       losers[pos].source = source;
!       losers[pos].key = key;
!     }
! 
!     unsigned int
!     init_winner(unsigned int root, unsigned int begin, unsigned int end)
!     {
!       if (begin + 1 == end)
!         return mapping[begin];
!       else
!         {
!           // Next greater or equal power of 2.
!           unsigned int division = 1 << (log2(end - begin - 1));
!           unsigned int left = init_winner(2 * root, begin, begin + division);
!           unsigned int right =
!                           init_winner(2 * root + 1, begin + division, end);
!           if (!comp(losers[right].key, losers[left].key))
!             {
!               // Left one is less or equal.
!               losers[root] = losers[right];
!               return left;
!             }
!           else
!             {
!               // Right one is less.
!               losers[root] = losers[left];
!               return right;
!             }
!         }
!     }
! 
!     void
!     init()
!     { losers[0] = losers[init_winner(1, 0, ik)]; }
! 
!     // Do not pass const reference since key will be used as local variable.
!     void
!     delete_min_insert(const T& key, bool)
!     {
!       losers[0].key = key;
!       T& keyr = losers[0].key;
!       int& source = losers[0].source;
!       for (int pos = mapping[source] / 2; pos > 0; pos /= 2)
!         {
!           // The smaller one gets promoted.
!           if (comp(losers[pos].key, keyr))
!             {
!               // The other one is smaller.
!               std::swap(losers[pos].source, source);
!               std::swap(losers[pos].key, keyr);
!             }
!         }
!     }
  
!     void
!     insert_start_stable(const T& key, int source, bool)
!     { return insert_start(key, source, false); }
  
!     void
!     init_stable()
!     { init(); }
  
!     void
!     delete_min_insert_stable(const T& key, bool)
!     {
!       losers[0].key = key;
!       T& keyr = losers[0].key;
!       int& source = losers[0].source;
!       for (int pos = mapping[source] / 2; pos > 0; pos /= 2)
!         {
!           // The smaller one gets promoted, ties are broken by source.
!           if (comp(losers[pos].key, keyr)
!               || (!comp(keyr, losers[pos].key)
!                 && losers[pos].source < source))
!             {
!               // The other one is smaller.
!               std::swap(losers[pos].source, source);
!               std::swap(losers[pos].key, keyr);
!             }
!         }
!     }
!   };
  
  #endif
  
! #if _GLIBCXX_LOSER_TREE_POINTER_UNGUARDED
! 
! /** @brief Unguarded loser tree, keeping only pointers to the
! * elements in the tree structure.
! *
! *  No guarding is done, therefore not a single input sequence must
! *  run empty.  This is a very fast variant.
! */
! template<typename T, typename Comparator = std::less<T> >
!   class LoserTreePointerUnguarded
    {
!   private:
!     struct Loser
!     {
!       int source;
!       const T* keyp;
!     };
! 
!     unsigned int ik, k, offset;
!     unsigned int* mapping;
!     Loser* losers;
!     Comparator comp;
  
!     void map(unsigned int root, unsigned int begin, unsigned int end)
!     {
!       if (begin + 1 == end)
!         mapping[begin] = root;
!       else
!         {
!           // Next greater or equal power of 2.
!           unsigned int left = 1 << (log2(end - begin - 1));
!           map(root * 2, begin, begin + left);
!           map(root * 2 + 1, begin + left, end);
!         }
!     }
  
!   public:
!     LoserTreePointerUnguarded(unsigned int _k,
!                               Comparator _comp = std::less<T>())
!     : comp(_comp)
!     {
!       ik = _k;
  
!       // Next greater power of 2.
!       k = 1 << (log2(ik - 1) + 1);
!       offset = k;
!       losers = new Loser[k + ik];
!       mapping = new unsigned int[ik];
!       map(1, 0, ik);
!     }
  
!     ~LoserTreePointerUnguarded()
!     {
!       delete[] losers;
!       delete[] mapping;
!     }
  
!     int
!     get_min_source()
!     { return losers[0].source; }
  
!     void
!     insert_start(const T& key, int source, bool)
!     {
!       unsigned int pos = mapping[source];
!       losers[pos].source = source;
!       losers[pos].keyp = &key;
!     }
  
!     unsigned int
!     init_winner(unsigned int root, unsigned int begin, unsigned int end)
!     {
!       if (begin + 1 == end)
!         return mapping[begin];
!       else
!         {
!           // Next greater or equal power of 2.
!           unsigned int division = 1 << (log2(end - begin - 1));
!           unsigned int left = init_winner(2 * root, begin, begin + division);
!           unsigned int right = init_winner(2 * root + 1,
! 					   begin + division, end);
!           if (!comp(*losers[right].keyp, *losers[left].keyp))
!             {
!               // Left one is less or equal.
!               losers[root] = losers[right];
!               return left;
!             }
!           else
!             {
!               // Right one is less.
!               losers[root] = losers[left];
!               return right;
!             }
!         }
!     }
  
!     void
!     init()
!     { losers[0] = losers[init_winner(1, 0, ik)]; }
  
!     void
!     delete_min_insert(const T& key, bool)
!     {
!       const T* keyp = &key;
!       int& source = losers[0].source;
!       for (int pos = mapping[source] / 2; pos > 0; pos /= 2)
!         {
!           // The smaller one gets promoted.
!           if (comp(*losers[pos].keyp, *keyp))
!             {
!               // The other one is smaller.
!               std::swap(losers[pos].source, source);
!               std::swap(losers[pos].keyp, keyp);
!             }
!         }
  
!       losers[0].keyp = keyp;
!     }
  
!     void
!     insert_start_stable(const T& key, int source, bool)
!     { return insert_start(key, source, false); }
  
!     void
!     init_stable()
!     { init(); }
  
!     void
!     delete_min_insert_stable(const T& key, bool)
!     {
!       int& source = losers[0].source;
!       const T* keyp = &key;
!       for (int pos = mapping[source] / 2; pos > 0; pos /= 2)
!         {
!           // The smaller one gets promoted, ties are broken by source.
!           if (comp(*losers[pos].keyp, *keyp)
!               || (!comp(*keyp, *losers[pos].keyp)
!                   && losers[pos].source < source))
!             {
!               // The other one is smaller.
!               std::swap(losers[pos].source, source);
!               std::swap(losers[pos].keyp, keyp);
!             }
!         }
!       losers[0].keyp = keyp;
!     }
!   };
  #endif
  
! template<typename _ValueTp, class Comparator>
!   struct loser_tree_traits
    {
! #if _GLIBCXX_LOSER_TREE
!     typedef LoserTree<_ValueTp, Comparator> LT;
! #else
! #  if _GLIBCXX_LOSER_TREE_POINTER
!     typedef LoserTreePointer<_ValueTp, Comparator> LT;
! #  else
! #    error Must define some type in losertree.h.
! #  endif
  #endif
!   };
  
! template<typename _ValueTp, class Comparator>
!   struct loser_tree_unguarded_traits
    {
! #if _GLIBCXX_LOSER_TREE_UNGUARDED
!     typedef LoserTreeUnguarded<_ValueTp, Comparator> LT;
! #else
! #  if _GLIBCXX_LOSER_TREE_POINTER_UNGUARDED
!     typedef LoserTreePointerUnguarded<_ValueTp, Comparator> LT;
! #  else
! #    error Must define some unguarded type in losertree.h.
! #  endif
  #endif
-   };
  
! }
  
  #endif
--- 47,1027 ----
  namespace __gnu_parallel
  {
  
! /**
!  * @brief Guarded loser/tournament tree.
!  *
!  * The smallest element is at the top.
!  *
!  * Guarding is done explicitly through one flag sup per element,
!  * inf is not needed due to a better initialization routine.  This
!  * is a well-performing variant.
!  *
!  * @param T the element type
!  * @param Comparator the comparator to use, defaults to std::less<T>
!  */
! template<typename T, typename Comparator>
! class LoserTreeBase
! {
! protected:
!   /** @brief Internal representation of a LoserTree element. */
!   struct Loser
    {
!     /** @brief flag, true iff this is a "maximum" sentinel. */
!     bool sup;
!     /** @brief index of the source sequence. */
!     int source;
!     /** @brief key of the element in the LoserTree. */
!     T key;
!   };
  
!   unsigned int ik, k, offset;
  
!   /** log_2{k} */
!   unsigned int _M_log_k;
  
!   /** @brief LoserTree elements. */
!   Loser* losers;
  
!   /** @brief Comparator to use. */
!   Comparator comp;
  
!   /**
!    * @brief State flag that determines whether the LoserTree is empty.
!    *
!    * Only used for building the LoserTree.
!    */
!   bool first_insert;
  
! public:
!   /**
!    * @brief The constructor.
!    *
!    * @param _k The number of sequences to merge.
!    * @param _comp The comparator to use.
!    */
!   LoserTreeBase(unsigned int _k, Comparator _comp)
!   : comp(_comp)
!   {
!     ik = _k;
  
!     // Compute log_2{k} for the Loser Tree
!     _M_log_k = log2(ik - 1) + 1;
  
!     // Next greater power of 2.
!     k = 1 << _M_log_k;
!     offset = k;
  
!     // Avoid default-constructing losers[].key
!     losers = static_cast<Loser*>(::operator new(2 * k * sizeof(Loser)));
!     for (unsigned int i = ik - 1; i < k; ++i)
!       losers[i + k].sup = true;
  
!     first_insert = true;
!   }
  
!   /**
!    * @brief The destructor.
!    */
!   ~LoserTreeBase()
!   { ::operator delete(losers); }
  
!   /**
!    * @brief Initializes the sequence "source" with the element "key".
!    *
!    * @param key the element to insert
!    * @param source index of the source sequence
!    * @param sup flag that determines whether the value to insert is an
!    *   explicit supremum.
!    */
!   inline void
!   insert_start(const T& key, int source, bool sup)
!   {
!     unsigned int pos = k + source;
  
!     if(first_insert)
!       {
!         // Construct all keys, so we can easily deconstruct them.
!         for (unsigned int i = 0; i < (2 * k); ++i)
!           new(&(losers[i].key)) T(key);
!         first_insert = false;
!       }
!     else
!       new(&(losers[pos].key)) T(key);
  
!     losers[pos].sup = sup;
!     losers[pos].source = source;
!   }
  
!   /**
!    * @return the index of the sequence with the smallest element.
!    */
!   int get_min_source()
!   { return losers[0].source; }
! };
  
! /**
!  * @brief Stable LoserTree variant.
!  *
!  * Provides the stable implementations of insert_start, init_winner,
!  * init and delete_min_insert.
!  *
!  * Unstable variant is done using partial specialisation below.
!  */
! template<bool stable/* default == true */, typename T, typename Comparator>
! class LoserTree : public LoserTreeBase<T, Comparator>
! {
!   typedef LoserTreeBase<T, Comparator> Base;
!   using Base::k;
!   using Base::losers;
!   using Base::first_insert;
  
! public:
!   LoserTree(unsigned int _k, Comparator _comp)
!   : Base::LoserTreeBase(_k, _comp)
!   {}
  
!   unsigned int
!   init_winner(unsigned int root)
    {
!     if (root >= k)
!       {
!         return root;
!       }
!     else
!       {
!         unsigned int left = init_winner (2 * root);
!         unsigned int right = init_winner (2 * root + 1);
!         if (losers[right].sup
!             || (!losers[left].sup
!               && !comp(losers[right].key, losers[left].key)))
!           {
!             // Left one is less or equal.
!             losers[root] = losers[right];
!             return left;
!           }
!         else
!           {
!             // Right one is less.
!             losers[root] = losers[left];
!             return right;
!           }
!       }
!   }
  
!   void init()
!   { losers[0] = losers[init_winner(1)]; }
  
!   /**
!    * @brief Delete the smallest element and insert a new element from
!    *   the previously smallest element's sequence.
!    *
!    * This implementation is stable.
!    */
!   // Do not pass a const reference since key will be used as local variable.
!   void delete_min_insert(T key, bool sup)
!   {
! #if _GLIBCXX_ASSERTIONS
!     // no dummy sequence can ever be at the top!
!     _GLIBCXX_PARALLEL_ASSERT(losers[0].source != -1);
! #endif
  
!     int source = losers[0].source;
!     for (unsigned int pos = (k + source) / 2; pos > 0; pos /= 2)
!       {
!         // The smaller one gets promoted, ties are broken by source.
!         if ((sup && (!losers[pos].sup || losers[pos].source < source))
!               || (!sup && !losers[pos].sup
!                 && ((comp(losers[pos].key, key))
!                   || (!comp(key, losers[pos].key)
!                     && losers[pos].source < source))))
!           {
!             // The other one is smaller.
!             std::swap(losers[pos].sup, sup);
!             std::swap(losers[pos].source, source);
!             std::swap(losers[pos].key, key);
!           }
!       }
  
!     losers[0].sup = sup;
!     losers[0].source = source;
!     losers[0].key = key;
!   }
! };
  
! /**
!  * @brief Unstable LoserTree variant.
!  *
!  * Stability (non-stable here) is selected with partial specialization.
!  */
! template<typename T, typename Comparator>
! class LoserTree</* stable == */false, T, Comparator> :
!     public LoserTreeBase<T, Comparator>
! {
!   typedef LoserTreeBase<T, Comparator> Base;
!   using Base::_M_log_k;
!   using Base::k;
!   using Base::losers;
!   using Base::first_insert;
  
! public:
!   LoserTree(unsigned int _k, Comparator _comp)
!   : Base::LoserTreeBase(_k, _comp)
!   {}
  
!   /**
!    * Computes the winner of the competition at position "root".
!    *
!    * Called recursively (starting at 0) to build the initial tree.
!    *
!    * @param root index of the "game" to start.
!    */
!   unsigned int
!   init_winner (unsigned int root)
!   {
!     if (root >= k)
!       {
!         return root;
!       }
!     else
!       {
!         unsigned int left = init_winner (2 * root);
!         unsigned int right = init_winner (2 * root + 1);
!         if (losers[right].sup ||
!             (!losers[left].sup
!               && !comp(losers[right].key, losers[left].key)))
!           {
!             // Left one is less or equal.
!             losers[root] = losers[right];
!             return left;
!           }
!         else
!           {
!             // Right one is less.
!             losers[root] = losers[left];
!             return right;
!           }
!       }
!   }
  
!   inline void
!   init()
!   { losers[0] = losers[init_winner(1)]; }
  
!   /**
!    * Delete the key smallest element and insert the element key instead.
!    *
!    * @param key the key to insert
!    * @param sup true iff key is an explicitly marked supremum
!    */
!   // Do not pass a const reference since key will be used as local variable.
!   inline void
!   delete_min_insert(T key, bool sup)
!   {
! #if _GLIBCXX_ASSERTIONS
!     // no dummy sequence can ever be at the top!
!     _GLIBCXX_PARALLEL_ASSERT(losers[0].source != -1);
! #endif
  
!     int source = losers[0].source;
!     for (unsigned int pos = (k + source) / 2; pos > 0; pos /= 2)
      {
!         // The smaller one gets promoted.
!       if (sup || (!losers[pos].sup && comp(losers[pos].key, key)))
!       {
!             // The other one is smaller.
!         std::swap(losers[pos].sup, sup);
!         std::swap(losers[pos].source, source);
!         std::swap(losers[pos].key, key);
!       }
      }
  
!     losers[0].sup = sup;
!     losers[0].source = source;
!     losers[0].key = key;
!   }
! };
  
  
! /**
!  * @brief Base class of Loser Tree implementation using pointers.
!  */
! template<typename T, typename Comparator>
! class LoserTreePointerBase
! {
! protected:
!   /** @brief Internal representation of LoserTree elements. */
!   struct Loser
!   {
!     bool sup;
!     int source;
!     const T* keyp;
!   };
  
!   unsigned int ik, k, offset;
!   Loser* losers;
!   Comparator comp;
  
! public:
!   LoserTreePointerBase(unsigned int _k, Comparator _comp = std::less<T>())
!     : comp(_comp)
!   {
!     ik = _k;
  
!     // Next greater power of 2.
!     k = 1 << (log2(ik - 1) + 1);
!     offset = k;
!     losers = new Loser[k * 2];
!     for (unsigned int i = ik - 1; i < k; i++)
!       losers[i + k].sup = true;
!   }
  
!   ~LoserTreePointerBase()
!   { ::operator delete(losers); }
  
!   int get_min_source()
!   { return losers[0].source; }
  
!   void insert_start(const T& key, int source, bool sup)
!   {
!     unsigned int pos = k + source;
  
!     losers[pos].sup = sup;
!     losers[pos].source = source;
!     losers[pos].keyp = &key;
!   }
! };
  
! /**
!  * @brief Stable LoserTree implementation.
!  *
!  * The unstable variant is implemented using partial instantiation below.
!  */
! template<bool stable/* default == true */, typename T, typename Comparator>
! class LoserTreePointer : public LoserTreePointerBase<T, Comparator>
! {
!   typedef LoserTreePointerBase<T, Comparator> Base;
!   using Base::k;
!   using Base::losers;
  
! public:
!   LoserTreePointer(unsigned int _k, Comparator _comp = std::less<T>())
!     : Base::LoserTreePointerBase(_k, _comp)
!   {}
  
!   unsigned int
!   init_winner(unsigned int root)
!   {
!     if (root >= k)
!       {
!         return root;
!       }
!     else
!       {
!         unsigned int left = init_winner (2 * root);
!         unsigned int right = init_winner (2 * root + 1);
!         if (losers[right].sup
!             || (!losers[left].sup && !comp(*losers[right].keyp,
!                                           *losers[left].keyp)))
!           {
!             // Left one is less or equal.
!             losers[root] = losers[right];
!             return left;
!           }
!         else
!           {
!             // Right one is less.
!             losers[root] = losers[left];
!             return right;
!           }
!       }
!   }
  
!   void init()
!   { losers[0] = losers[init_winner(1)]; }
  
!   void delete_min_insert(const T& key, bool sup)
!   {
! #if _GLIBCXX_ASSERTIONS
!     // no dummy sequence can ever be at the top!
!     _GLIBCXX_PARALLEL_ASSERT(losers[0].source != -1);
  #endif
  
!     const T* keyp = &key;
!     int source = losers[0].source;
!     for (unsigned int pos = (k + source) / 2; pos > 0; pos /= 2)
!       {
!         // The smaller one gets promoted, ties are broken by source.
!         if ((sup && (!losers[pos].sup || losers[pos].source < source)) ||
!               (!sup && !losers[pos].sup &&
!               ((comp(*losers[pos].keyp, *keyp)) ||
!                 (!comp(*keyp, *losers[pos].keyp)
!                 && losers[pos].source < source))))
!           {
!             // The other one is smaller.
!             std::swap(losers[pos].sup, sup);
!             std::swap(losers[pos].source, source);
!             std::swap(losers[pos].keyp, keyp);
!           }
!       }
  
!     losers[0].sup = sup;
!     losers[0].source = source;
!     losers[0].keyp = keyp;
!   }
! };
  
! /**
!  * @brief Unstable LoserTree implementation.
!  *
!  * The stable variant is above.
!  */
! template<typename T, typename Comparator>
! class LoserTreePointer</* stable == */false, T, Comparator> :
!     public LoserTreePointerBase<T, Comparator>
! {
!   typedef LoserTreePointerBase<T, Comparator> Base;
!   using Base::k;
!   using Base::losers;
  
! public:
!   LoserTreePointer(unsigned int _k, Comparator _comp = std::less<T>())
!     : Base::LoserTreePointerBase(_k, _comp)
!   {}
  
!   unsigned int
!   init_winner(unsigned int root)
!   {
!     if (root >= k)
!       {
!         return root;
!       }
!     else
!       {
!         unsigned int left = init_winner (2 * root);
!         unsigned int right = init_winner (2 * root + 1);
!         if (losers[right].sup
!               || (!losers[left].sup
!                 && !comp(*losers[right].keyp, *losers[left].keyp)))
!           {
!             // Left one is less or equal.
!             losers[root] = losers[right];
!             return left;
!           }
!         else
!           {
!             // Right one is less.
!             losers[root] = losers[left];
!             return right;
!           }
!       }
!   }
  
!   void init()
!   { losers[0] = losers[init_winner(1)]; }
  
!   void delete_min_insert(const T& key, bool sup)
!   {
! #if _GLIBCXX_ASSERTIONS
!     // no dummy sequence can ever be at the top!
!     _GLIBCXX_PARALLEL_ASSERT(losers[0].source != -1);
  #endif
  
!     const T* keyp = &key;
!     int source = losers[0].source;
!     for (unsigned int pos = (k + source) / 2; pos > 0; pos /= 2)
!       {
!         // The smaller one gets promoted.
!         if (sup || (!losers[pos].sup && comp(*losers[pos].keyp, *keyp)))
!           {
!             // The other one is smaller.
!             std::swap(losers[pos].sup, sup);
!             std::swap(losers[pos].source, source);
!             std::swap(losers[pos].keyp, keyp);
!           }
!       }
  
!     losers[0].sup = sup;
!     losers[0].source = source;
!     losers[0].keyp = keyp;
!   }
! };
  
! /** @brief Base class for unguarded LoserTree implementation.
!  * 
!  * The whole element is copied into the tree structure.
!  *
!  * No guarding is done, therefore not a single input sequence must
!  * run empty.  Unused sequence heads are marked with a sentinel which
!  * is &gt; all elements that are to be merged.
!  *
!  * This is a very fast variant.
!  */
! template<typename T, typename Comparator>
! class LoserTreeUnguardedBase
! {
! protected:
!   struct Loser
!   {
!     int source;
!     T key;
!   };
  
!   unsigned int ik, k, offset;
!   Loser* losers;
!   Comparator comp;
  
! public:
!   inline
!   LoserTreeUnguardedBase(unsigned int _k, const T _sentinel,
!                          Comparator _comp = std::less<T>())
!     : comp(_comp)
!   {
!     ik = _k;
  
!     // Next greater power of 2.
!     k = 1 << (log2(ik - 1) + 1);
!     offset = k;
!     // Avoid default-constructing losers[].key
!     losers = static_cast<Loser*>(::operator new(2 * k * sizeof(Loser)));
  
!     for (unsigned int i = k + ik - 1; i < (2 * k); ++i)
!       {
!         losers[i].key = _sentinel;
!         losers[i].source = -1;
!       }
!   }
  
!   inline ~LoserTreeUnguardedBase()
!   { ::operator delete(losers); }
! 
!   inline int
!   get_min_source()
    {
! #if _GLIBCXX_ASSERTIONS
!     // no dummy sequence can ever be at the top!
!     _GLIBCXX_PARALLEL_ASSERT(losers[0].source != -1);
! #endif
!     return losers[0].source;
!   }
  
!   inline void
!   insert_start(const T& key, int source, bool)
!   {
!     unsigned int pos = k + source;
  
!     new(&(losers[pos].key)) T(key);
!     losers[pos].source = source;
!   }
! };
  
! /**
!  * @brief Stable implementation of unguarded LoserTree.
!  *
!  * Unstable variant is selected below with partial specialization.
!  */
! template<bool stable/* default == true */, typename T, typename Comparator>
! class LoserTreeUnguarded : public LoserTreeUnguardedBase<T, Comparator>
! {
!   typedef LoserTreeUnguardedBase<T, Comparator> Base;
!   using Base::k;
!   using Base::losers;
  
! public:
!   LoserTreeUnguarded(unsigned int _k, const T _sentinel,
!                      Comparator _comp = std::less<T>())
!     : Base::LoserTreeUnguardedBase(_k, _sentinel, _comp)
!   {}
  
!   unsigned int
!   init_winner(unsigned int root)
!   {
!     if (root >= k)
!       {
!         return root;
!       }
!     else
!       {
!         unsigned int left = init_winner (2 * root);
!         unsigned int right = init_winner (2 * root + 1);
!         if (!comp(losers[right].key, losers[left].key))
!           {
!             // Left one is less or equal.
!             losers[root] = losers[right];
!             return left;
!           }
!         else
!           {
!             // Right one is less.
!             losers[root] = losers[left];
!             return right;
!           }
!       }
!   }
  
!   inline void
!   init()
!   {
!     losers[0] = losers[init_winner(1)];
  
! #if _GLIBCXX_ASSERTIONS
!     // no dummy sequence can ever be at the top at the beginning (0 sequences!)
!     _GLIBCXX_PARALLEL_ASSERT(losers[0].source != -1);
! #endif
!   }
  
!   // Do not pass a const reference since key will be used as local variable.
!   inline void
!   delete_min_insert(T key, bool)
!   {
! #if _GLIBCXX_ASSERTIONS
!     // no dummy sequence can ever be at the top!
!     _GLIBCXX_PARALLEL_ASSERT(losers[0].source != -1);
! #endif
  
!     int source = losers[0].source;
!     for (unsigned int pos = (k + source) / 2; pos > 0; pos /= 2)
!       {
!         // The smaller one gets promoted, ties are broken by source.
!         if (comp(losers[pos].key, key)
!               || (!comp(key, losers[pos].key) && losers[pos].source < source))
!           {
!             // The other one is smaller.
!             std::swap(losers[pos].source, source);
!             std::swap(losers[pos].key, key);
!           }
!       }
  
!     losers[0].source = source;
!     losers[0].key = key;
!   }
! };
  
! /**
!  * @brief Non-Stable implementation of unguarded LoserTree.
!  *
!  * Stable implementation is above.
!  */
! template<typename T, typename Comparator>
! class LoserTreeUnguarded</* stable == */false, T, Comparator> :
!     public LoserTreeUnguardedBase<T, Comparator>
! {
!   typedef LoserTreeUnguardedBase<T, Comparator> Base;
!   using Base::k;
!   using Base::losers;
  
! public:
!   LoserTreeUnguarded(unsigned int _k, const T _sentinel,
!                      Comparator _comp = std::less<T>())
!     : Base::LoserTreeUnguardedBase(_k, _sentinel, _comp)
!   {}
  
!   unsigned int
!   init_winner (unsigned int root)
!   {
!     if (root >= k)
!       {
!         return root;
!       }
!     else
!       {
!         unsigned int left = init_winner (2 * root);
!         unsigned int right = init_winner (2 * root + 1);
  
! #if _GLIBCXX_ASSERTIONS
!         // If left one is sentinel then right one must be, too.
!         if (losers[left].source == -1)
!           _GLIBCXX_PARALLEL_ASSERT(losers[right].source == -1);
! #endif
  
!         if (!comp(losers[right].key, losers[left].key))
!           {
!             // Left one is less or equal.
!             losers[root] = losers[right];
!             return left;
!           }
!         else
!           {
!             // Right one is less.
!             losers[root] = losers[left];
!             return right;
!           }
!       }
!   }
  
!   inline void
!   init()
!   {
!     losers[0] = losers[init_winner(1)];
  
+ #if _GLIBCXX_ASSERTIONS
+     // no dummy sequence can ever be at the top at the beginning (0 sequences!)
+     _GLIBCXX_PARALLEL_ASSERT(losers[0].source != -1);
  #endif
+   }
  
!   // Do not pass a const reference since key will be used as local variable.
!   inline void
!   delete_min_insert(T key, bool)
!   {
! #if _GLIBCXX_ASSERTIONS
!     // no dummy sequence can ever be at the top!
!     _GLIBCXX_PARALLEL_ASSERT(losers[0].source != -1);
! #endif
  
!     int source = losers[0].source;
!     for (unsigned int pos = (k + source) / 2; pos > 0; pos /= 2)
!       {
!         // The smaller one gets promoted.
!         if (comp(losers[pos].key, key))
!           {
!             // The other one is smaller.
!             std::swap(losers[pos].source, source);
!             std::swap(losers[pos].key, key);
!           }
!       }
! 
!     losers[0].source = source;
!     losers[0].key = key;
!   }
! };
! 
! /** @brief Unguarded loser tree, keeping only pointers to the
! * elements in the tree structure.
  *
  *  No guarding is done, therefore not a single input sequence must
  *  run empty.  This is a very fast variant.
  */
! template<typename T, typename Comparator>
! class LoserTreePointerUnguardedBase
! {
! protected:
!   struct Loser
    {
!     int source;
!     const T* keyp;
!   };
  
!   unsigned int ik, k, offset;
!   Loser* losers;
!   Comparator comp;
  
! public:
  
!   inline
!   LoserTreePointerUnguardedBase(unsigned int _k, const T& _sentinel,
!       Comparator _comp = std::less<T>())
      : comp(_comp)
!   {
!     ik = _k;
  
!     // Next greater power of 2.
!     k = 1 << (log2(ik - 1) + 1);
!     offset = k;
!     // Avoid default-constructing losers[].key
!     losers = new Loser[2 * k];
  
!     for (unsigned int i = k + ik - 1; i < (2 * k); ++i)
!       {
!         losers[i].keyp = &_sentinel;
!         losers[i].source = -1;
!       }
!   }
  
!   inline ~LoserTreePointerUnguardedBase()
!   { delete[] losers; }
  
+   inline int
+   get_min_source()
+   {
+ #if _GLIBCXX_ASSERTIONS
+     // no dummy sequence can ever be at the top!
+     _GLIBCXX_PARALLEL_ASSERT(losers[0].source != -1);
  #endif
+     return losers[0].source;
+   }
  
!   inline void
!   insert_start(const T& key, int source, bool)
    {
!     unsigned int pos = k + source;
  
!     losers[pos].keyp = &key;
!     losers[pos].source = source;
!   }
! };
  
! /**
!  * @brief Stable unguarded LoserTree variant storing pointers.
!  *
!  * Unstable variant is implemented below using partial specialization.
!  */
! template<bool stable/* default == true */, typename T, typename Comparator>
! class LoserTreePointerUnguarded :
!     public LoserTreePointerUnguardedBase<T, Comparator>
! {
!   typedef LoserTreePointerUnguardedBase<T, Comparator> Base;
!   using Base::k;
!   using Base::losers;
  
! public:
!   LoserTreePointerUnguarded(unsigned int _k, const T& _sentinel,
!       Comparator _comp = std::less<T>())
!     : Base::LoserTreePointerUnguardedBase(_k, _sentinel, _comp)
!   {}
  
!   unsigned int
!   init_winner(unsigned int root)
!   {
!     if (root >= k)
!       {
!         return root;
!       }
!     else
!       {
!         unsigned int left = init_winner (2 * root);
!         unsigned int right = init_winner (2 * root + 1);
!         if (!comp(*losers[right].keyp, *losers[left].keyp))
!           {
!             // Left one is less or equal.
!             losers[root] = losers[right];
!             return left;
!           }
!         else
!           {
!             // Right one is less.
!             losers[root] = losers[left];
!             return right;
!           }
!       }
!   }
  
!   inline void
!   init()
!   {
!     losers[0] = losers[init_winner(1)];
  
! #if _GLIBCXX_ASSERTIONS
!     // no dummy sequence can ever be at the top at the beginning (0 sequences!)
!     _GLIBCXX_PARALLEL_ASSERT(losers[0].source != -1);
! #endif
!   }
  
!   inline void
!   delete_min_insert(const T& key, bool sup)
!   {
! #if _GLIBCXX_ASSERTIONS
!     // no dummy sequence can ever be at the top!
!     _GLIBCXX_PARALLEL_ASSERT(losers[0].source != -1);
! #endif
  
!     const T* keyp = &key;
!     int source = losers[0].source;
!     for (unsigned int pos = (k + source) / 2; pos > 0; pos /= 2)
!       {
!         // The smaller one gets promoted, ties are broken by source.
!         if (comp(*losers[pos].keyp, *keyp)
!           || (!comp(*keyp, *losers[pos].keyp) && losers[pos].source < source))
!           {
!             // The other one is smaller.
!             std::swap(losers[pos].source, source);
!             std::swap(losers[pos].keyp, keyp);
!           }
!       }
  
!     losers[0].source = source;
!     losers[0].keyp = keyp;
!   }
! };
  
! /**
!  * @brief Unstable unguarded LoserTree variant storing pointers.
!  *
!  * Stable variant is above.
!  */
! template<typename T, typename Comparator>
! class LoserTreePointerUnguarded</* stable == */false, T, Comparator> :
!     public LoserTreePointerUnguardedBase<T, Comparator>
! {
!   typedef LoserTreePointerUnguardedBase<T, Comparator> Base;
!   using Base::k;
!   using Base::losers;
  
! public:
!   LoserTreePointerUnguarded(unsigned int _k, const T& _sentinel,
!       Comparator _comp = std::less<T>())
!     : Base::LoserTreePointerUnguardedBase(_k, _sentinel, _comp)
!   {}
  
!   unsigned int
!   init_winner(unsigned int root)
!   {
!     if (root >= k)
!       {
!         return root;
!       }
!     else
!       {
!         unsigned int left = init_winner (2 * root);
!         unsigned int right = init_winner (2 * root + 1);
  
! #if _GLIBCXX_ASSERTIONS
!         // If left one is sentinel then right one must be, too.
!         if (losers[left].source == -1)
!           _GLIBCXX_PARALLEL_ASSERT(losers[right].source == -1);
  #endif
  
!         if (!comp(*losers[right].keyp, *losers[left].keyp))
!           {
!             // Left one is less or equal.
!             losers[root] = losers[right];
!             return left;
!           }
!         else
!           {
!             // Right one is less.
!             losers[root] = losers[left];
!             return right;
!           }
!       }
!   }
! 
!   inline void
!   init()
    {
!     losers[0] = losers[init_winner(1)];
! 
! #if _GLIBCXX_ASSERTIONS
!     // no dummy sequence can ever be at the top at the beginning (0 sequences!)
!     _GLIBCXX_PARALLEL_ASSERT(losers[0].source != -1);
  #endif
!   }
  
!   inline void
!   delete_min_insert(const T& key, bool sup)
    {
! #if _GLIBCXX_ASSERTIONS
!     // no dummy sequence can ever be at the top!
!     _GLIBCXX_PARALLEL_ASSERT(losers[0].source != -1);
  #endif
  
!     const T* keyp = &key;
!     int source = losers[0].source;
!     for (unsigned int pos = (k + source) / 2; pos > 0; pos /= 2)
!       {
!         // The smaller one gets promoted.
!         if (comp(*(losers[pos].keyp), *keyp))
!           {
!             // The other one is smaller.
!             std::swap(losers[pos].source, source);
!             std::swap(losers[pos].keyp, keyp);
!           }
!       }
! 
!     losers[0].source = source;
!     losers[0].keyp = keyp;
!   }
! };
! 
! } // namespace __gnu_parallel
  
  #endif
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/parallel/merge.h gcc-4.3.1/libstdc++-v3/include/parallel/merge.h
*** gcc-4.3.0/libstdc++-v3/include/parallel/merge.h	Thu Jan 10 02:07:41 2008
--- gcc-4.3.1/libstdc++-v3/include/parallel/merge.h	Wed Apr  9 16:47:00 2008
*************** namespace __gnu_parallel
*** 239,257 ****
  			   std::iterator_traits<RandomAccessIterator1>::
  			   difference_type max_length, Comparator comp)
      {
!       typedef typename std::iterator_traits<RandomAccessIterator1>::value_type
! 	value_type;
        typedef typename std::iterator_traits<RandomAccessIterator1>::
  	difference_type difference_type1 /* == difference_type2 */;
        typedef typename std::iterator_traits<RandomAccessIterator3>::
  	difference_type difference_type3;
  
        std::pair<RandomAccessIterator1, RandomAccessIterator1>
  	seqs[2] = { std::make_pair(begin1, end1),
  		    std::make_pair(begin2, end2) };
!       RandomAccessIterator3 
! 	target_end = parallel_multiway_merge(seqs, seqs + 2, target,
! 					     comp, max_length, true, false);
  
        return target_end;
      }
--- 239,264 ----
  			   std::iterator_traits<RandomAccessIterator1>::
  			   difference_type max_length, Comparator comp)
      {
!       typedef typename
!           std::iterator_traits<RandomAccessIterator1>::value_type value_type;
        typedef typename std::iterator_traits<RandomAccessIterator1>::
  	difference_type difference_type1 /* == difference_type2 */;
        typedef typename std::iterator_traits<RandomAccessIterator3>::
  	difference_type difference_type3;
+       typedef typename std::pair<RandomAccessIterator1, RandomAccessIterator1>
+         iterator_pair;
  
        std::pair<RandomAccessIterator1, RandomAccessIterator1>
  	seqs[2] = { std::make_pair(begin1, end1),
  		    std::make_pair(begin2, end2) };
!       RandomAccessIterator3
!         target_end = parallel_multiway_merge
!           < /* stable = */ true, /* sentinels = */ false>(
!             seqs, seqs + 2, target, comp,
!             multiway_merge_exact_splitting
!               < /* stable = */ true, iterator_pair*,
!                 Comparator, difference_type1>,
!             max_length);
  
        return target_end;
      }
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/parallel/multiseq_selection.h gcc-4.3.1/libstdc++-v3/include/parallel/multiseq_selection.h
*** gcc-4.3.0/libstdc++-v3/include/parallel/multiseq_selection.h	Sun Feb 17 15:46:30 2008
--- gcc-4.3.1/libstdc++-v3/include/parallel/multiseq_selection.h	Wed Apr 23 07:22:38 2008
*************** namespace __gnu_parallel
*** 124,145 ****
     *  @param comp The ordering functor, defaults to std::less<T>. 
     */
    template<typename RanSeqs, typename RankType, typename RankIterator,
! 	   typename Comparator>
      void
      multiseq_partition(RanSeqs begin_seqs, RanSeqs end_seqs,
! 		       RankType rank,
! 		       RankIterator begin_offsets,
! 		       Comparator comp = std::less<
! 		       typename std::iterator_traits<typename
! 		       std::iterator_traits<RanSeqs>::value_type::
! 		       first_type>::value_type>()) // std::less<T>
      {
        _GLIBCXX_CALL(end_seqs - begin_seqs)
  
        typedef typename std::iterator_traits<RanSeqs>::value_type::first_type
! 	It;
        typedef typename std::iterator_traits<It>::difference_type
! 	difference_type;
        typedef typename std::iterator_traits<It>::value_type value_type;
  
        lexicographic<value_type, int, Comparator> lcomp(comp);
--- 124,145 ----
     *  @param comp The ordering functor, defaults to std::less<T>. 
     */
    template<typename RanSeqs, typename RankType, typename RankIterator,
!             typename Comparator>
      void
      multiseq_partition(RanSeqs begin_seqs, RanSeqs end_seqs,
!                        RankType rank,
!                        RankIterator begin_offsets,
!                        Comparator comp = std::less<
!                        typename std::iterator_traits<typename
!                        std::iterator_traits<RanSeqs>::value_type::
!                        first_type>::value_type>()) // std::less<T>
      {
        _GLIBCXX_CALL(end_seqs - begin_seqs)
  
        typedef typename std::iterator_traits<RanSeqs>::value_type::first_type
!         It;
        typedef typename std::iterator_traits<It>::difference_type
! 	       difference_type;
        typedef typename std::iterator_traits<It>::value_type value_type;
  
        lexicographic<value_type, int, Comparator> lcomp(comp);
*************** namespace __gnu_parallel
*** 148,166 ****
        // Number of sequences, number of elements in total (possibly
        // including padding).
        difference_type m = std::distance(begin_seqs, end_seqs), N = 0,
! 	nmax, n, r;
  
        for (int i = 0; i < m; i++)
! 	N += std::distance(begin_seqs[i].first, begin_seqs[i].second);
  
        if (rank == N)
! 	{
! 	  for (int i = 0; i < m; i++)
! 	    begin_offsets[i] = begin_seqs[i].second; // Very end.
! 	  // Return m - 1;
! 	}
  
!       _GLIBCXX_PARALLEL_ASSERT(m != 0 && N != 0 && rank >= 0 && rank < N);
  
        difference_type* ns = new difference_type[m];
        difference_type* a = new difference_type[m];
--- 148,174 ----
        // Number of sequences, number of elements in total (possibly
        // including padding).
        difference_type m = std::distance(begin_seqs, end_seqs), N = 0,
!                       nmax, n, r;
  
        for (int i = 0; i < m; i++)
!         {
!           N += std::distance(begin_seqs[i].first, begin_seqs[i].second);
!           _GLIBCXX_PARALLEL_ASSERT(
!             std::distance(begin_seqs[i].first, begin_seqs[i].second) > 0);
!         }
  
        if (rank == N)
!         {
!           for (int i = 0; i < m; i++)
!             begin_offsets[i] = begin_seqs[i].second; // Very end.
!           // Return m - 1;
!           return;
!         }
  
!       _GLIBCXX_PARALLEL_ASSERT(m != 0);
!       _GLIBCXX_PARALLEL_ASSERT(N != 0);
!       _GLIBCXX_PARALLEL_ASSERT(rank >= 0);
!       _GLIBCXX_PARALLEL_ASSERT(rank < N);
  
        difference_type* ns = new difference_type[m];
        difference_type* a = new difference_type[m];
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/parallel/multiway_merge.h gcc-4.3.1/libstdc++-v3/include/parallel/multiway_merge.h
*** gcc-4.3.0/libstdc++-v3/include/parallel/multiway_merge.h	Mon Feb 18 00:00:00 2008
--- gcc-4.3.1/libstdc++-v3/include/parallel/multiway_merge.h	Tue May  6 08:56:35 2008
***************
*** 40,46 ****
  *  This file is a GNU parallel extension to the Standard C++ Library.
  */
  
! // Written by Johannes Singler.
  
  #ifndef _GLIBCXX_PARALLEL_MULTIWAY_MERGE_H
  #define _GLIBCXX_PARALLEL_MULTIWAY_MERGE_H
--- 40,46 ----
  *  This file is a GNU parallel extension to the Standard C++ Library.
  */
  
! // Written by Johannes Singler and Manuel Holtgrewe.
  
  #ifndef _GLIBCXX_PARALLEL_MULTIWAY_MERGE_H
  #define _GLIBCXX_PARALLEL_MULTIWAY_MERGE_H
***************
*** 50,56 ****
  #include <bits/stl_algo.h>
  #include <parallel/features.h>
  #include <parallel/parallel.h>
- #include <parallel/merge.h>
  #include <parallel/losertree.h>
  #if _GLIBCXX_ASSERTIONS
  #include <parallel/checkers.h>
--- 50,55 ----
***************
*** 59,85 ****
  /** @brief Length of a sequence described by a pair of iterators. */
  #define _GLIBCXX_PARALLEL_LENGTH(s) ((s).second - (s).first)
  
- // XXX need iterator typedefs
  namespace __gnu_parallel
  {
  template<typename RandomAccessIterator, typename Comparator>
    class guarded_iterator;
  
  template<typename RandomAccessIterator, typename Comparator>
    inline bool
    operator<(guarded_iterator<RandomAccessIterator, Comparator>& bi1,
!             guarded_iterator<RandomAccessIterator, Comparator>& bi2);
  
  template<typename RandomAccessIterator, typename Comparator>
    inline bool
    operator<=(guarded_iterator<RandomAccessIterator, Comparator>& bi1,
! 	     guarded_iterator<RandomAccessIterator, Comparator>& bi2);
  
!   /** @brief Iterator wrapper supporting an implicit supremum at the end
!       of the sequence, dominating all comparisons.
!       *  Deriving from RandomAccessIterator is not possible since
!       *  RandomAccessIterator need not be a class.
!       */
  template<typename RandomAccessIterator, typename Comparator>
    class guarded_iterator
    {
--- 58,91 ----
  /** @brief Length of a sequence described by a pair of iterators. */
  #define _GLIBCXX_PARALLEL_LENGTH(s) ((s).second - (s).first)
  
  namespace __gnu_parallel
  {
+ 
+ // Announce guarded and unguarded iterator.
+ 
  template<typename RandomAccessIterator, typename Comparator>
    class guarded_iterator;
  
+ // Making the arguments const references seems to dangerous,
+ // the user-defined comparator might not be const.
  template<typename RandomAccessIterator, typename Comparator>
    inline bool
    operator<(guarded_iterator<RandomAccessIterator, Comparator>& bi1,
!              guarded_iterator<RandomAccessIterator, Comparator>& bi2);
  
  template<typename RandomAccessIterator, typename Comparator>
    inline bool
    operator<=(guarded_iterator<RandomAccessIterator, Comparator>& bi1,
!               guarded_iterator<RandomAccessIterator, Comparator>& bi2);
  
! /** @brief Iterator wrapper supporting an implicit supremum at the end
!  *         of the sequence, dominating all comparisons.
!  *
!  * The implicit supremum comes with a performance cost.
!  *
!  * Deriving from RandomAccessIterator is not possible since
!  * RandomAccessIterator need not be a class.
!  */
  template<typename RandomAccessIterator, typename Comparator>
    class guarded_iterator
    {
*************** template<typename RandomAccessIterator, 
*** 100,106 ****
      *  @param comp Comparator provided for associated overloaded
      *  compare operators. */
      guarded_iterator(RandomAccessIterator begin,
! 		     RandomAccessIterator end, Comparator& comp)
      : current(begin), end(end), comp(comp)
      { }
  
--- 106,112 ----
      *  @param comp Comparator provided for associated overloaded
      *  compare operators. */
      guarded_iterator(RandomAccessIterator begin,
!                      RandomAccessIterator end, Comparator& comp)
      : current(begin), end(end), comp(comp)
      { }
  
*************** template<typename RandomAccessIterator, 
*** 115,121 ****
  
      /** @brief Dereference operator.
      *  @return Referenced element. */
!     typename std::iterator_traits<RandomAccessIterator>::value_type
      operator*()
      { return *current; }
  
--- 121,127 ----
  
      /** @brief Dereference operator.
      *  @return Referenced element. */
!     typename std::iterator_traits<RandomAccessIterator>::value_type&
      operator*()
      { return *current; }
  
*************** template<typename RandomAccessIterator, 
*** 158,164 ****
  template<typename RandomAccessIterator, typename Comparator>
    inline bool
    operator<=(guarded_iterator<RandomAccessIterator, Comparator>& bi1,
! 	     guarded_iterator<RandomAccessIterator, Comparator>& bi2)
    {
      if (bi2.current == bi2.end)	//bi1 is sup
        return bi1.current != bi1.end;	//bi2 is not sup
--- 164,170 ----
  template<typename RandomAccessIterator, typename Comparator>
    inline bool
    operator<=(guarded_iterator<RandomAccessIterator, Comparator>& bi1,
!                guarded_iterator<RandomAccessIterator, Comparator>& bi2)
    {
      if (bi2.current == bi2.end)	//bi1 is sup
        return bi1.current != bi1.end;	//bi2 is not sup
*************** template<typename RandomAccessIterator, 
*** 185,191 ****
    {
    private:
      /** @brief Current iterator position. */
!     RandomAccessIterator& current;
      /** @brief Comparator. */
      mutable Comparator& comp;
  
--- 191,197 ----
    {
    private:
      /** @brief Current iterator position. */
!     RandomAccessIterator current;
      /** @brief Comparator. */
      mutable Comparator& comp;
  
*************** template<typename RandomAccessIterator, 
*** 195,201 ****
      *  @param end Unused, only for compatibility.
      *  @param comp Unused, only for compatibility. */
      unguarded_iterator(RandomAccessIterator begin,
! 		       RandomAccessIterator end, Comparator& comp)
      : current(begin), comp(comp)
      { }
  
--- 201,207 ----
      *  @param end Unused, only for compatibility.
      *  @param comp Unused, only for compatibility. */
      unguarded_iterator(RandomAccessIterator begin,
!                        RandomAccessIterator end, Comparator& comp)
      : current(begin), comp(comp)
      { }
  
*************** template<typename RandomAccessIterator, 
*** 210,216 ****
  
      /** @brief Dereference operator.
      *  @return Referenced element. */
!     typename std::iterator_traits<RandomAccessIterator>::value_type
      operator*()
      { return *current; }
  
--- 216,222 ----
  
      /** @brief Dereference operator.
      *  @return Referenced element. */
!     typename std::iterator_traits<RandomAccessIterator>::value_type&
      operator*()
      { return *current; }
  
*************** template<typename RandomAccessIterator, 
*** 256,414 ****
      return !(bi1.comp)(*bi2, *bi1);
    }
  
- /** Prepare a set of sequences to be merged without a (end) guard
-  *  @param seqs_begin
-  *  @param seqs_end
-  *  @param comp
-  *  @param min_sequence
-  *  @param stable
-  *  @pre (seqs_end - seqs_begin > 0) */
- template<typename RandomAccessIteratorIterator, typename Comparator>
-   typename std::iterator_traits<
-       typename std::iterator_traits<RandomAccessIteratorIterator>::value_type
-       ::first_type>::difference_type
-   prepare_unguarded(RandomAccessIteratorIterator seqs_begin,
-                     RandomAccessIteratorIterator seqs_end, Comparator comp,
-                     int& min_sequence, bool stable)
-   {
-     _GLIBCXX_CALL(seqs_end - seqs_begin)
- 
-     typedef typename std::iterator_traits<RandomAccessIteratorIterator>
-         ::value_type::first_type
-       RandomAccessIterator1;
-     typedef typename std::iterator_traits<RandomAccessIterator1>::value_type
-       value_type;
-     typedef typename std::iterator_traits<RandomAccessIterator1>
-       ::difference_type
-       difference_type;
- 
-     if ((*seqs_begin).first == (*seqs_begin).second)
-       {
-         // Empty sequence found, it's the first one.
-         min_sequence = 0;
-         return -1;
-       }
- 
-     // Last element in sequence.
-     value_type min = *((*seqs_begin).second - 1);
-     min_sequence = 0;
-     for (RandomAccessIteratorIterator s = seqs_begin + 1; s != seqs_end; ++s)
-       {
-         if ((*s).first == (*s).second)
-           {
-             // Empty sequence found.
-             min_sequence = static_cast<int>(s - seqs_begin);
-             return -1;
-           }
- 
-         // Last element in sequence.
-         const value_type& v = *((*s).second - 1);
-         if (comp(v, min))	//strictly smaller
-           {
-             min = v;
-             min_sequence = static_cast<int>(s - seqs_begin);
-           }
-       }
- 
-     difference_type overhang_size = 0;
- 
-     int s = 0;
-     for (s = 0; s <= min_sequence; ++s)
-       {
-         RandomAccessIterator1 split;
-         if (stable)
-           split = std::upper_bound(seqs_begin[s].first, seqs_begin[s].second,
-                                   min, comp);
-         else
-           split = std::lower_bound(seqs_begin[s].first, seqs_begin[s].second,
-                                   min, comp);
- 
-         overhang_size += seqs_begin[s].second - split;
-       }
- 
-     for (; s < (seqs_end - seqs_begin); ++s)
-       {
-         RandomAccessIterator1 split = std::lower_bound(
-             seqs_begin[s].first, seqs_begin[s].second, min, comp);
-         overhang_size += seqs_begin[s].second - split;
-       }
- 
-     // So many elements will be left over afterwards.
-     return overhang_size;
-   }
- 
- /** Prepare a set of sequences to be merged with a (end) guard (sentinel)
-  *  @param seqs_begin
-  *  @param seqs_end
-  *  @param comp */
- template<typename RandomAccessIteratorIterator, typename Comparator>
-   typename std::iterator_traits<typename std::iterator_traits<
-       RandomAccessIteratorIterator>::value_type::first_type>::difference_type
-   prepare_unguarded_sentinel(RandomAccessIteratorIterator seqs_begin,
-                             RandomAccessIteratorIterator seqs_end,
-                             Comparator comp)
-   {
-     _GLIBCXX_CALL(seqs_end - seqs_begin)
- 
-     typedef typename std::iterator_traits<RandomAccessIteratorIterator>
-       ::value_type::first_type
-       RandomAccessIterator1;
-     typedef typename std::iterator_traits<RandomAccessIterator1>
-       ::value_type
-       value_type;
-     typedef typename std::iterator_traits<RandomAccessIterator1>
-       ::difference_type
-       difference_type;
- 
-     // Last element in sequence.
-     value_type* max = NULL;
-     for (RandomAccessIteratorIterator s = seqs_begin; s != seqs_end; ++s)
-       {
-         if ((*s).first == (*s).second)
-           continue;
- 
-         // Last element in sequence.
-         value_type& v = *((*s).second - 1);
- 
-         // Strictly greater.
-         if (!max || comp(*max, v))
-           max = &v;
-       }
- 
-     difference_type overhang_size = 0;
-     for (RandomAccessIteratorIterator s = seqs_begin; s != seqs_end; ++s)
-       {
-         RandomAccessIterator1 split =
-             std::lower_bound((*s).first, (*s).second, *max, comp);
-         overhang_size += (*s).second - split;
- 
-         // Set sentinel.
-         *((*s).second) = *max;
-       }
- 
-     // So many elements will be left over afterwards.
-     return overhang_size;
-   }
- 
  /** @brief Highly efficient 3-way merging procedure.
!  *  @param seqs_begin Begin iterator of iterator pair input sequence.
!  *  @param seqs_end End iterator of iterator pair input sequence.
!  *  @param target Begin iterator out output sequence.
!  *  @param comp Comparator.
!  *  @param length Maximum length to merge.
!  *  @param stable Unused, stable anyway.
!  *  @return End iterator of output sequence. */
  template<template<typename RAI, typename C> class iterator,
  	 typename RandomAccessIteratorIterator,
  	 typename RandomAccessIterator3,
  	 typename _DifferenceTp,
  	 typename Comparator>
    RandomAccessIterator3
!   multiway_merge_3_variant(RandomAccessIteratorIterator seqs_begin,
! 			   RandomAccessIteratorIterator seqs_end,
! 			   RandomAccessIterator3 target,
! 			   Comparator comp, _DifferenceTp length,
! 			   bool stable)
    {
      _GLIBCXX_CALL(length);
  
--- 262,303 ----
      return !(bi1.comp)(*bi2, *bi1);
    }
  
  /** @brief Highly efficient 3-way merging procedure.
!  *
!  * Merging is done with the algorithm implementation described by Peter
!  * Sanders.  Basically, the idea is to minimize the number of necessary
!  * comparison after merging out an element.  The implementation trick
!  * that makes this fast is that the order of the sequences is stored
!  * in the instruction pointer (translated into labels in C++).
!  *
!  * This works well for merging up to 4 sequences.
!  *
!  * Note that making the merging stable does <em>not</em> come at a
!  * performance hit.
!  *
!  * Whether the merging is done guarded or unguarded is selected by the
!  * used iterator class.
!  *
!  * @param seqs_begin Begin iterator of iterator pair input sequence.
!  * @param seqs_end End iterator of iterator pair input sequence.
!  * @param target Begin iterator out output sequence.
!  * @param comp Comparator.
!  * @param length Maximum length to merge, less equal than the
!  * total number of elements available.
!  *
!  * @return End iterator of output sequence.
!  */
  template<template<typename RAI, typename C> class iterator,
  	 typename RandomAccessIteratorIterator,
  	 typename RandomAccessIterator3,
  	 typename _DifferenceTp,
  	 typename Comparator>
    RandomAccessIterator3
!   multiway_merge_3_variant(
!       RandomAccessIteratorIterator seqs_begin,
!       RandomAccessIteratorIterator seqs_end,
!       RandomAccessIterator3 target,
!       Comparator comp, _DifferenceTp length)
    {
      _GLIBCXX_CALL(length);
  
*************** template<template<typename RAI, typename
*** 423,428 ****
--- 312,321 ----
      if (length == 0)
        return target;
  
+ #if _GLIBCXX_ASSERTIONS
+     _DifferenceTp orig_length = length;
+ #endif
+ 
      iterator<RandomAccessIterator1, Comparator>
        seq0(seqs_begin[0].first, seqs_begin[0].second, comp),
        seq1(seqs_begin[1].first, seqs_begin[1].second, comp),
*************** template<template<typename RAI, typename
*** 450,466 ****
          else
            goto s210;
        }
! 
! #define _GLIBCXX_PARALLEL_MERGE_3_CASE(a,b,c,c0,c1)\
      s ## a ## b ## c :                                  \
        *target = *seq ## a;                              \
!     ++target;                                           \
!     --length;                                           \
!     ++seq ## a;                                         \
!     if (length == 0) goto finish;                       \
!     if (seq ## a c0 seq ## b) goto s ## a ## b ## c;    \
!     if (seq ## a c1 seq ## c) goto s ## b ## a ## c;    \
!     goto s ## b ## c ## a;
  
      _GLIBCXX_PARALLEL_MERGE_3_CASE(0, 1, 2, <=, <=);
      _GLIBCXX_PARALLEL_MERGE_3_CASE(1, 2, 0, <=, < );
--- 343,358 ----
          else
            goto s210;
        }
! #define _GLIBCXX_PARALLEL_MERGE_3_CASE(a,b,c,c0,c1)     \
      s ## a ## b ## c :                                  \
        *target = *seq ## a;                              \
!       ++target;                                         \
!       --length;                                         \
!       ++seq ## a;                                       \
!       if (length == 0) goto finish;                     \
!       if (seq ## a c0 seq ## b) goto s ## a ## b ## c;  \
!       if (seq ## a c1 seq ## c) goto s ## b ## a ## c;  \
!       goto s ## b ## c ## a;
  
      _GLIBCXX_PARALLEL_MERGE_3_CASE(0, 1, 2, <=, <=);
      _GLIBCXX_PARALLEL_MERGE_3_CASE(1, 2, 0, <=, < );
*************** template<template<typename RAI, typename
*** 474,479 ****
--- 366,379 ----
    finish:
      ;
  
+ #if _GLIBCXX_ASSERTIONS
+   _GLIBCXX_PARALLEL_ASSERT(
+       ((RandomAccessIterator1)seq0 - seqs_begin[0].first) +
+       ((RandomAccessIterator1)seq1 - seqs_begin[1].first) +
+       ((RandomAccessIterator1)seq2 - seqs_begin[2].first)
+       == orig_length);
+ #endif
+ 
      seqs_begin[0].first = seq0;
      seqs_begin[1].first = seq1;
      seqs_begin[2].first = seq2;
*************** template<template<typename RAI, typename
*** 481,575 ****
      return target;
    }
  
! template<typename RandomAccessIteratorIterator,
! 	 typename RandomAccessIterator3,
! 	 typename _DifferenceTp,
! 	 typename Comparator>
!   RandomAccessIterator3
!   multiway_merge_3_combined(RandomAccessIteratorIterator seqs_begin,
!                             RandomAccessIteratorIterator seqs_end,
!                             RandomAccessIterator3 target,
!                             Comparator comp,
!                             _DifferenceTp length, bool stable)
!   {
!     _GLIBCXX_CALL(length);
! 
!     typedef _DifferenceTp difference_type;
!     typedef typename std::iterator_traits<RandomAccessIteratorIterator>
!       ::value_type::first_type
!       RandomAccessIterator1;
!     typedef typename std::iterator_traits<RandomAccessIterator1>::value_type
!       value_type;
! 
!     int min_seq;
!     RandomAccessIterator3 target_end;
! 
!     // Stable anyway.
!     difference_type overhang =
!         prepare_unguarded(seqs_begin, seqs_end, comp, min_seq, true);
! 
!     difference_type total_length = 0;
!     for (RandomAccessIteratorIterator s = seqs_begin; s != seqs_end; ++s)
!       total_length += _GLIBCXX_PARALLEL_LENGTH(*s);
! 
!     if (overhang != -1)
!       {
!         difference_type unguarded_length =
!             std::min(length, total_length - overhang);
!         target_end = multiway_merge_3_variant<unguarded_iterator>
!           (seqs_begin, seqs_end, target, comp, unguarded_length, stable);
!         overhang = length - unguarded_length;
!       }
!     else
!       {
!         // Empty sequence found.
!         overhang = length;
!         target_end = target;
!       }
! 
! #if _GLIBCXX_ASSERTIONS
!     _GLIBCXX_PARALLEL_ASSERT(target_end == target + length - overhang);
!     _GLIBCXX_PARALLEL_ASSERT(is_sorted(target, target_end, comp));
! #endif
! 
!     switch (min_seq)
!       {
!       case 0:
!         // Iterators will be advanced accordingly.
!         target_end = merge_advance(seqs_begin[1].first, seqs_begin[1].second,
!                                   seqs_begin[2].first, seqs_begin[2].second,
!                                   target_end, overhang, comp);
!         break;
!       case 1:
!         target_end = merge_advance(seqs_begin[0].first, seqs_begin[0].second,
!                                   seqs_begin[2].first, seqs_begin[2].second,
!                                   target_end, overhang, comp);
!         break;
!       case 2:
!         target_end = merge_advance(seqs_begin[0].first, seqs_begin[0].second,
!                                   seqs_begin[1].first, seqs_begin[1].second,
!                                   target_end, overhang, comp);
!         break;
!       default:
!         _GLIBCXX_PARALLEL_ASSERT(false);
!       }
! 
! #if _GLIBCXX_ASSERTIONS
!     _GLIBCXX_PARALLEL_ASSERT(target_end == target + length);
!     _GLIBCXX_PARALLEL_ASSERT(is_sorted(target, target_end, comp));
! #endif
! 
!     return target_end;
!   }
! 
! /** @brief Highly efficient 4-way merging procedure.
!  *  @param seqs_begin Begin iterator of iterator pair input sequence.
!  *  @param seqs_end End iterator of iterator pair input sequence.
!  *  @param target Begin iterator out output sequence.
!  *  @param comp Comparator.
!  *  @param length Maximum length to merge.
!  *  @param stable Unused, stable anyway.
!  *  @return End iterator of output sequence. */
  template<template<typename RAI, typename C> class iterator,
  	 typename RandomAccessIteratorIterator,
  	 typename RandomAccessIterator3,
--- 381,412 ----
      return target;
    }
  
! /**
!  * @brief Highly efficient 4-way merging procedure.
!  *
!  * Merging is done with the algorithm implementation described by Peter
!  * Sanders. Basically, the idea is to minimize the number of necessary
!  * comparison after merging out an element.  The implementation trick
!  * that makes this fast is that the order of the sequences is stored
!  * in the instruction pointer (translated into goto labels in C++).
!  *
!  * This works well for merging up to 4 sequences.
!  *
!  * Note that making the merging stable does <em>not</em> come at a
!  * performance hit.
!  *
!  * Whether the merging is done guarded or unguarded is selected by the
!  * used iterator class.
!  *
!  * @param seqs_begin Begin iterator of iterator pair input sequence.
!  * @param seqs_end End iterator of iterator pair input sequence.
!  * @param target Begin iterator out output sequence.
!  * @param comp Comparator.
!  * @param length Maximum length to merge, less equal than the
!  * total number of elements available.
!  *
!  * @return End iterator of output sequence.
!  */
  template<template<typename RAI, typename C> class iterator,
  	 typename RandomAccessIteratorIterator,
  	 typename RandomAccessIterator3,
*************** template<template<typename RAI, typename
*** 579,585 ****
    multiway_merge_4_variant(RandomAccessIteratorIterator seqs_begin,
                             RandomAccessIteratorIterator seqs_end,
                             RandomAccessIterator3 target,
!                            Comparator comp, _DifferenceTp length, bool stable)
    {
      _GLIBCXX_CALL(length);
      typedef _DifferenceTp difference_type;
--- 416,422 ----
    multiway_merge_4_variant(RandomAccessIteratorIterator seqs_begin,
                             RandomAccessIteratorIterator seqs_end,
                             RandomAccessIterator3 target,
!                            Comparator comp, _DifferenceTp length)
    {
      _GLIBCXX_CALL(length);
      typedef _DifferenceTp difference_type;
*************** template<template<typename RAI, typename
*** 676,955 ****
      return target;
    }
  
- template<typename RandomAccessIteratorIterator,
- 	 typename RandomAccessIterator3,
- 	 typename _DifferenceTp,
- 	 typename Comparator>
-   RandomAccessIterator3
-   multiway_merge_4_combined(RandomAccessIteratorIterator seqs_begin,
-                             RandomAccessIteratorIterator seqs_end,
-                             RandomAccessIterator3 target,
-                             Comparator comp,
-                             _DifferenceTp length, bool stable)
-   {
-     _GLIBCXX_CALL(length);
-     typedef _DifferenceTp difference_type;
- 
-     typedef typename std::iterator_traits<RandomAccessIteratorIterator>
-       ::value_type::first_type
-       RandomAccessIterator1;
-     typedef typename std::iterator_traits<RandomAccessIterator1>::value_type
-       value_type;
- 
-     int min_seq;
-     RandomAccessIterator3 target_end;
- 
-     // Stable anyway.
-     difference_type overhang =
-         prepare_unguarded(seqs_begin, seqs_end, comp, min_seq, true);
- 
-     difference_type total_length = 0;
-     for (RandomAccessIteratorIterator s = seqs_begin; s != seqs_end; ++s)
-       total_length += _GLIBCXX_PARALLEL_LENGTH(*s);
- 
-     if (overhang != -1)
-       {
-         difference_type unguarded_length =
-             std::min(length, total_length - overhang);
-         target_end = multiway_merge_4_variant<unguarded_iterator>
-           (seqs_begin, seqs_end, target, comp, unguarded_length, stable);
-         overhang = length - unguarded_length;
-       }
-     else
-       {
-         // Empty sequence found.
-         overhang = length;
-         target_end = target;
-       }
- 
- #if _GLIBCXX_ASSERTIONS
-     _GLIBCXX_PARALLEL_ASSERT(target_end == target + length - overhang);
-     _GLIBCXX_PARALLEL_ASSERT(is_sorted(target, target_end, comp));
- #endif
- 
-     std::vector<std::pair<RandomAccessIterator1, RandomAccessIterator1> >
-         one_missing(seqs_begin, seqs_end);
-     one_missing.erase(one_missing.begin() + min_seq);	//remove
- 
-     target_end = multiway_merge_3_variant<guarded_iterator>(
-         one_missing.begin(), one_missing.end(),
-         target_end, comp, overhang, stable);
- 
-     // Insert back again.
-     one_missing.insert(one_missing.begin() + min_seq, seqs_begin[min_seq]);
-     // Write back modified iterators.
-     copy(one_missing.begin(), one_missing.end(), seqs_begin);
- 
- #if _GLIBCXX_ASSERTIONS
-     _GLIBCXX_PARALLEL_ASSERT(target_end == target + length);
-     _GLIBCXX_PARALLEL_ASSERT(is_sorted(target, target_end, comp));
- #endif
- 
-     return target_end;
-   }
- 
- /** @brief Basic multi-way merging procedure.
-  *
-  *  The head elements are kept in a sorted array, new heads are
-  *  inserted linearly.
-  *  @param seqs_begin Begin iterator of iterator pair input sequence.
-  *  @param seqs_end End iterator of iterator pair input sequence.
-  *  @param target Begin iterator out output sequence.
-  *  @param comp Comparator.
-  *  @param length Maximum length to merge.
-  *  @param stable Stable merging incurs a performance penalty.
-  *  @return End iterator of output sequence.
-  */
- template<typename RandomAccessIteratorIterator,
- 	 typename RandomAccessIterator3,
- 	 typename _DifferenceTp,
- 	 typename Comparator>
-   RandomAccessIterator3
-   multiway_merge_bubble(RandomAccessIteratorIterator seqs_begin,
-                         RandomAccessIteratorIterator seqs_end,
-                         RandomAccessIterator3 target,
-                         Comparator comp, _DifferenceTp length, bool stable)
-   {
-     _GLIBCXX_CALL(length)
- 
-     typedef _DifferenceTp difference_type;
-     typedef typename std::iterator_traits<RandomAccessIteratorIterator>
-       ::value_type::first_type
-       RandomAccessIterator1;
-     typedef typename std::iterator_traits<RandomAccessIterator1>::value_type
-       value_type;
- 
-     int k = static_cast<int>(seqs_end - seqs_begin);
-     int nrs;  // Number of remaining sequences.
- 
-     // Avoid default constructor.
-     value_type* fe = static_cast<value_type*>(
-       ::operator new(sizeof(value_type) * k));  // Front elements.
-     int* source = new int[k];
-     difference_type total_length = 0;
- 
-     // Write entries into queue.
-     nrs = 0;
-     for (int pi = 0; pi < k; ++pi)
-       {
-         if (seqs_begin[pi].first != seqs_begin[pi].second)
-           {
-             ::new(&(fe[nrs])) value_type(*(seqs_begin[pi].first));
-             source[nrs] = pi;
-             ++nrs;
-             total_length += _GLIBCXX_PARALLEL_LENGTH(seqs_begin[pi]);
-           }
-       }
- 
-     if (stable)
-       {
-         // Bubble sort fe and source by fe.
-         for (int k = 0; k < nrs - 1; ++k)
-           for (int pi = nrs - 1; pi > k; --pi)
-             if (comp(fe[pi], fe[pi - 1]) ||
-                 (!comp(fe[pi - 1], fe[pi]) && source[pi] < source[pi - 1]))
-               {
-                 std::swap(fe[pi - 1], fe[pi]);
-                 std::swap(source[pi - 1], source[pi]);
-               }
-       }
-     else
-       {
-         for (int k = 0; k < nrs - 1; ++k)
-           for (int pi = nrs - 1; pi > k; --pi)
-             if (comp(fe[pi], fe[pi-1]))
-               {
-                 std::swap(fe[pi-1], fe[pi]);
-                 std::swap(source[pi-1], source[pi]);
-               }
-       }
- 
-     // Iterate.
-     if (stable)
-       {
-         int j;
-         while (nrs > 0 && length > 0)
-           {
-             if (source[0] < source[1])
-               {
-                 // fe[0] <= fe[1]
-                 while ((nrs == 1 || !comp(fe[1], fe[0])) && length > 0)
-                   {
-                     *target = fe[0];
-                     ++target;
-                     ++(seqs_begin[source[0]].first);
-                     --length;
-                     if (seqs_begin[source[0]].first
- 			== seqs_begin[source[0]].second)
-                       {
-                         // Move everything to the left.
-                         for (int s = 0; s < nrs - 1; ++s)
-                           {
-                             fe[s] = fe[s + 1];
-                             source[s] = source[s + 1];
-                           }
-                         fe[nrs - 1].~value_type();  //Destruct explicitly.
-                         --nrs;
-                         break;
-                       }
-                     else
-                       fe[0] = *(seqs_begin[source[0]].first);
-                   }
-               }
-             else
-               {
-                 // fe[0] < fe[1]
-                 while ((nrs == 1 || comp(fe[0], fe[1])) && length > 0)
-                   {
-                     *target = fe[0];
-                     ++target;
-                     ++(seqs_begin[source[0]].first);
-                     --length;
-                     if (seqs_begin[source[0]].first
- 			== seqs_begin[source[0]].second)
-                       {
-                         for (int s = 0; s < nrs - 1; ++s)
-                           {
-                             fe[s] = fe[s + 1];
-                             source[s] = source[s + 1];
-                           }
-                         fe[nrs - 1].~value_type();  //Destruct explicitly.
-                         --nrs;
-                         break;
-                       }
-                     else
-                       fe[0] = *(seqs_begin[source[0]].first);
-                   }
-               }
- 
-             // Sink down.
-             j = 1;
-             while ((j < nrs) && (comp(fe[j], fe[j - 1])
- 				 || (!comp(fe[j - 1], fe[j])
- 				     && (source[j] < source[j - 1]))))
-               {
-                 std::swap(fe[j - 1], fe[j]);
-                 std::swap(source[j - 1], source[j]);
-                 ++j;
-               }
-           }
-       }
-     else
-       {
-         int j;
-         while (nrs > 0 && length > 0)
-           {
-             // fe[0] <= fe[1]
-             while (nrs == 1 || (!comp(fe[1], fe[0])) && length > 0)
-               {
-                 *target = fe[0];
-                 ++target;
-                 ++seqs_begin[source[0]].first;
-                 --length;
-                 if (seqs_begin[source[0]].first
- 		    == seqs_begin[source[0]].second)
-                   {
-                     for (int s = 0; s < (nrs - 1); ++s)
-                       {
-                         fe[s] = fe[s + 1];
-                         source[s] = source[s + 1];
-                       }
-                     fe[nrs - 1].~value_type();  //Destruct explicitly.
-                     --nrs;
-                     break;
-                   }
-                 else
-                   fe[0] = *(seqs_begin[source[0]].first);
-               }
- 
-             // Sink down.
-             j = 1;
-             while ((j < nrs) && comp(fe[j], fe[j - 1]))
-               {
-                 std::swap(fe[j - 1], fe[j]);
-                 std::swap(source[j - 1], source[j]);
-                 ++j;
-               }
-           }
-       }
- 
-     ::operator delete(fe);  //Destructors already called.
-     delete[] source;
- 
-     return target;
-   }
- 
  /** @brief Multi-way merging procedure for a high branching factor,
!  * guarded case.
   *
!  *  The head elements are kept in a loser tree.
!  *  @param seqs_begin Begin iterator of iterator pair input sequence.
!  *  @param seqs_end End iterator of iterator pair input sequence.
!  *  @param target Begin iterator out output sequence.
!  *  @param comp Comparator.
!  *  @param length Maximum length to merge.
!  *   @param stable Stable merging incurs a performance penalty.
!  *  @return End iterator of output sequence.
   */
  template<typename LT,
  	 typename RandomAccessIteratorIterator,
--- 513,535 ----
      return target;
    }
  
  /** @brief Multi-way merging procedure for a high branching factor,
!  *         guarded case.
   *
!  * This merging variant uses a LoserTree class as selected by <tt>LT</tt>.
!  *
!  * Stability is selected through the used LoserTree class <tt>LT</tt>.
!  *
!  * At least one non-empty sequence is required.
!  *
!  * @param seqs_begin Begin iterator of iterator pair input sequence.
!  * @param seqs_end End iterator of iterator pair input sequence.
!  * @param target Begin iterator out output sequence.
!  * @param comp Comparator.
!  * @param length Maximum length to merge, less equal than the
!  * total number of elements available.
!  *
!  * @return End iterator of output sequence.
   */
  template<typename LT,
  	 typename RandomAccessIteratorIterator,
*************** template<typename LT,
*** 961,967 ****
                              RandomAccessIteratorIterator seqs_end,
                              RandomAccessIterator3 target,
                              Comparator comp,
!                             _DifferenceTp length, bool stable)
    {
      _GLIBCXX_CALL(length)
  
--- 541,547 ----
                              RandomAccessIteratorIterator seqs_end,
                              RandomAccessIterator3 target,
                              Comparator comp,
!                             _DifferenceTp length)
    {
      _GLIBCXX_CALL(length)
  
*************** template<typename LT,
*** 976,1086 ****
  
      LT lt(k, comp);
  
-     difference_type total_length = 0;
- 
      // Default value for potentially non-default-constructible types.
      value_type* arbitrary_element = NULL;
  
      for (int t = 0; t < k; ++t)
        {
          if(arbitrary_element == NULL
! 	   && _GLIBCXX_PARALLEL_LENGTH(seqs_begin[t]) > 0)
            arbitrary_element = &(*seqs_begin[t].first);
-         total_length += _GLIBCXX_PARALLEL_LENGTH(seqs_begin[t]);
        }
  
-     if(total_length == 0)
-       return target;
- 
      for (int t = 0; t < k; ++t)
        {
!         if (stable)
!           {
!             if (seqs_begin[t].first == seqs_begin[t].second)
!               lt.insert_start_stable(*arbitrary_element, t, true);
!             else
!               lt.insert_start_stable(*seqs_begin[t].first, t, false);
!           }
          else
!           {
!             if (seqs_begin[t].first == seqs_begin[t].second)
!               lt.insert_start(*arbitrary_element, t, true);
!             else
!               lt.insert_start(*seqs_begin[t].first, t, false);
!           }
        }
  
!     if (stable)
!       lt.init_stable();
!     else
!       lt.init();
! 
!     total_length = std::min(total_length, length);
  
      int source;
  
!     if (stable)
!       {
!         for (difference_type i = 0; i < total_length; ++i)
!           {
!             // Take out.
!             source = lt.get_min_source();
! 
!             *(target++) = *(seqs_begin[source].first++);
! 
!             // Feed.
!             if (seqs_begin[source].first == seqs_begin[source].second)
!               lt.delete_min_insert_stable(*arbitrary_element, true);
!             else
!               // Replace from same source.
!               lt.delete_min_insert_stable(*seqs_begin[source].first, false);
! 
!           }
!       }
!     else
        {
!         for (difference_type i = 0; i < total_length; ++i)
!           {
!             //take out
!             source = lt.get_min_source();
  
!             *(target++) = *(seqs_begin[source].first++);
  
!             // Feed.
!             if (seqs_begin[source].first == seqs_begin[source].second)
!               lt.delete_min_insert(*arbitrary_element, true);
!             else
!               // Replace from same source.
!               lt.delete_min_insert(*seqs_begin[source].first, false);
!           }
        }
  
      return target;
    }
  
  /** @brief Multi-way merging procedure for a high branching factor,
!  * unguarded case.
   *
!  *  The head elements are kept in a loser tree.
!  *  @param seqs_begin Begin iterator of iterator pair input sequence.
!  *  @param seqs_end End iterator of iterator pair input sequence.
!  *  @param target Begin iterator out output sequence.
!  *  @param comp Comparator.
!  *  @param length Maximum length to merge.
!  *  @param stable Stable merging incurs a performance penalty.
!  *  @return End iterator of output sequence.
!  *  @pre No input will run out of elements during the merge.
   */
  template<typename LT,
! 	 typename RandomAccessIteratorIterator,
! 	 typename RandomAccessIterator3,
! 	 typename _DifferenceTp, typename Comparator>
    RandomAccessIterator3
!   multiway_merge_loser_tree_unguarded(RandomAccessIteratorIterator seqs_begin,
!                                       RandomAccessIteratorIterator seqs_end,
!                                       RandomAccessIterator3 target,
!                                       Comparator comp,
!                                       _DifferenceTp length, bool stable)
    {
      _GLIBCXX_CALL(length)
      typedef _DifferenceTp difference_type;
--- 556,633 ----
  
      LT lt(k, comp);
  
      // Default value for potentially non-default-constructible types.
      value_type* arbitrary_element = NULL;
  
      for (int t = 0; t < k; ++t)
        {
          if(arbitrary_element == NULL
!             && _GLIBCXX_PARALLEL_LENGTH(seqs_begin[t]) > 0)
            arbitrary_element = &(*seqs_begin[t].first);
        }
  
      for (int t = 0; t < k; ++t)
        {
!         if (seqs_begin[t].first == seqs_begin[t].second)
!           lt.insert_start(*arbitrary_element, t, true);
          else
!           lt.insert_start(*seqs_begin[t].first, t, false);
        }
  
!     lt.init();
  
      int source;
  
!     for (difference_type i = 0; i < length; ++i)
        {
!         //take out
!         source = lt.get_min_source();
  
!         *(target++) = *(seqs_begin[source].first++);
  
!         // Feed.
!         if (seqs_begin[source].first == seqs_begin[source].second)
!           lt.delete_min_insert(*arbitrary_element, true);
!         else
!           // Replace from same source.
!           lt.delete_min_insert(*seqs_begin[source].first, false);
        }
  
      return target;
    }
  
  /** @brief Multi-way merging procedure for a high branching factor,
!  *         unguarded case.
   *
!  * Merging is done using the LoserTree class <tt>LT</tt>.
!  *
!  * Stability is selected by the used LoserTrees.
!  *
!  * @pre No input will run out of elements during the merge.
!  *
!  * @param seqs_begin Begin iterator of iterator pair input sequence.
!  * @param seqs_end End iterator of iterator pair input sequence.
!  * @param target Begin iterator out output sequence.
!  * @param comp Comparator.
!  * @param length Maximum length to merge, less equal than the
!  * total number of elements available.
!  *
!  * @return End iterator of output sequence.
   */
  template<typename LT,
!     typename RandomAccessIteratorIterator,
!     typename RandomAccessIterator3,
!     typename _DifferenceTp, typename Comparator>
    RandomAccessIterator3
!   multiway_merge_loser_tree_unguarded(
!     RandomAccessIteratorIterator seqs_begin,
!     RandomAccessIteratorIterator seqs_end,
!     RandomAccessIterator3 target,
!     const typename std::iterator_traits<typename std::iterator_traits<
!       RandomAccessIteratorIterator>::value_type::first_type>::value_type&
!         sentinel,
!     Comparator comp,
!     _DifferenceTp length)
    {
      _GLIBCXX_CALL(length)
      typedef _DifferenceTp difference_type;
*************** template<typename LT,
*** 1093,1122 ****
  
      int k = seqs_end - seqs_begin;
  
!     LT lt(k, comp);
! 
!     difference_type total_length = 0;
  
      for (int t = 0; t < k; ++t)
        {
  #if _GLIBCXX_ASSERTIONS
          _GLIBCXX_PARALLEL_ASSERT(seqs_begin[t].first != seqs_begin[t].second);
  #endif
!         if (stable)
!           lt.insert_start_stable(*seqs_begin[t].first, t, false);
!         else
!           lt.insert_start(*seqs_begin[t].first, t, false);
! 
!         total_length += _GLIBCXX_PARALLEL_LENGTH(seqs_begin[t]);
        }
  
!     if (stable)
!       lt.init_stable();
!     else
!       lt.init();
! 
!     // Do not go past end.
!     length = std::min(total_length, length);
  
      int source;
  
--- 640,656 ----
  
      int k = seqs_end - seqs_begin;
  
!     LT lt(k, sentinel, comp);
  
      for (int t = 0; t < k; ++t)
        {
  #if _GLIBCXX_ASSERTIONS
          _GLIBCXX_PARALLEL_ASSERT(seqs_begin[t].first != seqs_begin[t].second);
  #endif
!         lt.insert_start(*seqs_begin[t].first, t, false);
        }
  
!     lt.init();
  
      int source;
  
*************** template<typename LT,
*** 1124,1346 ****
      difference_type i = 0;
  #endif
  
!     if (stable)
!       {
!         RandomAccessIterator3 target_end = target + length;
!         while (target < target_end)
!           {
!             // Take out.
!             source = lt.get_min_source();
! 
! #if _GLIBCXX_ASSERTIONS
!             _GLIBCXX_PARALLEL_ASSERT(i == 0
!                 || !comp(*(seqs_begin[source].first), *(target - 1)));
! #endif
! 
!             *(target++) = *(seqs_begin[source].first++);
! 
! #if _GLIBCXX_ASSERTIONS
!             _GLIBCXX_PARALLEL_ASSERT(
!                 (seqs_begin[source].first != seqs_begin[source].second)
!                 || (i == length - 1));
!             ++i;
! #endif
!             // Feed.
!             // Replace from same source.
!             lt.delete_min_insert_stable(*seqs_begin[source].first, false);
! 
!           }
!       }
!     else
        {
!         RandomAccessIterator3 target_end = target + length;
!         while (target < target_end)
!           {
!             // Take out.
!             source = lt.get_min_source();
  
  #if _GLIBCXX_ASSERTIONS
!             if (i > 0 && comp(*(seqs_begin[source].first), *(target - 1)))
!               printf("         %i %i %i\n", length, i, source);
!             _GLIBCXX_PARALLEL_ASSERT(i == 0
!                 || !comp(*(seqs_begin[source].first), *(target - 1)));
  #endif
  
!             *(target++) = *(seqs_begin[source].first++);
  
  #if _GLIBCXX_ASSERTIONS
!             if (!((seqs_begin[source].first != seqs_begin[source].second)
!                 || (i >= length - 1)))
!               printf("         %i %i %i\n", length, i, source);
!             _GLIBCXX_PARALLEL_ASSERT(
!                 (seqs_begin[source].first != seqs_begin[source].second)
!                 || (i >= length - 1));
!             ++i;
  #endif
!             // Feed.
!             // Replace from same source.
!             lt.delete_min_insert(*seqs_begin[source].first, false);
!           }
        }
  
      return target;
    }
  
! template<typename RandomAccessIteratorIterator,
! 	 typename RandomAccessIterator3,
! 	 typename _DifferenceTp,
! 	 typename Comparator>
    RandomAccessIterator3
!   multiway_merge_loser_tree_combined(RandomAccessIteratorIterator seqs_begin,
!                                      RandomAccessIteratorIterator seqs_end,
!                                      RandomAccessIterator3 target,
!                                      Comparator comp,
!                                      _DifferenceTp length, bool stable)
    {
      _GLIBCXX_CALL(length)
  
      typedef _DifferenceTp difference_type;
! 
      typedef typename std::iterator_traits<RandomAccessIteratorIterator>
        ::value_type::first_type
        RandomAccessIterator1;
      typedef typename std::iterator_traits<RandomAccessIterator1>::value_type
        value_type;
  
-     int min_seq;
      RandomAccessIterator3 target_end;
-     difference_type overhang = prepare_unguarded(seqs_begin, seqs_end,
-                                           comp, min_seq, stable);
  
-     difference_type total_length = 0;
      for (RandomAccessIteratorIterator s = seqs_begin; s != seqs_end; ++s)
!       total_length += _GLIBCXX_PARALLEL_LENGTH(*s);
! 
!     if (overhang != -1)
!       {
!         difference_type unguarded_length =
!             std::min(length, total_length - overhang);
!         target_end = multiway_merge_loser_tree_unguarded
!           <typename loser_tree_unguarded_traits<value_type, Comparator>::LT>
!           (seqs_begin, seqs_end, target, comp, unguarded_length, stable);
!         overhang = length - unguarded_length;
!       }
!     else
!       {
!         // Empty sequence found.
!         overhang = length;
!         target_end = target;
!       }
! 
! #if _GLIBCXX_ASSERTIONS
!     _GLIBCXX_PARALLEL_ASSERT(target_end == target + length - overhang);
!     _GLIBCXX_PARALLEL_ASSERT(is_sorted(target, target_end, comp));
! #endif
  
!     target_end = multiway_merge_loser_tree
!       <typename loser_tree_traits<value_type, Comparator>::LT>
!       (seqs_begin, seqs_end, target_end, comp, overhang, stable);
  
  #if _GLIBCXX_ASSERTIONS
      _GLIBCXX_PARALLEL_ASSERT(target_end == target + length);
      _GLIBCXX_PARALLEL_ASSERT(is_sorted(target, target_end, comp));
  #endif
  
      return target_end;
    }
  
! template<typename RandomAccessIteratorIterator,
! 	 typename RandomAccessIterator3,
! 	 typename _DifferenceTp,
! 	 typename Comparator>
!   RandomAccessIterator3
!   multiway_merge_loser_tree_sentinel(RandomAccessIteratorIterator seqs_begin,
!                                      RandomAccessIteratorIterator seqs_end,
! 				     RandomAccessIterator3 target,
! 				     Comparator comp,
! 				     _DifferenceTp length, bool stable)
    {
!     _GLIBCXX_CALL(length)
  
!     typedef _DifferenceTp difference_type;
!     typedef std::iterator_traits<RandomAccessIteratorIterator> traits_type;
      typedef typename std::iterator_traits<RandomAccessIteratorIterator>
        ::value_type::first_type
        RandomAccessIterator1;
      typedef typename std::iterator_traits<RandomAccessIterator1>::value_type
        value_type;
  
!     RandomAccessIterator3 target_end;
!     difference_type overhang =
!         prepare_unguarded_sentinel(seqs_begin, seqs_end, comp);
! 
!     difference_type total_length = 0;
!     for (RandomAccessIteratorIterator s = seqs_begin; s != seqs_end; ++s)
!       {
!         total_length += _GLIBCXX_PARALLEL_LENGTH(*s);
! 
!         // Sentinel spot.
!         ++((*s).second);
!       }
! 
!     difference_type unguarded_length =
!         std::min(length, total_length - overhang);
!     target_end = multiway_merge_loser_tree_unguarded
!       <typename loser_tree_unguarded_traits<value_type, Comparator>::LT>
!       (seqs_begin, seqs_end, target, comp, unguarded_length, stable);
!     overhang = length - unguarded_length;
! 
! #if _GLIBCXX_ASSERTIONS
!     _GLIBCXX_PARALLEL_ASSERT(target_end == target + length - overhang);
!     _GLIBCXX_PARALLEL_ASSERT(is_sorted(target, target_end, comp));
! #endif
! 
!     // Copy rest stable.
!     for (RandomAccessIteratorIterator s = seqs_begin;
!          s != seqs_end && overhang > 0; ++s)
!       {
!         // Restore.
!         --((*s).second);
!         difference_type local_length =
!             std::min<difference_type>(overhang, _GLIBCXX_PARALLEL_LENGTH(*s));
!         target_end = std::copy((*s).first, (*s).first + local_length,
!                                target_end);
!         (*s).first += local_length;
!         overhang -= local_length;
!       }
  
! #if _GLIBCXX_ASSERTIONS
!     _GLIBCXX_PARALLEL_ASSERT(overhang == 0);
!     _GLIBCXX_PARALLEL_ASSERT(target_end == target + length);
!     _GLIBCXX_PARALLEL_ASSERT(is_sorted(target, target_end, comp));
! #endif
  
!     return target_end;
    }
  
  /** @brief Sequential multi-way merging switch.
   *
!  *  The _GLIBCXX_PARALLEL_DECISION if based on the branching factor and
   *  runtime settings.
   *  @param seqs_begin Begin iterator of iterator pair input sequence.
   *  @param seqs_end End iterator of iterator pair input sequence.
   *  @param target Begin iterator out output sequence.
   *  @param comp Comparator.
!  *  @param length Maximum length to merge.
   *  @param stable Stable merging incurs a performance penalty.
   *  @param sentinel The sequences have a sentinel element.
   *  @return End iterator of output sequence. */
! template<typename RandomAccessIteratorIterator,
! 	 typename RandomAccessIterator3,
! 	 typename _DifferenceTp,
! 	 typename Comparator>
    RandomAccessIterator3
!   multiway_merge(RandomAccessIteratorIterator seqs_begin,
!                  RandomAccessIteratorIterator seqs_end,
!                  RandomAccessIterator3 target,
!                  Comparator comp, _DifferenceTp length,
!                  bool stable, bool sentinel,
!                  sequential_tag)
    {
      _GLIBCXX_CALL(length)
  
--- 658,996 ----
      difference_type i = 0;
  #endif
  
!     RandomAccessIterator3 target_end = target + length;
!     while (target < target_end)
        {
!         // Take out.
!         source = lt.get_min_source();
  
  #if _GLIBCXX_ASSERTIONS
!         _GLIBCXX_PARALLEL_ASSERT(0 <= source && source < k);
!         _GLIBCXX_PARALLEL_ASSERT(i == 0
!             || !comp(*(seqs_begin[source].first), *(target - 1)));
  #endif
  
!         // Feed.
!         *(target++) = *(seqs_begin[source].first++);
  
  #if _GLIBCXX_ASSERTIONS
!         ++i;
  #endif
!         // Replace from same source.
!         lt.delete_min_insert(*seqs_begin[source].first, false);
        }
  
      return target;
    }
  
! 
! /** @brief Multi-way merging procedure for a high branching factor,
!  *         requiring sentinels to exist.
!  *
!  * @param stable The value must the same as for the used LoserTrees.
!  * @param UnguardedLoserTree Loser Tree variant to use for the unguarded
!  *   merging.
!  * @param GuardedLoserTree Loser Tree variant to use for the guarded
!  *   merging.
!  *
!  * @param seqs_begin Begin iterator of iterator pair input sequence.
!  * @param seqs_end End iterator of iterator pair input sequence.
!  * @param target Begin iterator out output sequence.
!  * @param comp Comparator.
!  * @param length Maximum length to merge, less equal than the
!  * total number of elements available.
!  *
!  * @return End iterator of output sequence.
!  */
! template<
!     typename UnguardedLoserTree,
!     typename RandomAccessIteratorIterator,
!     typename RandomAccessIterator3,
!     typename _DifferenceTp,
!     typename Comparator>
    RandomAccessIterator3
!   multiway_merge_loser_tree_sentinel(
!     RandomAccessIteratorIterator seqs_begin,
!     RandomAccessIteratorIterator seqs_end,
!     RandomAccessIterator3 target,
!     const typename std::iterator_traits<typename std::iterator_traits<
!       RandomAccessIteratorIterator>::value_type::first_type>::value_type&
!         sentinel,
!     Comparator comp,
!     _DifferenceTp length)
    {
      _GLIBCXX_CALL(length)
  
      typedef _DifferenceTp difference_type;
!     typedef std::iterator_traits<RandomAccessIteratorIterator> traits_type;
      typedef typename std::iterator_traits<RandomAccessIteratorIterator>
        ::value_type::first_type
        RandomAccessIterator1;
      typedef typename std::iterator_traits<RandomAccessIterator1>::value_type
        value_type;
  
      RandomAccessIterator3 target_end;
  
      for (RandomAccessIteratorIterator s = seqs_begin; s != seqs_end; ++s)
!       // Move the sequends end behind the sentinel spots.  This has the
!       // effect that the sentinel appears to be within the sequence. Then,
!       // we can use the unguarded variant if we merge out as many
!       // non-sentinel elements as we have.
!       ++((*s).second);
  
!     target_end = multiway_merge_loser_tree_unguarded
!         <UnguardedLoserTree>
!       (seqs_begin, seqs_end, target, sentinel, comp, length);
  
  #if _GLIBCXX_ASSERTIONS
      _GLIBCXX_PARALLEL_ASSERT(target_end == target + length);
      _GLIBCXX_PARALLEL_ASSERT(is_sorted(target, target_end, comp));
  #endif
  
+     // Restore the sequence ends so the sentinels are not contained in the
+     // sequence any more (see comment in loop above).
+     for (RandomAccessIteratorIterator s = seqs_begin; s != seqs_end; ++s)
+       --((*s).second);
+ 
      return target_end;
    }
  
! /**
!  * @brief Traits for determining whether the loser tree should
!  *   use pointers or copies.
!  *
!  * The field "use_pointer" is used to determine whether to use pointers in
!  * the loser trees or whether to copy the values into the loser tree.
!  *
!  * The default behavior is to use pointers if the data type is 4 times as
!  * big as the pointer to it.
!  *
!  * Specialize for your data type to customize the behavior.
!  *
!  * Example:
!  *
!  *   template<>
!  *   struct loser_tree_traits<int>
!  *   { static const bool use_pointer = false; };
!  *
!  *   template<>
!  *   struct loser_tree_traits<heavyweight_type>
!  *   { static const bool use_pointer = true; };
!  *
!  * @param T type to give the loser tree traits for.
!  */
! template <typename T>
! struct loser_tree_traits
! {
!   /**
!    * @brief True iff to use pointers instead of values in loser trees.
!    *
!    * The default behavior is to use pointers if the data type is four
!    * times as big as the pointer to it.
!    */
!   static const bool use_pointer = (sizeof(T) > 4 * sizeof(T*));
! };
! 
! /**
!  * @brief Switch for 3-way merging with sentinels turned off.
!  *
!  * Note that 3-way merging is always stable!
!  */
! template<
!   bool sentinels /*default == false*/,
!   typename RandomAccessIteratorIterator,
!   typename RandomAccessIterator3,
!   typename _DifferenceTp,
!   typename Comparator>
! struct multiway_merge_3_variant_sentinel_switch
! {
!   RandomAccessIterator3 operator()(
!       RandomAccessIteratorIterator seqs_begin,
!       RandomAccessIteratorIterator seqs_end,
!       RandomAccessIterator3 target,
!       Comparator comp, _DifferenceTp length)
    {
!     return multiway_merge_3_variant<guarded_iterator>(
!         seqs_begin, seqs_end, target, comp, length);
!   }
! };
  
! /**
!  * @brief Switch for 3-way merging with sentinels turned on.
!  *
!  * Note that 3-way merging is always stable!
!  */
! template<
!   typename RandomAccessIteratorIterator,
!   typename RandomAccessIterator3,
!   typename _DifferenceTp,
!   typename Comparator>
! struct multiway_merge_3_variant_sentinel_switch
!     <true, RandomAccessIteratorIterator, RandomAccessIterator3,
!      _DifferenceTp, Comparator>
! {
!   RandomAccessIterator3 operator()(
!       RandomAccessIteratorIterator seqs_begin,
!       RandomAccessIteratorIterator seqs_end,
!       RandomAccessIterator3 target,
!       Comparator comp, _DifferenceTp length)
!   {
!     return multiway_merge_3_variant<unguarded_iterator>(
!         seqs_begin, seqs_end, target, comp, length);
!   }
! };
! 
! /**
!  * @brief Switch for 4-way merging with sentinels turned off.
!  *
!  * Note that 4-way merging is always stable!
!  */
! template<
!   bool sentinels /*default == false*/,
!   typename RandomAccessIteratorIterator,
!   typename RandomAccessIterator3,
!   typename _DifferenceTp,
!   typename Comparator>
! struct multiway_merge_4_variant_sentinel_switch
! {
!   RandomAccessIterator3 operator()(
!       RandomAccessIteratorIterator seqs_begin,
!       RandomAccessIteratorIterator seqs_end,
!       RandomAccessIterator3 target,
!       Comparator comp, _DifferenceTp length)
!   {
!     return multiway_merge_4_variant<guarded_iterator>(
!         seqs_begin, seqs_end, target, comp, length);
!   }
! };
! 
! /**
!  * @brief Switch for 4-way merging with sentinels turned on.
!  *
!  * Note that 4-way merging is always stable!
!  */
! template<
!   typename RandomAccessIteratorIterator,
!   typename RandomAccessIterator3,
!   typename _DifferenceTp,
!   typename Comparator>
! struct multiway_merge_4_variant_sentinel_switch
!     <true, RandomAccessIteratorIterator, RandomAccessIterator3,
!      _DifferenceTp, Comparator>
! {
!   RandomAccessIterator3 operator()(
!       RandomAccessIteratorIterator seqs_begin,
!       RandomAccessIteratorIterator seqs_end,
!       RandomAccessIterator3 target,
!       Comparator comp, _DifferenceTp length)
!   {
!     return multiway_merge_4_variant<unguarded_iterator>(
!         seqs_begin, seqs_end, target, comp, length);
!   }
! };
! 
! /**
!  * @brief Switch for k-way merging with sentinels turned on.
!  */
! template<
!   bool sentinels,
!   bool stable,
!   typename RandomAccessIteratorIterator,
!   typename RandomAccessIterator3,
!   typename _DifferenceTp,
!   typename Comparator>
! struct multiway_merge_k_variant_sentinel_switch
! {
!   RandomAccessIterator3 operator()(
!       RandomAccessIteratorIterator seqs_begin,
!       RandomAccessIteratorIterator seqs_end,
!       RandomAccessIterator3 target,
!       const typename std::iterator_traits<typename std::iterator_traits<
!         RandomAccessIteratorIterator>::value_type::first_type>::value_type&
!           sentinel,
!       Comparator comp, _DifferenceTp length)
!   {
      typedef typename std::iterator_traits<RandomAccessIteratorIterator>
        ::value_type::first_type
        RandomAccessIterator1;
      typedef typename std::iterator_traits<RandomAccessIterator1>::value_type
        value_type;
  
!     return multiway_merge_loser_tree_sentinel<
!         typename __gnu_cxx::__conditional_type<
!             loser_tree_traits<value_type>::use_pointer
!           , LoserTreePointerUnguarded<stable, value_type, Comparator>
!           , LoserTreeUnguarded<stable, value_type, Comparator>
!         >::__type>(seqs_begin, seqs_end, target, sentinel, comp, length);
!   }
! };
  
! /**
!  * @brief Switch for k-way merging with sentinels turned off.
!  */
! template<
!   bool stable,
!   typename RandomAccessIteratorIterator,
!   typename RandomAccessIterator3,
!   typename _DifferenceTp,
!   typename Comparator>
! struct multiway_merge_k_variant_sentinel_switch
!     <false, stable, RandomAccessIteratorIterator, RandomAccessIterator3,
!      _DifferenceTp, Comparator>
! {
!   RandomAccessIterator3 operator()(
!       RandomAccessIteratorIterator seqs_begin,
!       RandomAccessIteratorIterator seqs_end,
!       RandomAccessIterator3 target,
!       const typename std::iterator_traits<typename std::iterator_traits<
!         RandomAccessIteratorIterator>::value_type::first_type>::value_type&
!           sentinel,
!       Comparator comp, _DifferenceTp length)
!   {
!     typedef typename std::iterator_traits<RandomAccessIteratorIterator>
!       ::value_type::first_type
!       RandomAccessIterator1;
!     typedef typename std::iterator_traits<RandomAccessIterator1>::value_type
!       value_type;
  
!     return multiway_merge_loser_tree<
!         typename __gnu_cxx::__conditional_type<
!             loser_tree_traits<value_type>::use_pointer
!           , LoserTreePointer<stable, value_type, Comparator>
!           , LoserTree<stable, value_type, Comparator>
!         >::__type >(seqs_begin, seqs_end, target, comp, length);
    }
+ };
  
  /** @brief Sequential multi-way merging switch.
   *
!  *  The _GLIBCXX_PARALLEL_DECISION is based on the branching factor and
   *  runtime settings.
   *  @param seqs_begin Begin iterator of iterator pair input sequence.
   *  @param seqs_end End iterator of iterator pair input sequence.
   *  @param target Begin iterator out output sequence.
   *  @param comp Comparator.
!  *  @param length Maximum length to merge, possibly larger than the
!  *  number of elements available.
   *  @param stable Stable merging incurs a performance penalty.
   *  @param sentinel The sequences have a sentinel element.
   *  @return End iterator of output sequence. */
! template<
!     bool stable,
!     bool sentinels,
!     typename RandomAccessIteratorIterator,
!     typename RandomAccessIterator3,
!     typename _DifferenceTp,
!     typename Comparator>
    RandomAccessIterator3
!   sequential_multiway_merge(
!     RandomAccessIteratorIterator seqs_begin,
!     RandomAccessIteratorIterator seqs_end,
!     RandomAccessIterator3 target,
!     const typename std::iterator_traits<typename std::iterator_traits<
!       RandomAccessIteratorIterator>::value_type::first_type>::value_type&
!         sentinel,
!     Comparator comp, _DifferenceTp length)
    {
      _GLIBCXX_CALL(length)
  
*************** template<typename RandomAccessIteratorIt
*** 1353,1368 ****
  
  #if _GLIBCXX_ASSERTIONS
      for (RandomAccessIteratorIterator s = seqs_begin; s != seqs_end; ++s)
!       _GLIBCXX_PARALLEL_ASSERT(is_sorted((*s).first, (*s).second, comp));
  #endif
  
!     RandomAccessIterator3 return_target = target;
!     int k = static_cast<int>(seqs_end - seqs_begin);
  
!     _MultiwayMergeAlgorithm mwma = _Settings::get().multiway_merge_algorithm;
  
!     if (!sentinel && mwma == LOSER_TREE_SENTINEL)
!       mwma = LOSER_TREE_COMBINED;
  
      switch (k)
        {
--- 1003,1024 ----
  
  #if _GLIBCXX_ASSERTIONS
      for (RandomAccessIteratorIterator s = seqs_begin; s != seqs_end; ++s)
!       {
!         _GLIBCXX_PARALLEL_ASSERT(is_sorted((*s).first, (*s).second, comp));
!       }
  #endif
  
!     _DifferenceTp total_length = 0;
!     for (RandomAccessIteratorIterator s = seqs_begin; s != seqs_end; ++s)
!       total_length += _GLIBCXX_PARALLEL_LENGTH(*s);
  
!     length = std::min<_DifferenceTp>(length, total_length);
  
!     if(length == 0)
!       return target;
! 
!     RandomAccessIterator3 return_target = target;
!     int k = static_cast<int>(seqs_end - seqs_begin);
  
      switch (k)
        {
*************** template<typename RandomAccessIteratorIt
*** 1382,1494 ****
                                        target, length, comp);
          break;
        case 3:
!         switch (mwma)
!           {
!           case LOSER_TREE_COMBINED:
!             return_target = multiway_merge_3_combined(seqs_begin,
! 						      seqs_end,
! 						      target,
! 						      comp, length,
! 						      stable);
!             break;
!           case LOSER_TREE_SENTINEL:
!             return_target =
! 	      multiway_merge_3_variant<unguarded_iterator>(seqs_begin,
! 							   seqs_end,
! 							   target,
! 							   comp, length,
! 							   stable);
!             break;
!           default:
!             return_target = 
! 	      multiway_merge_3_variant<guarded_iterator>(seqs_begin,
! 							 seqs_end,
! 							 target,
! 							 comp, length,
! 							 stable);
!             break;
!           }
          break;
        case 4:
!         switch (mwma)
!           {
!           case LOSER_TREE_COMBINED:
!             return_target = multiway_merge_4_combined(seqs_begin,
! 						      seqs_end,
! 						      target,
! 						      comp, length, stable);
!             break;
!           case LOSER_TREE_SENTINEL:
!             return_target = 
! 	      multiway_merge_4_variant<unguarded_iterator>(seqs_begin,
! 							   seqs_end,
! 							   target,
! 							   comp, length,
! 							   stable);
!             break;
!           default:
!             return_target = multiway_merge_4_variant<guarded_iterator>(
! 	      seqs_begin,
! 	      seqs_end,
! 	      target,
! 	      comp, length, stable);
!             break;
!           }
          break;
        default:
!         {
!           switch (mwma)
!             {
!             case BUBBLE:
!               return_target = multiway_merge_bubble(seqs_begin,
! 						    seqs_end,
! 						    target,
! 						    comp, length, stable);
!               break;
! #if _GLIBCXX_LOSER_TREE_EXPLICIT
!             case LOSER_TREE_EXPLICIT:
!               return_target = multiway_merge_loser_tree<
! 	      LoserTreeExplicit<value_type, Comparator> >(seqs_begin,
! 							  seqs_end,
! 							  target,
! 							  comp, length,
! 							  stable);
!               break;
! #endif
! #if _GLIBCXX_LOSER_TREE
!             case LOSER_TREE:
!               return_target = multiway_merge_loser_tree<
!                     LoserTree<value_type, Comparator> >(seqs_begin,
! 							seqs_end,
! 							target,
! 							comp, length,
! 							stable);
!               break;
! #endif
! #if _GLIBCXX_LOSER_TREE_COMBINED
!             case LOSER_TREE_COMBINED:
!               return_target = multiway_merge_loser_tree_combined(seqs_begin,
! 								 seqs_end,
! 								 target,
! 								 comp, length,
! 								 stable);
!               break;
! #endif
! #if _GLIBCXX_LOSER_TREE_SENTINEL
!             case LOSER_TREE_SENTINEL:
!               return_target = multiway_merge_loser_tree_sentinel(seqs_begin,
! 								 seqs_end,
! 								 target,
! 								 comp, length,
! 								 stable);
!               break;
! #endif
!             default:
!               // multiway_merge algorithm not implemented.
!               _GLIBCXX_PARALLEL_ASSERT(0);
!               break;
!             }
!         }
        }
  #if _GLIBCXX_ASSERTIONS
      _GLIBCXX_PARALLEL_ASSERT(is_sorted(target, target + length, comp));
--- 1038,1068 ----
                                        target, length, comp);
          break;
        case 3:
!         return_target = multiway_merge_3_variant_sentinel_switch<
!             sentinels
!           , RandomAccessIteratorIterator
!           , RandomAccessIterator3
!           , _DifferenceTp
!           , Comparator>()(seqs_begin, seqs_end, target, comp, length);
          break;
        case 4:
!         return_target = multiway_merge_4_variant_sentinel_switch<
!             sentinels
!           , RandomAccessIteratorIterator
!           , RandomAccessIterator3
!           , _DifferenceTp
!           , Comparator>()(seqs_begin, seqs_end, target, comp, length);
          break;
        default:
!           return_target = multiway_merge_k_variant_sentinel_switch<
!               sentinels
!             , stable
!             , RandomAccessIteratorIterator
!             , RandomAccessIterator3
!             , _DifferenceTp
!             , Comparator>()
!                 (seqs_begin, seqs_end, target, sentinel, comp, length);
!           break;
        }
  #if _GLIBCXX_ASSERTIONS
      _GLIBCXX_PARALLEL_ASSERT(is_sorted(target, target + length, comp));
*************** template<typename RandomAccessIteratorIt
*** 1497,1555 ****
      return return_target;
    }
  
  /** @brief Parallel multi-way merge routine.
   *
!  *  The _GLIBCXX_PARALLEL_DECISION if based on the branching factor
!  *  and runtime settings.
!  *  @param seqs_begin Begin iterator of iterator pair input sequence.
!  *  @param seqs_end End iterator of iterator pair input sequence.
!  *  @param target Begin iterator out output sequence.
!  *  @param comp Comparator.
!  *  @param length Maximum length to merge.
!  *  @param stable Stable merging incurs a performance penalty.
!  *  @param sentinel Ignored.
!  *  @return End iterator of output sequence.
   */
! template<typename RandomAccessIteratorIterator,
! 	 typename RandomAccessIterator3,
! 	 typename _DifferenceTp,
! 	 typename Comparator>
    RandomAccessIterator3
    parallel_multiway_merge(RandomAccessIteratorIterator seqs_begin,
                            RandomAccessIteratorIterator seqs_end,
!                            RandomAccessIterator3 target,
!                            Comparator comp,
!                            _DifferenceTp length, bool stable, bool sentinel)
      {
        _GLIBCXX_CALL(length)
  
        typedef _DifferenceTp difference_type;
        typedef typename std::iterator_traits<RandomAccessIteratorIterator>
          ::value_type::first_type
          RandomAccessIterator1;
!       typedef typename std::iterator_traits<RandomAccessIterator1>::value_type
!         value_type;
! 
!       // k sequences.
!       int k = static_cast<int>(seqs_end - seqs_begin);
  
        difference_type total_length = 0;
        for (RandomAccessIteratorIterator raii = seqs_begin;
             raii != seqs_end; ++raii)
!         total_length += _GLIBCXX_PARALLEL_LENGTH(*raii);
  
        _GLIBCXX_CALL(total_length)
  
        if (total_length == 0 || k == 0)
          return target;
! 
!       bool tight = (total_length == length);
  
        std::vector<std::pair<difference_type, difference_type> >* pieces;
  
!       thread_index_t num_threads = static_cast<thread_index_t>(
! 	std::min<difference_type>(get_max_threads(), total_length));
!       const _Settings& __s = _Settings::get();
  
  #     pragma omp parallel num_threads (num_threads)
          {
--- 1071,1354 ----
      return return_target;
    }
  
+ /**
+  * @brief Stable sorting functor.
+  *
+  * Used to reduce code instanciation in multiway_merge_sampling_splitting.
+  */
+ template<bool stable, class RandomAccessIterator, class StrictWeakOrdering>
+ struct sampling_sorter
+ {
+   void operator()(RandomAccessIterator first, RandomAccessIterator last,
+                   StrictWeakOrdering comp)
+   { __gnu_sequential::stable_sort(first, last, comp); }
+ };
+ 
+ /**
+  * @brief Non-stable sorting functor.
+  *
+  * Used to reduce code instantiation in multiway_merge_sampling_splitting.
+  */
+ template<class RandomAccessIterator, class StrictWeakOrdering>
+ struct sampling_sorter<false, RandomAccessIterator, StrictWeakOrdering>
+ {
+   void operator()(RandomAccessIterator first, RandomAccessIterator last,
+                   StrictWeakOrdering comp)
+   { __gnu_sequential::sort(first, last, comp); }
+ };
+ 
+ /**
+  * @brief Sampling based splitting for parallel multiway-merge routine.
+  */
+ template<
+     bool stable
+   , typename RandomAccessIteratorIterator
+   , typename Comparator
+   , typename difference_type>
+ void multiway_merge_sampling_splitting(
+     RandomAccessIteratorIterator seqs_begin,
+     RandomAccessIteratorIterator seqs_end,
+     Comparator comp, difference_type length,
+     difference_type total_length,
+     std::vector<std::pair<difference_type, difference_type> > *pieces)
+ {
+   typedef typename std::iterator_traits<RandomAccessIteratorIterator>
+     ::value_type::first_type
+     RandomAccessIterator1;
+   typedef typename std::iterator_traits<RandomAccessIterator1>::value_type
+     value_type;
+ 
+   // k sequences.
+   int k = static_cast<int>(seqs_end - seqs_begin);
+ 
+   int num_threads = omp_get_num_threads();
+ 
+   difference_type num_samples =
+       __gnu_parallel::_Settings::get().merge_oversampling * num_threads;
+ 
+   value_type* samples = static_cast<value_type*>(
+     ::operator new(sizeof(value_type) * k * num_samples));
+   // Sample.
+   for (int s = 0; s < k; ++s)
+     for (difference_type i = 0; i < num_samples; ++i)
+       {
+         difference_type sample_index =
+             static_cast<difference_type>(
+                 _GLIBCXX_PARALLEL_LENGTH(seqs_begin[s])
+                     * (double(i + 1) / (num_samples + 1))
+                     * (double(length) / total_length));
+         new(&(samples[s * num_samples + i]))
+             value_type(seqs_begin[s].first[sample_index]);
+       }
+ 
+   // Sort stable or non-stable, depending on value of template parameter
+   // "stable".
+   sampling_sorter<stable, value_type*, Comparator>()(
+       samples, samples + (num_samples * k), comp);
+ 
+   for (int slab = 0; slab < num_threads; ++slab)
+     // For each slab / processor.
+     for (int seq = 0; seq < k; ++seq)
+       {
+         // For each sequence.
+         if (slab > 0)
+           pieces[slab][seq].first =
+               std::upper_bound(
+                 seqs_begin[seq].first,
+                 seqs_begin[seq].second,
+                 samples[num_samples * k * slab / num_threads],
+                   comp)
+               - seqs_begin[seq].first;
+         else
+           // Absolute beginning.
+           pieces[slab][seq].first = 0;
+         if ((slab + 1) < num_threads)
+           pieces[slab][seq].second =
+               std::upper_bound(
+                   seqs_begin[seq].first,
+                   seqs_begin[seq].second,
+                   samples[num_samples * k * (slab + 1) /
+                       num_threads], comp)
+               - seqs_begin[seq].first;
+         else
+             // Absolute end.
+           pieces[slab][seq].second = _GLIBCXX_PARALLEL_LENGTH(seqs_begin[seq]);
+       }
+     ::operator delete(samples);
+ }
+ 
+ /**
+  * @brief Exact splitting for parallel multiway-merge routine.
+  *
+  * None of the passed sequences may be empty.
+  */
+ template<
+     bool stable
+   , typename RandomAccessIteratorIterator
+   , typename Comparator
+   , typename difference_type>
+ void multiway_merge_exact_splitting(
+     RandomAccessIteratorIterator seqs_begin,
+     RandomAccessIteratorIterator seqs_end,
+     Comparator comp,
+     difference_type length,
+     difference_type total_length,
+     std::vector<std::pair<difference_type, difference_type> > *pieces)
+ {
+   typedef typename std::iterator_traits<RandomAccessIteratorIterator>
+     ::value_type::first_type
+     RandomAccessIterator1;
+ 
+   const bool tight = (total_length == length);
+ 
+   // k sequences.
+   const int k = static_cast<int>(seqs_end - seqs_begin);
+ 
+   const int num_threads = omp_get_num_threads();
+ 
+   // (Settings::multiway_merge_splitting == __gnu_parallel::_Settings::EXACT).
+   std::vector<RandomAccessIterator1>* offsets =
+       new std::vector<RandomAccessIterator1>[num_threads];
+   std::vector<
+       std::pair<RandomAccessIterator1, RandomAccessIterator1>
+       > se(k);
+ 
+   copy(seqs_begin, seqs_end, se.begin());
+ 
+   difference_type* borders =
+       new difference_type[num_threads + 1];
+   equally_split(length, num_threads, borders);
+ 
+   for (int s = 0; s < (num_threads - 1); ++s)
+     {
+       offsets[s].resize(k);
+       multiseq_partition(
+           se.begin(), se.end(), borders[s + 1],
+           offsets[s].begin(), comp);
+ 
+       // Last one also needed and available.
+       if (!tight)
+         {
+           offsets[num_threads - 1].resize(k);
+           multiseq_partition(se.begin(), se.end(),
+                 difference_type(length),
+                 offsets[num_threads - 1].begin(),  comp);
+         }
+     }
+ 
+ 
+   for (int slab = 0; slab < num_threads; ++slab)
+     {
+       // For each slab / processor.
+       for (int seq = 0; seq < k; ++seq)
+         {
+           // For each sequence.
+           if (slab == 0)
+             {
+               // Absolute beginning.
+               pieces[slab][seq].first = 0;
+             }
+           else
+             pieces[slab][seq].first =
+                 pieces[slab - 1][seq].second;
+           if (!tight || slab < (num_threads - 1))
+             pieces[slab][seq].second =
+                 offsets[slab][seq] - seqs_begin[seq].first;
+           else
+             {
+               // slab == num_threads - 1
+               pieces[slab][seq].second =
+                   _GLIBCXX_PARALLEL_LENGTH(seqs_begin[seq]);
+             }
+         }
+     }
+   delete[] offsets;
+ }
+ 
  /** @brief Parallel multi-way merge routine.
   *
!  * The _GLIBCXX_PARALLEL_DECISION is based on the branching factor
!  * and runtime settings.
!  *
!  * Must not be called if the number of sequences is 1.
!  *
!  * @param Splitter functor to split input (either exact or sampling based)
!  *
!  * @param seqs_begin Begin iterator of iterator pair input sequence.
!  * @param seqs_end End iterator of iterator pair input sequence.
!  * @param target Begin iterator out output sequence.
!  * @param comp Comparator.
!  * @param length Maximum length to merge, possibly larger than the
!  * number of elements available.
!  * @param stable Stable merging incurs a performance penalty.
!  * @param sentinel Ignored.
!  * @return End iterator of output sequence.
   */
! template<
!     bool stable,
!     bool sentinels,
!     typename RandomAccessIteratorIterator,
!     typename RandomAccessIterator3,
!     typename _DifferenceTp,
!     typename Splitter,
!     typename Comparator
!     >
    RandomAccessIterator3
    parallel_multiway_merge(RandomAccessIteratorIterator seqs_begin,
                            RandomAccessIteratorIterator seqs_end,
!                           RandomAccessIterator3 target,
!                           Comparator comp,
!                           Splitter splitter,
!                           _DifferenceTp length)
      {
+ #if _GLIBCXX_ASSERTIONS
+       _GLIBCXX_PARALLEL_ASSERT(seqs_end - seqs_begin > 1);
+ #endif
+ 
        _GLIBCXX_CALL(length)
  
        typedef _DifferenceTp difference_type;
        typedef typename std::iterator_traits<RandomAccessIteratorIterator>
          ::value_type::first_type
          RandomAccessIterator1;
!       typedef typename
!         std::iterator_traits<RandomAccessIterator1>::value_type value_type;
  
+       // Leave only non-empty sequences.
+       std::pair<RandomAccessIterator1, RandomAccessIterator1>* ne_seqs =
+         static_cast<std::pair<RandomAccessIterator1, RandomAccessIterator1>*>(
+         ::operator new(
+             sizeof(std::pair<RandomAccessIterator1, RandomAccessIterator1>)
+               * (seqs_end - seqs_begin)));
+       int k = 0;
        difference_type total_length = 0;
        for (RandomAccessIteratorIterator raii = seqs_begin;
             raii != seqs_end; ++raii)
!         {
!           _DifferenceTp seq_length = _GLIBCXX_PARALLEL_LENGTH(*raii);
!           if(seq_length > 0)
!             {
!               total_length += seq_length;
!               //ne_seqs[k] = *raii;
!               new(&(ne_seqs[k++]))
!                 std::pair<RandomAccessIterator1, RandomAccessIterator1>(*raii);
!             }
!         }
  
        _GLIBCXX_CALL(total_length)
  
+       length = std::min<_DifferenceTp>(length, total_length);
+ 
        if (total_length == 0 || k == 0)
+       {
+         ::operator delete(ne_seqs);
          return target;
!       }
  
        std::vector<std::pair<difference_type, difference_type> >* pieces;
  
!       thread_index_t num_threads = static_cast<thread_index_t>
!         (std::min<difference_type>(get_max_threads(), total_length));
  
  #     pragma omp parallel num_threads (num_threads)
          {
*************** template<typename RandomAccessIteratorIt
*** 1562,1687 ****
                for (int s = 0; s < num_threads; ++s)
                  pieces[s].resize(k);
  
!               difference_type num_samples = __s.merge_oversampling 
! 					    * num_threads;
! 
!               if (__s.multiway_merge_splitting == SAMPLING)
!                 {
!                   value_type* samples = static_cast<value_type*>(
!                     ::operator new(sizeof(value_type) * k * num_samples));
!                   // Sample.
!                   for (int s = 0; s < k; ++s)
!                     for (difference_type i = 0; i < num_samples; ++i)
!                       {
!                         difference_type sample_index =
! 			  static_cast<difference_type>(
! 			    _GLIBCXX_PARALLEL_LENGTH(seqs_begin[s])
! 			    * (double(i + 1) / (num_samples + 1))
! 			    * (double(length) / total_length));
!                         ::new(&(samples[s * num_samples + i]))
! 			    value_type(seqs_begin[s].first[sample_index]);
!                       }
! 
!                   if (stable)
!                     __gnu_sequential::stable_sort(samples, samples
! 						  + (num_samples * k), comp);
!                   else
!                     __gnu_sequential::sort(samples, samples
! 					   + (num_samples * k), comp);
! 
!                   for (int slab = 0; slab < num_threads; ++slab)
!                     // For each slab / processor.
!                     for (int seq = 0; seq < k; ++seq)
!                       {
!                         // For each sequence.
!                         if (slab > 0)
!                           pieces[slab][seq].first =
!                               std::upper_bound(seqs_begin[seq].first,
! 					       seqs_begin[seq].second,
! 					       samples[num_samples * k
! 						       * slab / num_threads],
! 					       comp)
! 			    - seqs_begin[seq].first;
!                         else
!                           {
!                             // Absolute beginning.
!                             pieces[slab][seq].first = 0;
!                           }
!                         if ((slab + 1) < num_threads)
!                           pieces[slab][seq].second =
! 			    std::upper_bound(seqs_begin[seq].first,
! 					     seqs_begin[seq].second,
! 					     samples[num_samples * k
! 						     * (slab + 1)
! 						     / num_threads], comp)
! 			    - seqs_begin[seq].first;
!                         else
! 			  pieces[slab][seq].second 
! 			    = _GLIBCXX_PARALLEL_LENGTH(seqs_begin[seq]);
!                       }
! 		  ::operator delete(samples);
!                 }
!               else
!                 {
!                   // (_Settings::multiway_merge_splitting == _Settings::EXACT).
!                   std::vector<RandomAccessIterator1>* offsets =
!                       new std::vector<RandomAccessIterator1>[num_threads];
!                   std::vector<
!                       std::pair<RandomAccessIterator1, RandomAccessIterator1>
!                       > se(k);
! 
!                   copy(seqs_begin, seqs_end, se.begin());
! 
!                   difference_type* borders =
!                       new difference_type[num_threads + 1];
!                   equally_split(length, num_threads, borders);
! 
!                   for (int s = 0; s < (num_threads - 1); ++s)
!                     {
!                       offsets[s].resize(k);
!                       multiseq_partition(
!                           se.begin(), se.end(), borders[s + 1],
!                           offsets[s].begin(), comp);
! 
!                       // Last one also needed and available.
!                       if (!tight)
!                         {
!                           offsets[num_threads - 1].resize(k);
!                           multiseq_partition(se.begin(), se.end(),
! 					     difference_type(length),
! 					     offsets[num_threads - 1].begin(),
! 					     comp);
!                         }
!                     }
! 
  
!                   for (int slab = 0; slab < num_threads; ++slab)
!                     {
!                       // For each slab / processor.
!                       for (int seq = 0; seq < k; ++seq)
!                         {
!                           // For each sequence.
!                           if (slab == 0)
!                             {
!                               // Absolute beginning.
!                               pieces[slab][seq].first = 0;
!                             }
!                           else
!                             pieces[slab][seq].first =
!                                 pieces[slab - 1][seq].second;
!                           if (!tight || slab < (num_threads - 1))
!                             pieces[slab][seq].second =
! 			      offsets[slab][seq] - seqs_begin[seq].first;
!                           else
!                             {
!                               // slab == num_threads - 1
!                               pieces[slab][seq].second =
! 				_GLIBCXX_PARALLEL_LENGTH(seqs_begin[seq]);
!                             }
!                         }
!                     }
!                   delete[] offsets;
!                 }
              } //single
  
            thread_index_t iam = omp_get_thread_num();
--- 1361,1372 ----
                for (int s = 0; s < num_threads; ++s)
                  pieces[s].resize(k);
  
!               difference_type num_samples =
!                   __gnu_parallel::_Settings::get().merge_oversampling *
!                     num_threads;
  
!               splitter(ne_seqs, ne_seqs + k, comp, length, total_length,
!                        pieces);
              } //single
  
            thread_index_t iam = omp_get_thread_num();
*************** template<typename RandomAccessIteratorIt
*** 1691,1741 ****
            for (int c = 0; c < k; ++c)
              target_position += pieces[iam][c].first;
  
!           if (k > 2)
!             {
!               std::pair<RandomAccessIterator1, RandomAccessIterator1>* chunks
!                 = new
!                   std::pair<RandomAccessIterator1, RandomAccessIterator1>[k];
! 
!               difference_type local_length = 0;
!               for (int s = 0; s < k; ++s)
!                 {
!                   chunks[s] = std::make_pair(
! 		    seqs_begin[s].first + pieces[iam][s].first,
! 		    seqs_begin[s].first + pieces[iam][s].second);
!                   local_length += _GLIBCXX_PARALLEL_LENGTH(chunks[s]);
!                 }
! 
!               multiway_merge(
!                     chunks, chunks + k, target + target_position, comp,
!                     std::min(local_length, length - target_position),
!                     stable, false, sequential_tag());
  
!               delete[] chunks;
!             }
!           else if (k == 2)
              {
!               RandomAccessIterator1
!                   begin0 = seqs_begin[0].first + pieces[iam][0].first,
!                   begin1 = seqs_begin[1].first + pieces[iam][1].first;
!               merge_advance(begin0,
! 			    seqs_begin[0].first + pieces[iam][0].second,
! 			    begin1,
! 			    seqs_begin[1].first + pieces[iam][1].second,
! 			    target + target_position,
! 			    (pieces[iam][0].second - pieces[iam][0].first) +
! 			    (pieces[iam][1].second - pieces[iam][1].first),
! 			    comp);
              }
!         } //parallel
  
  #if _GLIBCXX_ASSERTIONS
        _GLIBCXX_PARALLEL_ASSERT(is_sorted(target, target + length, comp));
  #endif
  
        // Update ends of sequences.
!       for (int s = 0; s < k; ++s)
!         seqs_begin[s].first += pieces[num_threads - 1][s].second;
  
        delete[] pieces;
  
--- 1376,1412 ----
            for (int c = 0; c < k; ++c)
              target_position += pieces[iam][c].first;
  
!           std::pair<RandomAccessIterator1, RandomAccessIterator1>* chunks
!             = new std::pair<RandomAccessIterator1, RandomAccessIterator1>[k];
  
!           for (int s = 0; s < k; ++s)
              {
!               chunks[s] = std::make_pair(
!                 ne_seqs[s].first + pieces[iam][s].first,
!                 ne_seqs[s].first + pieces[iam][s].second);
              }
! 
!           if(length > target_position)
!             sequential_multiway_merge<stable, sentinels>(
!               chunks, chunks + k, target + target_position,
!               *(seqs_begin->second), comp, length - target_position);
! 
!           delete[] chunks;
!         } // parallel
  
  #if _GLIBCXX_ASSERTIONS
        _GLIBCXX_PARALLEL_ASSERT(is_sorted(target, target + length, comp));
  #endif
  
+       k = 0;
        // Update ends of sequences.
!       for (RandomAccessIteratorIterator raii = seqs_begin;
!            raii != seqs_end; ++raii)
!         {
!           _DifferenceTp length = _GLIBCXX_PARALLEL_LENGTH(*raii);
!           if(length > 0)
!             (*raii).first += pieces[num_threads - 1][k++].second;
!         }
  
        delete[] pieces;
  
*************** template<typename RandomAccessIteratorIt
*** 1743,1830 ****
      }
  
  /**
!  *  @brief Multi-way merging front-end.
!  *  @param seqs_begin Begin iterator of iterator pair input sequence.
!  *  @param seqs_end End iterator of iterator pair input sequence.
!  *  @param target Begin iterator out output sequence.
!  *  @param comp Comparator.
!  *  @param length Maximum length to merge.
!  *  @param stable Stable merging incurs a performance penalty.
!  *  @return End iterator of output sequence.
   */
! template<typename RandomAccessIteratorPairIterator,
! 	 typename RandomAccessIterator3,
! 	 typename _DifferenceTp,
! 	 typename Comparator>
!   RandomAccessIterator3
!   multiway_merge(RandomAccessIteratorPairIterator seqs_begin,
!                 RandomAccessIteratorPairIterator seqs_end,
!                 RandomAccessIterator3 target, Comparator comp,
!                 _DifferenceTp length, bool stable)
!   {
      typedef _DifferenceTp difference_type;
      _GLIBCXX_CALL(seqs_end - seqs_begin)
  
      if (seqs_begin == seqs_end)
        return target;
  
!     const _Settings& __s = _Settings::get();
  
!     RandomAccessIterator3 target_end;
!     if (_GLIBCXX_PARALLEL_CONDITION(
!         ((seqs_end - seqs_begin) >= __s.multiway_merge_minimal_k)
!         && ((sequence_index_t)length >= __s.multiway_merge_minimal_n)))
!       target_end = parallel_multiway_merge(seqs_begin, seqs_end,
! 					   target, comp,
! 					  static_cast<difference_type>(length),
! 					   stable, false);
      else
!       target_end = multiway_merge(seqs_begin, seqs_end, target, comp, length,
! 				  stable, false, sequential_tag());
  
!     return target_end;
!   }
  
! /** @brief Multi-way merging front-end.
!  *  @param seqs_begin Begin iterator of iterator pair input sequence.
!  *  @param seqs_end End iterator of iterator pair input sequence.
!  *  @param target Begin iterator out output sequence.
!  *  @param comp Comparator.
!  *  @param length Maximum length to merge.
!  *  @param stable Stable merging incurs a performance penalty.
!  *  @return End iterator of output sequence.
!  *  @pre For each @c i, @c seqs_begin[i].second must be the end
!  *  marker of the sequence, but also reference the one more sentinel
!  *  element. */
! template<typename RandomAccessIteratorPairIterator,
! 	 typename RandomAccessIterator3,
! 	 typename _DifferenceTp,
! 	 typename Comparator>
!   RandomAccessIterator3
!   multiway_merge_sentinel(RandomAccessIteratorPairIterator seqs_begin,
!                           RandomAccessIteratorPairIterator seqs_end,
!                           RandomAccessIterator3 target,
!                           Comparator comp,
!                           _DifferenceTp length,
!                           bool stable)
!   {
      typedef _DifferenceTp difference_type;
  
      if (seqs_begin == seqs_end)
        return target;
  
      _GLIBCXX_CALL(seqs_end - seqs_begin)
  
!     const _Settings& __s = _Settings::get();
!     const bool cond1 = seqs_end - seqs_begin >= __s.multiway_merge_minimal_k;
!     const bool cond2 = sequence_index_t(length) >= __s.multiway_merge_minimal_n;
!     if (_GLIBCXX_PARALLEL_CONDITION(cond1 && cond2))
!       return parallel_multiway_merge(seqs_begin, seqs_end, target, comp, 
! 				     length, stable, true);
      else
!       return multiway_merge(seqs_begin, seqs_end, target, comp, length, stable,
! 			    true, sequential_tag());
!   }
  }
  
  #endif
--- 1414,2016 ----
      }
  
  /**
!  * @brief Multiway Merge Frontend.
!  *
!  * Merge the sequences specified by seqs_begin and seqs_end into
!  * target.  seqs_begin and seqs_end must point to a sequence of
!  * pairs.  These pairs must contain an iterator to the beginning
!  * of a sequence in their first entry and an iterator the end of
!  * the same sequence in their second entry.
!  *
!  * Ties are broken arbitrarily.  See stable_multiway_merge for a variant
!  * that breaks ties by sequence number but is slower.
!  *
!  * The first entries of the pairs (i.e. the begin iterators) will be moved
!  * forward.
!  *
!  * The output sequence has to provide enough space for all elements
!  * that are written to it.
!  *
!  * This function will merge the input sequences:
!  *
!  * - not stable
!  * - parallel, depending on the input size and Settings
!  * - using sampling for splitting
!  * - not using sentinels
!  *
!  * Example:
!  *
!  * <pre>
!  *   int sequences[10][10];
!  *   for (int i = 0; i < 10; ++i)
!  *     for (int j = 0; i < 10; ++j)
!  *       sequences[i][j] = j;
!  *
!  *   int out[33];
!  *   std::vector<std::pair<int*> > seqs;
!  *   for (int i = 0; i < 10; ++i)
!  *     { seqs.push(std::make_pair<int*>(sequences[i], sequences[i] + 10)) }
!  *
!  *   multiway_merge(seqs.begin(), seqs.end(), target, std::less<int>(), 33);
!  * </pre>
!  *
!  * @see stable_multiway_merge
!  *
!  * @pre All input sequences must be sorted.
!  * @pre Target must provide enough space to merge out length elements or
!  *    the number of elements in all sequences, whichever is smaller.
!  *
!  * @post [target, return value) contains merged elements from the
!  *    input sequences.
!  * @post return value - target = min(length, number of elements in all
!  *    sequences).
!  *
!  * @param RandomAccessIteratorPairIterator iterator over sequence
!  *    of pairs of iterators
!  * @param RandomAccessIteratorOut iterator over target sequence
!  * @param _DifferenceTp difference type for the sequence
!  * @param Comparator strict weak ordering type to compare elements
!  *    in sequences
!  *
!  * @param seqs_begin  begin of sequence sequence
!  * @param seqs_end    end of sequence sequence
!  * @param target      target sequence to merge to.
!  * @param comp        strict weak ordering to use for element comparison.
!  * @param length Maximum length to merge, possibly larger than the
!  * number of elements available.
!  *
!  * @return end iterator of output sequence
   */
! // public interface
! template<
!     typename RandomAccessIteratorPairIterator
!   , typename RandomAccessIteratorOut
!   , typename _DifferenceTp
!   , typename Comparator>
! RandomAccessIteratorOut
! multiway_merge(RandomAccessIteratorPairIterator seqs_begin
!     , RandomAccessIteratorPairIterator seqs_end
!     , RandomAccessIteratorOut target
!     , Comparator comp, _DifferenceTp length)
! {
!   typedef _DifferenceTp difference_type;
!   _GLIBCXX_CALL(seqs_end - seqs_begin)
! 
!   // catch special case: no sequences
!   if (seqs_begin == seqs_end)
!     return target;
! 
!   // Execute merge; maybe parallel, depending on the number of merged
!   // elements and the number of sequences and global thresholds in
!   // Settings.
!   if ((seqs_end - seqs_begin > 1) &&
!         _GLIBCXX_PARALLEL_CONDITION(
!         ((seqs_end - seqs_begin) >=
!         __gnu_parallel::_Settings::get().multiway_merge_minimal_k)
!         && ((sequence_index_t)length >=
!         __gnu_parallel::_Settings::get().multiway_merge_minimal_n)))
!     return parallel_multiway_merge
!       </* stable = */ false, /* sentinels = */ false>
!         (seqs_begin, seqs_end, target, comp,
!         multiway_merge_sampling_splitting</* stable = */ false,
!           typename std::iterator_traits<RandomAccessIteratorPairIterator>
!             ::value_type*, Comparator, _DifferenceTp>,
!         static_cast<difference_type>(length));
!   else
!     return sequential_multiway_merge
!       </* stable = */false, /* sentinels = */ false>(
!         seqs_begin, seqs_end,
!         target, *(seqs_begin->second), comp, length);
! }
! 
! // public interface
! template<
!     typename RandomAccessIteratorPairIterator
!   , typename RandomAccessIteratorOut
!   , typename _DifferenceTp
!   , typename Comparator>
! RandomAccessIteratorOut
! multiway_merge(RandomAccessIteratorPairIterator seqs_begin
!     , RandomAccessIteratorPairIterator seqs_end
!     , RandomAccessIteratorOut target
!     , Comparator comp, _DifferenceTp length
!     , __gnu_parallel::sequential_tag)
! {
!   typedef _DifferenceTp difference_type;
!   _GLIBCXX_CALL(seqs_end - seqs_begin)
! 
!   // catch special case: no sequences
!   if (seqs_begin == seqs_end)
!     return target;
! 
!   // Execute multiway merge *sequentially*.
!   return sequential_multiway_merge
!     </* stable = */ false, /* sentinels = */ false>
!       (seqs_begin, seqs_end, target, *(seqs_begin->second), comp, length);
! }
! 
! //public interface
! template<
!     typename RandomAccessIteratorPairIterator
!   , typename RandomAccessIteratorOut
!   , typename _DifferenceTp
!   , typename Comparator>
! RandomAccessIteratorOut
! multiway_merge(RandomAccessIteratorPairIterator seqs_begin
!     , RandomAccessIteratorPairIterator seqs_end
!     , RandomAccessIteratorOut target
!     , Comparator comp, _DifferenceTp length
!     , __gnu_parallel::exact_tag)
! {
      typedef _DifferenceTp difference_type;
      _GLIBCXX_CALL(seqs_end - seqs_begin)
  
+     // catch special case: no sequences
      if (seqs_begin == seqs_end)
        return target;
  
!     // Execute merge; maybe parallel, depending on the number of merged
!     // elements and the number of sequences and global thresholds in
!     // Settings.
!     if ((seqs_end - seqs_begin > 1) &&
!           _GLIBCXX_PARALLEL_CONDITION(
!           ((seqs_end - seqs_begin) >=
!              __gnu_parallel::_Settings::get().multiway_merge_minimal_k)
!           && ((sequence_index_t)length >=
!             __gnu_parallel::_Settings::get().multiway_merge_minimal_n)))
!       return parallel_multiway_merge
!                     </* stable = */ false, /* sentinels = */ false>(
!           seqs_begin, seqs_end,
!           target, comp,
!           multiway_merge_exact_splitting</* stable = */ false,
!             typename std::iterator_traits<RandomAccessIteratorPairIterator>
!               ::value_type*, Comparator, _DifferenceTp>,
!           static_cast<difference_type>(length));
!     else
!       return sequential_multiway_merge
!                       </* stable = */ false, /* sentinels = */ false>(
!           seqs_begin, seqs_end,
!           target, *(seqs_begin->second), comp, length);
! }
  
! // public interface
! template<
!     typename RandomAccessIteratorPairIterator
!   , typename RandomAccessIteratorOut
!   , typename _DifferenceTp
!   , typename Comparator>
! RandomAccessIteratorOut
! stable_multiway_merge(RandomAccessIteratorPairIterator seqs_begin
!     , RandomAccessIteratorPairIterator seqs_end
!     , RandomAccessIteratorOut target
!     , Comparator comp, _DifferenceTp length)
! {
!     typedef _DifferenceTp difference_type;
!     _GLIBCXX_CALL(seqs_end - seqs_begin)
! 
!     // catch special case: no sequences
!     if (seqs_begin == seqs_end)
!       return target;
! 
!     // Execute merge; maybe parallel, depending on the number of merged
!     // elements and the number of sequences and global thresholds in
!     // Settings.
!     if ((seqs_end - seqs_begin > 1) &&
!           _GLIBCXX_PARALLEL_CONDITION(
!           ((seqs_end - seqs_begin) >=
!             __gnu_parallel::_Settings::get().multiway_merge_minimal_k)
!           && ((sequence_index_t)length >=
!             __gnu_parallel::_Settings::get().multiway_merge_minimal_n)))
!       return parallel_multiway_merge
!         </* stable = */ true, /* sentinels = */ false>(
!           seqs_begin, seqs_end,
!           target, comp,
!           multiway_merge_sampling_splitting</* stable = */ true,
!             typename std::iterator_traits<RandomAccessIteratorPairIterator>
!               ::value_type*, Comparator, _DifferenceTp>,
!           static_cast<difference_type>(length));
      else
!       return sequential_multiway_merge
!         </* stable = */ true, /* sentinels = */ false>(
!           seqs_begin, seqs_end,
!           target, *(seqs_begin->second), comp, length);
! }
  
! // public interface
! template<
!     typename RandomAccessIteratorPairIterator
!   , typename RandomAccessIteratorOut
!   , typename _DifferenceTp
!   , typename Comparator>
! RandomAccessIteratorOut
! stable_multiway_merge(RandomAccessIteratorPairIterator seqs_begin
!     , RandomAccessIteratorPairIterator seqs_end
!     , RandomAccessIteratorOut target
!     , Comparator comp, _DifferenceTp length
!     , __gnu_parallel::sequential_tag)
! {
!     typedef _DifferenceTp difference_type;
!     _GLIBCXX_CALL(seqs_end - seqs_begin)
  
!     // catch special case: no sequences
!     if (seqs_begin == seqs_end)
!       return target;
! 
!     // Execute multiway merge *sequentially*.
!     return sequential_multiway_merge
!       </* stable = */ true, /* sentinels = */ false>
!         (seqs_begin, seqs_end, target, *(seqs_begin->second), comp, length);
! }
! 
! // public interface
! template<
!     typename RandomAccessIteratorPairIterator
!   , typename RandomAccessIteratorOut
!   , typename _DifferenceTp
!   , typename Comparator>
! RandomAccessIteratorOut
! stable_multiway_merge(RandomAccessIteratorPairIterator seqs_begin
!     , RandomAccessIteratorPairIterator seqs_end
!     , RandomAccessIteratorOut target
!     , Comparator comp, _DifferenceTp length
!     , __gnu_parallel::exact_tag)
! {
      typedef _DifferenceTp difference_type;
+     _GLIBCXX_CALL(seqs_end - seqs_begin)
  
+     // catch special case: no sequences
      if (seqs_begin == seqs_end)
        return target;
  
+     // Execute merge; maybe parallel, depending on the number of merged
+     // elements and the number of sequences and global thresholds in
+     // Settings.
+     if ((seqs_end - seqs_begin > 1) &&
+           _GLIBCXX_PARALLEL_CONDITION(
+           ((seqs_end - seqs_begin) >=
+             __gnu_parallel::_Settings::get().multiway_merge_minimal_k)
+           && ((sequence_index_t)length >=
+             __gnu_parallel::_Settings::get().multiway_merge_minimal_n)))
+       return parallel_multiway_merge
+         </* stable = */ true, /* sentinels = */ false>(
+           seqs_begin, seqs_end,
+           target, comp, 
+           multiway_merge_exact_splitting
+             </* stable = */ true,
+               typename std::iterator_traits<RandomAccessIteratorPairIterator>
+                 ::value_type*, Comparator, _DifferenceTp>,
+           static_cast<difference_type>(length));
+     else
+       return sequential_multiway_merge</* stable = */ true,
+         /* sentinels = */ false>(
+           seqs_begin, seqs_end,
+           target, *(seqs_begin->second), comp, length);
+ }
+ 
+ /**
+  * @brief Multiway Merge Frontend.
+  *
+  * Merge the sequences specified by seqs_begin and seqs_end into
+  * target.  seqs_begin and seqs_end must point to a sequence of
+  * pairs.  These pairs must contain an iterator to the beginning
+  * of a sequence in their first entry and an iterator the end of
+  * the same sequence in their second entry.
+  *
+  * Ties are broken arbitrarily.  See stable_multiway_merge for a variant
+  * that breaks ties by sequence number but is slower.
+  *
+  * The first entries of the pairs (i.e. the begin iterators) will be moved
+  * forward accordingly.
+  *
+  * The output sequence has to provide enough space for all elements
+  * that are written to it.
+  *
+  * This function will merge the input sequences:
+  *
+  * - not stable
+  * - parallel, depending on the input size and Settings
+  * - using sampling for splitting
+  * - using sentinels
+  *
+  * You have to take care that the element the end iterator points to is
+  * readable and contains a value that is greater than any other non-sentinel
+  * value in all sequences.
+  *
+  * Example:
+  *
+  * <pre>
+  *   int sequences[10][11];
+  *   for (int i = 0; i < 10; ++i)
+  *     for (int j = 0; i < 11; ++j)
+  *       sequences[i][j] = j; // last one is sentinel!
+  *
+  *   int out[33];
+  *   std::vector<std::pair<int*> > seqs;
+  *   for (int i = 0; i < 10; ++i)
+  *     { seqs.push(std::make_pair<int*>(sequences[i], sequences[i] + 10)) }
+  *
+  *   multiway_merge(seqs.begin(), seqs.end(), target, std::less<int>(), 33);
+  * </pre>
+  *
+  * @pre All input sequences must be sorted.
+  * @pre Target must provide enough space to merge out length elements or
+  *    the number of elements in all sequences, whichever is smaller.
+  * @pre For each @c i, @c seqs_begin[i].second must be the end
+  *    marker of the sequence, but also reference the one more sentinel
+  *    element.
+  *
+  * @post [target, return value) contains merged elements from the
+  *    input sequences.
+  * @post return value - target = min(length, number of elements in all
+  *    sequences).
+  *
+  * @see stable_multiway_merge_sentinels
+  *
+  * @param RandomAccessIteratorPairIterator iterator over sequence
+  *    of pairs of iterators
+  * @param RandomAccessIteratorOut iterator over target sequence
+  * @param _DifferenceTp difference type for the sequence
+  * @param Comparator strict weak ordering type to compare elements
+  *    in sequences
+  *
+  * @param seqs_begin  begin of sequence sequence
+  * @param seqs_end    end of sequence sequence
+  * @param target      target sequence to merge to.
+  * @param comp        strict weak ordering to use for element comparison.
+  * @param length Maximum length to merge, possibly larger than the
+  * number of elements available.
+  *
+  * @return end iterator of output sequence
+  */
+ // public interface
+ template<
+     typename RandomAccessIteratorPairIterator
+   , typename RandomAccessIteratorOut
+   , typename _DifferenceTp
+   , typename Comparator>
+ RandomAccessIteratorOut
+ multiway_merge_sentinels(RandomAccessIteratorPairIterator seqs_begin
+     , RandomAccessIteratorPairIterator seqs_end
+     , RandomAccessIteratorOut target
+     , Comparator comp, _DifferenceTp length)
+ {
+     typedef _DifferenceTp difference_type;
      _GLIBCXX_CALL(seqs_end - seqs_begin)
  
!     // catch special case: no sequences
!     if (seqs_begin == seqs_end)
!       return target;
! 
!     // Execute merge; maybe parallel, depending on the number of merged
!     // elements and the number of sequences and global thresholds in
!     // Settings.
!     if ((seqs_end - seqs_begin > 1) &&
!           _GLIBCXX_PARALLEL_CONDITION(
!           ((seqs_end - seqs_begin) >=
!             __gnu_parallel::_Settings::get().multiway_merge_minimal_k)
!           && ((sequence_index_t)length >=
!             __gnu_parallel::_Settings::get().multiway_merge_minimal_n)))
!       return parallel_multiway_merge
!         </* stable = */ false, /* sentinels = */ true>
!           (seqs_begin, seqs_end, target, comp,
!           multiway_merge_sampling_splitting
!             </* stable = */ false,
!               typename std::iterator_traits<RandomAccessIteratorPairIterator>
!                 ::value_type*, Comparator, _DifferenceTp>,
!           static_cast<difference_type>(length));
      else
!       return sequential_multiway_merge
!         </* stable = */false, /* sentinels = */ true>(
!           seqs_begin, seqs_end,
!           target, *(seqs_begin->second), comp, length);
! }
! 
! //public interface
! template<
!     typename RandomAccessIteratorPairIterator
!   , typename RandomAccessIteratorOut
!   , typename _DifferenceTp
!   , typename Comparator>
! RandomAccessIteratorOut
! multiway_merge_sentinels(RandomAccessIteratorPairIterator seqs_begin
!     , RandomAccessIteratorPairIterator seqs_end
!     , RandomAccessIteratorOut target
!     , Comparator comp, _DifferenceTp length
!     , __gnu_parallel::sequential_tag)
! {
!     typedef _DifferenceTp difference_type;
!     _GLIBCXX_CALL(seqs_end - seqs_begin)
! 
!     // catch special case: no sequences
!     if (seqs_begin == seqs_end)
!       return target;
! 
!     // Execute multiway merge *sequentially*.
!     return sequential_multiway_merge
!       </* stable = */ false, /* sentinels = */ true>
!         (seqs_begin, seqs_end, target, *(seqs_begin->second), comp, length);
  }
  
+ // public interface
+ template<
+     typename RandomAccessIteratorPairIterator
+   , typename RandomAccessIteratorOut
+   , typename _DifferenceTp
+   , typename Comparator>
+ RandomAccessIteratorOut
+ multiway_merge_sentinels(RandomAccessIteratorPairIterator seqs_begin
+     , RandomAccessIteratorPairIterator seqs_end
+     , RandomAccessIteratorOut target
+     , Comparator comp, _DifferenceTp length
+     , __gnu_parallel::exact_tag)
+ {
+     typedef _DifferenceTp difference_type;
+     _GLIBCXX_CALL(seqs_end - seqs_begin)
+ 
+     // catch special case: no sequences
+     if (seqs_begin == seqs_end)
+       return target;
+ 
+     // Execute merge; maybe parallel, depending on the number of merged
+     // elements and the number of sequences and global thresholds in
+     // Settings.
+     if ((seqs_end - seqs_begin > 1) &&
+           _GLIBCXX_PARALLEL_CONDITION(
+           ((seqs_end - seqs_begin) >=
+             __gnu_parallel::_Settings::get().multiway_merge_minimal_k)
+           && ((sequence_index_t)length >=
+             __gnu_parallel::_Settings::get().multiway_merge_minimal_n)))
+       return parallel_multiway_merge
+         </* stable = */ false, /* sentinels = */ true>(
+           seqs_begin, seqs_end,
+           target, comp,
+           multiway_merge_exact_splitting
+             </* stable = */ false,
+               typename std::iterator_traits<RandomAccessIteratorPairIterator>
+                 ::value_type*, Comparator, _DifferenceTp>,
+           static_cast<difference_type>(length));
+     else
+       return sequential_multiway_merge
+         </* stable = */ false, /* sentinels = */ true>(
+           seqs_begin, seqs_end,
+           target, *(seqs_begin->second), comp, length);
+ }
+ 
+ // public interface
+ template<
+     typename RandomAccessIteratorPairIterator
+   , typename RandomAccessIteratorOut
+   , typename _DifferenceTp
+   , typename Comparator>
+ RandomAccessIteratorOut
+ stable_multiway_merge_sentinels(RandomAccessIteratorPairIterator seqs_begin
+     , RandomAccessIteratorPairIterator seqs_end
+     , RandomAccessIteratorOut target
+     , Comparator comp, _DifferenceTp length)
+ {
+     typedef _DifferenceTp difference_type;
+     _GLIBCXX_CALL(seqs_end - seqs_begin)
+ 
+     // catch special case: no sequences
+     if (seqs_begin == seqs_end)
+       return target;
+ 
+     // Execute merge; maybe parallel, depending on the number of merged
+     // elements and the number of sequences and global thresholds in
+     // Settings.
+     if ((seqs_end - seqs_begin > 1) &&
+           _GLIBCXX_PARALLEL_CONDITION(
+           ((seqs_end - seqs_begin) >=
+             __gnu_parallel::_Settings::get().multiway_merge_minimal_k)
+           && ((sequence_index_t)length >=
+             __gnu_parallel::_Settings::get().multiway_merge_minimal_n)))
+       return parallel_multiway_merge
+         </* stable = */ true, /* sentinels = */ true>(
+           seqs_begin, seqs_end,
+           target, comp,
+           multiway_merge_sampling_splitting
+             </* stable = */ true,
+               typename std::iterator_traits<RandomAccessIteratorPairIterator>
+                 ::value_type*, Comparator, _DifferenceTp>,
+           static_cast<difference_type>(length));
+     else
+       return sequential_multiway_merge
+         </* stable = */ true, /* sentinels = */ true>(
+           seqs_begin, seqs_end,
+           target, *(seqs_begin->second), comp, length);
+ }
+ 
+ // public interface
+ template<
+     typename RandomAccessIteratorPairIterator
+   , typename RandomAccessIteratorOut
+   , typename _DifferenceTp
+   , typename Comparator>
+ RandomAccessIteratorOut
+ stable_multiway_merge_sentinels(RandomAccessIteratorPairIterator seqs_begin
+     , RandomAccessIteratorPairIterator seqs_end
+     , RandomAccessIteratorOut target
+     , Comparator comp, _DifferenceTp length
+     , __gnu_parallel::sequential_tag)
+ {
+     typedef _DifferenceTp difference_type;
+     _GLIBCXX_CALL(seqs_end - seqs_begin)
+ 
+     // catch special case: no sequences
+     if (seqs_begin == seqs_end)
+       return target;
+ 
+     // Execute multiway merge *sequentially*.
+     return sequential_multiway_merge
+       </* stable = */ true, /* sentinels = */ true>
+         (seqs_begin, seqs_end, target, *(seqs_begin->second), comp, length);
+ }
+ 
+ // public interface
+ template<
+     typename RandomAccessIteratorPairIterator
+   , typename RandomAccessIteratorOut
+   , typename _DifferenceTp
+   , typename Comparator>
+ RandomAccessIteratorOut
+ stable_multiway_merge_sentinels(RandomAccessIteratorPairIterator seqs_begin
+     , RandomAccessIteratorPairIterator seqs_end
+     , RandomAccessIteratorOut target
+     , Comparator comp, _DifferenceTp length
+     , __gnu_parallel::exact_tag)
+ {
+     typedef _DifferenceTp difference_type;
+     _GLIBCXX_CALL(seqs_end - seqs_begin)
+ 
+     // catch special case: no sequences
+     if (seqs_begin == seqs_end)
+       return target;
+ 
+     // Execute merge; maybe parallel, depending on the number of merged
+     // elements and the number of sequences and global thresholds in
+     // Settings.
+     if ((seqs_end - seqs_begin > 1) &&
+           _GLIBCXX_PARALLEL_CONDITION(
+           ((seqs_end - seqs_begin) >=
+           __gnu_parallel::_Settings::get().multiway_merge_minimal_k)
+           && ((sequence_index_t)length >=
+           __gnu_parallel::_Settings::get().multiway_merge_minimal_n)))
+       return parallel_multiway_merge
+         </* stable = */ true, /* sentinels = */ true>(
+           seqs_begin, seqs_end,
+           target, comp, 
+           multiway_merge_exact_splitting
+             </* stable = */ true,
+               typename std::iterator_traits<RandomAccessIteratorPairIterator>
+                 ::value_type*, Comparator, _DifferenceTp>,
+           static_cast<difference_type>(length));
+     else
+       return sequential_multiway_merge
+         </* stable = */ true, /* sentinels = */ true>(
+           seqs_begin, seqs_end,
+           target, *(seqs_begin->second), comp, length);
+ }
+ 
+ }; // namespace __gnu_parallel
+ 
  #endif
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/parallel/multiway_mergesort.h gcc-4.3.1/libstdc++-v3/include/parallel/multiway_mergesort.h
*** gcc-4.3.0/libstdc++-v3/include/parallel/multiway_mergesort.h	Mon Feb 18 00:00:00 2008
--- gcc-4.3.1/libstdc++-v3/include/parallel/multiway_mergesort.h	Wed Apr  9 16:47:00 2008
*************** template<typename RandomAccessIterator>
*** 80,105 ****
      /** @brief Start indices, per thread. */
      difference_type* starts;
  
-     /** @brief Temporary arrays for each thread.
-      *
-      *  Indirection Allows using the temporary storage in different
-      *  ways, without code duplication.
-      *  @see _GLIBCXX_MULTIWAY_MERGESORT_COPY_LAST */
-     value_type** temporaries;
- 
- #if _GLIBCXX_MULTIWAY_MERGESORT_COPY_LAST
-     /** @brief Storage in which to sort. */
-     RandomAccessIterator* sorting_places;
- 
-     /** @brief Storage into which to merge. */
-     value_type** merging_places;
- #else
      /** @brief Storage in which to sort. */
!     value_type** sorting_places;
  
-     /** @brief Storage into which to merge. */
-     RandomAccessIterator* merging_places;
- #endif
      /** @brief Samples. */
      value_type* samples;
  
--- 80,88 ----
      /** @brief Start indices, per thread. */
      difference_type* starts;
  
      /** @brief Storage in which to sort. */
!     value_type** temporary;
  
      /** @brief Samples. */
      value_type* samples;
  
*************** template<typename RandomAccessIterator>
*** 108,116 ****
  
      /** @brief Pieces of data to merge @c [thread][sequence] */
      std::vector<Piece<difference_type> >* pieces;
- 
-     /** @brief Stable sorting desired. */
-     bool stable;
  };
  
  /**
--- 91,96 ----
*************** template<typename RandomAccessIterator>
*** 122,128 ****
  template<typename RandomAccessIterator, typename _DifferenceTp>
    void 
    determine_samples(PMWMSSortingData<RandomAccessIterator>* sd,
!                     _DifferenceTp& num_samples)
    {
      typedef std::iterator_traits<RandomAccessIterator> traits_type;
      typedef typename traits_type::value_type value_type;
--- 102,108 ----
  template<typename RandomAccessIterator, typename _DifferenceTp>
    void 
    determine_samples(PMWMSSortingData<RandomAccessIterator>* sd,
!                     _DifferenceTp num_samples)
    {
      typedef std::iterator_traits<RandomAccessIterator> traits_type;
      typedef typename traits_type::value_type value_type;
*************** template<typename RandomAccessIterator, 
*** 130,137 ****
  
      thread_index_t iam = omp_get_thread_num();
  
-     num_samples = _Settings::get().sort_mwms_oversampling * sd->num_threads - 1;
- 
      difference_type* es = new difference_type[num_samples + 2];
  
      equally_split(sd->starts[iam + 1] - sd->starts[iam], 
--- 110,115 ----
*************** template<typename RandomAccessIterator, 
*** 144,154 ****
      delete[] es;
    }
  
  /** @brief PMWMS code executed by each thread.
    *  @param sd Pointer to algorithm data.
    *  @param comp Comparator.
    */
! template<typename RandomAccessIterator, typename Comparator>
    void 
    parallel_sort_mwms_pu(PMWMSSortingData<RandomAccessIterator>* sd,
                          Comparator& comp)
--- 122,322 ----
      delete[] es;
    }
  
+ /** @brief Split consistently. */
+ template<bool exact, typename RandomAccessIterator,
+           typename Comparator, typename SortingPlacesIterator>
+   struct split_consistently
+   {
+   };
+ 
+ /** @brief Split by exact splitting. */
+ template<typename RandomAccessIterator, typename Comparator,
+           typename SortingPlacesIterator>
+   struct split_consistently
+     <true, RandomAccessIterator, Comparator, SortingPlacesIterator>
+   {
+     void operator()(
+       const thread_index_t iam,
+       PMWMSSortingData<RandomAccessIterator>* sd,
+       Comparator& comp,
+       const typename
+         std::iterator_traits<RandomAccessIterator>::difference_type
+           num_samples)
+       const
+   {
+ #   pragma omp barrier
+ 
+     std::vector<std::pair<SortingPlacesIterator, SortingPlacesIterator> >
+         seqs(sd->num_threads);
+     for (thread_index_t s = 0; s < sd->num_threads; s++)
+       seqs[s] = std::make_pair(sd->temporary[s],
+                                 sd->temporary[s]
+                                     + (sd->starts[s + 1] - sd->starts[s]));
+ 
+     std::vector<SortingPlacesIterator> offsets(sd->num_threads);
+ 
+     // if not last thread
+     if (iam < sd->num_threads - 1)
+       multiseq_partition(seqs.begin(), seqs.end(),
+                           sd->starts[iam + 1], offsets.begin(), comp);
+ 
+     for (int seq = 0; seq < sd->num_threads; seq++)
+       {
+         // for each sequence
+         if (iam < (sd->num_threads - 1))
+           sd->pieces[iam][seq].end = offsets[seq] - seqs[seq].first;
+         else
+           // very end of this sequence
+           sd->pieces[iam][seq].end =
+               sd->starts[seq + 1] - sd->starts[seq];
+       }
+ 
+ #   pragma omp barrier
+ 
+     for (thread_index_t seq = 0; seq < sd->num_threads; seq++)
+       {
+         // For each sequence.
+         if (iam > 0)
+           sd->pieces[iam][seq].begin = sd->pieces[iam - 1][seq].end;
+         else
+           // Absolute beginning.
+           sd->pieces[iam][seq].begin = 0;
+       }
+   }   
+   };
+ 
+ /** @brief Split by sampling. */ 
+ template<typename RandomAccessIterator, typename Comparator,
+           typename SortingPlacesIterator>
+   struct split_consistently<false, RandomAccessIterator, Comparator,
+                              SortingPlacesIterator>
+   {
+     void operator()(
+         const thread_index_t iam,
+         PMWMSSortingData<RandomAccessIterator>* sd,
+         Comparator& comp,
+         const typename
+           std::iterator_traits<RandomAccessIterator>::difference_type
+             num_samples)
+         const
+     {
+       typedef std::iterator_traits<RandomAccessIterator> traits_type;
+       typedef typename traits_type::value_type value_type;
+       typedef typename traits_type::difference_type difference_type;
+ 
+       determine_samples(sd, num_samples);
+ 
+ #     pragma omp barrier
+ 
+ #     pragma omp single
+       __gnu_sequential::sort(sd->samples,
+                              sd->samples + (num_samples * sd->num_threads),
+                              comp);
+ 
+ #     pragma omp barrier
+ 
+       for (thread_index_t s = 0; s < sd->num_threads; ++s)
+         {
+           // For each sequence.
+           if (num_samples * iam > 0)
+             sd->pieces[iam][s].begin =
+                 std::lower_bound(sd->temporary[s],
+                     sd->temporary[s]
+                         + (sd->starts[s + 1] - sd->starts[s]),
+                     sd->samples[num_samples * iam],
+                     comp)
+                 - sd->temporary[s];
+           else
+             // Absolute beginning.
+             sd->pieces[iam][s].begin = 0;
+ 
+           if ((num_samples * (iam + 1)) < (num_samples * sd->num_threads))
+             sd->pieces[iam][s].end =
+                 std::lower_bound(sd->temporary[s],
+                         sd->temporary[s]
+                             + (sd->starts[s + 1] - sd->starts[s]),
+                         sd->samples[num_samples * (iam + 1)],
+                         comp)
+                 - sd->temporary[s];
+           else
+             // Absolute end.
+             sd->pieces[iam][s].end = sd->starts[s + 1] - sd->starts[s];
+         }
+     }
+   };
+   
+ template<bool stable, typename RandomAccessIterator, typename Comparator>
+   struct possibly_stable_sort
+   {
+   };
+ 
+ template<typename RandomAccessIterator, typename Comparator>
+   struct possibly_stable_sort<true, RandomAccessIterator, Comparator>
+   {
+     void operator()(const RandomAccessIterator& begin,
+                      const RandomAccessIterator& end, Comparator& comp) const
+     {
+       __gnu_sequential::stable_sort(begin, end, comp); 
+     }
+   };
+ 
+ template<typename RandomAccessIterator, typename Comparator>
+   struct possibly_stable_sort<false, RandomAccessIterator, Comparator>
+   {
+     void operator()(const RandomAccessIterator begin,
+                      const RandomAccessIterator end, Comparator& comp) const
+     {
+       __gnu_sequential::sort(begin, end, comp); 
+     }
+   };
+ 
+ template<bool stable, typename SeqRandomAccessIterator,
+           typename RandomAccessIterator, typename Comparator,
+           typename DiffType>
+   struct possibly_stable_multiway_merge
+   {
+   };
+ 
+ template<typename SeqRandomAccessIterator, typename RandomAccessIterator,
+           typename Comparator, typename DiffType>
+   struct possibly_stable_multiway_merge
+     <true, SeqRandomAccessIterator, RandomAccessIterator, Comparator,
+     DiffType>
+   {
+     void operator()(const SeqRandomAccessIterator& seqs_begin,
+                       const SeqRandomAccessIterator& seqs_end,
+                       const RandomAccessIterator& target,
+                       Comparator& comp,
+                       DiffType length_am) const
+     {
+       stable_multiway_merge(seqs_begin, seqs_end, target, comp,
+                        length_am, sequential_tag());
+     }
+   };
+ 
+ template<typename SeqRandomAccessIterator, typename RandomAccessIterator,
+           typename Comparator, typename DiffType>
+   struct possibly_stable_multiway_merge
+     <false, SeqRandomAccessIterator, RandomAccessIterator, Comparator,
+     DiffType>
+   {
+     void operator()(const SeqRandomAccessIterator& seqs_begin,
+                       const SeqRandomAccessIterator& seqs_end,
+                       const RandomAccessIterator& target,
+                       Comparator& comp,
+                       DiffType length_am) const
+     {
+       multiway_merge(seqs_begin, seqs_end, target, comp,
+                        length_am, sequential_tag());
+     }
+   };
+ 
  /** @brief PMWMS code executed by each thread.
    *  @param sd Pointer to algorithm data.
    *  @param comp Comparator.
    */
! template<bool stable, bool exact, typename RandomAccessIterator,
!           typename Comparator>
    void 
    parallel_sort_mwms_pu(PMWMSSortingData<RandomAccessIterator>* sd,
                          Comparator& comp)
*************** template<typename RandomAccessIterator, 
*** 162,326 ****
      // Length of this thread's chunk, before merging.
      difference_type length_local = sd->starts[iam + 1] - sd->starts[iam];
  
! #if _GLIBCXX_MULTIWAY_MERGESORT_COPY_LAST
!     typedef RandomAccessIterator SortingPlacesIterator;
  
-     // Sort in input storage.
-     sd->sorting_places[iam] = sd->source + sd->starts[iam];
- #else
      typedef value_type* SortingPlacesIterator;
  
!     // Sort in temporary storage, leave space for sentinel.
!     sd->sorting_places[iam] = sd->temporaries[iam] = 
          static_cast<value_type*>(
          ::operator new(sizeof(value_type) * (length_local + 1)));
  
      // Copy there.
      std::uninitialized_copy(sd->source + sd->starts[iam],
                              sd->source + sd->starts[iam] + length_local,
!                             sd->sorting_places[iam]);
! #endif
! 
!     // Sort locally.
!     if (sd->stable)
!       __gnu_sequential::stable_sort(sd->sorting_places[iam],
!                                     sd->sorting_places[iam] + length_local,
!                                     comp);
!     else
!       __gnu_sequential::sort(sd->sorting_places[iam],
!                              sd->sorting_places[iam] + length_local,
!                              comp);
! 
!     // Invariant: locally sorted subsequence in sd->sorting_places[iam],
!     // sd->sorting_places[iam] + length_local.
!     const _Settings& __s = _Settings::get();
!     if (__s.sort_splitting == SAMPLING)
!       {
!         difference_type num_samples;
!         determine_samples(sd, num_samples);
! 
! #       pragma omp barrier
! 
! #       pragma omp single
!         __gnu_sequential::sort(sd->samples,
!                                sd->samples + (num_samples * sd->num_threads),
!                                comp);
! 
! #       pragma omp barrier
! 
!         for (int s = 0; s < sd->num_threads; ++s)
!           {
!             // For each sequence.
!               if (num_samples * iam > 0)
!                 sd->pieces[iam][s].begin = 
!                     std::lower_bound(sd->sorting_places[s],
!                         sd->sorting_places[s]
!                             + (sd->starts[s + 1] - sd->starts[s]),
!                         sd->samples[num_samples * iam],
!                         comp)
!                     - sd->sorting_places[s];
!             else
!               // Absolute beginning.
!               sd->pieces[iam][s].begin = 0;
! 
!             if ((num_samples * (iam + 1)) < (num_samples * sd->num_threads))
!               sd->pieces[iam][s].end =
!                   std::lower_bound(sd->sorting_places[s],
!                           sd->sorting_places[s]
!                               + (sd->starts[s + 1] - sd->starts[s]),
!                           sd->samples[num_samples * (iam + 1)],
!                           comp)
!                   - sd->sorting_places[s];
!             else
!               // Absolute end.
!               sd->pieces[iam][s].end = sd->starts[s + 1] - sd->starts[s];
!             }
!       }
!     else if (__s.sort_splitting == EXACT)
!       {
! #       pragma omp barrier
! 
!         std::vector<std::pair<SortingPlacesIterator, SortingPlacesIterator> >
!             seqs(sd->num_threads);
!         for (int s = 0; s < sd->num_threads; ++s)
!           seqs[s] = std::make_pair(sd->sorting_places[s],
!                                    sd->sorting_places[s]
!                                        + (sd->starts[s + 1] - sd->starts[s]));
! 
!         std::vector<SortingPlacesIterator> offsets(sd->num_threads);
  
!         // if not last thread
!         if (iam < sd->num_threads - 1)
!           multiseq_partition(seqs.begin(), seqs.end(),
!                              sd->starts[iam + 1], offsets.begin(), comp);
  
!         for (int seq = 0; seq < sd->num_threads; ++seq)
!           {
!             // for each sequence
!             if (iam < (sd->num_threads - 1))
!               sd->pieces[iam][seq].end = offsets[seq] - seqs[seq].first;
!             else
!               // very end of this sequence
!               sd->pieces[iam][seq].end = (sd->starts[seq + 1]
! 					  - sd->starts[seq]);
!           }
  
! #       pragma omp barrier
  
!         for (int seq = 0; seq < sd->num_threads; ++seq)
!           {
!             // For each sequence.
!             if (iam > 0)
!               sd->pieces[iam][seq].begin = sd->pieces[iam - 1][seq].end;
!             else
!               // Absolute beginning.
!               sd->pieces[iam][seq].begin = 0;
!           }
!       }
  
      // Offset from target begin, length after merging.
      difference_type offset = 0, length_am = 0;
!     for (int s = 0; s < sd->num_threads; ++s)
        {
          length_am += sd->pieces[iam][s].end - sd->pieces[iam][s].begin;
          offset += sd->pieces[iam][s].begin;
        }
  
! #if _GLIBCXX_MULTIWAY_MERGESORT_COPY_LAST
!     // Merge to temporary storage, uninitialized creation not possible
!     // since there is no multiway_merge calling the placement new
!     // instead of the assignment operator.
!     // XXX incorrect (de)construction
!     sd->merging_places[iam] = sd->temporaries[iam] =
!         static_cast<value_type*>(::operator new(sizeof(value_type)
! 						* length_am));
! #else
!     // Merge directly to target.
!     sd->merging_places[iam] = sd->source + offset;
! #endif
!     std::vector<std::pair<SortingPlacesIterator, SortingPlacesIterator> >
!         seqs(sd->num_threads);
  
      for (int s = 0; s < sd->num_threads; ++s)
        {
          seqs[s] =
! 	  std::make_pair(sd->sorting_places[s] + sd->pieces[iam][s].begin,
! 			 sd->sorting_places[s] + sd->pieces[iam][s].end);
        }
  
!     multiway_merge(seqs.begin(), seqs.end(), sd->merging_places[iam], comp,
!                    length_am, sd->stable, false, sequential_tag());
  
  #   pragma omp barrier
  
! #if _GLIBCXX_MULTIWAY_MERGESORT_COPY_LAST
!     // Write back.
!     std::copy(sd->merging_places[iam],
!               sd->merging_places[iam] + length_am,
!               sd->source + offset);
! #endif
! 
!     ::operator delete(sd->temporaries[iam]);
    }
  
  /** @brief PMWMS main call.
--- 330,394 ----
      // Length of this thread's chunk, before merging.
      difference_type length_local = sd->starts[iam + 1] - sd->starts[iam];
  
!     // Sort in temporary storage, leave space for sentinel.
  
      typedef value_type* SortingPlacesIterator;
  
!     sd->temporary[iam] =
          static_cast<value_type*>(
          ::operator new(sizeof(value_type) * (length_local + 1)));
  
      // Copy there.
      std::uninitialized_copy(sd->source + sd->starts[iam],
                              sd->source + sd->starts[iam] + length_local,
!                             sd->temporary[iam]);
  
!     possibly_stable_sort<stable, SortingPlacesIterator, Comparator>()
!         (sd->temporary[iam], sd->temporary[iam] + length_local, comp);
  
!     // Invariant: locally sorted subsequence in sd->temporary[iam],
!     // sd->temporary[iam] + length_local.
  
!     // No barrier here: Synchronization is done by the splitting routine.
  
!     difference_type num_samples =
!         _Settings::get().sort_mwms_oversampling * sd->num_threads - 1;
!     split_consistently
!       <exact, RandomAccessIterator, Comparator, SortingPlacesIterator>()
!         (iam, sd, comp, num_samples);
  
      // Offset from target begin, length after merging.
      difference_type offset = 0, length_am = 0;
!     for (thread_index_t s = 0; s < sd->num_threads; s++)
        {
          length_am += sd->pieces[iam][s].end - sd->pieces[iam][s].begin;
          offset += sd->pieces[iam][s].begin;
        }
  
!     typedef std::vector<
!       std::pair<SortingPlacesIterator, SortingPlacesIterator> >
!         seq_vector_type;
!     seq_vector_type seqs(sd->num_threads);
  
      for (int s = 0; s < sd->num_threads; ++s)
        {
          seqs[s] =
!           std::make_pair(sd->temporary[s] + sd->pieces[iam][s].begin,
!         sd->temporary[s] + sd->pieces[iam][s].end);
        }
  
!     possibly_stable_multiway_merge<
!         stable,
!         typename seq_vector_type::iterator,
!         RandomAccessIterator,
!         Comparator, difference_type>()
!           (seqs.begin(), seqs.end(),
!            sd->source + offset, comp,
!            length_am);
  
  #   pragma omp barrier
  
!     ::operator delete(sd->temporary[iam]);
    }
  
  /** @brief PMWMS main call.
*************** template<typename RandomAccessIterator, 
*** 329,349 ****
    *  @param comp Comparator.
    *  @param n Length of sequence.
    *  @param num_threads Number of threads to use.
-   *  @param stable Stable sorting.
    */
! template<typename RandomAccessIterator, typename Comparator>
    void
    parallel_sort_mwms(RandomAccessIterator begin, RandomAccessIterator end,
!                      Comparator comp, typename
! 		     std::iterator_traits<RandomAccessIterator>::
! 		     difference_type n, int num_threads, bool stable)
    {
!     _GLIBCXX_CALL(n)
  
      typedef std::iterator_traits<RandomAccessIterator> traits_type;
      typedef typename traits_type::value_type value_type;
      typedef typename traits_type::difference_type difference_type;
  
      if (n <= 1)
        return;
  
--- 397,418 ----
    *  @param comp Comparator.
    *  @param n Length of sequence.
    *  @param num_threads Number of threads to use.
    */
! template<bool stable, bool exact, typename RandomAccessIterator,
!            typename Comparator>
    void
    parallel_sort_mwms(RandomAccessIterator begin, RandomAccessIterator end,
!                      Comparator comp,
!                      thread_index_t num_threads)
    {
!     _GLIBCXX_CALL(end - begin)
  
      typedef std::iterator_traits<RandomAccessIterator> traits_type;
      typedef typename traits_type::value_type value_type;
      typedef typename traits_type::difference_type difference_type;
  
+     difference_type n = end - begin;
+ 
      if (n <= 1)
        return;
  
*************** template<typename RandomAccessIterator, 
*** 354,360 ****
      // shared variables
      PMWMSSortingData<RandomAccessIterator> sd;
      difference_type* starts;
-     const _Settings& __s = _Settings::get();
  
  #   pragma omp parallel num_threads(num_threads)
        {
--- 423,428 ----
*************** template<typename RandomAccessIterator, 
*** 364,386 ****
            {
              sd.num_threads = num_threads;
              sd.source = begin;
-             sd.temporaries = new value_type*[num_threads];
  
! #if _GLIBCXX_MULTIWAY_MERGESORT_COPY_LAST
!             sd.sorting_places = new RandomAccessIterator[num_threads];
!             sd.merging_places = new value_type*[num_threads];
! #else
!             sd.sorting_places = new value_type*[num_threads];
!             sd.merging_places = new RandomAccessIterator[num_threads];
! #endif
  
!             if (__s.sort_splitting == SAMPLING)
                {
!                 unsigned int size = 
!                     (__s.sort_mwms_oversampling * num_threads - 1)
                          * num_threads;
                  sd.samples = static_cast<value_type*>(
! 		  ::operator new(size * sizeof(value_type)));
                }
              else
                sd.samples = NULL;
--- 432,447 ----
            {
              sd.num_threads = num_threads;
              sd.source = begin;
  
!             sd.temporary = new value_type*[num_threads];
  
!             if (!exact)
                {
!                 difference_type size =
!                     (_Settings::get().sort_mwms_oversampling * num_threads - 1)
                          * num_threads;
                  sd.samples = static_cast<value_type*>(
!                               ::operator new(size * sizeof(value_type)));
                }
              else
                sd.samples = NULL;
*************** template<typename RandomAccessIterator, 
*** 390,396 ****
              for (int s = 0; s < num_threads; ++s)
                sd.pieces[s].resize(num_threads);
              starts = sd.starts = new difference_type[num_threads + 1];
-             sd.stable = stable;
  
              difference_type chunk_length = n / num_threads;
              difference_type split = n % num_threads;
--- 451,456 ----
*************** template<typename RandomAccessIterator, 
*** 401,418 ****
                  pos += (i < split) ? (chunk_length + 1) : chunk_length;
                }
              starts[num_threads] = pos;
!           }
  
          // Now sort in parallel.
!         parallel_sort_mwms_pu(&sd, comp);
        } //parallel
  
      delete[] starts;
!     delete[] sd.temporaries;
!     delete[] sd.sorting_places;
!     delete[] sd.merging_places;
  
!     if (__s.sort_splitting == SAMPLING)
        ::operator delete(sd.samples);
  
      delete[] sd.offsets;
--- 461,476 ----
                  pos += (i < split) ? (chunk_length + 1) : chunk_length;
                }
              starts[num_threads] = pos;
!           } //single
  
          // Now sort in parallel.
!         parallel_sort_mwms_pu<stable, exact>(&sd, comp);
        } //parallel
  
      delete[] starts;
!     delete[] sd.temporary;
  
!     if (!exact)
        ::operator delete(sd.samples);
  
      delete[] sd.offsets;
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/parallel/quicksort.h gcc-4.3.1/libstdc++-v3/include/parallel/quicksort.h
*** gcc-4.3.0/libstdc++-v3/include/parallel/quicksort.h	Mon Feb 18 00:00:00 2008
--- gcc-4.3.1/libstdc++-v3/include/parallel/quicksort.h	Wed May  7 11:17:03 2008
*************** namespace __gnu_parallel
*** 137,143 ****
  				_Settings::get().sort_qs_num_samples_preset,
  				num_threads);
  
! #pragma omp parallel sections
        {
  #pragma omp section
  	parallel_sort_qs_conquer(begin, begin + split,
--- 137,143 ----
  				_Settings::get().sort_qs_num_samples_preset,
  				num_threads);
  
! #pragma omp parallel sections num_threads(2)
        {
  #pragma omp section
  	parallel_sort_qs_conquer(begin, begin + split,
*************** namespace __gnu_parallel
*** 179,187 ****
        if (num_threads > n)
  	num_threads = static_cast<thread_index_t>(n);
  
-       // Hard to avoid.
-       omp_set_num_threads(num_threads);
- 
        parallel_sort_qs_conquer(begin, begin + n, comp, num_threads);
      }
  
--- 179,184 ----
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/parallel/random_shuffle.h gcc-4.3.1/libstdc++-v3/include/parallel/random_shuffle.h
*** gcc-4.3.0/libstdc++-v3/include/parallel/random_shuffle.h	Mon Feb 18 00:00:00 2008
--- gcc-4.3.1/libstdc++-v3/include/parallel/random_shuffle.h	Thu Jun  5 15:45:10 2008
*************** template<typename RandomAccessIterator, 
*** 333,338 ****
--- 333,339 ----
  
  #   pragma omp parallel num_threads(num_threads)
        {
+         thread_index_t num_threads = omp_get_num_threads();
  #       pragma omp single
            {
              pus = new DRSSorterPU<RandomAccessIterator, random_number>
*************** template<typename RandomAccessIterator, 
*** 375,383 ****
                }
              starts[num_threads] = start;
            } //single
!       // Now shuffle in parallel.
!       parallel_random_shuffle_drs_pu(pus);
!     }
  
      delete[] starts;
      delete[] sd.bin_proc;
--- 376,384 ----
                }
              starts[num_threads] = start;
            } //single
!         // Now shuffle in parallel.
!         parallel_random_shuffle_drs_pu(pus);
!       }  // parallel
  
      delete[] starts;
      delete[] sd.bin_proc;
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/parallel/sort.h gcc-4.3.1/libstdc++-v3/include/parallel/sort.h
*** gcc-4.3.0/libstdc++-v3/include/parallel/sort.h	Mon Feb 18 00:00:00 2008
--- gcc-4.3.1/libstdc++-v3/include/parallel/sort.h	Wed Apr  9 16:47:00 2008
*************** namespace __gnu_parallel
*** 71,77 ****
    template<typename RandomAccessIterator, typename Comparator>
      inline void
      parallel_sort(RandomAccessIterator begin, RandomAccessIterator end,
! 		  Comparator comp, bool stable)
      {
        _GLIBCXX_CALL(end - begin)
        typedef std::iterator_traits<RandomAccessIterator> traits_type;
--- 71,77 ----
    template<typename RandomAccessIterator, typename Comparator>
      inline void
      parallel_sort(RandomAccessIterator begin, RandomAccessIterator end,
!                   Comparator comp, bool stable)
      {
        _GLIBCXX_CALL(end - begin)
        typedef std::iterator_traits<RandomAccessIterator> traits_type;
*************** namespace __gnu_parallel
*** 79,103 ****
        typedef typename traits_type::difference_type difference_type;
  
        if (begin != end)
! 	{
! 	  difference_type n = end - begin;
  
! 	  if (false) ;
  #if _GLIBCXX_MERGESORT
! 	  else if (stable || _Settings::get().sort_algorithm == MWMS)
! 	    parallel_sort_mwms(begin, end, comp, n, get_max_threads(), stable);
  #endif
  #if _GLIBCXX_QUICKSORT
! 	  else if (!stable && _Settings::get().sort_algorithm == QS)
! 	    parallel_sort_qs(begin, end, comp, n, get_max_threads());
  #endif
  #if _GLIBCXX_BAL_QUICKSORT
! 	  else if (!stable && _Settings::get().sort_algorithm == QS_BALANCED)
! 	    parallel_sort_qsb(begin, end, comp, n, get_max_threads());
  #endif
! 	  else
! 	    __gnu_sequential::sort(begin, end, comp);
! 	}
      }
  } // end namespace __gnu_parallel
  
--- 79,121 ----
        typedef typename traits_type::difference_type difference_type;
  
        if (begin != end)
!       {
!         difference_type n = end - begin;
  
!         if (false) ;
  #if _GLIBCXX_MERGESORT
!         else if (stable)
!           {
!             if(_Settings::get().sort_splitting == EXACT)
!               parallel_sort_mwms<true, true>
!                 (begin, end, comp, get_max_threads());
!             else
!               parallel_sort_mwms<true, false>
!                 (begin, end, comp, get_max_threads());
!           }
!         else if (_Settings::get().sort_algorithm == MWMS)
!           {
!             if(_Settings::get().sort_splitting == EXACT)
!               parallel_sort_mwms<false, true>
!                 (begin, end, comp, get_max_threads());
!             else
!               parallel_sort_mwms<false, false>
!                 (begin, end, comp, get_max_threads());
!           }
  #endif
  #if _GLIBCXX_QUICKSORT
!         else if (!stable && _Settings::get().sort_algorithm == QS)
!           parallel_sort_qs(begin, end, comp, n, get_max_threads());
  #endif
  #if _GLIBCXX_BAL_QUICKSORT
!         else if (!stable && _Settings::get().sort_algorithm == QS_BALANCED)
!           parallel_sort_qsb(begin, end, comp, n, get_max_threads());
  #endif
!         else if(stable)
!           __gnu_sequential::stable_sort(begin, end, comp);
!         else
!           __gnu_sequential::sort(begin, end, comp);
!       }
      }
  } // end namespace __gnu_parallel
  
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/parallel/tags.h gcc-4.3.1/libstdc++-v3/include/parallel/tags.h
*** gcc-4.3.0/libstdc++-v3/include/parallel/tags.h	Mon Feb 18 00:00:00 2008
--- gcc-4.3.1/libstdc++-v3/include/parallel/tags.h	Wed Apr  9 16:47:00 2008
*************** namespace __gnu_parallel
*** 44,49 ****
--- 44,52 ----
    /** @brief Forces sequential execution at compile time. */
    struct sequential_tag { };
  
+   /** @brief Forces exact splitting in multiway merge at compile time. */
+   struct exact_tag { };
+ 
    /** @brief Recommends parallel execution at compile time. */
    struct parallel_tag { };
  
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/parallel/types.h gcc-4.3.1/libstdc++-v3/include/parallel/types.h
*** gcc-4.3.0/libstdc++-v3/include/parallel/types.h	Mon Feb 18 00:00:00 2008
--- gcc-4.3.1/libstdc++-v3/include/parallel/types.h	Wed Apr  9 16:47:00 2008
*************** namespace __gnu_parallel
*** 87,101 ****
    /// Merging algorithms: 
    // bubblesort-alike, loser-tree variants, enum sentinel.
    enum _MultiwayMergeAlgorithm
!     { 
!       BUBBLE, 
!       LOSER_TREE_EXPLICIT, 
!       LOSER_TREE, 
!       LOSER_TREE_COMBINED, 
!       LOSER_TREE_SENTINEL, 
!       ENUM_SENTINEL 
      };
!   
    /// Partial sum algorithms: recursive, linear.
    enum _PartialSumAlgorithm 
      { 
--- 87,96 ----
    /// Merging algorithms: 
    // bubblesort-alike, loser-tree variants, enum sentinel.
    enum _MultiwayMergeAlgorithm
!     {
!       LOSER_TREE
      };
! 
    /// Partial sum algorithms: recursive, linear.
    enum _PartialSumAlgorithm 
      { 
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/std/tuple gcc-4.3.1/libstdc++-v3/include/std/tuple
*** gcc-4.3.0/libstdc++-v3/include/std/tuple	Mon Feb 18 13:32:01 2008
--- gcc-4.3.1/libstdc++-v3/include/std/tuple	Wed Mar 26 23:21:44 2008
*************** namespace std
*** 205,210 ****
--- 205,211 ----
  	}
      };
  
+   /// tuple
    template<typename... _Elements> 
      class tuple : public _Tuple_impl<0, _Elements...>
      {
*************** namespace std
*** 275,283 ****
  	}
      };
  
-   template<> class tuple<> { };
  
!   // 2-element tuple, with construction and assignment from a pair.
    template<typename _T1, typename _T2>
      class tuple<_T1, _T2> : public _Tuple_impl<0, _T1, _T2>
      {
--- 276,286 ----
  	}
      };
  
  
!   template<>  
!     class tuple<> { };
! 
!   /// tuple (2-element), with construction and assignment from a pair.
    template<typename _T1, typename _T2>
      class tuple<_T1, _T2> : public _Tuple_impl<0, _T1, _T2>
      {
*************** namespace std
*** 393,399 ****
    template<typename _Tp>
      struct tuple_size;
  
!   /// @brief class tuple_size
    template<typename... _Elements>
      struct tuple_size<tuple<_Elements...> >
      {
--- 396,402 ----
    template<typename _Tp>
      struct tuple_size;
  
!   /// class tuple_size
    template<typename... _Elements>
      struct tuple_size<tuple<_Elements...> >
      {
*************** namespace std
*** 468,474 ****
      {
        typedef tuple<_TElements...> _Tp;
        typedef tuple<_UElements...> _Up;
!       return (__tuple_compare<tuple_size<_Tp>::value - tuple_size<_Tp>::value,
  	      0, tuple_size<_Tp>::value, _Tp, _Up>::__eq(__t, __u));
      }
  
--- 471,477 ----
      {
        typedef tuple<_TElements...> _Tp;
        typedef tuple<_UElements...> _Up;
!       return (__tuple_compare<tuple_size<_Tp>::value - tuple_size<_Up>::value,
  	      0, tuple_size<_Tp>::value, _Tp, _Up>::__eq(__t, __u));
      }
  
*************** namespace std
*** 479,485 ****
      {
        typedef tuple<_TElements...> _Tp;
        typedef tuple<_UElements...> _Up;
!       return (__tuple_compare<tuple_size<_Tp>::value - tuple_size<_Tp>::value,
  	      0, tuple_size<_Tp>::value, _Tp, _Up>::__less(__t, __u));
      }
  
--- 482,488 ----
      {
        typedef tuple<_TElements...> _Tp;
        typedef tuple<_UElements...> _Up;
!       return (__tuple_compare<tuple_size<_Tp>::value - tuple_size<_Up>::value,
  	      0, tuple_size<_Tp>::value, _Tp, _Up>::__less(__t, __u));
      }
  
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/std/type_traits gcc-4.3.1/libstdc++-v3/include/std/type_traits
*** gcc-4.3.0/libstdc++-v3/include/std/type_traits	Thu Nov  8 14:40:33 2007
--- gcc-4.3.1/libstdc++-v3/include/std/type_traits	Wed Mar 26 23:21:44 2008
***************
*** 1,6 ****
  // <type_traits> -*- C++ -*-
  
! // Copyright (C) 2007 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
--- 1,6 ----
  // <type_traits> -*- C++ -*-
  
! // Copyright (C) 2007, 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
***************
*** 63,68 ****
--- 63,70 ----
  namespace std
  {
    // Primary classification traits.
+ 
+   /// is_lvalue_reference
    template<typename>
      struct is_lvalue_reference
      : public false_type { };
*************** namespace std
*** 71,76 ****
--- 73,79 ----
      struct is_lvalue_reference<_Tp&>
      : public true_type { };
  
+   /// is_rvalue_reference
    template<typename>
      struct is_rvalue_reference
      : public false_type { };
*************** namespace std
*** 80,85 ****
--- 83,90 ----
      : public true_type { };
  
    // Secondary classification traits.
+ 
+   /// is_reference
    template<typename _Tp>
      struct is_reference
      : public integral_constant<bool, (is_lvalue_reference<_Tp>::value
*************** namespace std
*** 87,92 ****
--- 92,99 ----
      { };
  
    // Reference transformations.
+ 
+   /// remove_reference
    template<typename _Tp>
      struct remove_reference
      { typedef _Tp   type; };
*************** namespace std
*** 113,118 ****
--- 120,126 ----
      struct __add_lvalue_reference_helper<_Tp, false, true>
      { typedef typename remove_reference<_Tp>::type&   type; };
  
+   /// add_lvalue_reference
    template<typename _Tp>
      struct add_lvalue_reference
      : public __add_lvalue_reference_helper<_Tp>
*************** namespace std
*** 127,138 ****
--- 135,148 ----
      struct __add_rvalue_reference_helper<_Tp, true>
      { typedef _Tp&&   type; };
  
+   /// add_rvalue_reference
    template<typename _Tp>
      struct add_rvalue_reference
      : public __add_rvalue_reference_helper<_Tp>
      { };
  
    // Scalar properties and transformations.
+ 
    template<typename _Tp,
  	   bool = is_integral<_Tp>::value,
  	   bool = is_floating_point<_Tp>::value>
*************** namespace std
*** 148,158 ****
--- 158,170 ----
      : public integral_constant<bool, _Tp(-1) < _Tp(0)>
      { };
  
+   /// is_signed
    template<typename _Tp>
      struct is_signed
      : public integral_constant<bool, __is_signed_helper<_Tp>::value>
      { };
  
+   /// is_unsigned
    template<typename _Tp>
      struct is_unsigned
      : public integral_constant<bool, (is_arithmetic<_Tp>::value
*************** namespace std
*** 160,205 ****
--- 172,227 ----
      { };
  
    // Member introspection.
+ 
+   /// is_pod
    template<typename _Tp>
      struct is_pod
      : public integral_constant<bool, __is_pod(_Tp)>
      { };
  
+   /// has_trivial_default_constructor
    template<typename _Tp>
      struct has_trivial_default_constructor
      : public integral_constant<bool, __has_trivial_constructor(_Tp)>
      { };
  
+   /// has_trivial_copy_constructor
    template<typename _Tp>
      struct has_trivial_copy_constructor
      : public integral_constant<bool, __has_trivial_copy(_Tp)>
      { };
  
+   /// has_trivial_assign
    template<typename _Tp>
      struct has_trivial_assign
      : public integral_constant<bool, __has_trivial_assign(_Tp)>
      { };
  
+   /// has_trivial_destructor
    template<typename _Tp>
      struct has_trivial_destructor
      : public integral_constant<bool, __has_trivial_destructor(_Tp)>
      { };
  
+   /// has_nothrow_default_destructor
    template<typename _Tp>
      struct has_nothrow_default_constructor
      : public integral_constant<bool, __has_nothrow_constructor(_Tp)>
      { };
  
+   /// has_nothrow_copy_destructor
    template<typename _Tp>
      struct has_nothrow_copy_constructor
      : public integral_constant<bool, __has_nothrow_copy(_Tp)>
      { };
  
+   /// has_nothrow_assign
    template<typename _Tp>
      struct has_nothrow_assign
      : public integral_constant<bool, __has_nothrow_assign(_Tp)>
      { };
  
+   /// is_base_of
    template<typename _Base, typename _Derived>
      struct is_base_of
      : public integral_constant<bool, __is_base_of(_Base, _Derived)>
*************** namespace std
*** 232,238 ****
    template<typename _From, typename _To,
  	   bool = (is_void<_From>::value || is_void<_To>::value
  		   || is_function<_To>::value || is_array<_To>::value
! 		   // This special case is here only to avoid warnings.		   
  		   || (is_floating_point<typename
  		       remove_reference<_From>::type>::value
  		       && __is_int_or_cref<_To>::__value))>
--- 254,260 ----
    template<typename _From, typename _To,
  	   bool = (is_void<_From>::value || is_void<_To>::value
  		   || is_function<_To>::value || is_array<_To>::value
! 		   // This special case is here only to avoid warnings.
  		   || (is_floating_point<typename
  		       remove_reference<_From>::type>::value
  		       && __is_int_or_cref<_To>::__value))>
*************** namespace std
*** 252,257 ****
--- 274,280 ----
  
    // XXX FIXME
    // The C++0x specifications are different, see N2255.
+   /// is_convertible
    template<typename _From, typename _To>
      struct is_convertible
      : public integral_constant<bool,
*************** namespace std
*** 268,273 ****
--- 291,306 ----
        };
      };
  
+   /**
+    *  @brief Alignment type.
+    *
+    *  The value of _Align is a default-alignment which shall be the
+    *  most stringent alignment requirement for any C++ object type
+    *  whose size is no greater than _Len (3.9). The member typedef
+    *  type shall be a POD type suitable for use as uninitialized
+    *  storage for any object whose size is at most _Len and whose
+    *  alignment is a divisor of _Align.
+   */
    template<std::size_t _Len, std::size_t _Align =
  	   __alignof__(typename __aligned_storage_msa<_Len>::__type)>
      struct aligned_storage
*************** namespace std
*** 281,301 ****
  
  
    // Define a nested type if some predicate holds.
    template<bool, typename _Tp = void>
      struct enable_if 
      { };
  
    template<typename _Tp>
      struct enable_if<true, _Tp>
      { typedef _Tp type; };
  
  
!   // Like a conditional expression, but for types. If true, first, if
!   // false, second.
    template<bool _Cond, typename _Iftrue, typename _Iffalse>
      struct conditional
      { typedef _Iftrue type; };
  
    template<typename _Iftrue, typename _Iffalse>
      struct conditional<false, _Iftrue, _Iffalse>
      { typedef _Iffalse type; };
--- 314,338 ----
  
  
    // Define a nested type if some predicate holds.
+   /// Primary template.
    template<bool, typename _Tp = void>
      struct enable_if 
      { };
  
+   /// Partial specialization for true.
    template<typename _Tp>
      struct enable_if<true, _Tp>
      { typedef _Tp type; };
  
  
!   // A conditional expression, but for types. 
!   // If true, first, if false, second.
!   /// Primary template.
    template<bool _Cond, typename _Iftrue, typename _Iffalse>
      struct conditional
      { typedef _Iftrue type; };
  
+   /// Partial specialization for false.
    template<typename _Iftrue, typename _Iffalse>
      struct conditional<false, _Iftrue, _Iffalse>
      { typedef _Iffalse type; };
*************** namespace std
*** 321,326 ****
--- 358,364 ----
      struct __decay_selector<_Up, false, true>
      { typedef typename add_pointer<_Up>::type __type; };
  
+   /// decay
    template<typename _Tp> 
      struct decay 
      { 
*************** namespace std
*** 428,436 ****
        typedef typename conditional<__b1, __smallest, __cond_type>::type __type;
      };
  
-   // Primary class template.
    // Given an integral/enum type, return the corresponding unsigned
    // integer type.
    template<typename _Tp>
      struct make_unsigned 
      { typedef typename __make_unsigned_selector<_Tp>::__type type; };
--- 466,474 ----
        typedef typename conditional<__b1, __smallest, __cond_type>::type __type;
      };
  
    // Given an integral/enum type, return the corresponding unsigned
    // integer type.
+   /// Primary template.
    template<typename _Tp>
      struct make_unsigned 
      { typedef typename __make_unsigned_selector<_Tp>::__type type; };
*************** namespace std
*** 503,511 ****
        typedef typename conditional<__b1, __smallest, __cond_type>::type __type;
      };
  
-   // Primary class template.
    // Given an integral/enum type, return the corresponding signed
    // integer type.
    template<typename _Tp>
      struct make_signed 
      { typedef typename __make_signed_selector<_Tp>::__type type; };
--- 541,549 ----
        typedef typename conditional<__b1, __smallest, __cond_type>::type __type;
      };
  
    // Given an integral/enum type, return the corresponding signed
    // integer type.
+   /// Primary template.
    template<typename _Tp>
      struct make_signed 
      { typedef typename __make_signed_selector<_Tp>::__type type; };
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/std/unordered_map gcc-4.3.1/libstdc++-v3/include/std/unordered_map
*** gcc-4.3.0/libstdc++-v3/include/std/unordered_map	Tue Dec 25 13:49:54 2007
--- gcc-4.3.1/libstdc++-v3/include/std/unordered_map	Tue Apr 29 19:44:18 2008
***************
*** 1,6 ****
  // <unordered_map> -*- C++ -*-
  
! // Copyright (C) 2007 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
--- 1,6 ----
  // <unordered_map> -*- C++ -*-
  
! // Copyright (C) 2007, 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
***************
*** 73,76 ****
--- 73,80 ----
  #  undef _GLIBCXX_INCLUDE_AS_CXX0X
  #endif
  
+ #ifdef _GLIBCXX_DEBUG
+ # include <debug/unordered_map>
+ #endif
+ 
  #endif // _GLIBCXX_UNORDERED_MAP
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1/bessel_function.tcc gcc-4.3.1/libstdc++-v3/include/tr1/bessel_function.tcc
*** gcc-4.3.0/libstdc++-v3/include/tr1/bessel_function.tcc	Thu Jan 31 18:44:55 2008
--- gcc-4.3.1/libstdc++-v3/include/tr1/bessel_function.tcc	Wed Mar 26 23:21:44 2008
***************
*** 1,6 ****
  // Special functions -*- C++ -*-
  
! // Copyright (C) 2006-2007
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
--- 1,6 ----
  // Special functions -*- C++ -*-
  
! // Copyright (C) 2006, 2007, 2008
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
*************** namespace tr1
*** 61,74 ****
  
    // [5.2] Special functions
  
-   /**
-    * @ingroup tr1_math_spec_func
-    * @{
-    */
- 
-   //
    // Implementation-space details.
-   //
    namespace __detail
    {
  
--- 61,67 ----
*************** namespace tr1
*** 633,641 ****
      }
  
    } // namespace std::tr1::__detail
- 
-   /* @} */ // group tr1_math_spec_func
- 
  }
  }
  
--- 626,631 ----
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1/beta_function.tcc gcc-4.3.1/libstdc++-v3/include/tr1/beta_function.tcc
*** gcc-4.3.0/libstdc++-v3/include/tr1/beta_function.tcc	Thu May 31 23:37:56 2007
--- gcc-4.3.1/libstdc++-v3/include/tr1/beta_function.tcc	Wed Mar 26 23:21:44 2008
***************
*** 1,6 ****
  // Special functions -*- C++ -*-
  
! // Copyright (C) 2006-2007
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
--- 1,6 ----
  // Special functions -*- C++ -*-
  
! // Copyright (C) 2006, 2007, 2008
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
*************** namespace tr1
*** 59,72 ****
  
    // [5.2] Special functions
  
-   /**
-    * @ingroup tr1_math_spec_func
-    * @{
-    */
- 
-   //
    // Implementation-space details.
-   //
    namespace __detail
    {
  
--- 59,65 ----
*************** namespace tr1
*** 203,211 ****
      }
  
    } // namespace std::tr1::__detail
- 
-   /* @} */ // group tr1_math_spec_func
- 
  }
  }
  
--- 196,201 ----
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1/cmath gcc-4.3.1/libstdc++-v3/include/tr1/cmath
*** gcc-4.3.0/libstdc++-v3/include/tr1/cmath	Thu Jan 31 18:44:55 2008
--- gcc-4.3.1/libstdc++-v3/include/tr1/cmath	Wed Mar 26 23:21:44 2008
***************
*** 1,6 ****
  // TR1 cmath -*- C++ -*-
  
! // Copyright (C) 2006, 2007 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
--- 1,6 ----
  // TR1 cmath -*- C++ -*-
  
! // Copyright (C) 2006, 2007, 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
***************
*** 56,70 ****
  #  undef _GLIBCXX_INCLUDE_AS_TR1
  #endif
  
- /**
-  * @defgroup tr1_math_spec_func Mathematical Special Functions
-  * A collection of advanced mathematical special functions.
-  * @{
-  */
  #include <bits/stl_algobase.h>
  #include <limits>
- 
  #include <tr1/type_traits>
  #include <tr1/gamma.tcc>
  #include <tr1/bessel_function.tcc>
  #include <tr1/beta_function.tcc>
--- 56,65 ----
  #  undef _GLIBCXX_INCLUDE_AS_TR1
  #endif
  
  #include <bits/stl_algobase.h>
  #include <limits>
  #include <tr1/type_traits>
+ 
  #include <tr1/gamma.tcc>
  #include <tr1/bessel_function.tcc>
  #include <tr1/beta_function.tcc>
***************
*** 77,88 ****
  #include <tr1/poly_laguerre.tcc>
  #include <tr1/riemann_zeta.tcc>
  
- // namespace std::tr1
  namespace std
  {
  namespace tr1
  {
!   //  5.2.1.1  Associated Laguerre polynomials.
    inline float
    assoc_laguerref(unsigned int __n, unsigned int __m, float __x)
    { return __detail::__assoc_laguerre<float>(__n, __m, __x); }
--- 72,87 ----
  #include <tr1/poly_laguerre.tcc>
  #include <tr1/riemann_zeta.tcc>
  
  namespace std
  {
  namespace tr1
  {
!   /**
!    * @addtogroup tr1_math_spec_func Mathematical Special Functions
!    * A collection of advanced mathematical special functions.
!    * @{
!    */
! 
    inline float
    assoc_laguerref(unsigned int __n, unsigned int __m, float __x)
    { return __detail::__assoc_laguerre<float>(__n, __m, __x); }
*************** namespace tr1
*** 93,98 ****
--- 92,98 ----
      return __detail::__assoc_laguerre<long double>(__n, __m, __x);
    }
  
+   ///  5.2.1.1  Associated Laguerre polynomials.
    template<typename _Tp>
      inline typename __gnu_cxx::__promote<_Tp>::__type
      assoc_laguerre(unsigned int __n, unsigned int __m, _Tp __x)
*************** namespace tr1
*** 101,107 ****
        return __detail::__assoc_laguerre<__type>(__n, __m, __x);
      }
  
-   //  5.2.1.2  Associated Legendre functions.
    inline float
    assoc_legendref(unsigned int __l, unsigned int __m, float __x)
    { return __detail::__assoc_legendre_p<float>(__l, __m, __x); }
--- 101,106 ----
*************** namespace tr1
*** 110,115 ****
--- 109,115 ----
    assoc_legendrel(unsigned int __l, unsigned int __m, long double __x)
    { return __detail::__assoc_legendre_p<long double>(__l, __m, __x); }
  
+   ///  5.2.1.2  Associated Legendre functions.
    template<typename _Tp>
      inline typename __gnu_cxx::__promote<_Tp>::__type
      assoc_legendre(unsigned int __l, unsigned int __m, _Tp __x)
*************** namespace tr1
*** 118,124 ****
        return __detail::__assoc_legendre_p<__type>(__l, __m, __x);
      }
  
-   //  5.2.1.3  Beta functions.
    inline float
    betaf(float __x, float __y)
    { return __detail::__beta<float>(__x, __y); }
--- 118,123 ----
*************** namespace tr1
*** 127,132 ****
--- 126,132 ----
    betal(long double __x, long double __y)
    { return __detail::__beta<long double>(__x, __y); }
  
+   ///  5.2.1.3  Beta functions.
    template<typename _Tpx, typename _Tpy>
      inline typename __gnu_cxx::__promote_2<_Tpx, _Tpy>::__type
      beta(_Tpx __x, _Tpy __y)
*************** namespace tr1
*** 135,141 ****
        return __detail::__beta<__type>(__x, __y);
      }
  
-   //  5.2.1.4  Complete elliptic integrals of the first kind.
    inline float
    comp_ellint_1f(float __k)
    { return __detail::__comp_ellint_1<float>(__k); }
--- 135,140 ----
*************** namespace tr1
*** 144,149 ****
--- 143,149 ----
    comp_ellint_1l(long double __k)
    { return __detail::__comp_ellint_1<long double>(__k); }
  
+   ///  5.2.1.4  Complete elliptic integrals of the first kind.
    template<typename _Tp>
      inline typename __gnu_cxx::__promote<_Tp>::__type
      comp_ellint_1(_Tp __k)
*************** namespace tr1
*** 152,158 ****
        return __detail::__comp_ellint_1<__type>(__k);
      }
  
-   //  5.2.1.5  Complete elliptic integrals of the second kind.
    inline float
    comp_ellint_2f(float __k)
    { return __detail::__comp_ellint_2<float>(__k); }
--- 152,157 ----
*************** namespace tr1
*** 161,166 ****
--- 160,166 ----
    comp_ellint_2l(long double __k)
    { return __detail::__comp_ellint_2<long double>(__k); }
  
+   ///  5.2.1.5  Complete elliptic integrals of the second kind.
    template<typename _Tp>
      inline typename __gnu_cxx::__promote<_Tp>::__type
      comp_ellint_2(_Tp __k)
*************** namespace tr1
*** 169,175 ****
        return __detail::__comp_ellint_2<__type>(__k);
      }
  
-   //  5.2.1.6  Complete elliptic integrals of the third kind.
    inline float
    comp_ellint_3f(float __k, float __nu)
    { return __detail::__comp_ellint_3<float>(__k, __nu); }
--- 169,174 ----
*************** namespace tr1
*** 178,183 ****
--- 177,183 ----
    comp_ellint_3l(long double __k, long double __nu)
    { return __detail::__comp_ellint_3<long double>(__k, __nu); }
  
+   ///  5.2.1.6  Complete elliptic integrals of the third kind.
    template<typename _Tp, typename _Tpn>
      inline typename __gnu_cxx::__promote_2<_Tp, _Tpn>::__type
      comp_ellint_3(_Tp __k, _Tpn __nu)
*************** namespace tr1
*** 186,192 ****
        return __detail::__comp_ellint_3<__type>(__k, __nu);
      }
  
-   //  5.2.1.7  Confluent hypergeometric functions.
    inline float
    conf_hypergf(float __a, float __c, float __x)
    { return __detail::__conf_hyperg<float>(__a, __c, __x); }
--- 186,191 ----
*************** namespace tr1
*** 195,200 ****
--- 194,200 ----
    conf_hypergl(long double __a, long double __c, long double __x)
    { return __detail::__conf_hyperg<long double>(__a, __c, __x); }
  
+   ///  5.2.1.7  Confluent hypergeometric functions.
    template<typename _Tpa, typename _Tpc, typename _Tp>
      inline typename __gnu_cxx::__promote_3<_Tpa, _Tpc, _Tp>::__type
      conf_hyperg(_Tpa __a, _Tpc __c, _Tp __x)
*************** namespace tr1
*** 203,209 ****
        return __detail::__conf_hyperg<__type>(__a, __c, __x);
      }
  
-   //  5.2.1.8  Regular modified cylindrical Bessel functions.
    inline float
    cyl_bessel_if(float __nu, float __x)
    { return __detail::__cyl_bessel_i<float>(__nu, __x); }
--- 203,208 ----
*************** namespace tr1
*** 212,217 ****
--- 211,217 ----
    cyl_bessel_il(long double __nu, long double __x)
    { return __detail::__cyl_bessel_i<long double>(__nu, __x); }
  
+   ///  5.2.1.8  Regular modified cylindrical Bessel functions.
    template<typename _Tpnu, typename _Tp>
      inline typename __gnu_cxx::__promote_2<_Tpnu, _Tp>::__type
      cyl_bessel_i(_Tpnu __nu, _Tp __x)
*************** namespace tr1
*** 220,226 ****
        return __detail::__cyl_bessel_i<__type>(__nu, __x);
      }
  
-   //  5.2.1.9  Cylindrical Bessel functions (of the first kind).
    inline float
    cyl_bessel_jf(float __nu, float __x)
    { return __detail::__cyl_bessel_j<float>(__nu, __x); }
--- 220,225 ----
*************** namespace tr1
*** 229,234 ****
--- 228,234 ----
    cyl_bessel_jl(long double __nu, long double __x)
    { return __detail::__cyl_bessel_j<long double>(__nu, __x); }
  
+   ///  5.2.1.9  Cylindrical Bessel functions (of the first kind).
    template<typename _Tpnu, typename _Tp>
      inline typename __gnu_cxx::__promote_2<_Tpnu, _Tp>::__type
      cyl_bessel_j(_Tpnu __nu, _Tp __x)
*************** namespace tr1
*** 237,243 ****
        return __detail::__cyl_bessel_j<__type>(__nu, __x);
      }
  
-   //  5.2.1.10  Irregular modified cylindrical Bessel functions.
    inline float
    cyl_bessel_kf(float __nu, float __x)
    { return __detail::__cyl_bessel_k<float>(__nu, __x); }
--- 237,242 ----
*************** namespace tr1
*** 246,251 ****
--- 245,251 ----
    cyl_bessel_kl(long double __nu, long double __x)
    { return __detail::__cyl_bessel_k<long double>(__nu, __x); }
  
+   ///  5.2.1.10  Irregular modified cylindrical Bessel functions.
    template<typename _Tpnu, typename _Tp>
      inline typename __gnu_cxx::__promote_2<_Tpnu, _Tp>::__type
      cyl_bessel_k(_Tpnu __nu, _Tp __x)
*************** namespace tr1
*** 254,260 ****
        return __detail::__cyl_bessel_k<__type>(__nu, __x);
      }
  
-   //  5.2.1.11  Cylindrical Neumann functions.
    inline float
    cyl_neumannf(float __nu, float __x)
    { return __detail::__cyl_neumann_n<float>(__nu, __x); }
--- 254,259 ----
*************** namespace tr1
*** 263,268 ****
--- 262,268 ----
    cyl_neumannl(long double __nu, long double __x)
    { return __detail::__cyl_neumann_n<long double>(__nu, __x); }
  
+   ///  5.2.1.11  Cylindrical Neumann functions.
    template<typename _Tpnu, typename _Tp>
      inline typename __gnu_cxx::__promote_2<_Tpnu, _Tp>::__type
      cyl_neumann(_Tpnu __nu, _Tp __x)
*************** namespace tr1
*** 271,277 ****
        return __detail::__cyl_neumann_n<__type>(__nu, __x);
      }
  
-   //  5.2.1.12  Incomplete elliptic integrals of the first kind.
    inline float
    ellint_1f(float __k, float __phi)
    { return __detail::__ellint_1<float>(__k, __phi); }
--- 271,276 ----
*************** namespace tr1
*** 280,285 ****
--- 279,285 ----
    ellint_1l(long double __k, long double __phi)
    { return __detail::__ellint_1<long double>(__k, __phi); }
  
+   ///  5.2.1.12  Incomplete elliptic integrals of the first kind.
    template<typename _Tp, typename _Tpp>
      inline typename __gnu_cxx::__promote_2<_Tp, _Tpp>::__type
      ellint_1(_Tp __k, _Tpp __phi)
*************** namespace tr1
*** 288,294 ****
        return __detail::__ellint_1<__type>(__k, __phi);
      }
  
-   //  5.2.1.13  Incomplete elliptic integrals of the second kind.
    inline float
    ellint_2f(float __k, float __phi)
    { return __detail::__ellint_2<float>(__k, __phi); }
--- 288,293 ----
*************** namespace tr1
*** 297,302 ****
--- 296,302 ----
    ellint_2l(long double __k, long double __phi)
    { return __detail::__ellint_2<long double>(__k, __phi); }
  
+   ///  5.2.1.13  Incomplete elliptic integrals of the second kind.
    template<typename _Tp, typename _Tpp>
      inline typename __gnu_cxx::__promote_2<_Tp, _Tpp>::__type
      ellint_2(_Tp __k, _Tpp __phi)
*************** namespace tr1
*** 305,311 ****
        return __detail::__ellint_2<__type>(__k, __phi);
      }
  
-   //  5.2.1.14  Incomplete elliptic integrals of the third kind.
    inline float
    ellint_3f(float __k, float __nu, float __phi)
    { return __detail::__ellint_3<float>(__k, __nu, __phi); }
--- 305,310 ----
*************** namespace tr1
*** 314,319 ****
--- 313,319 ----
    ellint_3l(long double __k, long double __nu, long double __phi)
    { return __detail::__ellint_3<long double>(__k, __nu, __phi); }
  
+   ///  5.2.1.14  Incomplete elliptic integrals of the third kind.
    template<typename _Tp, typename _Tpn, typename _Tpp>
      inline typename __gnu_cxx::__promote_3<_Tp, _Tpn, _Tpp>::__type
      ellint_3(_Tp __k, _Tpn __nu, _Tpp __phi)
*************** namespace tr1
*** 322,328 ****
        return __detail::__ellint_3<__type>(__k, __nu, __phi);
      }
  
-   //  5.2.1.15  Exponential integrals.
    inline float
    expintf(float __x)
    { return __detail::__expint<float>(__x); }
--- 322,327 ----
*************** namespace tr1
*** 331,336 ****
--- 330,336 ----
    expintl(long double __x)
    { return __detail::__expint<long double>(__x); }
  
+   ///  5.2.1.15  Exponential integrals.
    template<typename _Tp>
      inline typename __gnu_cxx::__promote<_Tp>::__type
      expint(_Tp __x)
*************** namespace tr1
*** 339,345 ****
        return __detail::__expint<__type>(__x);
      }
  
-   //  5.2.1.16  Hermite polynomials.
    inline float
    hermitef(unsigned int __n, float __x)
    { return __detail::__poly_hermite<float>(__n, __x); }
--- 339,344 ----
*************** namespace tr1
*** 348,353 ****
--- 347,353 ----
    hermitel(unsigned int __n, long double __x)
    { return __detail::__poly_hermite<long double>(__n, __x); }
  
+   ///  5.2.1.16  Hermite polynomials.
    template<typename _Tp>
      inline typename __gnu_cxx::__promote<_Tp>::__type
      hermite(unsigned int __n, _Tp __x)
*************** namespace tr1
*** 356,362 ****
        return __detail::__poly_hermite<__type>(__n, __x);
      }
  
-   //  5.2.1.17  Hypergeometric functions.
    inline float
    hypergf(float __a, float __b, float __c, float __x)
    { return __detail::__hyperg<float>(__a, __b, __c, __x); }
--- 356,361 ----
*************** namespace tr1
*** 365,370 ****
--- 364,370 ----
    hypergl(long double __a, long double __b, long double __c, long double __x)
    { return __detail::__hyperg<long double>(__a, __b, __c, __x); }
  
+   ///  5.2.1.17  Hypergeometric functions.
    template<typename _Tpa, typename _Tpb, typename _Tpc, typename _Tp>
      inline typename __gnu_cxx::__promote_4<_Tpa, _Tpb, _Tpc, _Tp>::__type
      hyperg(_Tpa __a, _Tpb __b, _Tpc __c, _Tp __x)
*************** namespace tr1
*** 373,379 ****
        return __detail::__hyperg<__type>(__a, __b, __c, __x);
      }
  
-   //  5.2.1.18  Laguerre polynomials.
    inline float
    laguerref(unsigned int __n, float __x)
    { return __detail::__laguerre<float>(__n, __x); }
--- 373,378 ----
*************** namespace tr1
*** 382,387 ****
--- 381,387 ----
    laguerrel(unsigned int __n, long double __x)
    { return __detail::__laguerre<long double>(__n, __x); }
  
+   ///  5.2.1.18  Laguerre polynomials.
    template<typename _Tp>
      inline typename __gnu_cxx::__promote<_Tp>::__type
      laguerre(unsigned int __n, _Tp __x)
*************** namespace tr1
*** 390,396 ****
        return __detail::__laguerre<__type>(__n, __x);
      }
  
-   //  5.2.1.19  Legendre polynomials.
    inline float
    legendref(unsigned int __n, float __x)
    { return __detail::__poly_legendre_p<float>(__n, __x); }
--- 390,395 ----
*************** namespace tr1
*** 399,404 ****
--- 398,404 ----
    legendrel(unsigned int __n, long double __x)
    { return __detail::__poly_legendre_p<long double>(__n, __x); }
  
+   ///  5.2.1.19  Legendre polynomials.
    template<typename _Tp>
      inline typename __gnu_cxx::__promote<_Tp>::__type
      legendre(unsigned int __n, _Tp __x)
*************** namespace tr1
*** 407,413 ****
        return __detail::__poly_legendre_p<__type>(__n, __x);
      }
  
-   //  5.2.1.20  Riemann zeta function.
    inline float
    riemann_zetaf(float __x)
    { return __detail::__riemann_zeta<float>(__x); }
--- 407,412 ----
*************** namespace tr1
*** 416,421 ****
--- 415,421 ----
    riemann_zetal(long double __x)
    { return __detail::__riemann_zeta<long double>(__x); }
  
+   ///  5.2.1.20  Riemann zeta function.
    template<typename _Tp>
      inline typename __gnu_cxx::__promote<_Tp>::__type
      riemann_zeta(_Tp __x)
*************** namespace tr1
*** 424,430 ****
        return __detail::__riemann_zeta<__type>(__x);
      }
  
-   //  5.2.1.21  Spherical Bessel functions.
    inline float
    sph_besself(unsigned int __n, float __x)
    { return __detail::__sph_bessel<float>(__n, __x); }
--- 424,429 ----
*************** namespace tr1
*** 433,438 ****
--- 432,438 ----
    sph_bessell(unsigned int __n, long double __x)
    { return __detail::__sph_bessel<long double>(__n, __x); }
  
+   ///  5.2.1.21  Spherical Bessel functions.
    template<typename _Tp>
      inline typename __gnu_cxx::__promote<_Tp>::__type
      sph_bessel(unsigned int __n, _Tp __x)
*************** namespace tr1
*** 441,447 ****
        return __detail::__sph_bessel<__type>(__n, __x);
      }
  
-   //  5.2.1.22  Spherical associated Legendre functions.
    inline float
    sph_legendref(unsigned int __l, unsigned int __m, float __theta)
    { return __detail::__sph_legendre<float>(__l, __m, __theta); }
--- 441,446 ----
*************** namespace tr1
*** 450,455 ****
--- 449,455 ----
    sph_legendrel(unsigned int __l, unsigned int __m, long double __theta)
    { return __detail::__sph_legendre<long double>(__l, __m, __theta); }
  
+   ///  5.2.1.22  Spherical associated Legendre functions.
    template<typename _Tp>
      inline typename __gnu_cxx::__promote<_Tp>::__type
      sph_legendre(unsigned int __l, unsigned int __m, _Tp __theta)
*************** namespace tr1
*** 458,464 ****
        return __detail::__sph_legendre<__type>(__l, __m, __theta);
      }
  
-   //  5.2.1.23  Spherical Neumann functions.
    inline float
    sph_neumannf(unsigned int __n, float __x)
    { return __detail::__sph_neumann<float>(__n, __x); }
--- 458,463 ----
*************** namespace tr1
*** 467,472 ****
--- 466,472 ----
    sph_neumannl(unsigned int __n, long double __x)
    { return __detail::__sph_neumann<long double>(__n, __x); }
  
+   ///  5.2.1.23  Spherical Neumann functions.
    template<typename _Tp>
      inline typename __gnu_cxx::__promote<_Tp>::__type
      sph_neumann(unsigned int __n, _Tp __x)
*************** namespace tr1
*** 475,481 ****
        return __detail::__sph_neumann<__type>(__n, __x);
      }
  
!   /* @} */ // group tr1_math_spec_func
  }
  }
  
--- 475,481 ----
        return __detail::__sph_neumann<__type>(__n, __x);
      }
  
!   /* @} */ // tr1_math_spec_func
  }
  }
  
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1/ell_integral.tcc gcc-4.3.1/libstdc++-v3/include/tr1/ell_integral.tcc
*** gcc-4.3.0/libstdc++-v3/include/tr1/ell_integral.tcc	Thu Jan 31 18:44:55 2008
--- gcc-4.3.1/libstdc++-v3/include/tr1/ell_integral.tcc	Wed Mar 26 23:21:44 2008
***************
*** 1,6 ****
  // Special functions -*- C++ -*-
  
! // Copyright (C) 2006-2007
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
--- 1,6 ----
  // Special functions -*- C++ -*-
  
! // Copyright (C) 2006, 2007, 2008
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
*************** namespace tr1
*** 55,68 ****
  
    // [5.2] Special functions
  
-   /**
-    * @ingroup tr1_math_spec_func
-    * @{
-    */
- 
-   //
    // Implementation-space details.
-   //
    namespace __detail
    {
  
--- 55,61 ----
*************** namespace tr1
*** 753,761 ****
      }
  
    } // namespace std::tr1::__detail
- 
-   /* @} */ // group tr1_math_spec_func
- 
  }
  }
  
--- 746,751 ----
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1/exp_integral.tcc gcc-4.3.1/libstdc++-v3/include/tr1/exp_integral.tcc
*** gcc-4.3.0/libstdc++-v3/include/tr1/exp_integral.tcc	Mon Feb 18 00:05:26 2008
--- gcc-4.3.1/libstdc++-v3/include/tr1/exp_integral.tcc	Wed Mar 26 23:21:44 2008
***************
*** 1,6 ****
  // Special functions -*- C++ -*-
  
! // Copyright (C) 2006-2007
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
--- 1,6 ----
  // Special functions -*- C++ -*-
  
! // Copyright (C) 2006, 2007, 2008
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
*************** namespace tr1
*** 60,73 ****
  
    // [5.2] Special functions
  
-   /**
-    * @ingroup tr1_math_spec_func
-    * @{
-    */
- 
-   //
    // Implementation-space details.
-   //
    namespace __detail
    {
  
--- 60,66 ----
*************** namespace tr1
*** 530,538 ****
      }
  
    } // namespace std::tr1::__detail
- 
-   /* @} */ // group tr1_math_spec_func
- 
  }
  }
  
--- 523,528 ----
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1/gamma.tcc gcc-4.3.1/libstdc++-v3/include/tr1/gamma.tcc
*** gcc-4.3.0/libstdc++-v3/include/tr1/gamma.tcc	Mon Feb 18 00:05:26 2008
--- gcc-4.3.1/libstdc++-v3/include/tr1/gamma.tcc	Wed Mar 26 23:21:44 2008
***************
*** 1,6 ****
  // Special functions -*- C++ -*-
  
! // Copyright (C) 2006-2007
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
--- 1,6 ----
  // Special functions -*- C++ -*-
  
! // Copyright (C) 2006, 2007, 2008
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
*************** namespace std
*** 58,72 ****
  {
  namespace tr1
  {
- 
-   /**
-    * @ingroup tr1_math_spec_func
-    * @{
-    */
- 
-   //
    // Implementation-space details.
-   //
    namespace __detail
    {
  
--- 58,64 ----
*************** namespace tr1
*** 477,485 ****
      }
  
    } // namespace std::tr1::__detail
- 
-   /* @} */ // group tr1_math_spec_func
- 
  }
  }
  
--- 469,474 ----
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1/hypergeometric.tcc gcc-4.3.1/libstdc++-v3/include/tr1/hypergeometric.tcc
*** gcc-4.3.0/libstdc++-v3/include/tr1/hypergeometric.tcc	Mon Feb 18 00:05:26 2008
--- gcc-4.3.1/libstdc++-v3/include/tr1/hypergeometric.tcc	Wed Mar 26 23:21:44 2008
***************
*** 1,6 ****
  // Special functions -*- C++ -*-
  
! // Copyright (C) 2006-2007
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
--- 1,6 ----
  // Special functions -*- C++ -*-
  
! // Copyright (C) 2006, 2007, 2008
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
*************** namespace tr1
*** 54,67 ****
  
    // [5.2] Special functions
  
-   /**
-    * @ingroup tr1_math_spec_func
-    * @{
-    */
- 
-   //
    // Implementation-space details.
-   //
    namespace __detail
    {
  
--- 54,60 ----
*************** namespace tr1
*** 780,788 ****
      }
  
    } // namespace std::tr1::__detail
- 
-   /* @} */ // group tr1_math_spec_func
- 
  }
  }
  
--- 773,778 ----
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1/legendre_function.tcc gcc-4.3.1/libstdc++-v3/include/tr1/legendre_function.tcc
*** gcc-4.3.0/libstdc++-v3/include/tr1/legendre_function.tcc	Thu Jan 31 18:44:55 2008
--- gcc-4.3.1/libstdc++-v3/include/tr1/legendre_function.tcc	Wed Mar 26 23:21:44 2008
***************
*** 1,6 ****
  // Special functions -*- C++ -*-
  
! // Copyright (C) 2006-2007
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
--- 1,6 ----
  // Special functions -*- C++ -*-
  
! // Copyright (C) 2006, 2007, 2008
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
*************** namespace tr1
*** 59,72 ****
  
    // [5.2] Special functions
  
-   /**
-    * @ingroup tr1_math_spec_func
-    * @{
-    */
- 
-   //
    // Implementation-space details.
-   //
    namespace __detail
    {
  
--- 59,65 ----
*************** namespace tr1
*** 161,167 ****
            _Tp __p_mm = _Tp(1);
            if (__m > 0)
              {
!               //  Two square roots seem more accurate more of the time than just one.
                _Tp __root = std::sqrt(_Tp(1) - __x) * std::sqrt(_Tp(1) + __x);
                _Tp __fact = _Tp(1);
                for (unsigned int __i = 1; __i <= __m; ++__i)
--- 154,161 ----
            _Tp __p_mm = _Tp(1);
            if (__m > 0)
              {
!               //  Two square roots seem more accurate more of the time
!               //  than just one.
                _Tp __root = std::sqrt(_Tp(1) - __x) * std::sqrt(_Tp(1) + __x);
                _Tp __fact = _Tp(1);
                for (unsigned int __i = 1; __i <= __m; ++__i)
*************** namespace tr1
*** 310,318 ****
      }
  
    } // namespace std::tr1::__detail
- 
-   /* @} */ // group tr1_math_spec_func
- 
  }
  }
  
--- 304,309 ----
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1/modified_bessel_func.tcc gcc-4.3.1/libstdc++-v3/include/tr1/modified_bessel_func.tcc
*** gcc-4.3.0/libstdc++-v3/include/tr1/modified_bessel_func.tcc	Thu May 31 23:37:56 2007
--- gcc-4.3.1/libstdc++-v3/include/tr1/modified_bessel_func.tcc	Wed Mar 26 23:21:44 2008
***************
*** 1,6 ****
  // Special functions -*- C++ -*-
  
! // Copyright (C) 2006-2007
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
--- 1,6 ----
  // Special functions -*- C++ -*-
  
! // Copyright (C) 2006, 2007, 2008
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
*************** namespace tr1
*** 61,74 ****
  
    // [5.2] Special functions
  
-   /**
-    * @ingroup tr1_math_spec_func
-    * @{
-    */
- 
-   //
    // Implementation-space details.
-   //
    namespace __detail
    {
  
--- 61,67 ----
*************** namespace tr1
*** 442,450 ****
      }
  
    } // namespace std::tr1::__detail
- 
-   /* @} */ // group tr1_math_spec_func
- 
  }
  }
  
--- 435,440 ----
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1/poly_hermite.tcc gcc-4.3.1/libstdc++-v3/include/tr1/poly_hermite.tcc
*** gcc-4.3.0/libstdc++-v3/include/tr1/poly_hermite.tcc	Thu May 31 23:37:56 2007
--- gcc-4.3.1/libstdc++-v3/include/tr1/poly_hermite.tcc	Wed Mar 26 23:21:44 2008
***************
*** 1,6 ****
  // Special functions -*- C++ -*-
  
! // Copyright (C) 2006-2007
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
--- 1,6 ----
  // Special functions -*- C++ -*-
  
! // Copyright (C) 2006, 2007, 2008
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
*************** namespace tr1
*** 52,65 ****
  
    // [5.2] Special functions
  
-   /**
-    * @ingroup tr1_math_spec_func
-    * @{
-    */
- 
-   //
    // Implementation-space details.
-   //
    namespace __detail
    {
  
--- 52,58 ----
*************** namespace tr1
*** 130,138 ****
      }
  
    } // namespace std::tr1::__detail
- 
-   /* @} */ // group tr1_math_spec_func
- 
  }
  }
  
--- 123,128 ----
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1/poly_laguerre.tcc gcc-4.3.1/libstdc++-v3/include/tr1/poly_laguerre.tcc
*** gcc-4.3.0/libstdc++-v3/include/tr1/poly_laguerre.tcc	Mon Feb 18 00:05:26 2008
--- gcc-4.3.1/libstdc++-v3/include/tr1/poly_laguerre.tcc	Wed Mar 26 23:21:44 2008
***************
*** 1,6 ****
  // Special functions -*- C++ -*-
  
! // Copyright (C) 2006-2007
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
--- 1,6 ----
  // Special functions -*- C++ -*-
  
! // Copyright (C) 2006, 2007, 2008
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
*************** namespace tr1
*** 54,67 ****
  
    // [5.2] Special functions
  
-   /**
-    * @ingroup tr1_math_spec_func
-    * @{
-    */
- 
-   //
    // Implementation-space details.
-   //
    namespace __detail
    {
  
--- 54,60 ----
*************** namespace tr1
*** 335,343 ****
      }
  
    } // namespace std::tr1::__detail
- 
-   /* @} */ // group tr1_math_spec_func
- 
  }
  }
  
--- 328,333 ----
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1/riemann_zeta.tcc gcc-4.3.1/libstdc++-v3/include/tr1/riemann_zeta.tcc
*** gcc-4.3.0/libstdc++-v3/include/tr1/riemann_zeta.tcc	Thu May 31 23:37:56 2007
--- gcc-4.3.1/libstdc++-v3/include/tr1/riemann_zeta.tcc	Wed Mar 26 23:21:44 2008
***************
*** 1,6 ****
  // Special functions -*- C++ -*-
  
! // Copyright (C) 2006-2007
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
--- 1,6 ----
  // Special functions -*- C++ -*-
  
! // Copyright (C) 2006, 2007, 2008
  // Free Software Foundation, Inc.
  //
  // This file is part of the GNU ISO C++ Library.  This library is free
*************** namespace tr1
*** 57,70 ****
  
    // [5.2] Special functions
  
-   /**
-    * @ingroup tr1_math_spec_func
-    * @{
-    */
- 
-   //
    // Implementation-space details.
-   //
    namespace __detail
    {
  
--- 57,63 ----
*************** namespace tr1
*** 441,449 ****
      }
  
    } // namespace std::tr1::__detail
- 
-   /* @} */ // group tr1_math_spec_func
- 
  }
  }
  
--- 434,439 ----
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1/special_function_util.h gcc-4.3.1/libstdc++-v3/include/tr1/special_function_util.h
*** gcc-4.3.0/libstdc++-v3/include/tr1/special_function_util.h	Thu May 31 23:37:56 2007
--- gcc-4.3.1/libstdc++-v3/include/tr1/special_function_util.h	Wed Mar 26 23:21:44 2008
***************
*** 42,48 ****
  #ifndef _GLIBCXX_TR1_SPECIAL_FUNCTION_UTIL_H
  #define _GLIBCXX_TR1_SPECIAL_FUNCTION_UTIL_H 1
  
- // namespace std::tr1
  namespace std
  {
  namespace tr1
--- 42,47 ----
*************** namespace tr1
*** 51,71 ****
    namespace __detail
    {
  
!     ///
!     ///  @brief  A class to encapsulate type dependent floating point
!     ///          constants.  Not everything will be able to be expressed
!     ///          as type logic.
!     ///
!     template <typename _Tp>
      struct __floating_point_constant
      {
        static const _Tp __value;
      };
  
  
!     ///
!     ///  @brief  A structure for numeric constants.
!     ///
      template<typename _Tp>
        struct __numeric_constants
        {
--- 50,66 ----
    namespace __detail
    {
  
!     /// A class to encapsulate type dependent floating point
!     /// constants.  Not everything will be able to be expressed as
!     /// type logic.
!     template<typename _Tp>
      struct __floating_point_constant
      {
        static const _Tp __value;
      };
  
  
!     /// A structure for numeric constants.
      template<typename _Tp>
        struct __numeric_constants
        {
*************** namespace tr1
*** 111,125 ****
        };
  
  
-     ///
-     ///  @brief  This is a wrapper for the isnan function.
-     ///          Otherwise, for NaN, all comparisons result in false.
-     ///          If/when we build a std::isnan out of intrinsics, this
-     ///          will disappear completely in favor of std::isnan.
-     ///
  #if _GLIBCXX_USE_C99_MATH && !_GLIBCXX_USE_C99_FP_MACROS_DYNAMIC
  
!     template <typename _Tp>
      inline bool __isnan(const _Tp __x)
      {
        return std::isnan(__x);
--- 106,118 ----
        };
  
  
  #if _GLIBCXX_USE_C99_MATH && !_GLIBCXX_USE_C99_FP_MACROS_DYNAMIC
  
!     /// This is a wrapper for the isnan function. Otherwise, for NaN,
!     /// all comparisons result in false. If/when we build a std::isnan
!     /// out of intrinsics, this will disappear completely in favor of
!     /// std::isnan.
!     template<typename _Tp>
      inline bool __isnan(const _Tp __x)
      {
        return std::isnan(__x);
*************** namespace tr1
*** 127,145 ****
  
  #else
  
!     template <typename _Tp>
      inline bool __isnan(const _Tp __x)
      {
        return __builtin_isnan(__x);
      }
  
!     template <>
      inline bool __isnan<float>(const float __x)
      {
        return __builtin_isnanf(__x);
      }
  
!     template <>
      inline bool __isnan<long double>(const long double __x)
      {
        return __builtin_isnanl(__x);
--- 120,138 ----
  
  #else
  
!     template<typename _Tp>
      inline bool __isnan(const _Tp __x)
      {
        return __builtin_isnan(__x);
      }
  
!     template<>
      inline bool __isnan<float>(const float __x)
      {
        return __builtin_isnanf(__x);
      }
  
!     template<>
      inline bool __isnan<long double>(const long double __x)
      {
        return __builtin_isnanl(__x);
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1/tuple gcc-4.3.1/libstdc++-v3/include/tr1/tuple
*** gcc-4.3.0/libstdc++-v3/include/tr1/tuple	Fri Jan 18 08:16:51 2008
--- gcc-4.3.1/libstdc++-v3/include/tr1/tuple	Wed Mar 26 23:21:44 2008
*************** namespace tr1
*** 246,252 ****
    template<typename _Tp>
      struct tuple_size;
  
!   /// @brief class tuple_size
    template<typename... _Elements>
      struct tuple_size<tuple<_Elements...> >
      {
--- 246,252 ----
    template<typename _Tp>
      struct tuple_size;
  
!   /// class tuple_size
    template<typename... _Elements>
      struct tuple_size<tuple<_Elements...> >
      {
*************** namespace tr1
*** 329,335 ****
      {
        typedef tuple<_TElements...> _Tp;
        typedef tuple<_UElements...> _Up;
!       return (__tuple_compare<tuple_size<_Tp>::value - tuple_size<_Tp>::value,
  	      0, tuple_size<_Tp>::value, _Tp, _Up>::__eq(__t, __u));
      }
  
--- 329,335 ----
      {
        typedef tuple<_TElements...> _Tp;
        typedef tuple<_UElements...> _Up;
!       return (__tuple_compare<tuple_size<_Tp>::value - tuple_size<_Up>::value,
  	      0, tuple_size<_Tp>::value, _Tp, _Up>::__eq(__t, __u));
      }
  
*************** namespace tr1
*** 340,346 ****
      {
        typedef tuple<_TElements...> _Tp;
        typedef tuple<_UElements...> _Up;
!       return (__tuple_compare<tuple_size<_Tp>::value - tuple_size<_Tp>::value,
  	      0, tuple_size<_Tp>::value, _Tp, _Up>::__less(__t, __u));
      }
  
--- 340,346 ----
      {
        typedef tuple<_TElements...> _Tp;
        typedef tuple<_UElements...> _Up;
!       return (__tuple_compare<tuple_size<_Tp>::value - tuple_size<_Up>::value,
  	      0, tuple_size<_Tp>::value, _Tp, _Up>::__less(__t, __u));
      }
  
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1/type_traits gcc-4.3.1/libstdc++-v3/include/tr1/type_traits
*** gcc-4.3.0/libstdc++-v3/include/tr1/type_traits	Sun Nov 18 18:55:27 2007
--- gcc-4.3.1/libstdc++-v3/include/tr1/type_traits	Wed Mar 26 23:21:44 2008
*************** namespace tr1
*** 183,189 ****
    template<typename _From, typename _To,
  	   bool = (is_void<_From>::value || is_void<_To>::value
  		   || is_function<_To>::value || is_array<_To>::value
! 		   // This special case is here only to avoid warnings.		   
  		   || (is_floating_point<typename
  		       remove_reference<_From>::type>::value
  		       && __is_int_or_cref<_To>::__value))>
--- 183,189 ----
    template<typename _From, typename _To,
  	   bool = (is_void<_From>::value || is_void<_To>::value
  		   || is_function<_To>::value || is_array<_To>::value
! 		   // This special case is here only to avoid warnings.	
  		   || (is_floating_point<typename
  		       remove_reference<_From>::type>::value
  		       && __is_int_or_cref<_To>::__value))>
*************** namespace tr1
*** 206,212 ****
  			       __is_convertible_helper<_From, _To>::__value>
      { };
  
!   /// @brief  reference modifications [4.7.2].
    template<typename _Tp>
      struct remove_reference
      { typedef _Tp     type; };
--- 206,212 ----
  			       __is_convertible_helper<_From, _To>::__value>
      { };
  
!   // reference modifications [4.7.2].
    template<typename _Tp>
      struct remove_reference
      { typedef _Tp     type; };
*************** namespace tr1
*** 230,236 ****
      : public __add_reference_helper<_Tp>
      { };
  
!   /// @brief  other transformations [4.8].
    template<std::size_t _Len, std::size_t _Align>
      struct aligned_storage
      { 
--- 230,236 ----
      : public __add_reference_helper<_Tp>
      { };
  
!   // other transformations [4.8].
    template<std::size_t _Len, std::size_t _Align>
      struct aligned_storage
      { 
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1_impl/array gcc-4.3.1/libstdc++-v3/include/tr1_impl/array
*** gcc-4.3.0/libstdc++-v3/include/tr1_impl/array	Sun Nov 25 12:07:55 2007
--- gcc-4.3.1/libstdc++-v3/include/tr1_impl/array	Wed Mar 26 23:21:44 2008
*************** namespace std
*** 36,42 ****
  {
  _GLIBCXX_BEGIN_NAMESPACE_TR1
  
!   /// @brief  struct array.
    /// NB: Requires complete type _Tp.
    template<typename _Tp, std::size_t _Nm>
      struct array
--- 36,42 ----
  {
  _GLIBCXX_BEGIN_NAMESPACE_TR1
  
!   /// array.
    /// NB: Requires complete type _Tp.
    template<typename _Tp, std::size_t _Nm>
      struct array
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 216,223 ****
      { std::swap_ranges(__one.begin(), __one.end(), __two.begin()); }
  
    // Tuple interface to class template array [6.2.2.5].
!   template<typename _Tp> class tuple_size;
!   template<int _Int, typename _Tp> class tuple_element;
  
    template<typename _Tp, std::size_t _Nm>
      struct tuple_size<array<_Tp, _Nm> >
--- 216,229 ----
      { std::swap_ranges(__one.begin(), __one.end(), __two.begin()); }
  
    // Tuple interface to class template array [6.2.2.5].
! 
!   /// tuple_size
!   template<typename _Tp> 
!     class tuple_size;
! 
!   /// tuple_element
!   template<int _Int, typename _Tp> 
!     class tuple_element;
  
    template<typename _Tp, std::size_t _Nm>
      struct tuple_size<array<_Tp, _Nm> >
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1_impl/boost_shared_ptr.h gcc-4.3.1/libstdc++-v3/include/tr1_impl/boost_shared_ptr.h
*** gcc-4.3.0/libstdc++-v3/include/tr1_impl/boost_shared_ptr.h	Sat Dec 15 22:28:29 2007
--- gcc-4.3.1/libstdc++-v3/include/tr1_impl/boost_shared_ptr.h	Wed Mar 26 23:21:44 2008
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 195,201 ****
  #endif
  
    /**
!    *  @class shared_ptr <tr1/memory>
     *
     *  A smart pointer with reference-counted copy semantics.
     *  The object pointed to is deleted when the last shared_ptr pointing to
--- 195,201 ----
  #endif
  
    /**
!    *  @class __shared_ptr 
     *
     *  A smart pointer with reference-counted copy semantics.
     *  The object pointed to is deleted when the last shared_ptr pointing to
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 230,236 ****
  	}
  
        //
!       // Requirements: _Deleter's copy constructor and destructor must not throw
        //
        // __shared_ptr will release __p by calling __d(__p)
        //
--- 230,237 ----
  	}
  
        //
!       // Requirements: _Deleter's copy constructor and destructor must
!       // not throw
        //
        // __shared_ptr will release __p by calling __d(__p)
        //
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 252,259 ****
        
  #ifdef _GLIBCXX_INCLUDE_AS_CXX0X
        //
!       // 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)
        //
--- 253,261 ----
        
  #ifdef _GLIBCXX_INCLUDE_AS_CXX0X
        //
!       // 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)
        //
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 811,817 ****
      };
  
  
!   // The actual TR1 shared_ptr, with forwarding constructors and
    // assignment operators.
    template<typename _Tp>
      class shared_ptr
--- 813,820 ----
      };
  
  
!   /// shared_ptr
!   // The actual shared_ptr, with forwarding constructors and
    // assignment operators.
    template<typename _Tp>
      class shared_ptr
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 965,971 ****
      }
  
  
!   // The actual TR1 weak_ptr, with forwarding constructors and
    // assignment operators.
    template<typename _Tp>
      class weak_ptr
--- 968,975 ----
      }
  
  
!   /// weak_ptr
!   // The actual weak_ptr, with forwarding constructors and
    // assignment operators.
    template<typename _Tp>
      class weak_ptr
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 1021,1027 ****
        }
      };
  
! 
    template<typename _Tp>
      class enable_shared_from_this
      {
--- 1025,1031 ----
        }
      };
  
!   /// enable_shared_from_this
    template<typename _Tp>
      class enable_shared_from_this
      {
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1_impl/cmath gcc-4.3.1/libstdc++-v3/include/tr1_impl/cmath
*** gcc-4.3.0/libstdc++-v3/include/tr1_impl/cmath	Thu May 31 23:37:56 2007
--- gcc-4.3.1/libstdc++-v3/include/tr1_impl/cmath	Wed Mar 26 23:21:44 2008
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 298,305 ****
  #if _GLIBCXX_USE_C99_MATH
  #if !_GLIBCXX_USE_C99_FP_MACROS_DYNAMIC
  
!   /// @brief Function template definitions [8.16.3].
!   //
    using std::signbit;
    
    using std::fpclassify;
--- 298,304 ----
  #if _GLIBCXX_USE_C99_MATH
  #if !_GLIBCXX_USE_C99_FP_MACROS_DYNAMIC
  
!   /// Function template definitions [8.16.3].
    using std::signbit;
    
    using std::fpclassify;
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 320,327 ****
  
  #if _GLIBCXX_USE_C99_MATH_TR1
  
!   /// @brief Additional overloads [8.16.4].
!   //
    using std::acos;
  
    inline float
--- 319,325 ----
  
  #if _GLIBCXX_USE_C99_MATH_TR1
  
!   /// Additional overloads [8.16.4].
    using std::acos;
  
    inline float
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1_impl/complex gcc-4.3.1/libstdc++-v3/include/tr1_impl/complex
*** gcc-4.3.0/libstdc++-v3/include/tr1_impl/complex	Thu Nov  8 02:48:25 2007
--- gcc-4.3.1/libstdc++-v3/include/tr1_impl/complex	Wed Mar 26 23:21:44 2008
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 51,57 ****
    template<typename _Tp> std::complex<_Tp> fabs(const std::complex<_Tp>&);
  #endif
  
!   /// @brief acos(__z) [8.1.2].
    //  Effects:  Behaves the same as C99 function cacos, defined
    //            in subclause 7.3.5.1.
    template<typename _Tp>
--- 51,57 ----
    template<typename _Tp> std::complex<_Tp> fabs(const std::complex<_Tp>&);
  #endif
  
!   /// acos(__z) [8.1.2].
    //  Effects:  Behaves the same as C99 function cacos, defined
    //            in subclause 7.3.5.1.
    template<typename _Tp>
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 87,93 ****
      { return __complex_acos(__z); }
  #endif
  
!   /// @brief asin(__z) [8.1.3].
    //  Effects:  Behaves the same as C99 function casin, defined
    //            in subclause 7.3.5.2.
    template<typename _Tp>
--- 87,93 ----
      { return __complex_acos(__z); }
  #endif
  
!   /// asin(__z) [8.1.3].
    //  Effects:  Behaves the same as C99 function casin, defined
    //            in subclause 7.3.5.2.
    template<typename _Tp>
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 123,129 ****
      { return __complex_asin(__z); }
  #endif
    
!   /// @brief atan(__z) [8.1.4].
    //  Effects:  Behaves the same as C99 function catan, defined
    //            in subclause 7.3.5.3.
    template<typename _Tp>
--- 123,129 ----
      { return __complex_asin(__z); }
  #endif
    
!   /// atan(__z) [8.1.4].
    //  Effects:  Behaves the same as C99 function catan, defined
    //            in subclause 7.3.5.3.
    template<typename _Tp>
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 167,173 ****
      { return __complex_atan(__z); }
  #endif
  
!   /// @brief acosh(__z) [8.1.5].
    //  Effects:  Behaves the same as C99 function cacosh, defined
    //            in subclause 7.3.6.1.
    template<typename _Tp>
--- 167,173 ----
      { return __complex_atan(__z); }
  #endif
  
!   /// acosh(__z) [8.1.5].
    //  Effects:  Behaves the same as C99 function cacosh, defined
    //            in subclause 7.3.6.1.
    template<typename _Tp>
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 206,212 ****
      { return __complex_acosh(__z); }
  #endif
  
!   /// @brief asinh(__z) [8.1.6].
    //  Effects:  Behaves the same as C99 function casin, defined
    //            in subclause 7.3.6.2.
    template<typename _Tp>
--- 206,212 ----
      { return __complex_acosh(__z); }
  #endif
  
!   /// asinh(__z) [8.1.6].
    //  Effects:  Behaves the same as C99 function casin, defined
    //            in subclause 7.3.6.2.
    template<typename _Tp>
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 245,251 ****
      { return __complex_asinh(__z); }
  #endif
  
!   /// @brief atanh(__z) [8.1.7].
    //  Effects:  Behaves the same as C99 function catanh, defined
    //            in subclause 7.3.6.3.
    template<typename _Tp>
--- 245,251 ----
      { return __complex_asinh(__z); }
  #endif
  
!   /// atanh(__z) [8.1.7].
    //  Effects:  Behaves the same as C99 function catanh, defined
    //            in subclause 7.3.6.3.
    template<typename _Tp>
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 289,295 ****
      { return __complex_atanh(__z); }
  #endif
  
!   /// @brief fabs(__z) [8.1.8].
    //  Effects:  Behaves the same as C99 function cabs, defined
    //            in subclause 7.3.8.1.
    template<typename _Tp>
--- 289,295 ----
      { return __complex_atanh(__z); }
  #endif
  
!   /// fabs(__z) [8.1.8].
    //  Effects:  Behaves the same as C99 function cabs, defined
    //            in subclause 7.3.8.1.
    template<typename _Tp>
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 306,313 ****
       || (defined(_GLIBCXX_INCLUDE_AS_TR1) \
  	 && !defined(__GXX_EXPERIMENTAL_CXX0X__)))
  
!   /// @brief Additional overloads [8.1.9].
!   //
    template<typename _Tp>
      inline typename __gnu_cxx::__promote<_Tp>::__type
      arg(_Tp __x)
--- 306,312 ----
       || (defined(_GLIBCXX_INCLUDE_AS_TR1) \
  	 && !defined(__GXX_EXPERIMENTAL_CXX0X__)))
  
!   /// Additional overloads [8.1.9].
    template<typename _Tp>
      inline typename __gnu_cxx::__promote<_Tp>::__type
      arg(_Tp __x)
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1_impl/functional gcc-4.3.1/libstdc++-v3/include/tr1_impl/functional
*** gcc-4.3.0/libstdc++-v3/include/tr1_impl/functional	Fri Jan 18 08:16:51 2008
--- gcc-4.3.1/libstdc++-v3/include/tr1_impl/functional	Wed Mar 26 23:21:44 2008
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 426,431 ****
--- 426,432 ----
      : binary_function<const volatile _T1*, _T2, _Res>
      { };
  
+   /// reference_wrapper
    template<typename _Tp>
      class reference_wrapper
      : public _Reference_wrapper_base<typename remove_cv<_Tp>::type>
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 1336,1341 ****
--- 1337,1343 ----
    template<typename _Result, typename _Signature>
      const bool is_bind_expression<_Bind_result<_Result, _Signature> >::value;
  
+   /// bind
    template<typename _Functor, typename... _ArgTypes>
      inline
      _Bind<typename _Maybe_wrap_member_pointer<_Functor>::type(_ArgTypes...)>
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 1751,1756 ****
--- 1753,1759 ----
        }
      };
  
+   /// class function
    template<typename _Res, typename... _ArgTypes>
      class function<_Res(_ArgTypes...)>
      : public _Maybe_unary_or_binary_function<_Res, _ArgTypes...>,
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1_impl/functional_hash.h gcc-4.3.1/libstdc++-v3/include/tr1_impl/functional_hash.h
*** gcc-4.3.0/libstdc++-v3/include/tr1_impl/functional_hash.h	Tue Nov 20 12:34:44 2007
--- gcc-4.3.1/libstdc++-v3/include/tr1_impl/functional_hash.h	Wed Mar 26 23:21:44 2008
***************
*** 1,6 ****
  // TR1 functional -*- C++ -*-
  
! // Copyright (C) 2007 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
--- 1,6 ----
  // TR1 functional -*- C++ -*-
  
! // Copyright (C) 2007, 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
*************** namespace std
*** 36,42 ****
  {
  _GLIBCXX_BEGIN_NAMESPACE_TR1
  
!   // Class template hash.
    // Declaration of default hash functor std::tr1::hash.  The types for
    // which std::tr1::hash<T> is well-defined is in clause 6.3.3. of the PDTR.
    template<typename _Tp>
--- 36,42 ----
  {
  _GLIBCXX_BEGIN_NAMESPACE_TR1
  
!   /// Class template hash.
    // Declaration of default hash functor std::tr1::hash.  The types for
    // which std::tr1::hash<T> is well-defined is in clause 6.3.3. of the PDTR.
    template<typename _Tp>
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 46,52 ****
        operator()(_Tp __val) const;
      };
  
!   // Partial specializations for pointer types.
    template<typename _Tp>
      struct hash<_Tp*> : public std::unary_function<_Tp*, size_t>
      {
--- 46,52 ----
        operator()(_Tp __val) const;
      };
  
!   /// Partial specializations for pointer types.
    template<typename _Tp>
      struct hash<_Tp*> : public std::unary_function<_Tp*, size_t>
      {
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 55,61 ****
        { return reinterpret_cast<size_t>(__p); }
      };
  
!   // Explicit specializations for integer types.
  #define _TR1_hashtable_define_trivial_hash(_Tp) 	\
    template<>						\
      inline size_t					\
--- 55,61 ----
        { return reinterpret_cast<size_t>(__p); }
      };
  
!   /// Explicit specializations for integer types.
  #define _TR1_hashtable_define_trivial_hash(_Tp) 	\
    template<>						\
      inline size_t					\
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 81,87 ****
    // Fowler / Noll / Vo (FNV) Hash (type FNV-1a)
    // (Used by the next specializations of std::tr1::hash.)
  
!   // Dummy generic implementation (for sizeof(size_t) != 4, 8).
    template<size_t = sizeof(size_t)>
      struct _Fnv_hash
      {
--- 81,87 ----
    // Fowler / Noll / Vo (FNV) Hash (type FNV-1a)
    // (Used by the next specializations of std::tr1::hash.)
  
!   /// Dummy generic implementation (for sizeof(size_t) != 4, 8).
    template<size_t = sizeof(size_t)>
      struct _Fnv_hash
      {
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 128,134 ****
        }
      };
  
!   // Explicit specializations for floating point types.
    template<>
      inline size_t
      hash<float>::operator()(float __val) const
--- 128,134 ----
        }
      };
  
!   /// Explicit specializations for float.
    template<>
      inline size_t
      hash<float>::operator()(float __val) const
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 142,147 ****
--- 142,148 ----
        return __result;
      };
  
+   /// Explicit specializations for double.
    template<>
      inline size_t
      hash<double>::operator()(double __val) const
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 155,165 ****
  	return __result;
      };
  
    template<>
      size_t
      hash<long double>::operator()(long double __val) const;
  
!   // Explicit specialization of member operator for types that are not builtin.
    template<>
      size_t
      hash<string>::operator()(string) const;
--- 156,167 ----
  	return __result;
      };
  
+   /// Explicit specializations for long double.
    template<>
      size_t
      hash<long double>::operator()(long double __val) const;
  
!   /// Explicit specialization of member operator for non-builtin types.
    template<>
      size_t
      hash<string>::operator()(string) const;
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1_impl/random gcc-4.3.1/libstdc++-v3/include/tr1_impl/random
*** gcc-4.3.0/libstdc++-v3/include/tr1_impl/random	Thu Jan 31 18:44:55 2008
--- gcc-4.3.1/libstdc++-v3/include/tr1_impl/random	Wed Mar 26 23:21:44 2008
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 149,156 ****
    } // namespace __detail
  
    /**
!    * Produces random numbers on a given distribution function using a non-uniform
!    * random number generation engine.
     *
     * @todo the engine_value_type needs to be studied more carefully.
     */
--- 149,156 ----
    } // namespace __detail
  
    /**
!    * Produces random numbers on a given distribution function using a
!    * non-uniform random number generation engine.
     *
     * @todo the engine_value_type needs to be studied more carefully.
     */
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1_impl/regex gcc-4.3.1/libstdc++-v3/include/tr1_impl/regex
*** gcc-4.3.0/libstdc++-v3/include/tr1_impl/regex	Thu Jan 31 18:44:55 2008
--- gcc-4.3.1/libstdc++-v3/include/tr1_impl/regex	Wed Mar 26 23:21:44 2008
*************** namespace regex_constants
*** 241,247 ****
    static const match_flag_type format_first_only = 1 << _S_first_only;
  
  
!   // [7.5.3] implementation-defined error type
    enum error_type
      {
        _S_error_collate,
--- 241,247 ----
    static const match_flag_type format_first_only = 1 << _S_first_only;
  
  
!   /// [7.5.3] implementation-defined error type
    enum error_type
      {
        _S_error_collate,
*************** namespace regex_constants
*** 308,314 ****
  
    // [7.8] Class regex_error
    /**
!    * Defines the type of objects thrown as exceptions to report errors from the
     * regular expression library.
     */
    class regex_error
--- 308,314 ----
  
    // [7.8] Class regex_error
    /**
!    * Defines the exception objects thrown report errors from the
     * regular expression library.
     */
    class regex_error
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1_impl/type_traits gcc-4.3.1/libstdc++-v3/include/tr1_impl/type_traits
*** gcc-4.3.0/libstdc++-v3/include/tr1_impl/type_traits	Sun Nov 18 18:05:42 2007
--- gcc-4.3.1/libstdc++-v3/include/tr1_impl/type_traits	Wed Mar 26 23:21:44 2008
***************
*** 1,6 ****
  // TR1 type_traits -*- C++ -*-
  
! // Copyright (C) 2007 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
--- 1,6 ----
  // TR1 type_traits -*- C++ -*-
  
! // Copyright (C) 2007, 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
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 67,73 ****
    _DEFINE_SPEC_##_Order##_HELPER(_Trait<_Type volatile>, _Value)     \
    _DEFINE_SPEC_##_Order##_HELPER(_Trait<_Type const volatile>, _Value)
  
!   /// @brief  helper classes [4.3].
    template<typename _Tp, _Tp __v>
      struct integral_constant
      {
--- 67,73 ----
    _DEFINE_SPEC_##_Order##_HELPER(_Trait<_Type volatile>, _Value)     \
    _DEFINE_SPEC_##_Order##_HELPER(_Trait<_Type const volatile>, _Value)
  
!   /// helper classes [4.3].
    template<typename _Tp, _Tp __v>
      struct integral_constant
      {
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 75,92 ****
        typedef _Tp                           value_type;
        typedef integral_constant<_Tp, __v>   type;
      };
    typedef integral_constant<bool, true>     true_type;
    typedef integral_constant<bool, false>    false_type;
  
    template<typename _Tp, _Tp __v>
      const _Tp integral_constant<_Tp, __v>::value;
  
!   /// @brief  primary type categories [4.5.1].
    template<typename>
      struct is_void
      : public false_type { };
    _DEFINE_SPEC(0, is_void, void, true)
  
    template<typename>
      struct is_integral
      : public false_type { };
--- 75,97 ----
        typedef _Tp                           value_type;
        typedef integral_constant<_Tp, __v>   type;
      };
+   
+   /// typedef for true_type
    typedef integral_constant<bool, true>     true_type;
+ 
+   /// typedef for true_type
    typedef integral_constant<bool, false>    false_type;
  
    template<typename _Tp, _Tp __v>
      const _Tp integral_constant<_Tp, __v>::value;
  
!   /// primary type categories [4.5.1].
    template<typename>
      struct is_void
      : public false_type { };
    _DEFINE_SPEC(0, is_void, void, true)
  
+   /// is_integral
    template<typename>
      struct is_integral
      : public false_type { };
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 106,111 ****
--- 111,117 ----
    _DEFINE_SPEC(0, is_integral, long long, true)
    _DEFINE_SPEC(0, is_integral, unsigned long long, true)
  
+   /// is_floating_point
    template<typename>
      struct is_floating_point
      : public false_type { };
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 113,118 ****
--- 119,125 ----
    _DEFINE_SPEC(0, is_floating_point, double, true)
    _DEFINE_SPEC(0, is_floating_point, long double, true)
  
+   /// is_array
    template<typename>
      struct is_array
      : public false_type { };
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 125,202 ****
      struct is_array<_Tp[]>
      : public true_type { };
  
    template<typename>
      struct is_pointer
      : public false_type { };
    _DEFINE_SPEC(1, is_pointer, _Tp*, true)
  
    template<typename _Tp>
      struct is_reference;
  
    template<typename _Tp>
      struct is_function;
  
    template<typename>
      struct is_member_object_pointer
      : public false_type { };
    _DEFINE_SPEC(2, is_member_object_pointer, _Tp _Cp::*,
  	       !is_function<_Tp>::value)
  
    template<typename>
      struct is_member_function_pointer
      : public false_type { };
    _DEFINE_SPEC(2, is_member_function_pointer, _Tp _Cp::*,
  	       is_function<_Tp>::value)
  
    template<typename _Tp>
      struct is_enum
      : public integral_constant<bool, __is_enum(_Tp)>
      { };
  
    template<typename _Tp>
      struct is_union
      : public integral_constant<bool, __is_union(_Tp)>
      { };
  
    template<typename _Tp>
      struct is_class
      : public integral_constant<bool, __is_class(_Tp)>
      { };
  
!   template<typename>
!     struct __is_function_helper
!     : public false_type { };
! 
!   template<typename _Res, typename... _ArgTypes>
!     struct __is_function_helper<_Res(_ArgTypes...)>
!     : public true_type { };
! 
!   template<typename _Res, typename... _ArgTypes>
!     struct __is_function_helper<_Res(_ArgTypes......)>
!     : public true_type { };
  
    template<typename _Tp>
!     struct remove_cv;
  
    template<typename _Tp>
      struct is_function
!     : public integral_constant<bool, (__is_function_helper<typename
! 				      remove_cv<_Tp>::type>::value)>
      { };
  
!   /// @brief  composite type traits [4.5.2].
    template<typename _Tp>
      struct is_arithmetic
      : public integral_constant<bool, (is_integral<_Tp>::value
  				      || is_floating_point<_Tp>::value)>
      { };
  
    template<typename _Tp>
      struct is_fundamental
      : public integral_constant<bool, (is_arithmetic<_Tp>::value
  				      || is_void<_Tp>::value)>
      { };
  
    template<typename _Tp>
      struct is_object
      : public integral_constant<bool, !(is_function<_Tp>::value
--- 132,225 ----
      struct is_array<_Tp[]>
      : public true_type { };
  
+   /// is_pointer
    template<typename>
      struct is_pointer
      : public false_type { };
    _DEFINE_SPEC(1, is_pointer, _Tp*, true)
  
+   /// is_reference
    template<typename _Tp>
      struct is_reference;
  
+   /// is_function
    template<typename _Tp>
      struct is_function;
  
+   /// is_member_object_pointer
    template<typename>
      struct is_member_object_pointer
      : public false_type { };
    _DEFINE_SPEC(2, is_member_object_pointer, _Tp _Cp::*,
  	       !is_function<_Tp>::value)
  
+   /// is_member_function_pointer
    template<typename>
      struct is_member_function_pointer
      : public false_type { };
    _DEFINE_SPEC(2, is_member_function_pointer, _Tp _Cp::*,
  	       is_function<_Tp>::value)
  
+   /// is_enum
    template<typename _Tp>
      struct is_enum
      : public integral_constant<bool, __is_enum(_Tp)>
      { };
  
+   /// is_union
    template<typename _Tp>
      struct is_union
      : public integral_constant<bool, __is_union(_Tp)>
      { };
  
+   /// is_class
    template<typename _Tp>
      struct is_class
      : public integral_constant<bool, __is_class(_Tp)>
      { };
  
!   template<typename _Tp>
!     struct __in_array
!     : public __sfinae_types
!     {
!     private:
!       template<typename _Up>
!         static __one __test(_Up(*)[1]);
!       template<typename>
!         static __two __test(...);
!     
!     public:
!       static const bool __value = sizeof(__test<_Tp>(0)) == 1;
!     };
  
+   /// is_abstract
    template<typename _Tp>
!     struct is_abstract;
  
+   /// is_function
    template<typename _Tp>
      struct is_function
!     : public integral_constant<bool, !(__in_array<_Tp>::__value
! 				       || is_abstract<_Tp>::value
! 				       || is_reference<_Tp>::value
! 				       || is_void<_Tp>::value)>
      { };
  
!   /// composite type traits [4.5.2].
    template<typename _Tp>
      struct is_arithmetic
      : public integral_constant<bool, (is_integral<_Tp>::value
  				      || is_floating_point<_Tp>::value)>
      { };
  
+   /// is_fundamental
    template<typename _Tp>
      struct is_fundamental
      : public integral_constant<bool, (is_arithmetic<_Tp>::value
  				      || is_void<_Tp>::value)>
      { };
  
+   /// is_object
    template<typename _Tp>
      struct is_object
      : public integral_constant<bool, !(is_function<_Tp>::value
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 204,212 ****
--- 227,237 ----
  				       || is_void<_Tp>::value)>
      { };
  
+   /// is_member_pointer
    template<typename _Tp>
      struct is_member_pointer;
  
+   /// is_scalal
    template<typename _Tp>
      struct is_scalar
      : public integral_constant<bool, (is_arithmetic<_Tp>::value
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 215,224 ****
--- 240,251 ----
  				      || is_member_pointer<_Tp>::value)>
      { };
  
+   /// is_compound
    template<typename _Tp>
      struct is_compound
      : public integral_constant<bool, !is_fundamental<_Tp>::value> { };
  
+   /// is_member_pointer
    template<typename _Tp>
      struct is_member_pointer
      : public integral_constant<bool,
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 226,240 ****
  				|| is_member_function_pointer<_Tp>::value)>
      { };
  
!   /// @brief  type properties [4.5.3].
    template<typename>
      struct is_const
      : public false_type { };
  
    template<typename _Tp>
      struct is_const<_Tp const>
      : public true_type { };
    
    template<typename>
      struct is_volatile
      : public false_type { };
--- 253,269 ----
  				|| is_member_function_pointer<_Tp>::value)>
      { };
  
!   /// type properties [4.5.3].
    template<typename>
      struct is_const
      : public false_type { };
  
+   /// is_const
    template<typename _Tp>
      struct is_const<_Tp const>
      : public true_type { };
    
+   /// is_volatile
    template<typename>
      struct is_volatile
      : public false_type { };
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 243,272 ****
--- 272,307 ----
      struct is_volatile<_Tp volatile>
      : public true_type { };
  
+   /// is_empty
    template<typename _Tp>
      struct is_empty
      : public integral_constant<bool, __is_empty(_Tp)>
      { };
  
+   /// is_polymorphic
    template<typename _Tp>
      struct is_polymorphic
      : public integral_constant<bool, __is_polymorphic(_Tp)>
      { };
  
+   /// is_abstract
    template<typename _Tp>
      struct is_abstract
      : public integral_constant<bool, __is_abstract(_Tp)>
      { };
  
+   /// has_virtual_destructor
    template<typename _Tp>
      struct has_virtual_destructor
      : public integral_constant<bool, __has_virtual_destructor(_Tp)>
      { };
  
+   /// alignment_of
    template<typename _Tp>
      struct alignment_of
      : public integral_constant<std::size_t, __alignof__(_Tp)> { };
    
+   /// rank
    template<typename>
      struct rank
      : public integral_constant<std::size_t, 0> { };
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 279,284 ****
--- 314,320 ----
      struct rank<_Tp[]>
      : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
  
+   /// extent
    template<typename, unsigned _Uint = 0>
      struct extent
      : public integral_constant<std::size_t, 0> { };
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 297,303 ****
  						       _Uint - 1>::value>
      { };
  
!   /// @brief  relationships between types [4.6].
    template<typename, typename>
      struct is_same
      : public false_type { };
--- 333,339 ----
  						       _Uint - 1>::value>
      { };
  
!   /// relationships between types [4.6].
    template<typename, typename>
      struct is_same
      : public false_type { };
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 306,312 ****
      struct is_same<_Tp, _Tp>
      : public true_type { };
  
!   /// @brief  const-volatile modifications [4.7.1].
    template<typename _Tp>
      struct remove_const
      { typedef _Tp     type; };
--- 342,348 ----
      struct is_same<_Tp, _Tp>
      : public true_type { };
  
!   /// const-volatile modifications [4.7.1].
    template<typename _Tp>
      struct remove_const
      { typedef _Tp     type; };
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 315,320 ****
--- 351,357 ----
      struct remove_const<_Tp const>
      { typedef _Tp     type; };
    
+   /// remove_volatile
    template<typename _Tp>
      struct remove_volatile
      { typedef _Tp     type; };
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 323,328 ****
--- 360,366 ----
      struct remove_volatile<_Tp volatile>
      { typedef _Tp     type; };
    
+   /// remove_cv
    template<typename _Tp>
      struct remove_cv
      {
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 330,343 ****
--- 368,384 ----
        remove_const<typename remove_volatile<_Tp>::type>::type     type;
      };
    
+   /// add_const
    template<typename _Tp>
      struct add_const
      { typedef _Tp const     type; };
     
+   /// add_volatile
    template<typename _Tp>
      struct add_volatile
      { typedef _Tp volatile     type; };
    
+   /// add_cv
    template<typename _Tp>
      struct add_cv
      {
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 345,351 ****
        add_const<typename add_volatile<_Tp>::type>::type     type;
      };
  
!   /// @brief  array modifications [4.7.3].
    template<typename _Tp>
      struct remove_extent
      { typedef _Tp     type; };
--- 386,392 ----
        add_const<typename add_volatile<_Tp>::type>::type     type;
      };
  
!   /// array modifications [4.7.3].
    template<typename _Tp>
      struct remove_extent
      { typedef _Tp     type; };
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 358,363 ****
--- 399,405 ----
      struct remove_extent<_Tp[]>
      { typedef _Tp     type; };
  
+   /// remove_all_extents
    template<typename _Tp>
      struct remove_all_extents
      { typedef _Tp     type; };
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 370,388 ****
      struct remove_all_extents<_Tp[]>
      { typedef typename remove_all_extents<_Tp>::type     type; };
  
!   /// @brief  pointer modifications [4.7.4].
  #undef _DEFINE_SPEC_BODY
  #define _DEFINE_SPEC_BODY(_Value)      \
      { typedef _Tp     type; };
  
    template<typename _Tp>
      struct remove_pointer
      { typedef _Tp     type; };
    _DEFINE_SPEC(1, remove_pointer, _Tp*, false)
  
    template<typename _Tp>
      struct remove_reference;
  
    template<typename _Tp>
      struct add_pointer
      { typedef typename remove_reference<_Tp>::type*     type; };
--- 412,433 ----
      struct remove_all_extents<_Tp[]>
      { typedef typename remove_all_extents<_Tp>::type     type; };
  
!   /// pointer modifications [4.7.4].
  #undef _DEFINE_SPEC_BODY
  #define _DEFINE_SPEC_BODY(_Value)      \
      { typedef _Tp     type; };
  
+   /// remove_pointer
    template<typename _Tp>
      struct remove_pointer
      { typedef _Tp     type; };
    _DEFINE_SPEC(1, remove_pointer, _Tp*, false)
  
+   /// remove_reference
    template<typename _Tp>
      struct remove_reference;
  
+   /// add_pointer
    template<typename _Tp>
      struct add_pointer
      { typedef typename remove_reference<_Tp>::type*     type; };
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1_impl/unordered_map gcc-4.3.1/libstdc++-v3/include/tr1_impl/unordered_map
*** gcc-4.3.0/libstdc++-v3/include/tr1_impl/unordered_map	Sun Nov 25 18:09:31 2007
--- gcc-4.3.1/libstdc++-v3/include/tr1_impl/unordered_map	Wed Mar 26 23:21:44 2008
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 168,173 ****
--- 168,174 ----
      { __x.swap(__y); }
  
  
+   /// class unordered_map
    template<class _Key, class _Tp,
  	   class _Hash = hash<_Key>,
  	   class _Pred = std::equal_to<_Key>,
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 215,220 ****
--- 216,222 ----
  #endif
      };
    
+   /// class unordered_multimap
    template<class _Key, class _Tp,
  	   class _Hash = hash<_Key>,
  	   class _Pred = std::equal_to<_Key>,
diff -Nrcpad gcc-4.3.0/libstdc++-v3/include/tr1_impl/unordered_set gcc-4.3.1/libstdc++-v3/include/tr1_impl/unordered_set
*** gcc-4.3.0/libstdc++-v3/include/tr1_impl/unordered_set	Sun Nov 25 18:09:31 2007
--- gcc-4.3.1/libstdc++-v3/include/tr1_impl/unordered_set	Wed Mar 26 23:21:44 2008
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 150,159 ****
    template<class _Value, class _Hash, class _Pred, class _Alloc,
  	   bool __cache_hash_code>
      inline void
!     swap (__unordered_set<_Value, _Hash, _Pred,
! 	  _Alloc, __cache_hash_code>& __x,
! 	  __unordered_set<_Value, _Hash, _Pred,
! 	  _Alloc, __cache_hash_code>& __y)
      { __x.swap(__y); }
  
    template<class _Value, class _Hash, class _Pred, class _Alloc,
--- 150,157 ----
    template<class _Value, class _Hash, class _Pred, class _Alloc,
  	   bool __cache_hash_code>
      inline void
!     swap(__unordered_set<_Value, _Hash, _Pred, _Alloc, __cache_hash_code>& __x,
! 	 __unordered_set<_Value, _Hash, _Pred, _Alloc, __cache_hash_code>& __y)
      { __x.swap(__y); }
  
    template<class _Value, class _Hash, class _Pred, class _Alloc,
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 166,171 ****
--- 164,170 ----
      { __x.swap(__y); }
  
  
+   /// class unordered_set
    template<class _Value,
  	   class _Hash = hash<_Value>,
  	   class _Pred = std::equal_to<_Value>,
*************** _GLIBCXX_BEGIN_NAMESPACE_TR1
*** 213,218 ****
--- 212,218 ----
  #endif
      };
  
+   /// class unordered_multiset
    template<class _Value,
  	   class _Hash = hash<_Value>,
  	   class _Pred = std::equal_to<_Value>,
diff -Nrcpad gcc-4.3.0/libstdc++-v3/scripts/run_doxygen gcc-4.3.1/libstdc++-v3/scripts/run_doxygen
*** gcc-4.3.0/libstdc++-v3/scripts/run_doxygen	Mon Feb 11 00:01:33 2008
--- gcc-4.3.1/libstdc++-v3/scripts/run_doxygen	Wed Mar 26 23:21:44 2008
***************
*** 10,16 ****
  
  
  # We can check now that the version of doxygen is >= this variable.
! DOXYVER=1.5.4
  
  find_doxygen() {
      local -r v_required=`echo $DOXYVER |  \
--- 10,16 ----
  
  
  # We can check now that the version of doxygen is >= this variable.
! DOXYVER=1.5.1
  
  find_doxygen() {
      local -r v_required=`echo $DOXYVER |  \
*************** fi
*** 156,162 ****
        -e "s=@srcdir@=${srcdir}=g" \
        -e "s=@builddir@=${builddir}=g" \
        -e "s=@host_alias@=${host_alias}=g" \
-       -e "s=@html_output_dir@=html=" \
        -e "s=@enabled_sections@=${enabled_sections}=" \
        -e "s=@do_html@=${do_html}=" \
        -e "s=@do_man@=${do_man}=" \
--- 156,161 ----
diff -Nrcpad gcc-4.3.0/libstdc++-v3/testsuite/20_util/make_signed/requirements/typedefs-1.cc gcc-4.3.1/libstdc++-v3/testsuite/20_util/make_signed/requirements/typedefs-1.cc
*** gcc-4.3.0/libstdc++-v3/testsuite/20_util/make_signed/requirements/typedefs-1.cc	Wed May 16 16:47:47 2007
--- gcc-4.3.1/libstdc++-v3/testsuite/20_util/make_signed/requirements/typedefs-1.cc	Mon May  5 17:23:43 2008
***************
*** 2,8 ****
  
  // 2007-05-03  Benjamin Kosnik  <bkoz@redhat.com>
  //
! // Copyright (C) 2007 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
--- 2,8 ----
  
  // 2007-05-03  Benjamin Kosnik  <bkoz@redhat.com>
  //
! // Copyright (C) 2007, 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
*************** void test01()
*** 30,35 ****
--- 30,36 ----
    bool test __attribute__((unused)) = true;
    using std::make_signed;
    using std::is_same;
+   using std::is_signed;
  
    // Positive tests.
    typedef make_signed<const int>::type  	test2_type;
*************** void test01()
*** 52,59 ****
    VERIFY( (is_same<test23_type, volatile signed wchar_t>::value) );
  #endif
  
    typedef make_signed<test_enum>::type  	test25_type;
!   VERIFY( (is_same<test25_type, int>::value) );
  }
  
  int main()
--- 53,62 ----
    VERIFY( (is_same<test23_type, volatile signed wchar_t>::value) );
  #endif
  
+   // Chapter 48, chapter 20. Smallest rank such that new signed type same size.
    typedef make_signed<test_enum>::type  	test25_type;
!   VERIFY( is_signed<test25_type>::value );
!   VERIFY( sizeof(test25_type) == sizeof(test_enum) );
  }
  
  int main()
diff -Nrcpad gcc-4.3.0/libstdc++-v3/testsuite/20_util/make_signed/requirements/typedefs_neg.cc gcc-4.3.1/libstdc++-v3/testsuite/20_util/make_signed/requirements/typedefs_neg.cc
*** gcc-4.3.0/libstdc++-v3/testsuite/20_util/make_signed/requirements/typedefs_neg.cc	Mon Sep 17 10:18:51 2007
--- gcc-4.3.1/libstdc++-v3/testsuite/20_util/make_signed/requirements/typedefs_neg.cc	Wed Mar 26 23:21:44 2008
*************** void test01()
*** 49,56 ****
  // { dg-error "instantiated from here" "" { target *-*-* } 41 }
  // { dg-error "instantiated from here" "" { target *-*-* } 43 }
  
! // { dg-error "invalid use of incomplete type" "" { target *-*-* } 511 }
! // { dg-error "declaration of" "" { target *-*-* } 477 }
  
  // { dg-excess-errors "At global scope" }
  // { dg-excess-errors "In instantiation of" }
--- 49,56 ----
  // { dg-error "instantiated from here" "" { target *-*-* } 41 }
  // { dg-error "instantiated from here" "" { target *-*-* } 43 }
  
! // { dg-error "invalid use of incomplete type" "" { target *-*-* } 549 }
! // { dg-error "declaration of" "" { target *-*-* } 515 }
  
  // { dg-excess-errors "At global scope" }
  // { dg-excess-errors "In instantiation of" }
diff -Nrcpad gcc-4.3.0/libstdc++-v3/testsuite/20_util/make_unsigned/requirements/typedefs-1.cc gcc-4.3.1/libstdc++-v3/testsuite/20_util/make_unsigned/requirements/typedefs-1.cc
*** gcc-4.3.0/libstdc++-v3/testsuite/20_util/make_unsigned/requirements/typedefs-1.cc	Mon Jul  2 13:11:13 2007
--- gcc-4.3.1/libstdc++-v3/testsuite/20_util/make_unsigned/requirements/typedefs-1.cc	Mon May  5 17:23:43 2008
***************
*** 2,8 ****
  
  // 2007-05-03  Benjamin Kosnik  <bkoz@redhat.com>
  //
! // Copyright (C) 2007 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
--- 2,8 ----
  
  // 2007-05-03  Benjamin Kosnik  <bkoz@redhat.com>
  //
! // Copyright (C) 2007, 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
*************** void test01()
*** 30,35 ****
--- 30,36 ----
    bool test __attribute__((unused)) = true;
    using std::make_unsigned;
    using std::is_same;
+   using std::is_unsigned;
  
    // Positive tests.
    typedef make_unsigned<const unsigned int>::type  	test2_type;
*************** void test01()
*** 52,59 ****
    VERIFY( (is_same<test23_type, volatile wchar_t>::value) );
  #endif
  
    typedef make_unsigned<test_enum>::type  	test25_type;
!   VERIFY( (is_same<test25_type, unsigned int>::value) );
  }
  
  int main()
--- 53,63 ----
    VERIFY( (is_same<test23_type, volatile wchar_t>::value) );
  #endif
  
+   // Chapter 48, chapter 20. Smallest rank such that new unsigned type
+   // same size.
    typedef make_unsigned<test_enum>::type  	test25_type;
!   VERIFY( is_unsigned<test25_type>::value );
!   VERIFY( sizeof(test25_type) == sizeof(test_enum) );
  }
  
  int main()
diff -Nrcpad gcc-4.3.0/libstdc++-v3/testsuite/20_util/make_unsigned/requirements/typedefs_neg.cc gcc-4.3.1/libstdc++-v3/testsuite/20_util/make_unsigned/requirements/typedefs_neg.cc
*** gcc-4.3.0/libstdc++-v3/testsuite/20_util/make_unsigned/requirements/typedefs_neg.cc	Mon Sep 17 10:18:51 2007
--- gcc-4.3.1/libstdc++-v3/testsuite/20_util/make_unsigned/requirements/typedefs_neg.cc	Wed Mar 26 23:21:44 2008
*************** void test01()
*** 49,56 ****
  // { dg-error "instantiated from here" "" { target *-*-* } 41 }
  // { dg-error "instantiated from here" "" { target *-*-* } 43 }
  
! // { dg-error "invalid use of incomplete type" "" { target *-*-* } 436 }
! // { dg-error "declaration of" "" { target *-*-* } 402 }
  
  // { dg-excess-errors "At global scope" }
  // { dg-excess-errors "In instantiation of" }
--- 49,56 ----
  // { dg-error "instantiated from here" "" { target *-*-* } 41 }
  // { dg-error "instantiated from here" "" { target *-*-* } 43 }
  
! // { dg-error "invalid use of incomplete type" "" { target *-*-* } 474 }
! // { dg-error "declaration of" "" { target *-*-* } 440 }
  
  // { dg-excess-errors "At global scope" }
  // { dg-excess-errors "In instantiation of" }
diff -Nrcpad gcc-4.3.0/libstdc++-v3/testsuite/20_util/tuple/comparison_operators/35480.cc gcc-4.3.1/libstdc++-v3/testsuite/20_util/tuple/comparison_operators/35480.cc
*** gcc-4.3.0/libstdc++-v3/testsuite/20_util/tuple/comparison_operators/35480.cc	Thu Jan  1 00:00:00 1970
--- gcc-4.3.1/libstdc++-v3/testsuite/20_util/tuple/comparison_operators/35480.cc	Thu Mar  6 18:35:37 2008
***************
*** 0 ****
--- 1,34 ----
+ // { dg-options "-std=gnu++0x" }
+ // { dg-do compile }
+ 
+ // Copyright (C) 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 2, 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.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING.  If not, write to the Free
+ // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
+ // USA.
+ 
+ // Tuple
+ 
+ #include <tuple>
+ 
+ // libstdc++/35480
+ void test01()
+ {
+   std::tuple<int> t1( 1 );
+   std::tuple<int, int> t2( 1, 2 );
+   if ( t1 < t2 ) {}   // { dg-error "here" }
+   if ( t1 == t2 ) {}  // { dg-error "here" }
+ }
+ // { dg-excess-errors "incomplete type" }
diff -Nrcpad gcc-4.3.0/libstdc++-v3/testsuite/23_containers/unordered_map/requirements/debug.cc gcc-4.3.1/libstdc++-v3/testsuite/23_containers/unordered_map/requirements/debug.cc
*** gcc-4.3.0/libstdc++-v3/testsuite/23_containers/unordered_map/requirements/debug.cc	Thu Oct 18 15:22:58 2007
--- gcc-4.3.1/libstdc++-v3/testsuite/23_containers/unordered_map/requirements/debug.cc	Thu Jan  1 00:00:00 1970
***************
*** 1,39 ****
- // { dg-options "-std=gnu++0x" }
- // { dg-do compile }
- 
- // Copyright (C) 2007 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 2, 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.
- 
- // You should have received a copy of the GNU General Public License along
- // with this library; see the file COPYING.  If not, write to the Free
- // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
- // USA.
- 
- #include <string>
- #include <debug/unordered_map>
- 
- using namespace __gnu_debug;
- 
- using std::allocator;
- using std::equal_to;
- using std::hash;
- using std::pair;
- using std::string;
- 
- template class unordered_map<string, float>;
- template class unordered_map<string, int,
- 			     hash<string>, equal_to<string>, 
- 			     allocator<pair<const string, int> > >;
- template class unordered_map<string, float,
- 			     hash<string>, equal_to<string>, 
- 			     allocator<char> >;
--- 0 ----
diff -Nrcpad gcc-4.3.0/libstdc++-v3/testsuite/23_containers/unordered_map/requirements/debug_container.cc gcc-4.3.1/libstdc++-v3/testsuite/23_containers/unordered_map/requirements/debug_container.cc
*** gcc-4.3.0/libstdc++-v3/testsuite/23_containers/unordered_map/requirements/debug_container.cc	Thu Jan  1 00:00:00 1970
--- gcc-4.3.1/libstdc++-v3/testsuite/23_containers/unordered_map/requirements/debug_container.cc	Tue Apr 29 19:44:18 2008
***************
*** 0 ****
--- 1,39 ----
+ // { dg-options "-std=gnu++0x" }
+ // { dg-do compile }
+ 
+ // Copyright (C) 2007 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 2, 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.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING.  If not, write to the Free
+ // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
+ // USA.
+ 
+ #include <string>
+ #include <debug/unordered_map>
+ 
+ using namespace __gnu_debug;
+ 
+ using std::allocator;
+ using std::equal_to;
+ using std::hash;
+ using std::pair;
+ using std::string;
+ 
+ template class unordered_map<string, float>;
+ template class unordered_map<string, int,
+ 			     hash<string>, equal_to<string>, 
+ 			     allocator<pair<const string, int> > >;
+ template class unordered_map<string, float,
+ 			     hash<string>, equal_to<string>, 
+ 			     allocator<char> >;
diff -Nrcpad gcc-4.3.0/libstdc++-v3/testsuite/23_containers/unordered_map/requirements/debug_mode.cc gcc-4.3.1/libstdc++-v3/testsuite/23_containers/unordered_map/requirements/debug_mode.cc
*** gcc-4.3.0/libstdc++-v3/testsuite/23_containers/unordered_map/requirements/debug_mode.cc	Thu Jan  1 00:00:00 1970
--- gcc-4.3.1/libstdc++-v3/testsuite/23_containers/unordered_map/requirements/debug_mode.cc	Tue Apr 29 19:44:18 2008
***************
*** 0 ****
--- 1,38 ----
+ // { dg-options "-std=gnu++0x -D_GLIBCXX_DEBUG" }
+ // { dg-do compile }
+ 
+ // Copyright (C) 2007 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 2, 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.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING.  If not, write to the Free
+ // Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+ // USA.
+ 
+ // As a special exception, you may use this file as part of a free software
+ // library without restriction.  Specifically, if other files instantiate
+ // templates or use macros or inline functions from this file, or you compile
+ // this file and link it with other files to produce an executable, this
+ // file does not by itself cause the resulting executable to be covered by
+ // the GNU General Public License.  This exception does not however
+ // invalidate any other reasons why the executable file might be covered by
+ // the GNU General Public License.
+ 
+ #include <unordered_map>
+ 
+ // PR libstdc++/35922
+ int main()
+ {
+   std::unordered_map<int, int> m;
+ }
+ 
diff -Nrcpad gcc-4.3.0/libstdc++-v3/testsuite/23_containers/unordered_set/requirements/debug.cc gcc-4.3.1/libstdc++-v3/testsuite/23_containers/unordered_set/requirements/debug.cc
*** gcc-4.3.0/libstdc++-v3/testsuite/23_containers/unordered_set/requirements/debug.cc	Thu Oct 18 15:22:58 2007
--- gcc-4.3.1/libstdc++-v3/testsuite/23_containers/unordered_set/requirements/debug.cc	Thu Jan  1 00:00:00 1970
***************
*** 1,26 ****
- // { dg-options "-std=gnu++0x" }
- // { dg-do compile }
- 
- // Copyright (C) 2007 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 2, 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.
- //
- // You should have received a copy of the GNU General Public License
- // along with this library; see the file COPYING.  If not, write to
- // the Free Software Foundation, 51 Franklin Street, Fifth Floor,
- // Boston, MA 02110-1301, USA.
- 
- #include <debug/unordered_set>
- 
- using namespace __gnu_debug;
- 
- template class unordered_set<int>;
--- 0 ----
diff -Nrcpad gcc-4.3.0/libstdc++-v3/testsuite/23_containers/unordered_set/requirements/debug_container.cc gcc-4.3.1/libstdc++-v3/testsuite/23_containers/unordered_set/requirements/debug_container.cc
*** gcc-4.3.0/libstdc++-v3/testsuite/23_containers/unordered_set/requirements/debug_container.cc	Thu Jan  1 00:00:00 1970
--- gcc-4.3.1/libstdc++-v3/testsuite/23_containers/unordered_set/requirements/debug_container.cc	Tue Apr 29 19:44:18 2008
***************
*** 0 ****
--- 1,26 ----
+ // { dg-options "-std=gnu++0x" }
+ // { dg-do compile }
+ 
+ // Copyright (C) 2007 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 2, 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.
+ //
+ // You should have received a copy of the GNU General Public License
+ // along with this library; see the file COPYING.  If not, write to
+ // the Free Software Foundation, 51 Franklin Street, Fifth Floor,
+ // Boston, MA 02110-1301, USA.
+ 
+ #include <debug/unordered_set>
+ 
+ using namespace __gnu_debug;
+ 
+ template class unordered_set<int>;
diff -Nrcpad gcc-4.3.0/libstdc++-v3/testsuite/23_containers/unordered_set/requirements/debug_mode.cc gcc-4.3.1/libstdc++-v3/testsuite/23_containers/unordered_set/requirements/debug_mode.cc
*** gcc-4.3.0/libstdc++-v3/testsuite/23_containers/unordered_set/requirements/debug_mode.cc	Thu Jan  1 00:00:00 1970
--- gcc-4.3.1/libstdc++-v3/testsuite/23_containers/unordered_set/requirements/debug_mode.cc	Tue Apr 29 19:44:18 2008
***************
*** 0 ****
--- 1,38 ----
+ // { dg-options "-std=gnu++0x -D_GLIBCXX_DEBUG" }
+ // { dg-do compile }
+ 
+ // Copyright (C) 2007 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 2, 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.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING.  If not, write to the Free
+ // Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+ // USA.
+ 
+ // As a special exception, you may use this file as part of a free software
+ // library without restriction.  Specifically, if other files instantiate
+ // templates or use macros or inline functions from this file, or you compile
+ // this file and link it with other files to produce an executable, this
+ // file does not by itself cause the resulting executable to be covered by
+ // the GNU General Public License.  This exception does not however
+ // invalidate any other reasons why the executable file might be covered by
+ // the GNU General Public License.
+ 
+ #include <unordered_set>
+ 
+ // PR libstdc++/35922
+ int main()
+ {
+   std::unordered_set<int> s;
+ }
+ 
diff -Nrcpad gcc-4.3.0/libstdc++-v3/testsuite/25_algorithms/fill/35725.cc gcc-4.3.1/libstdc++-v3/testsuite/25_algorithms/fill/35725.cc
*** gcc-4.3.0/libstdc++-v3/testsuite/25_algorithms/fill/35725.cc	Thu Jan  1 00:00:00 1970
--- gcc-4.3.1/libstdc++-v3/testsuite/25_algorithms/fill/35725.cc	Sat Mar 29 22:38:36 2008
***************
*** 0 ****
--- 1,30 ----
+ // { dg-do compile }
+ 
+ // Copyright (C) 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 2, 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.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING.  If not, write to the Free
+ // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
+ // USA.
+ 
+ #include <string>
+ #include <vector>
+ #include <algorithm>
+ 
+ // libstdc++/35725
+ void test01()
+ {
+   std::vector<std::string> foo(20);  
+   std::fill(foo.begin(), foo.end(), "bar");
+ }
diff -Nrcpad gcc-4.3.0/libstdc++-v3/testsuite/25_algorithms/fill_n/35725.cc gcc-4.3.1/libstdc++-v3/testsuite/25_algorithms/fill_n/35725.cc
*** gcc-4.3.0/libstdc++-v3/testsuite/25_algorithms/fill_n/35725.cc	Thu Jan  1 00:00:00 1970
--- gcc-4.3.1/libstdc++-v3/testsuite/25_algorithms/fill_n/35725.cc	Sat Mar 29 22:38:36 2008
***************
*** 0 ****
--- 1,30 ----
+ // { dg-do compile }
+ 
+ // Copyright (C) 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 2, 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.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING.  If not, write to the Free
+ // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
+ // USA.
+ 
+ #include <string>
+ #include <vector>
+ #include <algorithm>
+ 
+ // libstdc++/35725
+ void test01()
+ {
+   std::vector<std::string> foo(20);  
+   std::fill_n(foo.begin(), 20, "bar");
+ }
diff -Nrcpad gcc-4.3.0/libstdc++-v3/testsuite/25_algorithms/set_difference/35541.cc gcc-4.3.1/libstdc++-v3/testsuite/25_algorithms/set_difference/35541.cc
*** gcc-4.3.0/libstdc++-v3/testsuite/25_algorithms/set_difference/35541.cc	Thu Jan  1 00:00:00 1970
--- gcc-4.3.1/libstdc++-v3/testsuite/25_algorithms/set_difference/35541.cc	Thu Mar 13 17:36:02 2008
***************
*** 0 ****
--- 1,36 ----
+ // Copyright (C) 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 2, 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.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING.  If not, write to the Free
+ // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
+ // USA.
+ 
+ // { dg-options "-D_GLIBCXX_DEBUG" }
+ // { dg-do compile }
+ 
+ // libstdc++/35541
+ 
+ #include <set>
+ #include <iterator>
+ #include <algorithm>
+ 
+ void test01()
+ {
+   std::set<std::pair<unsigned,int> > mFactors;
+   std::set<std::pair<unsigned,int> > secondFactor;
+   std::set_difference(mFactors.begin(), mFactors.end(),
+ 		      mFactors.begin(), mFactors.end(),
+ 		      std::insert_iterator<std::set<std::pair<unsigned,int> > >
+ 		      (secondFactor, secondFactor.end())); 
+ }
diff -Nrcpad gcc-4.3.0/libstdc++-v3/testsuite/25_algorithms/sort/35588.cc gcc-4.3.1/libstdc++-v3/testsuite/25_algorithms/sort/35588.cc
*** gcc-4.3.0/libstdc++-v3/testsuite/25_algorithms/sort/35588.cc	Thu Jan  1 00:00:00 1970
--- gcc-4.3.1/libstdc++-v3/testsuite/25_algorithms/sort/35588.cc	Wed Apr  9 16:47:00 2008
***************
*** 0 ****
--- 1,32 ----
+ // Copyright (C) 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 2, 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.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING.  If not, write to the Free
+ // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
+ // USA.
+ 
+ #include <algorithm>
+ #include <functional>
+ #include <tr1/functional>
+ 
+ // libstdc++/35588
+ int main()
+ {
+   using namespace std;
+   using namespace tr1;
+   using namespace placeholders;
+ 
+   int t[10];
+   sort(t, t+10, bind(less<int>(), _1, _2));
+ }
diff -Nrcpad gcc-4.3.0/libstdc++-v3/testsuite/tr1/4_metaprogramming/is_function/35637.cc gcc-4.3.1/libstdc++-v3/testsuite/tr1/4_metaprogramming/is_function/35637.cc
*** gcc-4.3.0/libstdc++-v3/testsuite/tr1/4_metaprogramming/is_function/35637.cc	Thu Jan  1 00:00:00 1970
--- gcc-4.3.1/libstdc++-v3/testsuite/tr1/4_metaprogramming/is_function/35637.cc	Thu Mar 20 20:29:21 2008
***************
*** 0 ****
--- 1,35 ----
+ // { dg-options "-pedantic-errors" }
+ // { dg-do compile }
+ 
+ // Copyright (C) 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 2, 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.
+ //
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING.  If not, write to the Free
+ // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
+ // USA.
+ 
+ // 4.5.1 Primary type categories
+ 
+ #include <tr1/functional>
+ 
+ struct S
+ {
+   void F() const {}
+ };
+ 
+ // libstdc++/35637
+ void test01()
+ {
+   std::tr1::function<void (S *)> a(&S::F);
+ }
diff -Nrcpad gcc-4.3.0/libstdc++-v3/testsuite/tr1/6_containers/tuple/comparison_operators/35480.cc gcc-4.3.1/libstdc++-v3/testsuite/tr1/6_containers/tuple/comparison_operators/35480.cc
*** gcc-4.3.0/libstdc++-v3/testsuite/tr1/6_containers/tuple/comparison_operators/35480.cc	Thu Jan  1 00:00:00 1970
--- gcc-4.3.1/libstdc++-v3/testsuite/tr1/6_containers/tuple/comparison_operators/35480.cc	Thu Mar  6 18:35:37 2008
***************
*** 0 ****
--- 1,33 ----
+ // { dg-do compile }
+ 
+ // Copyright (C) 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 2, 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.
+ 
+ // You should have received a copy of the GNU General Public License along
+ // with this library; see the file COPYING.  If not, write to the Free
+ // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
+ // USA.
+ 
+ // Tuple
+ 
+ #include <tr1/tuple>
+ 
+ // libstdc++/35480
+ void test01()
+ {
+   std::tr1::tuple<int> t1( 1 );
+   std::tr1::tuple<int, int> t2( 1, 2 );
+   if ( t1 < t2 ) {}   // { dg-error "here" }
+   if ( t1 == t2 ) {}  // { dg-error "here" }
+ }
+ // { dg-excess-errors "incomplete type" }