+2007-11-13 Benjamin Kosnik <bkoz@redhat.com>
+
+ * docs/html/documentation.html: First pass at unified table of contents.
+ * docs/html/abi.html: Move...
+ * docs/html/17_intro/abi.html: ...here.
+ * docs/html/17_intro/porting-howto.html: Update, edit, put
+ resulting pieces into...
+ * docs/html/17_intro/api.html: New.
+ * docs/html/17_intro/c++0x_status.html: New.
+ * docs/html/17_intro/CHECKLIST: Move to...
+ * docs/html/17_intro/c++1998_status.html: ...here.
+ * docs/html/ext/tr1.html: Move ...
+ * docs/html/17_intro/tr1_status.html: ...here.
+ * docs/html/debug_mode.html: Move...
+ * docs/html/ext/debug_mode.html: ...here.
+ * docs/html/parallel_mode.html: Move...
+ * docs/html/ext/parallel_mode.html: ...here
+ * docs/html/17_intro/BUGS: Remove.
+ * docs/html/17_intro/concept_check.diff: Remove.
+ * docs/html/17_intro/HEADER_POLICY: Remove.
+ * docs/html/17_intro/headers_cc.txt: Remove.
+ * docs/html/17_intro/PROBLEMS: Remove.
+ * docs/html/17_intro/RELEASE-NOTES: Remove.
+ * docs/html/explanations.html: Remove.
+ * docs/html/makedoc.awk: Remove.
+ * docs/html/faq/index.txt: Remove. HTML only.
+ * /docs/html/Makefile: Remove.
+
+ * docs/html/17_intro/configury.html: Editing, updating,
+ consistency check with doxygen conventions. Change libstdc++-v3 to
+ libstdc++.
+ * docs/html/17_intro/howto.html: Same.
+ * docs/html/17_intro/license.html: Same.
+ * docs/html/17_intro/porting.html: Same.
+ * docs/html/18_support/howto.html: Same.
+ * docs/html/19_diagnostics/howto.html: Same.
+ * docs/html/20_util/allocator.html: Same.
+ * docs/html/20_util/howto.html: Same.
+ * docs/html/21_strings/howto.html: Same.
+ * docs/html/22_locale/codecvt.html: Same.
+ * docs/html/22_locale/ctype.html: Same.
+ * docs/html/22_locale/howto.html: Same.
+ * docs/html/22_locale/messages.html: Same.
+ * docs/html/23_containers/howto.html: Same.
+ * docs/html/24_iterators/howto.html: Same.
+ * docs/html/25_algorithms/howto.html: Same.
+ * docs/html/26_numerics/howto.html: Same.
+ * docs/html/27_io/howto.html: Same.
+ * docs/html/configopts.html: Same.
+ * docs/html/debug.html: Same.
+ * docs/html/ext/ballocator_doc.html: Same.
+ * docs/html/ext/howto.html: Same.
+ * docs/html/ext/mt_allocator.html: Same.
+ * docs/html/ext/sgiexts.html: Same.
+ * docs/html/faq/index.html: Same.
+ * docs/html/install.html: Same.
+ * docs/html/test.html: Same.
+
+ * include/bits/c++config: Change _GLIBCXX_DEPRECATED to
+ _GLIBCXX_DEPRECATED_ATTR, _GLIBCXX_VISIBILITY to
+ _GLIBCXX_VISIBILITY_ATTR.
+ * include/backward/auto_ptr.h: Same.
+ * include/backward/binders.h: Same.
+ * include/bits/stl_function.h: Same.
+ * include/std/memory: Same.
+ * include/std/streambuf: Same.
+ * include/tr1_impl/boost_shared_ptr.h: Same.
+ * src/globals_io.cc: Same.
+ * src/ios_init.cc: Same.
+
2007-11-13 Paolo Carlini <pcarlini@suse.de>
* include/bits/deque.tcc (deque<>::_M_push_back_aux,
+++ /dev/null
-2003-04-26
-
-- _GLIBCPP_HAS_BUILTIN_SINF: We should still hold out for a cleaner solution the is currenly the case in bits/std_cmath.h.
-
-- there may be one set of remaining string bugs, dependent on final
-clarification of the string::find technicalities when finding in an
-empty string or using an empty string for an argument. At the very
-least, v-3 has interpreted the standard in a way that is in opposition
-to other libraries on other platforms.
-
-- trigraphs and keywords a la the iso646 header are not correctly
-implemented. It looks like the compiler recognizes them as keywords
-but then doesn't translate into the correct bit ops. It is a mystery.
-
-- wide strings have not been tested, and may therefore be unusable.
-
-- Chapter 27 io functionality is not finished. As such, there are
-known bugs in: filebuf::putbackfail
-
-- Many facet implementations are stubs. (22)
-
-- Almost no optimizations for small-footprint/low-overhead. (22,27)
-
-- There has been some work to wrap the C headers in namespace std::, but
- it may not be complete yet, and C macros are not shadowed. Please consult
- the mailing list archives for more information.
-
-
+++ /dev/null
-
- Completion Checklist for the Standard C++ Library
- Updated: 2003-04-25
-
- Status Code Legend:
- M - Missing
- S - Present as stub.
- X - Partially implemented, or buggy.
- T - Implemented, pending test/inspection.
- V - Verified to pass all available test suites.
- Q - Qualified by inspection for non-testable correctness.
- P - Portability verified.
- C - Certified.
-
- Lexical notes:
- Only status codes appear in column 0. Notes relating to conformance
- issues appear [in brackets].
-
- Note that this checklist does not (yet) include all emendations
- recommended by the ISO Library Working Group:
- http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/lwg-toc.html
-
- Detailed explanation of status codes:
-
- M - Missing: The name is not visible to programs that include
- the specified header, either at compile or link stage.
-
- S - Present as stub: A program can use the name, but no implementation
- is provided. Programs that use the name link correctly, but
- cannot usefully be run.
-
- X - Partially implemented, or buggy: Some implementation has been
- provided, but it is known or believed not to conform fully.
- It may have an incorrect base class, wrong namespace, wrong
- storage class, or simply not fully implement requirements.
- However, it may be sufficiently usable to help test other
- components.
-
- T - Implemented, pending test/inspection: Implementation believed
- to be complete, and informal testing suggests it is ready for
- formal verification.
-
- V - Verified, passes all test suites: Verified to satisfy all
- generically testable conformance requirements.
-
- Q - Qualified by inspection for non-testable correctness:
- Inspected, "implementation-defined" documentation accepted,
- local usability criteria satisfied, formally inspected for
- other untestable conformance. (Untestable requirements
- include exception-safety, thread-safety, worst-case
- complexity, memory cleanliness, usefulness.)
-
- P - Portability verified: Qualified on all primary target platforms.
-
- C - Certified: Formally certified to have passed all tests,
- inspections, qualifications; approved under "signing authority"
- to be used to satisfy contractual guarantees.
-
- ----------------------------------------------------------------------
- <algorithm> <iomanip> <list> <ostream> <streambuf>
- <bitset> <ios> <locale> <queue> <string>
- <complex> <iosfwd> <map> <set> <typeinfo>
-X <deque> <iostream> <memory> <sstream> <utility>
- <exception> <istream> <new> <stack> <valarray>
- <fstream> <iterator> <numeric> <stdexcept> <vector>
- <functional> <limits>
-
- [C header names must be in std:: to qualify. Related to shadow/ dir.]
- <cassert> <ciso646> <csetjmp> <cstdio> <ctime>
- <cctype> <climits> <csignal> <cstdlib> <cwchar>
-X <cerrno> <clocale> <cstdarg> <cstring> <cwctype>
- <cfloat> <cmath> <cstddef>
-
- Macro:
-X errno, declared or defined in <cerrno>.
-
- Macro fn:
-X setjmp(jmp_buf), declared or defined in <csetjmp>
-X va_end(va_list), declared or defined in <cstdarg>
-
- Types:
-X clock_t, div_t, FILE, fpos_t, lconv, ldiv_t, mbstate_t,
-X ptrdiff_t, sig_atomic_t, size_t, time_t, tm, va_list,
-X wctrans_t, wctype_t, and wint_t.
-
- 1 Which of the functions in the C++ Standard Library are not reentrant
- subroutines is implementation-defined.
-
- 18.1 Types [lib.support.types]
-X <cstddef>
-X NULL
-X offsetof
-X ptrdiff_t
-X size_t
-
- 18.2 Implementation properties [lib.support.limits]
-
- <limits>, <climits>, and <cfloat>
-
- 18.2.1 Numeric limits [lib.limits]
-
-X template<class T> class numeric_limits;
-
-T enum float_round_style;
-T enum float_denorm_style;
-
-T template<> class numeric_limits<bool>;
-
-T template<> class numeric_limits<char>;
-T template<> class numeric_limits<signed char>;
-T template<> class numeric_limits<unsigned char>;
-T template<> class numeric_limits<wchar_t>;
-
-T template<> class numeric_limits<short>;
-T template<> class numeric_limits<int>;
-T template<> class numeric_limits<long>;
-T template<> class numeric_limits<unsigned short>;
-T template<> class numeric_limits<unsigned int>;
-T template<> class numeric_limits<unsigned long>;
-
-X template<> class numeric_limits<float>;
-X template<> class numeric_limits<double>;
-X template<> class numeric_limits<long double>;
-
- 18.2.1.1 Template class numeric_limits [lib.numeric.limits]
-T template<class T> class numeric_limits {
- public:
-T static const bool is_specialized = false;
-T static T min() throw();
-T static T max() throw();
-T static const int digits = 0;
-T static const int digits10 = 0;
-T static const bool is_signed = false;
-T static const bool is_integer = false;
-T static const bool is_exact = false;
-T static const int radix = 0;
-T static T epsilon() throw();
-T static T round_error() throw();
-
-T static const int min_exponent = 0;
-T static const int min_exponent10 = 0;
-T static const int max_exponent = 0;
-T static const int max_exponent10 = 0;
-
-T static const bool has_infinity = false;
-T static const bool has_quiet_NaN = false;
-T static const bool has_signaling_NaN = false;
-T static const float_denorm_style has_denorm = denorm_absent;
-T static const bool has_denorm_loss = false;
-T static T infinity() throw();
-T static T quiet_NaN() throw();
-T static T signaling_NaN() throw();
-T static T denorm_min() throw();
-
-T static const bool is_iec559 = false;
-T static const bool is_bounded = false;
-T static const bool is_modulo = false;
-
-T static const bool traps = false;
-T static const bool tinyness_before = false;
-T static const float_round_style round_style = round_toward_zero;
- };
-
- 18.2.1.3 Type float_round_style [lib.round.style]
-
-T enum float_round_style {
-T round_indeterminate = -1,
-T round_toward_zero = 0,
-T round_to_nearest = 1,
-T round_toward_infinity = 2,
-T round_toward_neg_infinity = 3
- };
-
- 18.2.1.4 Type float_denorm_style [lib.denorm.style]
-
-T enum float_denorm_style {
-T denorm_indeterminate = -1;
-T denorm_absent = 0;
-T denorm present = 1;
- };
-
- 18.2.1.5 numeric_limits specializations [lib.numeric.special]
-
- [Note: see Note at 18.2.1. ]
-
- 18.2.2 C Library [lib.c.limits]
-
- 1 Header <climits> (Table 3):
- CHAR_BIT INT_MAX LONG_MIN SCHAR_MIN UCHAR_MAX USHRT_MAX
-X CHAR_MAX INT_MIN MB_LEN_MAX SHRT_MAX UINT_MAX
- CHAR_MIN LONG_MAX SCHAR_MAX SHRT_MIN ULONG_MAX
-
- 3 Header <cfloat> (Table 4):
-
- DBL_DIG DBL_MIN_EXP FLT_MIN_10_EXP LDBL_MAX_10_EXP
- DBL_EPSILON FLT_DIG FLT_MIN_EXP LDBL_MAX_EXP
- DBL_MANT_DIG FLT_EPSILON FLT_RADIX LDBL_MIN
-X DBL_MAX FLT_MANT_DIG FLT_ROUNDS LDBL_MIN_10_EXP
- DBL_MAX_10_EXP FLT_MAX LDBL_DIG LDBL_MIN_EXP
- DBL_MAX_EXP FLT_MAX_10_EXP LDBL_EPSILON
- DBL_MIN FLT_MAX_EXP LDBL_MANT_DIG
- DBL_MIN_10_EXP FLT_MIN LDBL_MAX
-
-
- 1 Header <cstdlib> (partial), Table 5:
-X EXIT_FAILURE EXIT_SUCCESS
- abort atexit exit
-
-S abort(void)
-S extern "C" int atexit(void (*f)(void))
-S extern "C++" int atexit(void (*f)(void))
-S exit(int status)
-
- 18.4 Dynamic memory management [lib.support.dynamic]
-
- Header <new> synopsis
-
-T class bad_alloc;
-T struct nothrow_t {};
-T extern const nothrow_t nothrow;
-T typedef void (*new_handler)();
-T new_handler set_new_handler(new_handler new_p) throw();
-
-T void* operator new(std::size_t size) throw(std::bad_alloc);
-T void* operator new(std::size_t size, const std::nothrow_t&) throw();
-T void operator delete(void* ptr) throw();
-T void operator delete(void* ptr, const std::nothrow_t&) throw();
-T void* operator new[](std::size_t size) throw(std::bad_alloc);
-T void* operator new[](std::size_t size, const std::nothrow_t&) throw();
-T void operator delete[](void* ptr) throw();
-T void operator delete[](void* ptr, const std::nothrow_t&) throw();
-T void* operator new (std::size_t size, void* ptr) throw();
-T void* operator new[](std::size_t size, void* ptr) throw();
-T void operator delete (void* ptr, void*) throw();
-T void operator delete[](void* ptr, void*) throw();
-
- 18.4.2.1 Class bad_alloc [lib.bad.alloc]
-
-T class bad_alloc : public exception {
- public:
-T bad_alloc() throw();
-T bad_alloc(const bad_alloc&) throw();
-T bad_alloc& operator=(const bad_alloc&) throw();
-T virtual ~bad_alloc() throw();
-T virtual const char* what() const throw();
-
-
-
-T new_handler set_new_handler(new_handler new_p) throw();
-
-
- Header <typeinfo> synopsis
-
-T class type_info;
-T class bad_cast;
-T class bad_typeid;
-
- 18.5.1 - Class type_info [lib.type.info]
-
-T class type_info {
- public:
-T virtual ~type_info();
-T bool operator==(const type_info& rhs) const;
-T bool operator!=(const type_info& rhs) const;
-T bool before(const type_info& rhs) const;
-T const char* name() const;
- private:
-T type_info(const type_info& rhs);
-T type_info& operator=(const type_info& rhs);
- };
-
- 18.5.2 - Class bad_cast [lib.bad.cast]
-
-T bad_cast() throw();
-T virtual const char* bad_cast::what() const throw();
-
- 18.5.3 Class bad_typeid [lib.bad.typeid]
-
-T class bad_typeid : public exception {
- public:
-T bad_typeid() throw();
-T bad_typeid(const bad_typeid&) throw();
-T bad_typeid& operator=(const bad_typeid&) throw();
-T virtual ~bad_typeid() throw();
-T virtual const char* what() const throw();
- };
-
- 18.6 Exception handling [lib.support.exception]
-
-T Header <exception> synopsis
-
-T class exception;
-T class bad_exception;
-
-T typedef void (*unexpected_handler)();
-T unexpected_handler set_unexpected(unexpected_handler f) throw();
-T void unexpected();
-T typedef void (*terminate_handler)();
-T terminate_handler set_terminate(terminate_handler f) throw();
-T void terminate();
-T bool uncaught_exception();
-
- 18.6.1 Class exception [lib.exception]
-
-T class exception {
- public:
-T exception() throw();
-T exception(const exception&) throw();
-T exception& operator=(const exception&) throw();
-T virtual ~exception() throw();
-T virtual const char* what() const throw();
- };
-
- 18.6.2.1 Class bad_exception [lib.bad.exception]
-T class bad_exception : public exception {
- public:
-T bad_exception() throw();
-T bad_exception(const bad_exception&) throw();
-T bad_exception& operator=(const bad_exception&) throw();
-T virtual ~bad_exception() throw();
-T virtual const char* what() const throw();
- };
-
- 18.7 Other runtime support [lib.support.runtime]
-
- 1 Headers <cstdarg> (variable arguments), <csetjmp> (nonlocal jumps),
- <ctime> (system clock clock(), time()), <csignal> (signal handling),
- and <cstdlib> (runtime environment getenv(), system()).
-
- Table 6--Header <cstdarg> synopsis
- Macros: va_arg va_end va_start
-X Type: va_list
-
- Table 7--Header <csetjmp> synopsis
-
- Macro: setjmp |
-X Type: jmp_buf
- Function: longjmp
-
- Table 8--Header <ctime> synopsis
-
- Macros: CLOCKS_PER_SEC
-X Types: clock_t
- Functions: clock
-
- Table 9--Header <csignal> synopsis
-
-X Macros: SIGABRT SIGILL SIGSEGV SIG_DFL
- SIG_IGN SIGFPE SIGINT SIGTERM SIG_ERR
- Type: sig_atomic_t
- Functions: raise signal
-
- Table 10--Header <cstdlib> synopsis
-
-X Functions: getenv system
-
- 19.1 Exception classes [lib.std.exceptions]
-
- Header <stdexcept> synopsis
-
-T class logic_error;
-T class domain_error;
-T class invalid_argument;
-T class length_error;
-T class out_of_range;
-T class runtime_error;
-T class range_error;
-T class overflow_error;
-T class underflow_error;
-
- 19.1.1 Class logic_error [lib.logic.error]
-T class logic_error : public exception {
- public:
-T explicit logic_error(const string& what_arg);
- };
-
- 19.1.2 Class domain_error [lib.domain.error]
-
-T class domain_error : public logic_error {
- public:
-T explicit domain_error(const string& what_arg);
- };
-
- 19.1.3 Class invalid_argument [lib.invalid.argument]
-
-T class invalid_argument : public logic_error {
- public:
-T explicit invalid_argument(const string& what_arg);
- };
-
- 19.1.4 Class length_error [lib.length.error]
-
-T class length_error : public logic_error {
- public:
-T explicit length_error(const string& what_arg);
- };
-
- 19.1.5 Class out_of_range [lib.out.of.range]
-
-T class out_of_range : public logic_error {
- public:
-T explicit out_of_range(const string& what_arg);
- };
-
-
- 19.1.6 Class runtime_error [lib.runtime.error]
-
-T class runtime_error : public exception {
- public:
-T explicit runtime_error(const string& what_arg);
- };
-
-
- 19.1.7 Class range_error [lib.range.error]
-
-T class range_error : public runtime_error {
- public:
-T explicit range_error(const string& what_arg);
- };
-
- 19.1.8 Class overflow_error [lib.overflow.error]
-
-T class overflow_error : public runtime_error {
- public:
-T explicit overflow_error(const string& what_arg);
- };
-
-
- 19.1.9 Class underflow_error [lib.underflow.error]
-
-T class underflow_error : public runtime_error {
- public:
-T explicit underflow_error(const string& what_arg);
- };
-
-
- 19.2 Assertions [lib.assertions]
-
- Table 2--Header <cassert> synopsis
-
-X Macro: assert
-
- 19.3 Error numbers [lib.errno]
-
- Table 3--Header <cerrno> synopsis
-
-X |Macros: EDOM ERANGE errno |
-
-
- 20.2 Utility components [lib.utility]
-
- Header <utility> synopsis
-
- // _lib.operators_, operators:
-T namespace rel_ops {
-T template<class T> bool operator!=(const T&, const T&);
-T template<class T> bool operator> (const T&, const T&);
-T template<class T> bool operator<=(const T&, const T&);
-T template<class T> bool operator>=(const T&, const T&);
- }
- // _lib.pairs_, pairs:
-T template <class T1, class T2> struct pair;
-T template <class T1, class T2>
- bool operator==(const pair<T1,T2>&, const pair<T1,T2>&);
-T template <class T1, class T2>
- bool operator< (const pair<T1,T2>&, const pair<T1,T2>&);
-T template <class T1, class T2>
- bool operator!=(const pair<T1,T2>&, const pair<T1,T2>&);
-T template <class T1, class T2>
- bool operator> (const pair<T1,T2>&, const pair<T1,T2>&);
-T template <class T1, class T2>
- bool operator>=(const pair<T1,T2>&, const pair<T1,T2>&);
-T template <class T1, class T2>
- bool operator<=(const pair<T1,T2>&, const pair<T1,T2>&);
-T template <class T1, class T2> pair<T1,T2> make_pair(const T1&, const T2&);
-
-
- 20.2.2 Pairs [lib.pairs]
-
-T template <class T1, class T2>
- struct pair {
-T typedef T1 first_type;
-T typedef T2 second_type;
-
-T T1 first;
-T T2 second;
-T pair();
-T pair(const T1& x, const T2& y);
-T template<class U, class V> pair(const pair<U, V> &p);
- };
-
- 20.3 Function objects [lib.function.objects]
-
- Header <functional> synopsis
-
- // _lib.base_, base:
-V template <class Arg, class Result> struct unary_function;
-V template <class Arg1, class Arg2, class Result> struct binary_function;
-
- // _lib.arithmetic.operations_, arithmetic operations:
-V template <class T> struct plus;
-V template <class T> struct minus;
-V template <class T> struct multiplies;
-V template <class T> struct divides;
-V template <class T> struct modulus;
-V template <class T> struct negate;
- // _lib.comparisons_, comparisons:
-V template <class T> struct equal_to;
-V template <class T> struct not_equal_to;
-V template <class T> struct greater;
-V template <class T> struct less;
-V template <class T> struct greater_equal;
-V template <class T> struct less_equal;
- // _lib.logical.operations_, logical operations:
-V template <class T> struct logical_and;
-V template <class T> struct logical_or;
-V template <class T> struct logical_not;
- // _lib.negators_, negators:
- template <class Predicate> struct unary_negate;
-V template <class Predicate>
- unary_negate<Predicate> not1(const Predicate&);
-V template <class Predicate> struct binary_negate;
-V template <class Predicate>
- binary_negate<Predicate> not2(const Predicate&);
- // _lib.binders_, binders:
-V template <class Operation> class binder1st;
-V template <class Operation, class T>
- binder1st<Operation> bind1st(const Operation&, const T&);
-V template <class Operation> class binder2nd;
-V template <class Operation, class T>
- binder2nd<Operation> bind2nd(const Operation&, const T&);
- // _lib.function.pointer.adaptors_, adaptors:
-V template <class Arg, class Result> class pointer_to_unary_function;
-V template <class Arg, class Result>
- pointer_to_unary_function<Arg,Result> ptr_fun(Result (*)(Arg));
-V template <class Arg1, class Arg2, class Result>
- class pointer_to_binary_function;
-V template <class Arg1, class Arg2, class Result>
- pointer_to_binary_function<Arg1,Arg2,Result>
- ptr_fun(Result (*)(Arg1,Arg2));
-
- // _lib.member.pointer.adaptors_, adaptors:
-V template<class S, class T> class mem_fun_t;
-V template<class S, class T, class A> class mem_fun1_t;
-V template<class S, class T>
- mem_fun_t<S,T> mem_fun(S (T::*f)());
-V template<class S, class T, class A>
- mem_fun1_t<S,T,A> mem_fun(S (T::*f)(A));
-V template<class S, class T> class mem_fun_ref_t;
-V template<class S, class T, class A> class mem_fun1_ref_t;
-V template<class S, class T>
- mem_fun_ref_t<S,T> mem_fun_ref(S (T::*f)());
-V template<class S, class T, class A>
- mem_fun1_ref_t<S,T,A> mem_fun_ref(S (T::*f)(A));
-
-V template <class S, class T> class const_mem_fun_t;
-V template <class S, class T, class A> class const_mem_fun1_t;
-V template <class S, class T>
- const_mem_fun_t<S,T> mem_fun(S (T::*f)() const);
-V template <class S, class T, class A>
- const_mem_fun1_t<S,T,A> mem_fun(S (T::*f)(A) const);
-V template <class S, class T> class const_mem_fun_ref_t;
-V template <class S, class T, class A> class const_mem_fun1_ref_t;
-V template <class S, class T>
- const_mem_fun_ref_t<S,T> mem_fun_ref(S (T::*f)() const);
-V template <class S, class T, class A>
- const_mem_fun1_ref_t<S,T,A> mem_fun_ref(S (T::*f)(A) const);
- }
-
- 20.3.1 Base [lib.base]
-
-V template <class Arg, class Result>
- struct unary_function {
-V typedef Arg argument_type;
-V typedef Result result_type;
- };
-V template <class Arg1, class Arg2, class Result>
- struct binary_function {
-V typedef Arg1 first_argument_type;
-V typedef Arg2 second_argument_type;
-V typedef Result result_type;
- };
-
- 20.3.2 Arithmetic operations [lib.arithmetic.operations]
-
-T template <class T> struct plus : binary_function<T,T,T> {
-V T operator()(const T& x, const T& y) const;
- };
-
-T template <class T> struct minus : binary_function<T,T,T> {
-V T operator()(const T& x, const T& y) const;
- };
-
-T template <class T> struct multiplies : binary_function<T,T,T> {
-V T operator()(const T& x, const T& y) const;
- };
-
-T template <class T> struct divides : binary_function<T,T,T> {
-V T operator()(const T& x, const T& y) const;
- };
-
-T template <class T> struct modulus : binary_function<T,T,T> {
-V T operator()(const T& x, const T& y) const;
- };
-
-T template <class T> struct negate : unary_function<T,T> {
-V T operator()(const T& x) const;
- };
-
- 20.3.3 Comparisons [lib.comparisons]
-
-T template <class T> struct equal_to : binary_function<T,T,bool> {
-V bool operator()(const T& x, const T& y) const;
- };
-
-T template <class T> struct not_equal_to : binary_function<T,T,bool> {
-V bool operator()(const T& x, const T& y) const;
- };
-
-T template <class T> struct greater : binary_function<T,T,bool> {
-V bool operator()(const T& x, const T& y) const;
- };
-
-T template <class T> struct less : binary_function<T,T,bool> {
-V bool operator()(const T& x, const T& y) const;
- };
-
-T template <class T> struct greater_equal : binary_function<T,T,bool> {
-V bool operator()(const T& x, const T& y) const;
- };
-
-T template <class T> struct less_equal : binary_function<T,T,bool> {
-V bool operator()(const T& x, const T& y) const;
- };
-
- 20.3.4 Logical operations [lib.logical.operations]
-
-T template <class T> struct logical_and : binary_function<T,T,bool> {
-V bool operator()(const T& x, const T& y) const;
- };
-
-T template <class T> struct logical_or : binary_function<T,T,bool> {
-V bool operator()(const T& x, const T& y) const;
- };
-
-T template <class T> struct logical_not : unary_function<T,bool> {
-V bool operator()(const T& x) const;
- };
-
- 20.3.5 Negators [lib.negators]
-
-T template <class Predicate>
- class unary_negate
- : public unary_function<typename Predicate::argument_type,bool> {
- public:
-T explicit unary_negate(const Predicate& pred);
-V bool operator()(const typename Predicate::argument_type& x) const;
- };
-
-T template <class Predicate>
- class binary_negate
- : public binary_function<typename Predicate::first_argument_type,
- typename Predicate::second_argument_type, bool> {
- public:
-T explicit binary_negate(const Predicate& pred);
-V bool operator()(const typename Predicate::first_argument_type& x,
- const typename Predicate::second_argument_type& y) const;
- };
-
-
- 20.3.6 Binders [lib.binders]
-
- 20.3.6.1 Template class binder1st [lib.binder.1st]
-T template <class Operation>
- class binder1st
- : public unary_function<typename Operation::second_argument_type,
- typename Operation::result_type> {
- protected:
-T Operation op;
-T typename Operation::first_argument_type value;
- public:
-V binder1st(const Operation& x,
- const typename Operation::first_argument_type& y);
-V typename Operation::result_type
- operator()(const typename Operation::second_argument_type& x) const;
- };
-
- 20.3.6.2 bind1st [lib.bind.1st]
-
-V template <class Operation, class T>
- binder1st<Operation> bind1st(const Operation& op, const T& x);
-
- 20.3.6.3 Template class binder2nd [lib.binder.2nd]
-T template <class Operation>
- class binder2nd
- : public unary_function<typename Operation::first_argument_type,
- typename Operation::result_type> {
- protected:
-T Operation op;
-T typename Operation::second_argument_type value;
- public:
-V binder2nd(const Operation& x,
- const typename Operation::second_argument_type& y);
-V typename Operation::result_type
- operator()(const typename Operation::first_argument_type& x) const;
- };
-
- 20.3.6.4 bind2nd [lib.bind.2nd]
-
-T template <class Operation, class T>
- binder2nd<Operation> bind2nd(const Operation& op, const T& x);
-
-
- 20.3.7 Adaptors for pointers to [lib.function.pointer.adaptors]
- functions
-
- 1 To allow pointers to (unary and binary) functions to work with func-
- tion adaptors the library provides:
-
-T template <class Arg, class Result>
- class pointer_to_unary_function : public unary_function<Arg, Result> {
- public:
-T explicit pointer_to_unary_function(Result (*f)(Arg));
-V Result operator()(Arg x) const;
- };
-
-T template <class Arg, class Result>
- pointer_to_unary_function<Arg, Result> ptr_fun(Result (*f)(Arg));
-
-T template <class Arg1, class Arg2, class Result>
- class pointer_to_binary_function :
- public binary_function<Arg1,Arg2,Result> {
- public:
-T explicit pointer_to_binary_function(Result (*f)(Arg1, Arg2));
-V Result operator()(Arg1 x, Arg2 y) const;
- };
-
-
- 20.3.8 Adaptors for pointers to [lib.member.pointer.adaptors]
- members
-
-T template <class S, class T> class mem_fun_t
- : public unary_function<T*, S> {
- public:
-T explicit mem_fun_t(S (T::*p)());
-V S operator()(T* p) const;
- };
-
-T template <class S, class T, class A> class mem_fun1_t
- : public binary_function<T*, A, S> {
- public:
-T explicit mem_fun1_t(S (T::*p)(A));
-V S operator()(T* p, A x) const;
- };
-
-V template<class S, class T> mem_fun_t<S,T>
- mem_fun(S (T::*f)());
-V template<class S, class T, class A> mem_fun1_t<S,T,A>
- mem_fun(S (T::*f)(A));
-
-T template <class S, class T> class mem_fun_ref_t
- : public unary_function<T, S> {
- public:
-T explicit mem_fun_ref_t(S (T::*p)());
-V S operator()(T& p) const;
- };
-
-T template <class S, class T, class A> class mem_fun1_ref_t
- : public binary_function<T, A, S> {
- public:
-T explicit mem_fun1_ref_t(S (T::*p)(A));
-V S operator()(T& p, A x) const;
- };
-
-T template<class S, class T> mem_fun_ref_t<S,T>
- mem_fun_ref(S (T::*f)());
-
-T template<class S, class T, class A> mem_fun1_ref_t<S,T,A>
- mem_fun_ref(S (T::*f)(A));
-
-T template <class S, class T> class const_mem_fun_t
- : public unary_function<T*, S> {
- public:
-T explicit const_mem_fun_t(S (T::*p)() const);
-V S operator()(const T* p) const;
- };
-
-T template <class S, class T, class A> class const_mem_fun1_t
- : public binary_function<T*, A, S> {
- public:
-T explicit const mem_fun1_t(S (T::*p)(A) const);
-V S operator()(const T* p, A x) const;
- };
-
-V template<class S, class T> const_mem_fun_t<S,T>
- mem_fun(S (T::*f)() const);
-V template<class S, class T, class A> const_mem_fun1_t<S,T,A>
- mem_fun(S (T::*f)(A) const);
-
-T template <class S, class T> class const_mem_fun_ref_t
- : public unary_function<T, S> {
- public:
-T explicit const_mem_fun_ref_t(S (T::*p)() const);
-V S operator()(const T& p) const;
- };
-
-T template <class S, class T, class A> class const_mem_fun1_ref_t
- : public binary_function<T, A, S> {
- public:
-T explicit const_mem_fun1_ref_t(S (T::*p)(A) const);
-V S operator()(const T& p, A x) const;
- };
-
-T template<class S, class T> const_mem_fun_ref_t<S,T>
- mem_fun_ref(S (T::*f)() const);
-
-T template<class S, class T, class A> const_mem_fun1_ref_t<S,T,A>
- mem_fun_ref(S (T::*f)(A) const);
-
- 20.4 Memory [lib.memory]
-
- Header <memory> synopsis
-
- // _lib.default.allocator_, the default allocator:
-T template <class T> class allocator;
-T template <> class allocator<void>;
-T template <class T, class U>
- bool operator==(const allocator<T>&, const allocator<U>&) throw();
-T template <class T, class U>
- bool operator!=(const allocator<T>&, const allocator<U>&) throw();
- // _lib.storage.iterator_, raw storage iterator:
-T template <class OutputIterator, class T> class raw_storage_iterator;
- // _lib.temporary.buffer_, temporary buffers:
-T template <class T>
- pair<T*,ptrdiff_t> get_temporary_buffer(ptrdiff_t n);
-T template <class T>
- void return_temporary_buffer(T* p);
- // _lib.specialized.algorithms_, specialized algorithms:
-T template <class InputIterator, class ForwardIterator>
- ForwardIterator
- uninitialized_copy(InputIterator first, InputIterator last,
- ForwardIterator result);
-T template <class ForwardIterator, class T>
- void uninitialized_fill(ForwardIterator first, ForwardIterator last,
- const T& x);
-T template <class ForwardIterator, class Size, class T>
- void uninitialized_fill_n(ForwardIterator first, Size n, const T& x);
- // _lib.auto.ptr_, pointers:
-X template<class X> class auto_ptr;
- }
-
- 20.4.1 The default allocator [lib.default.allocator]
-
-T template <class T> class allocator;
- // specialize for void:
-T template <> class allocator<void> {
- public:
-T typedef void* pointer;
-T typedef const void* const_pointer;
- // reference-to-void members are impossible.
-T typedef void value_type;
-T template <class U> struct rebind { typedef allocator<U> other; };
- };
-
-T template <class T> class allocator {
- public:
-T typedef size_t size_type;
-T typedef ptrdiff_t difference_type;
-T typedef T* pointer;
-T typedef const T* const_pointer;
-T typedef T& reference;
-T typedef const T& const_reference;
-T typedef T value_type;
-T template <class U> struct rebind { typedef allocator<U> other; };
-T allocator() throw();
-T allocator(const allocator&) throw();
-T template <class U> allocator(const allocator<U>&) throw();
-T ~allocator() throw();
-T pointer address(reference x) const;
-T const_pointer address(const_reference x) const;
-T pointer allocate(
- size_type, allocator<void>::const_pointer hint = 0);
-T void deallocate(pointer p, size_type n);
-T size_type max_size() const throw();
-T void construct(pointer p, const T& val);
-T void destroy(pointer p);
- };
-
- 20.4.1.2 allocator globals [lib.allocator.globals]
-
-T template <class T1, class T2>
- bool operator==(const allocator<T1>&, const allocator<T2>&) throw();
-T template <class T1, class T2>
- bool operator!=(const allocator<T1>&, const allocator<T2>&) throw();
-
- 20.4.2 Raw storage iterator [lib.storage.iterator]
-
-T template <class OutputIterator, class T>
- class raw_storage_iterator
- : public iterator<output_iterator_tag,void,void,void,void> {
- public:
-T explicit raw_storage_iterator(OutputIterator x);
-T raw_storage_iterator<OutputIterator,T>& operator*();
-T raw_storage_iterator<OutputIterator,T>& operator=(const T& element);
-T raw_storage_iterator<OutputIterator,T>& operator++();
-T raw_storage_iterator<OutputIterator,T> operator++(int);
- };
-
- 20.4.3 Temporary buffers [lib.temporary.buffer]
-
-T template <class T>
- pair<T*, ptrdiff_t> get_temporary_buffer(ptrdiff_t n);
-
-T template <class T> void return_temporary_buffer(T* p);
-
- 20.4.4 Specialized algorithms [lib.specialized.algorithms]
-
- 20.4.4.1 uninitialized_copy [lib.uninitialized.copy]
-
-V template <class InputIterator, class ForwardIterator>
- ForwardIterator
- uninitialized_copy(InputIterator first, InputIterator last,
- ForwardIterator result);
-
- 20.4.4.2 uninitialized_fill [lib.uninitialized.fill]
-
-V template <class ForwardIterator, class T>
- void uninitialized_fill(ForwardIterator first, ForwardIterator last,
- const T& x);
-
- 20.4.4.3 uninitialized_fill_n [lib.uninitialized.fill.n]
-
-V template <class ForwardIterator, class Size, class T>
- void uninitialized_fill_n(ForwardIterator first, Size n, const T& x);
-
- 20.4.5 Template class auto_ptr [lib.auto.ptr]
-
-X template<class X> class auto_ptr {
- template <class Y> struct auto_ptr_ref {};
- public:
-T typedef X element_type;
- // _lib.auto.ptr.cons_ construct/copy/destroy:
-T explicit auto_ptr(X* p =0) throw();
-T auto_ptr(auto_ptr&) throw();
-T template<class Y> auto_ptr(auto_ptr<Y>&) throw();
-T auto_ptr& operator=(auto_ptr&) throw();
-T template<class Y> auto_ptr& operator=(auto_ptr<Y>&) throw();
-T ~auto_ptr() throw();
- // _lib.auto.ptr.members_ members:
-T X& operator*() const throw();
-T X* operator->() const throw();
-T X* get() const throw();
-T X* release() throw();
-T void reset(X* p =0) throw();
-
- // _lib.auto.ptr.conv_ conversions:
-X auto_ptr(auto_ptr_ref<X>) throw();
-X template<class Y> operator auto_ptr_ref<Y>() throw();
-X template<class Y> operator auto_ptr<Y>() throw();
- };
-
- 20.4.6 C Library [lib.c.malloc]
-
- Table 7--Header <cstdlib> synopsis
-
-X Functions: calloc malloc
- free realloc
-
-
- Table 8--Header <cstring> synopsis
-
-X Macro: NULL
-X Type: size_t
-X Functions: memchr memcmp
-X memcpy memmove memset
-
- Table 9--Header <ctime> synopsis
-
-X Macros: NULL
-X Types: size_t clock_t time_t
-X Struct: tm
- Functions:
-X asctime clock difftime localtime strftime
-X ctime gmtime mktime time
-
- 21.1.1 Character traits requirements [lib.char.traits.require]
-
- 2 The struct template
-T template<class charT> struct char_traits;
- shall be provided in the header <string> as a basis for explicit spe-
- cializations.
-
-
- 21.1.3.1 struct [lib.char.traits.specializations.char]
- char_traits<char>
-
-T template<>
- struct char_traits<char> {
-T typedef char char_type;
-T typedef int int_type;
-T typedef streamoff off_type;
-T typedef streampos pos_type;
-T typedef mbstate_t state_type;
-
-T static void assign(char_type& c1, const char_type& c2);
-T static bool eq(const char_type& c1, const char_type& c2);
-T static bool lt(const char_type& c1, const char_type& c2);
-
-T static int compare(const char_type* s1, const char_type* s2, size_t n);
-T static size_t length(const char_type* s);
-T static const char_type* find(const char_type* s, size_t n,
- const char_type& a);
-T static char_type* move(char_type* s1, const char_type* s2, size_t n);
-T static char_type* copy(char_type* s1, const char_type* s2, size_t n);
-T static char_type* assign(char_type* s, size_t n, char_type a);
-
-T static int_type not_eof(const int_type& c);
-T static char_type to_char_type(const int_type& c);
-T static int_type to_int_type(const char_type& c);
-T static bool eq_int_type(const int_type& c1, const int_type& c2);
-T static int_type eof();
- };
-
- 21.1.3.2 struct [lib.char.traits.specializations.wchar.t]
- char_traits<wchar_t>
-
-V template<>
- struct char_traits<wchar_t> {
-V typedef wchar_t char_type;
-V typedef wint_t int_type;
-V typedef streamoff off_type;
-V typedef wstreampos pos_type;
-V typedef mbstate_t state_type;
-
-V static void assign(char_type& c1, const char_type& c2);
-V static bool eq(const char_type& c1, const char_type& c2);
-V static bool lt(const char_type& c1, const char_type& c2);
-
-V static int compare(const char_type* s1, const char_type* s2, size_t n);
-V static size_t length(const char_type* s);
-V static const char_type* find(const char_type* s, size_t n,
- const char_type& a);
-V static char_type* move(char_type* s1, const char_type* s2, size_t n);
-V static char_type* copy(char_type* s1, const char_type* s2, size_t n);
-V static char_type* assign(char_type* s, size_t n, char_type a);
-
-V static int_type not_eof(const int_type& c);
-V static char_type to_char_type(const int_type& c);
-V static int_type to_int_type(const char_type& c);
-V static bool eq_int_type(const int_type& c1, const int_type& c2);
-V static int_type eof();
- };
-
- 21.2 String classes [lib.string.classes]
-
- // _lib.char.traits_, character traits:
-V template<class charT>
- struct char_traits;
-V template <> struct char_traits<char>;
-V template <> struct char_traits<wchar_t>;
-
- // _lib.basic.string_, basic_string:
-V template<class charT, class traits = char_traits<charT>,
- class Allocator = allocator<charT> >
- class basic_string;
-V template<class charT, class traits, class Allocator>
- basic_string<charT,traits,Allocator>
- operator+(const basic_string<charT,traits,Allocator>& lhs,
- const basic_string<charT,traits,Allocator>& rhs);
-V template<class charT, class traits, class Allocator>
- basic_string<charT,traits,Allocator>
- operator+(const charT* lhs,
- const basic_string<charT,traits,Allocator>& rhs);
-V template<class charT, class traits, class Allocator>
- basic_string<charT,traits,Allocator>
- operator+(charT lhs, const basic_string<charT,traits,Allocator>& rhs);
-V template<class charT, class traits, class Allocator>
- basic_string<charT,traits,Allocator>
- operator+(const basic_string<charT,traits,Allocator>& lhs,
- const charT* rhs);
-V template<class charT, class traits, class Allocator>
- basic_string<charT,traits,Allocator>
- operator+(const basic_string<charT,traits,Allocator>& lhs, charT rhs);
-
-V template<class charT, class traits, class Allocator>
- bool operator==(const basic_string<charT,traits,Allocator>& lhs,
- const basic_string<charT,traits,Allocator>& rhs);
-V template<class charT, class traits, class Allocator>
- bool operator==(const charT* lhs,
- const basic_string<charT,traits,Allocator>& rhs);
-V template<class charT, class traits, class Allocator>
- bool operator==(const basic_string<charT,traits,Allocator>& lhs,
- const charT* rhs);
-V template<class charT, class traits, class Allocator>
- bool operator!=(const basic_string<charT,traits,Allocator>& lhs,
- const basic_string<charT,traits,Allocator>& rhs);
-V template<class charT, class traits, class Allocator>
- bool operator!=(const charT* lhs,
- const basic_string<charT,traits,Allocator>& rhs);
-V template<class charT, class traits, class Allocator>
- bool operator!=(const basic_string<charT,traits,Allocator>& lhs,
- const charT* rhs);
-V template<class charT, class traits, class Allocator>
- bool operator< (const basic_string<charT,traits,Allocator>& lhs,
- const basic_string<charT,traits,Allocator>& rhs);
-V template<class charT, class traits, class Allocator>
- bool operator< (const basic_string<charT,traits,Allocator>& lhs,
- const charT* rhs);
-V template<class charT, class traits, class Allocator>
- bool operator< (const charT* lhs,
- const basic_string<charT,traits,Allocator>& rhs);
-V template<class charT, class traits, class Allocator>
- bool operator> (const basic_string<charT,traits,Allocator>& lhs,
- const basic_string<charT,traits,Allocator>& rhs);
-V template<class charT, class traits, class Allocator>
- bool operator> (const basic_string<charT,traits,Allocator>& lhs,
- const charT* rhs);
-V template<class charT, class traits, class Allocator>
- bool operator> (const charT* lhs,
- const basic_string<charT,traits,Allocator>& rhs);
-V template<class charT, class traits, class Allocator>
- bool operator<=(const basic_string<charT,traits,Allocator>& lhs,
- const basic_string<charT,traits,Allocator>& rhs);
-V template<class charT, class traits, class Allocator>
- bool operator<=(const basic_string<charT,traits,Allocator>& lhs,
- const charT* rhs);
-V template<class charT, class traits, class Allocator>
- bool operator<=(const charT* lhs,
- const basic_string<charT,traits,Allocator>& rhs);
-V template<class charT, class traits, class Allocator>
- bool operator>=(const basic_string<charT,traits,Allocator>& lhs,
- const basic_string<charT,traits,Allocator>& rhs);
-V template<class charT, class traits, class Allocator>
- bool operator>=(const basic_string<charT,traits,Allocator>& lhs,
- const charT* rhs);
-V template<class charT, class traits, class Allocator>
- bool operator>=(const charT* lhs,
- const basic_string<charT,traits,Allocator>& rhs);
-
- // _lib.string.special_:
-V template<class charT, class traits, class Allocator>
- void swap(basic_string<charT,traits,Allocator>& lhs,
- basic_string<charT,traits,Allocator>& rhs);
-V template<class charT, class traits, class Allocator>
- basic_istream<charT,traits>&
- operator>>(basic_istream<charT,traits>& is,
- basic_string<charT,traits,Allocator>& str);
-T template<class charT, class traits, class Allocator>
- basic_ostream<charT, traits>&
- operator<<(basic_ostream<charT, traits>& os,
- const basic_string<charT,traits,Allocator>& str);
-V template<class charT, class traits, class Allocator>
- basic_istream<charT,traits>&
- getline(basic_istream<charT,traits>& is,
- basic_string<charT,traits,Allocator>& str,
- charT delim);
-V template<class charT, class traits, class Allocator>
- basic_istream<charT,traits>&
- getline(basic_istream<charT,traits>& is,
- basic_string<charT,traits,Allocator>& str);
-V typedef basic_string<char> string;
-T typedef basic_string<wchar_t> wstring;
- }
-
- 21.3 Template class basic_string [lib.basic.string]
-
-V namespace std {
- template<class charT, class traits = char_traits<charT>,
- class Allocator = allocator<charT> >
- class basic_string {
- public:
- // types:
- typedef traits traits_type;
- typedef typename traits::char_type value_type;
- typedef Allocator allocator_type;
- typedef typename Allocator::size_type size_type;
- typedef typename Allocator::difference_type difference_type;
- typedef typename Allocator::reference reference;
- typedef typename Allocator::const_reference const_reference;
- typedef typename Allocator::pointer pointer;
- typedef typename Allocator::const_pointer const_pointer;
- typedef implementation defined iterator;
- typedef implementation defined const_iterator;
- typedef std::reverse_iterator<iterator> reverse_iterator;
- typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
- static const size_type npos = -1;
-
- // _lib.string.cons_ construct/copy/destroy:
-V explicit basic_string(const Allocator& a = Allocator());
-V basic_string(const basic_string& str, size_type pos = 0,
- size_type n = npos, const Allocator& a = Allocator());
-V basic_string(const charT* s,
- size_type n, const Allocator& a = Allocator());
-V basic_string(const charT* s, const Allocator& a = Allocator());
-V basic_string(size_type n, charT c, const Allocator& a = Allocator());
-V template<class InputIterator>
- basic_string(InputIterator begin, InputIterator end,
- const Allocator& a = Allocator());
-V ~basic_string();
-V basic_string& operator=(const basic_string& str);
-V basic_string& operator=(const charT* s);
-V basic_string& operator=(charT c);
- // _lib.string.iterators_ iterators:
-V iterator begin();
-V const_iterator begin() const;
-V iterator end();
-V const_iterator end() const;
-
-V reverse_iterator rbegin();
-V const_reverse_iterator rbegin() const;
-V reverse_iterator rend();
-V const_reverse_iterator rend() const;
- // _lib.string.capacity_ capacity:
-V size_type size() const;
-V size_type length() const;
-V size_type max_size() const;
-V void resize(size_type n, charT c);
-V void resize(size_type n);
-V size_type capacity() const;
-V void reserve(size_type res_arg = 0);
-V void clear();
-V bool empty() const;
- // _lib.string.access_ element access:
-V const_reference operator[](size_type pos) const;
-V reference operator[](size_type pos);
-V const_reference at(size_type n) const;
-V reference at(size_type n);
- // _lib.string.modifiers_ modifiers:
-V basic_string& operator+=(const basic_string& str);
-V basic_string& operator+=(const charT* s);
-V basic_string& operator+=(charT c);
-V basic_string& append(const basic_string& str);
-V basic_string& append(const basic_string& str, size_type pos,
- size_type n);
-V basic_string& append(const charT* s, size_type n);
-V basic_string& append(const charT* s);
-V basic_string& append(size_type n, charT c);
-V template<class InputIterator>
- basic_string& append(InputIterator first, InputIterator last);
-V void push_back(const charT);
-
-V basic_string& assign(const basic_string&);
-V basic_string& assign(const basic_string& str, size_type pos,
- size_type n);
-V basic_string& assign(const charT* s, size_type n);
-V basic_string& assign(const charT* s);
-V basic_string& assign(size_type n, charT c);
-V template<class InputIterator>
- basic_string& assign(InputIterator first, InputIterator last);
-V basic_string& insert(size_type pos1, const basic_string& str);
-V basic_string& insert(size_type pos1, const basic_string& str,
- size_type pos2, size_type n);
-V basic_string& insert(size_type pos, const charT* s, size_type n);
-V basic_string& insert(size_type pos, const charT* s);
-V basic_string& insert(size_type pos, size_type n, charT c);
-V iterator insert(iterator p, charT c);
-V void insert(iterator p, size_type n, charT c);
-V template<class InputIterator>
- void insert(iterator p, InputIterator first, InputIterator last);
-V basic_string& erase(size_type pos = 0, size_type n = npos);
-V iterator erase(iterator position);
-V iterator erase(iterator first, iterator last);
-V basic_string& replace(size_type pos1, size_type n1,
- const basic_string& str);
-V basic_string& replace(size_type pos1, size_type n1,
- const basic_string& str,
- size_type pos2, size_type n2);
-V basic_string& replace(size_type pos, size_type n1, const charT* s,
- size_type n2);
-V basic_string& replace(size_type pos, size_type n1, const charT* s);
-V basic_string& replace(size_type pos, size_type n1, size_type n2,
- charT c);
-V basic_string& replace(iterator i1, iterator i2, const basic_string& str);
-V basic_string& replace(iterator i1, iterator i2, const charT* s,
- size_type n);
-V basic_string& replace(iterator i1, iterator i2, const charT* s);
-V basic_string& replace(iterator i1, iterator i2,
- size_type n, charT c);
-V template<class InputIterator>
- basic_string& replace(iterator i1, iterator i2,
- InputIterator j1, InputIterator j2);
-V size_type copy(charT* s, size_type n, size_type pos = 0) const;
-V void swap(basic_string<charT,traits,Allocator>&);
- // _lib.string.ops_ string operations:
-V const charT* c_str() const; // explicit
-V const charT* data() const;
-V allocator_type get_allocator() const;
-V size_type find (const basic_string& str, size_type pos = 0) const;
-V size_type find (const charT* s, size_type pos, size_type n) const;
-V size_type find (const charT* s, size_type pos = 0) const;
-V size_type find (charT c, size_type pos = 0) const;
-V size_type rfind(const basic_string& str, size_type pos = npos) const;
-V size_type rfind(const charT* s, size_type pos, size_type n) const;
-V size_type rfind(const charT* s, size_type pos = npos) const;
-V size_type rfind(charT c, size_type pos = npos) const;
-
-V size_type find_first_of(const basic_string& str,
- size_type pos = 0) const;
-V size_type find_first_of(const charT* s,
- size_type pos, size_type n) const;
-V size_type find_first_of(const charT* s, size_type pos = 0) const;
-V size_type find_first_of(charT c, size_type pos = 0) const;
-V size_type find_last_of (const basic_string& str,
- size_type pos = npos) const;
-V size_type find_last_of (const charT* s,
- size_type pos, size_type n) const;
-V size_type find_last_of (const charT* s, size_type pos = npos) const;
-V size_type find_last_of (charT c, size_type pos = npos) const;
-V size_type find_first_not_of(const basic_string& str,
- size_type pos = 0) const;
-V size_type find_first_not_of(const charT* s, size_type pos,
- size_type n) const;
-V size_type find_first_not_of(const charT* s, size_type pos = 0) const;
-V size_type find_first_not_of(charT c, size_type pos = 0) const;
-V size_type find_last_not_of (const basic_string& str,
- size_type pos = npos) const;
-V size_type find_last_not_of (const charT* s, size_type pos,
- size_type n) const;
-V size_type find_last_not_of (const charT* s,
- size_type pos = npos) const;
-V size_type find_last_not_of (charT c, size_type pos = npos) const;
-V basic_string substr(size_type pos = 0, size_type n = npos) const;
-V int compare(const basic_string& str) const;
-V int compare(size_type pos1, size_type n1,
- const basic_string& str) const;
-V int compare(size_type pos1, size_type n1,
- const basic_string& str,
- size_type pos2, size_type n2) const;
-V int compare(const charT* s) const;
-V int compare(size_type pos1, size_type n1,
- const charT* s, size_type n2 = npos) const;
- };
- }
-
- 21.4 Null-terminated sequence utilities [lib.c.strings]
-
- Table 10--Header <cctype> synopsis
-
- isalnum isdigit isprint isupper tolower
-X isalpha isgraph ispunct isxdigit toupper
- iscntrl islower isspace
-
- Table 11--Header <cwctype> synopsis
-
-X Macro: WEOF <cwctype>
-X Types: wctrans_t wctype_t wint_t <cwctype>
- Functions:
-X iswalnum iswctype iswlower iswspace towctrans wctrans
-X iswalpha iswdigit iswprint iswupper towlower wctype
-X iswcntrl iswgraph iswpunct iswxdigit towupper
-
- Table 12--Header <cstring> synopsis
-
-X Macro: NULL <cstring>
-X Type: size_t <cstring>
- Functions:
-X memchr strcat strcspn strncpy strtok
-X memcmp strchr strerror strpbrk strxfrm
-X memcpy strcmp strlen strrchr
-X memmove strcoll strncat strspn
-X memset strcpy strncmp strstr
-
- Table 13--Header <cwchar> synopsis
- Macros: NULL <cwchar> WCHAR_MAX WCHAR_MIN WEOF <cwchar>
- Types: mbstate_t wint_t <cwchar> size_t
- Functions:
-X btowc getwchar ungetwc wcscpy wcsrtombs wmemchr
-X fgetwc mbrlen vfwprintf wcscspn wcsspn wmemcmp
-X fgetws mbrtowc vswprintf wcsftime wcsstr wmemcpy
-X fputwc mbsinit vwprintf wcslen wcstod wmemmove
-X fputws mbsrtowcs wcrtomb wcsncat wcstok wmemset
-X fwide putwc wcscat wcsncmp wcstol wprintf
-X fwprintf putwchar wcschr wcsncpy wcstoul wscanf
-X fwscanf swprintf wcscmp wcspbrk wcsxfrm
-X getwc swscanf wcscoll wcsrchr wctob
-
- Table 14--Header <cstdlib> synopsis
-
- Macros: MB_CUR_MAX
- Functions:
-X atol mblen strtod wctomb
-X atof mbstowcs strtol wcstombs
-X atoi mbtowc strtoul
-
-X const char* strchr(const char* s, int c);
-X char* strchr( char* s, int c);
-
-X const char* strpbrk(const char* s1, const char* s2);
-X char* strpbrk( char* s1, const char* s2);
-
-X const char* strrchr(const char* s, int c);
-X char* strrchr( char* s, int c);
-
-X const char* strstr(const char* s1, const char* s2);
-X char* strstr( char* s1, const char* s2);
-
-X const void* memchr(const void* s, int c, size_t n);
-X void* memchr( void* s, int c, size_t n);
-
-X const wchar_t* wcschr(const wchar_t* s, wchar_t c);
-X wchar_t* wcschr( wchar_t* s, wchar_t c);
-
-X const wchar_t* wcspbrk(const wchar_t* s1, const wchar_t* s2);
-X wchar_t* wcspbrk( wchar_t* s1, const wchar_t* s2);
-
-X const wchar_t* wcsrchr(const wchar_t* s, wchar_t c);
-X wchar_t* wcsrchr( wchar_t* s, wchar_t c);
-
-X const wchar_t* wcsstr(const wchar_t* s1, const wchar_t* s2);
-X wchar_t* wcsstr( wchar_t* s1, const wchar_t* s2);
-
-X const wchar_t* wmemchr(const wchar_t* s, wchar_t c, size_t n);
-X wchar_t* wmemchr( wchar_t* s, wchar_t c, size_t n);
-
- [for initial efforts on the above, see shadow/string.h]
-
- 22.1 Locales [lib.locales]
-
- Header <locale> synopsis
-
- // _lib.locale_, locale:
-T class locale;
-T template <class Facet> const Facet& use_facet(const locale&);
-T template <class Facet> bool has_facet(const locale&) throw();
-
- // _lib.locale.convenience_, convenience interfaces:
-T template <class charT> bool isspace (charT c, const locale& loc);
-T template <class charT> bool isprint (charT c, const locale& loc);
-T template <class charT> bool iscntrl (charT c, const locale& loc);
-T template <class charT> bool isupper (charT c, const locale& loc);
-T template <class charT> bool islower (charT c, const locale& loc);
-T template <class charT> bool isalpha (charT c, const locale& loc);
-T template <class charT> bool isdigit (charT c, const locale& loc);
-T template <class charT> bool ispunct (charT c, const locale& loc);
-T template <class charT> bool isxdigit(charT c, const locale& loc);
-T template <class charT> bool isalnum (charT c, const locale& loc);
-T template <class charT> bool isgraph (charT c, const locale& loc);
-T template <class charT> charT toupper(charT c, const locale& loc);
-T template <class charT> charT tolower(charT c, const locale& loc);
- // _lib.category.ctype_ and _lib.facet.ctype.special_, ctype:
- class ctype_base;
-T template <class charT> class ctype;
-T template <> class ctype<char>; // specialization
-S template <class charT> class ctype_byname;
-S template <> class ctype_byname<char>; // specialization
-T class codecvt_base;
-X template <class internT, class externT, class stateT> class codecvt;
-S template <class internT, class externT, class stateT> class codecvt_byname;
- // _lib.category.numeric_ and _lib.facet.numpunct_, numeric:
-X template <class charT, class InputIterator> class num_get;
-X template <class charT, class OutputIterator> class num_put;
-T template <class charT> class numpunct;
-S template <class charT> class numpunct_byname;
- // _lib.category.collate_, collation:
-T template <class charT> class collate;
-S template <class charT> class collate_byname;
- // _lib.category.time_, date and time:
-T class time_base;
-S template <class charT, class InputIterator> class time_get;
-S template <class charT, class InputIterator> class time_get_byname;
-S template <class charT, class OutputIterator> class time_put;
-S template <class charT, class OutputIterator> class time_put_byname;
- // _lib.category.monetary_, money:
-T class money_base;
-S template <class charT, class InputIterator> class money_get;
-S template <class charT, class OutputIterator> class money_put;
-S template <class charT, bool Intl> class moneypunct;
-S template <class charT, bool Intl> class moneypunct_byname;
- // _lib.category.messages_, message retrieval:
-T class messages_base;
-S template <class charT> class messages;
-S template <class charT> class messages_byname;
-
-
- 22.1.1 Class locale [lib.locale]
-
-X class locale {
- public:
- // types:
-T class facet;
-T class id;
-T typedef int category;
-T static const category // values assigned here are for exposition only
-T none = 0,
-T collate = 0x010, ctype = 0x020,
-T monetary = 0x040, numeric = 0x080,
-T time = 0x100, messages = 0x200,
-T all = collate | ctype | monetary | numeric | time | messages;
- // construct/copy/destroy:
-T locale() throw()
-T locale(const locale& other) throw()
-X explicit locale(const char* std_name);
-X locale(const locale& other, const char* std_name, category);
-T template <class Facet> locale(const locale& other, Facet* f);
-T locale(const locale& other, const locale& one, category);
-T ~locale() throw(); // non-virtual
-T const locale& operator=(const locale& other) throw();
-T template <class Facet> locale combine(const locale& other) const;
- // locale operations:
-X basic_string<char> name() const;
-T bool operator==(const locale& other) const;
-T bool operator!=(const locale& other) const;
-T template <class charT, class Traits, class Allocator>
- bool operator()(const basic_string<charT,Traits,Allocator>& s1,
- const basic_string<charT,Traits,Allocator>& s2) const;
- // global locale objects:
-T static locale global(const locale&);
-T static const locale& classic();
- };
-
- 22.1.1.1 locale types [lib.locale.types]
-
- 22.1.1.1.1 Type locale::category [lib.locale.category]
-
-T typedef int category;
-
-T none, collate, ctype, monetary, numeric, time, and messages
-
- [required locale members]
-T collate<char>, collate<wchar_t>
-T ctype<char>, ctype<wchar_t>
-T codecvt<char,char,mbstate_t>,
-S codecvt<wchar_t,char,mbstate_t>
-T moneypunct<char>, moneypunct<wchar_t>
-T moneypunct<char,true>, moneypunct<wchar_t,true>,
-S money_get<char>, money_get<wchar_t
-S money_put<char>, money_put<wchar_t>
-T numpunct<char>, numpunct<wchar_t>,
-X num_get<char>, num_get<wchar_t>
-X num_put<char>, num_put<wchar_t>
-S time_get<char>, time_get<wchar_t>,
-S time_put<char>, time_put<wchar_t>
-S messages<char>, messages<wchar_t>
-
- [required instantiations]
-S collate_byname<char>, collate_byname<wchar_t>
-S ctype_byname<char>, ctype_byname<wchar_t>
-S codecvt_byname<char,char,mbstate_t>,
-S codecvt_byname<wchar_t,char,mbstate_t>
-S moneypunct_byname<char,International>,
-S moneypunct_byname<wchar_t,International>,
-S money_get<C,InputIterator>,
-S money_put<C,OutputIterator>
-S numpunct_byname<char>, numpunct_byname<wchar_t>
-X num_get<C,InputIterator>, num_put<C,OutputIterator>
-S time_get<char,InputIterator>,
-S time_get_byname<char,InputIterator>,
-S time_get<wchar_t,OutputIterator>,
-S time_get_byname<wchar_t,OutputIterator>,
-S time_put<char,OutputIterator>,
-S time_put_byname<char,OutputIterator>,
-S time_put<wchar_t,OutputIterator>
-S time_put_byname<wchar_t,OutputIterator>
-S messages_byname<char>, messages_byname<wchar_t>
-
-
- 22.1.1.1.2 Class locale::facet [lib.locale.facet]
-
-T class locale::facet {
- protected:
-T explicit facet(size_t refs = 0);
-T virtual ~facet();
- private:
-T facet(const facet&); // not defined
-T void operator=(const facet&); // not defined
- };
- }
-
-
- 22.1.1.1.3 Class locale::id [lib.locale.id]
-
-T class locale::id {
- public:
-T id();
- private:
-T void operator=(const id&); // not defined
-T id(const id&); // not defined
- };
- }
-
-
- 22.2.1 The ctype category [lib.category.ctype]
-
-T class ctype_base {
- public:
-T enum mask { // numeric values are for exposition only.
-T space=, print=, cntrl=, upper=, lower=,
-T alpha=, digit=, punct=, xdigit=,
-T alnum=, graph=
- };
- };
-
-
- 22.2.1.1 Template class ctype [lib.locale.ctype]
-
-T template <class charT>
- class ctype : public locale::facet, public ctype_base {
- public:
-T typedef charT char_type;
-T explicit ctype(size_t refs = 0);
-T bool is(mask m, charT c) const;
-T const charT* is(const charT* low, const charT* high, mask* vec) const;
-T const charT* scan_is(mask m,
- const charT* low, const charT* high) const;
-T const charT* scan_not(mask m,
- const charT* low, const charT* high) const;
-T charT toupper(charT c) const;
-T const charT* toupper(charT* low, const charT* high) const;
-T charT tolower(charT c) const;
-T const charT* tolower(charT* low, const charT* high) const;
-T charT widen(char c) const;
-T const char* widen(const char* low, const char* high, charT* to) const;
-T char narrow(charT c, char dfault) const;
-T const charT* narrow(const charT* low, const charT*, char dfault,
- char* to) const;
-T static locale::id id;
-
- protected:
-T ~ctype(); // virtual
-T virtual bool do_is(mask m, charT c) const;
-T virtual const charT* do_is(const charT* low, const charT* high,
- mask* vec) const;
-T virtual const charT* do_scan_is(mask m,
- const charT* low, const charT* high) const;
-T virtual const charT* do_scan_not(mask m,
- const charT* low, const charT* high) const;
-T virtual charT do_toupper(charT) const;
-T virtual const charT* do_toupper(charT* low, const charT* high) const;
-T virtual charT do_tolower(charT) const;
-T virtual const charT* do_tolower(charT* low, const charT* high) const;
-T virtual charT do_widen(char) const;
-T virtual const char* do_widen(const char* low, const char* high,
- charT* dest) const;
-T virtual char do_narrow(charT, char dfault) const;
-T virtual const charT* do_narrow(const charT* low, const charT* high,
- char dfault, char* dest) const;
- };
-
-
- 22.2.1.2 Template class ctype_byname [lib.locale.ctype.byname]
-
-X template <class charT>
- class ctype_byname : public ctype<charT> {
- public:
-T typedef ctype<charT>::mask mask;
-S explicit ctype_byname(const char*, size_t refs = 0);
- protected:
-S ~ctype_byname(); // virtual
-S virtual bool do_is(mask m, charT c) const;
-S virtual const charT* do_is(const charT* low, const charT* high,
- mask* vec) const;
-S virtual const char* do_scan_is(mask m,
- const charT* low, const charT* high) const;
-S virtual const char* do_scan_not(mask m,
- const charT* low, const charT* high) const;
-S virtual charT do_toupper(charT) const;
-S virtual const charT* do_toupper(charT* low, const charT* high) const;
-S virtual charT do_tolower(charT) const;
-S virtual const charT* do_tolower(charT* low, const charT* high) const;
-S virtual charT do_widen(char) const;
-S virtual const char* do_widen(const char* low, const char* high,
- charT* dest) const;
-S virtual char do_narrow(charT, char dfault) const;
-S virtual const charT* do_narrow(const charT* low, const charT* high,
- char dfault, char* dest) const;
- };
-
- 22.2.1.3 ctype specializations [lib.facet.ctype.special]
-
-T template <> class ctype<char>
- : public locale::facet, public ctype_base {
- public:
-T typedef char char_type;
-T explicit ctype(const mask* tab = 0, bool del = false,
- size_t refs = 0);
-T bool is(mask m, char c) const;
-T const char* is(const char* low, const char* high, mask* vec) const;
-T const char* scan_is (mask m,
- const char* low, const char* high) const;
-T const char* scan_not(mask m,
- const char* low, const char* high) const;
-T char toupper(char c) const;
-T const char* toupper(char* low, const char* high) const;
-T char tolower(char c) const;
-T const char* tolower(char* low, const char* high) const;
-T char widen(char c) const;
-T const char* widen(const char* low, const char* high, char* to) const;
-T char narrow(char c, char dfault) const;
-T const char* narrow(const char* low, const char* high, char dfault,
- char* to) const;
-T static locale::id id;
-T static const size_t table_size = IMPLEMENTATION_DEFINED;
-
- protected:
-T const mask* table() const throw();
-T static const mask* classic_table() throw();
-T ~ctype(); // virtual
-T virtual char do_toupper(char c) const;
-T virtual const char* do_toupper(char* low, const char* high) const;
-T virtual char do_tolower(char c) const;
-T virtual const char* do_tolower(char* low, const char* high) const;
-
-T virtual char do_widen(char c) const;
-T virtual const char* do_widen(const char* low,
- const char* high,
- char* to) const;
-T virtual char do_narrow(char c, char dfault) const;
-T virtual const char* do_narrow(const char* low,
- const char* high,
- char dfault, char* to) const;
- };
-
-
- 22.2.1.4 Class [lib.locale.ctype.byname.special]
- ctype_byname<char>
-
-X template <> class ctype_byname<char> : public ctype<char> {
- public:
-S explicit ctype_byname(const char*, size_t refs = 0);
- protected:
-S ~ctype_byname(); // virtual
-S virtual char do_toupper(char c) const;
-S virtual const char* do_toupper(char* low, const char* high) const;
-S virtual char do_tolower(char c) const;
-S virtual const char* do_tolower(char* low, const char* high) const;
-
-S virtual char do_widen(char c) const;
-S virtual const char* do_widen(char* low,
- const char* high,
- char* to) const;
-S virtual char do_widen(char c) const;
-S virtual const char* do_widen(char* low, const char* high) const;
-
- };
-
-
-
- 22.2.1.5 Template class codecvt [lib.locale.codecvt]
-
-T class codecvt_base {
- public:
-T enum result { ok, partial, error, noconv };
- };
-
-T template <class internT, class externT, class stateT>
- class codecvt : public locale::facet, public codecvt_base {
- public:
-T typedef internT intern_type;
-T typedef externT extern_type;
-T typedef stateT state_type;
-T explicit codecvt(size_t refs = 0)
-T result out(stateT& state,
- const internT* from, const internT* from_end, const internT*& from_next,
- externT* to, externT* to_limit, externT*& to_next) const;
-T result unshift(stateT& state,
- externT* to, externT* to_limit, externT*& to_next) const;
-T result in(stateT& state,
- const externT* from, const externT* from_end, const externT*& from_next,
- internT* to, internT* to_limit, internT*& to_next) const;
-T int encoding() const throw();
-T bool always_noconv() const throw();
-T int length(const stateT&, const externT* from, const externT* end,
- size_t max) const;
-T int max_length() const throw();
-T static locale::id id;
-
- protected:
-T ~codecvt(); // virtual
-T virtual result do_out(stateT& state,
- const internT* from, const internT* from_end, const internT*& from_next,
- externT* to, externT* to_limit, externT*& to_next) const;
-T virtual result do_in(stateT& state,
-T const externT* from, const externT* from_end, const externT*& from_next,
- internT* to, internT* to_limit, internT*& to_next) const;
-T virtual result do_unshift(stateT& state,
- externT* to, externT* to_limit, externT*& to_next) const;
-T virtual int do_encoding() const throw();
-T virtual bool do_always_noconv() const throw();
-T virtual int do_length(const stateT&, const externT* from,
- const externT* end, size_t max) const;
-T virtual int do_max_length() const throw();
- };
- }
-
-
- 22.2.1.6 Template class [lib.locale.codecvt.byname]
- codecvt_byname
-
-X template <class internT, class externT, class stateT>
- class codecvt_byname : public codecvt<internT, externT, stateT> {
- public:
-S explicit codecvt_byname(const char*, size_t refs = 0);
- protected:
-S ~codecvt_byname(); // virtual
-S virtual result do_out(stateT& state,
- const internT* from, const internT* from_end, const internT*& from_next,
- externT* to, externT* to_limit, externT*& to_next) const;
-S virtual result do_in(stateT& state,
- const externT* from, const externT* from_end, const externT*& from_next,
- internT* to, internT* to_limit, internT*& to_next) const;
-S virtual result do_unshift(stateT& state,
- externT* to, externT* to_limit, externT*& to_next) const;
-S virtual int do_encoding() const throw();
-S virtual bool do_always_noconv() const throw();
-S virtual int do_length(const stateT&, const externT* from,
- const externT* end, size_t max) const;
-S virtual result do_unshift(stateT& state,
- externT* to, externT* to_limit, externT*& to_next) const;
-S virtual int do_max_length() const throw();
- };
-
-
- 22.2.2.1 Template class num_get [lib.locale.num.get]
-
-X template <class charT, class InputIterator = istreambuf_iterator<charT> >
- class num_get : public locale::facet {
- public:
-T typedef charT char_type;
-T typedef InputIterator iter_type;
-T explicit num_get(size_t refs = 0);
-T iter_type get(iter_type in, iter_type end, ios_base&,
- ios_base::iostate& err, bool& v) const;
-T iter_type get(iter_type in, iter_type end, ios_base& ,
- ios_base::iostate& err, long& v) const;
-T iter_type get(iter_type in, iter_type end, ios_base&,
- ios_base::iostate& err, unsigned short& v) const;
-T iter_type get(iter_type in, iter_type end, ios_base&,
- ios_base::iostate& err, unsigned int& v) const;
-T iter_type get(iter_type in, iter_type end, ios_base&,
- ios_base::iostate& err, unsigned long& v) const;
-T iter_type get(iter_type in, iter_type end, ios_base&,
- ios_base::iostate& err, float& v) const;
-T iter_type get(iter_type in, iter_type end, ios_base&,
- ios_base::iostate& err, double& v) const;
-T iter_type get(iter_type in, iter_type end, ios_base&,
- ios_base::iostate& err, long double& v) const;
-T iter_type get(iter_type in, iter_type end, ios_base&,
- ios_base::iostate& err, void*& v) const;
-T static locale::id id;
-
- protected:
-T ~num_get(); // virtual
-T virtual iter_type do_get(iter_type, iter_type, ios_base&,
- ios_base::iostate& err, bool& v) const;
-S virtual iter_type do_get(iter_type, iter_type, ios_base&,
- ios_base::iostate& err, long& v) const;
-S virtual iter_type do_get(iter_type, iter_type, ios_base&,
- ios_base::iostate& err, unsigned short& v) const;
-S virtual iter_type do_get(iter_type, iter_type, ios_base&,
- ios_base::iostate& err, unsigned int& v) const;
-S virtual iter_type do_get(iter_type, iter_type, ios_base&,
- ios_base::iostate& err, unsigned long& v) const;
-S virtual iter_type do_get(iter_type, iter_type, ios_base&,
- ios_base::iostate& err, float& v) const;
-S virtual iter_type do_get(iter_type, iter_type, ios_base&,
- ios_base::iostate& err, double& v) const;
-S virtual iter_type do_get(iter_type, iter_type, ios_base&,
- ios_base::iostate& err, long double& v) const;
-S virtual iter_type do_get(iter_type, iter_type, ios_base&,
- ios_base::iostate& err, void*& v) const;
- };
-
-
-
- 22.2.2.2 Template class num_put [lib.locale.nm.put]
-
-X template <class charT, class OutputIterator = ostreambuf_iterator<charT> >
- class num_put : public locale::facet {
- public:
-T typedef charT char_type;
-T typedef OutputIterator iter_type;
-T explicit num_put(size_t refs = 0);
-T iter_type put(iter_type s, ios_base& f, char_type fill, bool v) const;
-T iter_type put(iter_type s, ios_base& f, char_type fill, long v) const;
-T iter_type put(iter_type s, ios_base& f, char_type fill,
- unsigned long v) const;
-T iter_type put(iter_type s, ios_base& f, char_type fill,
- double v) const;
-T iter_type put(iter_type s, ios_base& f, char_type fill,
- long double v) const;
-T iter_type put(iter_type s, ios_base& f, char_type fill,
- const void* v) const;
-T static locale::id id;
- protected:
-T ~num_put(); // virtual
-T virtual iter_type do_put(iter_type, ios_base&, char_type fill,
- bool v) const;
-T virtual iter_type do_put(iter_type, ios_base&, char_type fill,
- long v) const;
-T virtual iter_type do_put(iter_type, ios_base&, char_type fill,
- unsigned long) const;
-S virtual iter_type do_put(iter_type, ios_base&, char_type fill,
- double v) const;
-S virtual iter_type do_put(iter_type, ios_base&, char_type fill,
- long double v) const;
-T virtual iter_type do_put(iter_type, ios_base&, char_type fill,
- const void* v) const;
- };
- }
-
- 22.2.3.1 Template class numpunct [lib.locale.numpunct]
-
-T template <class charT>
- class numpunct : public locale::facet {
- public:
-T typedef charT char_type;
-T typedef basic_string<charT> string_type;
-T explicit numpunct(size_t refs = 0);
-T char_type decimal_point() const;
-T char_type thousands_sep() const;
-T string grouping() const;
-T string_type truename() const;
-T string_type falsename() const;
-T static locale::id id;
- protected:
-T ~numpunct(); // virtual
-T virtual char_type do_decimal_point() const;
-T virtual char_type do_thousands_sep() const;
-T virtual string do_grouping() const;
-T virtual string_type do_truename() const; // for bool
-T virtual string_type do_falsename() const; // for bool
- };
- }
-
-
-
- 22.2.3.2 Template class [lib.locale.numpunct.byname]
- numpunct_byname
-
-X template <class charT>
- class numpunct_byname : public numpunct<charT> {
- // this class is specialized for char and wchar_t.
- public:
-T typedef charT char_type;
-T typedef basic_string<charT> string_type;
-S explicit numpunct_byname(const char*, size_t refs = 0);
- protected:
-S ~numpunct_byname(); // virtual
-S virtual char_type do_decimal_point() const;
-S virtual char_type do_thousands_sep() const;
-S virtual string do_grouping() const;
-S virtual string_type do_truename() const; // for bool
-S virtual string_type do_falsename() const; // for bool
- };
-
-
- 22.2.4.1 Template class collate [lib.locale.collate]
-
-T template <class charT>
- class collate : public locale::facet {
- public:
-T typedef charT char_type;
-T typedef basic_string<charT> string_type;
-T explicit collate(size_t refs = 0);
-T int compare(const charT* low1, const charT* high1,
- const charT* low2, const charT* high2) const;
-T string_type transform(const charT* low, const charT* high) const;
-T long hash(const charT* low, const charT* high) const;
-T static locale::id id;
- protected:
-T ~collate(); // virtual
-T virtual int do_compare(const charT* low1, const charT* high1,
- const charT* low2, const charT* high2) const;
-T virtual string_type do_transform
- (const charT* low, const charT* high) const;
-T virtual long do_hash (const charT* low, const charT* high) const;
- };
-
-
- 22.2.4.2 Template class [lib.locale.collate.byname]
- collate_byname
-
-X template <class charT>
- class collate_byname : public collate<charT> {
- public:
-T typedef basic_string<charT> string_type;
-T explicit collate_byname(const char*, size_t refs = 0);
- protected:
-S ~collate_byname(); // virtual
-S virtual int do_compare(const charT* low1, const charT* high1,
- const charT* low2, const charT* high2) const;
-S virtual string_type do_transform
- (const charT* low, const charT* high) const;
-S virtual long do_hash (const charT* low, const charT* high) const;
- };
-
-
- 22.2.5.1 Template class time_get [lib.locale.time.get]
-
-T class time_base {
- public:
-T enum dateorder { no_order, dmy, mdy, ymd, ydm };
- };
-
- [Note: semantics of time_get members are implementation-defined.
- To complete implementation requires documenting behavior.]
-
-X template <class charT, class InputIterator = istreambuf_iterator<charT> >
- class time_get : public locale::facet, public time_base {
- public:
-T typedef charT char_type;
-T typedef InputIterator iter_type;
-T explicit time_get(size_t refs = 0);
-
-T dateorder date_order() const { return do_date_order(); }
-T iter_type get_time(iter_type s, iter_type end, ios_base& f,
- ios_base::iostate& err, tm* t) const;
-T iter_type get_date(iter_type s, iter_type end, ios_base& f,
- ios_base::iostate& err, tm* t) const;
-T iter_type get_weekday(iter_type s, iter_type end, ios_base& f,
- ios_base::iostate& err, tm* t) const;
-T iter_type get_monthname(iter_type s, iter_type end, ios_base& f,
- ios_base::iostate& err, tm* t) const;
-T iter_type get_year(iter_type s, iter_type end, ios_base& f,
- ios_base::iostate& err, tm* t) const;
-T static locale::id id;
- protected:
- ~time_get(); // virtual
-X virtual dateorder do_date_order() const;
-S virtual iter_type do_get_time(iter_type s, iter_type end, ios_base&,
- ios_base::iostate& err, tm* t) const;
-S virtual iter_type do_get_date(iter_type s, iter_type end, ios_base&,
- ios_base::iostate& err, tm* t) const;
-S virtual iter_type do_get_weekday(iter_type s, iter_type end, ios_base&,
- ios_base::iostate& err, tm* t) const;
-S virtual iter_type do_get_monthname(iter_type s, ios_base&,
- ios_base::iostate& err, tm* t) const;
-S virtual iter_type do_get_year(iter_type s, iter_type end, ios_base&,
- ios_base::iostate& err, tm* t) const;
- };
-
-
-
- 22.2.5.2 Template class [lib.locale.time.get.byname]
- time_get_byname
-
-X template <class charT, class InputIterator = istreambuf_iterator<charT> >
- class time_get_byname : public time_get<charT, InputIterator> {
- public:
-T typedef time_base::dateorder dateorder;
-T typedef InputIterator iter_type
-
-S explicit time_get_byname(const char*, size_t refs = 0);
- protected:
-S ~time_get_byname(); // virtual
-S virtual dateorder do_date_order() const;
-S virtual iter_type do_get_time(iter_type s, iter_type end, ios_base&,
- ios_base::iostate& err, tm* t) const;
-S virtual iter_type do_get_date(iter_type s, iter_type end, ios_base&,
- ios_base::iostate& err, tm* t) const;
-T virtual iter_type do_get_weekday(iter_type s, iter_type end, ios_base&,
- ios_base::iostate& err, tm* t) const;
-T virtual iter_type do_get_monthname(iter_type s, iter_type end, ios_base&,
- ios_base::iostate& err, tm* t) const;
-S virtual iter_type do_get_year(iter_type s, iter_type end, ios_base&,
- ios_base::iostate& err, tm* t) const;
- };
- }
-
- 22.2.5.3 Template class time_put [lib.locale.time.put]
-
-X template <class charT, class OutputIterator = ostreambuf_iterator<charT> >
- class time_put : public locale::facet {
- public:
-T typedef charT char_type;
-T typedef OutputIterator iter_type;
-T explicit time_put(size_t refs = 0);
- // the following is implemented in terms of other member functions.
-S iter_type put(iter_type s, ios_base& f, char_type fill, const tm* tmb,
- const charT* pattern, const charT* pat_end) const;
-T iter_type put(iter_type s, ios_base& f, char_type fill,
- const tm* tmb, char format, char modifier = 0) const;
-T static locale::id id;
- protected:
-T ~time_put(); // virtual
-S virtual iter_type do_put(iter_type s, ios_base&, char_type, const tm* t,
- char format, char modifier) const;
- };
-
-
-
- 22.2.5.4 Template class [lib.locale.time.put.byname]
- time_put_byname
-
-T template <class charT, class OutputIterator = ostreambuf_iterator<charT> >
- class time_put_byname : public time_put<charT, OutputIterator>
- {
- public:
-T typedef charT char_type;
-T typedef OutputIterator iter_type;
-
-T explicit time_put_byname(const char*, size_t refs = 0);
- protected:
-T ~time_put_byname(); // virtual
-S virtual iter_type do_put(iter_type s, ios_base&, char_type, const tm* t,
- char format, char modifier) const;
- };
-
-
- 22.2.6.1 Template class money_get [lib.locale.money.get]
-
-X template <class charT,
- class InputIterator = istreambuf_iterator<charT> >
- class money_get : public locale::facet {
- public:
-T typedef charT char_type;
-T typedef InputIterator iter_type;
-T typedef basic_string<charT> string_type;
-T explicit money_get(size_t refs = 0);
-T iter_type get(iter_type s, iter_type end, bool intl,
- ios_base& f, ios_base::iostate& err,
- long double& units) const;
-T iter_type get(iter_type s, iter_type end, bool intl,
- ios_base& f, ios_base::iostate& err,
- string_type& digits) const;
-T static locale::id id;
- protected:
-T ~money_get(); // virtual
-S virtual iter_type do_get(iter_type, iter_type, bool, ios_base&,
- ios_base::iostate& err, long double& units) const;
-S virtual iter_type do_get(iter_type, iter_type, bool, ios_base&,
- ios_base::iostate& err, string_type& digits) const;
- };
-
- 22.2.6.2 Template class money_put [lib.locale.money.put]
-
-X template <class charT,
- class OutputIterator = ostreambuf_iterator<charT> >
- class money_put : public locale::facet {
- public:
-T typedef charT char_type;
-T typedef OutputIterator iter_type;
-T typedef basic_string<charT> string_type;
-T explicit money_put(size_t refs = 0);
-T iter_type put(iter_type s, bool intl, ios_base& f,
- char_type fill, long double units) const;
-T iter_type put(iter_type s, bool intl, ios_base& f,
- char_type fill, const string_type& digits) const;
-T static locale::id id;
-
- protected:
-T ~money_put(); // virtual
-S virtual iter_type
- do_put(iter_type, bool, ios_base&, char_type fill,
- long double units) const;
-S virtual iter_type
- do_put(iter_type, bool, ios_base&, char_type fill,
- const string_type& digits) const;
- };
-
-
- 22.2.6.3 Template class moneypunct [lib.locale.moneypunct]
-
-T class money_base {
- public:
-T enum part { none, space, symbol, sign, value };
-T struct pattern { char field[4]; };
- };
-
-X template <class charT, bool International = false>
- class moneypunct : public locale::facet, public money_base {
- public:
-T typedef charT char_type;
-T typedef basic_string<charT> string_type;
-T explicit moneypunct(size_t refs = 0);
-T charT decimal_point() const;
-T charT thousands_sep() const;
-T string grouping() const;
-T string_type curr_symbol() const;
-T string_type positive_sign() const;
-T string_type negative_sign() const;
-T int frac_digits() const;
-T pattern pos_format() const;
-T pattern neg_format() const;
-T static locale::id id;
-T static const bool intl = International;
- protected:
-T ~moneypunct(); // virtual
-S virtual charT do_decimal_point() const;
-S virtual charT do_thousands_sep() const;
-S virtual string do_grouping() const;
-S virtual string_type do_curr_symbol() const;
-S virtual string_type do_positive_sign() const;
-S virtual string_type do_negative_sign() const;
-S virtual int do_frac_digits() const;
-T virtual pattern do_pos_format() const;
-T virtual pattern do_neg_format() const;
- };
- }
-
- 22.2.6.4 Template class [lib.locale.moneypunct.byname]
- moneypunct_byname
-
-X template <class charT, bool Intl = false>
- class moneypunct_byname : public moneypunct<charT, Intl> {
- public:
-T typedef money_base::pattern pattern;
-T typedef basic_string<charT> string_type;
-
-T explicit moneypunct_byname(const char*, size_t refs = 0);
- protected:
-T ~moneypunct_byname(); // virtual
-S virtual charT do_decimal_point() const;
-S virtual charT do_thousands_sep() const;
-S virtual string do_grouping() const;
-S virtual string_type do_curr_symbol() const;
-S virtual string_type do_positive_sign() const;
-S virtual string_type do_negative_sign() const;
-S virtual int do_frac_digits() const;
-S virtual pattern do_pos_format() const;
-S virtual pattern do_neg_format() const;
- };
-
- 22.2.7.1 Template class messages [lib.locale.messages]
-
-T class messages_base {
- public:
-T typedef int catalog;
- };
-
-X template <class charT>
- class messages : public locale::facet, public messages_base {
- public:
-T typedef charT char_type;
-T typedef basic_string<charT> string_type;
-T explicit messages(size_t refs = 0);
-T catalog open(const basic_string<char>& fn, const locale&) const;
-T string_type get(catalog c, int set, int msgid,
- const string_type& dfault) const;
-T void close(catalog c) const;
-T static locale::id id;
- protected:
-T ~messages(); // virtual
-S virtual catalog do_open(const basic_string<char>&, const locale&) const;
-S virtual string_type do_get(catalog, int set, int msgid,
- const string_type& dfault) const;
-S virtual void do_close(catalog) const;
- };
-
- 22.2.7.2 Template class [lib.locale.messages.byname]
- messages_byname
-
-
-X template <class charT>
- class messages_byname : public messages<charT> {
- public:
-T typedef messages_base::catalog catalog;
-T typedef basic_string<charT> string_type;
-
-T explicit messages_byname(const char*, size_t refs = 0);
- protected:
-T ~messages_byname(); // virtual
-S virtual catalog do_open(const basic_string<char>&, const locale&) const;
-S virtual string_type do_get(catalog, int set, int msgid,
- const string_type& dfault) const;
-S virtual void do_close(catalog) const;
- };
-
-
- 22.3 C Library Locales [lib.c.locales]
-
-
- Table 13--Header <clocale> synopsis
- Macros:
-X LC_ALL LC_COLLATE LC_CTYPE
-X LC_MONETARY LC_NUMERIC LC_TIME
-X NULL
-X Struct: lconv
-X Functions: localeconv setlocale
-
-
- 23.2 Sequences [lib.sequences]
-
- <deque>, <list>, <queue>, <stack>, and <vector>.
-
- Header <deque> synopsis
-
-T template <class T, class Allocator = allocator<T> > class deque;
-T template <class T, class Allocator>
- bool operator==(const deque<T,Allocator>& x, const deque<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator< (const deque<T,Allocator>& x, const deque<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator!=(const deque<T,Allocator>& x, const deque<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator> (const deque<T,Allocator>& x, const deque<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator>=(const deque<T,Allocator>& x, const deque<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator<=(const deque<T,Allocator>& x, const deque<T,Allocator>& y);
-T template <class T, class Allocator>
- void swap(deque<T,Allocator>& x, deque<T,Allocator>& y);
- }
-
- Header <list> synopsis
-
-T template <class T, class Allocator = allocator<T> > class list;
-T template <class T, class Allocator>
- bool operator==(const list<T,Allocator>& x, const list<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator< (const list<T,Allocator>& x, const list<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator!=(const list<T,Allocator>& x, const list<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator> (const list<T,Allocator>& x, const list<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator>=(const list<T,Allocator>& x, const list<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator<=(const list<T,Allocator>& x, const list<T,Allocator>& y);
-T template <class T, class Allocator>
- void swap(list<T,Allocator>& x, list<T,Allocator>& y);
- }
-
- Header <queue> synopsis
-
- namespace std {
-T template <class T, class Container = deque<T> > class queue;
-T template <class T, class Container>
- bool operator==(const queue<T, Container>& x,
- const queue<T, Container>& y);
-T template <class T, class Container>
- bool operator< (const queue<T, Container>& x,
- const queue<T, Container>& y);
-T template <class T, class Container>
- bool operator!=(const queue<T, Container>& x,
- const queue<T, Container>& y);
-T template <class T, class Container>
- bool operator> (const queue<T, Container>& x,
- const queue<T, Container>& y);
-T template <class T, class Container>
- bool operator>=(const queue<T, Container>& x,
- const queue<T, Container>& y);
-T template <class T, class Container>
- bool operator<=(const queue<T, Container>& x,
- const queue<T, Container>& y);
-T template <class T, class Container = vector<T>,
- class Compare = less<typename Container::value_type> >
-T class priority_queue;
- }
-
- Header <stack> synopsis
-
- namespace std {
-T template <class T, class Container = deque<T> > class stack;
-T template <class T, class Container>
- bool operator==(const stack<T, Container>& x,
- const stack<T, Container>& y);
-T template <class T, class Container>
- bool operator< (const stack<T, Container>& x,
- const stack<T, Container>& y);
-T template <class T, class Container>
- bool operator!=(const stack<T, Container>& x,
- const stack<T, Container>& y);
-T template <class T, class Container>
- bool operator> (const stack<T, Container>& x,
- const stack<T, Container>& y);
-T template <class T, class Container>
- bool operator>=(const stack<T, Container>& x,
- const stack<T, Container>& y);
-T template <class T, class Container>
- bool operator<=(const stack<T, Container>& x,
- const stack<T, Container>& y);
- }
-
- Header <vector> synopsis
-
-T template <class T, class Allocator = allocator<T> > class vector;
-
-T template <class T, class Allocator>
- bool operator==(const vector<T,Allocator>& x,
- const vector<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator< (const vector<T,Allocator>& x,
- const vector<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator!=(const vector<T,Allocator>& x,
- const vector<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator> (const vector<T,Allocator>& x,
- const vector<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator>=(const vector<T,Allocator>& x,
- const vector<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator<=(const vector<T,Allocator>& x,
- const vector<T,Allocator>& y);
-T template <class T, class Allocator>
- void swap(vector<T,Allocator>& x, vector<T,Allocator>& y);
-
-T template <class Allocator> class vector<bool,Allocator>;
-T template <class Allocator>
- bool operator==(const vector<bool,Allocator>& x,
- const vector<bool,Allocator>& y);
-T template <class Allocator>
- bool operator< (const vector<bool,Allocator>& x,
- const vector<bool,Allocator>& y);
-T template <class Allocator>
- bool operator!=(const vector<bool,Allocator>& x,
- const vector<bool,Allocator>& y);
-T template <class Allocator>
- bool operator> (const vector<bool,Allocator>& x,
- const vector<bool,Allocator>& y);
-T template <class Allocator>
- bool operator>=(const vector<bool,Allocator>& x,
- const vector<bool,Allocator>& y);
-T template <class Allocator>
- bool operator<=(const vector<bool,Allocator>& x,
- const vector<bool,Allocator>& y);
-T template <class Allocator>
- void swap(vector<bool,Allocator>& x, vector<bool,Allocator>& y);
- }
-
- 23.2.1 Template class deque [lib.deque]
-
- template <class T, class Allocator = allocator<T> >
-T class deque {
- public:
- // types:
-T typedef typename Allocator::reference reference;
-T typedef typename Allocator::const_reference const_reference;
-T typedef implementation defined iterator;
-T typedef implementation defined const_iterator;
-T typedef implementation defined size_type;
-T typedef implementation defined difference_type;
-T typedef T value_type;
-T typedef Allocator allocator_type;
-T typedef typename Allocator::pointer pointer;
-T typedef typename Allocator::const_pointer const_pointer;
-T typedef std::reverse_iterator<iterator> reverse_iterator;
-T typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
- // _lib.deque.cons_ construct/copy/destroy:
-T explicit deque(const Allocator& = Allocator());
-T explicit deque(size_type n, const T& value = T(),
- const Allocator& = Allocator());
-T template <class InputIterator>
- deque(InputIterator first, InputIterator last,
- const Allocator& = Allocator());
-T deque(const deque<T,Allocator>& x);
-T ~deque();
-T deque<T,Allocator>& operator=(const deque<T,Allocator>& x);
-T template <class InputIterator>
- void assign(InputIterator first, InputIterator last);
-T void assign(size_type n, const T& t);
-T allocator_type get_allocator() const;
- // iterators:
-T iterator begin();
-T const_iterator begin() const;
-T iterator end();
-T const_iterator end() const;
-T reverse_iterator rbegin();
-T const_reverse_iterator rbegin() const;
-T reverse_iterator rend();
-T const_reverse_iterator rend() const;
- // _lib.deque.capacity_ capacity:
-T size_type size() const;
-T size_type max_size() const;
-T void resize(size_type sz, T c = T());
-T bool empty() const;
-
- // element access:
-T reference operator[](size_type n);
-T const_reference operator[](size_type n) const;
-T reference at(size_type n);
-T const_reference at(size_type n) const;
-T reference front();
-T const_reference front() const;
-T reference back();
-T const_reference back() const;
- // _lib.deque.modifiers_ modifiers:
-T void push_front(const T& x);
-T void push_back(const T& x);
-T iterator insert(iterator position, const T& x);
-T void insert(iterator position, size_type n, const T& x);
-T template <class InputIterator>
- void insert (iterator position,
- InputIterator first, InputIterator last);
-T void pop_front();
-T void pop_back();
-T iterator erase(iterator position);
-T iterator erase(iterator first, iterator last);
-T void swap(deque<T,Allocator>&);
-T void clear();
- };
-T template <class T, class Allocator>
- bool operator==(const deque<T,Allocator>& x,
- const deque<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator< (const deque<T,Allocator>& x,
- const deque<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator!=(const deque<T,Allocator>& x,
- const deque<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator> (const deque<T,Allocator>& x,
- const deque<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator>=(const deque<T,Allocator>& x,
- const deque<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator<=(const deque<T,Allocator>& x,
- const deque<T,Allocator>& y);
- // specialized algorithms:
-T template <class T, class Allocator>
- void swap(deque<T,Allocator>& x, deque<T,Allocator>& y);
-
-
- 23.2.2 Template class list [lib.list]
-
-T template <class T, class Allocator = allocator<T> >
- class list {
- public:
- // types:
-T typedef typename Allocator::reference reference;
-T typedef typename Allocator::const_reference const_reference;
-T typedef implementation defined iterator;
-T typedef implementation defined const_iterator;
-T typedef implementation defined size_type;
-T typedef implementation defined difference_type;
-T typedef T value_type;
-T typedef Allocator allocator_type;
-T typedef typename Allocator::pointer pointer;
-T typedef typename Allocator::const_pointer const_pointer;
-T typedef std::reverse_iterator<iterator> reverse_iterator;
-T typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
-
- // _lib.list.cons_ construct/copy/destroy:
-T explicit list(const Allocator& = Allocator());
-T explicit list(size_type n, const T& value = T(),
- const Allocator& = Allocator());
-T template <class InputIterator>
- list(InputIterator first, InputIterator last,
- const Allocator& = Allocator());
-T list(const list<T,Allocator>& x);
-T ~list();
-T list<T,Allocator>& operator=(const list<T,Allocator>& x);
-T template <class InputIterator>
- void assign(InputIterator first, InputIterator last);
-T void assign(size_type n, const T& t);
-T allocator_type get_allocator() const;
- // iterators:
-T iterator begin();
-T const_iterator begin() const;
-T iterator end();
-T const_iterator end() const;
-T reverse_iterator rbegin();
-T const_reverse_iterator rbegin() const;
-T reverse_iterator rend();
-T const_reverse_iterator rend() const;
- // _lib.list.capacity_ capacity:
-T bool empty() const;
-T size_type size() const;
-T size_type max_size() const;
-T void resize(size_type sz, T c = T());
- // element access:
-T reference front();
-T const_reference front() const;
-T reference back();
-T const_reference back() const;
- // _lib.list.modifiers_ modifiers:
-T void push_front(const T& x);
-T void pop_front();
-T void push_back(const T& x);
-T void pop_back();
-T iterator insert(iterator position, const T& x);
-T void insert(iterator position, size_type n, const T& x);
-T template <class InputIterator>
- void insert(iterator position, InputIterator first,
- InputIterator last);
-T iterator erase(iterator position);
-T iterator erase(iterator position, iterator last);
-T void swap(list<T,Allocator>&);
-T void clear();
- // _lib.list.ops_ list operations:
-T void splice(iterator position, list<T,Allocator>& x);
-T void splice(iterator position, list<T,Allocator>& x, iterator i);
-T void splice(iterator position, list<T,Allocator>& x, iterator first,
- iterator last);
-T void remove(const T& value);
-T template <class Predicate> void remove_if(Predicate pred);
-
-T void unique();
-T template <class BinaryPredicate>
- void unique(BinaryPredicate binary_pred);
-T void merge(list<T,Allocator>& x);
-T template <class Compare> void merge(list<T,Allocator>& x, Compare comp);
- void sort();
-T template <class Compare> void sort(Compare comp);
- void reverse();
- };
-T template <class T, class Allocator>
- bool operator==(const list<T,Allocator>& x, const list<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator< (const list<T,Allocator>& x, const list<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator!=(const list<T,Allocator>& x, const list<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator> (const list<T,Allocator>& x, const list<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator>=(const list<T,Allocator>& x, const list<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator<=(const list<T,Allocator>& x, const list<T,Allocator>& y);
- // specialized algorithms:
-T template <class T, class Allocator>
- void swap(list<T,Allocator>& x, list<T,Allocator>& y);
-
-
- 23.2.3.1 Template class queue [lib.queue]
-
-T template <class T, class Container = deque<T> >
- class queue {
- public:
-T typedef typename Container::value_type value_type;
-T typedef typename Container::size_type size_type;
-T typedef Container container_type;
- protected:
-T Container c;
- public:
-T explicit queue(const Container& = Container());
-
-T bool empty() const { return c.empty(); }
-T size_type size() const { return c.size(); }
-T value_type& front() { return c.front(); }
-T const value_type& front() const { return c.front(); }
-T value_type& back() { return c.back(); }
-T const value_type& back() const { return c.back(); }
-T void push(const value_type& x) { c.push_back(x); }
-T void pop() { c.pop_front(); }
- };
-
-T template <class T, class Container>
- bool operator==(const queue<T, Container>& x,
- const queue<T, Container>& y);
-T template <class T, class Container>
- bool operator< (const queue<T, Container>& x,
- const queue<T, Container>& y);
-T template <class T, class Container>
- bool operator!=(const queue<T, Container>& x,
- const queue<T, Container>& y);
-T template <class T, class Container>
- bool operator> (const queue<T, Container>& x,
- const queue<T, Container>& y);
-T template <class T, class Container>
- bool operator>=(const queue<T, Container>& x,
- const queue<T, Container>& y);
-T template <class T, class Container>
- bool operator<=(const queue<T, Container>& x,
- const queue<T, Container>& y);
-
- 23.2.3.2 Template class priority_queue [lib.priority.queue]
-
-T template <class T, class Container = vector<T>,
- class Compare = less<typename Container::value_type> >
- class priority_queue {
- public:
-T typedef typename Container::value_type value_type;
-T typedef typename Container::size_type size_type;
-T typedef Container container_type;
- protected:
-T Container c;
-T Compare comp;
- public:
-T explicit priority_queue(const Compare& x = Compare(),
- const Container& = Container());
-T template <class InputIterator>
- priority_queue(InputIterator first, InputIterator last,
- const Compare& x = Compare(),
- const Container& = Container());
-
-T bool empty() const { return c.empty(); }
-T size_type size() const { return c.size(); }
-T const value_type& top() const { return c.front(); }
-T void push(const value_type& x);
-T void pop();
- };
-
- 23.2.3.3 Template class stack [lib.stack]
-
-T template <class T, class Container = deque<T> >
- class stack {
- public:
-T typedef typename Container::value_type value_type;
-T typedef typename Container::size_type size_type;
-T typedef Container container_type;
- protected:
-T Container c;
- public:
-T explicit stack(const Container& = Container());
-
-T bool empty() const { return c.empty(); }
-T size_type size() const { return c.size(); }
-T value_type& top() { return c.back(); }
-T const value_type& top() const { return c.back(); }
-T void push(const value_type& x) { c.push_back(x); }
-T void pop() { c.pop_back(); }
- };
-T template <class T, class Container>
- bool operator==(const stack<T, Container>& x,
- const stack<T, Container>& y);
-T template <class T, class Container>
- bool operator< (const stack<T, Container>& x,
- const stack<T, Container>& y);
-T template <class T, class Container>
- bool operator!=(const stack<T, Container>& x,
- const stack<T, Container>& y);
-T template <class T, class Container>
- bool operator> (const stack<T, Container>& x,
- const stack<T, Container>& y);
-T template <class T, class Container>
- bool operator>=(const stack<T, Container>& x,
- const stack<T, Container>& y);
-T template <class T, class Container>
- bool operator<=(const stack<T, Container>& x,
- const stack<T, Container>& y);
-
- 23.2.4 Template class vector [lib.vector]
-
- template <class T, class Allocator = allocator<T> >
-T class vector {
- public:
- // types:
-T typedef typename Allocator::reference reference;
-T typedef typename Allocator::const_reference const_reference;
-T typedef implementation defined iterator;
-T typedef implementation defined const_iterator;
-T typedef implementation defined size_type;
-T typedef implementation defined difference_type;
-T typedef T value_type;
-T typedef Allocator allocator_type;
-T typedef typename Allocator::pointer pointer;
-T typedef typename Allocator::const_pointer const_pointer
-T typedef std::reverse_iterator<iterator> reverse_iterator;
-T typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
- // _lib.vector.cons_ construct/copy/destroy:
-T explicit vector(const Allocator& = Allocator());
-T explicit vector(size_type n, const T& value = T(),
- const Allocator& = Allocator());
-T template <class InputIterator>
- vector(InputIterator first, InputIterator last,
- const Allocator& = Allocator());
-T vector(const vector<T,Allocator>& x);
-T ~vector();
-T vector<T,Allocator>& operator=(const vector<T,Allocator>& x);
-T template <class InputIterator>
- void assign(InputIterator first, InputIterator last);
-T void assign(size_type n, const T& u);
-T allocator_type get_allocator() const;
- // iterators:
-T iterator begin();
-T const_iterator begin() const;
-T iterator end();
-T const_iterator end() const;
-T reverse_iterator rbegin();
-T const_reverse_iterator rbegin() const;
-T reverse_iterator rend();
-T const_reverse_iterator rend() const;
- // _lib.vector.capacity_ capacity:
-T size_type size() const;
-T size_type max_size() const;
-T void resize(size_type sz, T c = T());
-T size_type capacity() const;
-T bool empty() const;
-T void reserve(size_type n);
-
- // element access:
-T reference operator[](size_type n);
-T const_reference operator[](size_type n) const;
-T const_reference at(size_type n) const;
-T reference at(size_type n);
-T reference front();
-T const_reference front() const;
-T reference back();
-T const_reference back() const;
- // _lib.vector.modifiers_ modifiers:
-T void push_back(const T& x);
-T void pop_back();
-T iterator insert(iterator position, const T& x);
-T void insert(iterator position, size_type n, const T& x);
-T template <class InputIterator>
- void insert(iterator position,
- InputIterator first, InputIterator last);
-T iterator erase(iterator position);
-T iterator erase(iterator first, iterator last);
-T void swap(vector<T,Allocator>&);
-T void clear();
- };
-
-T template <class T, class Allocator>
- bool operator==(const vector<T,Allocator>& x,
- const vector<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator< (const vector<T,Allocator>& x,
- const vector<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator!=(const vector<T,Allocator>& x,
- const vector<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator> (const vector<T,Allocator>& x,
- const vector<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator>=(const vector<T,Allocator>& x,
- const vector<T,Allocator>& y);
-T template <class T, class Allocator>
- bool operator<=(const vector<T,Allocator>& x,
- const vector<T,Allocator>& y);
- // specialized algorithms:
-T template <class T, class Allocator>
- void swap(vector<T,Allocator>& x, vector<T,Allocator>& y);
-
-
- 23.2.5 Class vector<bool> [lib.vector.bool]
-
-T template <class Allocator> class vector<bool, Allocator> {
- public:
- // types:
-T typedef bool const_reference;
-T typedef implementation defined iterator;
-T typedef implementation defined const_iterator;
-T typedef implementation defined size_type;
-T typedef implementation defined difference_type;
-T typedef bool value_type;
-T typedef Allocator allocator_type;
-T typedef implementation defined pointer;
-T typedef implementation defined const_pointer
-T typedef std::reverse_iterator<iterator> reverse_iterator;
-T typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
- // bit reference:
-T class reference {
- friend class vector;
-T reference();
- public:
-T ~reference();
-T operator bool() const;
-T reference& operator=(const bool x);
-T reference& operator=(const reference& x);
-T void flip(); // flips the bit
- };
-
- // construct/copy/destroy:
-T explicit vector(const Allocator& = Allocator());
-T explicit vector(size_type n, const bool& value = bool(),
- const Allocator& = Allocator());
-T template <class InputIterator>
- vector(InputIterator first, InputIterator last,
- const Allocator& = Allocator());
-T vector(const vector<bool,Allocator>& x);
-T ~vector();
-T vector<bool,Allocator>& operator=(const vector<bool,Allocator>& x);
-T template <class InputIterator>
- void assign(InputIterator first, InputIterator last);
-T void assign(size_type n, const T& t);
-T allocator_type get_allocator() const;
- // iterators:
-T iterator begin();
-T const_iterator begin() const;
-T iterator end();
-T const_iterator end() const;
-T reverse_iterator rbegin();
-T const_reverse_iterator rbegin() const;
-T reverse_iterator rend();
-T const_reverse_iterator rend() const;
- // capacity:
-T size_type size() const;
-T size_type max_size() const;
-T void resize(size_type sz, bool c = false);
-T size_type capacity() const;
-T bool empty() const;
-T void reserve(size_type n);
- // element access:
-T reference operator[](size_type n);
-T const_reference operator[](size_type n) const;
-T const_reference at(size_type n) const;
-T reference at(size_type n);
-T reference front();
-T const_reference front() const;
-T reference back();
-T const_reference back() const;
- // modifiers:
-T void push_back(const bool& x);
-T void pop_back();
-T iterator insert(iterator position, const bool& x);
-T void insert (iterator position, size_type n, const bool& x);
-T template <class InputIterator>
- void insert(iterator position,
- InputIterator first, InputIterator last);
-T iterator erase(iterator position);
-T iterator erase(iterator first, iterator last);
-T void swap(vector<bool,Allocator>&);
-T static void swap(reference x, reference y);
-T void flip(); // flips all bits
-T void clear();
- };
-
-T template <class Allocator>
- bool operator==(const vector<bool,Allocator>& x,
- const vector<bool,Allocator>& y);
-T template <class Allocator>
- bool operator< (const vector<bool,Allocator>& x,
- const vector<bool,Allocator>& y);
-T template <class Allocator>
- bool operator!=(const vector<bool,Allocator>& x,
- const vector<bool,Allocator>& y);
-T template <class Allocator>
- bool operator> (const vector<bool,Allocator>& x,
- const vector<bool,Allocator>& y);
-T template <class Allocator>
- bool operator>=(const vector<bool,Allocator>& x,
- const vector<bool,Allocator>& y);
-T template <class Allocator>
- bool operator<=(const vector<bool,Allocator>& x,
- const vector<bool,Allocator>& y);
- // specialized algorithms:
-T template <class Allocator>
- void swap(vector<bool,Allocator>& x, vector<bool,Allocator>& y);
-
- 23.3 Associative containers [lib.associative]
-
- <map> and <set>:
-
- Header <map> synopsis
-
- template <class Key, class T, class Compare = less<Key>,
- class Allocator = allocator<pair<const Key, T> > >
-T class map;
-
-T template <class Key, class T, class Compare, class Allocator>
- bool operator==(const map<Key,T,Compare,Allocator>& x,
- const map<Key,T,Compare,Allocator>& y);
-T template <class Key, class T, class Compare, class Allocator>
- bool operator< (const map<Key,T,Compare,Allocator>& x,
- const map<Key,T,Compare,Allocator>& y);
-T template <class Key, class T, class Compare, class Allocator>
- bool operator!=(const map<Key,T,Compare,Allocator>& x,
- const map<Key,T,Compare,Allocator>& y);
-T template <class Key, class T, class Compare, class Allocator>
- bool operator> (const map<Key,T,Compare,Allocator>& x,
- const map<Key,T,Compare,Allocator>& y);
-T template <class Key, class T, class Compare, class Allocator>
- bool operator>=(const map<Key,T,Compare,Allocator>& x,
- const map<Key,T,Compare,Allocator>& y);
-T template <class Key, class T, class Compare, class Allocator>
- bool operator<=(const map<Key,T,Compare,Allocator>& x,
- const map<Key,T,Compare,Allocator>& y);
-T template <class Key, class T, class Compare, class Allocator>
- void swap(map<Key,T,Compare,Allocator>& x,
- map<Key,T,Compare,Allocator>& y);
-T template <class Key, class T, class Compare = less<Key>,
- class Allocator = allocator<pair<const Key, T> > >
- class multimap;
-T template <class Key, class T, class Compare, class Allocator>
- bool operator==(const multimap<Key,T,Compare,Allocator>& x,
- const multimap<Key,T,Compare,Allocator>& y);
-T template <class Key, class T, class Compare, class Allocator>
- bool operator< (const multimap<Key,T,Compare,Allocator>& x,
- const multimap<Key,T,Compare,Allocator>& y);
-T template <class Key, class T, class Compare, class Allocator>
- bool operator!=(const multimap<Key,T,Compare,Allocator>& x,
- const multimap<Key,T,Compare,Allocator>& y);
-T template <class Key, class T, class Compare, class Allocator>
- bool operator> (const multimap<Key,T,Compare,Allocator>& x,
- const multimap<Key,T,Compare,Allocator>& y);
-T template <class Key, class T, class Compare, class Allocator>
- bool operator>=(const multimap<Key,T,Compare,Allocator>& x,
- const multimap<Key,T,Compare,Allocator>& y);
-T template <class Key, class T, class Compare, class Allocator>
- bool operator<=(const multimap<Key,T,Compare,Allocator>& x,
- const multimap<Key,T,Compare,Allocator>& y);
-T template <class Key, class T, class Compare, class Allocator>
- void swap(multimap<Key,T,Compare,Allocator>& x,
- multimap<Key,T,Compare,Allocator>& y);
- }
-
- Header <set> synopsis
-
- template <class Key, class Compare = less<Key>,
- class Allocator = allocator<Key> >
-T class set;
-
-T template <class Key, class Compare, class Allocator>
- bool operator==(const set<Key,Compare,Allocator>& x,
- const set<Key,Compare,Allocator>& y);
-T template <class Key, class Compare, class Allocator>
- bool operator< (const set<Key,Compare,Allocator>& x,
- const set<Key,Compare,Allocator>& y);
-T template <class Key, class Compare, class Allocator>
- bool operator!=(const set<Key,Compare,Allocator>& x,
- const set<Key,Compare,Allocator>& y);
-T template <class Key, class Compare, class Allocator>
- bool operator> (const set<Key,Compare,Allocator>& x,
- const set<Key,Compare,Allocator>& y);
-T template <class Key, class Compare, class Allocator>
- bool operator>=(const set<Key,Compare,Allocator>& x,
- const set<Key,Compare,Allocator>& y);
-T template <class Key, class Compare, class Allocator>
- bool operator<=(const set<Key,Compare,Allocator>& x,
- const set<Key,Compare,Allocator>& y);
-T template <class Key, class Compare, class Allocator>
- void swap(set<Key,Compare,Allocator>& x,
- set<Key,Compare,Allocator>& y);
-T template <class Key, class Compare = less<Key>,
- class Allocator = allocator<Key> >
- class multiset;
-T template <class Key, class Compare, class Allocator>
- bool operator==(const multiset<Key,Compare,Allocator>& x,
- const multiset<Key,Compare,Allocator>& y);
-T template <class Key, class Compare, class Allocator>
- bool operator< (const multiset<Key,Compare,Allocator>& x,
- const multiset<Key,Compare,Allocator>& y);
-T template <class Key, class Compare, class Allocator>
- bool operator!=(const multiset<Key,Compare,Allocator>& x,
- const multiset<Key,Compare,Allocator>& y);
-T template <class Key, class Compare, class Allocator>
- bool operator> (const multiset<Key,Compare,Allocator>& x,
- const multiset<Key,Compare,Allocator>& y);
-T template <class Key, class Compare, class Allocator>
- bool operator>=(const multiset<Key,Compare,Allocator>& x,
- const multiset<Key,Compare,Allocator>& y);
-T template <class Key, class Compare, class Allocator>
- bool operator<=(const multiset<Key,Compare,Allocator>& x,
- const multiset<Key,Compare,Allocator>& y);
-T template <class Key, class Compare, class Allocator>
- void swap(multiset<Key,Compare,Allocator>& x,
- multiset<Key,Compare,Allocator>& y);
- }
-
- 23.3.1 Template class map [lib.map]
-
- template <class Key, class T, class Compare = less<Key>,
- class Allocator = allocator<pair<const Key, T> > >
-T class map {
- public:
- // types:
-T typedef Key key_type;
-T typedef T mapped_type;
-T typedef pair<const Key, T> value_type;
-T typedef Compare key_compare;
-T typedef Allocator allocator_type;
-T typedef typename Allocator::reference reference;
-T typedef typename Allocator::const_reference const_reference;
-T typedef implementation defined iterator;
-T typedef implementation defined const_iterator;
-T typedef implementation defined size_type;
-T typedef implementation defined difference_type;
-T typedef typename Allocator::pointer pointer;
-T typedef typename Allocator::const_pointer const_pointer;
-T typedef std::reverse_iterator<iterator> reverse_iterator;
-T typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
-T class value_compare
- : public binary_function<value_type,value_type,bool> {
- friend class map;
- protected:
-T Compare comp;
-T value_compare(Compare c) : comp(c) {}
- public:
-T bool operator()(const value_type& x, const value_type& y) const {
- return comp(x.first, y.first);
- }
- };
-
- // _lib.map.cons_ construct/copy/destroy:
-T explicit map(const Compare& comp = Compare(),
- const Allocator& = Allocator());
-T template <class InputIterator>
- map(InputIterator first, InputIterator last,
- const Compare& comp = Compare(), const Allocator& = Allocator());
-T map(const map<Key,T,Compare,Allocator>& x);
-T ~map();
-T map<Key,T,Compare,Allocator>&
- operator=(const map<Key,T,Compare,Allocator>& x);
- // iterators:
-T iterator begin();
-T const_iterator begin() const;
-T iterator end();
-T const_iterator end() const;
-T reverse_iterator rbegin();
-T const_reverse_iterator rbegin() const;
-T reverse_iterator rend();
-T const_reverse_iterator rend() const;
- // capacity:
-T bool empty() const;
-T size_type size() const;
-T size_type max_size() const;
- // _lib.map.access_ element access:
-T T& operator[](const key_type& x);
- // modifiers:
-T pair<iterator, bool> insert(const value_type& x);
-T iterator insert(iterator position, const value_type& x);
-T template <class InputIterator>
- void insert(InputIterator first, InputIterator last);
-T void erase(iterator position);
-T size_type erase(const key_type& x);
-T void erase(iterator first, iterator last);
-T void swap(map<Key,T,Compare,Allocator>&);
-T void clear();
- // observers:
-T key_compare key_comp() const;
-T value_compare value_comp() const;
- // _lib.map.ops_ map operations:
-T iterator find(const key_type& x);
-T const_iterator find(const key_type& x) const;
-T size_type count(const key_type& x) const;
-T iterator lower_bound(const key_type& x);
-T const_iterator lower_bound(const key_type& x) const;
-T iterator upper_bound(const key_type& x);
-T const_iterator upper_bound(const key_type& x) const;
-T pair<iterator,iterator>
- equal_range(const key_type& x);
-T pair<const_iterator,const_iterator>
- equal_range(const key_type& x) const;
- };
-
-T template <class Key, class T, class Compare, class Allocator>
- bool operator==(const map<Key,T,Compare,Allocator>& x,
- const map<Key,T,Compare,Allocator>& y);
-T template <class Key, class T, class Compare, class Allocator>
- bool operator< (const map<Key,T,Compare,Allocator>& x,
- const map<Key,T,Compare,Allocator>& y);
-T template <class Key, class T, class Compare, class Allocator>
- bool operator!=(const map<Key,T,Compare,Allocator>& x,
- const map<Key,T,Compare,Allocator>& y);
-T template <class Key, class T, class Compare, class Allocator>
- bool operator> (const map<Key,T,Compare,Allocator>& x,
- const map<Key,T,Compare,Allocator>& y);
-T template <class Key, class T, class Compare, class Allocator>
- bool operator>=(const map<Key,T,Compare,Allocator>& x,
- const map<Key,T,Compare,Allocator>& y);
-T template <class Key, class T, class Compare, class Allocator>
- bool operator<=(const map<Key,T,Compare,Allocator>& x,
- const map<Key,T,Compare,Allocator>& y);
- // specialized algorithms:
-T template <class Key, class T, class Compare, class Allocator>
- void swap(map<Key,T,Compare,Allocator>& x,
- map<Key,T,Compare,Allocator>& y);
-
- 23.3.2 Template class multimap [lib.multimap]
-
- template <class Key, class T, class Compare = less<Key>,
- class Allocator = allocator<pair<const Key, T> > >
-T class multimap {
- public:
- // types:
-T typedef Key key_type;
-T typedef T mapped_type;
-T typedef pair<const Key,T> value_type;
-T typedef Compare key_compare;
-T typedef Allocator allocator_type;
-T typedef typename Allocator::reference reference;
-T typedef typename Allocator::const_reference const_reference;
-T typedef implementation defined iterator;
-T typedef implementation defined const_iterator;
-T typedef implementation defined size_type;
-T typedef implementation defined difference_type
-T typedef typename Allocator::pointer pointer;
-T typedef typename Allocator::const_pointer const_pointer;
-T typedef std::reverse_iterator<iterator> reverse_iterator;
-T typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
-T class value_compare
- : public binary_function<value_type,value_type,bool> {
- friend class multimap;
- protected:
-T Compare comp;
-T value_compare(Compare c) : comp(c) {}
- public:
-T bool operator()(const value_type& x, const value_type& y) const {
- return comp(x.first, y.first);
- }
- };
- // construct/copy/destroy:
-T explicit multimap(const Compare& comp = Compare(),
- const Allocator& = Allocator());
-T template <class InputIterator>
- multimap(InputIterator first, InputIterator last,
- const Compare& comp = Compare(),
- const Allocator& = Allocator());
-T multimap(const multimap<Key,T,Compare,Allocator>& x);
-T ~multimap();
-T multimap<Key,T,Compare,Allocator>&
- operator=(const multimap<Key,T,Compare,Allocator>& x);
-T allocator_type get_allocator() const;
-
- // iterators:
-T iterator begin();
-T const_iterator begin() const;
-T iterator end();
-T const_iterator end() const;
-T reverse_iterator rbegin();
-T const_reverse_iterator rbegin() const;
-T reverse_iterator rend();
-T const_reverse_iterator rend() const;
- // capacity:
-T bool empty() const;
-T size_type size() const;
-T size_type max_size() const;
- // modifiers:
-T iterator insert(const value_type& x);
-T iterator insert(iterator position, const value_type& x);
-T template <class InputIterator>
- void insert(InputIterator first, InputIterator last);
-T void erase(iterator position);
-T size_type erase(const key_type& x);
-T void erase(iterator first, iterator last);
-T void swap(multimap<Key,T,Compare,Allocator>&);
-T void clear();
- // observers:
-T key_compare key_comp() const;
-T value_compare value_comp() const;
- // map operations:
-T iterator find(const key_type& x);
-T const_iterator find(const key_type& x) const;
-T size_type count(const key_type& x) const;
-T iterator lower_bound(const key_type& x);
-T const_iterator lower_bound(const key_type& x) const;
-T iterator upper_bound(const key_type& x);
-T const_iterator upper_bound(const key_type& x) const;
-T pair<iterator,iterator> equal_range(const key_type& x);
-T pair<const_iterator,const_iterator> equal_range(const key_type& x) const;
- };
-
-T template <class Key, class T, class Compare, class Allocator>
- bool operator==(const multimap<Key,T,Compare,Allocator>& x,
- const multimap<Key,T,Compare,Allocator>& y);
-T template <class Key, class T, class Compare, class Allocator>
- bool operator< (const multimap<Key,T,Compare,Allocator>& x,
- const multimap<Key,T,Compare,Allocator>& y);
-T template <class Key, class T, class Compare, class Allocator>
- bool operator!=(const multimap<Key,T,Compare,Allocator>& x,
- const multimap<Key,T,Compare,Allocator>& y);
-T template <class Key, class T, class Compare, class Allocator>
- bool operator> (const multimap<Key,T,Compare,Allocator>& x,
- const multimap<Key,T,Compare,Allocator>& y);
-T template <class Key, class T, class Compare, class Allocator>
- bool operator>=(const multimap<Key,T,Compare,Allocator>& x,
- const multimap<Key,T,Compare,Allocator>& y);
-T template <class Key, class T, class Compare, class Allocator>
- bool operator<=(const multimap<Key,T,Compare,Allocator>& x,
- const multimap<Key,T,Compare,Allocator>& y);
- // specialized algorithms:
-T template <class Key, class T, class Compare, class Allocator>
- void swap(multimap<Key,T,Compare,Allocator>& x,
- multimap<Key,T,Compare,Allocator>& y);
-
-
- 23.3.3 Template class set [lib.set]
-
- template <class Key, class Compare = less<Key>,
- class Allocator = allocator<Key> >
-T class set {
- public:
- // types:
-T typedef Key key_type;
-T typedef Key value_type;
-T typedef Compare key_compare;
-T typedef Compare value_compare;
-T typedef Allocator allocator_type;
-T typedef typename Allocator::reference reference;
-T typedef typename Allocator::const_reference const_reference;
-T typedef implementation defined iterator;
-T typedef implementation defined const_iterator;
-T typedef implementation defined size_type;
-T typedef implementation defined difference_type;
-T typedef typename Allocator::pointer pointer;
-T typedef typename Allocator::const_pointer const_pointer;
-T typedef std::reverse_iterator<iterator> reverse_iterator;
-T typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
- // _lib.set.cons_ construct/copy/destroy:
-T explicit set(const Compare& comp = Compare(),
- const Allocator& = Allocator());
-T template <class InputIterator>
- set(InputIterator first, InputIterator last,
- const Compare& comp = Compare(), const Allocator& = Allocator());
-T set(const set<Key,Compare,Allocator>& x);
-T ~set();
-T set<Key,Compare,Allocator>&
- operator=(const set<Key,Compare,Allocator>& x);
-T allocator_type get_allocator() const;
- // iterators:
-T iterator begin();
-T const_iterator begin() const;
-T iterator end();
-T const_iterator end() const;
-T reverse_iterator rbegin();
-T const_reverse_iterator rbegin() const;
-T reverse_iterator rend();
-T const_reverse_iterator rend() const;
- // capacity:
-T bool empty() const;
-T size_type size() const;
-T size_type max_size() const;
- // modifiers:
-T pair<iterator,bool> insert(const value_type& x);
-T iterator insert(iterator position, const value_type& x);
-T template <class InputIterator>
-T void insert(InputIterator first, InputIterator last);
-T void erase(iterator position);
-T size_type erase(const key_type& x);
-T void erase(iterator first, iterator last);
-T void swap(set<Key,Compare,Allocator>&);
-T void clear();
-
- // observers:
-T key_compare key_comp() const;
-T value_compare value_comp() const;
- // set operations:
-T iterator find(const key_type& x) const;
-T size_type count(const key_type& x) const;
-T iterator lower_bound(const key_type& x) const;
-T iterator upper_bound(const key_type& x) const;
-T pair<iterator,iterator> equal_range(const key_type& x) const;
- };
-T template <class Key, class Compare, class Allocator>
- bool operator==(const set<Key,Compare,Allocator>& x,
- const set<Key,Compare,Allocator>& y);
-T template <class Key, class Compare, class Allocator>
- bool operator< (const set<Key,Compare,Allocator>& x,
- const set<Key,Compare,Allocator>& y);
-T template <class Key, class Compare, class Allocator>
- bool operator!=(const set<Key,Compare,Allocator>& x,
- const set<Key,Compare,Allocator>& y);
-T template <class Key, class Compare, class Allocator>
- bool operator> (const set<Key,Compare,Allocator>& x,
- const set<Key,Compare,Allocator>& y);
-T template <class Key, class Compare, class Allocator>
- bool operator>=(const set<Key,Compare,Allocator>& x,
- const set<Key,Compare,Allocator>& y);
-T template <class Key, class Compare, class Allocator>
- bool operator<=(const set<Key,Compare,Allocator>& x,
- const set<Key,Compare,Allocator>& y);
- // specialized algorithms:
-T template <class Key, class Compare, class Allocator>
- void swap(set<Key,Compare,Allocator>& x,
- set<Key,Compare,Allocator>& y);
-
- 23.3.4 Template class multiset [lib.multiset]
-
- template <class Key, class Compare = less<Key>,
- class Allocator = allocator<Key> >
-T class multiset {
- public:
- // types:
-T typedef Key key_type;
-T typedef Key value_type;
-T typedef Compare key_compare;
-T typedef Compare value_compare;
-T typedef Allocator allocator_type;
-T typedef typename Allocator::reference reference;
-T typedef typename Allocator::const_reference const_reference;
-T typedef implementation defined iterator;
-T typedef implementation defined const_iterator;
-T typedef implementation defined size_type;
-T typedef implementation defined difference_type
-T typedef typename Allocator::pointer pointer;
-T typedef typename Allocator::const_pointer const_pointer;
-T typedef std::reverse_iterator<iterator> reverse_iterator;
-T typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
-
- // construct/copy/destroy:
-T explicit multiset(const Compare& comp = Compare(),
- const Allocator& = Allocator());
-T template <class InputIterator>
- multiset(InputIterator first, InputIterator last,
- const Compare& comp = Compare(),
- const Allocator& = Allocator());
-T multiset(const multiset<Key,Compare,Allocator>& x);
-T ~multiset();
-T multiset<Key,Compare,Allocator>&
- operator=(const multiset<Key,Compare,Allocator>& x);
-T allocator_type get_allocator() const;
- // iterators:
-T iterator begin();
-T const_iterator begin() const;
-T iterator end();
-T const_iterator end() const;
-T reverse_iterator rbegin();
-T const_reverse_iterator rbegin() const;
-T reverse_iterator rend();
-T const_reverse_iterator rend() const;
- // capacity:
-T bool empty() const;
-T size_type size() const;
-T size_type max_size() const;
- // modifiers:
-T iterator insert(const value_type& x);
-T iterator insert(iterator position, const value_type& x);
-T template <class InputIterator>
- void insert(InputIterator first, InputIterator last);
-T void erase(iterator position);
-T size_type erase(const key_type& x);
-T void erase(iterator first, iterator last);
-T void swap(multiset<Key,Compare,Allocator>&);
-T void clear();
- // observers:
-T key_compare key_comp() const;
-T value_compare value_comp() const;
- // set operations:
-T iterator find(const key_type& x) const;
-T size_type count(const key_type& x) const;
-T iterator lower_bound(const key_type& x) const;
-T iterator upper_bound(const key_type& x) const;
-T pair<iterator,iterator> equal_range(const key_type& x) const;
- };
-
-T template <class Key, class Compare, class Allocator>
- bool operator==(const multiset<Key,Compare,Allocator>& x,
- const multiset<Key,Compare,Allocator>& y);
-T template <class Key, class Compare, class Allocator>
- bool operator< (const multiset<Key,Compare,Allocator>& x,
- const multiset<Key,Compare,Allocator>& y);
-T template <class Key, class Compare, class Allocator>
- bool operator!=(const multiset<Key,Compare,Allocator>& x,
- const multiset<Key,Compare,Allocator>& y);
-T template <class Key, class Compare, class Allocator>
- bool operator> (const multiset<Key,Compare,Allocator>& x,
- const multiset<Key,Compare,Allocator>& y);
-T template <class Key, class Compare, class Allocator>
- bool operator>=(const multiset<Key,Compare,Allocator>& x,
- const multiset<Key,Compare,Allocator>& y);
-T template <class Key, class Compare, class Allocator>
- bool operator<=(const multiset<Key,Compare,Allocator>& x,
- const multiset<Key,Compare,Allocator>& y);
- // specialized algorithms:
-T template <class Key, class Compare, class Allocator>
- void swap(multiset<Key,Compare,Allocator>& x,
- multiset<Key,Compare,Allocator>& y);
-
- 23.3.5 Template class bitset [lib.template.bitset]
-
- Header <bitset> synopsis
-
-T template <size_t N> class bitset;
- // _lib.bitset.operators_ bitset operations:
-T template <size_t N>
- bitset<N> operator&(const bitset<N>&, const bitset<N>&);
-T template <size_t N>
- bitset<N> operator|(const bitset<N>&, const bitset<N>&);
-T template <size_t N>
- bitset<N> operator^(const bitset<N>&, const bitset<N>&);
-T template <class charT, class traits, size_t N>
- basic_istream<charT, traits>&
- operator>>(basic_istream<charT, traits>& is, bitset<N>& x);
-T template <class charT, class traits, size_t N>
- basic_ostream<charT, traits>&
- operator<<(basic_ostream<charT, traits>& os, const bitset<N>& x);
-
-T template<size_t N> class bitset {
- public:
- // bit reference:
-T class reference {
- friend class bitset;
-T reference();
- public:
-T ~reference();
-T reference& operator=(bool x); // for b[i] = x;
-T reference& operator=(const reference&); // for b[i] = b[j];
-T bool operator~() const; // flips the bit
-T operator bool() const; // for x = b[i];
-T reference& flip(); // for b[i].flip();
- };
-
- // _lib.bitset.cons_ constructors:
-T bitset();
-T bitset(unsigned long val);
-T template<class charT, class traits, class Allocator>
- explicit bitset(
- const basic_string<charT,traits,Allocator>& str,
- typename basic_string<charT,traits,Allocator>::size_type pos = 0,
- typename basic_string<charT,traits,Allocator>::size_type n =
- basic_string<charT,traits,Allocator>::npos);
- // _lib.bitset.members_ bitset operations:
-T bitset<N>& operator&=(const bitset<N>& rhs);
-T bitset<N>& operator|=(const bitset<N>& rhs);
-T bitset<N>& operator^=(const bitset<N>& rhs);
-T bitset<N>& operator<<=(size_t pos);
-T bitset<N>& operator>>=(size_t pos);
-T bitset<N>& set();
-T bitset<N>& set(size_t pos, int val = true);
-T bitset<N>& reset();
-T bitset<N>& reset(size_t pos);
-T bitset<N> operator~() const;
-T bitset<N>& flip();
-T bitset<N>& flip(size_t pos);
- // element access:
-T reference operator[](size_t pos); // for b[i];
-T unsigned long to_ulong() const;
-T template <class charT, class traits, class Allocator>
- basic_string<charT, traits, Allocator> to_string() const;
-T size_t count() const;
-T size_t size() const;
-T bool operator==(const bitset<N>& rhs) const;
-T bool operator!=(const bitset<N>& rhs) const;
-T bool test(size_t pos) const;
-T bool any() const;
-T bool none() const;
-T bitset<N> operator<<(size_t pos) const;
-T bitset<N> operator>>(size_t pos) const;
- };
-
-
-
-
- 24.2 Header <iterator> synopsis [lib.iterator.synopsis]
-
- // _lib.iterator.primitives_, primitives:
-T template<class Iterator> struct iterator_traits;
-T template<class T> struct iterator_traits<T*>;
-
-X template<class Category, class T, class Distance = ptrdiff_t,
- class Pointer = T*, class Reference = T&> struct iterator;
-T struct input_iterator_tag {};
-T struct output_iterator_tag {};
-T struct forward_iterator_tag: public input_iterator_tag {};
-T struct bidirectional_iterator_tag: public forward_iterator_tag {};
-T struct random_access_iterator_tag: public bidirectional_iterator_tag {};
- // _lib.iterator.operations_, iterator operations:
-T template <class InputIterator, class Distance>
- void advance(InputIterator& i, Distance n);
-T template <class InputIterator>
- typename iterator_traits<InputIterator>::difference_type
- distance(InputIterator first, InputIterator last);
- // _lib.predef.iterators_, predefined iterators:
-X template <class Iterator> class reverse_iterator;
-T template <class Iterator>
- bool operator==(
- const reverse_iterator<Iterator>& x,
- const reverse_iterator<Iterator>& y);
-T template <class Iterator>
- bool operator<(
- const reverse_iterator<Iterator>& x,
- const reverse_iterator<Iterator>& y);
-T template <class Iterator>
- bool operator!=(
- const reverse_iterator<Iterator>& x,
- const reverse_iterator<Iterator>& y);
-T template <class Iterator>
- bool operator>(
- const reverse_iterator<Iterator>& x,
- const reverse_iterator<Iterator>& y);
-T template <class Iterator>
- bool operator>=(
- const reverse_iterator<Iterator>& x,
- const reverse_iterator<Iterator>& y);
-T template <class Iterator>
- bool operator<=(
- const reverse_iterator<Iterator>& x,
- const reverse_iterator<Iterator>& y);
-T template <class Iterator>
- typename reverse_iterator<Iterator>::difference_type operator-(
- const reverse_iterator<Iterator>& x,
- const reverse_iterator<Iterator>& y);
-T template <class Iterator>
- reverse_iterator<Iterator>
- operator+(
- typename reverse_iterator<Iterator>::difference_type n,
- const reverse_iterator<Iterator>& x);
-
-X template <class Container> class back_insert_iterator;
-T template <class Container>
- back_insert_iterator<Container> back_inserter(Container& x);
-X template <class Container> class front_insert_iterator;
-T template <class Container>
- front_insert_iterator<Container> front_inserter(Container& x);
-X template <class Container> class insert_iterator;
-T template <class Container, class Iterator>
- insert_iterator<Container> inserter(Container& x, Iterator i);
- // _lib.stream.iterators_, stream iterators:
-X template <class T, class charT = char, class traits = char_traits<charT>,
- class Distance = ptrdiff_t>
- class istream_iterator;
- template <class T, class charT, class traits, class Distance>
-X bool operator==(const istream_iterator<T,charT,traits,Distance>& x,
- const istream_iterator<T,charT,traits,Distance>& y);
- template <class T, class charT, class traits, class Distance>
-X bool operator!=(const istream_iterator<T,charT,traits,Distance>& x,
- const istream_iterator<T,charT,traits,Distance>& y);
-X template <class T, class charT = char, class traits = char_traits<charT> >
- class ostream_iterator;
-X template<class charT, class traits = char_traits<charT> >
- class istreambuf_iterator;
-X template <class charT, class traits>
- bool operator==(const istreambuf_iterator<charT,traits>& a,
- const istreambuf_iterator<charT,traits>& b);
-X template <class charT, class traits>
- bool operator!=(const istreambuf_iterator<charT,traits>& a,
- const istreambuf_iterator<charT,traits>& b);
-T template <class charT, class traits = char_traits<charT> >
- class ostreambuf_iterator;
-
- 24.3 Iterator primitives [lib.iterator.primitives]
-
-T template<class Iterator> struct iterator_traits {
-T typedef typename Iterator::difference_type difference_type;
-T typedef typename Iterator::value_type value_type;
-T typedef typename Iterator::pointer pointer;
-T typedef typename Iterator::reference reference;
-T typedef typename Iterator::iterator_category iterator_category;
- };
-
-T template<class T> struct iterator_traits<T*> {
-T typedef ptrdiff_t difference_type;
-T typedef T value_type;
-T typedef T* pointer;
-T typedef T& reference;
-T typedef random_access_iterator_tag iterator_category;
- };
-
-T template<class T> struct iterator_traits<const T*> {
-T typedef ptrdiff_t difference_type;
-T typedef T value_type;
-T typedef const T* pointer;
-T typedef const T& reference;
-T typedef random_access_iterator_tag iterator_category;
- };
-
- 24.3.2 Basic iterator [lib.iterator.basic]
-
- template<class Category, class T, class Distance = ptrdiff_t,
- class Pointer = T*, class Reference = T&>
-X struct iterator {
-T typedef T value_type;
-T typedef Distance difference_type;
-T typedef Pointer pointer;
-T typedef Reference reference;
-T typedef Category iterator_category;
- };
-
- 24.3.3 Standard iterator tags [lib.std.iterator.tags]
-
-T struct input_iterator_tag {};
-T struct output_iterator_tag {};
-T struct forward_iterator_tag: public input_iterator_tag {};
-T struct bidirectional_iterator_tag: public forward_iterator_tag {};
-T struct random_access_iterator_tag: public bidirectional_iterator_tag {};
-
-
- 24.4.1 Reverse iterators [lib.reverse.iterators]
-
- template <class Iterator>
-X class reverse_iterator : public
- iterator<typename iterator_traits<Iterator>::iterator_category,
- typename iterator_traits<Iterator>::value_type,
- typename iterator_traits<Iterator>::difference_type,
- typename iterator_traits<Iterator>::pointer,
- typename iterator_traits<Iterator>::reference> {
- protected:
-T Iterator current;
- public:
-T typedef Iterator
- iterator_type;
-T typedef typename iterator_traits<Iterator>::difference_type
- difference_type;
-T typedef typename iterator_traits<Iterator>::reference
- reference;
-T typedef typename iterator_traits<Iterator>::pointer
- pointer;
-
-T reverse_iterator();
-T explicit reverse_iterator(Iterator x);
-T template <class U> reverse_iterator(const reverse_iterator<U>& u);
-T Iterator base() const; // explicit
-T reference operator*() const;
-T pointer operator->() const;
-T reverse_iterator& operator++();
-T reverse_iterator operator++(int);
-T reverse_iterator& operator--();
-T reverse_iterator operator--(int);
-
-T reverse_iterator operator+ (difference_type n) const;
-T reverse_iterator& operator+=(difference_type n);
-T reverse_iterator operator- (difference_type n) const;
-T reverse_iterator& operator-=(difference_type n);
-T reference operator[](difference_type n) const;
- };
-T template <class Iterator>
- bool operator==(
- const reverse_iterator<Iterator>& x,
- const reverse_iterator<Iterator>& y);
-T template <class Iterator>
- bool operator<(
- const reverse_iterator<Iterator>& x,
- const reverse_iterator<Iterator>& y);
-T template <class Iterator>
- bool operator!=(
- const reverse_iterator<Iterator>& x,
- const reverse_iterator<Iterator>& y);
-T template <class Iterator>
- bool operator>(
- const reverse_iterator<Iterator>& x,
- const reverse_iterator<Iterator>& y);
-T template <class Iterator>
- bool operator>=(
- const reverse_iterator<Iterator>& x,
- const reverse_iterator<Iterator>& y);
-T template <class Iterator>
- bool operator<=(
- const reverse_iterator<Iterator>& x,
- const reverse_iterator<Iterator>& y);
-T template <class Iterator>
- typename reverse_iterator<Iterator>::difference_type operator-(
- const reverse_iterator<Iterator>& x,
- const reverse_iterator<Iterator>& y);
-T template <class Iterator>
- reverse_iterator<Iterator> operator+(
- typename reverse_iterator<Iterator>::difference_type n,
- const reverse_iterator<Iterator>& x);
-
-
- 24.4.2.1 Template class [lib.back.insert.iterator]
- back_insert_iterator
-
- template <class Container>
-X class back_insert_iterator :
- public iterator<output_iterator_tag,void,void,void,void> {
- protected:
-T Container* container;
- public:
-T typedef Container container_type;
-T explicit back_insert_iterator(Container& x);
-T back_insert_iterator<Container>&
- operator=(typename Container::const_reference value);
-
-T back_insert_iterator<Container>& operator*();
-T back_insert_iterator<Container>& operator++();
-T back_insert_iterator<Container> operator++(int);
- };
-T template <class Container>
- back_insert_iterator<Container> back_inserter(Container& x);
-
-
-
- 24.4.2.3 Template class [lib.front.insert.iterator]
- front_insert_iterator
-
- template <class Container>
-X class front_insert_iterator :
- public iterator<output_iterator_tag,void,void,void,void> {
- protected:
-T Container* container;
- public:
-T typedef Container container_type;
-T explicit front_insert_iterator(Container& x);
-T front_insert_iterator<Container>&
- operator=(typename Container::const_reference value);
-T front_insert_iterator<Container>& operator*();
-T front_insert_iterator<Container>& operator++();
-T front_insert_iterator<Container> operator++(int);
- };
-T template <class Container>
- front_insert_iterator<Container> front_inserter(Container& x);
-
-
- 24.4.2.5 Template class insert_iterator [lib.insert.iterator]
-
- template <class Container>
-X class insert_iterator :
- public iterator<output_iterator_tag,void,void,void,void> {
- protected:
-T Container* container;
-T typename Container::iterator iter;
- public:
-T typedef Container container_type;
-T insert_iterator(Container& x, typename Container::iterator i);
-T insert_iterator<Container>&
- operator=(typename Container::const_reference value);
-T insert_iterator<Container>& operator*();
-T insert_iterator<Container>& operator++();
-T insert_iterator<Container>& operator++(int);
- };
-T template <class Container, class Iterator>
- insert_iterator<Container> inserter(Container& x, Iterator i);
-
- 24.5.1 Template class istream_iterator [lib.istream.iterator]
-
- template <class T, class charT = char, class traits = char_traits<charT>,
- class Distance = ptrdiff_t>
-X class istream_iterator:
- public iterator<input_iterator_tag, T, Distance, const T*, const T&> {
- public:
-T typedef charT char_type
-T typedef traits traits_type;
-T typedef basic_istream<charT,traits> istream_type;
-T istream_iterator();
-T istream_iterator(istream_type& s);
-T istream_iterator(const istream_iterator<T,charT,traits,Distance>& x);
-T ~istream_iterator();
-
-T const T& operator*() const;
-T const T* operator->() const;
-T istream_iterator<T,charT,traits,Distance>& operator++();
-T istream_iterator<T,charT,traits,Distance> operator++(int);
- };
-
-T template <class T, class charT, class traits, class Distance>
- bool operator==(const istream_iterator<T,charT,traits,Distance>& x,
- const istream_iterator<T,charT,traits,Distance>& y);
-T template <class T, class charT, class traits, class Distance>
- bool operator!=(const istream_iterator<T,charT,traits,Distance>& x,
- const istream_iterator<T,charT,traits,Distance>& y);
-
-
- 24.5.2 Template class ostream_iterator [lib.ostream.iterator]
-
- template <class T, class charT = char, class traits = char_traits<charT> >
-X class ostream_iterator:
- public iterator<output_iterator_tag, void, void, void, void> {
- public:
-T typedef charT char_type;
-T typedef traits traits_type;
-T typedef basic_ostream<charT,traits> ostream_type;
-T ostream_iterator(ostream_type& s);
-T ostream_iterator(ostream_type& s, const charT* delimiter);
-T ostream_iterator(const ostream_iterator<T,charT,traits>& x);
-T ~ostream_iterator();
-T ostream_iterator<T,charT,traits>& operator=(const T& value);
-
-T ostream_iterator<T,charT,traits>& operator*();
-T ostream_iterator<T,charT,traits>& operator++();
-T ostream_iterator<T,charT,traits>& operator++(int);
- };
-
-
- 24.5.3 Template class [lib.istreambuf.iterator]
- istreambuf_iterator
-
- template<class charT, class traits = char_traits<charT> >
-X class istreambuf_iterator
- : public iterator<input_iterator_tag, charT,
- typename traits::off_type, charT*, charT&> {
- public:
-T typedef charT char_type;
-T typedef traits traits_type;
-T typedef typename traits::int_type int_type;
-T typedef basic_streambuf<charT,traits> streambuf_type;
-T typedef basic_istream<charT,traits> istream_type;
-T class proxy; // exposition only
-T istreambuf_iterator() throw();
-T istreambuf_iterator(istream_type& s) throw();
-T istreambuf_iterator(streambuf_type* s) throw();
-T istreambuf_iterator(const proxy& p) throw();
-T charT operator*() const;
-T istreambuf_iterator<charT,traits>& operator++();
-T proxy operator++(int);
-X bool equal(istreambuf_iterator& b);
- };
-
-T template <class charT, class traits>
- bool operator==(const istreambuf_iterator<charT,traits>& a,
- const istreambuf_iterator<charT,traits>& b);
-
-T template <class charT, class traits>
- bool operator!=(const istreambuf_iterator<charT,traits>& a,
- const istreambuf_iterator<charT,traits>& b);
-
- 24.5.3.1 Template class [lib.istreambuf.iterator::proxy]
- istreambuf_iterator::proxy
-
- template <class charT, class traits = char_traits<charT> >
-T class istreambuf_iterator<charT, traits>::proxy
- {
-T charT keep_;
-T basic_streambuf<charT,traits>* sbuf_;
-T proxy(charT c,
- basic_streambuf<charT,traits>* sbuf);
- : keep_(c), sbuf_(sbuf) {}
- public:
-T charT operator*() { return keep_; }
- };
-
-
-
- 24.5.4 Template class [lib.ostreambuf.iterator]
- ostreambuf_iterator
-
- template <class charT, class traits = char_traits<charT> >
-T class ostreambuf_iterator:
- public iterator<output_iterator_tag, void, void, void, void> {
- public:
-T typedef charT char_type;
-T typedef traits traits_type;
-T typedef basic_streambuf<charT,traits> streambuf_type;
-T typedef basic_ostream<charT,traits> ostream_type;
- public:
-T ostreambuf_iterator(ostream_type& s) throw();
-T ostreambuf_iterator(streambuf_type* s) throw();
-T ostreambuf_iterator& operator=(charT c);
-T ostreambuf_iterator& operator*();
-T ostreambuf_iterator& operator++();
-T ostreambuf_iterator& operator++(int);
-T bool failed() const throw();
- };
-
-
- Header <algorithm> synopsis
-
-
- // _lib.alg.nonmodifying_, non-modifying sequence operations:
-T template<class InputIterator, class Function>
- Function for_each(InputIterator first, InputIterator last, Function f);
-T template<class InputIterator, class T>
- InputIterator find(InputIterator first, InputIterator last,
- const T& value);
-T template<class InputIterator, class Predicate>
- InputIterator find_if(InputIterator first, InputIterator last,
- Predicate pred);
-T template<class ForwardIterator1, class ForwardIterator2>
- ForwardIterator1
- find_end(ForwardIterator1 first1, ForwardIterator1 last1,
- ForwardIterator2 first2, ForwardIterator2 last2);
-T template<class ForwardIterator1, class ForwardIterator2,
- class BinaryPredicate>
- ForwardIterator1
- find_end(ForwardIterator1 first1, ForwardIterator1 last1,
- ForwardIterator2 first2, ForwardIterator2 last2,
- BinaryPredicate pred);
-T template<class ForwardIterator1, class ForwardIterator2>
- ForwardIterator1
- find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
- ForwardIterator2 first2, ForwardIterator2 last2);
-T template<class ForwardIterator1, class ForwardIterator2,
- class BinaryPredicate>
- ForwardIterator1
- find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
- ForwardIterator2 first2, ForwardIterator2 last2,
- BinaryPredicate pred);
-T template<class ForwardIterator>
- ForwardIterator adjacent_find(ForwardIterator first,
- ForwardIterator last);
-T template<class ForwardIterator, class BinaryPredicate>
- ForwardIterator adjacent_find(ForwardIterator first,
- ForwardIterator last, BinaryPredicate pred);
-T template<class InputIterator, class T>
- typename iterator_traits<InputIterator>::difference_type
- count(InputIterator first, InputIterator last, const T& value);
-T template<class InputIterator, class Predicate>
- typename iterator_traits<InputIterator>::difference_type
- count_if(InputIterator first, InputIterator last, Predicate pred);
-T template<class InputIterator1, class InputIterator2>
- pair<InputIterator1, InputIterator2>
- mismatch(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2);
-T template<class InputIterator1, class InputIterator2, class BinaryPredicate>
- pair<InputIterator1, InputIterator2>
- mismatch(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, BinaryPredicate pred);
-
-T template<class InputIterator1, class InputIterator2>
- bool equal(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2);
-T template<class InputIterator1, class InputIterator2, class BinaryPredicate>
- bool equal(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, BinaryPredicate pred);
-T template<class ForwardIterator1, class ForwardIterator2>
- ForwardIterator1 search(ForwardIterator1 first1, ForwardIterator1 last1,
- ForwardIterator2 first2, ForwardIterator2 last2);
-T template<class ForwardIterator1, class ForwardIterator2,
- class BinaryPredicate>
- ForwardIterator1 search(ForwardIterator1 first1, ForwardIterator1 last1,
- ForwardIterator2 first2, ForwardIterator2 last2,
- BinaryPredicate pred);
-T template<class ForwardIterator, class Size, class T>
- ForwardIterator search_n(ForwardIterator first, ForwardIterator last,
- Size count, const T& value);
-T template<class ForwardIterator, class Size, class T, class BinaryPredicate>
- ForwardIterator1 search_n(ForwardIterator first, ForwardIterator last,
- Size count, const T& value,
- BinaryPredicate pred);
- // _lib.alg.modifying.operations_, modifying sequence operations:
- // _lib.alg.copy_, copy:
-T template<class InputIterator, class OutputIterator>
- OutputIterator copy(InputIterator first, InputIterator last,
- OutputIterator result);
-T template<class BidirectionalIterator1, class BidirectionalIterator2>
- BidirectionalIterator2
- copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last,
- BidirectionalIterator2 result);
- // _lib.alg.swap_, swap:
-T template<class T> void swap(T& a, T& b);
-T template<class ForwardIterator1, class ForwardIterator2>
- ForwardIterator2 swap_ranges(ForwardIterator1 first1,
- ForwardIterator1 last1, ForwardIterator2 first2);
-T template<class ForwardIterator1, class ForwardIterator2>
- void iter_swap(ForwardIterator1 a, ForwardIterator2 b);
-T template<class InputIterator, class OutputIterator, class UnaryOperation>
- OutputIterator transform(InputIterator first, InputIterator last,
- OutputIterator result, UnaryOperation op);
-T template<class InputIterator1, class InputIterator2, class OutputIterator,
- class BinaryOperation>
- OutputIterator transform(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, OutputIterator result,
- BinaryOperation binary_op);
-
-T template<class ForwardIterator, class T>
- void replace(ForwardIterator first, ForwardIterator last,
- const T& old_value, const T& new_value);
-T template<class ForwardIterator, class Predicate, class T>
- void replace_if(ForwardIterator first, ForwardIterator last,
- Predicate pred, const T& new_value);
-T template<class InputIterator, class OutputIterator, class T>
- OutputIterator replace_copy(InputIterator first, InputIterator last,
- OutputIterator result,
- const T& old_value, const T& new_value);
-T template<class Iterator, class OutputIterator, class Predicate, class T>
- OutputIterator replace_copy_if(Iterator first, Iterator last,
- OutputIterator result,
- Predicate pred, const T& new_value);
-T template<class ForwardIterator, class T>
- void fill(ForwardIterator first, ForwardIterator last, const T& value);
-T template<class OutputIterator, class Size, class T>
- void fill_n(OutputIterator first, Size n, const T& value);
-T template<class ForwardIterator, class Generator>
- void generate(ForwardIterator first, ForwardIterator last, Generator gen);
-T template<class OutputIterator, class Size, class Generator>
- void generate_n(OutputIterator first, Size n, Generator gen);
-T template<class ForwardIterator, class T>
- ForwardIterator remove(ForwardIterator first, ForwardIterator last,
- const T& value);
-T template<class ForwardIterator, class Predicate>
- ForwardIterator remove_if(ForwardIterator first, ForwardIterator last,
- Predicate pred);
-T template<class InputIterator, class OutputIterator, class T>
- OutputIterator remove_copy(InputIterator first, InputIterator last,
- OutputIterator result, const T& value);
-T template<class InputIterator, class OutputIterator, class Predicate>
- OutputIterator remove_copy_if(InputIterator first, InputIterator last,
- OutputIterator result, Predicate pred);
-T template<class ForwardIterator>
- ForwardIterator unique(ForwardIterator first, ForwardIterator last);
-T template<class ForwardIterator, class BinaryPredicate>
- ForwardIterator unique(ForwardIterator first, ForwardIterator last,
- BinaryPredicate pred);
-T template<class InputIterator, class OutputIterator>
- OutputIterator unique_copy(InputIterator first, InputIterator last,
- OutputIterator result);
-T template<class InputIterator, class OutputIterator, class BinaryPredicate>
- OutputIterator unique_copy(InputIterator first, InputIterator last,
- OutputIterator result, BinaryPredicate pred);
-T template<class BidirectionalIterator>
- void reverse(BidirectionalIterator first, BidirectionalIterator last);
-T template<class BidirectionalIterator, class OutputIterator>
- OutputIterator reverse_copy(BidirectionalIterator first,
- BidirectionalIterator last,
- OutputIterator result);
-
-T template<class ForwardIterator>
- void rotate(ForwardIterator first, ForwardIterator middle,
- ForwardIterator last);
-T template<class ForwardIterator, class OutputIterator>
- OutputIterator rotate_copy(ForwardIterator first, ForwardIterator middle,
- ForwardIterator last, OutputIterator result);
-T template<class RandomAccessIterator>
- void random_shuffle(RandomAccessIterator first,
- RandomAccessIterator last);
-T template<class RandomAccessIterator, class RandomNumberGenerator>
- void random_shuffle(RandomAccessIterator first,
- RandomAccessIterator last,
- RandomNumberGenerator& rand);
- // _lib.alg.partitions_, partitions:
-T template<class BidirectionalIterator, class Predicate>
- BidirectionalIterator partition(BidirectionalIterator first,
- BidirectionalIterator last,
- Predicate pred);
-T template<class BidirectionalIterator, class Predicate>
- BidirectionalIterator stable_partition(BidirectionalIterator first,
- BidirectionalIterator last,
- Predicate pred);
- // _lib.alg.sorting_, sorting and related operations:
- // _lib.alg.sort_, sorting:
-T template<class RandomAccessIterator>
- void sort(RandomAccessIterator first, RandomAccessIterator last);
-T template<class RandomAccessIterator, class Compare>
- void sort(RandomAccessIterator first, RandomAccessIterator last,
- Compare comp);
-T template<class RandomAccessIterator>
- void stable_sort(RandomAccessIterator first, RandomAccessIterator last);
-T template<class RandomAccessIterator, class Compare>
- void stable_sort(RandomAccessIterator first, RandomAccessIterator last,
- Compare comp);
-T template<class RandomAccessIterator>
- void partial_sort(RandomAccessIterator first,
- RandomAccessIterator middle,
- RandomAccessIterator last);
-T template<class RandomAccessIterator, class Compare>
- void partial_sort(RandomAccessIterator first,
- RandomAccessIterator middle,
- RandomAccessIterator last, Compare comp);
-T template<class InputIterator, class RandomAccessIterator>
- RandomAccessIterator
- partial_sort_copy(InputIterator first, InputIterator last,
- RandomAccessIterator result_first,
- RandomAccessIterator result_last);
-T template<class InputIterator, class RandomAccessIterator, class Compare>
- RandomAccessIterator
- partial_sort_copy(InputIterator first, InputIterator last,
- RandomAccessIterator result_first,
- RandomAccessIterator result_last,
- Compare comp);
-
-T template<class RandomAccessIterator>
- void nth_element(RandomAccessIterator first, RandomAccessIterator nth,
- RandomAccessIterator last);
-T template<class RandomAccessIterator, class Compare>
- void nth_element(RandomAccessIterator first, RandomAccessIterator nth,
- RandomAccessIterator last, Compare comp);
- // _lib.alg.binary.search_, binary search:
-T template<class ForwardIterator, class T>
- ForwardIterator lower_bound(ForwardIterator first, ForwardIterator last,
- const T& value);
-T template<class ForwardIterator, class T, class Compare>
- ForwardIterator lower_bound(ForwardIterator first, ForwardIterator last,
- const T& value, Compare comp);
-T template<class ForwardIterator, class T>
- ForwardIterator upper_bound(ForwardIterator first, ForwardIterator last,
- const T& value);
-T template<class ForwardIterator, class T, class Compare>
- ForwardIterator upper_bound(ForwardIterator first, ForwardIterator last,
- const T& value, Compare comp);
-T template<class ForwardIterator, class T>
- pair<ForwardIterator, ForwardIterator>
- equal_range(ForwardIterator first, ForwardIterator last,
- const T& value);
-T template<class ForwardIterator, class T, class Compare>
- pair<ForwardIterator, ForwardIterator>
- equal_range(ForwardIterator first, ForwardIterator last,
- const T& value, Compare comp);
-T template<class ForwardIterator, class T>
- bool binary_search(ForwardIterator first, ForwardIterator last,
- const T& value);
-T template<class ForwardIterator, class T, class Compare>
- bool binary_search(ForwardIterator first, ForwardIterator last,
- const T& value, Compare comp);
- // _lib.alg.merge_, merge:
-T template<class InputIterator1, class InputIterator2, class OutputIterator>
- OutputIterator merge(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, InputIterator2 last2,
- OutputIterator result);
-T template<class InputIterator1, class InputIterator2, class OutputIterator,
- class Compare>
- OutputIterator merge(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, InputIterator2 last2,
- OutputIterator result, Compare comp);
-T template<class BidirectionalIterator>
- void inplace_merge(BidirectionalIterator first,
- BidirectionalIterator middle,
- BidirectionalIterator last);
-T template<class BidirectionalIterator, class Compare>
- void inplace_merge(BidirectionalIterator first,
- BidirectionalIterator middle,
- BidirectionalIterator last, Compare comp);
-
- // _lib.alg.set.operations_, set operations:
-T template<class InputIterator1, class InputIterator2>
- bool includes(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, InputIterator2 last2);
-T template<class InputIterator1, class InputIterator2, class Compare>
- bool includes(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, InputIterator2 last2, Compare comp);
-T template<class InputIterator1, class InputIterator2, class OutputIterator>
- OutputIterator set_union(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, InputIterator2 last2,
- OutputIterator result);
-T template<class InputIterator1, class InputIterator2, class OutputIterator,
- class Compare>
- OutputIterator set_union(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, InputIterator2 last2,
- OutputIterator result, Compare comp);
-T template<class InputIterator1, class InputIterator2, class OutputIterator>
- OutputIterator set_intersection
- (InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, InputIterator2 last2,
- OutputIterator result);
-T template<class InputIterator1, class InputIterator2, class OutputIterator,
- class Compare>
- OutputIterator set_intersection
- (InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, InputIterator2 last2,
- OutputIterator result, Compare comp);
-T template<class InputIterator1, class InputIterator2, class OutputIterator>
- OutputIterator set_difference
- (InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, InputIterator2 last2,
- OutputIterator result);
-T template<class InputIterator1, class InputIterator2, class OutputIterator,
- class Compare>
- OutputIterator set_difference(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, InputIterator2 last2,
- OutputIterator result, Compare comp);
-T template<class InputIterator1, class InputIterator2, class OutputIterator>
- OutputIterator
- set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, InputIterator2 last2,
- OutputIterator result);
-T template<class InputIterator1, class InputIterator2, class OutputIterator,
- class Compare>
- OutputIterator
- set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, InputIterator2 last2,
- OutputIterator result, Compare comp);
- // _lib.alg.heap.operations_, heap operations:
-T template<class RandomAccessIterator>
- void push_heap(RandomAccessIterator first, RandomAccessIterator last);
-T template<class RandomAccessIterator, class Compare>
- void push_heap(RandomAccessIterator first, RandomAccessIterator last,
- Compare comp);
-
-T template<class RandomAccessIterator>
- void pop_heap(RandomAccessIterator first, RandomAccessIterator last);
-T template<class RandomAccessIterator, class Compare>
- void pop_heap(RandomAccessIterator first, RandomAccessIterator last,
- Compare comp);
-T template<class RandomAccessIterator>
- void make_heap(RandomAccessIterator first, RandomAccessIterator last);
-T template<class RandomAccessIterator, class Compare>
- void make_heap(RandomAccessIterator first, RandomAccessIterator last,
- Compare comp);
-T template<class RandomAccessIterator>
- void sort_heap(RandomAccessIterator first, RandomAccessIterator last);
-T template<class RandomAccessIterator, class Compare>
- void sort_heap(RandomAccessIterator first, RandomAccessIterator last,
- Compare comp);
- // _lib.alg.min.max_, minimum and maximum:
-T template<class T> const T& min(const T& a, const T& b);
-T template<class T, class Compare>
- const T& min(const T& a, const T& b, Compare comp);
-T template<class T> const T& max(const T& a, const T& b);
-T template<class T, class Compare>
- const T& max(const T& a, const T& b, Compare comp);
-T template<class ForwardIterator>
- ForwardIterator min_element(ForwardIterator first, ForwardIterator last);
-T template<class ForwardIterator, class Compare>
- ForwardIterator min_element(ForwardIterator first, ForwardIterator last,
- Compare comp);
-T template<class ForwardIterator>
- ForwardIterator max_element(ForwardIterator first, ForwardIterator last);
-T template<class ForwardIterator, class Compare>
- ForwardIterator max_element(ForwardIterator first, ForwardIterator last,
- Compare comp);
-T template<class InputIterator1, class InputIterator2>
- bool lexicographical_compare
- (InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, InputIterator2 last2);
-T template<class InputIterator1, class InputIterator2, class Compare>
- bool lexicographical_compare
- (InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, InputIterator2 last2,
- Compare comp);
-
- // _lib.alg.permutation.generators_, permutations
-T template<class BidirectionalIterator>
- bool next_permutation(BidirectionalIterator first,
- BidirectionalIterator last);
-T template<class BidirectionalIterator, class Compare>
- bool next_permutation(BidirectionalIterator first,
- BidirectionalIterator last, Compare comp);
-T template<class BidirectionalIterator>
- bool prev_permutation(BidirectionalIterator first,
- BidirectionalIterator last);
-T template<class BidirectionalIterator, class Compare>
- bool prev_permutation(BidirectionalIterator first,
- BidirectionalIterator last, Compare comp);
-
-
- 25.4 C library algorithms [lib.alg.c.library]
-
- 1 Header <cstdlib> (partial, Table 2):
-
- Table 2--Header <cstdlib> synopsis
-
- Functions: bsearch qsort
-
-
-X extern "C" void *bsearch(const void *key, const void *base,
- size_t nmemb, size_t size,
- int (*compar)(const void *, const void *));
-X extern "C++" void *bsearch(const void *key, const void *base,
- size_t nmemb, size_t size,
- int (*compar)(const void *, const void *));
-
-X extern "C" void qsort(void* base, size_t nmemb, size_t size,
- int (*compar)(const void*, const void*));
-X extern "C++" void qsort(void* base, size_t nmemb, size_t size,
- int (*compar)(const void*, const void*));
-
-
-
- 26.2 Complex numbers [lib.complex.numbers]
-
-
- 26.2.1 Header <complex> synopsis [lib.complex.synopsis]
-
-T template<class T> class complex;
-T template<> class complex<float>;
-T template<> class complex<double>;
-T template<> class complex<long double>;
- // _lib.complex.ops_ operators:
-T template<class T>
- complex<T> operator+(const complex<T>&, const complex<T>&);
-T template<class T> complex<T> operator+(const complex<T>&, const T&);
-T template<class T> complex<T> operator+(const T&, const complex<T>&);
-T template<class T> complex<T> operator-
- (const complex<T>&, const complex<T>&);
-T template<class T> complex<T> operator-(const complex<T>&, const T&);
-T template<class T> complex<T> operator-(const T&, const complex<T>&);
-T template<class T> complex<T> operator*
- (const complex<T>&, const complex<T>&);
-T template<class T> complex<T> operator*(const complex<T>&, const T&);
-T template<class T> complex<T> operator*(const T&, const complex<T>&);
-T template<class T> complex<T> operator/
- (const complex<T>&, const complex<T>&);
-T template<class T> complex<T> operator/(const complex<T>&, const T&);
-T template<class T> complex<T> operator/(const T&, const complex<T>&);
-T template<class T> complex<T> operator+(const complex<T>&);
-T template<class T> complex<T> operator-(const complex<T>&);
-T template<class T> bool operator==
- (const complex<T>&, const complex<T>&);
-T template<class T> bool operator==(const complex<T>&, const T&);
-T template<class T> bool operator==(const T&, const complex<T>&);
-T template<class T> bool operator!=(const complex<T>&, const complex<T>&);
-T template<class T> bool operator!=(const complex<T>&, const T&);
-T template<class T> bool operator!=(const T&, const complex<T>&);
-T template<class T, class charT, class traits>
- basic_istream<charT, traits>&
- operator>>(basic_istream<charT, traits>&, complex<T>&);
-
-T template<class T, class charT, class traits>
- basic_ostream<charT, traits>&
- operator<<(basic_ostream<charT, traits>&, const complex<T>&);
- // _lib.complex.value.ops_ values:
-T template<class T> T real(const complex<T>&);
-T template<class T> T imag(const complex<T>&);
-
-T template<class T> T abs(const complex<T>&);
-T template<class T> T arg(const complex<T>&);
-T template<class T> T norm(const complex<T>&);
-T template<class T> complex<T> conj(const complex<T>&);
-T template<class T> complex<T> polar(const T&, const T&);
- // _lib.complex.transcendentals_ transcendentals:
-T template<class T> complex<T> cos (const complex<T>&);
-T template<class T> complex<T> cosh (const complex<T>&);
-T template<class T> complex<T> exp (const complex<T>&);
-T template<class T> complex<T> log (const complex<T>&);
-T template<class T> complex<T> log10(const complex<T>&);
-T template<class T> complex<T> pow(const complex<T>&, int);
-T template<class T> complex<T> pow(const complex<T>&, const T&);
-T template<class T> complex<T> pow(const complex<T>&, const complex<T>&);
-T template<class T> complex<T> pow(const T&, const complex<T>&);
-T template<class T> complex<T> sin (const complex<T>&);
-T template<class T> complex<T> sinh (const complex<T>&);
-T template<class T> complex<T> sqrt (const complex<T>&);
-T template<class T> complex<T> tan (const complex<T>&);
-T template<class T> complex<T> tanh (const complex<T>&);
- }
-
- 26.2.2 Template class complex [lib.complex]
-
- template<class T>
-T class complex {
- public:
-T typedef T value_type;
-
-T complex(const T& re = T(), const T& im = T());
-T complex(const complex&);
-T template<class X> complex(const complex<X>&);
-
-T T real() const;
-T T imag() const;
-
-T complex<T>& operator= (const T&);
-T complex<T>& operator+=(const T&);
-T complex<T>& operator-=(const T&);
-T complex<T>& operator*=(const T&);
-T complex<T>& operator/=(const T&);
-
-T complex& operator=(const complex&);
-T template<class X> complex<T>& operator= (const complex<X>&);
-T template<class X> complex<T>& operator+=(const complex<X>&);
-T template<class X> complex<T>& operator-=(const complex<X>&);
-T template<class X> complex<T>& operator*=(const complex<X>&);
-T template<class X> complex<T>& operator/=(const complex<X>&);
- };
-
-T template<class T> complex<T> operator+
- (const complex<T>&, const complex<T>&);
-T template<class T> complex<T> operator+(const complex<T>&, const T&);
-T template<class T> complex<T> operator+(const T&, const complex<T>&);
-
-T template<class T> complex<T> operator-
- (const complex<T>&, const complex<T>&);
-T template<class T> complex<T> operator-(const complex<T>&, const T&);
-T template<class T> complex<T> operator-(const T&, const complex<T>&);
-
-T template<class T> complex<T> operator*
- (const complex<T>&, const complex<T>&);
-T template<class T> complex<T> operator*(const complex<T>&, const T&);
-T template<class T> complex<T> operator*(const T&, const complex<T>&);
-
-T template<class T> complex<T> operator/
- (const complex<T>&, const complex<T>&);
-T template<class T> complex<T> operator/(const complex<T>&, const T&);
-T template<class T> complex<T> operator/(const T&, const complex<T>&);
-
-T template<class T> complex<T> operator+(const complex<T>&);
-T template<class T> complex<T> operator-(const complex<T>&);
-
-T template<class T> bool operator==(const complex<T>&, const complex<T>&);
-T template<class T> bool operator==(const complex<T>&, const T&);
-T template<class T> bool operator==(const T&, const complex<T>&);
-
-T template<class T> bool operator!=(const complex<T>&, const complex<T>&);
-T template<class T> bool operator!=(const complex<T>&, const T&);
-T template<class T> bool operator!=(const T&, const complex<T>&);
-
-T template<class T, class charT, class traits>
- basic_istream<charT, traits>&
- operator>>(basic_istream<charT, traits>&, complex<T>&);
-
-T template<class T, class charT, class traits>
- basic_ostream<charT, traits>&
- operator<<(basic_ostream<charT, traits>&, const complex<T>&);
-
-
- 26.2.3 complex specializations [lib.complex.special]
-
-T template<> class complex<float> {
- public:
-T typedef float value_type;
-
-T complex(float re = 0.0f, float im = 0.0f);
-T explicit complex(const complex<double>&);
-T explicit complex(const complex<long double>&);
-T float real() const;
-T float imag() const;
-
-T complex<float>& operator= (float);
-T complex<float>& operator+=(float);
-T complex<float>& operator-=(float);
-T complex<float>& operator*=(float);
-T complex<float>& operator/=(float);
-
-T complex<float>& operator=(const complex<float>&);
-T template<class X> complex<float>& operator= (const complex<X>&);
-T template<class X> complex<float>& operator+=(const complex<X>&);
-T template<class X> complex<float>& operator-=(const complex<X>&);
-T template<class X> complex<float>& operator*=(const complex<X>&);
-T template<class X> complex<float>& operator/=(const complex<X>&);
- };
-T template<> class complex<double> {
- public:
-T typedef double value_type;
-
-T complex(double re = 0.0, double im = 0.0);
-T complex(const complex<float>&);
-T explicit complex(const complex<long double>&);
-T double real() const;
-T double imag() const;
-
-T complex<double>& operator= (double);
-T complex<double>& operator+=(double);
-T complex<double>& operator-=(double);
-T complex<double>& operator*=(double);
-T complex<double>& operator/=(double);
-
-T complex<double>& operator=(const complex<double>&);
-T template<class X> complex<double>& operator= (const complex<X>&);
-T template<class X> complex<double>& operator+=(const complex<X>&);
-T template<class X> complex<double>& operator-=(const complex<X>&);
-T template<class X> complex<double>& operator*=(const complex<X>&);
-T template<class X> complex<double>& operator/=(const complex<X>&);
- };
-
-T template<> class complex<long double> {
- public:
-T typedef long double value_type;
-
-T complex(long double re = 0.0L, long double im = 0.0L);
-T complex(const complex<float>&);
-T complex(const complex<double>&);
-T long double real() const;
-T long double imag() const;
-
-T complex<long double>& operator=(const complex<long double>&);
-T complex<long double>& operator= (long double);
-T complex<long double>& operator+=(long double);
-T complex<long double>& operator-=(long double);
-T complex<long double>& operator*=(long double);
-T complex<long double>& operator/=(long double);
-
-T template<class X> complex<long double>& operator= (const complex<X>&);
-T template<class X> complex<long double>& operator+=(const complex<X>&);
-T template<class X> complex<long double>& operator-=(const complex<X>&);
-T template<class X> complex<long double>& operator*=(const complex<X>&);
-T template<class X> complex<long double>& operator/=(const complex<X>&);
- };
-
- 26.3 Numeric arrays [lib.numarray]
-
- 26.3.1 Header <valarray> synopsis [lib.valarray.synopsis]
-
-T template<class T> class valarray; // An array of type T
-T class slice;
-T template<class T> class slice_array;
-T class gslice;
-T template<class T> class gslice_array;
-T template<class T> class mask_array; // a masked array
-T template<class T> class indirect_array; // an indirected array
-
-T template<class T> valarray<T> operator*
- (const valarray<T>&, const valarray<T>&);
-T template<class T> valarray<T> operator* (const valarray<T>&, const T&);
-T template<class T> valarray<T> operator* (const T&, const valarray<T>&);
-T template<class T> valarray<T> operator/
- (const valarray<T>&, const valarray<T>&);
-T template<class T> valarray<T> operator/ (const valarray<T>&, const T&);
-T template<class T> valarray<T> operator/ (const T&, const valarray<T>&);
-T template<class T> valarray<T> operator%
- (const valarray<T>&, const valarray<T>&);
-T template<class T> valarray<T> operator% (const valarray<T>&, const T&);
-T template<class T> valarray<T> operator% (const T&, const valarray<T>&);
-T template<class T> valarray<T> operator+
- (const valarray<T>&, const valarray<T>&);
-T template<class T> valarray<T> operator+ (const valarray<T>&, const T&);
-T template<class T> valarray<T> operator+ (const T&, const valarray<T>&);
-T template<class T> valarray<T> operator-
- (const valarray<T>&, const valarray<T>&);
-T template<class T> valarray<T> operator- (const valarray<T>&, const T&);
-T template<class T> valarray<T> operator- (const T&, const valarray<T>&);
-T template<class T> valarray<T> operator^
- (const valarray<T>&, const valarray<T>&);
-T template<class T> valarray<T> operator^ (const valarray<T>&, const T&);
-T template<class T> valarray<T> operator^ (const T&, const valarray<T>&);
-T template<class T> valarray<T> operator&
- (const valarray<T>&, const valarray<T>&);
-T template<class T> valarray<T> operator& (const valarray<T>&, const T&);
-T template<class T> valarray<T> operator& (const T&, const valarray<T>&);
-T template<class T> valarray<T> operator|
- (const valarray<T>&, const valarray<T>&);
-T template<class T> valarray<T> operator| (const valarray<T>&, const T&);
-T template<class T> valarray<T> operator| (const T&, const valarray<T>&);
-T template<class T> valarray<T> operator<<
- (const valarray<T>&, const valarray<T>&);
-T template<class T> valarray<T> operator<<(const valarray<T>&, const T&);
-T template<class T> valarray<T> operator<<(const T&, const valarray<T>&);
-T template<class T> valarray<T> operator>>
- (const valarray<T>&, const valarray<T>&);
-T template<class T> valarray<T> operator>>(const valarray<T>&, const T&);
-T template<class T> valarray<T> operator>>(const T&, const valarray<T>&);
-T template<class T> valarray<bool> operator&&
- (const valarray<T>&, const valarray<T>&);
-T template<class T> valarray<bool> operator&&(const valarray<T>&, const T&);
-T template<class T> valarray<bool> operator&&(const T&, const valarray<T>&);
-T template<class T> valarray<bool> operator||
- (const valarray<T>&, const valarray<T>&);
-T template<class T> valarray<bool> operator||(const valarray<T>&, const T&);
-T template<class T> valarray<bool> operator||(const T&, const valarray<T>&);
-
-T template<class T>
- valarray<bool> operator==(const valarray<T>&, const valarray<T>&);
-T template<class T> valarray<bool> operator==(const valarray<T>&, const T&);
-T template<class T> valarray<bool> operator==(const T&, const valarray<T>&);
-T template<class T>
- valarray<bool> operator!=(const valarray<T>&, const valarray<T>&);
-T template<class T> valarray<bool> operator!=(const valarray<T>&, const T&);
-T template<class T> valarray<bool> operator!=(const T&, const valarray<T>&);
-T template<class T>
- valarray<bool> operator< (const valarray<T>&, const valarray<T>&);
-T template<class T> valarray<bool> operator< (const valarray<T>&, const T&);
-T template<class T> valarray<bool> operator< (const T&, const valarray<T>&);
-T template<class T>
- valarray<bool> operator> (const valarray<T>&, const valarray<T>&);
-T template<class T> valarray<bool> operator> (const valarray<T>&, const T&);
-T template<class T> valarray<bool> operator> (const T&, const valarray<T>&);
-T template<class T>
- valarray<bool> operator<=(const valarray<T>&, const valarray<T>&);
-T template<class T> valarray<bool> operator<=(const valarray<T>&, const T&);
-T template<class T> valarray<bool> operator<=(const T&, const valarray<T>&);
-T template<class T>
- valarray<bool> operator>=(const valarray<T>&, const valarray<T>&);
-T template<class T> valarray<bool> operator>=(const valarray<T>&, const T&);
-T template<class T> valarray<bool> operator>=(const T&, const valarray<T>&);
-T template<class T> valarray<T> abs (const valarray<T>&);
-T template<class T> valarray<T> acos (const valarray<T>&);
-T template<class T> valarray<T> asin (const valarray<T>&);
-T template<class T> valarray<T> atan (const valarray<T>&);
-T template<class T> valarray<T> atan2
- (const valarray<T>&, const valarray<T>&);
-T template<class T> valarray<T> atan2(const valarray<T>&, const T&);
-T template<class T> valarray<T> atan2(const T&, const valarray<T>&);
-T template<class T> valarray<T> cos (const valarray<T>&);
-T template<class T> valarray<T> cosh (const valarray<T>&);
-T template<class T> valarray<T> exp (const valarray<T>&);
-T template<class T> valarray<T> log (const valarray<T>&);
-T template<class T> valarray<T> log10(const valarray<T>&);
-T template<class T> valarray<T> pow(const valarray<T>&, const valarray<T>&);
-T template<class T> valarray<T> pow(const valarray<T>&, const T&);
-T template<class T> valarray<T> pow(const T&, const valarray<T>&);
-T template<class T> valarray<T> sin (const valarray<T>&);
-T template<class T> valarray<T> sinh (const valarray<T>&);
-T template<class T> valarray<T> sqrt (const valarray<T>&);
-T template<class T> valarray<T> tan (const valarray<T>&);
-T template<class T> valarray<T> tanh (const valarray<T>&);
- }
-
-
- 26.3.2 Template class valarray [lib.template.valarray]
-
-T template<class T> class valarray {
- public:
-T typedef T value_type;
-
- // _lib.valarray.cons_ construct/destroy:
-T valarray();
-T explicit valarray(size_t);
-T valarray(const T&, size_t);
-T valarray(const T*, size_t);
-T valarray(const valarray&);
-T valarray(const slice_array<T>&);
-T valarray(const gslice_array<T>&);
-T valarray(const mask_array<T>&);
-T valarray(const indirect_array<T>&);
-T ~valarray();
-
- // _lib.valarray.assign_ assignment:
-T valarray<T>& operator=(const valarray<T>&);
-T valarray<T>& operator=(const T&);
-T valarray<T>& operator=(const slice_array<T>&);
-T valarray<T>& operator=(const gslice_array<T>&);
-T valarray<T>& operator=(const mask_array<T>&);
-T valarray<T>& operator=(const indirect_array<T>&);
- // _lib.valarray.access_ element access:
-T T operator[](size_t) const;
-T T& operator[](size_t);
- // _lib.valarray.sub_ subset operations:
-T valarray<T> operator[](slice) const;
-T slice_array<T> operator[](slice);
-T valarray<T> operator[](const gslice&) const;
-T gslice_array<T> operator[](const gslice&);
-T valarray<T> operator[](const valarray<bool>&) const;
-T mask_array<T> operator[](const valarray<bool>&);
-T valarray<T> operator[](const valarray<size_t>&) const;
-T indirect_array<T> operator[](const valarray<size_t>&);
- // _lib.valarray.unary_ unary operators:
-T valarray<T> operator+() const;
-T valarray<T> operator-() const;
-T valarray<T> operator~() const;
-T valarray<T> operator!() const;
- // _lib.valarray.cassign_ computed assignment:
-T valarray<T>& operator*= (const T&);
-T valarray<T>& operator/= (const T&);
-T valarray<T>& operator%= (const T&);
-T valarray<T>& operator+= (const T&);
-T valarray<T>& operator-= (const T&);
-T valarray<T>& operator^= (const T&);
-T valarray<T>& operator&= (const T&);
-T valarray<T>& operator|= (const T&);
-T valarray<T>& operator<<=(const T&);
-T valarray<T>& operator>>=(const T&);
-T valarray<T>& operator*= (const valarray<T>&);
-T valarray<T>& operator/= (const valarray<T>&);
-T valarray<T>& operator%= (const valarray<T>&);
-T valarray<T>& operator+= (const valarray<T>&);
-T valarray<T>& operator-= (const valarray<T>&);
-T valarray<T>& operator^= (const valarray<T>&);
-T valarray<T>& operator|= (const valarray<T>&);
-T valarray<T>& operator&= (const valarray<T>&);
-T valarray<T>& operator<<=(const valarray<T>&);
-T valarray<T>& operator>>=(const valarray<T>&);
- // _lib.valarray.members_ member functions:
-T size_t size() const;
-T T sum() const;
-T T min() const;
-T T max() const;
-
-T valarray<T> shift (int) const;
-T valarray<T> cshift(int) const;
-T valarray<T> apply(T func(T)) const;
-T valarray<T> apply(T func(const T&)) const;
-T void resize(size_t sz, T c = T());
- };
- }
-
-
-
- 26.3.4 Class slice [lib.class.slice]
-
-T class slice {
- public:
-T slice();
-T slice(size_t, size_t, size_t);
-
-T size_t start() const;
-T size_t size() const;
-T size_t stride() const;
- };
- }
-
-
-
- 26.3.5 Template class slice_array [lib.template.slice.array]
-
-T template <class T> class slice_array {
- public:
-T typedef T value_type;
-
-T void operator= (const valarray<T>&) const;
-T void operator*= (const valarray<T>&) const;
-T void operator/= (const valarray<T>&) const;
-T void operator%= (const valarray<T>&) const;
-T void operator+= (const valarray<T>&) const;
-T void operator-= (const valarray<T>&) const;
-T void operator^= (const valarray<T>&) const;
-T void operator&= (const valarray<T>&) const;
-T void operator|= (const valarray<T>&) const;
-T void operator<<=(const valarray<T>&) const;
-T void operator>>=(const valarray<T>&) const;
-T void operator=(const T&);
-T ~slice_array();
- private:
-T slice_array();
-T slice_array(const slice_array&);
-T slice_array& operator=(const slice_array&);
- };
- }
-
-
-
- 26.3.6 The gslice class [lib.class.gslice]
-
-T class gslice {
- public:
-T gslice();
-T gslice(size_t s, const valarray<size_t>& l, const valarray<size_t>& d);
-
-T size_t start() const;
-T valarray<size_t> size() const;
-T valarray<size_t> stride() const;
- };
-
-
- 26.3.7 Template class gslice_array [lib.template.gslice.array]
-
-T template <class T> class gslice_array {
- public:
-T typedef T value_type;
-
-T void operator= (const valarray<T>&) const;
-T void operator*= (const valarray<T>&) const;
-T void operator/= (const valarray<T>&) const;
-T void operator%= (const valarray<T>&) const;
-T void operator+= (const valarray<T>&) const;
-T void operator-= (const valarray<T>&) const;
-T void operator^= (const valarray<T>&) const;
-T void operator&= (const valarray<T>&) const;
-T void operator|= (const valarray<T>&) const;
-T void operator<<=(const valarray<T>&) const;
-T void operator>>=(const valarray<T>&) const;
-T void operator=(const T&);
-T ~gslice_array();
- private:
-T gslice_array();
-T gslice_array(const gslice_array&);
-T gslice_array& operator=(const gslice_array&);
- };
-
-
- 26.3.8 Template class mask_array [lib.template.mask.array]
-
-T template <class T> class mask_array {
- public:
-T typedef T value_type;
-
-T void operator= (const valarray<T>&) const;
-T void operator*= (const valarray<T>&) const;
-T void operator/= (const valarray<T>&) const;
-T void operator%= (const valarray<T>&) const;
-T void operator+= (const valarray<T>&) const;
-T void operator-= (const valarray<T>&) const;
-T void operator^= (const valarray<T>&) const;
-T void operator&= (const valarray<T>&) const;
-T void operator|= (const valarray<T>&) const;
-T void operator<<=(const valarray<T>&) const;
-T void operator>>=(const valarray<T>&) const;
-T void operator=(const T&);
-T ~mask_array();
- private:
-T mask_array();
-T mask_array(const mask_array&);
-T mask_array& operator=(const mask_array&);
- // remainder implementation defined
- };
-
-
- 26.3.9 Template class [lib.template.indirect.array]
- indirect_array
-
-T template <class T> class indirect_array {
- public:
-T typedef T value_type;
-
-T void operator= (const valarray<T>&) const;
-T void operator*= (const valarray<T>&) const;
-T void operator/= (const valarray<T>&) const;
-T void operator%= (const valarray<T>&) const;
-T void operator+= (const valarray<T>&) const;
-T void operator-= (const valarray<T>&) const;
-T void operator^= (const valarray<T>&) const;
-T void operator&= (const valarray<T>&) const;
-T void operator|= (const valarray<T>&) const;
-T void operator<<=(const valarray<T>&) const;
-T void operator>>=(const valarray<T>&) const;
-T void operator=(const T&);
-T ~indirect_array();
- private:
-T indirect_array();
-T indirect_array(const indirect_array&);
-T indirect_array& operator=(const indirect_array&);
- // remainder implementation defined
- };
-
- 26.4 Generalized numeric operations [lib.numeric.ops]
-
- Header <numeric> synopsis
-
-T template <class InputIterator, class T>
- T accumulate(InputIterator first, InputIterator last, T init);
-
-T template <class InputIterator, class T, class BinaryOperation>
- T accumulate(InputIterator first, InputIterator last, T init,
- BinaryOperation binary_op);
-
-T template <class InputIterator1, class InputIterator2, class T>
- T inner_product(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, T init);
-
-T template <class InputIterator1, class InputIterator2, class T,
- class BinaryOperation1, class BinaryOperation2>
- T inner_product(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, T init,
- BinaryOperation1 binary_op1,
- BinaryOperation2 binary_op2);
-
-T template <class InputIterator, class OutputIterator>
- OutputIterator partial_sum(InputIterator first,
- InputIterator last,
- OutputIterator result);
-
-T template <class InputIterator, class OutputIterator,
- class BinaryOperation>
- OutputIterator partial_sum(InputIterator first,
- InputIterator last,
- OutputIterator result,
- BinaryOperation binary_op);
-
-T template <class InputIterator, class OutputIterator>
- OutputIterator adjacent_difference(InputIterator first,
- InputIterator last,
- OutputIterator result);
-
-T template <class InputIterator, class OutputIterator,
- class BinaryOperation>
- OutputIterator adjacent_difference(InputIterator first,
- InputIterator last,
- OutputIterator result,
- BinaryOperation binary_op);
-
-
- 26.5 C Library [lib.c.math]
-
- Table 2--Header <cmath> synopsis
-X Macro: HUGE_VAL
- Functions:
-X acos cos fmod modf tan
-X asin cosh frexp pow tanh
-X atan exp ldexp sin
-X atan2 fabs log sinh
-X ceil floor log10 sqrt
-
- Table 3--Header <cstdlib> synopsis
-X Macros: RAND_MAX
-X Types: div_t ldiv_t
- Functions:
-X abs labs srand
-X div ldiv rand
-
-X long abs(long); // labs()
-X ldiv_t div(long, long); // ldiv()
-
-X float abs (float);
-X float acos (float);
-X float asin (float);
-X float atan (float);
-X float atan2(float, float);
-X float ceil (float);
-X float cos (float);
-X float cosh (float);
-X float exp (float);
-X float fabs (float);
-X float floor(float);
-X float fmod (float, float);
-X float frexp(float, int*);
-X float ldexp(float, int);
-X float log (float);
-X float log10(float);
-X float modf (float, float*);
-X float pow (float, float);
-X float pow (float, int);
-X float sin (float);
-X float sinh (float);
-X float sqrt (float);
-X float tan (float);
-X float tanh (float);
-
-X double abs(double); // fabs()
-X double pow(double, int);
-
-X long double abs (long double);
-X long double acos (long double);
-X long double asin (long double);
-X long double atan (long double);
-X long double atan2(long double, long double);
-X long double ceil (long double);
-X long double cos (long double);
-X long double cosh (long double);
-X long double exp (long double);
-X long double fabs (long double);
-X long double floor(long double);
-X long double fmod (long double, long double);
-X long double frexp(long double, int*);
-X long double ldexp(long double, int);
-X long double log (long double);
-X long double log10(long double);
-X long double modf (long double, long double*);
-X long double pow (long double, long double);
-X long double pow (long double, int);
-X long double sin (long double);
-X long double sinh (long double);
-X long double sqrt (long double);
-X long double tan (long double);
-X long double tanh (long double);
-
- Header <iosfwd> synopsis
-
-X template<class charT> class char_traits;
-X template<> class char_traits<char>;
-X template<> class char_traits<wchar_t>;
-X template<class T> class allocator;
-X template <class charT, class traits = char_traits<charT> >
- class basic_ios;
-
-X template <class charT, class traits = char_traits<charT> >
- class basic_streambuf;
-
-X template <class charT, class traits = char_traits<charT> >
- class basic_istream;
-
-X template <class charT, class traits = char_traits<charT> >
- class basic_ostream;
-
-X template <class charT, class traits = char_traits<charT> >
- class basic_iostream;
-
-X template <class charT, class traits = char_traits<charT>,
- class Allocator = allocator<charT> >
- class basic_stringbuf;
-
-X template <class charT, class traits = char_traits<charT>,
- class Allocator = allocator<charT> >
- class basic_istringstream;
-
-X template <class charT, class traits = char_traits<charT>,
- class Allocator = allocator<charT> >
- class basic_ostringstream;
-
-X template <class charT, class traits = char_traits<charT>,
- class Allocator = allocator<charT> >
- class basic_stringstream;
-
-X template <class charT, class traits = char_traits<charT> >
- class basic_filebuf;
-
-X template <class charT, class traits = char_traits<charT> >
- class basic_ifstream;
-
-X template <class charT, class traits = char_traits<charT> >
- class basic_ofstream;
-
-X template <class charT, class traits = char_traits<charT> >
- class basic_fstream;
-X template <class charT, class traits = char_traits<charT> >
- class istreambuf_iterator;
-
-X template <class charT, class traits = char_traits<charT> >
- class ostreambuf_iterator;
-X typedef basic_ios<char> ios;
-X typedef basic_ios<wchar_t> wios;
-X typedef basic_streambuf<char> streambuf;
-X typedef basic_istream<char> istream;
-X typedef basic_ostream<char> ostream;
-X typedef basic_iostream<char> iostream;
-X typedef basic_stringbuf<char> stringbuf;
-X typedef basic_istringstream<char> istringstream;
-X typedef basic_ostringstream<char> ostringstream;
-X typedef basic_stringstream<char> stringstream;
-X typedef basic_filebuf<char> filebuf;
-X typedef basic_ifstream<char> ifstream;
-X typedef basic_ofstream<char> ofstream;
-X typedef basic_fstream<char> fstream;
-X typedef basic_streambuf<wchar_t> wstreambuf;
-X typedef basic_istream<wchar_t> wistream;
-X typedef basic_ostream<wchar_t> wostream;
-X typedef basic_iostream<wchar_t> wiostream;
-X typedef basic_stringbuf<wchar_t> wstringbuf;
-X typedef basic_istringstream<wchar_t> wistringstream;
-X typedef basic_ostringstream<wchar_t> wostringstream;
-X typedef basic_stringstream<wchar_t> wstringstream;
-
-X typedef basic_filebuf<wchar_t> wfilebuf;
-X typedef basic_ifstream<wchar_t> wifstream;
-X typedef basic_ofstream<wchar_t> wofstream;
-X typedef basic_fstream<wchar_t> wfstream;
-X template <class state> class fpos;
-X typedef fpos<char_traits<char>::state_type> streampos;
-X typedef fpos<char_traits<wchar_t>::state_type> wstreampos;
-
- 27.3 Standard iostream objects [lib.iostream.objects]
-
- Header <iostream> synopsis
-
-T [must also include <istream> and <ostream>]
-T extern istream cin;
-T extern ostream cout;
-T extern ostream cerr;
-T extern ostream clog;
-
-T extern wistream wcin;
-T extern wostream wcout;
-T extern wostream wcerr;
-T extern wostream wclog;
-
- 27.4 Iostreams base classes [lib.iostreams.base]
-
- Header <ios> synopsis
-
- #include <iosfwd>
-
-T typedef OFF_T streamoff;
-T typedef SZ_T streamsize;
-T template <class stateT> class fpos;
-
- class ios_base;
- template <class charT, class traits = char_traits<charT> >
- class basic_ios;
- // _lib.std.ios.manip_, manipulators:
-T ios_base& boolalpha (ios_base& str);
-T ios_base& noboolalpha(ios_base& str);
-T ios_base& showbase (ios_base& str);
-T ios_base& noshowbase (ios_base& str);
-T ios_base& showpoint (ios_base& str);
-T ios_base& noshowpoint(ios_base& str);
-T ios_base& showpos (ios_base& str);
-T ios_base& noshowpos (ios_base& str);
-T ios_base& skipws (ios_base& str);
-T ios_base& noskipws (ios_base& str);
-T ios_base& nouppercase(ios_base& str);
-T ios_base& uppercase (ios_base& str);
-M ios_base& unitbuf (ios_base& str);
-M ios_base& nounitbuf (ios_base& str);
- // _lib.adjustfield.manip_ adjustfield:
-T ios_base& internal (ios_base& str);
-T ios_base& left (ios_base& str);
-T ios_base& right (ios_base& str);
- // _lib.basefield.manip_ basefield:
-T ios_base& dec (ios_base& str);
-T ios_base& hex (ios_base& str);
-T ios_base& oct (ios_base& str);
-
- // _lib.floatfield.manip_ floatfield:
-T ios_base& fixed (ios_base& str);
-T ios_base& scientific (ios_base& str);
-
-
- 27.4.2 Class ios_base [lib.ios.base]
-
-T class ios_base {
- public:
- class failure;
-T typedef T1 fmtflags;
-T static const fmtflags boolalpha;
-T static const fmtflags dec;
-T static const fmtflags fixed;
-T static const fmtflags hex;
-T static const fmtflags internal;
-T static const fmtflags left;
-T static const fmtflags oct;
-T static const fmtflags right;
-T static const fmtflags scientific;
-T static const fmtflags showbase;
-T static const fmtflags showpoint;
-T static const fmtflags showpos;
-T static const fmtflags skipws;
-X static const fmtflags unitbuf;
-T static const fmtflags uppercase;
-T static const fmtflags adjustfield;
-T static const fmtflags basefield;
-T static const fmtflags floatfield;
-
- typedef T2 iostate;
-T static const iostate badbit;
-T static const iostate eofbit;
-T static const iostate failbit;
-T static const iostate goodbit;
-T typedef T3 openmode;
-T static const openmode app;
-T static const openmode ate;
-T static const openmode binary;
-T static const openmode in;
-T static const openmode out;
-T static const openmode trunc;
-T typedef T4 seekdir;
-T static const seekdir beg;
-T static const seekdir cur;
-T static const seekdir end;
-T class Init;
- // _lib.fmtflags.state_ fmtflags state:
-T fmtflags flags() const;
-T fmtflags flags(fmtflags fmtfl);
-T fmtflags setf(fmtflags fmtfl);
-T fmtflags setf(fmtflags fmtfl, fmtflags mask);
-T void unsetf(fmtflags mask);
-T streamsize precision() const;
-T streamsize precision(streamsize prec);
-T streamsize width() const;
-T streamsize width(streamsize wide);
- // _lib.ios.base.locales_ locales:
-T locale imbue(const locale& loc);
-T locale getloc() const;
- // _lib.ios.base.storage_ storage:
-T static int xalloc();
-T long& iword(int index);
-T void*& pword(int index);
- // destructor
-T virtual ~ios_base();
- // _lib.ios.base.callback_ callbacks;
-T enum event { erase_event, imbue_event, copyfmt_event };
-T typedef void (*event_callback)(event, ios_base&, int index);
-T void register_callback(event_call_back fn, int index);
-T static bool sync_with_stdio(bool sync = true);
- protected:
-T ios_base();
- };
-
- 27.4.2.1.1 Class ios_base::failure [lib.ios::failure]
-
-T class ios_base::failure : public exception {
- public:
-T explicit failure(const string& msg);
-T virtual ~failure();
-T virtual const char* what() const throw();
- };
-
-
- 27.4.2.1.6 Class ios_base::Init [lib.ios::Init]
-
-T class ios_base::Init {
- public:
-T Init();
-T ~Init();
- };
-
-
- 27.4.3 Template class fpos [lib.fpos]
-
-X template <class stateT> class fpos {
- public:
- // _lib.fpos.members_ Members
-T stateT state() const;
-T void state(stateT);
- private;
-T stateT st; // exposition only
- };
-
-
- 27.4.5 Template class basic_ios [lib.ios]
-
- template <class charT, class traits = char_traits<charT> >
-X class basic_ios : public ios_base {
- public:
-
- // Types:
-T typedef charT char_type;
-T typedef typename traits::int_type int_type;
-T typedef typename traits::pos_type pos_type;
-T typedef typename traits::off_type off_type;
-T typedef traits traits_type;
-T operator void*() const
-T bool operator!() const
-T iostate rdstate() const;
-T void clear(iostate state = goodbit);
-T void setstate(iostate state);
-T bool good() const;
-T bool eof() const;
-T bool fail() const;
-T bool bad() const;
-T iostate exceptions() const;
-T void exceptions(iostate except);
- // _lib.basic.ios.cons_ Constructor/destructor:
-T explicit basic_ios(basic_streambuf<charT,traits>* sb);
-T virtual ~basic_ios();
- // _lib.basic.ios.members_ Members:
-T basic_ostream<charT,traits>* tie() const;
-T basic_ostream<charT,traits>* tie(basic_ostream<charT,traits>* tiestr);
-T basic_streambuf<charT,traits>* rdbuf() const;
-T basic_streambuf<charT,traits>* rdbuf(basic_streambuf<charT,traits>* sb);
-X basic_ios& copyfmt(const basic_ios& rhs);
-T char_type fill() const;
-T char_type fill(char_type ch);
- // _lib.ios.base.locales_ locales:
-T locale imbue(const locale& loc);
-X char narrow(char_type c, char dfault) const;
-X char_type widen(char c) const;
- protected:
- basic_ios();
-T void init(basic_streambuf<charT,traits>* sb);
- private:
-T basic_ios(const basic_ios& ); // not defined
-T basic_ios& operator=(const basic_ios&); // not defined
- };
-
-
- 27.5 Stream buffers [lib.stream.buffers]
-
- Header <streambuf> synopsis
-
-X template <class charT, class traits = char_traits<charT> >
- class basic_streambuf;
-T typedef basic_streambuf<char> streambuf;
-T typedef basic_streambuf<wchar_t> wstreambuf;
-
- 27.5.2 Template class [lib.streambuf]
- basic_streambuf<charT,traits>
-
- template <class charT, class traits = char_traits<charT> >
-X class basic_streambuf {
- public:
-
- // Types:
-T typedef charT char_type;
-T typedef typename traits::int_type int_type;
-T typedef typename traits::pos_type pos_type;
-T typedef typename traits::off_type off_type;
-T typedef traits traits_type;
-T virtual ~basic_streambuf();
- // _lib.streambuf.locales_ locales:
-T locale pubimbue(const locale &loc);
-T locale getloc() const;
- // _lib.streambuf.buffer_ buffer and positioning:
-T basic_streambuf<char_type,traits>*
- pubsetbuf(char_type* s, streamsize n);
-T pos_type pubseekoff(off_type off, ios_base::seekdir way,
- ios_base::openmode which =
- ios_base::in | ios_base::out);
-T pos_type pubseekpos(pos_type sp,
- ios_base::openmode which =
- ios_base::in | ios_base::out);
-T int pubsync();
-
- // Get and put areas:
- // _lib.streambuf.pub.get_ Get area:
-T streamsize in_avail();
-T int_type snextc();
-T int_type sbumpc();
-T int_type sgetc();
-T streamsize sgetn(char_type* s, streamsize n);
- // _lib.streambuf.pub.pback_ Putback:
-X int_type sputbackc(char_type c);
-X int_type sungetc();
- // _lib.streambuf.pub.put_ Put area:
-T int_type sputc(char_type c);
-X streamsize sputn(const char_type* s, streamsize n);
- protected:
-T basic_streambuf();
- // _lib.streambuf.get.area_ Get area:
-T char_type* eback() const;
-T char_type* gptr() const;
-T char_type* egptr() const;
-T void gbump(int n);
-T void setg(char_type* gbeg, char_type* gnext, char_type* gend);
- // _lib.streambuf.put.area_ Put area:
-T char_type* pbase() const;
-T char_type* pptr() const;
-T char_type* epptr() const;
-T void pbump(int n);
-T void setp(char_type* pbeg, char_type* pend);
- // _lib.streambuf.virtuals_ virtual functions:
- // _lib.streambuf.virt.locales_ Locales:
-T virtual void imbue(const locale &loc);
- // _lib.streambuf.virt.buffer_ Buffer management and positioning:
-T virtual basic_streambuf<char_type,traits>*
- setbuf(char_type* s, streamsize n);
-T virtual pos_type seekoff(off_type off, ios_base::seekdir way,
- ios_base::openmode which = ios_base::in | ios_base::out);
-T virtual pos_type seekpos(pos_type sp,
- ios_base::openmode which = ios_base::in | ios_base::out);
-T virtual int sync();
- // _lib.streambuf.virt.get_ Get area:
-T virtual int showmanyc();
-T virtual streamsize xsgetn(char_type* s, streamsize n);
-T virtual int_type underflow();
-T virtual int_type uflow();
- // _lib.streambuf.virt.pback_ Putback:
-T virtual int_type pbackfail(int_type c = traits::eof());
- // _lib.streambuf.virt.put_ Put area:
-X virtual streamsize xsputn(const char_type* s, streamsize n);
-T virtual int_type overflow (int_type c = traits::eof());
- };
-
- 27.6 Formatting and manipulators [lib.iostream.format]
-
- Header <istream> synopsis
-
-T template <class charT, class traits = char_traits<charT> >
- class basic_istream;
-T typedef basic_istream<char> istream;
-T typedef basic_istream<wchar_t> wistream;
-
-T template <class charT, class traits = char_traits<charT> >
- class basic_iostream;
-T typedef basic_iostream<char> iostream;
-T typedef basic_iostream<wchar_t> wiostream;
-
-X template <class charT, class traits>
- basic_istream<charT,traits>& ws(basic_istream<charT,traits>& is);
-
- Header <ostream> synopsis
-
-X template <class charT, class traits = char_traits<charT> >
- class basic_ostream;
-T typedef basic_ostream<char> ostream;
-T typedef basic_ostream<wchar_t> wostream;
-
-T template <class charT, class traits>
- basic_ostream<charT,traits>& endl(basic_ostream<charT,traits>& os);
-T template <class charT, class traits>
- basic_ostream<charT,traits>& ends(basic_ostream<charT,traits>& os);
-T template <class charT, class traits>
- basic_ostream<charT,traits>& flush(basic_ostream<charT,traits>& os);
-
- Header <iomanip> synopsis
-
- // Types T1, T2, ... are unspecified implementation types
-T T1 resetiosflags(ios_base::fmtflags mask);
-T T2 setiosflags (ios_base::fmtflags mask);
-T T3 setbase(int base);
-T template<charT> T4 setfill(charT c);
-T T5 setprecision(int n);
-T T6 setw(int n);
-
-
- 27.6.1.1 Template class basic_istream [lib.istream]
-
- template <class charT, class traits = char_traits<charT> >
-T class basic_istream : virtual public basic_ios<charT,traits> {
- public:
- // Types (inherited from basic_ios (_lib.ios_)):
-T typedef charT char_type;
-T typedef typename traits::int_type int_type;
-T typedef typename traits::pos_type pos_type;
-T typedef typename traits::off_type off_type;
-T typedef traits traits_type;
- // _lib.istream.cons_ Constructor/destructor:
-T explicit basic_istream(basic_streambuf<charT,traits>* sb);
-T virtual ~basic_istream();
- // _lib.istream::sentry_ Prefix/suffix:
-T class sentry;
-
- // _lib.istream.formatted_ Formatted input:
-T basic_istream<charT,traits>& operator>>
- (basic_istream<charT,traits>& (*pf)(basic_istream<charT,traits>&))
-T basic_istream<charT,traits>& operator>>
- (basic_ios<charT,traits>& (*pf)(basic_ios<charT,traits>&))
-T basic_istream<charT,traits>& operator>>
- (ios_base& (*pf)(ios_base&))
-S basic_istream<charT,traits>& operator>>(bool& n);
-S basic_istream<charT,traits>& operator>>(short& n);
-S basic_istream<charT,traits>& operator>>(unsigned short& n);
-S basic_istream<charT,traits>& operator>>(int& n);
-S basic_istream<charT,traits>& operator>>(unsigned int& n);
-S basic_istream<charT,traits>& operator>>(long& n);
-S basic_istream<charT,traits>& operator>>(unsigned long& n);
-S basic_istream<charT,traits>& operator>>(float& f);
-S basic_istream<charT,traits>& operator>>(double& f);
-S basic_istream<charT,traits>& operator>>(long double& f);
-S basic_istream<charT,traits>& operator>>(void*& p);
-S basic_istream<charT,traits>& operator>>
- (basic_streambuf<char_type,traits>* sb);
- // _lib.istream.unformatted_ Unformatted input:
-T streamsize gcount() const;
-S int_type get();
-S basic_istream<charT,traits>& get(char_type& c);
-S basic_istream<charT,traits>& get(char_type* s, streamsize n);
-S basic_istream<charT,traits>& get(char_type* s, streamsize n,
- char_type delim);
-S basic_istream<charT,traits>& get(basic_streambuf<char_type,traits>& sb);
-S basic_istream<charT,traits>& get(basic_streambuf<char_type,traits>& sb,
- char_type delim);
-S basic_istream<charT,traits>& getline(char_type* s, streamsize n);
-S basic_istream<charT,traits>& getline(char_type* s, streamsize n,
- char_type delim);
-S basic_istream<charT,traits>& ignore
- (streamsize n = 1, int_type delim = traits::eof());
-S int_type peek();
-S basic_istream<charT,traits>& read (char_type* s, streamsize n);
-S streamsize readsome(char_type* s, streamsize n);
-S basic_istream<charT,traits>& putback(char_type c);
-S basic_istream<charT,traits>& unget();
-S int sync();
-
-S pos_type tellg();
-S basic_istream<charT,traits>& seekg(pos_type);
-S basic_istream<charT,traits>& seekg(off_type, ios_base::seekdir);
- };
-
- // _lib.istream::extractors_ character extraction templates:
-S template<class charT, class traits>
- basic_istream<charT,traits>& operator>>(basic_istream<charT,traits>&,
- charT&);
-S template<class traits>
- basic_istream<char,traits>& operator>>(basic_istream<char,traits>&,
- unsigned char&);
-S template<class traits>
- basic_istream<char,traits>& operator>>(basic_istream<char,traits>&,
- signed char&);
-
-S template<class charT, class traits>
- basic_istream<charT,traits>& operator>>(basic_istream<charT,traits>&,
- charT*);
-S template<class traits>
- basic_istream<char,traits>& operator>>(basic_istream<char,traits>&,
- unsigned char*);
-S template<class traits>
- basic_istream<char,traits>& operator>>(basic_istream<char,traits>&,
- signed char*);
-
- 27.6.1.1.2 Class basic_istream::sentry [lib.istream::sentry]
-
-
- template <class charT,class traits = char_traits<charT> >
-S class basic_istream<charT,traits>::sentry {
- typedef traits traits_type;
-S bool ok_; // exposition only
- public:
-S explicit sentry(basic_istream<charT,traits>& is, bool noskipws = false);
-S ~sentry();
-S operator bool() const { return ok_; }
- private:
-T sentry(const sentry&); // not defined
-T sentry& operator=(const sentry&); // not defined
- };
-
-
- 27.6.1.5 Template class basic_iostream [lib.iostreamclass]
-
- template <class charT, class traits = char_traits<charT> >
-T class basic_iostream :
- public basic_istream<charT,traits>,
- public basic_ostream<charT,traits> {
- public:
- // constructor/destructor
-T explicit basic_iostream(basic_streambuf<charT,traits>* sb);
-T virtual ~basic_iostream();
- };
-
-
- 27.6.2.1 Template class basic_ostream [lib.ostream]
-
- template <class charT, class traits = char_traits<charT> >
-X class basic_ostream : virtual public basic_ios<charT,traits> {
- public:
- // Types (inherited from basic_ios (_lib.ios_)):
-T typedef charT char_type;
-T typedef typename traits::int_type int_type;
-T typedef typename traits::pos_type pos_type;
-T typedef typename traits::off_type off_type;
-T typedef traits traits_type;
- // _lib.ostream.cons_ Constructor/destructor:
-T explicit basic_ostream(basic_streambuf<char_type,traits>* sb);
-T virtual ~basic_ostream();
- // _lib.ostream::sentry_ Prefix/suffix:
-T class sentry;
- // _lib.ostream.formatted_ Formatted output:
-T basic_ostream<charT,traits>& operator<<
- (basic_ostream<charT,traits>& (*pf)(basic_ostream<charT,traits>&));
-T basic_ostream<charT,traits>& operator<<
- (basic_ios<charT,traits>& (*pf)(basic_ios<charT,traits>&));
-T basic_ostream<charT,traits>& operator<<
- (ios_base& (*pf)(ios_base&));
-T basic_ostream<charT,traits>& operator<<(bool n);
-T basic_ostream<charT,traits>& operator<<(short n);
-T basic_ostream<charT,traits>& operator<<(unsigned short n);
-T basic_ostream<charT,traits>& operator<<(int n);
-T basic_ostream<charT,traits>& operator<<(unsigned int n);
-T basic_ostream<charT,traits>& operator<<(long n);
-T basic_ostream<charT,traits>& operator<<(unsigned long n);
-S basic_ostream<charT,traits>& operator<<(float f);
-S basic_ostream<charT,traits>& operator<<(double f);
-S basic_ostream<charT,traits>& operator<<(long double f);
-T basic_ostream<charT,traits>& operator<<(const void* p);
-X basic_ostream<charT,traits>& operator<<
- (basic_streambuf<char_type,traits>* sb);
- // _lib.ostream.unformatted_ Unformatted output:
-T basic_ostream<charT,traits>& put(char_type c);
-T basic_ostream<charT,traits>& write(const char_type* s, streamsize n);
-X basic_ostream<charT,traits>& flush();
-
- // _lib.ostream.seeks_ seeks:
-S pos_type tellp();
-S basic_ostream<charT,traits>& seekp(pos_type);
-S basic_ostream<charT,traits>& seekp(off_type, ios_base::seekdir);
- };
- // _lib.ostream.inserters.character_ character inserters
-X template<class charT, class traits>
- basic_ostream<charT,traits>& operator<<(basic_ostream<charT,traits>&,
- charT);
-X template<class charT, class traits>
- basic_ostream<charT,traits>& operator<<(basic_ostream<charT,traits>&,
- char);
- // specialization
-X template<class traits>
- basic_ostream<char,traits>& operator<<(basic_ostream<char,traits>&,
- char);
- // signed and unsigned
-X template<class traits>
- basic_ostream<char,traits>& operator<<(basic_ostream<char,traits>&,
- signed char);
-X template<class traits>
- basic_ostream<char,traits>& operator<<(basic_ostream<char,traits>&,
- unsigned char)
-X template<class charT, class traits>
- basic_ostream<charT,traits>& operator<<(basic_ostream<charT,traits>&,
- const charT*);
-X template<class charT, class traits>
- basic_ostream<charT,traits>& operator<<(basic_ostream<charT,traits>&,
- const char*);
- // partial specializationss
-X template<class traits>
- basic_ostream<char,traits>& operator<<(basic_ostream<char,traits>&,
- const char*);
- // signed and unsigned
-X template<class traits>
- basic_ostream<char,traits>& operator<<(basic_ostream<char,traits>&,
- const signed char*);
-X template<class traits>
- basic_ostream<char,traits>& operator<<(basic_ostream<char,traits>&,
- const unsigned char*);
-
-
- 27.6.2.3 Class basic_ostream::sentry [lib.ostream::sentry]
-
- template <class charT,class traits = char_traits<charT> >
-X class basic_ostream<charT,traits>::sentry {
- bool ok_; // exposition only
- public:
-X explicit sentry(basic_ostream<charT,traits>& os);
-X ~sentry();
-X operator bool() const { return ok_; }
- private
-X sentry(const sentry&); // not defined
-X sentry& operator=(const sentry&); // not defined
- };
-
- 27.7 String-based streams [lib.string.streams]
-
- Header <sstream> synopsis
-
-X template <class charT, class traits = char_traits<charT>,
- class Allocator = allocator<charT> >
- class basic_stringbuf;
-
-T typedef basic_stringbuf<char> stringbuf;
-T typedef basic_stringbuf<wchar_t> wstringbuf;
-
- template <class charT, class traits = char_traits<charT>,
- class Allocator = allocator<charT> >
-X class basic_istringstream;
-
-T typedef basic_istringstream<char> istringstream;
-T typedef basic_istringstream<wchar_t> wistringstream;
-
- template <class charT, class traits = char_traits<charT>,
- class Allocator = allocator<charT> >
-X class basic_ostringstream;
-T typedef basic_ostringstream<char> ostringstream;
-T typedef basic_ostringstream<wchar_t> wostringstream;
-
- template <class charT, class traits = char_traits<charT>,
- class Allocator = allocator<charT> >
-X class basic_stringstream;
-T typedef basic_stringstream<char> stringstream;
-T typedef basic_stringstream<wchar_t> wstringstream;
-
- 27.7.1 Template class basic_stringbuf [lib.stringbuf]
-
- template <class charT, class traits = char_traits<charT>,
- class Allocator = allocator<charT> >
-X class basic_stringbuf : public basic_streambuf<charT,traits> {
- public:
-T typedef charT char_type;
-T typedef typename traits::int_type int_type;
-T typedef typename traits::pos_type pos_type;
-T typedef typename traits::off_type off_type;
-T typedef traits traits_type;
- // _lib.stringbuf.cons_ Constructors:
-S explicit basic_stringbuf(ios_base::openmode which
- = ios_base::in | ios_base::out);
-S explicit basic_stringbuf
- (const basic_string<charT,traits,Allocator>& str,
- ios_base::openmode which = ios_base::in | ios_base::out);
- // _lib.stringbuf.members_ Get and set:
-S basic_string<charT,traits,Allocator> str() const;
-S void str(const basic_string<charT,traits,Allocator>& s);
-
- protected:
- // _lib.stringbuf.virtuals_ Overridden virtual functions:
-S virtual int_type underflow();
-S virtual int_type pbackfail(int_type c = traits::eof());
-S virtual int_type overflow (int_type c = traits::eof());
-S virtual basic_streambuf<charT,traits>* setbuf(charT*, streamsize);
-
-S virtual pos_type seekoff(off_type off, ios_base::seekdir way,
- ios_base::openmode which
- = ios_base::in | ios_base::out);
-S virtual pos_type seekpos(pos_type sp,
- ios_base::openmode which
- = ios_base::in | ios_base::out);
- };
-
-
- 27.7.2 Template class basic_istringstream [lib.istringstream]
-
- template <class charT, class traits = char_traits<charT>,
- class Allocator = allocator<charT> >
-X class basic_istringstream : public basic_istream<charT,traits> {
- public:
-T typedef charT char_type;
-T typedef typename traits::int_type int_type;
-T typedef typename traits::pos_type pos_type;
-T typedef typename traits::off_type off_type;
-T typedef traits traits_type;
- // _lib.istringstream.cons_ Constructors:
-S explicit basic_istringstream(ios_base::openmode which = ios_base::in);
-S explicit basic_istringstream(
- const basic_string<charT,traits,Allocator>& str,
- ios_base::openmode which = ios_base::in);
-
- // _lib.istringstream.members_ Members:
-S basic_stringbuf<charT,traits,Allocator>* rdbuf() const;
-S basic_string<charT,traits,Allocator> str() const;
-S void str(const basic_string<charT,traits,Allocator>& s);
- private:
- // basic_stringbuf<charT,traits,Allocator> sb; exposition only
- };
-
- 27.7.3 Class basic_ostringstream [lib.ostringstream]
-
- template <class charT, class traits = char_traits<charT>,
- class Allocator = allocator<charT> >
-X class basic_ostringstream : public basic_ostream<charT,traits> {
- public:
-
- // Types:
-T typedef charT char_type;
-T typedef typename traits::int_type int_type;
-T typedef typename traits::pos_type pos_type;
-T typedef typename traits::off_type off_type;
- // _lib.ostringstream.cons_ Constructors/destructor:
-S explicit basic_ostringstream(ios_base::openmode which = ios_base::out);
-S explicit basic_ostringstream(
- const basic_string<charT,traits,Allocator>& str,
- ios_base::openmode which = ios_base::out);
- // _lib.ostringstream.members_ Members:
-S basic_stringbuf<charT,traits,Allocator>* rdbuf() const;
-S basic_string<charT,traits,Allocator> str() const;
-S void str(const basic_string<charT,traits,Allocator>& s);
- };
-
-
- 27.7.4 Template class basic_stringstream [lib.stringstream]
-
- template <class charT, class traits = char_traits<charT>,
- class Allocator = allocator<charT> >
-X class basic_stringstream
- : public basic_iostream<charT,traits> {
- public:
- // Types
-T typedef charT char_type;
-T typedef typename traits::int_type int_type;
-T typedef typename traits::pos_type pos_type;
-T typedef typename traits::off_type off_type;
- // constructors/destructors
-S explicit basic_stringstream(
- ios_base::openmode which = ios_base::out|ios_base::in);
-S explicit basic_stringstream(
- const basic_string<charT,traits,Allocator>& str,
- ios_base::openmode which = ios_base::out|ios_base::in);
- // Members:
-S basic_stringbuf<charT,traits,Allocator>* rdbuf() const;
-S basic_string<charT,traits,Allocator> str() const;
-S void str(const basic_string<charT,traits,Allocator>& str);
- };
-
-
-
- 27.8.1 File streams [lib.fstreams]
-
-
- Header <fstream> synopsis
-
-X template <class charT, class traits = char_traits<charT> >
- class basic_filebuf;
-T typedef basic_filebuf<char> filebuf;
-T typedef basic_filebuf<wchar_t> wfilebuf;
-
-X template <class charT, class traits = char_traits<charT> >
- class basic_ifstream;
-T typedef basic_ifstream<char> ifstream;
-T typedef basic_ifstream<wchar_t> wifstream;
-
-X template <class charT, class traits = char_traits<charT> >
- class basic_ofstream;
-T typedef basic_ofstream<char> ofstream;
-T typedef basic_ofstream<wchar_t> wofstream;
-
-X template <class charT, class traits = char_traits<charT> >
- class basic_fstream;
-T typedef basic_fstream<char> fstream;
-T typedef basic_fstream<wchar_t> wfstream;
-
- 27.8.1.1 Template class basic_filebuf [lib.filebuf]
-
- template <class charT, class traits = char_traits<charT> >
-X class basic_filebuf : public basic_streambuf<charT,traits> {
- public:
-T typedef charT char_type;
-T typedef typename traits::int_type int_type;
-T typedef typename traits::pos_type pos_type;
-T typedef typename traits::off_type off_type;
-T typedef traits traits_type;
- // _lib.filebuf.cons_ Constructors/destructor:
-X basic_filebuf();
-X virtual ~basic_filebuf();
- // _lib.filebuf.members_ Members:
-T bool is_open() const;
-X basic_filebuf<charT,traits>* open
- (const char* s, ios_base::openmode mode);
-X basic_filebuf<charT,traits>* close();
- protected:
- // _lib.filebuf.virtuals_ Overridden virtual functions:
-X virtual streamsize showmanyc();
-X virtual int_type underflow();
-X virtual int_type uflow();
-X virtual int_type pbackfail(int_type c = traits::eof());
-X virtual int_type overflow (int_type c = traits::eof());
-S virtual basic_streambuf<charT,traits>*
- setbuf(char_type* s, streamsize n);
-S virtual pos_type seekoff(off_type off, ios_base::seekdir way,
- ios_base::openmode which
- = ios_base::in | ios_base::out);
-S virtual pos_type seekpos(pos_type sp, ios_base::openmode which
- = ios_base::in | ios_base::out);
-S virtual int sync();
-S virtual void imbue(const locale& loc);
- };
-
-
-
- 27.8.1.5 Template class basic_ifstream [lib.ifstream]
-
- template <class charT, class traits = char_traits<charT> >
-X class basic_ifstream : public basic_istream<charT,traits> {
- public:
-T typedef charT char_type;
-T typedef typename traits::int_type int_type;
-T typedef typename traits::pos_type pos_type;
-T typedef typename traits::off_type off_type;
-T typedef traits traits_type;
- // _lib.ifstream.cons_ Constructors:
-S basic_ifstream();
-S explicit basic_ifstream(const char* s,
- ios_base::openmode mode = ios_base::in);
- // _lib.ifstream.members_ Members:
-S basic_filebuf<charT,traits>* rdbuf() const;
-S bool is_open();
-S void open(const char* s, ios_base::openmode mode = ios_base::in);
-S void close();
- };
-
-
- 27.8.1.8 Template class basic_ofstream [lib.ofstream]
-
- template <class charT, class traits = char_traits<charT> >
-X class basic_ofstream : public basic_ostream<charT,traits> {
- public:
-T typedef charT char_type;
-T typedef typename traits::int_type int_type;
-T typedef typename traits::pos_type pos_type;
-T typedef typename traits::off_type off_type;
-T typedef traits traits_type;
- // _lib.ofstream.cons_ Constructors:
-X basic_ofstream();
-X explicit basic_ofstream(const char* s,
- ios_base::openmode mode
- = ios_base::out);
- // _lib.ofstream.members_ Members:
-X basic_filebuf<charT,traits>* rdbuf() const;
-T bool is_open();
-X void open(const char* s, ios_base::openmode mode = ios_base::out);
-X void close();
- };
-
-
- 27.8.1.11 Template class basic_fstream [lib.fstream]
-
- template <class charT, class traits=char_traits<charT> >
-X class basic_fstream
- : public basic_iostream<charT,traits> {
- public:
-T typedef charT char_type;
-T typedef typename traits::int_type int_type;
-T typedef typename traits::pos_type pos_type;
-T typedef typename traits::off_type off_type;
-T typedef traits traits_type;
- // constructors/destructor
-S basic_fstream();
-S explicit basic_fstream(
- const char* s,
- ios_base::openmode mode = ios_base::in|ios_base::out);
-
- // Members:
-S basic_filebuf<charT,traits>* rdbuf() const;
-S bool is_open();
-S void open(
- const char* s,
- ios_base::openmode mode = ios_base::in|ios_base::out);
-S void close();
- };
-
-
-
- 27.8.2 C Library files [lib.c.files]
-
-
- Table 13--Header <cstdio> synopsis
- Macros:
-X BUFSIZ L_tmpnam SEEK_SET TMP_MAX
-X EOF NULL <cstdio> stderr _IOFBF
-X FILENAME_MAX SEEK_CUR stdin _IOLBF
-X FOPEN_MAX SEEK_END stdout _IONBF
-
-X Types: FILE fpos_t size_t <cstdio>
- Functions:
-X clearerr fgets fscanf gets rewind
-X fclose fopen fseek perror scanf tmpnam
-X feof fprintf fsetpos printf setbuf ungetc
-X ferror fputc ftell putc setvbuf vprintf
-X fflush fputs fwrite puts sprintf vfprintf
-X fgetc fread getc remove sscanf vsprintf
-X fgetpos freopen getchar putchar rename tmpfile
-
-
-
-
- 1.5 Standard C library headers [depr.c.headers]
-
-X <assert.h> <iso646.h> <setjmp.h> <stdio.h> <wchar.h>
- <ctype.h> <limits.h> <signal.h> <stdlib.h> <wctype.h>
- <errno.h> <locale.h> <stdarg.h> <string.h>
- <float.h> <math.h> <stddef.h> <time.h>
-
- 1.6 Old iostreams members [depr.ios.members]
-
- [Note: these should be #ifdef'd to permit diagnostics if used.]
- namespace std {
- class ios_base {
- public:
-T typedef T1 io_state;
-T typedef T2 open_mode;
-T typedef T3 seek_dir;
-T typedef OFF_T streamoff;
-T typedef OFF_T streampos;
- // remainder unchanged
- };
- }
-
- [Note: these should be #ifdef'd to permit diagnostics if used.]
- namespace std {
- template<class charT, class traits = char_traits<charT> >
- class basic_streambuf {
- public:
-T void stossc();
- // remainder unchanged
- };
- }
-
- 8 An implementation may provide the following member functions that
- overload signatures specified in clause _lib.iostreams_:
-
- [Note: the following overloads should be #ifdef'd to permit
- diagnostics to be emitted, by default, if used.]
-
- template<class charT, class Traits> class basic_ios {
- public:
-M void clear(io_state state);
-M void setstate(io_state state);
- // remainder unchanged
- };
- class ios_base {
- public:
-M void exceptions(io_state);
- // remainder unchanged
- };
- template<class charT, class traits = char_traits<charT> >
- class basic_streambuf {
- public:
-M pos_type pubseekoff(off_type off, ios_base::seek_dir way,
- ios_base::open_mode which = ios_base::in | ios_base::out);
-M pos_type pubseekpos(pos_type sp,
- ios_base::open_mode which = ios_base::in | ios_base::out);
- // remainder unchanged
- };
- template <class charT, class traits = char_traits<charT> >
- class basic_filebuf : public basic_streambuf<charT,traits> {
- public:
-M basic_filebuf<charT,traits>* open
- (const char* s, ios_base::open_mode mode);
- // remainder unchanged
- };
- template <class charT, class traits = char_traits<charT> >
- class basic_ifstream : public basic_istream<charT,traits> {
- public:
-M void open(const char* s, ios_base::open_mode mode = in);
- // remainder unchanged
- };
- template <class charT, class traits = char_traits<charT> >
- class basic_ofstream : public basic_ostream<charT,traits> {
- public:
-M void open(const char* s, ios_base::open_mode mode = out | trunc);
- // remainder unchanged
- };
- }
-
-
-
- 1.7.1 Class strstreambuf [depr.strstreambuf]
-
- [Note: It should be possible to adopt these components with only
- minor changes from the 2.8 version of the library.]
-
-M class strstreambuf : public basic_streambuf<char> {
- public:
-M explicit strstreambuf(streamsize alsize_arg = 0);
-M strstreambuf(void* (*palloc_arg)(size_t), void (*pfree_arg)(void*));
-M strstreambuf(char* gnext_arg, streamsize n, char* pbeg_arg = 0);
-M strstreambuf(const char* gnext_arg, streamsize n);
-M strstreambuf(signed char* gnext_arg, streamsize n,
- signed char* pbeg_arg = 0);
-M strstreambuf(const signed char* gnext_arg, streamsize n);
-M strstreambuf(unsigned char* gnext_arg, streamsize n,
- unsigned char* pbeg_arg = 0);
-M strstreambuf(const unsigned char* gnext_arg, streamsize n);
-M virtual ~strstreambuf();
-M void freeze(bool freezefl = true);
-M char* str();
-M int pcount();
- protected:
-M virtual int_type overflow (int_type c = EOF);
-M virtual int_type pbackfail(int_type c = EOF);
-M virtual int_type underflow();
-M virtual pos_type seekoff(off_type off, ios_base::seekdir way,
- ios_base::openmode which
- = ios_base::in | ios_base::out);
-M virtual pos_type seekpos(pos_type sp, ios_base::openmode which
- = ios_base::in | ios_base::out);
-M virtual streambuf<char>* setbuf(char* s, streamsize n);
- }
-
- 1.7.4 Class strstream [depr.strstream]
-
-M class strstream
- : public basic_iostream<char> {
- public:
- // Types
-M typedef char char_type;
-M typedef typename char_traits<char>::int_type int_type
-M typedef typename char_traits<char>::pos_type pos_type;
-M typedef typename char_traits<char>::off_type off_type;
- // consturctors/destructor
-M strstream();
-M strstream(char* s, int n,
- ios_base::openmode mode = ios_base::in|ios_base::out);
-M virtual ~strstream();
- // Members:
-M strstreambuf* rdbuf() const;
-M void freeze(bool freezefl = true);
-M int pcount() const;
-M char* str();
- };
-
+++ /dev/null
-
-Header Policy
--------------
-
-The C++ Standard specifies many mutual dependencies among the
-headers it defines. It offers no advice on how to arrange headers
-to avoid problems. The worst such problem is circular references.
-Most simply this is "A includes B, B includes A":
-
- // file <A> // file <B>
- #ifndef A #ifndef B
- #define A 1 #define B 1
- #include <B> #include <A>
- typedef int A_type; typedef int B_type;
- extern B_type g(A_type); extern A_type f(B_type);
- #endif /* A */ #endif /* B */
-
- // file C.cc
- #include <A>
-
-The typical effect of such an "include loop" may be seen by tracing
-the preprocessor activity:
-
- C // file C.cc
- C #include <A>
- A // file <A>
- A #ifndef A
- A #define A 1
- A #include <B>
- B // file <B>
- B #ifndef B
- B #define B 1
- B #include <A>
- A // file <A>
- A #ifndef A <-- oops, cpp symbol A defined already
- A ... <-- skip <A> contents
- A #endif
- B typedef int B_type;
- B extern A_type f(B_type); <-- error, A_type not defined yet.
- B #endif /* B */
- A typedef int A_type;
- A extern B_type g(A_type);
- A #endif /* A */
-
-The main symptom of #include loops is that definitions from file <A>
-are not available after the #include <A> for certain include orders.
-The number of standard headers makes testing all permutations of
-include order impractical, so a policy is needed to prevent chaos.
-In any case, for some standard headers (as for the above) no ordering
-can eliminate the loop.
-
-Other factors influence the policy. Typical implementations of
-Make (unfortunately including GNU make) have bugs relating to file
-names with no suffix, that lead to such problems as failure to track
-dependencies on such files and an inclination to _delete_ them.
-Therefore, headers used in building the library are always of the
-form <bits/yyy.h> generally, or specifically <bits/std_xxx.h> for
-an equivalent to the standard header <xxx>.
-
-Standard headers <xxx> are all placed under directory std/, and
-are ignored except during installation. These headers simply
-#include the corresponding header <bits/std_xxx.h>.
-
-Standard substitute headers <bits/std_xxx.h> that have any complexity
-may sub-include other headers. When they sub-include non-standard
-headers, they first include all the headers required for that
-non-standard header.
-
-Mutual dependencies are handled by splitting up the declarations
-intended for standard headers among two or more files, and then
-interleaving them as needed. For example, we replace <A> and <B>
-above, as follows:
-
- // file <bits/std_A.h>
- #ifndef _CPP_A
- #define _CPP_A
- # include <bits/A_types.h>
- # include <bits/B_types.h>
- # include <bits/A_funs.h>
- #endif
-
- // file <bits/std_B.h>
- #ifndef _CPP_B
- #define _CPP_B
- # include <bits/A_types.h>
- # include <bits/B_types.h>
- # include <bits/B_funs.h>
- #endif
-
- // file <bits/A_types.h>
- #ifndef _CPP_BITS_A_TYPES_H
- #define _CPP_BITS_A_TYPES_H
- typedef int A_type;
- #endif
-
- // file <bits/B_types.h>
- #ifndef _CPP_BITS_B_TYPES_H
- #define _CPP_BITS_B_TYPES_H
- typedef int B_type;
- #endif
-
- // file <bits/A_funs.h>
- #ifndef _CPP_BITS_A_FUNS_H
- #define _CPP_BITS_A_FUNS_H
- extern B_type g(A_type);
- #endif
-
- // file <bits/B_funs.h>
- #ifndef _CPP_BITS_B_FUNS_H
- #define _CPP_BITS_B_FUNS_H
- extern A_type f(B_type);
- #endif
-
-Of course we have the standard headers under their mandated names:
-
- // file <std/A>
- #ifndef _CPP_A
- #define _CPP_A
- # include <bits/std_A.h>
- #endif
-
- // file <std/B>
- #ifndef _CPP_B
- #define _CPP_B
- # include <bits/std_B.h>
- #endif
-
-Notice that the include guards are named uniformly except that
-the guard for standard header <bits/std_A.h> is just _CPP_A,
-identically as the header <A> in std/.
-
-At installation the files std/* can be replaced by symbolic links,
-or simply copied into place as is. The result is:
-
- include/
- include/A -> bits/std_A.h
- include/B -> bits/std_A.h
- include/bits/
- include/bits/std_A.h
- include/bits/std_B.h
- include/bits/A_types.h
- include/bits/B_types.h
- include/bits/A_funs.h
- include/bits/B_funs.h
-
-
-Of course splitting up standard headers this way creates
-complexity, so it is not done routinely, but only in response
-to discovered needs.
-
-Another reason to split up headers is for support of separate
-compilation of templates. This interacts with the foregoing
-because template definitions typically have many more dependencies
-on other headers than do pure declarations. Non-inline template
-definitions are placed in a separate ".tcc" file that is included
-by the standard header, and any other standard header that
-requires definitions from it for its implementation.
-
-The key to preventing chaos, given the above structure, is:
-
- Only standard headers <bits/std_xxxx.h> should sub-include
- other headers.
-
-
+++ /dev/null
-Irix 6.2:
-- math.h: defines extern long double hypotl( long double ); i.e., only
- one argument. They've fixed this in 6.3.
-
-DES OSF 3.2 & 4.0:
-- libm define sincos, sincosf, and sincosl but there are no prototypes and
- especially the return type is nowhere defined. The functions are
- documented in the man pages, though.
+++ /dev/null
-2002-05-02
-
-Release Notes
--------------
-The Standard C++ Library, or libstdc++-v3, is an ongoing project
-to fully implement the ISO 14882 Standard C++ library as described in
-chapters 17 through 27 and annex D.
-
-This is the fifteenth snapshot of the libstdc++ rewrite. It still
-has some incomplet and incorrekt parts, but it's a lot less incomplete
-and incorrect than some of the earlier snapshots, and quite usable.
-
-The Standard C++ Library, follows an open development model,
-attempting to be fully buzzword, bazaar, and GNU compliant. Full
-details on participating, including contributor guidelines, mailing
-list subscription, mailing list archives, up-to-date documentation,
-and various and sundry other details can be found at the following
-URL:
-
- http://gcc.gnu.org/libstdc++/
-
-
-New:
----
-- more doxygen documentation
-- more named locale fixups
-- stdio_filebuf that takes fd, FILE
-- io performance tuning
-- allocation tuning, valgrind fixups
-- __cxa_demangle now supported
-
-
-Bugs fixed:
------------
-6533, 6513, 6501, 6511, 5820, 6414, 4150, 6360, 4164, 1072, 6124,
-5180, 3457, 3139, 5268, 3983, 5542, 3129, 5207, 3719, 5734
-+ others.
-
-
-What doesn't:
--------------
-- see BUGS.
-
-
-Build and Install
------------------
-Up to date build and install directions can be found at:
-http://gcc.gnu.org/libstdc++/install.html
-
-
-Contact:
---------
-Places have changed from previous snapshots. The web page, which has
-information about joining the mailing list and searching its archives,
-CVS access, and contribution information is now at:
-
- http://gcc.gnu.org/libstdc++/
-
-Please note that the mailing list has moved, and is now hosted on
-gcc.gnu.org. (The web site above has the most up-to-date info.)
-
-Obtain the library snapshot via ftp (including these release notes) from
-
- ftp://gcc.gnu.org/pub/libstdc++/
-
-The library is maintained by Benjamin Kosnik, Gabriel
-Dos Reis, Phil Edwards, Ulrich Drepper, Loren James Rittle,
-and Paolo Carlini.
-
-
-Development tools:
-------------------
-
-You will need a current version of gcc to compile this snapshot of
-libstdc++. The use of the latest stable gcc-3.0.x release (3.0.4), CVS
-gcc, or gcc-3_1-branch is strongly recommended, which may also
-introduce additional dependencies for up-to-date binutils. In
-particular, current binutils (2.12) is recommended so that symbol
-versioning for the library is on by default. In addition, you may need
-up-to-date tools for modifying Makefiles and regenerating configure
-scripts: automake (version 1.4), autoconf (version 2.13 and higher),
-and libtool.
-
--- /dev/null
+<?xml version="1.0" encoding="ISO-8859-1"?>
+<!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" xml:lang="en" lang="en">
+<head>
+ <meta name="AUTHOR" content="bkoz@gcc.gnu.org (Benjamin Kosnik)" />
+ <meta name="KEYWORDS" content="C++, libstdc++, dynamic, shared, library, ABI, version" />
+ <meta name="DESCRIPTION" content="C++ Standard Library ABI" />
+ <meta name="GENERATOR" content="emacs and ten fingers" />
+ <title>Standard C++ Library ABI</title>
+<link rel="StyleSheet" href="lib3styles.css" type="text/css" />
+<link rel="Start" href="documentation.html" type="text/html"
+ title="GNU C++ Standard Library" />
+<link rel="Copyright" href="17_intro/license.html" type="text/html" />
+</head>
+<body>
+
+<h1 class="centered"><a name="top">C++ Standard Library ABI</a></h1>
+
+<p class="fineprint"><em>
+ The latest version of this document is always available at
+ <a href="http://gcc.gnu.org/onlinedocs/libstdc++/abi.html">
+ http://gcc.gnu.org/onlinedocs/libstdc++/abi.html</a>.
+</em></p>
+
+<p><em>
+ To the <a href="http://gcc.gnu.org/libstdc++/">libstdc++ homepage</a>.
+</em></p>
+
+<!-- ####################################################### -->
+<hr />
+<h3 class="left">
+ <a name="CXXinterface">The C++ interface</a>
+</h3>
+
+<p> C++ applications often dependent on specific language support
+routines, say for throwing exceptions, or catching exceptions, and
+perhaps also dependent on features in the C++ Standard Library.
+</p>
+
+<p> The C++ Standard Library has many include files, types defined in
+those include files, specific named functions, and other behavior. The
+text of these behaviors, as written in source include files, is called
+the Application Programing Interface, or API.
+</p>
+
+<p> Furthermore, C++ source that is compiled into object files is
+ transformed by the compiler: it arranges objects with specific
+ alignment and in a particular layout, mangling names according to a
+ well-defined algorithm, has specific arrangements for the support of
+ virtual functions, etc. These details are defined as the compiler
+ Application Binary Interface, or ABI. The GNU C++ compiler uses an
+ industry-standard C++ ABI starting with version 3. Details can be
+ found in the <a href="http://www.codesourcery.com/cxx-abi/abi.html">
+ ABI specification</a>.
+</p>
+
+<p>
+ The GNU C++ compiler, g++, has a compiler command line option to
+ switch between various different C++ ABIs. This explicit version
+ switch is the flag <code> -fabi-version</code>. In addition, some
+ g++ command line options may change the ABI as a side-effect of
+ use. Such flags include <code>-fpack-struct</code> and
+ <code>-fno-exceptions</code>, but include others: see the complete
+ list in the GCC manual under the heading <a
+ href="http://gcc.gnu.org/onlinedocs/gcc/Code-Gen-Options.html#Code%20Gen%20Options">Options
+ for Code Generation Conventions</a>.
+</p>
+
+<p> The configure options used when building a specific libstdc++
+version may also impact the resulting library ABI. The available
+configure options, and their impact on the library ABI, are documented
+<a href="http://gcc.gnu.org/onlinedocs/libstdc++/configopts.html">
+here</a>.
+</p>
+
+<p> Putting all of these ideas together results in the C++ Standard
+library ABI, which is the compilation of a given library API by a
+given compiler ABI. In a nutshell:
+</p>
+
+<code> library API + compiler ABI = library ABI</code>
+
+<p>
+ The library ABI is mostly of interest for end-users who have
+ unresolved symbols and are linking dynamically to the C++ Standard
+ library, and who thus must be careful to compile their application
+ with a compiler that is compatible with the available C++ Standard
+ library binary. In this case, compatible is defined with the equation
+ above: given an application compiled with a given compiler ABI and
+ library API, it will work correctly with a Standard C++ Library
+ 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>
+
+<h3 class="left">
+ <a name="ABI_versioning">Versioning</a>
+</h3>
+
+<p> The C++ interface has evolved throughout the history of the GNU
+C++ toolchain. With each release, various details have been changed so
+as to give distinct versions to the C++ interface.
+</p>
+
+<h5 class="left">
+ <a name="goals">Goals of versioning</a>
+</h5>
+
+<p>Extending existing, stable ABIs. Versioning gives subsequent stable
+releases series libraries the ability to add new symbols and add
+functionality, all the while retaining backwards compatibility with
+the previous releases in the series. Note: the reverse is not true. It
+is not possible to take binaries linked with the latest version of a
+release series (if symbols have been added) and expect the initial
+release of the series to remain link compatible.
+</p>
+
+<p>Allows multiple, incompatible ABIs to coexist at the same time.
+</p>
+
+<p>
+</p>
+
+<h5 class="left">
+ <a name="details"> Version History </a>
+</h5>
+<p>
+ How can this complexity be managed? What does C++ versioning mean?
+ Because library and compiler changes often make binaries compiled
+ with one version of the GNU tools incompatible with binaries
+ compiled with other (either newer or older) versions of the same GNU
+ tools, specific techniques are used to make managing this complexity
+ easier.
+</p>
+
+<p>
+ The following techniques are used:
+</p>
+
+ <ul>
+
+ <li> <p>Release versioning on the libgcc_s.so binary. This is
+implemented via file names and the ELF DT_SONAME mechanism (at least
+on ELF systems).</p>
+
+ <p>It is versioned as follows:
+ </p>
+ <ul>
+ <li>gcc-3.0.0: libgcc_s.so.1</li>
+ <li>gcc-3.0.1: libgcc_s.so.1</li>
+ <li>gcc-3.0.2: libgcc_s.so.1</li>
+ <li>gcc-3.0.3: libgcc_s.so.1</li>
+ <li>gcc-3.0.4: libgcc_s.so.1</li>
+ <li>gcc-3.1.0: libgcc_s.so.1</li>
+ <li>gcc-3.1.1: libgcc_s.so.1</li>
+ <li>gcc-3.2.0: libgcc_s.so.1</li>
+ <li>gcc-3.2.1: libgcc_s.so.1</li>
+ <li>gcc-3.2.2: libgcc_s.so.1</li>
+ <li>gcc-3.2.3: libgcc_s.so.1</li>
+ <li>gcc-3.3.0: libgcc_s.so.1</li>
+ <li>gcc-3.3.1: libgcc_s.so.1</li>
+ <li>gcc-3.3.2: libgcc_s.so.1</li>
+ <li>gcc-3.3.3: libgcc_s.so.1</li>
+ <li>gcc-3.4.x, gcc-4.0.x, gcc-4.1.x, gcc-4.2.x: on m68k-linux and
+ hppa-linux this is either libgcc_s.so.1 (when configuring
+ <code>--with-sjlj-exceptions</code>) or libgcc_s.so.2. For all
+ others, this is libgcc_s.so.1. </li> </ul>
+ <p></p>
+ </li>
+
+ <li>Symbol versioning on the libgcc_s.so binary.
+ <p>mapfile: gcc/libgcc-std.ver</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>
+ <ul>
+ <li>gcc-3.0.0: GCC_3.0</li>
+ <li>gcc-3.3.0: GCC_3.3</li>
+ <li>gcc-3.3.1: GCC_3.3.1</li>
+ <li>gcc-3.3.2: GCC_3.3.2</li>
+ <li>gcc-3.3.4: GCC_3.3.4</li>
+ <li>gcc-3.4.0: GCC_3.4</li>
+ <li>gcc-3.4.2: GCC_3.4.2</li>
+ <li>gcc-3.4.4: GCC_3.4.4</li>
+ <li>gcc-4.0.0: GCC_4.0.0</li>
+ <li>gcc-4.1.0: GCC_4.1.0</li>
+ <li>gcc-4.2.0: GCC_4.2.0</li>
+ </ul>
+ <p></p>
+ </li>
+
+ <li>Release versioning on the libstdc++.so binary, implemented in the same was as the libgcc_s.so binary, above.
+
+ <p>It is versioned as follows:
+ </p>
+ <ul>
+ <li>gcc-3.0.0: libstdc++.so.3.0.0</li>
+ <li>gcc-3.0.1: libstdc++.so.3.0.1</li>
+ <li>gcc-3.0.2: libstdc++.so.3.0.2</li>
+ <li>gcc-3.0.3: libstdc++.so.3.0.2 (Error should be libstdc++.so.3.0.3)</li>
+ <li>gcc-3.0.4: libstdc++.so.3.0.4</li>
+ <li>gcc-3.1.0: libstdc++.so.4.0.0</li>
+ <li>gcc-3.1.1: libstdc++.so.4.0.1</li>
+ <li>gcc-3.2.0: libstdc++.so.5.0.0</li>
+ <li>gcc-3.2.1: libstdc++.so.5.0.1</li>
+ <li>gcc-3.2.2: libstdc++.so.5.0.2</li>
+ <li>gcc-3.2.3: libstdc++.so.5.0.3 (Not strictly required)</li>
+ <li>gcc-3.3.0: libstdc++.so.5.0.4</li>
+ <li>gcc-3.3.1: libstdc++.so.5.0.5</li>
+ <li>gcc-3.3.2: libstdc++.so.5.0.5</li>
+ <li>gcc-3.3.3: libstdc++.so.5.0.5</li>
+ <li>gcc-3.4.0: libstdc++.so.6.0.0</li>
+ <li>gcc-3.4.1: libstdc++.so.6.0.1</li>
+ <li>gcc-3.4.2: libstdc++.so.6.0.2</li>
+ <li>gcc-3.4.3: libstdc++.so.6.0.3</li>
+ <li>gcc-3.4.4: libstdc++.so.6.0.3</li>
+ <li>gcc-3.4.5: libstdc++.so.6.0.3</li>
+ <li>gcc-3.4.6: libstdc++.so.6.0.3</li>
+ <li>gcc-4.0.0: libstdc++.so.6.0.4</li>
+ <li>gcc-4.0.1: libstdc++.so.6.0.5</li>
+ <li>gcc-4.0.2: libstdc++.so.6.0.6</li>
+ <li>gcc-4.0.3: libstdc++.so.6.0.7</li>
+ <li>gcc-4.1.0: libstdc++.so.6.0.7</li>
+ <li>gcc-4.1.1: libstdc++.so.6.0.8</li>
+ <li>gcc-4.1.2: libstdc++.so.6.0.8</li>
+ <li>gcc-4.2.0: libstdc++.so.6.0.9</li>
+ </ul>
+ <p></p>
+ </li>
+
+ <li>Symbol versioning on the libstdc++.so binary.
+
+ <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
+ particular release. Note, only symbol which are newly introduced
+ will use the maximum version definition. Thus, for release series
+ with the same label, but incremented version definitions, the later
+ release has both versions. (An example of this would be the
+ 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>
+ <ul>
+ <li>gcc-3.0.0: (Error, not versioned)</li>
+ <li>gcc-3.0.1: (Error, not versioned)</li>
+ <li>gcc-3.0.2: (Error, not versioned)</li>
+ <li>gcc-3.0.3: (Error, not versioned)</li>
+ <li>gcc-3.0.4: (Error, not versioned)</li>
+ <li>gcc-3.1.0: GLIBCPP_3.1, CXXABI_1</li>
+ <li>gcc-3.1.1: GLIBCPP_3.1, CXXABI_1</li>
+ <li>gcc-3.2.0: GLIBCPP_3.2, CXXABI_1.2</li>
+ <li>gcc-3.2.1: GLIBCPP_3.2.1, CXXABI_1.2</li>
+ <li>gcc-3.2.2: GLIBCPP_3.2.2, CXXABI_1.2</li>
+ <li>gcc-3.2.3: GLIBCPP_3.2.2, CXXABI_1.2</li>
+ <li>gcc-3.3.0: GLIBCPP_3.2.2, CXXABI_1.2.1</li>
+ <li>gcc-3.3.1: GLIBCPP_3.2.3, CXXABI_1.2.1</li>
+ <li>gcc-3.3.2: GLIBCPP_3.2.3, CXXABI_1.2.1</li>
+ <li>gcc-3.3.3: GLIBCPP_3.2.3, CXXABI_1.2.1</li>
+ <li>gcc-3.4.0: GLIBCXX_3.4, CXXABI_1.3</li>
+ <li>gcc-3.4.1: GLIBCXX_3.4.1, CXXABI_1.3</li>
+ <li>gcc-3.4.2: GLIBCXX_3.4.2</li>
+ <li>gcc-3.4.3: GLIBCXX_3.4.3</li>
+ <li>gcc-4.0.0: GLIBCXX_3.4.4, CXXABI_1.3.1</li>
+ <li>gcc-4.0.1: GLIBCXX_3.4.5</li>
+ <li>gcc-4.0.2: GLIBCXX_3.4.6</li>
+ <li>gcc-4.0.3: GLIBCXX_3.4.7</li>
+ <li>gcc-4.1.1: GLIBCXX_3.4.8</li>
+ <li>gcc-4.2.0: GLIBCXX_3.4.9</li>
+ </ul>
+ <p></p>
+ </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
+ be automatically defined whenever g++ is used (the curious can
+ test this by invoking g++ with the '-v' flag.)
+ </p>
+
+ <p>
+ This macro was defined in the file "lang-specs.h" in the gcc/cp directory.
+ Later versions defined it in "c-common.c" in the gcc directory, and from
+ G++ 3.4 it is defined in c-cppbuiltin.c and its value determined by the
+ '-fabi-version' command line option.
+ </p>
+
+ <p>
+ It is versioned as follows, where 'n' is given by '-fabi-version=n':
+ </p>
+ <ul>
+ <li>gcc-3.0.x: 100</li>
+ <li>gcc-3.1.x: 100 (Error, should be 101)</li>
+ <li>gcc-3.2.x: 102</li>
+ <li>gcc-3.3.x: 102</li>
+ <li>gcc-3.4.x, gcc-4.0.x, gcc-4.1.x, gcc-4.2.x: 102 (when n=1)</li>
+ <li>gcc-3.4.x, gcc-4.0.x, gcc-4.1.x, gcc-4.2.x: 1000 + n (when n>1)</li>
+ <li>gcc-3.4.x, gcc-4.0.x, gcc-4.1.x, gcc-4.2.x: 999999 (when n=0)</li>
+ </ul>
+ <p></p>
+ </li>
+
+ <li>
+ <p>Changes to the default compiler option for
+ <code>-fabi-version</code>.
+ </p>
+ <p>
+ It is versioned as follows:
+ </p>
+ <ul>
+ <li>gcc-3.0.x: (Error, not versioned) </li>
+ <li>gcc-3.1.x: (Error, not versioned) </li>
+ <li>gcc-3.2.x: <code>-fabi-version=1</code></li>
+ <li>gcc-3.3.x: <code>-fabi-version=1</code></li>
+ <li>gcc-3.4.x, gcc-4.0.x, gcc-4.1.x, gcc-4.2.x: <code>-fabi-version=2</code></li>
+ </ul>
+ <p></p>
+ </li>
+
+ <li>
+ <p>Incremental bumping of a library pre-defined macro. For releases
+ before 3.4.0, the macro is __GLIBCPP__. For later releases, it's
+ __GLIBCXX__. (The libstdc++ project generously changed from CPP to
+ CXX throughout its source to allow the "C" pre-processor the CPP
+ macro namespace.) These macros are defined as the date the library
+ was released, in compressed ISO date format, as an unsigned long.
+ </p>
+
+ <p>
+ This macro is defined in the file "c++config" in the
+ "libstdc++/include/bits" directory. (Up to gcc-4.1.0, it was
+ changed every night by an automated script. Since gcc-4.1.0, it is
+ the same value as gcc/DATESTAMP.)
+ </p>
+ <p>
+ It is versioned as follows:
+ </p>
+ <ul>
+ <li>gcc-3.0.0: 20010615</li>
+ <li>gcc-3.0.1: 20010819</li>
+ <li>gcc-3.0.2: 20011023</li>
+ <li>gcc-3.0.3: 20011220</li>
+ <li>gcc-3.0.4: 20020220</li>
+ <li>gcc-3.1.0: 20020514</li>
+ <li>gcc-3.1.1: 20020725</li>
+ <li>gcc-3.2.0: 20020814</li>
+ <li>gcc-3.2.1: 20021119</li>
+ <li>gcc-3.2.2: 20030205</li>
+ <li>gcc-3.2.3: 20030422</li>
+ <li>gcc-3.3.0: 20030513</li>
+ <li>gcc-3.3.1: 20030804</li>
+ <li>gcc-3.3.2: 20031016</li>
+ <li>gcc-3.3.3: 20040214</li>
+ <li>gcc-3.4.0: 20040419</li>
+ <li>gcc-3.4.1: 20040701</li>
+ <li>gcc-3.4.2: 20040906</li>
+ <li>gcc-3.4.3: 20041105</li>
+ <li>gcc-3.4.4: 20050519</li>
+ <li>gcc-3.4.5: 20051201</li>
+ <li>gcc-3.4.6: 20060306</li>
+ <li>gcc-4.0.0: 20050421</li>
+ <li>gcc-4.0.1: 20050707</li>
+ <li>gcc-4.0.2: 20050921</li>
+ <li>gcc-4.0.3: 20060309</li>
+ <li>gcc-4.1.0: 20060228</li>
+ <li>gcc-4.1.1: 20060524</li>
+ <li>gcc-4.1.2: 20070214</li>
+ <li>gcc-4.2.0: 20070514</li>
+ </ul>
+ <p></p>
+ </li>
+
+ <li>
+ <p>
+ Incremental bumping of a library pre-defined macro,
+ _GLIBCPP_VERSION. This macro is defined as the released version of
+ the library, as a string literal. This is only implemented in
+ gcc-3.1.0 releases and higher, and is deprecated in 3.4 (where it
+ is called _GLIBCXX_VERSION).
+ </p>
+
+ <p>
+ This macro is defined in the file "c++config" in the
+ "libstdc++/include/bits" directory and is generated
+ automatically by autoconf as part of the configure-time generation
+ of config.h.
+ </p>
+
+ <p>
+ It is versioned as follows:
+ </p>
+ <ul>
+ <li>gcc-3.0.0: "3.0.0"</li>
+ <li>gcc-3.0.1: "3.0.0" (Error, should be "3.0.1")</li>
+ <li>gcc-3.0.2: "3.0.0" (Error, should be "3.0.2")</li>
+ <li>gcc-3.0.3: "3.0.0" (Error, should be "3.0.3")</li>
+ <li>gcc-3.0.4: "3.0.0" (Error, should be "3.0.4")</li>
+ <li>gcc-3.1.0: "3.1.0"</li>
+ <li>gcc-3.1.1: "3.1.1"</li>
+ <li>gcc-3.2.0: "3.2"</li>
+ <li>gcc-3.2.1: "3.2.1"</li>
+ <li>gcc-3.2.2: "3.2.2"</li>
+ <li>gcc-3.2.3: "3.2.3"</li>
+ <li>gcc-3.3.0: "3.3"</li>
+ <li>gcc-3.3.1: "3.3.1"</li>
+ <li>gcc-3.3.2: "3.3.2"</li>
+ <li>gcc-3.3.3: "3.3.3"</li>
+ <li>gcc-3.4.x: "version-unused"</li>
+ <li>gcc-4.0.x: "version-unused"</li>
+ <li>gcc-4.1.x: "version-unused"</li>
+ <li>gcc-4.2.x: "version-unused"</li>
+ </ul>
+ <p></p>
+ </li>
+
+ <li>
+ <p>
+ Matching each specific C++ compiler release to a specific set of
+ C++ include files. This is only implemented in gcc-3.1.1 releases
+ and higher.
+ </p>
+ <p>
+ All C++ includes are installed in include/c++, then nest in a
+ directory hierarchy corresponding to the C++ compiler's released
+ version. This version corresponds to the variable "gcc_version" in
+ "libstdc++/acinclude.m4," and more details can be found in that
+ file's macro GLIBCXX_CONFIGURE (GLIBCPP_CONFIGURE before gcc-3.4.0).
+ </p>
+ <p>
+ C++ includes are versioned as follows:
+ </p>
+ <ul>
+ <li>gcc-3.0.0: include/g++-v3</li>
+ <li>gcc-3.0.1: include/g++-v3</li>
+ <li>gcc-3.0.2: include/g++-v3</li>
+ <li>gcc-3.0.3: include/g++-v3</li>
+ <li>gcc-3.0.4: include/g++-v3</li>
+ <li>gcc-3.1.0: include/g++-v3</li>
+ <li>gcc-3.1.1: include/c++/3.1.1</li>
+ <li>gcc-3.2.0: include/c++/3.2</li>
+ <li>gcc-3.2.1: include/c++/3.2.1</li>
+ <li>gcc-3.2.2: include/c++/3.2.2</li>
+ <li>gcc-3.2.3: include/c++/3.2.3</li>
+ <li>gcc-3.3.0: include/c++/3.3</li>
+ <li>gcc-3.3.1: include/c++/3.3.1</li>
+ <li>gcc-3.3.2: include/c++/3.3.2</li>
+ <li>gcc-3.3.3: include/c++/3.3.3</li>
+ <li>gcc-3.4.0: include/c++/3.4.0</li>
+ <li>gcc-3.4.1: include/c++/3.4.1</li>
+ <li>gcc-3.4.2: include/c++/3.4.2</li>
+ <li>gcc-3.4.3: include/c++/3.4.3</li>
+ <li>gcc-3.4.4: include/c++/3.4.4</li>
+ <li>gcc-3.4.5: include/c++/3.4.5</li>
+ <li>gcc-3.4.6: include/c++/3.4.6</li>
+ <li>gcc-4.0.0: include/c++/4.0.0</li>
+ <li>gcc-4.0.1: include/c++/4.0.1</li>
+ <li>gcc-4.0.2: include/c++/4.0.2</li>
+ <li>gcc-4.0.3: include/c++/4.0.3</li>
+ <li>gcc-4.1.0: include/c++/4.1.0</li>
+ <li>gcc-4.1.1: include/c++/4.1.1</li>
+ <li>gcc-4.1.2: include/c++/4.1.2</li>
+ <li>gcc-4.2.0: include/c++/4.2.0</li>
+ </ul>
+ <p></p>
+ </li>
+ </ul>
+<p>
+ Taken together, these techniques can accurately specify interface
+ and implementation changes in the GNU C++ tools themselves. Used
+ properly, they allow both the GNU C++ tools implementation, and
+ programs using them, an evolving yet controlled development that
+ maintains backward compatibility.
+</p>
+
+
+
+<h5 class="left">
+ <a name="requirements"> Minimum requirements for a versioned ABI </a>
+</h5>
+<p>
+ Minimum environment that supports a versioned ABI: A supported
+ dynamic linker, a GNU linker of sufficient vintage to understand
+ demangled C++ name globbing (ld), a shared executable compiled with
+ g++, and shared libraries (libgcc_s, libstdc++) compiled by a
+ compiler (g++) with a compatible ABI. Phew.
+</p>
+
+<p>
+ On top of all that, an additional constraint: libstdc++ did not
+ attempt to version symbols (or age gracefully, really) until version
+ 3.1.0.
+</p>
+
+<p>
+ Most modern Linux and BSD versions, particularly ones using
+ gcc-3.1.x tools and more recent vintages, will meet the requirements above.
+</p>
+
+
+<h5 class="left">
+ <a name="config"> What configure options impact symbol versioning? </a>
+</h5>
+<p>
+ It turns out that most of the configure options that change default
+ behavior will impact the mangled names of exported symbols, and thus
+ impact versioning and compatibility.
+</p>
+
+<p>
+ For more information on configure options, including ABI impacts, see:
+ http://gcc.gnu.org/onlinedocs/libstdc++/configopts.html
+</p>
+
+<p>
+ There is one flag that explicitly deals with symbol versioning:
+ --enable-symvers.
+</p>
+
+<p>
+ In particular, libstdc++/acinclude.m4 has a macro called
+ GLIBCXX_ENABLE_SYMVERS that defaults to yes (or the argument passed
+ in via --enable-symvers=foo). At that point, the macro attempts to
+ make sure that all the requirement for symbol versioning are in
+ place. For more information, please consult acinclude.m4.
+</p>
+
+
+<h5 class="left">
+ <a name="active"> How to tell if symbol versioning is, indeed, active? </a>
+</h5>
+<p>
+ When the GNU C++ library is being built with symbol versioning on,
+ you should see the following at configure time for libstdc++:
+</p>
+
+
+<code> checking versioning on shared library symbols... gnu</code>
+
+<p>
+ If you don't see this line in the configure output, or if this line
+ appears but the last word is 'no', then you are out of luck.
+</p>
+
+<p>
+ If the compiler is pre-installed, a quick way to test is to compile
+ the following (or any) simple C++ file and link it to the shared
+ libstdc++ library:
+</p>
+
+<pre>
+#include <iostream>
+
+int main()
+{ std::cout << "hello" << std::endl; return 0; }
+
+%g++ hello.cc -o hello.out
+
+%ldd hello.out
+ libstdc++.so.5 => /usr/lib/libstdc++.so.5 (0x00764000)
+ libm.so.6 => /lib/tls/libm.so.6 (0x004a8000)
+ libgcc_s.so.1 => /mnt/hd/bld/gcc/gcc/libgcc_s.so.1 (0x40016000)
+ libc.so.6 => /lib/tls/libc.so.6 (0x0036d000)
+ /lib/ld-linux.so.2 => /lib/ld-linux.so.2 (0x00355000)
+
+%nm hello.out
+</pre>
+
+<p>
+If you see symbols in the resulting output with "GLIBCXX_3" as part
+of the name, then the executable is versioned. Here's an example:
+</p>
+
+ <code> U _ZNSt8ios_base4InitC1Ev@@GLIBCXX_3.4 </code>
+
+<h3 class="left">
+ <a name="ABI_allowed">Library allowed ABI changes</a>
+</h3>
+<p>
+The following will cause the library minor version number to
+increase, say from "libstdc++.so.3.0.4" to "libstdc++.so.3.0.5".
+</p>
+<ul>
+ <li>adding an exported global or static data member</li>
+ <li>adding an exported function, static or non-virtual member function</li>
+ <li>adding an exported symbol or symbols by additional instantiations</li>
+</ul>
+<p>
+</p>
+<p>
+Other allowed changes are possible.
+</p>
+
+
+<h3 class="left">
+ <a name="ABI_disallowed">Library disallowed ABI changes</a>
+</h3>
+
+<p>
+The following non-exhaustive list will cause the library major version
+number to increase, say from "libstdc++.so.3.0.4" to
+"libstdc++.so.4.0.0".
+</p>
+<ul>
+ <li>changes in the gcc/g++ compiler ABI</li>
+<li>changing size of an exported symbol</li>
+<li>changing alignment of an exported symbol</li>
+<li>changing the layout of an exported symbol</li>
+<li>changing mangling on an exported symbol</li>
+<li>deleting an exported symbol</li>
+<li>changing the inheritance properties of a type by adding or removing
+ base classes</li>
+<li>
+ changing the size, alignment, or layout of types
+ specified in the C++ standard. These may not necessarily be
+ instantiated or otherwise exported in the library binary, and
+ include all the required locale facets, as well as things like
+ std::basic_streambuf, et al.
+</li>
+
+<li> adding an explicit copy constructor or destructor to a
+class that would otherwise have implicit versions. This will change
+the way the compiler deals with this class in by-value return
+statements or parameters: instead of being passing instances of this
+class in registers, the compiler will be forced to use memory. See <a
+href="http://www.codesourcery.com/cxx-abi/abi.html#calls"> this part</a>
+ of the C++ ABI documentation for further details.
+ </li>
+
+</ul>
+
+<h3 class="left">
+ <a name="implementation">Library implementation strategy</a> </h3>
+
+<ul>
+ <li>Separation of interface and implementation
+<p>This is accomplished by two techniques that separate the API from
+the ABI: forcing undefined references to link against a library binary
+for definitions.
+</p>
+
+ <dl>
+ <dt>Include files have declarations, source files have defines</dt>
+
+ <dd> For non-templatized types, such as much of <code>class
+ locale</code>, the appropriate standard C++ include, say
+ <code>locale</code>, can contain full declarations, while various
+ source files (say <code> locale.cc, locale_init.cc,
+ localename.cc</code>) contain definitions.</dd>
+
+ <dt>Extern template on required types</dt>
+
+ <dd>For parts of the standard that have an explicit list of required
+ instantiations, the GNU extension syntax <code> extern template
+ </code> can be used to control where template definitions
+ reside. By marking required instantiations as <code> extern
+ template </code> in include files, and providing explicit
+ instantiations in the appropriate instantiation files, non-inlined
+ template functions can be versioned. This technique is mostly used
+ on parts of the standard that require <code> char</code> and <code>
+ wchar_t</code> instantiations, and includes <code>
+ basic_string</code>, the locale facets, and the types in <code>
+ iostreams</code>.</dd>
+
+ </dl>
+ <p> In addition, these techniques have the additional benefit that
+ they reduce binary size, which can increase runtime performance.
+ </p>
+ </li>
+
+ <li>Namespaces linking symbol definitions to export mapfiles
+
+<p>All symbols in the shared library binary are processed by a linker
+script at build time that either allows or disallows external
+linkage. Because of this, some symbols, regardless of normal C/C++
+linkage, are not visible. Symbols that are internal have several
+appealing characteristics: by not exporting the symbols, there are no
+relocations when the shared library is started and thus this makes for
+faster runtime loading performance by the underlying dynamic loading
+mechanism. In addition, they have the possibility of changing without
+impacting ABI compatibility.
+</p>
+
+<p>The following namespaces are transformed by the mapfile:</p>
+
+<dl>
+<dt><code>namespace std</code></dt>
+<dd> 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.</dd>
+
+<dt><code>namespace __gnu_cxx</code></dt>
+<dd> Defaults to not exporting any symbols in label
+<code>GLIBCXX</code>, select items are allowed to be visible.</dd>
+
+<dt><code>namespace __gnu_internal</code></dt>
+<dd> Defaults to not exported, no items are allowed to be visible.</dd>
+
+<dt><code>namespace __cxxabiv1</code>, aliased to <code> namespace abi</code></dt>
+<dd> Defaults to not exporting any symbols in label
+<code>CXXABI</code>, select items are allowed to be visible.</dd>
+</dl>
+<p>
+</p>
+</li>
+
+ <li>Freezing the API
+ <p>Disallowed changes, as above, are not made on a stable release
+branch. Enforcement tends to be less strict with GNU extensions that
+standard includes.</p>
+</li>
+</ul>
+
+<h3 class="left">
+ <a name="ABI_testing">Testing ABI changes</a>
+</h3>
+
+<p>
+Testing for GNU C++ ABI changes is composed of two distinct areas:
+testing the C++ compiler (g++) for compiler changes, and testing the
+C++ library (libstdc++) for library changes.
+</p>
+
+<p>
+Testing the C++ compiler ABI can be done various ways.
+</p>
+
+<p>
+One.
+Intel ABI checker. More information can be obtained
+<a href="http://developer.intel.com/software/products/opensource/">here.</a>
+</p>
+
+<p>
+Two.
+The second is yet unreleased, but has been announced on the gcc
+mailing list. It is yet unspecified if these tools will be freely
+available, and able to be included in a GNU project. Please contact
+Mark Mitchell (mark@codesourcery.com) for more details, and current
+status.
+</p>
+
+<p>
+Three.
+Involves using the vlad.consistency test framework. This has also been
+discussed on the gcc mailing lists.
+</p>
+
+<p>
+Testing the C++ library ABI can also be done various ways.
+</p>
+
+<p>
+One.
+(Brendan Kehoe, Jeff Law suggestion to run 'make check-c++' two ways,
+one with a new compiler and an old library, and the other with an old
+compiler and a new library, and look for testsuite regressions)
+</p>
+
+<p>
+Details on how to set this kind of test up can be found here:
+http://gcc.gnu.org/ml/gcc/2002-08/msg00142.html
+</p>
+
+<p>
+Two.
+Use the 'make check-abi' rule in the libstdc++ Makefile.
+</p>
+
+<p>
+This is a proactive check the library ABI. Currently, exported symbol
+names that are either weak or defined are checked against a last known
+good baseline. Currently, this baseline is keyed off of 3.4.0
+binaries, as this was the last time the .so number was incremented. In
+addition, all exported names are demangled, and the exported objects
+are checked to make sure they are the same size as the same object in
+the baseline.
+
+Notice that each baseline is relative to a <strong>default</strong>
+configured library and compiler: in particular, if options such as
+--enable-clocale, or --with-cpu, in case of multilibs, are used at
+configure time, the check may fail, either because of substantive
+differences or because of limitations of the current checking
+machinery.
+</p>
+
+<p>
+This dataset is insufficient, yet a start. Also needed is a
+comprehensive check for all user-visible types part of the standard
+library for sizeof() and alignof() changes.
+</p>
+
+<p>
+Verifying compatible layouts of objects is not even attempted. It
+should be possible to use sizeof, alignof, and offsetof to compute
+offsets for each structure and type in the standard library, saving to
+another datafile. Then, compute this in a similar way for new
+binaries, and look for differences.
+</p>
+
+<p>
+Another approach might be to use the -fdump-class-hierarchy flag to
+get information. However, currently this approach gives insufficient
+data for use in library testing, as class data members, their offsets,
+and other detailed data is not displayed with this flag.
+(See g++/7470 on how this was used to find bugs.)
+</p>
+
+<p>
+Perhaps there are other C++ ABI checkers. If so, please notify
+us. We'd like to know about them!
+</p>
+
+<h3 class="left">
+ <a name="ABI_multi_testing">Testing Multi-ABI binaries</a>
+</h3>
+
+<p>
+A "C" application, dynamically linked to two shared libraries, liba,
+libb. The dependent library liba is C++ shared library compiled with
+gcc-3.3.x, and uses io, exceptions, locale, etc. The dependent library
+libb is a C++ shared library compiled with gcc-3.4.x, and also uses io,
+exceptions, locale, etc.
+</p>
+
+<p> As above, libone is constructed as follows: </p>
+<pre>
+%$bld/H-x86-gcc-3.4.0/bin/g++ -fPIC -DPIC -c a.cc
+
+%$bld/H-x86-gcc-3.4.0/bin/g++ -shared -Wl,-soname -Wl,libone.so.1 -Wl,-O1 -Wl,-z,defs a.o -o libone.so.1.0.0
+
+%ln -s libone.so.1.0.0 libone.so
+
+%$bld/H-x86-gcc-3.4.0/bin/g++ -c a.cc
+
+%ar cru libone.a a.o
+</pre>
+
+<p> And, libtwo is constructed as follows: </p>
+
+<pre>
+%$bld/H-x86-gcc-3.3.3/bin/g++ -fPIC -DPIC -c b.cc
+
+%$bld/H-x86-gcc-3.3.3/bin/g++ -shared -Wl,-soname -Wl,libtwo.so.1 -Wl,-O1 -Wl,-z,defs b.o -o libtwo.so.1.0.0
+
+%ln -s libtwo.so.1.0.0 libtwo.so
+
+%$bld/H-x86-gcc-3.3.3/bin/g++ -c b.cc
+
+%ar cru libtwo.a b.o
+</pre>
+
+<p> ...with the resulting libraries looking like </p>
+<pre>
+%ldd libone.so.1.0.0
+ libstdc++.so.6 => /usr/lib/libstdc++.so.6 (0x40016000)
+ libm.so.6 => /lib/tls/libm.so.6 (0x400fa000)
+ libgcc_s.so.1 => /mnt/hd/bld/gcc/gcc/libgcc_s.so.1 (0x4011c000)
+ libc.so.6 => /lib/tls/libc.so.6 (0x40125000)
+ /lib/ld-linux.so.2 => /lib/ld-linux.so.2 (0x00355000)
+
+%ldd libtwo.so.1.0.0
+ libstdc++.so.5 => /usr/lib/libstdc++.so.5 (0x40027000)
+ libm.so.6 => /lib/tls/libm.so.6 (0x400e1000)
+ libgcc_s.so.1 => /mnt/hd/bld/gcc/gcc/libgcc_s.so.1 (0x40103000)
+ libc.so.6 => /lib/tls/libc.so.6 (0x4010c000)
+ /lib/ld-linux.so.2 => /lib/ld-linux.so.2 (0x00355000)
+
+</pre>
+
+<p> Then, the "C" compiler is used to compile a source file that uses
+functions from each library.</p>
+<pre>
+gcc test.c -g -O2 -L. -lone -ltwo /usr/lib/libstdc++.so.5 /usr/lib/libstdc++.so.6
+</pre>
+
+<p>
+Which gives the expected:
+</p>
+<pre>
+%ldd a.out
+ libstdc++.so.5 => /usr/lib/libstdc++.so.5 (0x00764000)
+ libstdc++.so.6 => /usr/lib/libstdc++.so.6 (0x40015000)
+ libc.so.6 => /lib/tls/libc.so.6 (0x0036d000)
+ libm.so.6 => /lib/tls/libm.so.6 (0x004a8000)
+ libgcc_s.so.1 => /mnt/hd/bld/gcc/gcc/libgcc_s.so.1 (0x400e5000)
+ /lib/ld-linux.so.2 => /lib/ld-linux.so.2 (0x00355000)
+</pre>
+
+<p>
+This resulting binary, when executed, will be able to safely use code
+from both liba, and the dependent libstdc++.so.6, and libb, with the
+dependent libstdc++.so.5.
+</p>
+
+
+<h3 class="left">
+ <a name="Outstanding Issues">Outstanding Issues</a>
+</h3>
+
+<p> Some features in the C++ language make versioning especially
+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:</p>
+
+<p>
+<a href="http://gcc.gnu.org/PR24660">24660: versioning weak symbols in libstdc++</a>
+</p>
+
+<p>
+<a href="http://gcc.gnu.org/PR19664">19664: libstdc++ headers should have pop/push of the visibility around the declarations</a>
+</p>
+
+<h3 class="left">
+ <a name="references">Bibliography / Further Reading</a>
+</h3>
+
+<p>
+ABIcheck, a vague idea of checking ABI compatibility
+<br />
+<a href="http://abicheck.sourceforge.net/">http://abicheck.sourceforge.net/</a>
+</p>
+
+<p>
+C++ ABI reference
+<br />
+<a href="http://www.codesourcery.com/cxx-abi/">http://www.codesourcery.com/cxx-abi/</a>
+</p>
+
+<p>
+Intel ABI documentation, "Intel® Compilers for Linux* -Compatibility with the GNU Compilers"
+<br />
+<a href="http://developer.intel.com/software/products/compilers/techtopics/LinuxCompilersCompatibility.htm">http://developer.intel.com/software/products/compilers/techtopics/LinuxCompilersCompatibility.htm</a>
+</p>
+
+<p>
+Sun Solaris 2.9 docs
+<br />
+Linker and Libraries Guide (document 816-1386)
+<br />
+C++ Migration Guide (document 816-2459)
+<br />
+<a href="http://docs.sun.com/db/prod/solaris.9">http://docs.sun.com/db/prod/solaris.9</a>
+<br />
+<a href="http://docs.sun.com/?p=/doc/816-1386&a=load">http://docs.sun.com/?p=/doc/816-1386&a=load</a>
+</p>
+
+<p>
+Ulrich Drepper, "ELF Symbol Versioning"
+<br />
+<a href="http://people.redhat.com/drepper/symbol-versioning">http://people.redhat.com/drepper/symbol-versioning</a>
+</p>
+
+<p>
+C++ ABI for the ARM Architecture
+<br />
+<a href="http://www.arm.com/miscPDFs/8033.pdf">http://www.arm.com/miscPDFs/8033.pdf</a>
+</p>
+
+<p>
+Benjamin Kosnik, ISO C++ J16/06-0046
+<br />
+<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n1976.html">Dynamic Shared Objects: Survey and Issues</a>
+</p>
+
+<p>
+Benjamin Kosnik, ISO C++ J16/06-0083
+<br />
+<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2013.html">Versioning With Namespaces</a>
+</p>
+
+</body>
+</html>
+
--- /dev/null
+<?xml version="1.0" encoding="ISO-8859-1"?>
+<!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" xml:lang="en" lang="en">
+<head>
+ <meta name="AUTHOR" content="bkoz@gcc.gnu.org (Benjamin Kosnik), Felix Natter" />
+ <meta name="KEYWORDS" content="C++, libstdc++, API, deprecate backward" />
+ <meta name="DESCRIPTION" content="API evolution and deprecation history" />
+ <meta name="GENERATOR" content="emacs and ten fingers" />
+ <title>API Evolution and Deprecation History</title>
+<link rel="StyleSheet" href="lib3styles.css" type="text/css" />
+<link rel="Start" href="documentation.html" type="text/html"
+ title="GNU C++ Standard Library" />
+<link rel="Copyright" href="17_intro/license.html" type="text/html" />
+</head>
+<body>
+
+<h1 class="centered"><a name="top">API Evolution and Deprecation History</a></h1>
+
+<p class="fineprint"><em>
+ The latest version of this document is always available at
+ <a href="http://gcc.gnu.org/onlinedocs/libstdc++/17_intro/api.html">
+ http://gcc.gnu.org/onlinedocs/libstdc++/17_intro/abi.html</a>.
+</em></p>
+
+<p><em>
+ To the <a href="http://gcc.gnu.org/libstdc++/">libstdc++ homepage</a>.
+</em></p>
+
+<!-- ####################################################### -->
+<hr />
+<h3 class="left">
+ <a name="C++ API v1">First.</a>
+</h3>
+
+<p>2.72</p>
+<p> The first generation GNU C++ library was called libg++. It had a
+working relationship with at least two kinds of dinosaur. Sadly, the
+details were not pried away from the estate.
+</p>
+
+<p>
+
+</p>
+
+<p>Known Issues include many of the limitations of its immediate ancestor.</p>
+
+<h5>No <code>ios_base</code></h5>
+
+<p> At least some older implementations don't have <code>std::ios_base</code>, so you should use <code>std::ios::badbit</code>, <code>std::ios::failbit</code> and <code>std::ios::eofbit</code> and <code>std::ios::goodbit</code>.
+</p>
+
+<h5>No <code>cout</code> in <code>ostream.h</code>, no <code>cin</code> in <code>istream.h</code</h5>
+
+<p>
+ In earlier versions of the standard,
+ <tt><fstream.h></tt>,
+ <tt><ostream.h></tt>
+ and <tt><istream.h></tt>
+ used to define
+ <code>cout</code>, <code>cin</code> and so on. ISO C++ specifies that one needs to include
+ <tt><iostream></tt>
+ explicitly to get the required definitions.
+ </p>
+<p> Some include adjustment may be required.</p>
+
+
+<p>This project is no longer maintained or supported, and the sources
+archived. The code is considered replaced and rewritten.
+</p>
+
+<hr />
+<h3 class="left">
+ <a name="C++ API v1">Second.</a>
+</h3>
+<p> The second generation GNU C++ library was called libstdc++, or
+libstdc++-v2. It was a separate GNU project, although reliably paired
+with GCC. It spans the time between libg++ and pre-ISO C++.
+</p>
+
+<p>egcs 1.x</p>
+<p>2.95</p>
+<p>2.96</p>
+
+<p>Portability Notes</p>
+<p>Implementation Limitations</p>
+
+<h5>Namespace <code>std::</code> not supported.</h5>
+
+<p>
+ Some care is required to support C++ compiler and or library
+ implementation that do not have the standard library in
+ <code>namespace std</code>.
+ </p>
+<p>
+ The following sections list some possible solutions to support compilers
+ that cannot ignore <code>std::</code>-qualified names.
+ </p>
+
+<p> First, see if the compiler has a flag for this. Namespace
+ back-portability-issues are generally not a problem for g++
+ compilers that do not have libstdc++ in <code>std::</code>, as
+ the compilers use <code>-fno-honor-std</code> (ignore
+ <code>std::</code>, <code>:: = std::</code>) by default. That
+ is, the responsibility for enabling or disabling
+ <code>std::</code> is on the user; the maintainer does not have
+ to care about it. This probably applies to some other compilers
+ as well.
+ </p>
+
+<p>Second, experiment with a variety of pre-processor tricks.</p>
+
+<p> By defining <code>std</code> as a macro, fully-qualified namespace calls become global. Volia.
+
+<pre class="programlisting">
+#ifdef WICKEDLY_OLD_COMPILER
+# define std
+#endif
+</pre>
+(thanks to Juergen Heinzl who posted this solution on gnu.gcc.help)
+
+<p>Define a macro <code>NAMESPACE_STD</code>, which is defined to
+either "" or "std" based on a compile-type
+test. On GNU systems, this can be done with autotools by means of an
+autoconf test (see below) for <code>HAVE_NAMESPACE_STD</code>, 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>). </p>
+
+<p>
+<pre>
+dnl @synopsis AC_CXX_HAVE_STD_NAMESPACE
+dnl
+dnl If the compiler supports the std namespace, define
+dnl HAVE_STD_NAMESPACE.
+dnl
+dnl @category Cxx
+dnl @author Todd Veldhuizen
+dnl @author Luc Maisonobe <luc@spaceroots.org>
+dnl @version 2004-02-04
+dnl @license AllPermissive
+
+AC_DEFUN([AC_CXX_HAVE_STD_NAMESPACE],
+[AC_CACHE_CHECK(whether the compiler supports the std namespace,
+ac_cv_cxx_have_std_namespace,
+[AC_LANG_SAVE
+ AC_LANG_CPLUSPLUS
+ AC_TRY_COMPILE([#include <iostream>
+ std::istream& is = std::cin;
+ ],[return 0;],
+ ac_cv_cxx_have_std_namespace=yes, ac_cv_cxx_have_std_namespace=no)
+ AC_LANG_RESTORE
+])
+if test "$ac_cv_cxx_have_std_namespace" = yes; then
+ AC_DEFINE(HAVE_STD_NAMESPACE,,[define if the compiler supports the std namespace])
+fi
+])
+</pre>
+
+<h5>Illegal iterator usage.</h5>
+<p>
+ The following illustrate implementation-allowed illegal iterator
+ use, and then correct use. <div class="itemizedlist"><ul
+ type="disc"> <li><p>you cannot do
+ <code>ostream::operator<<(iterator)</code> to print the
+ address of the iterator => use <code>operator<<
+ &*iterator</code> instead ?
+ </p></li>
+<li><p>you cannot clear an iterator's reference
+ (<code>iterator = 0</code>) => use
+ <code>iterator = iterator_type();</code> ?
+ </p></li>
+<li><p>
+<code>if (iterator)</code> won't work any
+ more => use <code>if (iterator != iterator_type())</code>
+ ?</p></li>
+</ul>
+
+<h5><code>isspace</code> from <tt><cctype></tt> is a macro
+</h5>
+
+<p> Glibc 2.0.x and 2.1.x define <tt><ctype.h></tt>
+functionality as macros (isspace, isalpha etc.).
+</p>
+
+<p>
+This implementations of libstdc++, however, keep these functions as
+macros, and so it is not back-portable to use fully qualified
+names. For example:
+</p>
+
+<pre>
+#include <cctype>
+int main() { std::isspace('X'); }
+</pre>
+
+<p>Results in something like this:
+</p>
+
+<pre>
+std:: (__ctype_b[(int) ( ( 'X' ) )] & (unsigned short int) _ISspace ) ;
+</pre>
+
+
+<p> A solution is to modify a header-file so that the compiler tells
+<tt><ctype.h></tt> to define functions instead of macros:
+</p>
+
+<pre>
+// This keeps isalnum, et al from being propagated as macros.
+#if __linux__
+# define __NO_CTYPE 1
+#endif
+</pre>
+
+<p>Then, include <ctype.h>
+</p>
+
+<p>
+Another problem arises if you put a <code>using namespace std;</code>
+declaration at the top, and include <tt><ctype.h></tt>. This
+will result in ambiguities between the definitions in the global
+namespace (<tt><ctype.h></tt>) and the definitions in namespace
+<code>std::</code> (<code><cctype></code>).
+</p>
+
+<h5>No <code>vector::at</code>, <code>deque::at</code>, <code>string::at</code></h5>
+
+<p>
+ One solution is to add an autoconf-test for this:
+</p>
+<pre>
+AC_MSG_CHECKING(for container::at)
+AC_TRY_COMPILE(
+[
+#include <vector>
+#include <deque>
+#include <string>
+
+using namespace std;
+],
+[
+deque<int> test_deque(3);
+test_deque.at(2);
+vector<int> test_vector(2);
+test_vector.at(1);
+string test_string("test_string");
+test_string.at(3);
+],
+[AC_MSG_RESULT(yes)
+AC_DEFINE(HAVE_CONTAINER_AT)],
+[AC_MSG_RESULT(no)])
+</pre>
+
+<p>
+If you are using other (non-GNU) compilers it might be a good idea
+to check for <code>string::at</code> separately.
+</p>
+
+<h5>No <code>std::char_traits<char>::eof</code></h5>
+
+<p>
+Use some kind of autoconf test, plus this:
+</p>
+<pre>
+#ifdef HAVE_CHAR_TRAITS
+#define CPP_EOF std::char_traits<char>::eof()
+#else
+#define CPP_EOF EOF
+#endif
+</pre>
+
+<h5>No <code>string::clear</code></h5>
+
+<p>
+ There are two functions for deleting the contents of a string:
+ <code>clear</code> and <code>erase</code> (the latter
+ returns the string).
+ <pre class="programlisting">
+ void
+ clear() { _M_mutate(0, this->size(), 0); }
+ </pre>
+ <pre class="programlisting">
+ basic_string&
+ erase(size_type __pos = 0, size_type __n = npos)
+ {
+ return this->replace(_M_check(__pos), _M_fold(__pos, __n),
+ _M_data(), _M_data());
+ }
+ </pre>
+ 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>).
+</p>
+
+<h5>Removal of <code>ostream::form</code> and
+<code>istream::scan</code> extensions.</h5>
+
+<p> These are no longer supported. Please use
+ <a href="#sec-stringstream" title="Using stringstreams">
+ stringstreams</a> instead.
+</p>
+
+<h5>No <code>basic_stringbuf</code>, <code>basic_stringstream<code></h5>
+
+<p>
+ Libstdc++ provides the new
+ <code>i/ostringstream</code>-classes, (<tt><sstream></tt>), but for compatibility
+ with older implementations you still have to use
+ <code>i/ostrstream</code> (<tt><strstream></tt>):
+ <pre >
+ #ifdef HAVE_SSTREAM
+ #include <sstream>
+ #else
+ #include <strstream>
+ #endif
+ </pre>
+ <div class="itemizedlist"><ul type="disc">
+<li><p> <code>strstream</code> is considered to be
+ deprecated
+ </p></li>
+<li><p> <code>strstream</code> is limited to
+ <code>char</code>
+ </p></li>
+<li><p> with <code>ostringstream</code> you don't
+ have to take care of terminating the string or freeing its
+ memory
+ </p></li>
+<li><p> <code>istringstream</code> can be re-filled
+ (clear(); str(input);)
+ </p></li>
+</ul></div>
+<p>
+ You can then use output-stringstreams like this:
+ <pre >
+ #ifdef HAVE_SSTREAM
+ std::ostringstream oss;
+ #else
+ std::ostrstream oss;
+ #endif
+ oss << "Name=" << m_name << ", number=" << m_number << std::endl;
+ ...
+ #ifndef HAVE_SSTREAM
+ oss << std::ends; // terminate the char*-string
+ #endif
+ // str() returns char* for ostrstream and a string for ostringstream
+ // this also causes ostrstream to think that the buffer's memory
+ // is yours
+ m_label.set_text(oss.str());
+ #ifndef HAVE_SSTREAM
+ // let the ostrstream take care of freeing the memory
+ oss.freeze(false);
+ #endif
+ </pre>
+<p>
+ Input-stringstreams can be used similarly:
+</p>
+
+<pre>
+std::string input;
+...
+#ifdef HAVE_SSTREAM
+std::istringstream iss(input);
+#else
+std::istrstream iss(input.c_str());
+#endif
+
+int i;
+iss >> i;
+</pre>
+
+<p> One (the only?) restriction is that an istrstream cannot be re-filled:
+</p>
+
+<pre >
+std::istringstream iss(numerator);
+iss >> m_num;
+// this is not possible with istrstream
+iss.clear();
+iss.str(denominator);
+iss >> m_den;
+ </pre>
+
+<p>
+If you don't care about speed, you can put these conversions in
+ a template-function:
+</p>
+<pre >
+template <class X>
+void fromString(const string& input, X& any)
+{
+#ifdef HAVE_SSTREAM
+std::istringstream iss(input);
+#else
+std::istrstream iss(input.c_str());
+#endif
+X temp;
+iss >> temp;
+if (iss.fail())
+throw runtime_error(..)
+any = temp;
+}
+</pre>
+
+<p> Another example of using stringstreams is in <a href="../21_strings/howto.html" target="_top">this howto</a>.
+</p>
+
+<p> There is additional information in the libstdc++-v2 info files, in
+particular "info iostream".
+</p>
+
+<h5>Little or no wide character support</h5>
+
+<h5>No templatized iostreams</h5>
+
+<h5>Thread safety issues.</h5>
+
+<p>This project is no longer maintained or supported, and the sources
+archived. The code is considered replaced and rewritten.
+</p>
+
+
+<hr />
+<h3 class="left">
+ <a name="C++ API v1">Third.</a>
+</h3>
+<p> The third generation GNU C++ library is called libstdc++, or
+libstdc++-v3.
+</p>
+
+ <p>The subset commonly known as the Standard Template Library
+ (chapters 23 through 25, mostly) is adapted from the final release
+ of the SGI STL, with extensive changes.
+ </p>
+
+ <p>A more formal description of the V3 goals can be found in the
+ official <a href="../17_intro/DESIGN">design document</a>.
+ </p>
+
+
+<p>Portability Notes</p>
+
+<h5>Pre-ISO headers moved to backwards</h5>
+<p> The pre-ISO C++ headers (iostream.h etc.) are available, but inclusion
+ generates a warning that you are using deprecated headers.
+</p>
+
+ <p>This compatibility layer is constructed by including the
+ standard C++ headers, and injecting any items in
+ <code>std::</code> into the global namespace.
+ </p>
+ <p>For those of you new to ISO C++ (welcome, time travelers!), no,
+ that isn't a typo. Yes, the headers really have new names.
+ Marshall Cline's C++ FAQ Lite has a good explanation in <a
+ href="http://www.parashift.com/c++-faq-lite/coding-standards.html#faq-27.4">item
+ [27.4]</a>.
+ </p>
+
+<p> Some include adjustment may be required.</p>
+
+<h5>Extension headers hash_map, hash_set moved to ext</h5>
+
+<p> Header files <code>hash_map</code> and <code>hash_set</code>
+moved to <code>ext/hash_map</code> and <code>ext/hash_set</code>,
+respectively. At the same time, all types in these files are enclosed
+in <code>namespace __gnu_cxx</code>.
+</p>
+
+
+<h5>
+No <code>ios::nocreate/ios::noreplace</code>.
+</h5>
+
+<p> The existence of <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
+it can be left out for input-streams.
+</p>
+
+<p>For output streams, "nocreate" is probably the default,
+unless you specify <code>std::ios::trunc</code> ? To be safe, you can
+open the file for reading, check if it has been opened, and then
+decide whether you want to create/replace or not. To my knowledge,
+even older implementations support <code>app</code>, <code>ate</code>
+and <code>trunc</code> (except for <code>app</code> ?).
+</p>
+
+
+<h5>
+No <code>stream::attach(int fd)</code>.
+</h5>
+
+<p>
+ Phil Edwards writes: It was considered and rejected for the ISO
+ standard. Not all environments use file descriptors. Of those
+ 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>std::streambuf</code> (or
+ <code>std::basic_streambuf<..></code>) which opens a file
+ given a descriptor, and then pass an instance of this to the
+ stream-constructor.
+ </p>
+
+<p>
+ An extension is available that implements this.
+ <code><ext/stdio_filebuf.h></code> contains a derived class called
+ <a href="http://gcc.gnu.org/onlinedocs/libstdc++/latest-doxygen/class____gnu__cxx_1_1stdio__filebuf.html"><code>__gnu_cxx::stdio_filebuf</code></a>.
+ This class can be constructed from a C <code>FILE*</code> or a file
+ descriptor, and provides the <code>fd()</code> function.
+ </p>
+
+<p>
+ For another example of this, refer to
+ <a href="http://www.josuttis.com/cppcode/fdstream.html" target="_top">fdstream example</a>
+ by Nicolai Josuttis.
+</p>
+
+<p><a href="http://gcc.gnu.org/bugzilla/buglist.cgi?cmdtype=runnamed&namedcmd=libstdc%2B%2B">Known Issues</a></p>
+
+<h5>
+container iterator types are not necessarily container value_type*
+</h5>
+
+<p>API History, User Visible Changes</p>
+
+<p>3.0.0</p>
+
+
+<p>3.1.0</p>
+<p>3.2.0</p>
+<p>3.3.0</p>
+
+
+<p>3.4.0</p>
+
+Macro guard for libstdc++ changed, from _GLIBCPP_ to _GLIBCXX_, to
+accomodate a request from the C Pre Processor maintainer.
+
+<p>4.0.0</p>
+<p>4.1.0</p>
+
+<cassert> how has to be explicitly included for <code>std::assert</code> calls.
+
+<p>4.2.0</p>
+
+<p>4.3.0</p>
+
+Header streamlining.
+
+Backward include edit.
+
+PCH files built but not installed.
+
+Namespace pb_ds moved to __gnu_pb_ds.
+
+C++OX features appear.
+
+<hr />
+<h3 class="left">
+ <a name="C++ API v1">Fourth, and future</a>
+</h3>
+
+<hr />
+<h3 class="left">
+ <a name="Deprecation">Deprecation and Backwards Compatibility</a>
+</h3>
+
+<hr />
+<h3 class="left">
+ <a name="Links">Links</a>
+</h3>
+
+<p>
+<a href="http://www.kegel.com/gcc/gcc4.html">Migrating to gcc-4.1</a>, by Dan Kegel.
+</p>
+
+<p>
+<a href="http://lists.debian.org/debian-gcc/2006/03/msg00405.html">Building the whole Debian archive with GCC 4.1: a summary</a>, by Martin Michlmayr
+</p>
+
+<p>
+<a href="http://annwm.lbl.gov/~leggett/Atlas/gcc-3.2.html">Migration guide for GCC-3.2</a>
+</p>
+
+</body>
+</html>
+
--- /dev/null
+<?xml version="1.0" encoding="ISO-8859-1"?>
+<!DOCTYPE html
+ PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+ "DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+
+<head>
+
+ <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1" />
+ <link rev="made" href="mailto:gcc@gcc.gnu.org" />
+ <link rel="shortcut icon" href="http://gcc.gnu.org/favicon.ico" />
+
+ <title>
+ Status of C++0x features in GCC
+ - GNU Project - Free Software Foundation (FSF)
+ </title>
+
+</head>
+
+<body>
+
+<h1 align="center">
+ Status of C++0x features in GCC
+</h1>
+
+<p>
+This table is based on the table of contents of ISO/IEC
+Doc No: N2461=07-0331 Date: 2007-10-22
+Working Draft, Standard for Programming Language C++
+</p>
+
+<p>
+In this implementation <code>-std=gnu++0x</code> or
+<code>-std=c++0x</code> flags must be used to enable language and
+library features. The pre-defined symbol
+<code>__GXX_EXPERIMENTAL_CXX0X__</code> is used to check for the
+presence of the required flag.
+</p>
+
+<p>
+This page describes the C++0x support in mainline GCC SVN, not in any
+particular release.
+</p>
+
+<table border="1">
+ <thead>
+ <tr>
+ <td><span style="font-weight: bold;">Section</span></td>
+ <td><span style="font-weight: bold;">Description</span></td>
+ <td><span style="font-weight: bold;">Done</span></td>
+ <td><span style="font-weight: bold;">Broken</span></td>
+ <td><span style="font-weight: bold;">Missing</span></td>
+ <td><span style="font-weight: bold;">Comments</span></td>
+ </tr>
+ </thead>
+ <tbody>
+ <tr>
+ <td><b>20</b></td>
+ <td colspan="5"><b>General Utilities</b></td>
+ </tr>
+ <tr>
+ <td>20.2</td>
+ <td>Utility Components</td>
+ <td></td>
+ <td></td>
+ <td>incomplete</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.2.1</td>
+ <td>Operators</td>
+ <td></td>
+ <td></td>
+ <td>partial</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.2.2</td>
+ <td>forward/move helpers</td>
+ <td></td>
+ <td></td>
+ <td>partial</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.2.3</td>
+ <td>Pairs</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+
+ <tr>
+ <td>20.3</td>
+ <td>Header <code><tuple></code> synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.3.1</td>
+ <td>Class template <code>tuple</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.3.1.1</td>
+ <td>Construction</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.3.1.2</td>
+ <td>Tuple creation functions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.3.1.3</td>
+ <td>Tuple helper classes</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.3.1.4</td>
+ <td>Element access</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.3.1.5</td>
+ <td>Relational operators</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+
+ <tr>
+ <td>20.4</td>
+ <td colspan="5">Metaprogramming and type traits</td>
+ </tr>
+ <tr>
+ <td>20.4.1</td>
+ <td>Requirements</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.4.2</td>
+ <td>Header <code><type_traits></code> synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.4.3</td>
+ <td>Helper classes</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.4.4</td>
+ <td>General Requirements</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.4.5</td>
+ <td>Unary Type Traits</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.4.5.1</td>
+ <td>Primary Type Categories</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.4.5.2</td>
+ <td>Composite type traits</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.4.5.3</td>
+ <td>Type properties</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.4.6</td>
+ <td>Relationships between types</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.4.7</td>
+ <td>Transformations between types</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.4.7.1</td>
+ <td>Const-volatile modifications</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.4.7.2</td>
+ <td>Reference modifications</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.4.7.3</td>
+ <td>Array modifications</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.4.7.4</td>
+ <td>Pointer modifications</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.4.8</td>
+ <td>Other transformations</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.4.9</td>
+ <td>Implementation requirements</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5 </td>
+ <td>Function Objects</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5</td>
+ <td>Additions to header <code><functional></code> synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.1</td>
+ <td>Definitions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.2</td>
+ <td>Requirements</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.3</td>
+ <td>Base</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.4</td>
+ <td>Function return types</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.5</td>
+ <td>Class template <code>reference_wrapper</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.5.1</td>
+ <td><code>reference_wrapper</code> construct/copy/destroy</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.5.2</td>
+ <td><code>reference_wrapper</code> assignment</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.5.3</td>
+ <td><code>reference_wrapper</code> access</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.5.4</td>
+ <td><code>reference_wrapper</code> invocation</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.5.5</td>
+ <td><code>reference_wrapper</code> helper functions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.14</td>
+ <td>Function template <code>mem_fn</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.11</td>
+ <td>Template function bind</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+
+ <tr>
+ <td>20.5.11.1</td>
+ <td>Function object binders</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.11.1.1</td>
+ <td>Class template <code>is_bind_expression</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.11.1.2</td>
+ <td>Class template <code>is_placeholder</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.11.1.3</td>
+ <td>Function template <code>bind</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.11.1.4</td>
+ <td>Placeholders</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.15</td>
+ <td>Polymorphic function wrappers</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.15.1</td>
+ <td>Class <code>bad_function_call<code></code></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.15.1.1</td>
+ <td><code>bad_function_call</code> constructor</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.15.2</td>
+ <td>Class template <code>function</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.15.2.1</td>
+ <td><code>function</code> construct/copy/destroy</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.15.2.2</td>
+ <td><code>function</code> modifiers</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.15.2.3</td>
+ <td><code>function</code> capacity</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.15.2.4</td>
+ <td><code>function</code> invocation</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.15.2.5</td>
+ <td><code>function</code> target access</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.15.2.7</td>
+ <td>null pointer comparison operators</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.15.2.8</td>
+ <td>specialized algorithms</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.5.16</td>
+ <td>Class template <code>hash</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.6</td>
+ <td>Additions to header <code><memory></code> synopsis</td>
+ <td></td>
+ <td></td>
+ <td>partial</td>
+ <td>missing <code>unique_ptr</code></td>
+ </tr>
+ <tr>
+ <td>20.6.5</td>
+ <td>Class template <code>unique_ptr</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.6.6</td>
+ <td>Smart pointers</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.6.6.1</td>
+ <td>Class <code>bad_weak_ptr</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.6.6.2</td>
+ <td>Class template <code>shared_ptr</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td><a href="tr1.html#1">1</a></td>
+ </tr>
+ <tr>
+ <td>20.6.6.2.1</td>
+ <td><code>shared_ptr</code> constructors</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.6.6.2.2</td>
+ <td><code>shared_ptr</code> destructor</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.6.6.2.3</td>
+ <td><code>shared_ptr</code> assignment</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.6.6.2.4</td>
+ <td><code>shared_ptr</code> modifiers</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.6.6.2.5</td>
+ <td><code>shared_ptr</code> observers</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.6.6.2.6</td>
+ <td><code>shared_ptr</code> comparison</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.6.6.2.7</td>
+ <td><code>shared_ptr</code> I/O</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.6.6.2.8</td>
+ <td><code>shared_ptr</code> specialized algorithms</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.6.6.2.9</td>
+ <td><code>shared_ptr</code> casts</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.6.6.2.10</td>
+ <td><code>get_deleter</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.6.6.3</td>
+ <td>Class template <code>weak_ptr</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.6.6.3.1</td>
+ <td><code>weak_ptr</code> constructors</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.6.6.3.2</td>
+ <td><code>weak_ptr</code> destructor</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.6.6.3.3</td>
+ <td><code>weak_ptr</code> assignment</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.6.6.3.4</td>
+ <td><code>weak_ptr</code> modifiers</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.6.6.3.5</td>
+ <td><code>weak_ptr</code> observers</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.6.6.3.6</td>
+ <td><code>weak_ptr</code> comparison</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.6.6.3.7</td>
+ <td><code>weak_ptr</code> specialized algorithms</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>20.6.6.4</td>
+ <td>Class template <code>enable_shared_from_this</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+
+
+
+ <tr>
+ <td><b>23</b></td>
+ <td colspan="5"><b>Containers</b></td>
+ </tr>
+ <tr>
+ <td>23.2.1</td>
+ <td>Header <code><array></code> synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>23.2.1</td>
+ <td>Class template array</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>23.2.1.1</td>
+ <td><code>array</code> constructors, copy, and assignment</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>23.2.1.2</td>
+ <td><code>array</code> specialized algorithms</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>23.2.1.3</td>
+ <td><code>array </code>size</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>23.2.1.4</td>
+ <td><code>array </code>data</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>23.2.1.5</td>
+ <td>Zero sized <code>array</code>s</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>23.2.1.6</td>
+ <td>Tuple interface to class template <code>array</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+
+ <tr>
+ <td>23.4</td>
+ <td>Unordered associative containers</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>23.4.1</td>
+ <td>Class template <code>unordered_map</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>23.4.1.1</td>
+ <td><code>unordered_map</code> constructors</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>23.4.1.2</td>
+ <td><code>unordered_map</code> element access</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>23.4.1.3</td>
+ <td><code>unordered_map</code> swap</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>23.4.2</td>
+ <td>Class template <code>unordered_multimap</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>23.4.2.1</td>
+ <td><code>unordered_multimap</code> constructors</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>23.4.2.2</td>
+ <td><code>unordered_multimap</code> swap</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>23.4.3</td>
+ <td>Class template <code>unordered_set</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>23.4.3.1</td>
+ <td><code>unordered_set</code> constructors</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>23.4.3.2</td>
+ <td><code>unordered_set</code> swap</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>23.4.4</td>
+ <td>Class template <code>unordered_multiset<code></code></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>23.4.4.1</td>
+ <td><code>unordered_multiset</code> constructors</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>23.4.4.2</td>
+ <td><code>unordered_multiset</code> swap</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+
+ <tr>
+ <td><b>26</b></td>
+ <td colspan="5"><b>Numerics</b></td>
+ </tr>
+ <tr>
+ <td>26.4</td>
+ <td>Random number generation</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.1</td>
+ <td>Requirements</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.2</td>
+ <td>Header <code><random></code> synopsis</td>
+ <td></td>
+ <td></td>
+ <td>partial</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.3</td>
+ <td>Random number engine class templates</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.3.1</td>
+ <td>Class template <code>linear_congruential_engine</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.3.2</td>
+ <td>Class template <code>mersenne_twister_engine</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.3.3</td>
+ <td>Class template <code>subtract_with_carry_engine</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.4</td>
+ <td>Random number engine adaptor class templates</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+
+ <tr>
+ <td>26.4.4.1</td>
+ <td>Class template <code>discard_block_engine</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.4.2</td>
+ <td>Class template <code>independent_bits_engine</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.4.3</td>
+ <td>Class template <code>shuffle_order_engine</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.4.4</td>
+ <td>Class template <code>xor_combine_engine</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td>operator()() per N2079</td>
+ </tr>
+ <tr>
+ <td>26.4.5</td>
+ <td>Engines and engine adaptors with predefined parameters</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.6</td>
+ <td>Class <code>random_device</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.7</td>
+ <td>Utilities</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.7.1</td>
+ <td>Class <code>seed_seq</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.7.2</td>
+ <td>Function template <code>generate_cannonical</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.8</td>
+ <td>Random number generation class templates</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.8.1</td>
+ <td>Uniform distributions</td>
+ <td></td>
+ <td></td>
+ <td>partial</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.8.1</td>
+ <td>Class template <code>uniform_int_distribution</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.8.1</td>
+ <td>Class template <code>uniform_real_distribution</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.8.2</td>
+ <td>Bernoulli distributions</td>
+ <td></td>
+ <td></td>
+ <td>partial</td>
+ <td></td>
+ </tr>
+
+ <tr>
+ <td>26.4.8.2.1</td>
+ <td>Class <code>bernoulli_distribution</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.8.2.2</td>
+ <td>Class template <code>binomial_distribution</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.8.2.3</td>
+ <td>Class template <code>geometric_distribution</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.8.2.4</td>
+ <td>Class template <code>negative_binomial_distribution</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.8.3</td>
+ <td>Poisson distributions</td>
+ <td></td>
+ <td></td>
+ <td>partial</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.8.3.1</td>
+ <td>Class template <code>poisson_distribution</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.8.3.2</td>
+ <td>Class template <code>exponential_distribution</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.8.3.3</td>
+ <td>Class template <code>gamma_distribution</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.8.3.4</td>
+ <td>Class template <code>weibull_distribution</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.8.3.5</td>
+ <td>Class template <code>extreme_value_distribution</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.8.4</td>
+ <td>Normal distributions</td>
+ <td></td>
+ <td></td>
+ <td>partial</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.8.4.1</td>
+ <td>Class template <code>normal_distribution</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.8.4.2</td>
+ <td>Class template <code>lognormal_distribution</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.8.4.3</td>
+ <td>Class template <code>chi_squared_distribution</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.8.4.4</td>
+ <td>Class template <code>cauchy_distribution</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.8.4.5</td>
+ <td>Class template <code>fisher_f_distribution</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.8.4.6</td>
+ <td>Class template <code>student_t_distribution</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.8.5</td>
+ <td>Sampling distributions</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.8.5.1</td>
+ <td>Class template <code>discrete_distribution</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.8.5.1</td>
+ <td>Class template <code>piecewise_constant_distribution</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>26.4.8.5.1</td>
+ <td>Class template <code>general_pdf_distribution</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+
+ <tr>
+ <td><b>28</b></td>
+ <td colspan="5"><b>Regular expressions</b></td>
+ </tr>
+ <tr>
+ <td>28.1</td>
+ <td>Definitions</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.2</td>
+ <td>Requirements</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.3</td>
+ <td>Regular expressions summary</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.4</td>
+ <td>Header <code><regex></code> synopsis</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.5</td>
+ <td>Namespace <code>tr1::regex_constants</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.5.1</td>
+ <td>Bitmask Type <code>syntax_option_type</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.5.2</td>
+ <td>Bitmask Type <code>regex_constants::match_flag_type</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.5.3</td>
+ <td>Implementation defined <code>error_type</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.6</td>
+ <td>Class <code>regex_error</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.7</td>
+ <td>Class template <code>regex_traits</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.8</td>
+ <td>Class template <code>basic_regex</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.8.1</td>
+ <td><code>basic_regex</code> constants</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.8.2</td>
+ <td><code>basic_regex</code> constructors</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.8.3</td>
+ <td><code>basic_regex</code> assign</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.8.4</td>
+ <td><code>basic_regex</code> constant operations</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.8.5</td>
+ <td><code>basic_regex</code> locale</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.8.6</td>
+ <td><code>basic_regex</code> swap</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.8.7</td>
+ <td><code>basic_regex</code> non-member functions</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.8.7.1</td>
+ <td><code>basic_regex</code> non-member swap</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.9</td>
+ <td>Class template <code>sub_match</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.9.1</td>
+ <td><code>sub_match</code> members</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.9.2</td>
+ <td><code>sub_match</code> non-member operators</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.10</td>
+ <td>Class template <code>match_results</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.10.1</td>
+ <td><code>match_results</code> constructors</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.10.2</td>
+ <td><code>match_results</code> size</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.10.3</td>
+ <td><code>match_results</code> element access</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.10.4</td>
+ <td><code>match_results</code> formatting</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.10.5</td>
+ <td><code>match_results</code> allocator</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.10.6</td>
+ <td><code>match_results</code> swap</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.11</td>
+ <td>Regular expression algorithms</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.11.1</td>
+ <td>exceptions</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.11.2</td>
+ <td><code>regex_match</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.11.3</td>
+ <td><code>regex_search</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.11.4</td>
+ <td><code>regex_replace</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.12</td>
+ <td>Regular expression Iterators</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.12.1</td>
+ <td>Class template <code>regex_iterator</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.12.1.1</td>
+ <td><code>regex_iterator</code> constructors</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.12.1.2</td>
+ <td><code>regex_iterator</code> comparisons</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.12.1.3</td>
+ <td><code>regex_iterator</code> dereference</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.12.1.4</td>
+ <td><code>regex_iterator</code> increment</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.12.2</td>
+ <td>Class template <code>regex_token_iterator</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.12.2.1</td>
+ <td><code>regex_token_iterator</code> constructors</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.12.2.2</td>
+ <td><code>regex_token_iterator</code> comparisons</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.12.2.3</td>
+ <td><code>regex_token_iterator</code> dereference</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.12.2.4</td>
+ <td><code>regex_token_iterator</code> increment</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>28.13</td>
+ <td>Modified ECMAScript regular expression grammar</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td><b>C</b></td>
+ <td colspan="5"><b>C compatibility</b></td>
+ </tr>
+ <tr>
+ <td>C2.1</td>
+ <td>Additions to header <code><complex></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.1.1</td>
+ <td>Synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.1.2</td>
+ <td>Function <code>acos</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.1.3</td>
+ <td>Function <code>asin</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.1.4</td>
+ <td>Function <code>atan</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.1.5</td>
+ <td>Function <code>acosh</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.1.6</td>
+ <td>Function <code>asinh</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.1.7</td>
+ <td>Function <code>atanh</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.1.8</td>
+ <td>Function <code>fabs</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.1.9</td>
+ <td>Additional Overloads</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.2</td>
+ <td>Header <code><ccomplex></code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td>DR 551</td>
+ </tr>
+ <tr>
+ <td>C2.3</td>
+ <td>Header <code><complex.h></code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td>DR 551</td>
+ </tr>
+ <tr>
+ <td>C2.4</td>
+ <td>Additions to header <code><cctype></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.4.1</td>
+ <td>Synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.4.2</td>
+ <td>Function <code>isblank</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.5</td>
+ <td>Additions to header <code><ctype.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.6</td>
+ <td>Header <code><cfenv></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.6.1</td>
+ <td>Synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.6.2</td>
+ <td>Definitions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.7</td>
+ <td>Header <code><fenv.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.8</td>
+ <td>Additions to header <code><cfloat></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.9</td>
+ <td>Additions to header <code><float.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.10</td>
+ <td>Additions to header <code><ios></code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.10.1</td>
+ <td>Synopsis</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.10.2</td>
+ <td>Function <code>hexfloat</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.11</td>
+ <td>Header <code><cinttypes></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.11.1</td>
+ <td>Synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td>DR 557</td>
+ </tr>
+ <tr>
+ <td>C2.11.2</td>
+ <td>Definitions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.12</td>
+ <td>Header <code><inttypes.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.13</td>
+ <td>Additions to header <code><climits></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.14</td>
+ <td>Additions to header <code><limits.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.15</td>
+ <td>Additions to header <code><locale></code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.16</td>
+ <td>Additions to header <code><cmath></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.16.1</td>
+ <td>Synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.16.2</td>
+ <td>Definitions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.16.3</td>
+ <td>Function template definitions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.16.4</td>
+ <td>Additional overloads</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td>DR 568; DR 550</td>
+ </tr>
+ <tr>
+ <td>C2.17</td>
+ <td>Additions to header <code><math.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.18</td>
+ <td>Additions to header <code><cstdarg></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.19</td>
+ <td>Additions to header <code><stdarg.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.20</td>
+ <td>The header <code><cstdbool></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.21</td>
+ <td>The header <code><stdbool.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.22</td>
+ <td>The header <code><cstdint></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.22.1</td>
+ <td>Synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.22.2</td>
+ <td>Definitions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.23</td>
+ <td>The header <code><stdint.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.24</td>
+ <td>Additions to header <code><cstdio></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.24.1</td>
+ <td>Synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.24.2</td>
+ <td>Definitions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.24.3</td>
+ <td>Additional format specifiers</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td>C library responsibility</td>
+ </tr>
+ <tr>
+ <td>C2.24.4</td>
+ <td>Additions to header <code><stdio.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.25</td>
+ <td>Additions to header <code><cstdlib></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.25.1</td>
+ <td>Synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.25.2</td>
+ <td>Definitions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.25.3</td>
+ <td>Function <code>abs</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.25.4</td>
+ <td>Function <code>div</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.26</td>
+ <td>Additions to header <code><stdlib.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.27</td>
+ <td>Header <code><ctgmath></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td>DR 551</td>
+ </tr>
+ <tr>
+ <td>C2.28</td>
+ <td>Header <code><tgmath.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td>DR 551</td>
+ </tr>
+ <tr>
+ <td>C2.29</td>
+ <td>Additions to header <code><ctime></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td>C library responsibility</td>
+ </tr>
+ <tr>
+ <td>C2.30</td>
+ <td>Additions to header <code><cwchar></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.30.1</td>
+ <td>Synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.30.2</td>
+ <td>Definitions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.30.3</td>
+ <td>Additional wide format specifiers</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td>C library responsibility</td>
+ </tr>
+ <tr>
+ <td>C2.31</td>
+ <td>Additions to header <code><wchar.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.32</td>
+ <td>Additions to header <code><cwctype></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.32.1</td>
+ <td>Synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.32.2</td>
+ <td>Function <code>iswblank</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>C2.33</td>
+ <td>Additions to header <code><wctype.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td><b>D</b></td>
+ <td colspan="5"><b>Compatibility Features</b></td>
+ </tr>
+ <tr>
+ <td>D.6</td>
+ <td>Old iostream members</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>D.8</td>
+ <td>Binders</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td><a href="http://gcc.gnu.org/PR33911">33911</a></td>
+ </tr>
+ <tr>
+ <td>D.9</td>
+ <td>Class template <code>auto_ptr</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td><a href="http://gcc.gnu.org/PR33911">33911</a></td>
+ </tr>
+
+ </tbody>
+</table>
+
+<h3>Footnotes</h3>
+
+<ol>
+
+ <li>
+ <a name="1"/>
+ The shared_ptr implementation uses some code from the
+ <a href="http://www.boost.org/libs/smart_ptr/shared_ptr.htm">Boost
+ shared_ptr</a> library.
+ </li>
+
+</ol>
+
+<p>
+Please send FSF & GNU inquiries & questions to
+<a href="mailto:gnu@gnu.org">gnu@gnu.org</a>.
+There are also <a href="http://www.gnu.org/home.html#ContactInfo">other ways
+to contact</a> the FSF.
+</p>
+
+<p>
+These pages are maintained by
+<a href="http://gcc.gnu.org/about.html">the GCC team</a>.
+</p>
+
+<address>
+For questions related to the use of GCC, please consult these web
+pages and the <a href="http://gcc.gnu.org/onlinedocs/">GCC manuals</a>. If
+that fails, the <a href="mailto:gcc-help@gcc.gnu.org">gcc-help@gcc.gnu.org</a>
+mailing list might help.<br />
+Please send comments on these web pages and the development of GCC to our
+developer mailing list at <a href="mailto:gcc@gnu.org">gcc@gnu.org</a>
+or <a href="mailto:gcc@gcc.gnu.org">gcc@gcc.gnu.org</a>. All of our lists
+have <a href="http://gcc.gnu.org/lists.html">public archives</a>.
+</address>
+
+<p>
+Copyright (C) Free Software Foundation, Inc.,
+51 Franklin St, Fifth Floor, Boston, MA 02110, USA.
+</p>
+<p>
+Verbatim copying and distribution of this entire article is
+permitted in any medium, provided this notice is preserved.
+</p>
+
+<table width="100%" border="0">
+<tr>
+ <td>
+ <!-- IGNORE DIFF -->Last modified 2007-10-30
+ </td>
+ <td align="right" valign="bottom">
+ <a href="http://validator.w3.org/check/referer">
+ <img src="http://www.w3.org/Icons/valid-xhtml10"
+ alt="Valid XHTML 1.0" border="0" width="88" height="31" />
+ </a>
+ </td>
+</tr>
+</table>
+
+</body>
+</html>
--- /dev/null
+<pre>
+
+ Completion Checklist for the Standard C++ Library
+ Updated: 2003-04-25
+
+ Status Code Legend:
+ M - Missing
+ S - Present as stub.
+ X - Partially implemented, or buggy.
+ T - Implemented, pending test/inspection.
+ V - Verified to pass all available test suites.
+ Q - Qualified by inspection for non-testable correctness.
+ P - Portability verified.
+ C - Certified.
+
+ Lexical notes:
+ Only status codes appear in column 0. Notes relating to conformance
+ issues appear [in brackets].
+
+ Note that this checklist does not (yet) include all emendations
+ recommended by the ISO Library Working Group:
+ http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/lwg-toc.html
+
+ Detailed explanation of status codes:
+
+ M - Missing: The name is not visible to programs that include
+ the specified header, either at compile or link stage.
+
+ S - Present as stub: A program can use the name, but no implementation
+ is provided. Programs that use the name link correctly, but
+ cannot usefully be run.
+
+ X - Partially implemented, or buggy: Some implementation has been
+ provided, but it is known or believed not to conform fully.
+ It may have an incorrect base class, wrong namespace, wrong
+ storage class, or simply not fully implement requirements.
+ However, it may be sufficiently usable to help test other
+ components.
+
+ T - Implemented, pending test/inspection: Implementation believed
+ to be complete, and informal testing suggests it is ready for
+ formal verification.
+
+ V - Verified, passes all test suites: Verified to satisfy all
+ generically testable conformance requirements.
+
+ Q - Qualified by inspection for non-testable correctness:
+ Inspected, "implementation-defined" documentation accepted,
+ local usability criteria satisfied, formally inspected for
+ other untestable conformance. (Untestable requirements
+ include exception-safety, thread-safety, worst-case
+ complexity, memory cleanliness, usefulness.)
+
+ P - Portability verified: Qualified on all primary target platforms.
+
+ C - Certified: Formally certified to have passed all tests,
+ inspections, qualifications; approved under "signing authority"
+ to be used to satisfy contractual guarantees.
+
+ ----------------------------------------------------------------------
+ <algorithm> <iomanip> <list> <ostream> <streambuf>
+ <bitset> <ios> <locale> <queue> <string>
+ <complex> <iosfwd> <map> <set> <typeinfo>
+X <deque> <iostream> <memory> <sstream> <utility>
+ <exception> <istream> <new> <stack> <valarray>
+ <fstream> <iterator> <numeric> <stdexcept> <vector>
+ <functional> <limits>
+
+ [C header names must be in std:: to qualify. Related to shadow/ dir.]
+ <cassert> <ciso646> <csetjmp> <cstdio> <ctime>
+ <cctype> <climits> <csignal> <cstdlib> <cwchar>
+X <cerrno> <clocale> <cstdarg> <cstring> <cwctype>
+ <cfloat> <cmath> <cstddef>
+
+ Macro:
+X errno, declared or defined in <cerrno>.
+
+ Macro fn:
+X setjmp(jmp_buf), declared or defined in <csetjmp>
+X va_end(va_list), declared or defined in <cstdarg>
+
+ Types:
+X clock_t, div_t, FILE, fpos_t, lconv, ldiv_t, mbstate_t,
+X ptrdiff_t, sig_atomic_t, size_t, time_t, tm, va_list,
+X wctrans_t, wctype_t, and wint_t.
+
+ 1 Which of the functions in the C++ Standard Library are not reentrant
+ subroutines is implementation-defined.
+
+ 18.1 Types [lib.support.types]
+X <cstddef>
+X NULL
+X offsetof
+X ptrdiff_t
+X size_t
+
+ 18.2 Implementation properties [lib.support.limits]
+
+ <limits>, <climits>, and <cfloat>
+
+ 18.2.1 Numeric limits [lib.limits]
+
+X template<class T> class numeric_limits;
+
+T enum float_round_style;
+T enum float_denorm_style;
+
+T template<> class numeric_limits<bool>;
+
+T template<> class numeric_limits<char>;
+T template<> class numeric_limits<signed char>;
+T template<> class numeric_limits<unsigned char>;
+T template<> class numeric_limits<wchar_t>;
+
+T template<> class numeric_limits<short>;
+T template<> class numeric_limits<int>;
+T template<> class numeric_limits<long>;
+T template<> class numeric_limits<unsigned short>;
+T template<> class numeric_limits<unsigned int>;
+T template<> class numeric_limits<unsigned long>;
+
+X template<> class numeric_limits<float>;
+X template<> class numeric_limits<double>;
+X template<> class numeric_limits<long double>;
+
+ 18.2.1.1 Template class numeric_limits [lib.numeric.limits]
+T template<class T> class numeric_limits {
+ public:
+T static const bool is_specialized = false;
+T static T min() throw();
+T static T max() throw();
+T static const int digits = 0;
+T static const int digits10 = 0;
+T static const bool is_signed = false;
+T static const bool is_integer = false;
+T static const bool is_exact = false;
+T static const int radix = 0;
+T static T epsilon() throw();
+T static T round_error() throw();
+
+T static const int min_exponent = 0;
+T static const int min_exponent10 = 0;
+T static const int max_exponent = 0;
+T static const int max_exponent10 = 0;
+
+T static const bool has_infinity = false;
+T static const bool has_quiet_NaN = false;
+T static const bool has_signaling_NaN = false;
+T static const float_denorm_style has_denorm = denorm_absent;
+T static const bool has_denorm_loss = false;
+T static T infinity() throw();
+T static T quiet_NaN() throw();
+T static T signaling_NaN() throw();
+T static T denorm_min() throw();
+
+T static const bool is_iec559 = false;
+T static const bool is_bounded = false;
+T static const bool is_modulo = false;
+
+T static const bool traps = false;
+T static const bool tinyness_before = false;
+T static const float_round_style round_style = round_toward_zero;
+ };
+
+ 18.2.1.3 Type float_round_style [lib.round.style]
+
+T enum float_round_style {
+T round_indeterminate = -1,
+T round_toward_zero = 0,
+T round_to_nearest = 1,
+T round_toward_infinity = 2,
+T round_toward_neg_infinity = 3
+ };
+
+ 18.2.1.4 Type float_denorm_style [lib.denorm.style]
+
+T enum float_denorm_style {
+T denorm_indeterminate = -1;
+T denorm_absent = 0;
+T denorm present = 1;
+ };
+
+ 18.2.1.5 numeric_limits specializations [lib.numeric.special]
+
+ [Note: see Note at 18.2.1. ]
+
+ 18.2.2 C Library [lib.c.limits]
+
+ 1 Header <climits> (Table 3):
+ CHAR_BIT INT_MAX LONG_MIN SCHAR_MIN UCHAR_MAX USHRT_MAX
+X CHAR_MAX INT_MIN MB_LEN_MAX SHRT_MAX UINT_MAX
+ CHAR_MIN LONG_MAX SCHAR_MAX SHRT_MIN ULONG_MAX
+
+ 3 Header <cfloat> (Table 4):
+
+ DBL_DIG DBL_MIN_EXP FLT_MIN_10_EXP LDBL_MAX_10_EXP
+ DBL_EPSILON FLT_DIG FLT_MIN_EXP LDBL_MAX_EXP
+ DBL_MANT_DIG FLT_EPSILON FLT_RADIX LDBL_MIN
+X DBL_MAX FLT_MANT_DIG FLT_ROUNDS LDBL_MIN_10_EXP
+ DBL_MAX_10_EXP FLT_MAX LDBL_DIG LDBL_MIN_EXP
+ DBL_MAX_EXP FLT_MAX_10_EXP LDBL_EPSILON
+ DBL_MIN FLT_MAX_EXP LDBL_MANT_DIG
+ DBL_MIN_10_EXP FLT_MIN LDBL_MAX
+
+
+ 1 Header <cstdlib> (partial), Table 5:
+X EXIT_FAILURE EXIT_SUCCESS
+ abort atexit exit
+
+S abort(void)
+S extern "C" int atexit(void (*f)(void))
+S extern "C++" int atexit(void (*f)(void))
+S exit(int status)
+
+ 18.4 Dynamic memory management [lib.support.dynamic]
+
+ Header <new> synopsis
+
+T class bad_alloc;
+T struct nothrow_t {};
+T extern const nothrow_t nothrow;
+T typedef void (*new_handler)();
+T new_handler set_new_handler(new_handler new_p) throw();
+
+T void* operator new(std::size_t size) throw(std::bad_alloc);
+T void* operator new(std::size_t size, const std::nothrow_t&) throw();
+T void operator delete(void* ptr) throw();
+T void operator delete(void* ptr, const std::nothrow_t&) throw();
+T void* operator new[](std::size_t size) throw(std::bad_alloc);
+T void* operator new[](std::size_t size, const std::nothrow_t&) throw();
+T void operator delete[](void* ptr) throw();
+T void operator delete[](void* ptr, const std::nothrow_t&) throw();
+T void* operator new (std::size_t size, void* ptr) throw();
+T void* operator new[](std::size_t size, void* ptr) throw();
+T void operator delete (void* ptr, void*) throw();
+T void operator delete[](void* ptr, void*) throw();
+
+ 18.4.2.1 Class bad_alloc [lib.bad.alloc]
+
+T class bad_alloc : public exception {
+ public:
+T bad_alloc() throw();
+T bad_alloc(const bad_alloc&) throw();
+T bad_alloc& operator=(const bad_alloc&) throw();
+T virtual ~bad_alloc() throw();
+T virtual const char* what() const throw();
+
+
+
+T new_handler set_new_handler(new_handler new_p) throw();
+
+
+ Header <typeinfo> synopsis
+
+T class type_info;
+T class bad_cast;
+T class bad_typeid;
+
+ 18.5.1 - Class type_info [lib.type.info]
+
+T class type_info {
+ public:
+T virtual ~type_info();
+T bool operator==(const type_info& rhs) const;
+T bool operator!=(const type_info& rhs) const;
+T bool before(const type_info& rhs) const;
+T const char* name() const;
+ private:
+T type_info(const type_info& rhs);
+T type_info& operator=(const type_info& rhs);
+ };
+
+ 18.5.2 - Class bad_cast [lib.bad.cast]
+
+T bad_cast() throw();
+T virtual const char* bad_cast::what() const throw();
+
+ 18.5.3 Class bad_typeid [lib.bad.typeid]
+
+T class bad_typeid : public exception {
+ public:
+T bad_typeid() throw();
+T bad_typeid(const bad_typeid&) throw();
+T bad_typeid& operator=(const bad_typeid&) throw();
+T virtual ~bad_typeid() throw();
+T virtual const char* what() const throw();
+ };
+
+ 18.6 Exception handling [lib.support.exception]
+
+T Header <exception> synopsis
+
+T class exception;
+T class bad_exception;
+
+T typedef void (*unexpected_handler)();
+T unexpected_handler set_unexpected(unexpected_handler f) throw();
+T void unexpected();
+T typedef void (*terminate_handler)();
+T terminate_handler set_terminate(terminate_handler f) throw();
+T void terminate();
+T bool uncaught_exception();
+
+ 18.6.1 Class exception [lib.exception]
+
+T class exception {
+ public:
+T exception() throw();
+T exception(const exception&) throw();
+T exception& operator=(const exception&) throw();
+T virtual ~exception() throw();
+T virtual const char* what() const throw();
+ };
+
+ 18.6.2.1 Class bad_exception [lib.bad.exception]
+T class bad_exception : public exception {
+ public:
+T bad_exception() throw();
+T bad_exception(const bad_exception&) throw();
+T bad_exception& operator=(const bad_exception&) throw();
+T virtual ~bad_exception() throw();
+T virtual const char* what() const throw();
+ };
+
+ 18.7 Other runtime support [lib.support.runtime]
+
+ 1 Headers <cstdarg> (variable arguments), <csetjmp> (nonlocal jumps),
+ <ctime> (system clock clock(), time()), <csignal> (signal handling),
+ and <cstdlib> (runtime environment getenv(), system()).
+
+ Table 6--Header <cstdarg> synopsis
+ Macros: va_arg va_end va_start
+X Type: va_list
+
+ Table 7--Header <csetjmp> synopsis
+
+ Macro: setjmp |
+X Type: jmp_buf
+ Function: longjmp
+
+ Table 8--Header <ctime> synopsis
+
+ Macros: CLOCKS_PER_SEC
+X Types: clock_t
+ Functions: clock
+
+ Table 9--Header <csignal> synopsis
+
+X Macros: SIGABRT SIGILL SIGSEGV SIG_DFL
+ SIG_IGN SIGFPE SIGINT SIGTERM SIG_ERR
+ Type: sig_atomic_t
+ Functions: raise signal
+
+ Table 10--Header <cstdlib> synopsis
+
+X Functions: getenv system
+
+ 19.1 Exception classes [lib.std.exceptions]
+
+ Header <stdexcept> synopsis
+
+T class logic_error;
+T class domain_error;
+T class invalid_argument;
+T class length_error;
+T class out_of_range;
+T class runtime_error;
+T class range_error;
+T class overflow_error;
+T class underflow_error;
+
+ 19.1.1 Class logic_error [lib.logic.error]
+T class logic_error : public exception {
+ public:
+T explicit logic_error(const string& what_arg);
+ };
+
+ 19.1.2 Class domain_error [lib.domain.error]
+
+T class domain_error : public logic_error {
+ public:
+T explicit domain_error(const string& what_arg);
+ };
+
+ 19.1.3 Class invalid_argument [lib.invalid.argument]
+
+T class invalid_argument : public logic_error {
+ public:
+T explicit invalid_argument(const string& what_arg);
+ };
+
+ 19.1.4 Class length_error [lib.length.error]
+
+T class length_error : public logic_error {
+ public:
+T explicit length_error(const string& what_arg);
+ };
+
+ 19.1.5 Class out_of_range [lib.out.of.range]
+
+T class out_of_range : public logic_error {
+ public:
+T explicit out_of_range(const string& what_arg);
+ };
+
+
+ 19.1.6 Class runtime_error [lib.runtime.error]
+
+T class runtime_error : public exception {
+ public:
+T explicit runtime_error(const string& what_arg);
+ };
+
+
+ 19.1.7 Class range_error [lib.range.error]
+
+T class range_error : public runtime_error {
+ public:
+T explicit range_error(const string& what_arg);
+ };
+
+ 19.1.8 Class overflow_error [lib.overflow.error]
+
+T class overflow_error : public runtime_error {
+ public:
+T explicit overflow_error(const string& what_arg);
+ };
+
+
+ 19.1.9 Class underflow_error [lib.underflow.error]
+
+T class underflow_error : public runtime_error {
+ public:
+T explicit underflow_error(const string& what_arg);
+ };
+
+
+ 19.2 Assertions [lib.assertions]
+
+ Table 2--Header <cassert> synopsis
+
+X Macro: assert
+
+ 19.3 Error numbers [lib.errno]
+
+ Table 3--Header <cerrno> synopsis
+
+X |Macros: EDOM ERANGE errno |
+
+
+ 20.2 Utility components [lib.utility]
+
+ Header <utility> synopsis
+
+ // _lib.operators_, operators:
+T namespace rel_ops {
+T template<class T> bool operator!=(const T&, const T&);
+T template<class T> bool operator> (const T&, const T&);
+T template<class T> bool operator<=(const T&, const T&);
+T template<class T> bool operator>=(const T&, const T&);
+ }
+ // _lib.pairs_, pairs:
+T template <class T1, class T2> struct pair;
+T template <class T1, class T2>
+ bool operator==(const pair<T1,T2>&, const pair<T1,T2>&);
+T template <class T1, class T2>
+ bool operator< (const pair<T1,T2>&, const pair<T1,T2>&);
+T template <class T1, class T2>
+ bool operator!=(const pair<T1,T2>&, const pair<T1,T2>&);
+T template <class T1, class T2>
+ bool operator> (const pair<T1,T2>&, const pair<T1,T2>&);
+T template <class T1, class T2>
+ bool operator>=(const pair<T1,T2>&, const pair<T1,T2>&);
+T template <class T1, class T2>
+ bool operator<=(const pair<T1,T2>&, const pair<T1,T2>&);
+T template <class T1, class T2> pair<T1,T2> make_pair(const T1&, const T2&);
+
+
+ 20.2.2 Pairs [lib.pairs]
+
+T template <class T1, class T2>
+ struct pair {
+T typedef T1 first_type;
+T typedef T2 second_type;
+
+T T1 first;
+T T2 second;
+T pair();
+T pair(const T1& x, const T2& y);
+T template<class U, class V> pair(const pair<U, V> &p);
+ };
+
+ 20.3 Function objects [lib.function.objects]
+
+ Header <functional> synopsis
+
+ // _lib.base_, base:
+V template <class Arg, class Result> struct unary_function;
+V template <class Arg1, class Arg2, class Result> struct binary_function;
+
+ // _lib.arithmetic.operations_, arithmetic operations:
+V template <class T> struct plus;
+V template <class T> struct minus;
+V template <class T> struct multiplies;
+V template <class T> struct divides;
+V template <class T> struct modulus;
+V template <class T> struct negate;
+ // _lib.comparisons_, comparisons:
+V template <class T> struct equal_to;
+V template <class T> struct not_equal_to;
+V template <class T> struct greater;
+V template <class T> struct less;
+V template <class T> struct greater_equal;
+V template <class T> struct less_equal;
+ // _lib.logical.operations_, logical operations:
+V template <class T> struct logical_and;
+V template <class T> struct logical_or;
+V template <class T> struct logical_not;
+ // _lib.negators_, negators:
+ template <class Predicate> struct unary_negate;
+V template <class Predicate>
+ unary_negate<Predicate> not1(const Predicate&);
+V template <class Predicate> struct binary_negate;
+V template <class Predicate>
+ binary_negate<Predicate> not2(const Predicate&);
+ // _lib.binders_, binders:
+V template <class Operation> class binder1st;
+V template <class Operation, class T>
+ binder1st<Operation> bind1st(const Operation&, const T&);
+V template <class Operation> class binder2nd;
+V template <class Operation, class T>
+ binder2nd<Operation> bind2nd(const Operation&, const T&);
+ // _lib.function.pointer.adaptors_, adaptors:
+V template <class Arg, class Result> class pointer_to_unary_function;
+V template <class Arg, class Result>
+ pointer_to_unary_function<Arg,Result> ptr_fun(Result (*)(Arg));
+V template <class Arg1, class Arg2, class Result>
+ class pointer_to_binary_function;
+V template <class Arg1, class Arg2, class Result>
+ pointer_to_binary_function<Arg1,Arg2,Result>
+ ptr_fun(Result (*)(Arg1,Arg2));
+
+ // _lib.member.pointer.adaptors_, adaptors:
+V template<class S, class T> class mem_fun_t;
+V template<class S, class T, class A> class mem_fun1_t;
+V template<class S, class T>
+ mem_fun_t<S,T> mem_fun(S (T::*f)());
+V template<class S, class T, class A>
+ mem_fun1_t<S,T,A> mem_fun(S (T::*f)(A));
+V template<class S, class T> class mem_fun_ref_t;
+V template<class S, class T, class A> class mem_fun1_ref_t;
+V template<class S, class T>
+ mem_fun_ref_t<S,T> mem_fun_ref(S (T::*f)());
+V template<class S, class T, class A>
+ mem_fun1_ref_t<S,T,A> mem_fun_ref(S (T::*f)(A));
+
+V template <class S, class T> class const_mem_fun_t;
+V template <class S, class T, class A> class const_mem_fun1_t;
+V template <class S, class T>
+ const_mem_fun_t<S,T> mem_fun(S (T::*f)() const);
+V template <class S, class T, class A>
+ const_mem_fun1_t<S,T,A> mem_fun(S (T::*f)(A) const);
+V template <class S, class T> class const_mem_fun_ref_t;
+V template <class S, class T, class A> class const_mem_fun1_ref_t;
+V template <class S, class T>
+ const_mem_fun_ref_t<S,T> mem_fun_ref(S (T::*f)() const);
+V template <class S, class T, class A>
+ const_mem_fun1_ref_t<S,T,A> mem_fun_ref(S (T::*f)(A) const);
+ }
+
+ 20.3.1 Base [lib.base]
+
+V template <class Arg, class Result>
+ struct unary_function {
+V typedef Arg argument_type;
+V typedef Result result_type;
+ };
+V template <class Arg1, class Arg2, class Result>
+ struct binary_function {
+V typedef Arg1 first_argument_type;
+V typedef Arg2 second_argument_type;
+V typedef Result result_type;
+ };
+
+ 20.3.2 Arithmetic operations [lib.arithmetic.operations]
+
+T template <class T> struct plus : binary_function<T,T,T> {
+V T operator()(const T& x, const T& y) const;
+ };
+
+T template <class T> struct minus : binary_function<T,T,T> {
+V T operator()(const T& x, const T& y) const;
+ };
+
+T template <class T> struct multiplies : binary_function<T,T,T> {
+V T operator()(const T& x, const T& y) const;
+ };
+
+T template <class T> struct divides : binary_function<T,T,T> {
+V T operator()(const T& x, const T& y) const;
+ };
+
+T template <class T> struct modulus : binary_function<T,T,T> {
+V T operator()(const T& x, const T& y) const;
+ };
+
+T template <class T> struct negate : unary_function<T,T> {
+V T operator()(const T& x) const;
+ };
+
+ 20.3.3 Comparisons [lib.comparisons]
+
+T template <class T> struct equal_to : binary_function<T,T,bool> {
+V bool operator()(const T& x, const T& y) const;
+ };
+
+T template <class T> struct not_equal_to : binary_function<T,T,bool> {
+V bool operator()(const T& x, const T& y) const;
+ };
+
+T template <class T> struct greater : binary_function<T,T,bool> {
+V bool operator()(const T& x, const T& y) const;
+ };
+
+T template <class T> struct less : binary_function<T,T,bool> {
+V bool operator()(const T& x, const T& y) const;
+ };
+
+T template <class T> struct greater_equal : binary_function<T,T,bool> {
+V bool operator()(const T& x, const T& y) const;
+ };
+
+T template <class T> struct less_equal : binary_function<T,T,bool> {
+V bool operator()(const T& x, const T& y) const;
+ };
+
+ 20.3.4 Logical operations [lib.logical.operations]
+
+T template <class T> struct logical_and : binary_function<T,T,bool> {
+V bool operator()(const T& x, const T& y) const;
+ };
+
+T template <class T> struct logical_or : binary_function<T,T,bool> {
+V bool operator()(const T& x, const T& y) const;
+ };
+
+T template <class T> struct logical_not : unary_function<T,bool> {
+V bool operator()(const T& x) const;
+ };
+
+ 20.3.5 Negators [lib.negators]
+
+T template <class Predicate>
+ class unary_negate
+ : public unary_function<typename Predicate::argument_type,bool> {
+ public:
+T explicit unary_negate(const Predicate& pred);
+V bool operator()(const typename Predicate::argument_type& x) const;
+ };
+
+T template <class Predicate>
+ class binary_negate
+ : public binary_function<typename Predicate::first_argument_type,
+ typename Predicate::second_argument_type, bool> {
+ public:
+T explicit binary_negate(const Predicate& pred);
+V bool operator()(const typename Predicate::first_argument_type& x,
+ const typename Predicate::second_argument_type& y) const;
+ };
+
+
+ 20.3.6 Binders [lib.binders]
+
+ 20.3.6.1 Template class binder1st [lib.binder.1st]
+T template <class Operation>
+ class binder1st
+ : public unary_function<typename Operation::second_argument_type,
+ typename Operation::result_type> {
+ protected:
+T Operation op;
+T typename Operation::first_argument_type value;
+ public:
+V binder1st(const Operation& x,
+ const typename Operation::first_argument_type& y);
+V typename Operation::result_type
+ operator()(const typename Operation::second_argument_type& x) const;
+ };
+
+ 20.3.6.2 bind1st [lib.bind.1st]
+
+V template <class Operation, class T>
+ binder1st<Operation> bind1st(const Operation& op, const T& x);
+
+ 20.3.6.3 Template class binder2nd [lib.binder.2nd]
+T template <class Operation>
+ class binder2nd
+ : public unary_function<typename Operation::first_argument_type,
+ typename Operation::result_type> {
+ protected:
+T Operation op;
+T typename Operation::second_argument_type value;
+ public:
+V binder2nd(const Operation& x,
+ const typename Operation::second_argument_type& y);
+V typename Operation::result_type
+ operator()(const typename Operation::first_argument_type& x) const;
+ };
+
+ 20.3.6.4 bind2nd [lib.bind.2nd]
+
+T template <class Operation, class T>
+ binder2nd<Operation> bind2nd(const Operation& op, const T& x);
+
+
+ 20.3.7 Adaptors for pointers to [lib.function.pointer.adaptors]
+ functions
+
+ 1 To allow pointers to (unary and binary) functions to work with func-
+ tion adaptors the library provides:
+
+T template <class Arg, class Result>
+ class pointer_to_unary_function : public unary_function<Arg, Result> {
+ public:
+T explicit pointer_to_unary_function(Result (*f)(Arg));
+V Result operator()(Arg x) const;
+ };
+
+T template <class Arg, class Result>
+ pointer_to_unary_function<Arg, Result> ptr_fun(Result (*f)(Arg));
+
+T template <class Arg1, class Arg2, class Result>
+ class pointer_to_binary_function :
+ public binary_function<Arg1,Arg2,Result> {
+ public:
+T explicit pointer_to_binary_function(Result (*f)(Arg1, Arg2));
+V Result operator()(Arg1 x, Arg2 y) const;
+ };
+
+
+ 20.3.8 Adaptors for pointers to [lib.member.pointer.adaptors]
+ members
+
+T template <class S, class T> class mem_fun_t
+ : public unary_function<T*, S> {
+ public:
+T explicit mem_fun_t(S (T::*p)());
+V S operator()(T* p) const;
+ };
+
+T template <class S, class T, class A> class mem_fun1_t
+ : public binary_function<T*, A, S> {
+ public:
+T explicit mem_fun1_t(S (T::*p)(A));
+V S operator()(T* p, A x) const;
+ };
+
+V template<class S, class T> mem_fun_t<S,T>
+ mem_fun(S (T::*f)());
+V template<class S, class T, class A> mem_fun1_t<S,T,A>
+ mem_fun(S (T::*f)(A));
+
+T template <class S, class T> class mem_fun_ref_t
+ : public unary_function<T, S> {
+ public:
+T explicit mem_fun_ref_t(S (T::*p)());
+V S operator()(T& p) const;
+ };
+
+T template <class S, class T, class A> class mem_fun1_ref_t
+ : public binary_function<T, A, S> {
+ public:
+T explicit mem_fun1_ref_t(S (T::*p)(A));
+V S operator()(T& p, A x) const;
+ };
+
+T template<class S, class T> mem_fun_ref_t<S,T>
+ mem_fun_ref(S (T::*f)());
+
+T template<class S, class T, class A> mem_fun1_ref_t<S,T,A>
+ mem_fun_ref(S (T::*f)(A));
+
+T template <class S, class T> class const_mem_fun_t
+ : public unary_function<T*, S> {
+ public:
+T explicit const_mem_fun_t(S (T::*p)() const);
+V S operator()(const T* p) const;
+ };
+
+T template <class S, class T, class A> class const_mem_fun1_t
+ : public binary_function<T*, A, S> {
+ public:
+T explicit const mem_fun1_t(S (T::*p)(A) const);
+V S operator()(const T* p, A x) const;
+ };
+
+V template<class S, class T> const_mem_fun_t<S,T>
+ mem_fun(S (T::*f)() const);
+V template<class S, class T, class A> const_mem_fun1_t<S,T,A>
+ mem_fun(S (T::*f)(A) const);
+
+T template <class S, class T> class const_mem_fun_ref_t
+ : public unary_function<T, S> {
+ public:
+T explicit const_mem_fun_ref_t(S (T::*p)() const);
+V S operator()(const T& p) const;
+ };
+
+T template <class S, class T, class A> class const_mem_fun1_ref_t
+ : public binary_function<T, A, S> {
+ public:
+T explicit const_mem_fun1_ref_t(S (T::*p)(A) const);
+V S operator()(const T& p, A x) const;
+ };
+
+T template<class S, class T> const_mem_fun_ref_t<S,T>
+ mem_fun_ref(S (T::*f)() const);
+
+T template<class S, class T, class A> const_mem_fun1_ref_t<S,T,A>
+ mem_fun_ref(S (T::*f)(A) const);
+
+ 20.4 Memory [lib.memory]
+
+ Header <memory> synopsis
+
+ // _lib.default.allocator_, the default allocator:
+T template <class T> class allocator;
+T template <> class allocator<void>;
+T template <class T, class U>
+ bool operator==(const allocator<T>&, const allocator<U>&) throw();
+T template <class T, class U>
+ bool operator!=(const allocator<T>&, const allocator<U>&) throw();
+ // _lib.storage.iterator_, raw storage iterator:
+T template <class OutputIterator, class T> class raw_storage_iterator;
+ // _lib.temporary.buffer_, temporary buffers:
+T template <class T>
+ pair<T*,ptrdiff_t> get_temporary_buffer(ptrdiff_t n);
+T template <class T>
+ void return_temporary_buffer(T* p);
+ // _lib.specialized.algorithms_, specialized algorithms:
+T template <class InputIterator, class ForwardIterator>
+ ForwardIterator
+ uninitialized_copy(InputIterator first, InputIterator last,
+ ForwardIterator result);
+T template <class ForwardIterator, class T>
+ void uninitialized_fill(ForwardIterator first, ForwardIterator last,
+ const T& x);
+T template <class ForwardIterator, class Size, class T>
+ void uninitialized_fill_n(ForwardIterator first, Size n, const T& x);
+ // _lib.auto.ptr_, pointers:
+X template<class X> class auto_ptr;
+ }
+
+ 20.4.1 The default allocator [lib.default.allocator]
+
+T template <class T> class allocator;
+ // specialize for void:
+T template <> class allocator<void> {
+ public:
+T typedef void* pointer;
+T typedef const void* const_pointer;
+ // reference-to-void members are impossible.
+T typedef void value_type;
+T template <class U> struct rebind { typedef allocator<U> other; };
+ };
+
+T template <class T> class allocator {
+ public:
+T typedef size_t size_type;
+T typedef ptrdiff_t difference_type;
+T typedef T* pointer;
+T typedef const T* const_pointer;
+T typedef T& reference;
+T typedef const T& const_reference;
+T typedef T value_type;
+T template <class U> struct rebind { typedef allocator<U> other; };
+T allocator() throw();
+T allocator(const allocator&) throw();
+T template <class U> allocator(const allocator<U>&) throw();
+T ~allocator() throw();
+T pointer address(reference x) const;
+T const_pointer address(const_reference x) const;
+T pointer allocate(
+ size_type, allocator<void>::const_pointer hint = 0);
+T void deallocate(pointer p, size_type n);
+T size_type max_size() const throw();
+T void construct(pointer p, const T& val);
+T void destroy(pointer p);
+ };
+
+ 20.4.1.2 allocator globals [lib.allocator.globals]
+
+T template <class T1, class T2>
+ bool operator==(const allocator<T1>&, const allocator<T2>&) throw();
+T template <class T1, class T2>
+ bool operator!=(const allocator<T1>&, const allocator<T2>&) throw();
+
+ 20.4.2 Raw storage iterator [lib.storage.iterator]
+
+T template <class OutputIterator, class T>
+ class raw_storage_iterator
+ : public iterator<output_iterator_tag,void,void,void,void> {
+ public:
+T explicit raw_storage_iterator(OutputIterator x);
+T raw_storage_iterator<OutputIterator,T>& operator*();
+T raw_storage_iterator<OutputIterator,T>& operator=(const T& element);
+T raw_storage_iterator<OutputIterator,T>& operator++();
+T raw_storage_iterator<OutputIterator,T> operator++(int);
+ };
+
+ 20.4.3 Temporary buffers [lib.temporary.buffer]
+
+T template <class T>
+ pair<T*, ptrdiff_t> get_temporary_buffer(ptrdiff_t n);
+
+T template <class T> void return_temporary_buffer(T* p);
+
+ 20.4.4 Specialized algorithms [lib.specialized.algorithms]
+
+ 20.4.4.1 uninitialized_copy [lib.uninitialized.copy]
+
+V template <class InputIterator, class ForwardIterator>
+ ForwardIterator
+ uninitialized_copy(InputIterator first, InputIterator last,
+ ForwardIterator result);
+
+ 20.4.4.2 uninitialized_fill [lib.uninitialized.fill]
+
+V template <class ForwardIterator, class T>
+ void uninitialized_fill(ForwardIterator first, ForwardIterator last,
+ const T& x);
+
+ 20.4.4.3 uninitialized_fill_n [lib.uninitialized.fill.n]
+
+V template <class ForwardIterator, class Size, class T>
+ void uninitialized_fill_n(ForwardIterator first, Size n, const T& x);
+
+ 20.4.5 Template class auto_ptr [lib.auto.ptr]
+
+X template<class X> class auto_ptr {
+ template <class Y> struct auto_ptr_ref {};
+ public:
+T typedef X element_type;
+ // _lib.auto.ptr.cons_ construct/copy/destroy:
+T explicit auto_ptr(X* p =0) throw();
+T auto_ptr(auto_ptr&) throw();
+T template<class Y> auto_ptr(auto_ptr<Y>&) throw();
+T auto_ptr& operator=(auto_ptr&) throw();
+T template<class Y> auto_ptr& operator=(auto_ptr<Y>&) throw();
+T ~auto_ptr() throw();
+ // _lib.auto.ptr.members_ members:
+T X& operator*() const throw();
+T X* operator->() const throw();
+T X* get() const throw();
+T X* release() throw();
+T void reset(X* p =0) throw();
+
+ // _lib.auto.ptr.conv_ conversions:
+X auto_ptr(auto_ptr_ref<X>) throw();
+X template<class Y> operator auto_ptr_ref<Y>() throw();
+X template<class Y> operator auto_ptr<Y>() throw();
+ };
+
+ 20.4.6 C Library [lib.c.malloc]
+
+ Table 7--Header <cstdlib> synopsis
+
+X Functions: calloc malloc
+ free realloc
+
+
+ Table 8--Header <cstring> synopsis
+
+X Macro: NULL
+X Type: size_t
+X Functions: memchr memcmp
+X memcpy memmove memset
+
+ Table 9--Header <ctime> synopsis
+
+X Macros: NULL
+X Types: size_t clock_t time_t
+X Struct: tm
+ Functions:
+X asctime clock difftime localtime strftime
+X ctime gmtime mktime time
+
+ 21.1.1 Character traits requirements [lib.char.traits.require]
+
+ 2 The struct template
+T template<class charT> struct char_traits;
+ shall be provided in the header <string> as a basis for explicit spe-
+ cializations.
+
+
+ 21.1.3.1 struct [lib.char.traits.specializations.char]
+ char_traits<char>
+
+T template<>
+ struct char_traits<char> {
+T typedef char char_type;
+T typedef int int_type;
+T typedef streamoff off_type;
+T typedef streampos pos_type;
+T typedef mbstate_t state_type;
+
+T static void assign(char_type& c1, const char_type& c2);
+T static bool eq(const char_type& c1, const char_type& c2);
+T static bool lt(const char_type& c1, const char_type& c2);
+
+T static int compare(const char_type* s1, const char_type* s2, size_t n);
+T static size_t length(const char_type* s);
+T static const char_type* find(const char_type* s, size_t n,
+ const char_type& a);
+T static char_type* move(char_type* s1, const char_type* s2, size_t n);
+T static char_type* copy(char_type* s1, const char_type* s2, size_t n);
+T static char_type* assign(char_type* s, size_t n, char_type a);
+
+T static int_type not_eof(const int_type& c);
+T static char_type to_char_type(const int_type& c);
+T static int_type to_int_type(const char_type& c);
+T static bool eq_int_type(const int_type& c1, const int_type& c2);
+T static int_type eof();
+ };
+
+ 21.1.3.2 struct [lib.char.traits.specializations.wchar.t]
+ char_traits<wchar_t>
+
+V template<>
+ struct char_traits<wchar_t> {
+V typedef wchar_t char_type;
+V typedef wint_t int_type;
+V typedef streamoff off_type;
+V typedef wstreampos pos_type;
+V typedef mbstate_t state_type;
+
+V static void assign(char_type& c1, const char_type& c2);
+V static bool eq(const char_type& c1, const char_type& c2);
+V static bool lt(const char_type& c1, const char_type& c2);
+
+V static int compare(const char_type* s1, const char_type* s2, size_t n);
+V static size_t length(const char_type* s);
+V static const char_type* find(const char_type* s, size_t n,
+ const char_type& a);
+V static char_type* move(char_type* s1, const char_type* s2, size_t n);
+V static char_type* copy(char_type* s1, const char_type* s2, size_t n);
+V static char_type* assign(char_type* s, size_t n, char_type a);
+
+V static int_type not_eof(const int_type& c);
+V static char_type to_char_type(const int_type& c);
+V static int_type to_int_type(const char_type& c);
+V static bool eq_int_type(const int_type& c1, const int_type& c2);
+V static int_type eof();
+ };
+
+ 21.2 String classes [lib.string.classes]
+
+ // _lib.char.traits_, character traits:
+V template<class charT>
+ struct char_traits;
+V template <> struct char_traits<char>;
+V template <> struct char_traits<wchar_t>;
+
+ // _lib.basic.string_, basic_string:
+V template<class charT, class traits = char_traits<charT>,
+ class Allocator = allocator<charT> >
+ class basic_string;
+V template<class charT, class traits, class Allocator>
+ basic_string<charT,traits,Allocator>
+ operator+(const basic_string<charT,traits,Allocator>& lhs,
+ const basic_string<charT,traits,Allocator>& rhs);
+V template<class charT, class traits, class Allocator>
+ basic_string<charT,traits,Allocator>
+ operator+(const charT* lhs,
+ const basic_string<charT,traits,Allocator>& rhs);
+V template<class charT, class traits, class Allocator>
+ basic_string<charT,traits,Allocator>
+ operator+(charT lhs, const basic_string<charT,traits,Allocator>& rhs);
+V template<class charT, class traits, class Allocator>
+ basic_string<charT,traits,Allocator>
+ operator+(const basic_string<charT,traits,Allocator>& lhs,
+ const charT* rhs);
+V template<class charT, class traits, class Allocator>
+ basic_string<charT,traits,Allocator>
+ operator+(const basic_string<charT,traits,Allocator>& lhs, charT rhs);
+
+V template<class charT, class traits, class Allocator>
+ bool operator==(const basic_string<charT,traits,Allocator>& lhs,
+ const basic_string<charT,traits,Allocator>& rhs);
+V template<class charT, class traits, class Allocator>
+ bool operator==(const charT* lhs,
+ const basic_string<charT,traits,Allocator>& rhs);
+V template<class charT, class traits, class Allocator>
+ bool operator==(const basic_string<charT,traits,Allocator>& lhs,
+ const charT* rhs);
+V template<class charT, class traits, class Allocator>
+ bool operator!=(const basic_string<charT,traits,Allocator>& lhs,
+ const basic_string<charT,traits,Allocator>& rhs);
+V template<class charT, class traits, class Allocator>
+ bool operator!=(const charT* lhs,
+ const basic_string<charT,traits,Allocator>& rhs);
+V template<class charT, class traits, class Allocator>
+ bool operator!=(const basic_string<charT,traits,Allocator>& lhs,
+ const charT* rhs);
+V template<class charT, class traits, class Allocator>
+ bool operator< (const basic_string<charT,traits,Allocator>& lhs,
+ const basic_string<charT,traits,Allocator>& rhs);
+V template<class charT, class traits, class Allocator>
+ bool operator< (const basic_string<charT,traits,Allocator>& lhs,
+ const charT* rhs);
+V template<class charT, class traits, class Allocator>
+ bool operator< (const charT* lhs,
+ const basic_string<charT,traits,Allocator>& rhs);
+V template<class charT, class traits, class Allocator>
+ bool operator> (const basic_string<charT,traits,Allocator>& lhs,
+ const basic_string<charT,traits,Allocator>& rhs);
+V template<class charT, class traits, class Allocator>
+ bool operator> (const basic_string<charT,traits,Allocator>& lhs,
+ const charT* rhs);
+V template<class charT, class traits, class Allocator>
+ bool operator> (const charT* lhs,
+ const basic_string<charT,traits,Allocator>& rhs);
+V template<class charT, class traits, class Allocator>
+ bool operator<=(const basic_string<charT,traits,Allocator>& lhs,
+ const basic_string<charT,traits,Allocator>& rhs);
+V template<class charT, class traits, class Allocator>
+ bool operator<=(const basic_string<charT,traits,Allocator>& lhs,
+ const charT* rhs);
+V template<class charT, class traits, class Allocator>
+ bool operator<=(const charT* lhs,
+ const basic_string<charT,traits,Allocator>& rhs);
+V template<class charT, class traits, class Allocator>
+ bool operator>=(const basic_string<charT,traits,Allocator>& lhs,
+ const basic_string<charT,traits,Allocator>& rhs);
+V template<class charT, class traits, class Allocator>
+ bool operator>=(const basic_string<charT,traits,Allocator>& lhs,
+ const charT* rhs);
+V template<class charT, class traits, class Allocator>
+ bool operator>=(const charT* lhs,
+ const basic_string<charT,traits,Allocator>& rhs);
+
+ // _lib.string.special_:
+V template<class charT, class traits, class Allocator>
+ void swap(basic_string<charT,traits,Allocator>& lhs,
+ basic_string<charT,traits,Allocator>& rhs);
+V template<class charT, class traits, class Allocator>
+ basic_istream<charT,traits>&
+ operator>>(basic_istream<charT,traits>& is,
+ basic_string<charT,traits,Allocator>& str);
+T template<class charT, class traits, class Allocator>
+ basic_ostream<charT, traits>&
+ operator<<(basic_ostream<charT, traits>& os,
+ const basic_string<charT,traits,Allocator>& str);
+V template<class charT, class traits, class Allocator>
+ basic_istream<charT,traits>&
+ getline(basic_istream<charT,traits>& is,
+ basic_string<charT,traits,Allocator>& str,
+ charT delim);
+V template<class charT, class traits, class Allocator>
+ basic_istream<charT,traits>&
+ getline(basic_istream<charT,traits>& is,
+ basic_string<charT,traits,Allocator>& str);
+V typedef basic_string<char> string;
+T typedef basic_string<wchar_t> wstring;
+ }
+
+ 21.3 Template class basic_string [lib.basic.string]
+
+V namespace std {
+ template<class charT, class traits = char_traits<charT>,
+ class Allocator = allocator<charT> >
+ class basic_string {
+ public:
+ // types:
+ typedef traits traits_type;
+ typedef typename traits::char_type value_type;
+ typedef Allocator allocator_type;
+ typedef typename Allocator::size_type size_type;
+ typedef typename Allocator::difference_type difference_type;
+ typedef typename Allocator::reference reference;
+ typedef typename Allocator::const_reference const_reference;
+ typedef typename Allocator::pointer pointer;
+ typedef typename Allocator::const_pointer const_pointer;
+ typedef implementation defined iterator;
+ typedef implementation defined const_iterator;
+ typedef std::reverse_iterator<iterator> reverse_iterator;
+ typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
+ static const size_type npos = -1;
+
+ // _lib.string.cons_ construct/copy/destroy:
+V explicit basic_string(const Allocator& a = Allocator());
+V basic_string(const basic_string& str, size_type pos = 0,
+ size_type n = npos, const Allocator& a = Allocator());
+V basic_string(const charT* s,
+ size_type n, const Allocator& a = Allocator());
+V basic_string(const charT* s, const Allocator& a = Allocator());
+V basic_string(size_type n, charT c, const Allocator& a = Allocator());
+V template<class InputIterator>
+ basic_string(InputIterator begin, InputIterator end,
+ const Allocator& a = Allocator());
+V ~basic_string();
+V basic_string& operator=(const basic_string& str);
+V basic_string& operator=(const charT* s);
+V basic_string& operator=(charT c);
+ // _lib.string.iterators_ iterators:
+V iterator begin();
+V const_iterator begin() const;
+V iterator end();
+V const_iterator end() const;
+
+V reverse_iterator rbegin();
+V const_reverse_iterator rbegin() const;
+V reverse_iterator rend();
+V const_reverse_iterator rend() const;
+ // _lib.string.capacity_ capacity:
+V size_type size() const;
+V size_type length() const;
+V size_type max_size() const;
+V void resize(size_type n, charT c);
+V void resize(size_type n);
+V size_type capacity() const;
+V void reserve(size_type res_arg = 0);
+V void clear();
+V bool empty() const;
+ // _lib.string.access_ element access:
+V const_reference operator[](size_type pos) const;
+V reference operator[](size_type pos);
+V const_reference at(size_type n) const;
+V reference at(size_type n);
+ // _lib.string.modifiers_ modifiers:
+V basic_string& operator+=(const basic_string& str);
+V basic_string& operator+=(const charT* s);
+V basic_string& operator+=(charT c);
+V basic_string& append(const basic_string& str);
+V basic_string& append(const basic_string& str, size_type pos,
+ size_type n);
+V basic_string& append(const charT* s, size_type n);
+V basic_string& append(const charT* s);
+V basic_string& append(size_type n, charT c);
+V template<class InputIterator>
+ basic_string& append(InputIterator first, InputIterator last);
+V void push_back(const charT);
+
+V basic_string& assign(const basic_string&);
+V basic_string& assign(const basic_string& str, size_type pos,
+ size_type n);
+V basic_string& assign(const charT* s, size_type n);
+V basic_string& assign(const charT* s);
+V basic_string& assign(size_type n, charT c);
+V template<class InputIterator>
+ basic_string& assign(InputIterator first, InputIterator last);
+V basic_string& insert(size_type pos1, const basic_string& str);
+V basic_string& insert(size_type pos1, const basic_string& str,
+ size_type pos2, size_type n);
+V basic_string& insert(size_type pos, const charT* s, size_type n);
+V basic_string& insert(size_type pos, const charT* s);
+V basic_string& insert(size_type pos, size_type n, charT c);
+V iterator insert(iterator p, charT c);
+V void insert(iterator p, size_type n, charT c);
+V template<class InputIterator>
+ void insert(iterator p, InputIterator first, InputIterator last);
+V basic_string& erase(size_type pos = 0, size_type n = npos);
+V iterator erase(iterator position);
+V iterator erase(iterator first, iterator last);
+V basic_string& replace(size_type pos1, size_type n1,
+ const basic_string& str);
+V basic_string& replace(size_type pos1, size_type n1,
+ const basic_string& str,
+ size_type pos2, size_type n2);
+V basic_string& replace(size_type pos, size_type n1, const charT* s,
+ size_type n2);
+V basic_string& replace(size_type pos, size_type n1, const charT* s);
+V basic_string& replace(size_type pos, size_type n1, size_type n2,
+ charT c);
+V basic_string& replace(iterator i1, iterator i2, const basic_string& str);
+V basic_string& replace(iterator i1, iterator i2, const charT* s,
+ size_type n);
+V basic_string& replace(iterator i1, iterator i2, const charT* s);
+V basic_string& replace(iterator i1, iterator i2,
+ size_type n, charT c);
+V template<class InputIterator>
+ basic_string& replace(iterator i1, iterator i2,
+ InputIterator j1, InputIterator j2);
+V size_type copy(charT* s, size_type n, size_type pos = 0) const;
+V void swap(basic_string<charT,traits,Allocator>&);
+ // _lib.string.ops_ string operations:
+V const charT* c_str() const; // explicit
+V const charT* data() const;
+V allocator_type get_allocator() const;
+V size_type find (const basic_string& str, size_type pos = 0) const;
+V size_type find (const charT* s, size_type pos, size_type n) const;
+V size_type find (const charT* s, size_type pos = 0) const;
+V size_type find (charT c, size_type pos = 0) const;
+V size_type rfind(const basic_string& str, size_type pos = npos) const;
+V size_type rfind(const charT* s, size_type pos, size_type n) const;
+V size_type rfind(const charT* s, size_type pos = npos) const;
+V size_type rfind(charT c, size_type pos = npos) const;
+
+V size_type find_first_of(const basic_string& str,
+ size_type pos = 0) const;
+V size_type find_first_of(const charT* s,
+ size_type pos, size_type n) const;
+V size_type find_first_of(const charT* s, size_type pos = 0) const;
+V size_type find_first_of(charT c, size_type pos = 0) const;
+V size_type find_last_of (const basic_string& str,
+ size_type pos = npos) const;
+V size_type find_last_of (const charT* s,
+ size_type pos, size_type n) const;
+V size_type find_last_of (const charT* s, size_type pos = npos) const;
+V size_type find_last_of (charT c, size_type pos = npos) const;
+V size_type find_first_not_of(const basic_string& str,
+ size_type pos = 0) const;
+V size_type find_first_not_of(const charT* s, size_type pos,
+ size_type n) const;
+V size_type find_first_not_of(const charT* s, size_type pos = 0) const;
+V size_type find_first_not_of(charT c, size_type pos = 0) const;
+V size_type find_last_not_of (const basic_string& str,
+ size_type pos = npos) const;
+V size_type find_last_not_of (const charT* s, size_type pos,
+ size_type n) const;
+V size_type find_last_not_of (const charT* s,
+ size_type pos = npos) const;
+V size_type find_last_not_of (charT c, size_type pos = npos) const;
+V basic_string substr(size_type pos = 0, size_type n = npos) const;
+V int compare(const basic_string& str) const;
+V int compare(size_type pos1, size_type n1,
+ const basic_string& str) const;
+V int compare(size_type pos1, size_type n1,
+ const basic_string& str,
+ size_type pos2, size_type n2) const;
+V int compare(const charT* s) const;
+V int compare(size_type pos1, size_type n1,
+ const charT* s, size_type n2 = npos) const;
+ };
+ }
+
+ 21.4 Null-terminated sequence utilities [lib.c.strings]
+
+ Table 10--Header <cctype> synopsis
+
+ isalnum isdigit isprint isupper tolower
+X isalpha isgraph ispunct isxdigit toupper
+ iscntrl islower isspace
+
+ Table 11--Header <cwctype> synopsis
+
+X Macro: WEOF <cwctype>
+X Types: wctrans_t wctype_t wint_t <cwctype>
+ Functions:
+X iswalnum iswctype iswlower iswspace towctrans wctrans
+X iswalpha iswdigit iswprint iswupper towlower wctype
+X iswcntrl iswgraph iswpunct iswxdigit towupper
+
+ Table 12--Header <cstring> synopsis
+
+X Macro: NULL <cstring>
+X Type: size_t <cstring>
+ Functions:
+X memchr strcat strcspn strncpy strtok
+X memcmp strchr strerror strpbrk strxfrm
+X memcpy strcmp strlen strrchr
+X memmove strcoll strncat strspn
+X memset strcpy strncmp strstr
+
+ Table 13--Header <cwchar> synopsis
+ Macros: NULL <cwchar> WCHAR_MAX WCHAR_MIN WEOF <cwchar>
+ Types: mbstate_t wint_t <cwchar> size_t
+ Functions:
+X btowc getwchar ungetwc wcscpy wcsrtombs wmemchr
+X fgetwc mbrlen vfwprintf wcscspn wcsspn wmemcmp
+X fgetws mbrtowc vswprintf wcsftime wcsstr wmemcpy
+X fputwc mbsinit vwprintf wcslen wcstod wmemmove
+X fputws mbsrtowcs wcrtomb wcsncat wcstok wmemset
+X fwide putwc wcscat wcsncmp wcstol wprintf
+X fwprintf putwchar wcschr wcsncpy wcstoul wscanf
+X fwscanf swprintf wcscmp wcspbrk wcsxfrm
+X getwc swscanf wcscoll wcsrchr wctob
+
+ Table 14--Header <cstdlib> synopsis
+
+ Macros: MB_CUR_MAX
+ Functions:
+X atol mblen strtod wctomb
+X atof mbstowcs strtol wcstombs
+X atoi mbtowc strtoul
+
+X const char* strchr(const char* s, int c);
+X char* strchr( char* s, int c);
+
+X const char* strpbrk(const char* s1, const char* s2);
+X char* strpbrk( char* s1, const char* s2);
+
+X const char* strrchr(const char* s, int c);
+X char* strrchr( char* s, int c);
+
+X const char* strstr(const char* s1, const char* s2);
+X char* strstr( char* s1, const char* s2);
+
+X const void* memchr(const void* s, int c, size_t n);
+X void* memchr( void* s, int c, size_t n);
+
+X const wchar_t* wcschr(const wchar_t* s, wchar_t c);
+X wchar_t* wcschr( wchar_t* s, wchar_t c);
+
+X const wchar_t* wcspbrk(const wchar_t* s1, const wchar_t* s2);
+X wchar_t* wcspbrk( wchar_t* s1, const wchar_t* s2);
+
+X const wchar_t* wcsrchr(const wchar_t* s, wchar_t c);
+X wchar_t* wcsrchr( wchar_t* s, wchar_t c);
+
+X const wchar_t* wcsstr(const wchar_t* s1, const wchar_t* s2);
+X wchar_t* wcsstr( wchar_t* s1, const wchar_t* s2);
+
+X const wchar_t* wmemchr(const wchar_t* s, wchar_t c, size_t n);
+X wchar_t* wmemchr( wchar_t* s, wchar_t c, size_t n);
+
+ [for initial efforts on the above, see shadow/string.h]
+
+ 22.1 Locales [lib.locales]
+
+ Header <locale> synopsis
+
+ // _lib.locale_, locale:
+T class locale;
+T template <class Facet> const Facet& use_facet(const locale&);
+T template <class Facet> bool has_facet(const locale&) throw();
+
+ // _lib.locale.convenience_, convenience interfaces:
+T template <class charT> bool isspace (charT c, const locale& loc);
+T template <class charT> bool isprint (charT c, const locale& loc);
+T template <class charT> bool iscntrl (charT c, const locale& loc);
+T template <class charT> bool isupper (charT c, const locale& loc);
+T template <class charT> bool islower (charT c, const locale& loc);
+T template <class charT> bool isalpha (charT c, const locale& loc);
+T template <class charT> bool isdigit (charT c, const locale& loc);
+T template <class charT> bool ispunct (charT c, const locale& loc);
+T template <class charT> bool isxdigit(charT c, const locale& loc);
+T template <class charT> bool isalnum (charT c, const locale& loc);
+T template <class charT> bool isgraph (charT c, const locale& loc);
+T template <class charT> charT toupper(charT c, const locale& loc);
+T template <class charT> charT tolower(charT c, const locale& loc);
+ // _lib.category.ctype_ and _lib.facet.ctype.special_, ctype:
+ class ctype_base;
+T template <class charT> class ctype;
+T template <> class ctype<char>; // specialization
+S template <class charT> class ctype_byname;
+S template <> class ctype_byname<char>; // specialization
+T class codecvt_base;
+X template <class internT, class externT, class stateT> class codecvt;
+S template <class internT, class externT, class stateT> class codecvt_byname;
+ // _lib.category.numeric_ and _lib.facet.numpunct_, numeric:
+X template <class charT, class InputIterator> class num_get;
+X template <class charT, class OutputIterator> class num_put;
+T template <class charT> class numpunct;
+S template <class charT> class numpunct_byname;
+ // _lib.category.collate_, collation:
+T template <class charT> class collate;
+S template <class charT> class collate_byname;
+ // _lib.category.time_, date and time:
+T class time_base;
+S template <class charT, class InputIterator> class time_get;
+S template <class charT, class InputIterator> class time_get_byname;
+S template <class charT, class OutputIterator> class time_put;
+S template <class charT, class OutputIterator> class time_put_byname;
+ // _lib.category.monetary_, money:
+T class money_base;
+S template <class charT, class InputIterator> class money_get;
+S template <class charT, class OutputIterator> class money_put;
+S template <class charT, bool Intl> class moneypunct;
+S template <class charT, bool Intl> class moneypunct_byname;
+ // _lib.category.messages_, message retrieval:
+T class messages_base;
+S template <class charT> class messages;
+S template <class charT> class messages_byname;
+
+
+ 22.1.1 Class locale [lib.locale]
+
+X class locale {
+ public:
+ // types:
+T class facet;
+T class id;
+T typedef int category;
+T static const category // values assigned here are for exposition only
+T none = 0,
+T collate = 0x010, ctype = 0x020,
+T monetary = 0x040, numeric = 0x080,
+T time = 0x100, messages = 0x200,
+T all = collate | ctype | monetary | numeric | time | messages;
+ // construct/copy/destroy:
+T locale() throw()
+T locale(const locale& other) throw()
+X explicit locale(const char* std_name);
+X locale(const locale& other, const char* std_name, category);
+T template <class Facet> locale(const locale& other, Facet* f);
+T locale(const locale& other, const locale& one, category);
+T ~locale() throw(); // non-virtual
+T const locale& operator=(const locale& other) throw();
+T template <class Facet> locale combine(const locale& other) const;
+ // locale operations:
+X basic_string<char> name() const;
+T bool operator==(const locale& other) const;
+T bool operator!=(const locale& other) const;
+T template <class charT, class Traits, class Allocator>
+ bool operator()(const basic_string<charT,Traits,Allocator>& s1,
+ const basic_string<charT,Traits,Allocator>& s2) const;
+ // global locale objects:
+T static locale global(const locale&);
+T static const locale& classic();
+ };
+
+ 22.1.1.1 locale types [lib.locale.types]
+
+ 22.1.1.1.1 Type locale::category [lib.locale.category]
+
+T typedef int category;
+
+T none, collate, ctype, monetary, numeric, time, and messages
+
+ [required locale members]
+T collate<char>, collate<wchar_t>
+T ctype<char>, ctype<wchar_t>
+T codecvt<char,char,mbstate_t>,
+S codecvt<wchar_t,char,mbstate_t>
+T moneypunct<char>, moneypunct<wchar_t>
+T moneypunct<char,true>, moneypunct<wchar_t,true>,
+S money_get<char>, money_get<wchar_t
+S money_put<char>, money_put<wchar_t>
+T numpunct<char>, numpunct<wchar_t>,
+X num_get<char>, num_get<wchar_t>
+X num_put<char>, num_put<wchar_t>
+S time_get<char>, time_get<wchar_t>,
+S time_put<char>, time_put<wchar_t>
+S messages<char>, messages<wchar_t>
+
+ [required instantiations]
+S collate_byname<char>, collate_byname<wchar_t>
+S ctype_byname<char>, ctype_byname<wchar_t>
+S codecvt_byname<char,char,mbstate_t>,
+S codecvt_byname<wchar_t,char,mbstate_t>
+S moneypunct_byname<char,International>,
+S moneypunct_byname<wchar_t,International>,
+S money_get<C,InputIterator>,
+S money_put<C,OutputIterator>
+S numpunct_byname<char>, numpunct_byname<wchar_t>
+X num_get<C,InputIterator>, num_put<C,OutputIterator>
+S time_get<char,InputIterator>,
+S time_get_byname<char,InputIterator>,
+S time_get<wchar_t,OutputIterator>,
+S time_get_byname<wchar_t,OutputIterator>,
+S time_put<char,OutputIterator>,
+S time_put_byname<char,OutputIterator>,
+S time_put<wchar_t,OutputIterator>
+S time_put_byname<wchar_t,OutputIterator>
+S messages_byname<char>, messages_byname<wchar_t>
+
+
+ 22.1.1.1.2 Class locale::facet [lib.locale.facet]
+
+T class locale::facet {
+ protected:
+T explicit facet(size_t refs = 0);
+T virtual ~facet();
+ private:
+T facet(const facet&); // not defined
+T void operator=(const facet&); // not defined
+ };
+ }
+
+
+ 22.1.1.1.3 Class locale::id [lib.locale.id]
+
+T class locale::id {
+ public:
+T id();
+ private:
+T void operator=(const id&); // not defined
+T id(const id&); // not defined
+ };
+ }
+
+
+ 22.2.1 The ctype category [lib.category.ctype]
+
+T class ctype_base {
+ public:
+T enum mask { // numeric values are for exposition only.
+T space=, print=, cntrl=, upper=, lower=,
+T alpha=, digit=, punct=, xdigit=,
+T alnum=, graph=
+ };
+ };
+
+
+ 22.2.1.1 Template class ctype [lib.locale.ctype]
+
+T template <class charT>
+ class ctype : public locale::facet, public ctype_base {
+ public:
+T typedef charT char_type;
+T explicit ctype(size_t refs = 0);
+T bool is(mask m, charT c) const;
+T const charT* is(const charT* low, const charT* high, mask* vec) const;
+T const charT* scan_is(mask m,
+ const charT* low, const charT* high) const;
+T const charT* scan_not(mask m,
+ const charT* low, const charT* high) const;
+T charT toupper(charT c) const;
+T const charT* toupper(charT* low, const charT* high) const;
+T charT tolower(charT c) const;
+T const charT* tolower(charT* low, const charT* high) const;
+T charT widen(char c) const;
+T const char* widen(const char* low, const char* high, charT* to) const;
+T char narrow(charT c, char dfault) const;
+T const charT* narrow(const charT* low, const charT*, char dfault,
+ char* to) const;
+T static locale::id id;
+
+ protected:
+T ~ctype(); // virtual
+T virtual bool do_is(mask m, charT c) const;
+T virtual const charT* do_is(const charT* low, const charT* high,
+ mask* vec) const;
+T virtual const charT* do_scan_is(mask m,
+ const charT* low, const charT* high) const;
+T virtual const charT* do_scan_not(mask m,
+ const charT* low, const charT* high) const;
+T virtual charT do_toupper(charT) const;
+T virtual const charT* do_toupper(charT* low, const charT* high) const;
+T virtual charT do_tolower(charT) const;
+T virtual const charT* do_tolower(charT* low, const charT* high) const;
+T virtual charT do_widen(char) const;
+T virtual const char* do_widen(const char* low, const char* high,
+ charT* dest) const;
+T virtual char do_narrow(charT, char dfault) const;
+T virtual const charT* do_narrow(const charT* low, const charT* high,
+ char dfault, char* dest) const;
+ };
+
+
+ 22.2.1.2 Template class ctype_byname [lib.locale.ctype.byname]
+
+X template <class charT>
+ class ctype_byname : public ctype<charT> {
+ public:
+T typedef ctype<charT>::mask mask;
+S explicit ctype_byname(const char*, size_t refs = 0);
+ protected:
+S ~ctype_byname(); // virtual
+S virtual bool do_is(mask m, charT c) const;
+S virtual const charT* do_is(const charT* low, const charT* high,
+ mask* vec) const;
+S virtual const char* do_scan_is(mask m,
+ const charT* low, const charT* high) const;
+S virtual const char* do_scan_not(mask m,
+ const charT* low, const charT* high) const;
+S virtual charT do_toupper(charT) const;
+S virtual const charT* do_toupper(charT* low, const charT* high) const;
+S virtual charT do_tolower(charT) const;
+S virtual const charT* do_tolower(charT* low, const charT* high) const;
+S virtual charT do_widen(char) const;
+S virtual const char* do_widen(const char* low, const char* high,
+ charT* dest) const;
+S virtual char do_narrow(charT, char dfault) const;
+S virtual const charT* do_narrow(const charT* low, const charT* high,
+ char dfault, char* dest) const;
+ };
+
+ 22.2.1.3 ctype specializations [lib.facet.ctype.special]
+
+T template <> class ctype<char>
+ : public locale::facet, public ctype_base {
+ public:
+T typedef char char_type;
+T explicit ctype(const mask* tab = 0, bool del = false,
+ size_t refs = 0);
+T bool is(mask m, char c) const;
+T const char* is(const char* low, const char* high, mask* vec) const;
+T const char* scan_is (mask m,
+ const char* low, const char* high) const;
+T const char* scan_not(mask m,
+ const char* low, const char* high) const;
+T char toupper(char c) const;
+T const char* toupper(char* low, const char* high) const;
+T char tolower(char c) const;
+T const char* tolower(char* low, const char* high) const;
+T char widen(char c) const;
+T const char* widen(const char* low, const char* high, char* to) const;
+T char narrow(char c, char dfault) const;
+T const char* narrow(const char* low, const char* high, char dfault,
+ char* to) const;
+T static locale::id id;
+T static const size_t table_size = IMPLEMENTATION_DEFINED;
+
+ protected:
+T const mask* table() const throw();
+T static const mask* classic_table() throw();
+T ~ctype(); // virtual
+T virtual char do_toupper(char c) const;
+T virtual const char* do_toupper(char* low, const char* high) const;
+T virtual char do_tolower(char c) const;
+T virtual const char* do_tolower(char* low, const char* high) const;
+
+T virtual char do_widen(char c) const;
+T virtual const char* do_widen(const char* low,
+ const char* high,
+ char* to) const;
+T virtual char do_narrow(char c, char dfault) const;
+T virtual const char* do_narrow(const char* low,
+ const char* high,
+ char dfault, char* to) const;
+ };
+
+
+ 22.2.1.4 Class [lib.locale.ctype.byname.special]
+ ctype_byname<char>
+
+X template <> class ctype_byname<char> : public ctype<char> {
+ public:
+S explicit ctype_byname(const char*, size_t refs = 0);
+ protected:
+S ~ctype_byname(); // virtual
+S virtual char do_toupper(char c) const;
+S virtual const char* do_toupper(char* low, const char* high) const;
+S virtual char do_tolower(char c) const;
+S virtual const char* do_tolower(char* low, const char* high) const;
+
+S virtual char do_widen(char c) const;
+S virtual const char* do_widen(char* low,
+ const char* high,
+ char* to) const;
+S virtual char do_widen(char c) const;
+S virtual const char* do_widen(char* low, const char* high) const;
+
+ };
+
+
+
+ 22.2.1.5 Template class codecvt [lib.locale.codecvt]
+
+T class codecvt_base {
+ public:
+T enum result { ok, partial, error, noconv };
+ };
+
+T template <class internT, class externT, class stateT>
+ class codecvt : public locale::facet, public codecvt_base {
+ public:
+T typedef internT intern_type;
+T typedef externT extern_type;
+T typedef stateT state_type;
+T explicit codecvt(size_t refs = 0)
+T result out(stateT& state,
+ const internT* from, const internT* from_end, const internT*& from_next,
+ externT* to, externT* to_limit, externT*& to_next) const;
+T result unshift(stateT& state,
+ externT* to, externT* to_limit, externT*& to_next) const;
+T result in(stateT& state,
+ const externT* from, const externT* from_end, const externT*& from_next,
+ internT* to, internT* to_limit, internT*& to_next) const;
+T int encoding() const throw();
+T bool always_noconv() const throw();
+T int length(const stateT&, const externT* from, const externT* end,
+ size_t max) const;
+T int max_length() const throw();
+T static locale::id id;
+
+ protected:
+T ~codecvt(); // virtual
+T virtual result do_out(stateT& state,
+ const internT* from, const internT* from_end, const internT*& from_next,
+ externT* to, externT* to_limit, externT*& to_next) const;
+T virtual result do_in(stateT& state,
+T const externT* from, const externT* from_end, const externT*& from_next,
+ internT* to, internT* to_limit, internT*& to_next) const;
+T virtual result do_unshift(stateT& state,
+ externT* to, externT* to_limit, externT*& to_next) const;
+T virtual int do_encoding() const throw();
+T virtual bool do_always_noconv() const throw();
+T virtual int do_length(const stateT&, const externT* from,
+ const externT* end, size_t max) const;
+T virtual int do_max_length() const throw();
+ };
+ }
+
+
+ 22.2.1.6 Template class [lib.locale.codecvt.byname]
+ codecvt_byname
+
+X template <class internT, class externT, class stateT>
+ class codecvt_byname : public codecvt<internT, externT, stateT> {
+ public:
+S explicit codecvt_byname(const char*, size_t refs = 0);
+ protected:
+S ~codecvt_byname(); // virtual
+S virtual result do_out(stateT& state,
+ const internT* from, const internT* from_end, const internT*& from_next,
+ externT* to, externT* to_limit, externT*& to_next) const;
+S virtual result do_in(stateT& state,
+ const externT* from, const externT* from_end, const externT*& from_next,
+ internT* to, internT* to_limit, internT*& to_next) const;
+S virtual result do_unshift(stateT& state,
+ externT* to, externT* to_limit, externT*& to_next) const;
+S virtual int do_encoding() const throw();
+S virtual bool do_always_noconv() const throw();
+S virtual int do_length(const stateT&, const externT* from,
+ const externT* end, size_t max) const;
+S virtual result do_unshift(stateT& state,
+ externT* to, externT* to_limit, externT*& to_next) const;
+S virtual int do_max_length() const throw();
+ };
+
+
+ 22.2.2.1 Template class num_get [lib.locale.num.get]
+
+X template <class charT, class InputIterator = istreambuf_iterator<charT> >
+ class num_get : public locale::facet {
+ public:
+T typedef charT char_type;
+T typedef InputIterator iter_type;
+T explicit num_get(size_t refs = 0);
+T iter_type get(iter_type in, iter_type end, ios_base&,
+ ios_base::iostate& err, bool& v) const;
+T iter_type get(iter_type in, iter_type end, ios_base& ,
+ ios_base::iostate& err, long& v) const;
+T iter_type get(iter_type in, iter_type end, ios_base&,
+ ios_base::iostate& err, unsigned short& v) const;
+T iter_type get(iter_type in, iter_type end, ios_base&,
+ ios_base::iostate& err, unsigned int& v) const;
+T iter_type get(iter_type in, iter_type end, ios_base&,
+ ios_base::iostate& err, unsigned long& v) const;
+T iter_type get(iter_type in, iter_type end, ios_base&,
+ ios_base::iostate& err, float& v) const;
+T iter_type get(iter_type in, iter_type end, ios_base&,
+ ios_base::iostate& err, double& v) const;
+T iter_type get(iter_type in, iter_type end, ios_base&,
+ ios_base::iostate& err, long double& v) const;
+T iter_type get(iter_type in, iter_type end, ios_base&,
+ ios_base::iostate& err, void*& v) const;
+T static locale::id id;
+
+ protected:
+T ~num_get(); // virtual
+T virtual iter_type do_get(iter_type, iter_type, ios_base&,
+ ios_base::iostate& err, bool& v) const;
+S virtual iter_type do_get(iter_type, iter_type, ios_base&,
+ ios_base::iostate& err, long& v) const;
+S virtual iter_type do_get(iter_type, iter_type, ios_base&,
+ ios_base::iostate& err, unsigned short& v) const;
+S virtual iter_type do_get(iter_type, iter_type, ios_base&,
+ ios_base::iostate& err, unsigned int& v) const;
+S virtual iter_type do_get(iter_type, iter_type, ios_base&,
+ ios_base::iostate& err, unsigned long& v) const;
+S virtual iter_type do_get(iter_type, iter_type, ios_base&,
+ ios_base::iostate& err, float& v) const;
+S virtual iter_type do_get(iter_type, iter_type, ios_base&,
+ ios_base::iostate& err, double& v) const;
+S virtual iter_type do_get(iter_type, iter_type, ios_base&,
+ ios_base::iostate& err, long double& v) const;
+S virtual iter_type do_get(iter_type, iter_type, ios_base&,
+ ios_base::iostate& err, void*& v) const;
+ };
+
+
+
+ 22.2.2.2 Template class num_put [lib.locale.nm.put]
+
+X template <class charT, class OutputIterator = ostreambuf_iterator<charT> >
+ class num_put : public locale::facet {
+ public:
+T typedef charT char_type;
+T typedef OutputIterator iter_type;
+T explicit num_put(size_t refs = 0);
+T iter_type put(iter_type s, ios_base& f, char_type fill, bool v) const;
+T iter_type put(iter_type s, ios_base& f, char_type fill, long v) const;
+T iter_type put(iter_type s, ios_base& f, char_type fill,
+ unsigned long v) const;
+T iter_type put(iter_type s, ios_base& f, char_type fill,
+ double v) const;
+T iter_type put(iter_type s, ios_base& f, char_type fill,
+ long double v) const;
+T iter_type put(iter_type s, ios_base& f, char_type fill,
+ const void* v) const;
+T static locale::id id;
+ protected:
+T ~num_put(); // virtual
+T virtual iter_type do_put(iter_type, ios_base&, char_type fill,
+ bool v) const;
+T virtual iter_type do_put(iter_type, ios_base&, char_type fill,
+ long v) const;
+T virtual iter_type do_put(iter_type, ios_base&, char_type fill,
+ unsigned long) const;
+S virtual iter_type do_put(iter_type, ios_base&, char_type fill,
+ double v) const;
+S virtual iter_type do_put(iter_type, ios_base&, char_type fill,
+ long double v) const;
+T virtual iter_type do_put(iter_type, ios_base&, char_type fill,
+ const void* v) const;
+ };
+ }
+
+ 22.2.3.1 Template class numpunct [lib.locale.numpunct]
+
+T template <class charT>
+ class numpunct : public locale::facet {
+ public:
+T typedef charT char_type;
+T typedef basic_string<charT> string_type;
+T explicit numpunct(size_t refs = 0);
+T char_type decimal_point() const;
+T char_type thousands_sep() const;
+T string grouping() const;
+T string_type truename() const;
+T string_type falsename() const;
+T static locale::id id;
+ protected:
+T ~numpunct(); // virtual
+T virtual char_type do_decimal_point() const;
+T virtual char_type do_thousands_sep() const;
+T virtual string do_grouping() const;
+T virtual string_type do_truename() const; // for bool
+T virtual string_type do_falsename() const; // for bool
+ };
+ }
+
+
+
+ 22.2.3.2 Template class [lib.locale.numpunct.byname]
+ numpunct_byname
+
+X template <class charT>
+ class numpunct_byname : public numpunct<charT> {
+ // this class is specialized for char and wchar_t.
+ public:
+T typedef charT char_type;
+T typedef basic_string<charT> string_type;
+S explicit numpunct_byname(const char*, size_t refs = 0);
+ protected:
+S ~numpunct_byname(); // virtual
+S virtual char_type do_decimal_point() const;
+S virtual char_type do_thousands_sep() const;
+S virtual string do_grouping() const;
+S virtual string_type do_truename() const; // for bool
+S virtual string_type do_falsename() const; // for bool
+ };
+
+
+ 22.2.4.1 Template class collate [lib.locale.collate]
+
+T template <class charT>
+ class collate : public locale::facet {
+ public:
+T typedef charT char_type;
+T typedef basic_string<charT> string_type;
+T explicit collate(size_t refs = 0);
+T int compare(const charT* low1, const charT* high1,
+ const charT* low2, const charT* high2) const;
+T string_type transform(const charT* low, const charT* high) const;
+T long hash(const charT* low, const charT* high) const;
+T static locale::id id;
+ protected:
+T ~collate(); // virtual
+T virtual int do_compare(const charT* low1, const charT* high1,
+ const charT* low2, const charT* high2) const;
+T virtual string_type do_transform
+ (const charT* low, const charT* high) const;
+T virtual long do_hash (const charT* low, const charT* high) const;
+ };
+
+
+ 22.2.4.2 Template class [lib.locale.collate.byname]
+ collate_byname
+
+X template <class charT>
+ class collate_byname : public collate<charT> {
+ public:
+T typedef basic_string<charT> string_type;
+T explicit collate_byname(const char*, size_t refs = 0);
+ protected:
+S ~collate_byname(); // virtual
+S virtual int do_compare(const charT* low1, const charT* high1,
+ const charT* low2, const charT* high2) const;
+S virtual string_type do_transform
+ (const charT* low, const charT* high) const;
+S virtual long do_hash (const charT* low, const charT* high) const;
+ };
+
+
+ 22.2.5.1 Template class time_get [lib.locale.time.get]
+
+T class time_base {
+ public:
+T enum dateorder { no_order, dmy, mdy, ymd, ydm };
+ };
+
+ [Note: semantics of time_get members are implementation-defined.
+ To complete implementation requires documenting behavior.]
+
+X template <class charT, class InputIterator = istreambuf_iterator<charT> >
+ class time_get : public locale::facet, public time_base {
+ public:
+T typedef charT char_type;
+T typedef InputIterator iter_type;
+T explicit time_get(size_t refs = 0);
+
+T dateorder date_order() const { return do_date_order(); }
+T iter_type get_time(iter_type s, iter_type end, ios_base& f,
+ ios_base::iostate& err, tm* t) const;
+T iter_type get_date(iter_type s, iter_type end, ios_base& f,
+ ios_base::iostate& err, tm* t) const;
+T iter_type get_weekday(iter_type s, iter_type end, ios_base& f,
+ ios_base::iostate& err, tm* t) const;
+T iter_type get_monthname(iter_type s, iter_type end, ios_base& f,
+ ios_base::iostate& err, tm* t) const;
+T iter_type get_year(iter_type s, iter_type end, ios_base& f,
+ ios_base::iostate& err, tm* t) const;
+T static locale::id id;
+ protected:
+ ~time_get(); // virtual
+X virtual dateorder do_date_order() const;
+S virtual iter_type do_get_time(iter_type s, iter_type end, ios_base&,
+ ios_base::iostate& err, tm* t) const;
+S virtual iter_type do_get_date(iter_type s, iter_type end, ios_base&,
+ ios_base::iostate& err, tm* t) const;
+S virtual iter_type do_get_weekday(iter_type s, iter_type end, ios_base&,
+ ios_base::iostate& err, tm* t) const;
+S virtual iter_type do_get_monthname(iter_type s, ios_base&,
+ ios_base::iostate& err, tm* t) const;
+S virtual iter_type do_get_year(iter_type s, iter_type end, ios_base&,
+ ios_base::iostate& err, tm* t) const;
+ };
+
+
+
+ 22.2.5.2 Template class [lib.locale.time.get.byname]
+ time_get_byname
+
+X template <class charT, class InputIterator = istreambuf_iterator<charT> >
+ class time_get_byname : public time_get<charT, InputIterator> {
+ public:
+T typedef time_base::dateorder dateorder;
+T typedef InputIterator iter_type
+
+S explicit time_get_byname(const char*, size_t refs = 0);
+ protected:
+S ~time_get_byname(); // virtual
+S virtual dateorder do_date_order() const;
+S virtual iter_type do_get_time(iter_type s, iter_type end, ios_base&,
+ ios_base::iostate& err, tm* t) const;
+S virtual iter_type do_get_date(iter_type s, iter_type end, ios_base&,
+ ios_base::iostate& err, tm* t) const;
+T virtual iter_type do_get_weekday(iter_type s, iter_type end, ios_base&,
+ ios_base::iostate& err, tm* t) const;
+T virtual iter_type do_get_monthname(iter_type s, iter_type end, ios_base&,
+ ios_base::iostate& err, tm* t) const;
+S virtual iter_type do_get_year(iter_type s, iter_type end, ios_base&,
+ ios_base::iostate& err, tm* t) const;
+ };
+ }
+
+ 22.2.5.3 Template class time_put [lib.locale.time.put]
+
+X template <class charT, class OutputIterator = ostreambuf_iterator<charT> >
+ class time_put : public locale::facet {
+ public:
+T typedef charT char_type;
+T typedef OutputIterator iter_type;
+T explicit time_put(size_t refs = 0);
+ // the following is implemented in terms of other member functions.
+S iter_type put(iter_type s, ios_base& f, char_type fill, const tm* tmb,
+ const charT* pattern, const charT* pat_end) const;
+T iter_type put(iter_type s, ios_base& f, char_type fill,
+ const tm* tmb, char format, char modifier = 0) const;
+T static locale::id id;
+ protected:
+T ~time_put(); // virtual
+S virtual iter_type do_put(iter_type s, ios_base&, char_type, const tm* t,
+ char format, char modifier) const;
+ };
+
+
+
+ 22.2.5.4 Template class [lib.locale.time.put.byname]
+ time_put_byname
+
+T template <class charT, class OutputIterator = ostreambuf_iterator<charT> >
+ class time_put_byname : public time_put<charT, OutputIterator>
+ {
+ public:
+T typedef charT char_type;
+T typedef OutputIterator iter_type;
+
+T explicit time_put_byname(const char*, size_t refs = 0);
+ protected:
+T ~time_put_byname(); // virtual
+S virtual iter_type do_put(iter_type s, ios_base&, char_type, const tm* t,
+ char format, char modifier) const;
+ };
+
+
+ 22.2.6.1 Template class money_get [lib.locale.money.get]
+
+X template <class charT,
+ class InputIterator = istreambuf_iterator<charT> >
+ class money_get : public locale::facet {
+ public:
+T typedef charT char_type;
+T typedef InputIterator iter_type;
+T typedef basic_string<charT> string_type;
+T explicit money_get(size_t refs = 0);
+T iter_type get(iter_type s, iter_type end, bool intl,
+ ios_base& f, ios_base::iostate& err,
+ long double& units) const;
+T iter_type get(iter_type s, iter_type end, bool intl,
+ ios_base& f, ios_base::iostate& err,
+ string_type& digits) const;
+T static locale::id id;
+ protected:
+T ~money_get(); // virtual
+S virtual iter_type do_get(iter_type, iter_type, bool, ios_base&,
+ ios_base::iostate& err, long double& units) const;
+S virtual iter_type do_get(iter_type, iter_type, bool, ios_base&,
+ ios_base::iostate& err, string_type& digits) const;
+ };
+
+ 22.2.6.2 Template class money_put [lib.locale.money.put]
+
+X template <class charT,
+ class OutputIterator = ostreambuf_iterator<charT> >
+ class money_put : public locale::facet {
+ public:
+T typedef charT char_type;
+T typedef OutputIterator iter_type;
+T typedef basic_string<charT> string_type;
+T explicit money_put(size_t refs = 0);
+T iter_type put(iter_type s, bool intl, ios_base& f,
+ char_type fill, long double units) const;
+T iter_type put(iter_type s, bool intl, ios_base& f,
+ char_type fill, const string_type& digits) const;
+T static locale::id id;
+
+ protected:
+T ~money_put(); // virtual
+S virtual iter_type
+ do_put(iter_type, bool, ios_base&, char_type fill,
+ long double units) const;
+S virtual iter_type
+ do_put(iter_type, bool, ios_base&, char_type fill,
+ const string_type& digits) const;
+ };
+
+
+ 22.2.6.3 Template class moneypunct [lib.locale.moneypunct]
+
+T class money_base {
+ public:
+T enum part { none, space, symbol, sign, value };
+T struct pattern { char field[4]; };
+ };
+
+X template <class charT, bool International = false>
+ class moneypunct : public locale::facet, public money_base {
+ public:
+T typedef charT char_type;
+T typedef basic_string<charT> string_type;
+T explicit moneypunct(size_t refs = 0);
+T charT decimal_point() const;
+T charT thousands_sep() const;
+T string grouping() const;
+T string_type curr_symbol() const;
+T string_type positive_sign() const;
+T string_type negative_sign() const;
+T int frac_digits() const;
+T pattern pos_format() const;
+T pattern neg_format() const;
+T static locale::id id;
+T static const bool intl = International;
+ protected:
+T ~moneypunct(); // virtual
+S virtual charT do_decimal_point() const;
+S virtual charT do_thousands_sep() const;
+S virtual string do_grouping() const;
+S virtual string_type do_curr_symbol() const;
+S virtual string_type do_positive_sign() const;
+S virtual string_type do_negative_sign() const;
+S virtual int do_frac_digits() const;
+T virtual pattern do_pos_format() const;
+T virtual pattern do_neg_format() const;
+ };
+ }
+
+ 22.2.6.4 Template class [lib.locale.moneypunct.byname]
+ moneypunct_byname
+
+X template <class charT, bool Intl = false>
+ class moneypunct_byname : public moneypunct<charT, Intl> {
+ public:
+T typedef money_base::pattern pattern;
+T typedef basic_string<charT> string_type;
+
+T explicit moneypunct_byname(const char*, size_t refs = 0);
+ protected:
+T ~moneypunct_byname(); // virtual
+S virtual charT do_decimal_point() const;
+S virtual charT do_thousands_sep() const;
+S virtual string do_grouping() const;
+S virtual string_type do_curr_symbol() const;
+S virtual string_type do_positive_sign() const;
+S virtual string_type do_negative_sign() const;
+S virtual int do_frac_digits() const;
+S virtual pattern do_pos_format() const;
+S virtual pattern do_neg_format() const;
+ };
+
+ 22.2.7.1 Template class messages [lib.locale.messages]
+
+T class messages_base {
+ public:
+T typedef int catalog;
+ };
+
+X template <class charT>
+ class messages : public locale::facet, public messages_base {
+ public:
+T typedef charT char_type;
+T typedef basic_string<charT> string_type;
+T explicit messages(size_t refs = 0);
+T catalog open(const basic_string<char>& fn, const locale&) const;
+T string_type get(catalog c, int set, int msgid,
+ const string_type& dfault) const;
+T void close(catalog c) const;
+T static locale::id id;
+ protected:
+T ~messages(); // virtual
+S virtual catalog do_open(const basic_string<char>&, const locale&) const;
+S virtual string_type do_get(catalog, int set, int msgid,
+ const string_type& dfault) const;
+S virtual void do_close(catalog) const;
+ };
+
+ 22.2.7.2 Template class [lib.locale.messages.byname]
+ messages_byname
+
+
+X template <class charT>
+ class messages_byname : public messages<charT> {
+ public:
+T typedef messages_base::catalog catalog;
+T typedef basic_string<charT> string_type;
+
+T explicit messages_byname(const char*, size_t refs = 0);
+ protected:
+T ~messages_byname(); // virtual
+S virtual catalog do_open(const basic_string<char>&, const locale&) const;
+S virtual string_type do_get(catalog, int set, int msgid,
+ const string_type& dfault) const;
+S virtual void do_close(catalog) const;
+ };
+
+
+ 22.3 C Library Locales [lib.c.locales]
+
+
+ Table 13--Header <clocale> synopsis
+ Macros:
+X LC_ALL LC_COLLATE LC_CTYPE
+X LC_MONETARY LC_NUMERIC LC_TIME
+X NULL
+X Struct: lconv
+X Functions: localeconv setlocale
+
+
+ 23.2 Sequences [lib.sequences]
+
+ <deque>, <list>, <queue>, <stack>, and <vector>.
+
+ Header <deque> synopsis
+
+T template <class T, class Allocator = allocator<T> > class deque;
+T template <class T, class Allocator>
+ bool operator==(const deque<T,Allocator>& x, const deque<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator< (const deque<T,Allocator>& x, const deque<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator!=(const deque<T,Allocator>& x, const deque<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator> (const deque<T,Allocator>& x, const deque<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator>=(const deque<T,Allocator>& x, const deque<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator<=(const deque<T,Allocator>& x, const deque<T,Allocator>& y);
+T template <class T, class Allocator>
+ void swap(deque<T,Allocator>& x, deque<T,Allocator>& y);
+ }
+
+ Header <list> synopsis
+
+T template <class T, class Allocator = allocator<T> > class list;
+T template <class T, class Allocator>
+ bool operator==(const list<T,Allocator>& x, const list<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator< (const list<T,Allocator>& x, const list<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator!=(const list<T,Allocator>& x, const list<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator> (const list<T,Allocator>& x, const list<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator>=(const list<T,Allocator>& x, const list<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator<=(const list<T,Allocator>& x, const list<T,Allocator>& y);
+T template <class T, class Allocator>
+ void swap(list<T,Allocator>& x, list<T,Allocator>& y);
+ }
+
+ Header <queue> synopsis
+
+ namespace std {
+T template <class T, class Container = deque<T> > class queue;
+T template <class T, class Container>
+ bool operator==(const queue<T, Container>& x,
+ const queue<T, Container>& y);
+T template <class T, class Container>
+ bool operator< (const queue<T, Container>& x,
+ const queue<T, Container>& y);
+T template <class T, class Container>
+ bool operator!=(const queue<T, Container>& x,
+ const queue<T, Container>& y);
+T template <class T, class Container>
+ bool operator> (const queue<T, Container>& x,
+ const queue<T, Container>& y);
+T template <class T, class Container>
+ bool operator>=(const queue<T, Container>& x,
+ const queue<T, Container>& y);
+T template <class T, class Container>
+ bool operator<=(const queue<T, Container>& x,
+ const queue<T, Container>& y);
+T template <class T, class Container = vector<T>,
+ class Compare = less<typename Container::value_type> >
+T class priority_queue;
+ }
+
+ Header <stack> synopsis
+
+ namespace std {
+T template <class T, class Container = deque<T> > class stack;
+T template <class T, class Container>
+ bool operator==(const stack<T, Container>& x,
+ const stack<T, Container>& y);
+T template <class T, class Container>
+ bool operator< (const stack<T, Container>& x,
+ const stack<T, Container>& y);
+T template <class T, class Container>
+ bool operator!=(const stack<T, Container>& x,
+ const stack<T, Container>& y);
+T template <class T, class Container>
+ bool operator> (const stack<T, Container>& x,
+ const stack<T, Container>& y);
+T template <class T, class Container>
+ bool operator>=(const stack<T, Container>& x,
+ const stack<T, Container>& y);
+T template <class T, class Container>
+ bool operator<=(const stack<T, Container>& x,
+ const stack<T, Container>& y);
+ }
+
+ Header <vector> synopsis
+
+T template <class T, class Allocator = allocator<T> > class vector;
+
+T template <class T, class Allocator>
+ bool operator==(const vector<T,Allocator>& x,
+ const vector<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator< (const vector<T,Allocator>& x,
+ const vector<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator!=(const vector<T,Allocator>& x,
+ const vector<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator> (const vector<T,Allocator>& x,
+ const vector<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator>=(const vector<T,Allocator>& x,
+ const vector<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator<=(const vector<T,Allocator>& x,
+ const vector<T,Allocator>& y);
+T template <class T, class Allocator>
+ void swap(vector<T,Allocator>& x, vector<T,Allocator>& y);
+
+T template <class Allocator> class vector<bool,Allocator>;
+T template <class Allocator>
+ bool operator==(const vector<bool,Allocator>& x,
+ const vector<bool,Allocator>& y);
+T template <class Allocator>
+ bool operator< (const vector<bool,Allocator>& x,
+ const vector<bool,Allocator>& y);
+T template <class Allocator>
+ bool operator!=(const vector<bool,Allocator>& x,
+ const vector<bool,Allocator>& y);
+T template <class Allocator>
+ bool operator> (const vector<bool,Allocator>& x,
+ const vector<bool,Allocator>& y);
+T template <class Allocator>
+ bool operator>=(const vector<bool,Allocator>& x,
+ const vector<bool,Allocator>& y);
+T template <class Allocator>
+ bool operator<=(const vector<bool,Allocator>& x,
+ const vector<bool,Allocator>& y);
+T template <class Allocator>
+ void swap(vector<bool,Allocator>& x, vector<bool,Allocator>& y);
+ }
+
+ 23.2.1 Template class deque [lib.deque]
+
+ template <class T, class Allocator = allocator<T> >
+T class deque {
+ public:
+ // types:
+T typedef typename Allocator::reference reference;
+T typedef typename Allocator::const_reference const_reference;
+T typedef implementation defined iterator;
+T typedef implementation defined const_iterator;
+T typedef implementation defined size_type;
+T typedef implementation defined difference_type;
+T typedef T value_type;
+T typedef Allocator allocator_type;
+T typedef typename Allocator::pointer pointer;
+T typedef typename Allocator::const_pointer const_pointer;
+T typedef std::reverse_iterator<iterator> reverse_iterator;
+T typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
+ // _lib.deque.cons_ construct/copy/destroy:
+T explicit deque(const Allocator& = Allocator());
+T explicit deque(size_type n, const T& value = T(),
+ const Allocator& = Allocator());
+T template <class InputIterator>
+ deque(InputIterator first, InputIterator last,
+ const Allocator& = Allocator());
+T deque(const deque<T,Allocator>& x);
+T ~deque();
+T deque<T,Allocator>& operator=(const deque<T,Allocator>& x);
+T template <class InputIterator>
+ void assign(InputIterator first, InputIterator last);
+T void assign(size_type n, const T& t);
+T allocator_type get_allocator() const;
+ // iterators:
+T iterator begin();
+T const_iterator begin() const;
+T iterator end();
+T const_iterator end() const;
+T reverse_iterator rbegin();
+T const_reverse_iterator rbegin() const;
+T reverse_iterator rend();
+T const_reverse_iterator rend() const;
+ // _lib.deque.capacity_ capacity:
+T size_type size() const;
+T size_type max_size() const;
+T void resize(size_type sz, T c = T());
+T bool empty() const;
+
+ // element access:
+T reference operator[](size_type n);
+T const_reference operator[](size_type n) const;
+T reference at(size_type n);
+T const_reference at(size_type n) const;
+T reference front();
+T const_reference front() const;
+T reference back();
+T const_reference back() const;
+ // _lib.deque.modifiers_ modifiers:
+T void push_front(const T& x);
+T void push_back(const T& x);
+T iterator insert(iterator position, const T& x);
+T void insert(iterator position, size_type n, const T& x);
+T template <class InputIterator>
+ void insert (iterator position,
+ InputIterator first, InputIterator last);
+T void pop_front();
+T void pop_back();
+T iterator erase(iterator position);
+T iterator erase(iterator first, iterator last);
+T void swap(deque<T,Allocator>&);
+T void clear();
+ };
+T template <class T, class Allocator>
+ bool operator==(const deque<T,Allocator>& x,
+ const deque<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator< (const deque<T,Allocator>& x,
+ const deque<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator!=(const deque<T,Allocator>& x,
+ const deque<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator> (const deque<T,Allocator>& x,
+ const deque<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator>=(const deque<T,Allocator>& x,
+ const deque<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator<=(const deque<T,Allocator>& x,
+ const deque<T,Allocator>& y);
+ // specialized algorithms:
+T template <class T, class Allocator>
+ void swap(deque<T,Allocator>& x, deque<T,Allocator>& y);
+
+
+ 23.2.2 Template class list [lib.list]
+
+T template <class T, class Allocator = allocator<T> >
+ class list {
+ public:
+ // types:
+T typedef typename Allocator::reference reference;
+T typedef typename Allocator::const_reference const_reference;
+T typedef implementation defined iterator;
+T typedef implementation defined const_iterator;
+T typedef implementation defined size_type;
+T typedef implementation defined difference_type;
+T typedef T value_type;
+T typedef Allocator allocator_type;
+T typedef typename Allocator::pointer pointer;
+T typedef typename Allocator::const_pointer const_pointer;
+T typedef std::reverse_iterator<iterator> reverse_iterator;
+T typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
+
+ // _lib.list.cons_ construct/copy/destroy:
+T explicit list(const Allocator& = Allocator());
+T explicit list(size_type n, const T& value = T(),
+ const Allocator& = Allocator());
+T template <class InputIterator>
+ list(InputIterator first, InputIterator last,
+ const Allocator& = Allocator());
+T list(const list<T,Allocator>& x);
+T ~list();
+T list<T,Allocator>& operator=(const list<T,Allocator>& x);
+T template <class InputIterator>
+ void assign(InputIterator first, InputIterator last);
+T void assign(size_type n, const T& t);
+T allocator_type get_allocator() const;
+ // iterators:
+T iterator begin();
+T const_iterator begin() const;
+T iterator end();
+T const_iterator end() const;
+T reverse_iterator rbegin();
+T const_reverse_iterator rbegin() const;
+T reverse_iterator rend();
+T const_reverse_iterator rend() const;
+ // _lib.list.capacity_ capacity:
+T bool empty() const;
+T size_type size() const;
+T size_type max_size() const;
+T void resize(size_type sz, T c = T());
+ // element access:
+T reference front();
+T const_reference front() const;
+T reference back();
+T const_reference back() const;
+ // _lib.list.modifiers_ modifiers:
+T void push_front(const T& x);
+T void pop_front();
+T void push_back(const T& x);
+T void pop_back();
+T iterator insert(iterator position, const T& x);
+T void insert(iterator position, size_type n, const T& x);
+T template <class InputIterator>
+ void insert(iterator position, InputIterator first,
+ InputIterator last);
+T iterator erase(iterator position);
+T iterator erase(iterator position, iterator last);
+T void swap(list<T,Allocator>&);
+T void clear();
+ // _lib.list.ops_ list operations:
+T void splice(iterator position, list<T,Allocator>& x);
+T void splice(iterator position, list<T,Allocator>& x, iterator i);
+T void splice(iterator position, list<T,Allocator>& x, iterator first,
+ iterator last);
+T void remove(const T& value);
+T template <class Predicate> void remove_if(Predicate pred);
+
+T void unique();
+T template <class BinaryPredicate>
+ void unique(BinaryPredicate binary_pred);
+T void merge(list<T,Allocator>& x);
+T template <class Compare> void merge(list<T,Allocator>& x, Compare comp);
+ void sort();
+T template <class Compare> void sort(Compare comp);
+ void reverse();
+ };
+T template <class T, class Allocator>
+ bool operator==(const list<T,Allocator>& x, const list<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator< (const list<T,Allocator>& x, const list<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator!=(const list<T,Allocator>& x, const list<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator> (const list<T,Allocator>& x, const list<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator>=(const list<T,Allocator>& x, const list<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator<=(const list<T,Allocator>& x, const list<T,Allocator>& y);
+ // specialized algorithms:
+T template <class T, class Allocator>
+ void swap(list<T,Allocator>& x, list<T,Allocator>& y);
+
+
+ 23.2.3.1 Template class queue [lib.queue]
+
+T template <class T, class Container = deque<T> >
+ class queue {
+ public:
+T typedef typename Container::value_type value_type;
+T typedef typename Container::size_type size_type;
+T typedef Container container_type;
+ protected:
+T Container c;
+ public:
+T explicit queue(const Container& = Container());
+
+T bool empty() const { return c.empty(); }
+T size_type size() const { return c.size(); }
+T value_type& front() { return c.front(); }
+T const value_type& front() const { return c.front(); }
+T value_type& back() { return c.back(); }
+T const value_type& back() const { return c.back(); }
+T void push(const value_type& x) { c.push_back(x); }
+T void pop() { c.pop_front(); }
+ };
+
+T template <class T, class Container>
+ bool operator==(const queue<T, Container>& x,
+ const queue<T, Container>& y);
+T template <class T, class Container>
+ bool operator< (const queue<T, Container>& x,
+ const queue<T, Container>& y);
+T template <class T, class Container>
+ bool operator!=(const queue<T, Container>& x,
+ const queue<T, Container>& y);
+T template <class T, class Container>
+ bool operator> (const queue<T, Container>& x,
+ const queue<T, Container>& y);
+T template <class T, class Container>
+ bool operator>=(const queue<T, Container>& x,
+ const queue<T, Container>& y);
+T template <class T, class Container>
+ bool operator<=(const queue<T, Container>& x,
+ const queue<T, Container>& y);
+
+ 23.2.3.2 Template class priority_queue [lib.priority.queue]
+
+T template <class T, class Container = vector<T>,
+ class Compare = less<typename Container::value_type> >
+ class priority_queue {
+ public:
+T typedef typename Container::value_type value_type;
+T typedef typename Container::size_type size_type;
+T typedef Container container_type;
+ protected:
+T Container c;
+T Compare comp;
+ public:
+T explicit priority_queue(const Compare& x = Compare(),
+ const Container& = Container());
+T template <class InputIterator>
+ priority_queue(InputIterator first, InputIterator last,
+ const Compare& x = Compare(),
+ const Container& = Container());
+
+T bool empty() const { return c.empty(); }
+T size_type size() const { return c.size(); }
+T const value_type& top() const { return c.front(); }
+T void push(const value_type& x);
+T void pop();
+ };
+
+ 23.2.3.3 Template class stack [lib.stack]
+
+T template <class T, class Container = deque<T> >
+ class stack {
+ public:
+T typedef typename Container::value_type value_type;
+T typedef typename Container::size_type size_type;
+T typedef Container container_type;
+ protected:
+T Container c;
+ public:
+T explicit stack(const Container& = Container());
+
+T bool empty() const { return c.empty(); }
+T size_type size() const { return c.size(); }
+T value_type& top() { return c.back(); }
+T const value_type& top() const { return c.back(); }
+T void push(const value_type& x) { c.push_back(x); }
+T void pop() { c.pop_back(); }
+ };
+T template <class T, class Container>
+ bool operator==(const stack<T, Container>& x,
+ const stack<T, Container>& y);
+T template <class T, class Container>
+ bool operator< (const stack<T, Container>& x,
+ const stack<T, Container>& y);
+T template <class T, class Container>
+ bool operator!=(const stack<T, Container>& x,
+ const stack<T, Container>& y);
+T template <class T, class Container>
+ bool operator> (const stack<T, Container>& x,
+ const stack<T, Container>& y);
+T template <class T, class Container>
+ bool operator>=(const stack<T, Container>& x,
+ const stack<T, Container>& y);
+T template <class T, class Container>
+ bool operator<=(const stack<T, Container>& x,
+ const stack<T, Container>& y);
+
+ 23.2.4 Template class vector [lib.vector]
+
+ template <class T, class Allocator = allocator<T> >
+T class vector {
+ public:
+ // types:
+T typedef typename Allocator::reference reference;
+T typedef typename Allocator::const_reference const_reference;
+T typedef implementation defined iterator;
+T typedef implementation defined const_iterator;
+T typedef implementation defined size_type;
+T typedef implementation defined difference_type;
+T typedef T value_type;
+T typedef Allocator allocator_type;
+T typedef typename Allocator::pointer pointer;
+T typedef typename Allocator::const_pointer const_pointer
+T typedef std::reverse_iterator<iterator> reverse_iterator;
+T typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
+ // _lib.vector.cons_ construct/copy/destroy:
+T explicit vector(const Allocator& = Allocator());
+T explicit vector(size_type n, const T& value = T(),
+ const Allocator& = Allocator());
+T template <class InputIterator>
+ vector(InputIterator first, InputIterator last,
+ const Allocator& = Allocator());
+T vector(const vector<T,Allocator>& x);
+T ~vector();
+T vector<T,Allocator>& operator=(const vector<T,Allocator>& x);
+T template <class InputIterator>
+ void assign(InputIterator first, InputIterator last);
+T void assign(size_type n, const T& u);
+T allocator_type get_allocator() const;
+ // iterators:
+T iterator begin();
+T const_iterator begin() const;
+T iterator end();
+T const_iterator end() const;
+T reverse_iterator rbegin();
+T const_reverse_iterator rbegin() const;
+T reverse_iterator rend();
+T const_reverse_iterator rend() const;
+ // _lib.vector.capacity_ capacity:
+T size_type size() const;
+T size_type max_size() const;
+T void resize(size_type sz, T c = T());
+T size_type capacity() const;
+T bool empty() const;
+T void reserve(size_type n);
+
+ // element access:
+T reference operator[](size_type n);
+T const_reference operator[](size_type n) const;
+T const_reference at(size_type n) const;
+T reference at(size_type n);
+T reference front();
+T const_reference front() const;
+T reference back();
+T const_reference back() const;
+ // _lib.vector.modifiers_ modifiers:
+T void push_back(const T& x);
+T void pop_back();
+T iterator insert(iterator position, const T& x);
+T void insert(iterator position, size_type n, const T& x);
+T template <class InputIterator>
+ void insert(iterator position,
+ InputIterator first, InputIterator last);
+T iterator erase(iterator position);
+T iterator erase(iterator first, iterator last);
+T void swap(vector<T,Allocator>&);
+T void clear();
+ };
+
+T template <class T, class Allocator>
+ bool operator==(const vector<T,Allocator>& x,
+ const vector<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator< (const vector<T,Allocator>& x,
+ const vector<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator!=(const vector<T,Allocator>& x,
+ const vector<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator> (const vector<T,Allocator>& x,
+ const vector<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator>=(const vector<T,Allocator>& x,
+ const vector<T,Allocator>& y);
+T template <class T, class Allocator>
+ bool operator<=(const vector<T,Allocator>& x,
+ const vector<T,Allocator>& y);
+ // specialized algorithms:
+T template <class T, class Allocator>
+ void swap(vector<T,Allocator>& x, vector<T,Allocator>& y);
+
+
+ 23.2.5 Class vector<bool> [lib.vector.bool]
+
+T template <class Allocator> class vector<bool, Allocator> {
+ public:
+ // types:
+T typedef bool const_reference;
+T typedef implementation defined iterator;
+T typedef implementation defined const_iterator;
+T typedef implementation defined size_type;
+T typedef implementation defined difference_type;
+T typedef bool value_type;
+T typedef Allocator allocator_type;
+T typedef implementation defined pointer;
+T typedef implementation defined const_pointer
+T typedef std::reverse_iterator<iterator> reverse_iterator;
+T typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
+ // bit reference:
+T class reference {
+ friend class vector;
+T reference();
+ public:
+T ~reference();
+T operator bool() const;
+T reference& operator=(const bool x);
+T reference& operator=(const reference& x);
+T void flip(); // flips the bit
+ };
+
+ // construct/copy/destroy:
+T explicit vector(const Allocator& = Allocator());
+T explicit vector(size_type n, const bool& value = bool(),
+ const Allocator& = Allocator());
+T template <class InputIterator>
+ vector(InputIterator first, InputIterator last,
+ const Allocator& = Allocator());
+T vector(const vector<bool,Allocator>& x);
+T ~vector();
+T vector<bool,Allocator>& operator=(const vector<bool,Allocator>& x);
+T template <class InputIterator>
+ void assign(InputIterator first, InputIterator last);
+T void assign(size_type n, const T& t);
+T allocator_type get_allocator() const;
+ // iterators:
+T iterator begin();
+T const_iterator begin() const;
+T iterator end();
+T const_iterator end() const;
+T reverse_iterator rbegin();
+T const_reverse_iterator rbegin() const;
+T reverse_iterator rend();
+T const_reverse_iterator rend() const;
+ // capacity:
+T size_type size() const;
+T size_type max_size() const;
+T void resize(size_type sz, bool c = false);
+T size_type capacity() const;
+T bool empty() const;
+T void reserve(size_type n);
+ // element access:
+T reference operator[](size_type n);
+T const_reference operator[](size_type n) const;
+T const_reference at(size_type n) const;
+T reference at(size_type n);
+T reference front();
+T const_reference front() const;
+T reference back();
+T const_reference back() const;
+ // modifiers:
+T void push_back(const bool& x);
+T void pop_back();
+T iterator insert(iterator position, const bool& x);
+T void insert (iterator position, size_type n, const bool& x);
+T template <class InputIterator>
+ void insert(iterator position,
+ InputIterator first, InputIterator last);
+T iterator erase(iterator position);
+T iterator erase(iterator first, iterator last);
+T void swap(vector<bool,Allocator>&);
+T static void swap(reference x, reference y);
+T void flip(); // flips all bits
+T void clear();
+ };
+
+T template <class Allocator>
+ bool operator==(const vector<bool,Allocator>& x,
+ const vector<bool,Allocator>& y);
+T template <class Allocator>
+ bool operator< (const vector<bool,Allocator>& x,
+ const vector<bool,Allocator>& y);
+T template <class Allocator>
+ bool operator!=(const vector<bool,Allocator>& x,
+ const vector<bool,Allocator>& y);
+T template <class Allocator>
+ bool operator> (const vector<bool,Allocator>& x,
+ const vector<bool,Allocator>& y);
+T template <class Allocator>
+ bool operator>=(const vector<bool,Allocator>& x,
+ const vector<bool,Allocator>& y);
+T template <class Allocator>
+ bool operator<=(const vector<bool,Allocator>& x,
+ const vector<bool,Allocator>& y);
+ // specialized algorithms:
+T template <class Allocator>
+ void swap(vector<bool,Allocator>& x, vector<bool,Allocator>& y);
+
+ 23.3 Associative containers [lib.associative]
+
+ <map> and <set>:
+
+ Header <map> synopsis
+
+ template <class Key, class T, class Compare = less<Key>,
+ class Allocator = allocator<pair<const Key, T> > >
+T class map;
+
+T template <class Key, class T, class Compare, class Allocator>
+ bool operator==(const map<Key,T,Compare,Allocator>& x,
+ const map<Key,T,Compare,Allocator>& y);
+T template <class Key, class T, class Compare, class Allocator>
+ bool operator< (const map<Key,T,Compare,Allocator>& x,
+ const map<Key,T,Compare,Allocator>& y);
+T template <class Key, class T, class Compare, class Allocator>
+ bool operator!=(const map<Key,T,Compare,Allocator>& x,
+ const map<Key,T,Compare,Allocator>& y);
+T template <class Key, class T, class Compare, class Allocator>
+ bool operator> (const map<Key,T,Compare,Allocator>& x,
+ const map<Key,T,Compare,Allocator>& y);
+T template <class Key, class T, class Compare, class Allocator>
+ bool operator>=(const map<Key,T,Compare,Allocator>& x,
+ const map<Key,T,Compare,Allocator>& y);
+T template <class Key, class T, class Compare, class Allocator>
+ bool operator<=(const map<Key,T,Compare,Allocator>& x,
+ const map<Key,T,Compare,Allocator>& y);
+T template <class Key, class T, class Compare, class Allocator>
+ void swap(map<Key,T,Compare,Allocator>& x,
+ map<Key,T,Compare,Allocator>& y);
+T template <class Key, class T, class Compare = less<Key>,
+ class Allocator = allocator<pair<const Key, T> > >
+ class multimap;
+T template <class Key, class T, class Compare, class Allocator>
+ bool operator==(const multimap<Key,T,Compare,Allocator>& x,
+ const multimap<Key,T,Compare,Allocator>& y);
+T template <class Key, class T, class Compare, class Allocator>
+ bool operator< (const multimap<Key,T,Compare,Allocator>& x,
+ const multimap<Key,T,Compare,Allocator>& y);
+T template <class Key, class T, class Compare, class Allocator>
+ bool operator!=(const multimap<Key,T,Compare,Allocator>& x,
+ const multimap<Key,T,Compare,Allocator>& y);
+T template <class Key, class T, class Compare, class Allocator>
+ bool operator> (const multimap<Key,T,Compare,Allocator>& x,
+ const multimap<Key,T,Compare,Allocator>& y);
+T template <class Key, class T, class Compare, class Allocator>
+ bool operator>=(const multimap<Key,T,Compare,Allocator>& x,
+ const multimap<Key,T,Compare,Allocator>& y);
+T template <class Key, class T, class Compare, class Allocator>
+ bool operator<=(const multimap<Key,T,Compare,Allocator>& x,
+ const multimap<Key,T,Compare,Allocator>& y);
+T template <class Key, class T, class Compare, class Allocator>
+ void swap(multimap<Key,T,Compare,Allocator>& x,
+ multimap<Key,T,Compare,Allocator>& y);
+ }
+
+ Header <set> synopsis
+
+ template <class Key, class Compare = less<Key>,
+ class Allocator = allocator<Key> >
+T class set;
+
+T template <class Key, class Compare, class Allocator>
+ bool operator==(const set<Key,Compare,Allocator>& x,
+ const set<Key,Compare,Allocator>& y);
+T template <class Key, class Compare, class Allocator>
+ bool operator< (const set<Key,Compare,Allocator>& x,
+ const set<Key,Compare,Allocator>& y);
+T template <class Key, class Compare, class Allocator>
+ bool operator!=(const set<Key,Compare,Allocator>& x,
+ const set<Key,Compare,Allocator>& y);
+T template <class Key, class Compare, class Allocator>
+ bool operator> (const set<Key,Compare,Allocator>& x,
+ const set<Key,Compare,Allocator>& y);
+T template <class Key, class Compare, class Allocator>
+ bool operator>=(const set<Key,Compare,Allocator>& x,
+ const set<Key,Compare,Allocator>& y);
+T template <class Key, class Compare, class Allocator>
+ bool operator<=(const set<Key,Compare,Allocator>& x,
+ const set<Key,Compare,Allocator>& y);
+T template <class Key, class Compare, class Allocator>
+ void swap(set<Key,Compare,Allocator>& x,
+ set<Key,Compare,Allocator>& y);
+T template <class Key, class Compare = less<Key>,
+ class Allocator = allocator<Key> >
+ class multiset;
+T template <class Key, class Compare, class Allocator>
+ bool operator==(const multiset<Key,Compare,Allocator>& x,
+ const multiset<Key,Compare,Allocator>& y);
+T template <class Key, class Compare, class Allocator>
+ bool operator< (const multiset<Key,Compare,Allocator>& x,
+ const multiset<Key,Compare,Allocator>& y);
+T template <class Key, class Compare, class Allocator>
+ bool operator!=(const multiset<Key,Compare,Allocator>& x,
+ const multiset<Key,Compare,Allocator>& y);
+T template <class Key, class Compare, class Allocator>
+ bool operator> (const multiset<Key,Compare,Allocator>& x,
+ const multiset<Key,Compare,Allocator>& y);
+T template <class Key, class Compare, class Allocator>
+ bool operator>=(const multiset<Key,Compare,Allocator>& x,
+ const multiset<Key,Compare,Allocator>& y);
+T template <class Key, class Compare, class Allocator>
+ bool operator<=(const multiset<Key,Compare,Allocator>& x,
+ const multiset<Key,Compare,Allocator>& y);
+T template <class Key, class Compare, class Allocator>
+ void swap(multiset<Key,Compare,Allocator>& x,
+ multiset<Key,Compare,Allocator>& y);
+ }
+
+ 23.3.1 Template class map [lib.map]
+
+ template <class Key, class T, class Compare = less<Key>,
+ class Allocator = allocator<pair<const Key, T> > >
+T class map {
+ public:
+ // types:
+T typedef Key key_type;
+T typedef T mapped_type;
+T typedef pair<const Key, T> value_type;
+T typedef Compare key_compare;
+T typedef Allocator allocator_type;
+T typedef typename Allocator::reference reference;
+T typedef typename Allocator::const_reference const_reference;
+T typedef implementation defined iterator;
+T typedef implementation defined const_iterator;
+T typedef implementation defined size_type;
+T typedef implementation defined difference_type;
+T typedef typename Allocator::pointer pointer;
+T typedef typename Allocator::const_pointer const_pointer;
+T typedef std::reverse_iterator<iterator> reverse_iterator;
+T typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
+T class value_compare
+ : public binary_function<value_type,value_type,bool> {
+ friend class map;
+ protected:
+T Compare comp;
+T value_compare(Compare c) : comp(c) {}
+ public:
+T bool operator()(const value_type& x, const value_type& y) const {
+ return comp(x.first, y.first);
+ }
+ };
+
+ // _lib.map.cons_ construct/copy/destroy:
+T explicit map(const Compare& comp = Compare(),
+ const Allocator& = Allocator());
+T template <class InputIterator>
+ map(InputIterator first, InputIterator last,
+ const Compare& comp = Compare(), const Allocator& = Allocator());
+T map(const map<Key,T,Compare,Allocator>& x);
+T ~map();
+T map<Key,T,Compare,Allocator>&
+ operator=(const map<Key,T,Compare,Allocator>& x);
+ // iterators:
+T iterator begin();
+T const_iterator begin() const;
+T iterator end();
+T const_iterator end() const;
+T reverse_iterator rbegin();
+T const_reverse_iterator rbegin() const;
+T reverse_iterator rend();
+T const_reverse_iterator rend() const;
+ // capacity:
+T bool empty() const;
+T size_type size() const;
+T size_type max_size() const;
+ // _lib.map.access_ element access:
+T T& operator[](const key_type& x);
+ // modifiers:
+T pair<iterator, bool> insert(const value_type& x);
+T iterator insert(iterator position, const value_type& x);
+T template <class InputIterator>
+ void insert(InputIterator first, InputIterator last);
+T void erase(iterator position);
+T size_type erase(const key_type& x);
+T void erase(iterator first, iterator last);
+T void swap(map<Key,T,Compare,Allocator>&);
+T void clear();
+ // observers:
+T key_compare key_comp() const;
+T value_compare value_comp() const;
+ // _lib.map.ops_ map operations:
+T iterator find(const key_type& x);
+T const_iterator find(const key_type& x) const;
+T size_type count(const key_type& x) const;
+T iterator lower_bound(const key_type& x);
+T const_iterator lower_bound(const key_type& x) const;
+T iterator upper_bound(const key_type& x);
+T const_iterator upper_bound(const key_type& x) const;
+T pair<iterator,iterator>
+ equal_range(const key_type& x);
+T pair<const_iterator,const_iterator>
+ equal_range(const key_type& x) const;
+ };
+
+T template <class Key, class T, class Compare, class Allocator>
+ bool operator==(const map<Key,T,Compare,Allocator>& x,
+ const map<Key,T,Compare,Allocator>& y);
+T template <class Key, class T, class Compare, class Allocator>
+ bool operator< (const map<Key,T,Compare,Allocator>& x,
+ const map<Key,T,Compare,Allocator>& y);
+T template <class Key, class T, class Compare, class Allocator>
+ bool operator!=(const map<Key,T,Compare,Allocator>& x,
+ const map<Key,T,Compare,Allocator>& y);
+T template <class Key, class T, class Compare, class Allocator>
+ bool operator> (const map<Key,T,Compare,Allocator>& x,
+ const map<Key,T,Compare,Allocator>& y);
+T template <class Key, class T, class Compare, class Allocator>
+ bool operator>=(const map<Key,T,Compare,Allocator>& x,
+ const map<Key,T,Compare,Allocator>& y);
+T template <class Key, class T, class Compare, class Allocator>
+ bool operator<=(const map<Key,T,Compare,Allocator>& x,
+ const map<Key,T,Compare,Allocator>& y);
+ // specialized algorithms:
+T template <class Key, class T, class Compare, class Allocator>
+ void swap(map<Key,T,Compare,Allocator>& x,
+ map<Key,T,Compare,Allocator>& y);
+
+ 23.3.2 Template class multimap [lib.multimap]
+
+ template <class Key, class T, class Compare = less<Key>,
+ class Allocator = allocator<pair<const Key, T> > >
+T class multimap {
+ public:
+ // types:
+T typedef Key key_type;
+T typedef T mapped_type;
+T typedef pair<const Key,T> value_type;
+T typedef Compare key_compare;
+T typedef Allocator allocator_type;
+T typedef typename Allocator::reference reference;
+T typedef typename Allocator::const_reference const_reference;
+T typedef implementation defined iterator;
+T typedef implementation defined const_iterator;
+T typedef implementation defined size_type;
+T typedef implementation defined difference_type
+T typedef typename Allocator::pointer pointer;
+T typedef typename Allocator::const_pointer const_pointer;
+T typedef std::reverse_iterator<iterator> reverse_iterator;
+T typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
+T class value_compare
+ : public binary_function<value_type,value_type,bool> {
+ friend class multimap;
+ protected:
+T Compare comp;
+T value_compare(Compare c) : comp(c) {}
+ public:
+T bool operator()(const value_type& x, const value_type& y) const {
+ return comp(x.first, y.first);
+ }
+ };
+ // construct/copy/destroy:
+T explicit multimap(const Compare& comp = Compare(),
+ const Allocator& = Allocator());
+T template <class InputIterator>
+ multimap(InputIterator first, InputIterator last,
+ const Compare& comp = Compare(),
+ const Allocator& = Allocator());
+T multimap(const multimap<Key,T,Compare,Allocator>& x);
+T ~multimap();
+T multimap<Key,T,Compare,Allocator>&
+ operator=(const multimap<Key,T,Compare,Allocator>& x);
+T allocator_type get_allocator() const;
+
+ // iterators:
+T iterator begin();
+T const_iterator begin() const;
+T iterator end();
+T const_iterator end() const;
+T reverse_iterator rbegin();
+T const_reverse_iterator rbegin() const;
+T reverse_iterator rend();
+T const_reverse_iterator rend() const;
+ // capacity:
+T bool empty() const;
+T size_type size() const;
+T size_type max_size() const;
+ // modifiers:
+T iterator insert(const value_type& x);
+T iterator insert(iterator position, const value_type& x);
+T template <class InputIterator>
+ void insert(InputIterator first, InputIterator last);
+T void erase(iterator position);
+T size_type erase(const key_type& x);
+T void erase(iterator first, iterator last);
+T void swap(multimap<Key,T,Compare,Allocator>&);
+T void clear();
+ // observers:
+T key_compare key_comp() const;
+T value_compare value_comp() const;
+ // map operations:
+T iterator find(const key_type& x);
+T const_iterator find(const key_type& x) const;
+T size_type count(const key_type& x) const;
+T iterator lower_bound(const key_type& x);
+T const_iterator lower_bound(const key_type& x) const;
+T iterator upper_bound(const key_type& x);
+T const_iterator upper_bound(const key_type& x) const;
+T pair<iterator,iterator> equal_range(const key_type& x);
+T pair<const_iterator,const_iterator> equal_range(const key_type& x) const;
+ };
+
+T template <class Key, class T, class Compare, class Allocator>
+ bool operator==(const multimap<Key,T,Compare,Allocator>& x,
+ const multimap<Key,T,Compare,Allocator>& y);
+T template <class Key, class T, class Compare, class Allocator>
+ bool operator< (const multimap<Key,T,Compare,Allocator>& x,
+ const multimap<Key,T,Compare,Allocator>& y);
+T template <class Key, class T, class Compare, class Allocator>
+ bool operator!=(const multimap<Key,T,Compare,Allocator>& x,
+ const multimap<Key,T,Compare,Allocator>& y);
+T template <class Key, class T, class Compare, class Allocator>
+ bool operator> (const multimap<Key,T,Compare,Allocator>& x,
+ const multimap<Key,T,Compare,Allocator>& y);
+T template <class Key, class T, class Compare, class Allocator>
+ bool operator>=(const multimap<Key,T,Compare,Allocator>& x,
+ const multimap<Key,T,Compare,Allocator>& y);
+T template <class Key, class T, class Compare, class Allocator>
+ bool operator<=(const multimap<Key,T,Compare,Allocator>& x,
+ const multimap<Key,T,Compare,Allocator>& y);
+ // specialized algorithms:
+T template <class Key, class T, class Compare, class Allocator>
+ void swap(multimap<Key,T,Compare,Allocator>& x,
+ multimap<Key,T,Compare,Allocator>& y);
+
+
+ 23.3.3 Template class set [lib.set]
+
+ template <class Key, class Compare = less<Key>,
+ class Allocator = allocator<Key> >
+T class set {
+ public:
+ // types:
+T typedef Key key_type;
+T typedef Key value_type;
+T typedef Compare key_compare;
+T typedef Compare value_compare;
+T typedef Allocator allocator_type;
+T typedef typename Allocator::reference reference;
+T typedef typename Allocator::const_reference const_reference;
+T typedef implementation defined iterator;
+T typedef implementation defined const_iterator;
+T typedef implementation defined size_type;
+T typedef implementation defined difference_type;
+T typedef typename Allocator::pointer pointer;
+T typedef typename Allocator::const_pointer const_pointer;
+T typedef std::reverse_iterator<iterator> reverse_iterator;
+T typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
+ // _lib.set.cons_ construct/copy/destroy:
+T explicit set(const Compare& comp = Compare(),
+ const Allocator& = Allocator());
+T template <class InputIterator>
+ set(InputIterator first, InputIterator last,
+ const Compare& comp = Compare(), const Allocator& = Allocator());
+T set(const set<Key,Compare,Allocator>& x);
+T ~set();
+T set<Key,Compare,Allocator>&
+ operator=(const set<Key,Compare,Allocator>& x);
+T allocator_type get_allocator() const;
+ // iterators:
+T iterator begin();
+T const_iterator begin() const;
+T iterator end();
+T const_iterator end() const;
+T reverse_iterator rbegin();
+T const_reverse_iterator rbegin() const;
+T reverse_iterator rend();
+T const_reverse_iterator rend() const;
+ // capacity:
+T bool empty() const;
+T size_type size() const;
+T size_type max_size() const;
+ // modifiers:
+T pair<iterator,bool> insert(const value_type& x);
+T iterator insert(iterator position, const value_type& x);
+T template <class InputIterator>
+T void insert(InputIterator first, InputIterator last);
+T void erase(iterator position);
+T size_type erase(const key_type& x);
+T void erase(iterator first, iterator last);
+T void swap(set<Key,Compare,Allocator>&);
+T void clear();
+
+ // observers:
+T key_compare key_comp() const;
+T value_compare value_comp() const;
+ // set operations:
+T iterator find(const key_type& x) const;
+T size_type count(const key_type& x) const;
+T iterator lower_bound(const key_type& x) const;
+T iterator upper_bound(const key_type& x) const;
+T pair<iterator,iterator> equal_range(const key_type& x) const;
+ };
+T template <class Key, class Compare, class Allocator>
+ bool operator==(const set<Key,Compare,Allocator>& x,
+ const set<Key,Compare,Allocator>& y);
+T template <class Key, class Compare, class Allocator>
+ bool operator< (const set<Key,Compare,Allocator>& x,
+ const set<Key,Compare,Allocator>& y);
+T template <class Key, class Compare, class Allocator>
+ bool operator!=(const set<Key,Compare,Allocator>& x,
+ const set<Key,Compare,Allocator>& y);
+T template <class Key, class Compare, class Allocator>
+ bool operator> (const set<Key,Compare,Allocator>& x,
+ const set<Key,Compare,Allocator>& y);
+T template <class Key, class Compare, class Allocator>
+ bool operator>=(const set<Key,Compare,Allocator>& x,
+ const set<Key,Compare,Allocator>& y);
+T template <class Key, class Compare, class Allocator>
+ bool operator<=(const set<Key,Compare,Allocator>& x,
+ const set<Key,Compare,Allocator>& y);
+ // specialized algorithms:
+T template <class Key, class Compare, class Allocator>
+ void swap(set<Key,Compare,Allocator>& x,
+ set<Key,Compare,Allocator>& y);
+
+ 23.3.4 Template class multiset [lib.multiset]
+
+ template <class Key, class Compare = less<Key>,
+ class Allocator = allocator<Key> >
+T class multiset {
+ public:
+ // types:
+T typedef Key key_type;
+T typedef Key value_type;
+T typedef Compare key_compare;
+T typedef Compare value_compare;
+T typedef Allocator allocator_type;
+T typedef typename Allocator::reference reference;
+T typedef typename Allocator::const_reference const_reference;
+T typedef implementation defined iterator;
+T typedef implementation defined const_iterator;
+T typedef implementation defined size_type;
+T typedef implementation defined difference_type
+T typedef typename Allocator::pointer pointer;
+T typedef typename Allocator::const_pointer const_pointer;
+T typedef std::reverse_iterator<iterator> reverse_iterator;
+T typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
+
+ // construct/copy/destroy:
+T explicit multiset(const Compare& comp = Compare(),
+ const Allocator& = Allocator());
+T template <class InputIterator>
+ multiset(InputIterator first, InputIterator last,
+ const Compare& comp = Compare(),
+ const Allocator& = Allocator());
+T multiset(const multiset<Key,Compare,Allocator>& x);
+T ~multiset();
+T multiset<Key,Compare,Allocator>&
+ operator=(const multiset<Key,Compare,Allocator>& x);
+T allocator_type get_allocator() const;
+ // iterators:
+T iterator begin();
+T const_iterator begin() const;
+T iterator end();
+T const_iterator end() const;
+T reverse_iterator rbegin();
+T const_reverse_iterator rbegin() const;
+T reverse_iterator rend();
+T const_reverse_iterator rend() const;
+ // capacity:
+T bool empty() const;
+T size_type size() const;
+T size_type max_size() const;
+ // modifiers:
+T iterator insert(const value_type& x);
+T iterator insert(iterator position, const value_type& x);
+T template <class InputIterator>
+ void insert(InputIterator first, InputIterator last);
+T void erase(iterator position);
+T size_type erase(const key_type& x);
+T void erase(iterator first, iterator last);
+T void swap(multiset<Key,Compare,Allocator>&);
+T void clear();
+ // observers:
+T key_compare key_comp() const;
+T value_compare value_comp() const;
+ // set operations:
+T iterator find(const key_type& x) const;
+T size_type count(const key_type& x) const;
+T iterator lower_bound(const key_type& x) const;
+T iterator upper_bound(const key_type& x) const;
+T pair<iterator,iterator> equal_range(const key_type& x) const;
+ };
+
+T template <class Key, class Compare, class Allocator>
+ bool operator==(const multiset<Key,Compare,Allocator>& x,
+ const multiset<Key,Compare,Allocator>& y);
+T template <class Key, class Compare, class Allocator>
+ bool operator< (const multiset<Key,Compare,Allocator>& x,
+ const multiset<Key,Compare,Allocator>& y);
+T template <class Key, class Compare, class Allocator>
+ bool operator!=(const multiset<Key,Compare,Allocator>& x,
+ const multiset<Key,Compare,Allocator>& y);
+T template <class Key, class Compare, class Allocator>
+ bool operator> (const multiset<Key,Compare,Allocator>& x,
+ const multiset<Key,Compare,Allocator>& y);
+T template <class Key, class Compare, class Allocator>
+ bool operator>=(const multiset<Key,Compare,Allocator>& x,
+ const multiset<Key,Compare,Allocator>& y);
+T template <class Key, class Compare, class Allocator>
+ bool operator<=(const multiset<Key,Compare,Allocator>& x,
+ const multiset<Key,Compare,Allocator>& y);
+ // specialized algorithms:
+T template <class Key, class Compare, class Allocator>
+ void swap(multiset<Key,Compare,Allocator>& x,
+ multiset<Key,Compare,Allocator>& y);
+
+ 23.3.5 Template class bitset [lib.template.bitset]
+
+ Header <bitset> synopsis
+
+T template <size_t N> class bitset;
+ // _lib.bitset.operators_ bitset operations:
+T template <size_t N>
+ bitset<N> operator&(const bitset<N>&, const bitset<N>&);
+T template <size_t N>
+ bitset<N> operator|(const bitset<N>&, const bitset<N>&);
+T template <size_t N>
+ bitset<N> operator^(const bitset<N>&, const bitset<N>&);
+T template <class charT, class traits, size_t N>
+ basic_istream<charT, traits>&
+ operator>>(basic_istream<charT, traits>& is, bitset<N>& x);
+T template <class charT, class traits, size_t N>
+ basic_ostream<charT, traits>&
+ operator<<(basic_ostream<charT, traits>& os, const bitset<N>& x);
+
+T template<size_t N> class bitset {
+ public:
+ // bit reference:
+T class reference {
+ friend class bitset;
+T reference();
+ public:
+T ~reference();
+T reference& operator=(bool x); // for b[i] = x;
+T reference& operator=(const reference&); // for b[i] = b[j];
+T bool operator~() const; // flips the bit
+T operator bool() const; // for x = b[i];
+T reference& flip(); // for b[i].flip();
+ };
+
+ // _lib.bitset.cons_ constructors:
+T bitset();
+T bitset(unsigned long val);
+T template<class charT, class traits, class Allocator>
+ explicit bitset(
+ const basic_string<charT,traits,Allocator>& str,
+ typename basic_string<charT,traits,Allocator>::size_type pos = 0,
+ typename basic_string<charT,traits,Allocator>::size_type n =
+ basic_string<charT,traits,Allocator>::npos);
+ // _lib.bitset.members_ bitset operations:
+T bitset<N>& operator&=(const bitset<N>& rhs);
+T bitset<N>& operator|=(const bitset<N>& rhs);
+T bitset<N>& operator^=(const bitset<N>& rhs);
+T bitset<N>& operator<<=(size_t pos);
+T bitset<N>& operator>>=(size_t pos);
+T bitset<N>& set();
+T bitset<N>& set(size_t pos, int val = true);
+T bitset<N>& reset();
+T bitset<N>& reset(size_t pos);
+T bitset<N> operator~() const;
+T bitset<N>& flip();
+T bitset<N>& flip(size_t pos);
+ // element access:
+T reference operator[](size_t pos); // for b[i];
+T unsigned long to_ulong() const;
+T template <class charT, class traits, class Allocator>
+ basic_string<charT, traits, Allocator> to_string() const;
+T size_t count() const;
+T size_t size() const;
+T bool operator==(const bitset<N>& rhs) const;
+T bool operator!=(const bitset<N>& rhs) const;
+T bool test(size_t pos) const;
+T bool any() const;
+T bool none() const;
+T bitset<N> operator<<(size_t pos) const;
+T bitset<N> operator>>(size_t pos) const;
+ };
+
+
+
+
+ 24.2 Header <iterator> synopsis [lib.iterator.synopsis]
+
+ // _lib.iterator.primitives_, primitives:
+T template<class Iterator> struct iterator_traits;
+T template<class T> struct iterator_traits<T*>;
+
+X template<class Category, class T, class Distance = ptrdiff_t,
+ class Pointer = T*, class Reference = T&> struct iterator;
+T struct input_iterator_tag {};
+T struct output_iterator_tag {};
+T struct forward_iterator_tag: public input_iterator_tag {};
+T struct bidirectional_iterator_tag: public forward_iterator_tag {};
+T struct random_access_iterator_tag: public bidirectional_iterator_tag {};
+ // _lib.iterator.operations_, iterator operations:
+T template <class InputIterator, class Distance>
+ void advance(InputIterator& i, Distance n);
+T template <class InputIterator>
+ typename iterator_traits<InputIterator>::difference_type
+ distance(InputIterator first, InputIterator last);
+ // _lib.predef.iterators_, predefined iterators:
+X template <class Iterator> class reverse_iterator;
+T template <class Iterator>
+ bool operator==(
+ const reverse_iterator<Iterator>& x,
+ const reverse_iterator<Iterator>& y);
+T template <class Iterator>
+ bool operator<(
+ const reverse_iterator<Iterator>& x,
+ const reverse_iterator<Iterator>& y);
+T template <class Iterator>
+ bool operator!=(
+ const reverse_iterator<Iterator>& x,
+ const reverse_iterator<Iterator>& y);
+T template <class Iterator>
+ bool operator>(
+ const reverse_iterator<Iterator>& x,
+ const reverse_iterator<Iterator>& y);
+T template <class Iterator>
+ bool operator>=(
+ const reverse_iterator<Iterator>& x,
+ const reverse_iterator<Iterator>& y);
+T template <class Iterator>
+ bool operator<=(
+ const reverse_iterator<Iterator>& x,
+ const reverse_iterator<Iterator>& y);
+T template <class Iterator>
+ typename reverse_iterator<Iterator>::difference_type operator-(
+ const reverse_iterator<Iterator>& x,
+ const reverse_iterator<Iterator>& y);
+T template <class Iterator>
+ reverse_iterator<Iterator>
+ operator+(
+ typename reverse_iterator<Iterator>::difference_type n,
+ const reverse_iterator<Iterator>& x);
+
+X template <class Container> class back_insert_iterator;
+T template <class Container>
+ back_insert_iterator<Container> back_inserter(Container& x);
+X template <class Container> class front_insert_iterator;
+T template <class Container>
+ front_insert_iterator<Container> front_inserter(Container& x);
+X template <class Container> class insert_iterator;
+T template <class Container, class Iterator>
+ insert_iterator<Container> inserter(Container& x, Iterator i);
+ // _lib.stream.iterators_, stream iterators:
+X template <class T, class charT = char, class traits = char_traits<charT>,
+ class Distance = ptrdiff_t>
+ class istream_iterator;
+ template <class T, class charT, class traits, class Distance>
+X bool operator==(const istream_iterator<T,charT,traits,Distance>& x,
+ const istream_iterator<T,charT,traits,Distance>& y);
+ template <class T, class charT, class traits, class Distance>
+X bool operator!=(const istream_iterator<T,charT,traits,Distance>& x,
+ const istream_iterator<T,charT,traits,Distance>& y);
+X template <class T, class charT = char, class traits = char_traits<charT> >
+ class ostream_iterator;
+X template<class charT, class traits = char_traits<charT> >
+ class istreambuf_iterator;
+X template <class charT, class traits>
+ bool operator==(const istreambuf_iterator<charT,traits>& a,
+ const istreambuf_iterator<charT,traits>& b);
+X template <class charT, class traits>
+ bool operator!=(const istreambuf_iterator<charT,traits>& a,
+ const istreambuf_iterator<charT,traits>& b);
+T template <class charT, class traits = char_traits<charT> >
+ class ostreambuf_iterator;
+
+ 24.3 Iterator primitives [lib.iterator.primitives]
+
+T template<class Iterator> struct iterator_traits {
+T typedef typename Iterator::difference_type difference_type;
+T typedef typename Iterator::value_type value_type;
+T typedef typename Iterator::pointer pointer;
+T typedef typename Iterator::reference reference;
+T typedef typename Iterator::iterator_category iterator_category;
+ };
+
+T template<class T> struct iterator_traits<T*> {
+T typedef ptrdiff_t difference_type;
+T typedef T value_type;
+T typedef T* pointer;
+T typedef T& reference;
+T typedef random_access_iterator_tag iterator_category;
+ };
+
+T template<class T> struct iterator_traits<const T*> {
+T typedef ptrdiff_t difference_type;
+T typedef T value_type;
+T typedef const T* pointer;
+T typedef const T& reference;
+T typedef random_access_iterator_tag iterator_category;
+ };
+
+ 24.3.2 Basic iterator [lib.iterator.basic]
+
+ template<class Category, class T, class Distance = ptrdiff_t,
+ class Pointer = T*, class Reference = T&>
+X struct iterator {
+T typedef T value_type;
+T typedef Distance difference_type;
+T typedef Pointer pointer;
+T typedef Reference reference;
+T typedef Category iterator_category;
+ };
+
+ 24.3.3 Standard iterator tags [lib.std.iterator.tags]
+
+T struct input_iterator_tag {};
+T struct output_iterator_tag {};
+T struct forward_iterator_tag: public input_iterator_tag {};
+T struct bidirectional_iterator_tag: public forward_iterator_tag {};
+T struct random_access_iterator_tag: public bidirectional_iterator_tag {};
+
+
+ 24.4.1 Reverse iterators [lib.reverse.iterators]
+
+ template <class Iterator>
+X class reverse_iterator : public
+ iterator<typename iterator_traits<Iterator>::iterator_category,
+ typename iterator_traits<Iterator>::value_type,
+ typename iterator_traits<Iterator>::difference_type,
+ typename iterator_traits<Iterator>::pointer,
+ typename iterator_traits<Iterator>::reference> {
+ protected:
+T Iterator current;
+ public:
+T typedef Iterator
+ iterator_type;
+T typedef typename iterator_traits<Iterator>::difference_type
+ difference_type;
+T typedef typename iterator_traits<Iterator>::reference
+ reference;
+T typedef typename iterator_traits<Iterator>::pointer
+ pointer;
+
+T reverse_iterator();
+T explicit reverse_iterator(Iterator x);
+T template <class U> reverse_iterator(const reverse_iterator<U>& u);
+T Iterator base() const; // explicit
+T reference operator*() const;
+T pointer operator->() const;
+T reverse_iterator& operator++();
+T reverse_iterator operator++(int);
+T reverse_iterator& operator--();
+T reverse_iterator operator--(int);
+
+T reverse_iterator operator+ (difference_type n) const;
+T reverse_iterator& operator+=(difference_type n);
+T reverse_iterator operator- (difference_type n) const;
+T reverse_iterator& operator-=(difference_type n);
+T reference operator[](difference_type n) const;
+ };
+T template <class Iterator>
+ bool operator==(
+ const reverse_iterator<Iterator>& x,
+ const reverse_iterator<Iterator>& y);
+T template <class Iterator>
+ bool operator<(
+ const reverse_iterator<Iterator>& x,
+ const reverse_iterator<Iterator>& y);
+T template <class Iterator>
+ bool operator!=(
+ const reverse_iterator<Iterator>& x,
+ const reverse_iterator<Iterator>& y);
+T template <class Iterator>
+ bool operator>(
+ const reverse_iterator<Iterator>& x,
+ const reverse_iterator<Iterator>& y);
+T template <class Iterator>
+ bool operator>=(
+ const reverse_iterator<Iterator>& x,
+ const reverse_iterator<Iterator>& y);
+T template <class Iterator>
+ bool operator<=(
+ const reverse_iterator<Iterator>& x,
+ const reverse_iterator<Iterator>& y);
+T template <class Iterator>
+ typename reverse_iterator<Iterator>::difference_type operator-(
+ const reverse_iterator<Iterator>& x,
+ const reverse_iterator<Iterator>& y);
+T template <class Iterator>
+ reverse_iterator<Iterator> operator+(
+ typename reverse_iterator<Iterator>::difference_type n,
+ const reverse_iterator<Iterator>& x);
+
+
+ 24.4.2.1 Template class [lib.back.insert.iterator]
+ back_insert_iterator
+
+ template <class Container>
+X class back_insert_iterator :
+ public iterator<output_iterator_tag,void,void,void,void> {
+ protected:
+T Container* container;
+ public:
+T typedef Container container_type;
+T explicit back_insert_iterator(Container& x);
+T back_insert_iterator<Container>&
+ operator=(typename Container::const_reference value);
+
+T back_insert_iterator<Container>& operator*();
+T back_insert_iterator<Container>& operator++();
+T back_insert_iterator<Container> operator++(int);
+ };
+T template <class Container>
+ back_insert_iterator<Container> back_inserter(Container& x);
+
+
+
+ 24.4.2.3 Template class [lib.front.insert.iterator]
+ front_insert_iterator
+
+ template <class Container>
+X class front_insert_iterator :
+ public iterator<output_iterator_tag,void,void,void,void> {
+ protected:
+T Container* container;
+ public:
+T typedef Container container_type;
+T explicit front_insert_iterator(Container& x);
+T front_insert_iterator<Container>&
+ operator=(typename Container::const_reference value);
+T front_insert_iterator<Container>& operator*();
+T front_insert_iterator<Container>& operator++();
+T front_insert_iterator<Container> operator++(int);
+ };
+T template <class Container>
+ front_insert_iterator<Container> front_inserter(Container& x);
+
+
+ 24.4.2.5 Template class insert_iterator [lib.insert.iterator]
+
+ template <class Container>
+X class insert_iterator :
+ public iterator<output_iterator_tag,void,void,void,void> {
+ protected:
+T Container* container;
+T typename Container::iterator iter;
+ public:
+T typedef Container container_type;
+T insert_iterator(Container& x, typename Container::iterator i);
+T insert_iterator<Container>&
+ operator=(typename Container::const_reference value);
+T insert_iterator<Container>& operator*();
+T insert_iterator<Container>& operator++();
+T insert_iterator<Container>& operator++(int);
+ };
+T template <class Container, class Iterator>
+ insert_iterator<Container> inserter(Container& x, Iterator i);
+
+ 24.5.1 Template class istream_iterator [lib.istream.iterator]
+
+ template <class T, class charT = char, class traits = char_traits<charT>,
+ class Distance = ptrdiff_t>
+X class istream_iterator:
+ public iterator<input_iterator_tag, T, Distance, const T*, const T&> {
+ public:
+T typedef charT char_type
+T typedef traits traits_type;
+T typedef basic_istream<charT,traits> istream_type;
+T istream_iterator();
+T istream_iterator(istream_type& s);
+T istream_iterator(const istream_iterator<T,charT,traits,Distance>& x);
+T ~istream_iterator();
+
+T const T& operator*() const;
+T const T* operator->() const;
+T istream_iterator<T,charT,traits,Distance>& operator++();
+T istream_iterator<T,charT,traits,Distance> operator++(int);
+ };
+
+T template <class T, class charT, class traits, class Distance>
+ bool operator==(const istream_iterator<T,charT,traits,Distance>& x,
+ const istream_iterator<T,charT,traits,Distance>& y);
+T template <class T, class charT, class traits, class Distance>
+ bool operator!=(const istream_iterator<T,charT,traits,Distance>& x,
+ const istream_iterator<T,charT,traits,Distance>& y);
+
+
+ 24.5.2 Template class ostream_iterator [lib.ostream.iterator]
+
+ template <class T, class charT = char, class traits = char_traits<charT> >
+X class ostream_iterator:
+ public iterator<output_iterator_tag, void, void, void, void> {
+ public:
+T typedef charT char_type;
+T typedef traits traits_type;
+T typedef basic_ostream<charT,traits> ostream_type;
+T ostream_iterator(ostream_type& s);
+T ostream_iterator(ostream_type& s, const charT* delimiter);
+T ostream_iterator(const ostream_iterator<T,charT,traits>& x);
+T ~ostream_iterator();
+T ostream_iterator<T,charT,traits>& operator=(const T& value);
+
+T ostream_iterator<T,charT,traits>& operator*();
+T ostream_iterator<T,charT,traits>& operator++();
+T ostream_iterator<T,charT,traits>& operator++(int);
+ };
+
+
+ 24.5.3 Template class [lib.istreambuf.iterator]
+ istreambuf_iterator
+
+ template<class charT, class traits = char_traits<charT> >
+X class istreambuf_iterator
+ : public iterator<input_iterator_tag, charT,
+ typename traits::off_type, charT*, charT&> {
+ public:
+T typedef charT char_type;
+T typedef traits traits_type;
+T typedef typename traits::int_type int_type;
+T typedef basic_streambuf<charT,traits> streambuf_type;
+T typedef basic_istream<charT,traits> istream_type;
+T class proxy; // exposition only
+T istreambuf_iterator() throw();
+T istreambuf_iterator(istream_type& s) throw();
+T istreambuf_iterator(streambuf_type* s) throw();
+T istreambuf_iterator(const proxy& p) throw();
+T charT operator*() const;
+T istreambuf_iterator<charT,traits>& operator++();
+T proxy operator++(int);
+X bool equal(istreambuf_iterator& b);
+ };
+
+T template <class charT, class traits>
+ bool operator==(const istreambuf_iterator<charT,traits>& a,
+ const istreambuf_iterator<charT,traits>& b);
+
+T template <class charT, class traits>
+ bool operator!=(const istreambuf_iterator<charT,traits>& a,
+ const istreambuf_iterator<charT,traits>& b);
+
+ 24.5.3.1 Template class [lib.istreambuf.iterator::proxy]
+ istreambuf_iterator::proxy
+
+ template <class charT, class traits = char_traits<charT> >
+T class istreambuf_iterator<charT, traits>::proxy
+ {
+T charT keep_;
+T basic_streambuf<charT,traits>* sbuf_;
+T proxy(charT c,
+ basic_streambuf<charT,traits>* sbuf);
+ : keep_(c), sbuf_(sbuf) {}
+ public:
+T charT operator*() { return keep_; }
+ };
+
+
+
+ 24.5.4 Template class [lib.ostreambuf.iterator]
+ ostreambuf_iterator
+
+ template <class charT, class traits = char_traits<charT> >
+T class ostreambuf_iterator:
+ public iterator<output_iterator_tag, void, void, void, void> {
+ public:
+T typedef charT char_type;
+T typedef traits traits_type;
+T typedef basic_streambuf<charT,traits> streambuf_type;
+T typedef basic_ostream<charT,traits> ostream_type;
+ public:
+T ostreambuf_iterator(ostream_type& s) throw();
+T ostreambuf_iterator(streambuf_type* s) throw();
+T ostreambuf_iterator& operator=(charT c);
+T ostreambuf_iterator& operator*();
+T ostreambuf_iterator& operator++();
+T ostreambuf_iterator& operator++(int);
+T bool failed() const throw();
+ };
+
+
+ Header <algorithm> synopsis
+
+
+ // _lib.alg.nonmodifying_, non-modifying sequence operations:
+T template<class InputIterator, class Function>
+ Function for_each(InputIterator first, InputIterator last, Function f);
+T template<class InputIterator, class T>
+ InputIterator find(InputIterator first, InputIterator last,
+ const T& value);
+T template<class InputIterator, class Predicate>
+ InputIterator find_if(InputIterator first, InputIterator last,
+ Predicate pred);
+T template<class ForwardIterator1, class ForwardIterator2>
+ ForwardIterator1
+ find_end(ForwardIterator1 first1, ForwardIterator1 last1,
+ ForwardIterator2 first2, ForwardIterator2 last2);
+T template<class ForwardIterator1, class ForwardIterator2,
+ class BinaryPredicate>
+ ForwardIterator1
+ find_end(ForwardIterator1 first1, ForwardIterator1 last1,
+ ForwardIterator2 first2, ForwardIterator2 last2,
+ BinaryPredicate pred);
+T template<class ForwardIterator1, class ForwardIterator2>
+ ForwardIterator1
+ find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
+ ForwardIterator2 first2, ForwardIterator2 last2);
+T template<class ForwardIterator1, class ForwardIterator2,
+ class BinaryPredicate>
+ ForwardIterator1
+ find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
+ ForwardIterator2 first2, ForwardIterator2 last2,
+ BinaryPredicate pred);
+T template<class ForwardIterator>
+ ForwardIterator adjacent_find(ForwardIterator first,
+ ForwardIterator last);
+T template<class ForwardIterator, class BinaryPredicate>
+ ForwardIterator adjacent_find(ForwardIterator first,
+ ForwardIterator last, BinaryPredicate pred);
+T template<class InputIterator, class T>
+ typename iterator_traits<InputIterator>::difference_type
+ count(InputIterator first, InputIterator last, const T& value);
+T template<class InputIterator, class Predicate>
+ typename iterator_traits<InputIterator>::difference_type
+ count_if(InputIterator first, InputIterator last, Predicate pred);
+T template<class InputIterator1, class InputIterator2>
+ pair<InputIterator1, InputIterator2>
+ mismatch(InputIterator1 first1, InputIterator1 last1,
+ InputIterator2 first2);
+T template<class InputIterator1, class InputIterator2, class BinaryPredicate>
+ pair<InputIterator1, InputIterator2>
+ mismatch(InputIterator1 first1, InputIterator1 last1,
+ InputIterator2 first2, BinaryPredicate pred);
+
+T template<class InputIterator1, class InputIterator2>
+ bool equal(InputIterator1 first1, InputIterator1 last1,
+ InputIterator2 first2);
+T template<class InputIterator1, class InputIterator2, class BinaryPredicate>
+ bool equal(InputIterator1 first1, InputIterator1 last1,
+ InputIterator2 first2, BinaryPredicate pred);
+T template<class ForwardIterator1, class ForwardIterator2>
+ ForwardIterator1 search(ForwardIterator1 first1, ForwardIterator1 last1,
+ ForwardIterator2 first2, ForwardIterator2 last2);
+T template<class ForwardIterator1, class ForwardIterator2,
+ class BinaryPredicate>
+ ForwardIterator1 search(ForwardIterator1 first1, ForwardIterator1 last1,
+ ForwardIterator2 first2, ForwardIterator2 last2,
+ BinaryPredicate pred);
+T template<class ForwardIterator, class Size, class T>
+ ForwardIterator search_n(ForwardIterator first, ForwardIterator last,
+ Size count, const T& value);
+T template<class ForwardIterator, class Size, class T, class BinaryPredicate>
+ ForwardIterator1 search_n(ForwardIterator first, ForwardIterator last,
+ Size count, const T& value,
+ BinaryPredicate pred);
+ // _lib.alg.modifying.operations_, modifying sequence operations:
+ // _lib.alg.copy_, copy:
+T template<class InputIterator, class OutputIterator>
+ OutputIterator copy(InputIterator first, InputIterator last,
+ OutputIterator result);
+T template<class BidirectionalIterator1, class BidirectionalIterator2>
+ BidirectionalIterator2
+ copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last,
+ BidirectionalIterator2 result);
+ // _lib.alg.swap_, swap:
+T template<class T> void swap(T& a, T& b);
+T template<class ForwardIterator1, class ForwardIterator2>
+ ForwardIterator2 swap_ranges(ForwardIterator1 first1,
+ ForwardIterator1 last1, ForwardIterator2 first2);
+T template<class ForwardIterator1, class ForwardIterator2>
+ void iter_swap(ForwardIterator1 a, ForwardIterator2 b);
+T template<class InputIterator, class OutputIterator, class UnaryOperation>
+ OutputIterator transform(InputIterator first, InputIterator last,
+ OutputIterator result, UnaryOperation op);
+T template<class InputIterator1, class InputIterator2, class OutputIterator,
+ class BinaryOperation>
+ OutputIterator transform(InputIterator1 first1, InputIterator1 last1,
+ InputIterator2 first2, OutputIterator result,
+ BinaryOperation binary_op);
+
+T template<class ForwardIterator, class T>
+ void replace(ForwardIterator first, ForwardIterator last,
+ const T& old_value, const T& new_value);
+T template<class ForwardIterator, class Predicate, class T>
+ void replace_if(ForwardIterator first, ForwardIterator last,
+ Predicate pred, const T& new_value);
+T template<class InputIterator, class OutputIterator, class T>
+ OutputIterator replace_copy(InputIterator first, InputIterator last,
+ OutputIterator result,
+ const T& old_value, const T& new_value);
+T template<class Iterator, class OutputIterator, class Predicate, class T>
+ OutputIterator replace_copy_if(Iterator first, Iterator last,
+ OutputIterator result,
+ Predicate pred, const T& new_value);
+T template<class ForwardIterator, class T>
+ void fill(ForwardIterator first, ForwardIterator last, const T& value);
+T template<class OutputIterator, class Size, class T>
+ void fill_n(OutputIterator first, Size n, const T& value);
+T template<class ForwardIterator, class Generator>
+ void generate(ForwardIterator first, ForwardIterator last, Generator gen);
+T template<class OutputIterator, class Size, class Generator>
+ void generate_n(OutputIterator first, Size n, Generator gen);
+T template<class ForwardIterator, class T>
+ ForwardIterator remove(ForwardIterator first, ForwardIterator last,
+ const T& value);
+T template<class ForwardIterator, class Predicate>
+ ForwardIterator remove_if(ForwardIterator first, ForwardIterator last,
+ Predicate pred);
+T template<class InputIterator, class OutputIterator, class T>
+ OutputIterator remove_copy(InputIterator first, InputIterator last,
+ OutputIterator result, const T& value);
+T template<class InputIterator, class OutputIterator, class Predicate>
+ OutputIterator remove_copy_if(InputIterator first, InputIterator last,
+ OutputIterator result, Predicate pred);
+T template<class ForwardIterator>
+ ForwardIterator unique(ForwardIterator first, ForwardIterator last);
+T template<class ForwardIterator, class BinaryPredicate>
+ ForwardIterator unique(ForwardIterator first, ForwardIterator last,
+ BinaryPredicate pred);
+T template<class InputIterator, class OutputIterator>
+ OutputIterator unique_copy(InputIterator first, InputIterator last,
+ OutputIterator result);
+T template<class InputIterator, class OutputIterator, class BinaryPredicate>
+ OutputIterator unique_copy(InputIterator first, InputIterator last,
+ OutputIterator result, BinaryPredicate pred);
+T template<class BidirectionalIterator>
+ void reverse(BidirectionalIterator first, BidirectionalIterator last);
+T template<class BidirectionalIterator, class OutputIterator>
+ OutputIterator reverse_copy(BidirectionalIterator first,
+ BidirectionalIterator last,
+ OutputIterator result);
+
+T template<class ForwardIterator>
+ void rotate(ForwardIterator first, ForwardIterator middle,
+ ForwardIterator last);
+T template<class ForwardIterator, class OutputIterator>
+ OutputIterator rotate_copy(ForwardIterator first, ForwardIterator middle,
+ ForwardIterator last, OutputIterator result);
+T template<class RandomAccessIterator>
+ void random_shuffle(RandomAccessIterator first,
+ RandomAccessIterator last);
+T template<class RandomAccessIterator, class RandomNumberGenerator>
+ void random_shuffle(RandomAccessIterator first,
+ RandomAccessIterator last,
+ RandomNumberGenerator& rand);
+ // _lib.alg.partitions_, partitions:
+T template<class BidirectionalIterator, class Predicate>
+ BidirectionalIterator partition(BidirectionalIterator first,
+ BidirectionalIterator last,
+ Predicate pred);
+T template<class BidirectionalIterator, class Predicate>
+ BidirectionalIterator stable_partition(BidirectionalIterator first,
+ BidirectionalIterator last,
+ Predicate pred);
+ // _lib.alg.sorting_, sorting and related operations:
+ // _lib.alg.sort_, sorting:
+T template<class RandomAccessIterator>
+ void sort(RandomAccessIterator first, RandomAccessIterator last);
+T template<class RandomAccessIterator, class Compare>
+ void sort(RandomAccessIterator first, RandomAccessIterator last,
+ Compare comp);
+T template<class RandomAccessIterator>
+ void stable_sort(RandomAccessIterator first, RandomAccessIterator last);
+T template<class RandomAccessIterator, class Compare>
+ void stable_sort(RandomAccessIterator first, RandomAccessIterator last,
+ Compare comp);
+T template<class RandomAccessIterator>
+ void partial_sort(RandomAccessIterator first,
+ RandomAccessIterator middle,
+ RandomAccessIterator last);
+T template<class RandomAccessIterator, class Compare>
+ void partial_sort(RandomAccessIterator first,
+ RandomAccessIterator middle,
+ RandomAccessIterator last, Compare comp);
+T template<class InputIterator, class RandomAccessIterator>
+ RandomAccessIterator
+ partial_sort_copy(InputIterator first, InputIterator last,
+ RandomAccessIterator result_first,
+ RandomAccessIterator result_last);
+T template<class InputIterator, class RandomAccessIterator, class Compare>
+ RandomAccessIterator
+ partial_sort_copy(InputIterator first, InputIterator last,
+ RandomAccessIterator result_first,
+ RandomAccessIterator result_last,
+ Compare comp);
+
+T template<class RandomAccessIterator>
+ void nth_element(RandomAccessIterator first, RandomAccessIterator nth,
+ RandomAccessIterator last);
+T template<class RandomAccessIterator, class Compare>
+ void nth_element(RandomAccessIterator first, RandomAccessIterator nth,
+ RandomAccessIterator last, Compare comp);
+ // _lib.alg.binary.search_, binary search:
+T template<class ForwardIterator, class T>
+ ForwardIterator lower_bound(ForwardIterator first, ForwardIterator last,
+ const T& value);
+T template<class ForwardIterator, class T, class Compare>
+ ForwardIterator lower_bound(ForwardIterator first, ForwardIterator last,
+ const T& value, Compare comp);
+T template<class ForwardIterator, class T>
+ ForwardIterator upper_bound(ForwardIterator first, ForwardIterator last,
+ const T& value);
+T template<class ForwardIterator, class T, class Compare>
+ ForwardIterator upper_bound(ForwardIterator first, ForwardIterator last,
+ const T& value, Compare comp);
+T template<class ForwardIterator, class T>
+ pair<ForwardIterator, ForwardIterator>
+ equal_range(ForwardIterator first, ForwardIterator last,
+ const T& value);
+T template<class ForwardIterator, class T, class Compare>
+ pair<ForwardIterator, ForwardIterator>
+ equal_range(ForwardIterator first, ForwardIterator last,
+ const T& value, Compare comp);
+T template<class ForwardIterator, class T>
+ bool binary_search(ForwardIterator first, ForwardIterator last,
+ const T& value);
+T template<class ForwardIterator, class T, class Compare>
+ bool binary_search(ForwardIterator first, ForwardIterator last,
+ const T& value, Compare comp);
+ // _lib.alg.merge_, merge:
+T template<class InputIterator1, class InputIterator2, class OutputIterator>
+ OutputIterator merge(InputIterator1 first1, InputIterator1 last1,
+ InputIterator2 first2, InputIterator2 last2,
+ OutputIterator result);
+T template<class InputIterator1, class InputIterator2, class OutputIterator,
+ class Compare>
+ OutputIterator merge(InputIterator1 first1, InputIterator1 last1,
+ InputIterator2 first2, InputIterator2 last2,
+ OutputIterator result, Compare comp);
+T template<class BidirectionalIterator>
+ void inplace_merge(BidirectionalIterator first,
+ BidirectionalIterator middle,
+ BidirectionalIterator last);
+T template<class BidirectionalIterator, class Compare>
+ void inplace_merge(BidirectionalIterator first,
+ BidirectionalIterator middle,
+ BidirectionalIterator last, Compare comp);
+
+ // _lib.alg.set.operations_, set operations:
+T template<class InputIterator1, class InputIterator2>
+ bool includes(InputIterator1 first1, InputIterator1 last1,
+ InputIterator2 first2, InputIterator2 last2);
+T template<class InputIterator1, class InputIterator2, class Compare>
+ bool includes(InputIterator1 first1, InputIterator1 last1,
+ InputIterator2 first2, InputIterator2 last2, Compare comp);
+T template<class InputIterator1, class InputIterator2, class OutputIterator>
+ OutputIterator set_union(InputIterator1 first1, InputIterator1 last1,
+ InputIterator2 first2, InputIterator2 last2,
+ OutputIterator result);
+T template<class InputIterator1, class InputIterator2, class OutputIterator,
+ class Compare>
+ OutputIterator set_union(InputIterator1 first1, InputIterator1 last1,
+ InputIterator2 first2, InputIterator2 last2,
+ OutputIterator result, Compare comp);
+T template<class InputIterator1, class InputIterator2, class OutputIterator>
+ OutputIterator set_intersection
+ (InputIterator1 first1, InputIterator1 last1,
+ InputIterator2 first2, InputIterator2 last2,
+ OutputIterator result);
+T template<class InputIterator1, class InputIterator2, class OutputIterator,
+ class Compare>
+ OutputIterator set_intersection
+ (InputIterator1 first1, InputIterator1 last1,
+ InputIterator2 first2, InputIterator2 last2,
+ OutputIterator result, Compare comp);
+T template<class InputIterator1, class InputIterator2, class OutputIterator>
+ OutputIterator set_difference
+ (InputIterator1 first1, InputIterator1 last1,
+ InputIterator2 first2, InputIterator2 last2,
+ OutputIterator result);
+T template<class InputIterator1, class InputIterator2, class OutputIterator,
+ class Compare>
+ OutputIterator set_difference(InputIterator1 first1, InputIterator1 last1,
+ InputIterator2 first2, InputIterator2 last2,
+ OutputIterator result, Compare comp);
+T template<class InputIterator1, class InputIterator2, class OutputIterator>
+ OutputIterator
+ set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
+ InputIterator2 first2, InputIterator2 last2,
+ OutputIterator result);
+T template<class InputIterator1, class InputIterator2, class OutputIterator,
+ class Compare>
+ OutputIterator
+ set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
+ InputIterator2 first2, InputIterator2 last2,
+ OutputIterator result, Compare comp);
+ // _lib.alg.heap.operations_, heap operations:
+T template<class RandomAccessIterator>
+ void push_heap(RandomAccessIterator first, RandomAccessIterator last);
+T template<class RandomAccessIterator, class Compare>
+ void push_heap(RandomAccessIterator first, RandomAccessIterator last,
+ Compare comp);
+
+T template<class RandomAccessIterator>
+ void pop_heap(RandomAccessIterator first, RandomAccessIterator last);
+T template<class RandomAccessIterator, class Compare>
+ void pop_heap(RandomAccessIterator first, RandomAccessIterator last,
+ Compare comp);
+T template<class RandomAccessIterator>
+ void make_heap(RandomAccessIterator first, RandomAccessIterator last);
+T template<class RandomAccessIterator, class Compare>
+ void make_heap(RandomAccessIterator first, RandomAccessIterator last,
+ Compare comp);
+T template<class RandomAccessIterator>
+ void sort_heap(RandomAccessIterator first, RandomAccessIterator last);
+T template<class RandomAccessIterator, class Compare>
+ void sort_heap(RandomAccessIterator first, RandomAccessIterator last,
+ Compare comp);
+ // _lib.alg.min.max_, minimum and maximum:
+T template<class T> const T& min(const T& a, const T& b);
+T template<class T, class Compare>
+ const T& min(const T& a, const T& b, Compare comp);
+T template<class T> const T& max(const T& a, const T& b);
+T template<class T, class Compare>
+ const T& max(const T& a, const T& b, Compare comp);
+T template<class ForwardIterator>
+ ForwardIterator min_element(ForwardIterator first, ForwardIterator last);
+T template<class ForwardIterator, class Compare>
+ ForwardIterator min_element(ForwardIterator first, ForwardIterator last,
+ Compare comp);
+T template<class ForwardIterator>
+ ForwardIterator max_element(ForwardIterator first, ForwardIterator last);
+T template<class ForwardIterator, class Compare>
+ ForwardIterator max_element(ForwardIterator first, ForwardIterator last,
+ Compare comp);
+T template<class InputIterator1, class InputIterator2>
+ bool lexicographical_compare
+ (InputIterator1 first1, InputIterator1 last1,
+ InputIterator2 first2, InputIterator2 last2);
+T template<class InputIterator1, class InputIterator2, class Compare>
+ bool lexicographical_compare
+ (InputIterator1 first1, InputIterator1 last1,
+ InputIterator2 first2, InputIterator2 last2,
+ Compare comp);
+
+ // _lib.alg.permutation.generators_, permutations
+T template<class BidirectionalIterator>
+ bool next_permutation(BidirectionalIterator first,
+ BidirectionalIterator last);
+T template<class BidirectionalIterator, class Compare>
+ bool next_permutation(BidirectionalIterator first,
+ BidirectionalIterator last, Compare comp);
+T template<class BidirectionalIterator>
+ bool prev_permutation(BidirectionalIterator first,
+ BidirectionalIterator last);
+T template<class BidirectionalIterator, class Compare>
+ bool prev_permutation(BidirectionalIterator first,
+ BidirectionalIterator last, Compare comp);
+
+
+ 25.4 C library algorithms [lib.alg.c.library]
+
+ 1 Header <cstdlib> (partial, Table 2):
+
+ Table 2--Header <cstdlib> synopsis
+
+ Functions: bsearch qsort
+
+
+X extern "C" void *bsearch(const void *key, const void *base,
+ size_t nmemb, size_t size,
+ int (*compar)(const void *, const void *));
+X extern "C++" void *bsearch(const void *key, const void *base,
+ size_t nmemb, size_t size,
+ int (*compar)(const void *, const void *));
+
+X extern "C" void qsort(void* base, size_t nmemb, size_t size,
+ int (*compar)(const void*, const void*));
+X extern "C++" void qsort(void* base, size_t nmemb, size_t size,
+ int (*compar)(const void*, const void*));
+
+
+
+ 26.2 Complex numbers [lib.complex.numbers]
+
+
+ 26.2.1 Header <complex> synopsis [lib.complex.synopsis]
+
+T template<class T> class complex;
+T template<> class complex<float>;
+T template<> class complex<double>;
+T template<> class complex<long double>;
+ // _lib.complex.ops_ operators:
+T template<class T>
+ complex<T> operator+(const complex<T>&, const complex<T>&);
+T template<class T> complex<T> operator+(const complex<T>&, const T&);
+T template<class T> complex<T> operator+(const T&, const complex<T>&);
+T template<class T> complex<T> operator-
+ (const complex<T>&, const complex<T>&);
+T template<class T> complex<T> operator-(const complex<T>&, const T&);
+T template<class T> complex<T> operator-(const T&, const complex<T>&);
+T template<class T> complex<T> operator*
+ (const complex<T>&, const complex<T>&);
+T template<class T> complex<T> operator*(const complex<T>&, const T&);
+T template<class T> complex<T> operator*(const T&, const complex<T>&);
+T template<class T> complex<T> operator/
+ (const complex<T>&, const complex<T>&);
+T template<class T> complex<T> operator/(const complex<T>&, const T&);
+T template<class T> complex<T> operator/(const T&, const complex<T>&);
+T template<class T> complex<T> operator+(const complex<T>&);
+T template<class T> complex<T> operator-(const complex<T>&);
+T template<class T> bool operator==
+ (const complex<T>&, const complex<T>&);
+T template<class T> bool operator==(const complex<T>&, const T&);
+T template<class T> bool operator==(const T&, const complex<T>&);
+T template<class T> bool operator!=(const complex<T>&, const complex<T>&);
+T template<class T> bool operator!=(const complex<T>&, const T&);
+T template<class T> bool operator!=(const T&, const complex<T>&);
+T template<class T, class charT, class traits>
+ basic_istream<charT, traits>&
+ operator>>(basic_istream<charT, traits>&, complex<T>&);
+
+T template<class T, class charT, class traits>
+ basic_ostream<charT, traits>&
+ operator<<(basic_ostream<charT, traits>&, const complex<T>&);
+ // _lib.complex.value.ops_ values:
+T template<class T> T real(const complex<T>&);
+T template<class T> T imag(const complex<T>&);
+
+T template<class T> T abs(const complex<T>&);
+T template<class T> T arg(const complex<T>&);
+T template<class T> T norm(const complex<T>&);
+T template<class T> complex<T> conj(const complex<T>&);
+T template<class T> complex<T> polar(const T&, const T&);
+ // _lib.complex.transcendentals_ transcendentals:
+T template<class T> complex<T> cos (const complex<T>&);
+T template<class T> complex<T> cosh (const complex<T>&);
+T template<class T> complex<T> exp (const complex<T>&);
+T template<class T> complex<T> log (const complex<T>&);
+T template<class T> complex<T> log10(const complex<T>&);
+T template<class T> complex<T> pow(const complex<T>&, int);
+T template<class T> complex<T> pow(const complex<T>&, const T&);
+T template<class T> complex<T> pow(const complex<T>&, const complex<T>&);
+T template<class T> complex<T> pow(const T&, const complex<T>&);
+T template<class T> complex<T> sin (const complex<T>&);
+T template<class T> complex<T> sinh (const complex<T>&);
+T template<class T> complex<T> sqrt (const complex<T>&);
+T template<class T> complex<T> tan (const complex<T>&);
+T template<class T> complex<T> tanh (const complex<T>&);
+ }
+
+ 26.2.2 Template class complex [lib.complex]
+
+ template<class T>
+T class complex {
+ public:
+T typedef T value_type;
+
+T complex(const T& re = T(), const T& im = T());
+T complex(const complex&);
+T template<class X> complex(const complex<X>&);
+
+T T real() const;
+T T imag() const;
+
+T complex<T>& operator= (const T&);
+T complex<T>& operator+=(const T&);
+T complex<T>& operator-=(const T&);
+T complex<T>& operator*=(const T&);
+T complex<T>& operator/=(const T&);
+
+T complex& operator=(const complex&);
+T template<class X> complex<T>& operator= (const complex<X>&);
+T template<class X> complex<T>& operator+=(const complex<X>&);
+T template<class X> complex<T>& operator-=(const complex<X>&);
+T template<class X> complex<T>& operator*=(const complex<X>&);
+T template<class X> complex<T>& operator/=(const complex<X>&);
+ };
+
+T template<class T> complex<T> operator+
+ (const complex<T>&, const complex<T>&);
+T template<class T> complex<T> operator+(const complex<T>&, const T&);
+T template<class T> complex<T> operator+(const T&, const complex<T>&);
+
+T template<class T> complex<T> operator-
+ (const complex<T>&, const complex<T>&);
+T template<class T> complex<T> operator-(const complex<T>&, const T&);
+T template<class T> complex<T> operator-(const T&, const complex<T>&);
+
+T template<class T> complex<T> operator*
+ (const complex<T>&, const complex<T>&);
+T template<class T> complex<T> operator*(const complex<T>&, const T&);
+T template<class T> complex<T> operator*(const T&, const complex<T>&);
+
+T template<class T> complex<T> operator/
+ (const complex<T>&, const complex<T>&);
+T template<class T> complex<T> operator/(const complex<T>&, const T&);
+T template<class T> complex<T> operator/(const T&, const complex<T>&);
+
+T template<class T> complex<T> operator+(const complex<T>&);
+T template<class T> complex<T> operator-(const complex<T>&);
+
+T template<class T> bool operator==(const complex<T>&, const complex<T>&);
+T template<class T> bool operator==(const complex<T>&, const T&);
+T template<class T> bool operator==(const T&, const complex<T>&);
+
+T template<class T> bool operator!=(const complex<T>&, const complex<T>&);
+T template<class T> bool operator!=(const complex<T>&, const T&);
+T template<class T> bool operator!=(const T&, const complex<T>&);
+
+T template<class T, class charT, class traits>
+ basic_istream<charT, traits>&
+ operator>>(basic_istream<charT, traits>&, complex<T>&);
+
+T template<class T, class charT, class traits>
+ basic_ostream<charT, traits>&
+ operator<<(basic_ostream<charT, traits>&, const complex<T>&);
+
+
+ 26.2.3 complex specializations [lib.complex.special]
+
+T template<> class complex<float> {
+ public:
+T typedef float value_type;
+
+T complex(float re = 0.0f, float im = 0.0f);
+T explicit complex(const complex<double>&);
+T explicit complex(const complex<long double>&);
+T float real() const;
+T float imag() const;
+
+T complex<float>& operator= (float);
+T complex<float>& operator+=(float);
+T complex<float>& operator-=(float);
+T complex<float>& operator*=(float);
+T complex<float>& operator/=(float);
+
+T complex<float>& operator=(const complex<float>&);
+T template<class X> complex<float>& operator= (const complex<X>&);
+T template<class X> complex<float>& operator+=(const complex<X>&);
+T template<class X> complex<float>& operator-=(const complex<X>&);
+T template<class X> complex<float>& operator*=(const complex<X>&);
+T template<class X> complex<float>& operator/=(const complex<X>&);
+ };
+T template<> class complex<double> {
+ public:
+T typedef double value_type;
+
+T complex(double re = 0.0, double im = 0.0);
+T complex(const complex<float>&);
+T explicit complex(const complex<long double>&);
+T double real() const;
+T double imag() const;
+
+T complex<double>& operator= (double);
+T complex<double>& operator+=(double);
+T complex<double>& operator-=(double);
+T complex<double>& operator*=(double);
+T complex<double>& operator/=(double);
+
+T complex<double>& operator=(const complex<double>&);
+T template<class X> complex<double>& operator= (const complex<X>&);
+T template<class X> complex<double>& operator+=(const complex<X>&);
+T template<class X> complex<double>& operator-=(const complex<X>&);
+T template<class X> complex<double>& operator*=(const complex<X>&);
+T template<class X> complex<double>& operator/=(const complex<X>&);
+ };
+
+T template<> class complex<long double> {
+ public:
+T typedef long double value_type;
+
+T complex(long double re = 0.0L, long double im = 0.0L);
+T complex(const complex<float>&);
+T complex(const complex<double>&);
+T long double real() const;
+T long double imag() const;
+
+T complex<long double>& operator=(const complex<long double>&);
+T complex<long double>& operator= (long double);
+T complex<long double>& operator+=(long double);
+T complex<long double>& operator-=(long double);
+T complex<long double>& operator*=(long double);
+T complex<long double>& operator/=(long double);
+
+T template<class X> complex<long double>& operator= (const complex<X>&);
+T template<class X> complex<long double>& operator+=(const complex<X>&);
+T template<class X> complex<long double>& operator-=(const complex<X>&);
+T template<class X> complex<long double>& operator*=(const complex<X>&);
+T template<class X> complex<long double>& operator/=(const complex<X>&);
+ };
+
+ 26.3 Numeric arrays [lib.numarray]
+
+ 26.3.1 Header <valarray> synopsis [lib.valarray.synopsis]
+
+T template<class T> class valarray; // An array of type T
+T class slice;
+T template<class T> class slice_array;
+T class gslice;
+T template<class T> class gslice_array;
+T template<class T> class mask_array; // a masked array
+T template<class T> class indirect_array; // an indirected array
+
+T template<class T> valarray<T> operator*
+ (const valarray<T>&, const valarray<T>&);
+T template<class T> valarray<T> operator* (const valarray<T>&, const T&);
+T template<class T> valarray<T> operator* (const T&, const valarray<T>&);
+T template<class T> valarray<T> operator/
+ (const valarray<T>&, const valarray<T>&);
+T template<class T> valarray<T> operator/ (const valarray<T>&, const T&);
+T template<class T> valarray<T> operator/ (const T&, const valarray<T>&);
+T template<class T> valarray<T> operator%
+ (const valarray<T>&, const valarray<T>&);
+T template<class T> valarray<T> operator% (const valarray<T>&, const T&);
+T template<class T> valarray<T> operator% (const T&, const valarray<T>&);
+T template<class T> valarray<T> operator+
+ (const valarray<T>&, const valarray<T>&);
+T template<class T> valarray<T> operator+ (const valarray<T>&, const T&);
+T template<class T> valarray<T> operator+ (const T&, const valarray<T>&);
+T template<class T> valarray<T> operator-
+ (const valarray<T>&, const valarray<T>&);
+T template<class T> valarray<T> operator- (const valarray<T>&, const T&);
+T template<class T> valarray<T> operator- (const T&, const valarray<T>&);
+T template<class T> valarray<T> operator^
+ (const valarray<T>&, const valarray<T>&);
+T template<class T> valarray<T> operator^ (const valarray<T>&, const T&);
+T template<class T> valarray<T> operator^ (const T&, const valarray<T>&);
+T template<class T> valarray<T> operator&
+ (const valarray<T>&, const valarray<T>&);
+T template<class T> valarray<T> operator& (const valarray<T>&, const T&);
+T template<class T> valarray<T> operator& (const T&, const valarray<T>&);
+T template<class T> valarray<T> operator|
+ (const valarray<T>&, const valarray<T>&);
+T template<class T> valarray<T> operator| (const valarray<T>&, const T&);
+T template<class T> valarray<T> operator| (const T&, const valarray<T>&);
+T template<class T> valarray<T> operator<<
+ (const valarray<T>&, const valarray<T>&);
+T template<class T> valarray<T> operator<<(const valarray<T>&, const T&);
+T template<class T> valarray<T> operator<<(const T&, const valarray<T>&);
+T template<class T> valarray<T> operator>>
+ (const valarray<T>&, const valarray<T>&);
+T template<class T> valarray<T> operator>>(const valarray<T>&, const T&);
+T template<class T> valarray<T> operator>>(const T&, const valarray<T>&);
+T template<class T> valarray<bool> operator&&
+ (const valarray<T>&, const valarray<T>&);
+T template<class T> valarray<bool> operator&&(const valarray<T>&, const T&);
+T template<class T> valarray<bool> operator&&(const T&, const valarray<T>&);
+T template<class T> valarray<bool> operator||
+ (const valarray<T>&, const valarray<T>&);
+T template<class T> valarray<bool> operator||(const valarray<T>&, const T&);
+T template<class T> valarray<bool> operator||(const T&, const valarray<T>&);
+
+T template<class T>
+ valarray<bool> operator==(const valarray<T>&, const valarray<T>&);
+T template<class T> valarray<bool> operator==(const valarray<T>&, const T&);
+T template<class T> valarray<bool> operator==(const T&, const valarray<T>&);
+T template<class T>
+ valarray<bool> operator!=(const valarray<T>&, const valarray<T>&);
+T template<class T> valarray<bool> operator!=(const valarray<T>&, const T&);
+T template<class T> valarray<bool> operator!=(const T&, const valarray<T>&);
+T template<class T>
+ valarray<bool> operator< (const valarray<T>&, const valarray<T>&);
+T template<class T> valarray<bool> operator< (const valarray<T>&, const T&);
+T template<class T> valarray<bool> operator< (const T&, const valarray<T>&);
+T template<class T>
+ valarray<bool> operator> (const valarray<T>&, const valarray<T>&);
+T template<class T> valarray<bool> operator> (const valarray<T>&, const T&);
+T template<class T> valarray<bool> operator> (const T&, const valarray<T>&);
+T template<class T>
+ valarray<bool> operator<=(const valarray<T>&, const valarray<T>&);
+T template<class T> valarray<bool> operator<=(const valarray<T>&, const T&);
+T template<class T> valarray<bool> operator<=(const T&, const valarray<T>&);
+T template<class T>
+ valarray<bool> operator>=(const valarray<T>&, const valarray<T>&);
+T template<class T> valarray<bool> operator>=(const valarray<T>&, const T&);
+T template<class T> valarray<bool> operator>=(const T&, const valarray<T>&);
+T template<class T> valarray<T> abs (const valarray<T>&);
+T template<class T> valarray<T> acos (const valarray<T>&);
+T template<class T> valarray<T> asin (const valarray<T>&);
+T template<class T> valarray<T> atan (const valarray<T>&);
+T template<class T> valarray<T> atan2
+ (const valarray<T>&, const valarray<T>&);
+T template<class T> valarray<T> atan2(const valarray<T>&, const T&);
+T template<class T> valarray<T> atan2(const T&, const valarray<T>&);
+T template<class T> valarray<T> cos (const valarray<T>&);
+T template<class T> valarray<T> cosh (const valarray<T>&);
+T template<class T> valarray<T> exp (const valarray<T>&);
+T template<class T> valarray<T> log (const valarray<T>&);
+T template<class T> valarray<T> log10(const valarray<T>&);
+T template<class T> valarray<T> pow(const valarray<T>&, const valarray<T>&);
+T template<class T> valarray<T> pow(const valarray<T>&, const T&);
+T template<class T> valarray<T> pow(const T&, const valarray<T>&);
+T template<class T> valarray<T> sin (const valarray<T>&);
+T template<class T> valarray<T> sinh (const valarray<T>&);
+T template<class T> valarray<T> sqrt (const valarray<T>&);
+T template<class T> valarray<T> tan (const valarray<T>&);
+T template<class T> valarray<T> tanh (const valarray<T>&);
+ }
+
+
+ 26.3.2 Template class valarray [lib.template.valarray]
+
+T template<class T> class valarray {
+ public:
+T typedef T value_type;
+
+ // _lib.valarray.cons_ construct/destroy:
+T valarray();
+T explicit valarray(size_t);
+T valarray(const T&, size_t);
+T valarray(const T*, size_t);
+T valarray(const valarray&);
+T valarray(const slice_array<T>&);
+T valarray(const gslice_array<T>&);
+T valarray(const mask_array<T>&);
+T valarray(const indirect_array<T>&);
+T ~valarray();
+
+ // _lib.valarray.assign_ assignment:
+T valarray<T>& operator=(const valarray<T>&);
+T valarray<T>& operator=(const T&);
+T valarray<T>& operator=(const slice_array<T>&);
+T valarray<T>& operator=(const gslice_array<T>&);
+T valarray<T>& operator=(const mask_array<T>&);
+T valarray<T>& operator=(const indirect_array<T>&);
+ // _lib.valarray.access_ element access:
+T T operator[](size_t) const;
+T T& operator[](size_t);
+ // _lib.valarray.sub_ subset operations:
+T valarray<T> operator[](slice) const;
+T slice_array<T> operator[](slice);
+T valarray<T> operator[](const gslice&) const;
+T gslice_array<T> operator[](const gslice&);
+T valarray<T> operator[](const valarray<bool>&) const;
+T mask_array<T> operator[](const valarray<bool>&);
+T valarray<T> operator[](const valarray<size_t>&) const;
+T indirect_array<T> operator[](const valarray<size_t>&);
+ // _lib.valarray.unary_ unary operators:
+T valarray<T> operator+() const;
+T valarray<T> operator-() const;
+T valarray<T> operator~() const;
+T valarray<T> operator!() const;
+ // _lib.valarray.cassign_ computed assignment:
+T valarray<T>& operator*= (const T&);
+T valarray<T>& operator/= (const T&);
+T valarray<T>& operator%= (const T&);
+T valarray<T>& operator+= (const T&);
+T valarray<T>& operator-= (const T&);
+T valarray<T>& operator^= (const T&);
+T valarray<T>& operator&= (const T&);
+T valarray<T>& operator|= (const T&);
+T valarray<T>& operator<<=(const T&);
+T valarray<T>& operator>>=(const T&);
+T valarray<T>& operator*= (const valarray<T>&);
+T valarray<T>& operator/= (const valarray<T>&);
+T valarray<T>& operator%= (const valarray<T>&);
+T valarray<T>& operator+= (const valarray<T>&);
+T valarray<T>& operator-= (const valarray<T>&);
+T valarray<T>& operator^= (const valarray<T>&);
+T valarray<T>& operator|= (const valarray<T>&);
+T valarray<T>& operator&= (const valarray<T>&);
+T valarray<T>& operator<<=(const valarray<T>&);
+T valarray<T>& operator>>=(const valarray<T>&);
+ // _lib.valarray.members_ member functions:
+T size_t size() const;
+T T sum() const;
+T T min() const;
+T T max() const;
+
+T valarray<T> shift (int) const;
+T valarray<T> cshift(int) const;
+T valarray<T> apply(T func(T)) const;
+T valarray<T> apply(T func(const T&)) const;
+T void resize(size_t sz, T c = T());
+ };
+ }
+
+
+
+ 26.3.4 Class slice [lib.class.slice]
+
+T class slice {
+ public:
+T slice();
+T slice(size_t, size_t, size_t);
+
+T size_t start() const;
+T size_t size() const;
+T size_t stride() const;
+ };
+ }
+
+
+
+ 26.3.5 Template class slice_array [lib.template.slice.array]
+
+T template <class T> class slice_array {
+ public:
+T typedef T value_type;
+
+T void operator= (const valarray<T>&) const;
+T void operator*= (const valarray<T>&) const;
+T void operator/= (const valarray<T>&) const;
+T void operator%= (const valarray<T>&) const;
+T void operator+= (const valarray<T>&) const;
+T void operator-= (const valarray<T>&) const;
+T void operator^= (const valarray<T>&) const;
+T void operator&= (const valarray<T>&) const;
+T void operator|= (const valarray<T>&) const;
+T void operator<<=(const valarray<T>&) const;
+T void operator>>=(const valarray<T>&) const;
+T void operator=(const T&);
+T ~slice_array();
+ private:
+T slice_array();
+T slice_array(const slice_array&);
+T slice_array& operator=(const slice_array&);
+ };
+ }
+
+
+
+ 26.3.6 The gslice class [lib.class.gslice]
+
+T class gslice {
+ public:
+T gslice();
+T gslice(size_t s, const valarray<size_t>& l, const valarray<size_t>& d);
+
+T size_t start() const;
+T valarray<size_t> size() const;
+T valarray<size_t> stride() const;
+ };
+
+
+ 26.3.7 Template class gslice_array [lib.template.gslice.array]
+
+T template <class T> class gslice_array {
+ public:
+T typedef T value_type;
+
+T void operator= (const valarray<T>&) const;
+T void operator*= (const valarray<T>&) const;
+T void operator/= (const valarray<T>&) const;
+T void operator%= (const valarray<T>&) const;
+T void operator+= (const valarray<T>&) const;
+T void operator-= (const valarray<T>&) const;
+T void operator^= (const valarray<T>&) const;
+T void operator&= (const valarray<T>&) const;
+T void operator|= (const valarray<T>&) const;
+T void operator<<=(const valarray<T>&) const;
+T void operator>>=(const valarray<T>&) const;
+T void operator=(const T&);
+T ~gslice_array();
+ private:
+T gslice_array();
+T gslice_array(const gslice_array&);
+T gslice_array& operator=(const gslice_array&);
+ };
+
+
+ 26.3.8 Template class mask_array [lib.template.mask.array]
+
+T template <class T> class mask_array {
+ public:
+T typedef T value_type;
+
+T void operator= (const valarray<T>&) const;
+T void operator*= (const valarray<T>&) const;
+T void operator/= (const valarray<T>&) const;
+T void operator%= (const valarray<T>&) const;
+T void operator+= (const valarray<T>&) const;
+T void operator-= (const valarray<T>&) const;
+T void operator^= (const valarray<T>&) const;
+T void operator&= (const valarray<T>&) const;
+T void operator|= (const valarray<T>&) const;
+T void operator<<=(const valarray<T>&) const;
+T void operator>>=(const valarray<T>&) const;
+T void operator=(const T&);
+T ~mask_array();
+ private:
+T mask_array();
+T mask_array(const mask_array&);
+T mask_array& operator=(const mask_array&);
+ // remainder implementation defined
+ };
+
+
+ 26.3.9 Template class [lib.template.indirect.array]
+ indirect_array
+
+T template <class T> class indirect_array {
+ public:
+T typedef T value_type;
+
+T void operator= (const valarray<T>&) const;
+T void operator*= (const valarray<T>&) const;
+T void operator/= (const valarray<T>&) const;
+T void operator%= (const valarray<T>&) const;
+T void operator+= (const valarray<T>&) const;
+T void operator-= (const valarray<T>&) const;
+T void operator^= (const valarray<T>&) const;
+T void operator&= (const valarray<T>&) const;
+T void operator|= (const valarray<T>&) const;
+T void operator<<=(const valarray<T>&) const;
+T void operator>>=(const valarray<T>&) const;
+T void operator=(const T&);
+T ~indirect_array();
+ private:
+T indirect_array();
+T indirect_array(const indirect_array&);
+T indirect_array& operator=(const indirect_array&);
+ // remainder implementation defined
+ };
+
+ 26.4 Generalized numeric operations [lib.numeric.ops]
+
+ Header <numeric> synopsis
+
+T template <class InputIterator, class T>
+ T accumulate(InputIterator first, InputIterator last, T init);
+
+T template <class InputIterator, class T, class BinaryOperation>
+ T accumulate(InputIterator first, InputIterator last, T init,
+ BinaryOperation binary_op);
+
+T template <class InputIterator1, class InputIterator2, class T>
+ T inner_product(InputIterator1 first1, InputIterator1 last1,
+ InputIterator2 first2, T init);
+
+T template <class InputIterator1, class InputIterator2, class T,
+ class BinaryOperation1, class BinaryOperation2>
+ T inner_product(InputIterator1 first1, InputIterator1 last1,
+ InputIterator2 first2, T init,
+ BinaryOperation1 binary_op1,
+ BinaryOperation2 binary_op2);
+
+T template <class InputIterator, class OutputIterator>
+ OutputIterator partial_sum(InputIterator first,
+ InputIterator last,
+ OutputIterator result);
+
+T template <class InputIterator, class OutputIterator,
+ class BinaryOperation>
+ OutputIterator partial_sum(InputIterator first,
+ InputIterator last,
+ OutputIterator result,
+ BinaryOperation binary_op);
+
+T template <class InputIterator, class OutputIterator>
+ OutputIterator adjacent_difference(InputIterator first,
+ InputIterator last,
+ OutputIterator result);
+
+T template <class InputIterator, class OutputIterator,
+ class BinaryOperation>
+ OutputIterator adjacent_difference(InputIterator first,
+ InputIterator last,
+ OutputIterator result,
+ BinaryOperation binary_op);
+
+
+ 26.5 C Library [lib.c.math]
+
+ Table 2--Header <cmath> synopsis
+X Macro: HUGE_VAL
+ Functions:
+X acos cos fmod modf tan
+X asin cosh frexp pow tanh
+X atan exp ldexp sin
+X atan2 fabs log sinh
+X ceil floor log10 sqrt
+
+ Table 3--Header <cstdlib> synopsis
+X Macros: RAND_MAX
+X Types: div_t ldiv_t
+ Functions:
+X abs labs srand
+X div ldiv rand
+
+X long abs(long); // labs()
+X ldiv_t div(long, long); // ldiv()
+
+X float abs (float);
+X float acos (float);
+X float asin (float);
+X float atan (float);
+X float atan2(float, float);
+X float ceil (float);
+X float cos (float);
+X float cosh (float);
+X float exp (float);
+X float fabs (float);
+X float floor(float);
+X float fmod (float, float);
+X float frexp(float, int*);
+X float ldexp(float, int);
+X float log (float);
+X float log10(float);
+X float modf (float, float*);
+X float pow (float, float);
+X float pow (float, int);
+X float sin (float);
+X float sinh (float);
+X float sqrt (float);
+X float tan (float);
+X float tanh (float);
+
+X double abs(double); // fabs()
+X double pow(double, int);
+
+X long double abs (long double);
+X long double acos (long double);
+X long double asin (long double);
+X long double atan (long double);
+X long double atan2(long double, long double);
+X long double ceil (long double);
+X long double cos (long double);
+X long double cosh (long double);
+X long double exp (long double);
+X long double fabs (long double);
+X long double floor(long double);
+X long double fmod (long double, long double);
+X long double frexp(long double, int*);
+X long double ldexp(long double, int);
+X long double log (long double);
+X long double log10(long double);
+X long double modf (long double, long double*);
+X long double pow (long double, long double);
+X long double pow (long double, int);
+X long double sin (long double);
+X long double sinh (long double);
+X long double sqrt (long double);
+X long double tan (long double);
+X long double tanh (long double);
+
+ Header <iosfwd> synopsis
+
+X template<class charT> class char_traits;
+X template<> class char_traits<char>;
+X template<> class char_traits<wchar_t>;
+X template<class T> class allocator;
+X template <class charT, class traits = char_traits<charT> >
+ class basic_ios;
+
+X template <class charT, class traits = char_traits<charT> >
+ class basic_streambuf;
+
+X template <class charT, class traits = char_traits<charT> >
+ class basic_istream;
+
+X template <class charT, class traits = char_traits<charT> >
+ class basic_ostream;
+
+X template <class charT, class traits = char_traits<charT> >
+ class basic_iostream;
+
+X template <class charT, class traits = char_traits<charT>,
+ class Allocator = allocator<charT> >
+ class basic_stringbuf;
+
+X template <class charT, class traits = char_traits<charT>,
+ class Allocator = allocator<charT> >
+ class basic_istringstream;
+
+X template <class charT, class traits = char_traits<charT>,
+ class Allocator = allocator<charT> >
+ class basic_ostringstream;
+
+X template <class charT, class traits = char_traits<charT>,
+ class Allocator = allocator<charT> >
+ class basic_stringstream;
+
+X template <class charT, class traits = char_traits<charT> >
+ class basic_filebuf;
+
+X template <class charT, class traits = char_traits<charT> >
+ class basic_ifstream;
+
+X template <class charT, class traits = char_traits<charT> >
+ class basic_ofstream;
+
+X template <class charT, class traits = char_traits<charT> >
+ class basic_fstream;
+X template <class charT, class traits = char_traits<charT> >
+ class istreambuf_iterator;
+
+X template <class charT, class traits = char_traits<charT> >
+ class ostreambuf_iterator;
+X typedef basic_ios<char> ios;
+X typedef basic_ios<wchar_t> wios;
+X typedef basic_streambuf<char> streambuf;
+X typedef basic_istream<char> istream;
+X typedef basic_ostream<char> ostream;
+X typedef basic_iostream<char> iostream;
+X typedef basic_stringbuf<char> stringbuf;
+X typedef basic_istringstream<char> istringstream;
+X typedef basic_ostringstream<char> ostringstream;
+X typedef basic_stringstream<char> stringstream;
+X typedef basic_filebuf<char> filebuf;
+X typedef basic_ifstream<char> ifstream;
+X typedef basic_ofstream<char> ofstream;
+X typedef basic_fstream<char> fstream;
+X typedef basic_streambuf<wchar_t> wstreambuf;
+X typedef basic_istream<wchar_t> wistream;
+X typedef basic_ostream<wchar_t> wostream;
+X typedef basic_iostream<wchar_t> wiostream;
+X typedef basic_stringbuf<wchar_t> wstringbuf;
+X typedef basic_istringstream<wchar_t> wistringstream;
+X typedef basic_ostringstream<wchar_t> wostringstream;
+X typedef basic_stringstream<wchar_t> wstringstream;
+
+X typedef basic_filebuf<wchar_t> wfilebuf;
+X typedef basic_ifstream<wchar_t> wifstream;
+X typedef basic_ofstream<wchar_t> wofstream;
+X typedef basic_fstream<wchar_t> wfstream;
+X template <class state> class fpos;
+X typedef fpos<char_traits<char>::state_type> streampos;
+X typedef fpos<char_traits<wchar_t>::state_type> wstreampos;
+
+ 27.3 Standard iostream objects [lib.iostream.objects]
+
+ Header <iostream> synopsis
+
+T [must also include <istream> and <ostream>]
+T extern istream cin;
+T extern ostream cout;
+T extern ostream cerr;
+T extern ostream clog;
+
+T extern wistream wcin;
+T extern wostream wcout;
+T extern wostream wcerr;
+T extern wostream wclog;
+
+ 27.4 Iostreams base classes [lib.iostreams.base]
+
+ Header <ios> synopsis
+
+ #include <iosfwd>
+
+T typedef OFF_T streamoff;
+T typedef SZ_T streamsize;
+T template <class stateT> class fpos;
+
+ class ios_base;
+ template <class charT, class traits = char_traits<charT> >
+ class basic_ios;
+ // _lib.std.ios.manip_, manipulators:
+T ios_base& boolalpha (ios_base& str);
+T ios_base& noboolalpha(ios_base& str);
+T ios_base& showbase (ios_base& str);
+T ios_base& noshowbase (ios_base& str);
+T ios_base& showpoint (ios_base& str);
+T ios_base& noshowpoint(ios_base& str);
+T ios_base& showpos (ios_base& str);
+T ios_base& noshowpos (ios_base& str);
+T ios_base& skipws (ios_base& str);
+T ios_base& noskipws (ios_base& str);
+T ios_base& nouppercase(ios_base& str);
+T ios_base& uppercase (ios_base& str);
+M ios_base& unitbuf (ios_base& str);
+M ios_base& nounitbuf (ios_base& str);
+ // _lib.adjustfield.manip_ adjustfield:
+T ios_base& internal (ios_base& str);
+T ios_base& left (ios_base& str);
+T ios_base& right (ios_base& str);
+ // _lib.basefield.manip_ basefield:
+T ios_base& dec (ios_base& str);
+T ios_base& hex (ios_base& str);
+T ios_base& oct (ios_base& str);
+
+ // _lib.floatfield.manip_ floatfield:
+T ios_base& fixed (ios_base& str);
+T ios_base& scientific (ios_base& str);
+
+
+ 27.4.2 Class ios_base [lib.ios.base]
+
+T class ios_base {
+ public:
+ class failure;
+T typedef T1 fmtflags;
+T static const fmtflags boolalpha;
+T static const fmtflags dec;
+T static const fmtflags fixed;
+T static const fmtflags hex;
+T static const fmtflags internal;
+T static const fmtflags left;
+T static const fmtflags oct;
+T static const fmtflags right;
+T static const fmtflags scientific;
+T static const fmtflags showbase;
+T static const fmtflags showpoint;
+T static const fmtflags showpos;
+T static const fmtflags skipws;
+X static const fmtflags unitbuf;
+T static const fmtflags uppercase;
+T static const fmtflags adjustfield;
+T static const fmtflags basefield;
+T static const fmtflags floatfield;
+
+ typedef T2 iostate;
+T static const iostate badbit;
+T static const iostate eofbit;
+T static const iostate failbit;
+T static const iostate goodbit;
+T typedef T3 openmode;
+T static const openmode app;
+T static const openmode ate;
+T static const openmode binary;
+T static const openmode in;
+T static const openmode out;
+T static const openmode trunc;
+T typedef T4 seekdir;
+T static const seekdir beg;
+T static const seekdir cur;
+T static const seekdir end;
+T class Init;
+ // _lib.fmtflags.state_ fmtflags state:
+T fmtflags flags() const;
+T fmtflags flags(fmtflags fmtfl);
+T fmtflags setf(fmtflags fmtfl);
+T fmtflags setf(fmtflags fmtfl, fmtflags mask);
+T void unsetf(fmtflags mask);
+T streamsize precision() const;
+T streamsize precision(streamsize prec);
+T streamsize width() const;
+T streamsize width(streamsize wide);
+ // _lib.ios.base.locales_ locales:
+T locale imbue(const locale& loc);
+T locale getloc() const;
+ // _lib.ios.base.storage_ storage:
+T static int xalloc();
+T long& iword(int index);
+T void*& pword(int index);
+ // destructor
+T virtual ~ios_base();
+ // _lib.ios.base.callback_ callbacks;
+T enum event { erase_event, imbue_event, copyfmt_event };
+T typedef void (*event_callback)(event, ios_base&, int index);
+T void register_callback(event_call_back fn, int index);
+T static bool sync_with_stdio(bool sync = true);
+ protected:
+T ios_base();
+ };
+
+ 27.4.2.1.1 Class ios_base::failure [lib.ios::failure]
+
+T class ios_base::failure : public exception {
+ public:
+T explicit failure(const string& msg);
+T virtual ~failure();
+T virtual const char* what() const throw();
+ };
+
+
+ 27.4.2.1.6 Class ios_base::Init [lib.ios::Init]
+
+T class ios_base::Init {
+ public:
+T Init();
+T ~Init();
+ };
+
+
+ 27.4.3 Template class fpos [lib.fpos]
+
+X template <class stateT> class fpos {
+ public:
+ // _lib.fpos.members_ Members
+T stateT state() const;
+T void state(stateT);
+ private;
+T stateT st; // exposition only
+ };
+
+
+ 27.4.5 Template class basic_ios [lib.ios]
+
+ template <class charT, class traits = char_traits<charT> >
+X class basic_ios : public ios_base {
+ public:
+
+ // Types:
+T typedef charT char_type;
+T typedef typename traits::int_type int_type;
+T typedef typename traits::pos_type pos_type;
+T typedef typename traits::off_type off_type;
+T typedef traits traits_type;
+T operator void*() const
+T bool operator!() const
+T iostate rdstate() const;
+T void clear(iostate state = goodbit);
+T void setstate(iostate state);
+T bool good() const;
+T bool eof() const;
+T bool fail() const;
+T bool bad() const;
+T iostate exceptions() const;
+T void exceptions(iostate except);
+ // _lib.basic.ios.cons_ Constructor/destructor:
+T explicit basic_ios(basic_streambuf<charT,traits>* sb);
+T virtual ~basic_ios();
+ // _lib.basic.ios.members_ Members:
+T basic_ostream<charT,traits>* tie() const;
+T basic_ostream<charT,traits>* tie(basic_ostream<charT,traits>* tiestr);
+T basic_streambuf<charT,traits>* rdbuf() const;
+T basic_streambuf<charT,traits>* rdbuf(basic_streambuf<charT,traits>* sb);
+X basic_ios& copyfmt(const basic_ios& rhs);
+T char_type fill() const;
+T char_type fill(char_type ch);
+ // _lib.ios.base.locales_ locales:
+T locale imbue(const locale& loc);
+X char narrow(char_type c, char dfault) const;
+X char_type widen(char c) const;
+ protected:
+ basic_ios();
+T void init(basic_streambuf<charT,traits>* sb);
+ private:
+T basic_ios(const basic_ios& ); // not defined
+T basic_ios& operator=(const basic_ios&); // not defined
+ };
+
+
+ 27.5 Stream buffers [lib.stream.buffers]
+
+ Header <streambuf> synopsis
+
+X template <class charT, class traits = char_traits<charT> >
+ class basic_streambuf;
+T typedef basic_streambuf<char> streambuf;
+T typedef basic_streambuf<wchar_t> wstreambuf;
+
+ 27.5.2 Template class [lib.streambuf]
+ basic_streambuf<charT,traits>
+
+ template <class charT, class traits = char_traits<charT> >
+X class basic_streambuf {
+ public:
+
+ // Types:
+T typedef charT char_type;
+T typedef typename traits::int_type int_type;
+T typedef typename traits::pos_type pos_type;
+T typedef typename traits::off_type off_type;
+T typedef traits traits_type;
+T virtual ~basic_streambuf();
+ // _lib.streambuf.locales_ locales:
+T locale pubimbue(const locale &loc);
+T locale getloc() const;
+ // _lib.streambuf.buffer_ buffer and positioning:
+T basic_streambuf<char_type,traits>*
+ pubsetbuf(char_type* s, streamsize n);
+T pos_type pubseekoff(off_type off, ios_base::seekdir way,
+ ios_base::openmode which =
+ ios_base::in | ios_base::out);
+T pos_type pubseekpos(pos_type sp,
+ ios_base::openmode which =
+ ios_base::in | ios_base::out);
+T int pubsync();
+
+ // Get and put areas:
+ // _lib.streambuf.pub.get_ Get area:
+T streamsize in_avail();
+T int_type snextc();
+T int_type sbumpc();
+T int_type sgetc();
+T streamsize sgetn(char_type* s, streamsize n);
+ // _lib.streambuf.pub.pback_ Putback:
+X int_type sputbackc(char_type c);
+X int_type sungetc();
+ // _lib.streambuf.pub.put_ Put area:
+T int_type sputc(char_type c);
+X streamsize sputn(const char_type* s, streamsize n);
+ protected:
+T basic_streambuf();
+ // _lib.streambuf.get.area_ Get area:
+T char_type* eback() const;
+T char_type* gptr() const;
+T char_type* egptr() const;
+T void gbump(int n);
+T void setg(char_type* gbeg, char_type* gnext, char_type* gend);
+ // _lib.streambuf.put.area_ Put area:
+T char_type* pbase() const;
+T char_type* pptr() const;
+T char_type* epptr() const;
+T void pbump(int n);
+T void setp(char_type* pbeg, char_type* pend);
+ // _lib.streambuf.virtuals_ virtual functions:
+ // _lib.streambuf.virt.locales_ Locales:
+T virtual void imbue(const locale &loc);
+ // _lib.streambuf.virt.buffer_ Buffer management and positioning:
+T virtual basic_streambuf<char_type,traits>*
+ setbuf(char_type* s, streamsize n);
+T virtual pos_type seekoff(off_type off, ios_base::seekdir way,
+ ios_base::openmode which = ios_base::in | ios_base::out);
+T virtual pos_type seekpos(pos_type sp,
+ ios_base::openmode which = ios_base::in | ios_base::out);
+T virtual int sync();
+ // _lib.streambuf.virt.get_ Get area:
+T virtual int showmanyc();
+T virtual streamsize xsgetn(char_type* s, streamsize n);
+T virtual int_type underflow();
+T virtual int_type uflow();
+ // _lib.streambuf.virt.pback_ Putback:
+T virtual int_type pbackfail(int_type c = traits::eof());
+ // _lib.streambuf.virt.put_ Put area:
+X virtual streamsize xsputn(const char_type* s, streamsize n);
+T virtual int_type overflow (int_type c = traits::eof());
+ };
+
+ 27.6 Formatting and manipulators [lib.iostream.format]
+
+ Header <istream> synopsis
+
+T template <class charT, class traits = char_traits<charT> >
+ class basic_istream;
+T typedef basic_istream<char> istream;
+T typedef basic_istream<wchar_t> wistream;
+
+T template <class charT, class traits = char_traits<charT> >
+ class basic_iostream;
+T typedef basic_iostream<char> iostream;
+T typedef basic_iostream<wchar_t> wiostream;
+
+X template <class charT, class traits>
+ basic_istream<charT,traits>& ws(basic_istream<charT,traits>& is);
+
+ Header <ostream> synopsis
+
+X template <class charT, class traits = char_traits<charT> >
+ class basic_ostream;
+T typedef basic_ostream<char> ostream;
+T typedef basic_ostream<wchar_t> wostream;
+
+T template <class charT, class traits>
+ basic_ostream<charT,traits>& endl(basic_ostream<charT,traits>& os);
+T template <class charT, class traits>
+ basic_ostream<charT,traits>& ends(basic_ostream<charT,traits>& os);
+T template <class charT, class traits>
+ basic_ostream<charT,traits>& flush(basic_ostream<charT,traits>& os);
+
+ Header <iomanip> synopsis
+
+ // Types T1, T2, ... are unspecified implementation types
+T T1 resetiosflags(ios_base::fmtflags mask);
+T T2 setiosflags (ios_base::fmtflags mask);
+T T3 setbase(int base);
+T template<charT> T4 setfill(charT c);
+T T5 setprecision(int n);
+T T6 setw(int n);
+
+
+ 27.6.1.1 Template class basic_istream [lib.istream]
+
+ template <class charT, class traits = char_traits<charT> >
+T class basic_istream : virtual public basic_ios<charT,traits> {
+ public:
+ // Types (inherited from basic_ios (_lib.ios_)):
+T typedef charT char_type;
+T typedef typename traits::int_type int_type;
+T typedef typename traits::pos_type pos_type;
+T typedef typename traits::off_type off_type;
+T typedef traits traits_type;
+ // _lib.istream.cons_ Constructor/destructor:
+T explicit basic_istream(basic_streambuf<charT,traits>* sb);
+T virtual ~basic_istream();
+ // _lib.istream::sentry_ Prefix/suffix:
+T class sentry;
+
+ // _lib.istream.formatted_ Formatted input:
+T basic_istream<charT,traits>& operator>>
+ (basic_istream<charT,traits>& (*pf)(basic_istream<charT,traits>&))
+T basic_istream<charT,traits>& operator>>
+ (basic_ios<charT,traits>& (*pf)(basic_ios<charT,traits>&))
+T basic_istream<charT,traits>& operator>>
+ (ios_base& (*pf)(ios_base&))
+S basic_istream<charT,traits>& operator>>(bool& n);
+S basic_istream<charT,traits>& operator>>(short& n);
+S basic_istream<charT,traits>& operator>>(unsigned short& n);
+S basic_istream<charT,traits>& operator>>(int& n);
+S basic_istream<charT,traits>& operator>>(unsigned int& n);
+S basic_istream<charT,traits>& operator>>(long& n);
+S basic_istream<charT,traits>& operator>>(unsigned long& n);
+S basic_istream<charT,traits>& operator>>(float& f);
+S basic_istream<charT,traits>& operator>>(double& f);
+S basic_istream<charT,traits>& operator>>(long double& f);
+S basic_istream<charT,traits>& operator>>(void*& p);
+S basic_istream<charT,traits>& operator>>
+ (basic_streambuf<char_type,traits>* sb);
+ // _lib.istream.unformatted_ Unformatted input:
+T streamsize gcount() const;
+S int_type get();
+S basic_istream<charT,traits>& get(char_type& c);
+S basic_istream<charT,traits>& get(char_type* s, streamsize n);
+S basic_istream<charT,traits>& get(char_type* s, streamsize n,
+ char_type delim);
+S basic_istream<charT,traits>& get(basic_streambuf<char_type,traits>& sb);
+S basic_istream<charT,traits>& get(basic_streambuf<char_type,traits>& sb,
+ char_type delim);
+S basic_istream<charT,traits>& getline(char_type* s, streamsize n);
+S basic_istream<charT,traits>& getline(char_type* s, streamsize n,
+ char_type delim);
+S basic_istream<charT,traits>& ignore
+ (streamsize n = 1, int_type delim = traits::eof());
+S int_type peek();
+S basic_istream<charT,traits>& read (char_type* s, streamsize n);
+S streamsize readsome(char_type* s, streamsize n);
+S basic_istream<charT,traits>& putback(char_type c);
+S basic_istream<charT,traits>& unget();
+S int sync();
+
+S pos_type tellg();
+S basic_istream<charT,traits>& seekg(pos_type);
+S basic_istream<charT,traits>& seekg(off_type, ios_base::seekdir);
+ };
+
+ // _lib.istream::extractors_ character extraction templates:
+S template<class charT, class traits>
+ basic_istream<charT,traits>& operator>>(basic_istream<charT,traits>&,
+ charT&);
+S template<class traits>
+ basic_istream<char,traits>& operator>>(basic_istream<char,traits>&,
+ unsigned char&);
+S template<class traits>
+ basic_istream<char,traits>& operator>>(basic_istream<char,traits>&,
+ signed char&);
+
+S template<class charT, class traits>
+ basic_istream<charT,traits>& operator>>(basic_istream<charT,traits>&,
+ charT*);
+S template<class traits>
+ basic_istream<char,traits>& operator>>(basic_istream<char,traits>&,
+ unsigned char*);
+S template<class traits>
+ basic_istream<char,traits>& operator>>(basic_istream<char,traits>&,
+ signed char*);
+
+ 27.6.1.1.2 Class basic_istream::sentry [lib.istream::sentry]
+
+
+ template <class charT,class traits = char_traits<charT> >
+S class basic_istream<charT,traits>::sentry {
+ typedef traits traits_type;
+S bool ok_; // exposition only
+ public:
+S explicit sentry(basic_istream<charT,traits>& is, bool noskipws = false);
+S ~sentry();
+S operator bool() const { return ok_; }
+ private:
+T sentry(const sentry&); // not defined
+T sentry& operator=(const sentry&); // not defined
+ };
+
+
+ 27.6.1.5 Template class basic_iostream [lib.iostreamclass]
+
+ template <class charT, class traits = char_traits<charT> >
+T class basic_iostream :
+ public basic_istream<charT,traits>,
+ public basic_ostream<charT,traits> {
+ public:
+ // constructor/destructor
+T explicit basic_iostream(basic_streambuf<charT,traits>* sb);
+T virtual ~basic_iostream();
+ };
+
+
+ 27.6.2.1 Template class basic_ostream [lib.ostream]
+
+ template <class charT, class traits = char_traits<charT> >
+X class basic_ostream : virtual public basic_ios<charT,traits> {
+ public:
+ // Types (inherited from basic_ios (_lib.ios_)):
+T typedef charT char_type;
+T typedef typename traits::int_type int_type;
+T typedef typename traits::pos_type pos_type;
+T typedef typename traits::off_type off_type;
+T typedef traits traits_type;
+ // _lib.ostream.cons_ Constructor/destructor:
+T explicit basic_ostream(basic_streambuf<char_type,traits>* sb);
+T virtual ~basic_ostream();
+ // _lib.ostream::sentry_ Prefix/suffix:
+T class sentry;
+ // _lib.ostream.formatted_ Formatted output:
+T basic_ostream<charT,traits>& operator<<
+ (basic_ostream<charT,traits>& (*pf)(basic_ostream<charT,traits>&));
+T basic_ostream<charT,traits>& operator<<
+ (basic_ios<charT,traits>& (*pf)(basic_ios<charT,traits>&));
+T basic_ostream<charT,traits>& operator<<
+ (ios_base& (*pf)(ios_base&));
+T basic_ostream<charT,traits>& operator<<(bool n);
+T basic_ostream<charT,traits>& operator<<(short n);
+T basic_ostream<charT,traits>& operator<<(unsigned short n);
+T basic_ostream<charT,traits>& operator<<(int n);
+T basic_ostream<charT,traits>& operator<<(unsigned int n);
+T basic_ostream<charT,traits>& operator<<(long n);
+T basic_ostream<charT,traits>& operator<<(unsigned long n);
+S basic_ostream<charT,traits>& operator<<(float f);
+S basic_ostream<charT,traits>& operator<<(double f);
+S basic_ostream<charT,traits>& operator<<(long double f);
+T basic_ostream<charT,traits>& operator<<(const void* p);
+X basic_ostream<charT,traits>& operator<<
+ (basic_streambuf<char_type,traits>* sb);
+ // _lib.ostream.unformatted_ Unformatted output:
+T basic_ostream<charT,traits>& put(char_type c);
+T basic_ostream<charT,traits>& write(const char_type* s, streamsize n);
+X basic_ostream<charT,traits>& flush();
+
+ // _lib.ostream.seeks_ seeks:
+S pos_type tellp();
+S basic_ostream<charT,traits>& seekp(pos_type);
+S basic_ostream<charT,traits>& seekp(off_type, ios_base::seekdir);
+ };
+ // _lib.ostream.inserters.character_ character inserters
+X template<class charT, class traits>
+ basic_ostream<charT,traits>& operator<<(basic_ostream<charT,traits>&,
+ charT);
+X template<class charT, class traits>
+ basic_ostream<charT,traits>& operator<<(basic_ostream<charT,traits>&,
+ char);
+ // specialization
+X template<class traits>
+ basic_ostream<char,traits>& operator<<(basic_ostream<char,traits>&,
+ char);
+ // signed and unsigned
+X template<class traits>
+ basic_ostream<char,traits>& operator<<(basic_ostream<char,traits>&,
+ signed char);
+X template<class traits>
+ basic_ostream<char,traits>& operator<<(basic_ostream<char,traits>&,
+ unsigned char)
+X template<class charT, class traits>
+ basic_ostream<charT,traits>& operator<<(basic_ostream<charT,traits>&,
+ const charT*);
+X template<class charT, class traits>
+ basic_ostream<charT,traits>& operator<<(basic_ostream<charT,traits>&,
+ const char*);
+ // partial specializationss
+X template<class traits>
+ basic_ostream<char,traits>& operator<<(basic_ostream<char,traits>&,
+ const char*);
+ // signed and unsigned
+X template<class traits>
+ basic_ostream<char,traits>& operator<<(basic_ostream<char,traits>&,
+ const signed char*);
+X template<class traits>
+ basic_ostream<char,traits>& operator<<(basic_ostream<char,traits>&,
+ const unsigned char*);
+
+
+ 27.6.2.3 Class basic_ostream::sentry [lib.ostream::sentry]
+
+ template <class charT,class traits = char_traits<charT> >
+X class basic_ostream<charT,traits>::sentry {
+ bool ok_; // exposition only
+ public:
+X explicit sentry(basic_ostream<charT,traits>& os);
+X ~sentry();
+X operator bool() const { return ok_; }
+ private
+X sentry(const sentry&); // not defined
+X sentry& operator=(const sentry&); // not defined
+ };
+
+ 27.7 String-based streams [lib.string.streams]
+
+ Header <sstream> synopsis
+
+X template <class charT, class traits = char_traits<charT>,
+ class Allocator = allocator<charT> >
+ class basic_stringbuf;
+
+T typedef basic_stringbuf<char> stringbuf;
+T typedef basic_stringbuf<wchar_t> wstringbuf;
+
+ template <class charT, class traits = char_traits<charT>,
+ class Allocator = allocator<charT> >
+X class basic_istringstream;
+
+T typedef basic_istringstream<char> istringstream;
+T typedef basic_istringstream<wchar_t> wistringstream;
+
+ template <class charT, class traits = char_traits<charT>,
+ class Allocator = allocator<charT> >
+X class basic_ostringstream;
+T typedef basic_ostringstream<char> ostringstream;
+T typedef basic_ostringstream<wchar_t> wostringstream;
+
+ template <class charT, class traits = char_traits<charT>,
+ class Allocator = allocator<charT> >
+X class basic_stringstream;
+T typedef basic_stringstream<char> stringstream;
+T typedef basic_stringstream<wchar_t> wstringstream;
+
+ 27.7.1 Template class basic_stringbuf [lib.stringbuf]
+
+ template <class charT, class traits = char_traits<charT>,
+ class Allocator = allocator<charT> >
+X class basic_stringbuf : public basic_streambuf<charT,traits> {
+ public:
+T typedef charT char_type;
+T typedef typename traits::int_type int_type;
+T typedef typename traits::pos_type pos_type;
+T typedef typename traits::off_type off_type;
+T typedef traits traits_type;
+ // _lib.stringbuf.cons_ Constructors:
+S explicit basic_stringbuf(ios_base::openmode which
+ = ios_base::in | ios_base::out);
+S explicit basic_stringbuf
+ (const basic_string<charT,traits,Allocator>& str,
+ ios_base::openmode which = ios_base::in | ios_base::out);
+ // _lib.stringbuf.members_ Get and set:
+S basic_string<charT,traits,Allocator> str() const;
+S void str(const basic_string<charT,traits,Allocator>& s);
+
+ protected:
+ // _lib.stringbuf.virtuals_ Overridden virtual functions:
+S virtual int_type underflow();
+S virtual int_type pbackfail(int_type c = traits::eof());
+S virtual int_type overflow (int_type c = traits::eof());
+S virtual basic_streambuf<charT,traits>* setbuf(charT*, streamsize);
+
+S virtual pos_type seekoff(off_type off, ios_base::seekdir way,
+ ios_base::openmode which
+ = ios_base::in | ios_base::out);
+S virtual pos_type seekpos(pos_type sp,
+ ios_base::openmode which
+ = ios_base::in | ios_base::out);
+ };
+
+
+ 27.7.2 Template class basic_istringstream [lib.istringstream]
+
+ template <class charT, class traits = char_traits<charT>,
+ class Allocator = allocator<charT> >
+X class basic_istringstream : public basic_istream<charT,traits> {
+ public:
+T typedef charT char_type;
+T typedef typename traits::int_type int_type;
+T typedef typename traits::pos_type pos_type;
+T typedef typename traits::off_type off_type;
+T typedef traits traits_type;
+ // _lib.istringstream.cons_ Constructors:
+S explicit basic_istringstream(ios_base::openmode which = ios_base::in);
+S explicit basic_istringstream(
+ const basic_string<charT,traits,Allocator>& str,
+ ios_base::openmode which = ios_base::in);
+
+ // _lib.istringstream.members_ Members:
+S basic_stringbuf<charT,traits,Allocator>* rdbuf() const;
+S basic_string<charT,traits,Allocator> str() const;
+S void str(const basic_string<charT,traits,Allocator>& s);
+ private:
+ // basic_stringbuf<charT,traits,Allocator> sb; exposition only
+ };
+
+ 27.7.3 Class basic_ostringstream [lib.ostringstream]
+
+ template <class charT, class traits = char_traits<charT>,
+ class Allocator = allocator<charT> >
+X class basic_ostringstream : public basic_ostream<charT,traits> {
+ public:
+
+ // Types:
+T typedef charT char_type;
+T typedef typename traits::int_type int_type;
+T typedef typename traits::pos_type pos_type;
+T typedef typename traits::off_type off_type;
+ // _lib.ostringstream.cons_ Constructors/destructor:
+S explicit basic_ostringstream(ios_base::openmode which = ios_base::out);
+S explicit basic_ostringstream(
+ const basic_string<charT,traits,Allocator>& str,
+ ios_base::openmode which = ios_base::out);
+ // _lib.ostringstream.members_ Members:
+S basic_stringbuf<charT,traits,Allocator>* rdbuf() const;
+S basic_string<charT,traits,Allocator> str() const;
+S void str(const basic_string<charT,traits,Allocator>& s);
+ };
+
+
+ 27.7.4 Template class basic_stringstream [lib.stringstream]
+
+ template <class charT, class traits = char_traits<charT>,
+ class Allocator = allocator<charT> >
+X class basic_stringstream
+ : public basic_iostream<charT,traits> {
+ public:
+ // Types
+T typedef charT char_type;
+T typedef typename traits::int_type int_type;
+T typedef typename traits::pos_type pos_type;
+T typedef typename traits::off_type off_type;
+ // constructors/destructors
+S explicit basic_stringstream(
+ ios_base::openmode which = ios_base::out|ios_base::in);
+S explicit basic_stringstream(
+ const basic_string<charT,traits,Allocator>& str,
+ ios_base::openmode which = ios_base::out|ios_base::in);
+ // Members:
+S basic_stringbuf<charT,traits,Allocator>* rdbuf() const;
+S basic_string<charT,traits,Allocator> str() const;
+S void str(const basic_string<charT,traits,Allocator>& str);
+ };
+
+
+
+ 27.8.1 File streams [lib.fstreams]
+
+
+ Header <fstream> synopsis
+
+X template <class charT, class traits = char_traits<charT> >
+ class basic_filebuf;
+T typedef basic_filebuf<char> filebuf;
+T typedef basic_filebuf<wchar_t> wfilebuf;
+
+X template <class charT, class traits = char_traits<charT> >
+ class basic_ifstream;
+T typedef basic_ifstream<char> ifstream;
+T typedef basic_ifstream<wchar_t> wifstream;
+
+X template <class charT, class traits = char_traits<charT> >
+ class basic_ofstream;
+T typedef basic_ofstream<char> ofstream;
+T typedef basic_ofstream<wchar_t> wofstream;
+
+X template <class charT, class traits = char_traits<charT> >
+ class basic_fstream;
+T typedef basic_fstream<char> fstream;
+T typedef basic_fstream<wchar_t> wfstream;
+
+ 27.8.1.1 Template class basic_filebuf [lib.filebuf]
+
+ template <class charT, class traits = char_traits<charT> >
+X class basic_filebuf : public basic_streambuf<charT,traits> {
+ public:
+T typedef charT char_type;
+T typedef typename traits::int_type int_type;
+T typedef typename traits::pos_type pos_type;
+T typedef typename traits::off_type off_type;
+T typedef traits traits_type;
+ // _lib.filebuf.cons_ Constructors/destructor:
+X basic_filebuf();
+X virtual ~basic_filebuf();
+ // _lib.filebuf.members_ Members:
+T bool is_open() const;
+X basic_filebuf<charT,traits>* open
+ (const char* s, ios_base::openmode mode);
+X basic_filebuf<charT,traits>* close();
+ protected:
+ // _lib.filebuf.virtuals_ Overridden virtual functions:
+X virtual streamsize showmanyc();
+X virtual int_type underflow();
+X virtual int_type uflow();
+X virtual int_type pbackfail(int_type c = traits::eof());
+X virtual int_type overflow (int_type c = traits::eof());
+S virtual basic_streambuf<charT,traits>*
+ setbuf(char_type* s, streamsize n);
+S virtual pos_type seekoff(off_type off, ios_base::seekdir way,
+ ios_base::openmode which
+ = ios_base::in | ios_base::out);
+S virtual pos_type seekpos(pos_type sp, ios_base::openmode which
+ = ios_base::in | ios_base::out);
+S virtual int sync();
+S virtual void imbue(const locale& loc);
+ };
+
+
+
+ 27.8.1.5 Template class basic_ifstream [lib.ifstream]
+
+ template <class charT, class traits = char_traits<charT> >
+X class basic_ifstream : public basic_istream<charT,traits> {
+ public:
+T typedef charT char_type;
+T typedef typename traits::int_type int_type;
+T typedef typename traits::pos_type pos_type;
+T typedef typename traits::off_type off_type;
+T typedef traits traits_type;
+ // _lib.ifstream.cons_ Constructors:
+S basic_ifstream();
+S explicit basic_ifstream(const char* s,
+ ios_base::openmode mode = ios_base::in);
+ // _lib.ifstream.members_ Members:
+S basic_filebuf<charT,traits>* rdbuf() const;
+S bool is_open();
+S void open(const char* s, ios_base::openmode mode = ios_base::in);
+S void close();
+ };
+
+
+ 27.8.1.8 Template class basic_ofstream [lib.ofstream]
+
+ template <class charT, class traits = char_traits<charT> >
+X class basic_ofstream : public basic_ostream<charT,traits> {
+ public:
+T typedef charT char_type;
+T typedef typename traits::int_type int_type;
+T typedef typename traits::pos_type pos_type;
+T typedef typename traits::off_type off_type;
+T typedef traits traits_type;
+ // _lib.ofstream.cons_ Constructors:
+X basic_ofstream();
+X explicit basic_ofstream(const char* s,
+ ios_base::openmode mode
+ = ios_base::out);
+ // _lib.ofstream.members_ Members:
+X basic_filebuf<charT,traits>* rdbuf() const;
+T bool is_open();
+X void open(const char* s, ios_base::openmode mode = ios_base::out);
+X void close();
+ };
+
+
+ 27.8.1.11 Template class basic_fstream [lib.fstream]
+
+ template <class charT, class traits=char_traits<charT> >
+X class basic_fstream
+ : public basic_iostream<charT,traits> {
+ public:
+T typedef charT char_type;
+T typedef typename traits::int_type int_type;
+T typedef typename traits::pos_type pos_type;
+T typedef typename traits::off_type off_type;
+T typedef traits traits_type;
+ // constructors/destructor
+S basic_fstream();
+S explicit basic_fstream(
+ const char* s,
+ ios_base::openmode mode = ios_base::in|ios_base::out);
+
+ // Members:
+S basic_filebuf<charT,traits>* rdbuf() const;
+S bool is_open();
+S void open(
+ const char* s,
+ ios_base::openmode mode = ios_base::in|ios_base::out);
+S void close();
+ };
+
+
+
+ 27.8.2 C Library files [lib.c.files]
+
+
+ Table 13--Header <cstdio> synopsis
+ Macros:
+X BUFSIZ L_tmpnam SEEK_SET TMP_MAX
+X EOF NULL <cstdio> stderr _IOFBF
+X FILENAME_MAX SEEK_CUR stdin _IOLBF
+X FOPEN_MAX SEEK_END stdout _IONBF
+
+X Types: FILE fpos_t size_t <cstdio>
+ Functions:
+X clearerr fgets fscanf gets rewind
+X fclose fopen fseek perror scanf tmpnam
+X feof fprintf fsetpos printf setbuf ungetc
+X ferror fputc ftell putc setvbuf vprintf
+X fflush fputs fwrite puts sprintf vfprintf
+X fgetc fread getc remove sscanf vsprintf
+X fgetpos freopen getchar putchar rename tmpfile
+
+
+
+
+ 1.5 Standard C library headers [depr.c.headers]
+
+X <assert.h> <iso646.h> <setjmp.h> <stdio.h> <wchar.h>
+ <ctype.h> <limits.h> <signal.h> <stdlib.h> <wctype.h>
+ <errno.h> <locale.h> <stdarg.h> <string.h>
+ <float.h> <math.h> <stddef.h> <time.h>
+
+ 1.6 Old iostreams members [depr.ios.members]
+
+ [Note: these should be #ifdef'd to permit diagnostics if used.]
+ namespace std {
+ class ios_base {
+ public:
+T typedef T1 io_state;
+T typedef T2 open_mode;
+T typedef T3 seek_dir;
+T typedef OFF_T streamoff;
+T typedef OFF_T streampos;
+ // remainder unchanged
+ };
+ }
+
+ [Note: these should be #ifdef'd to permit diagnostics if used.]
+ namespace std {
+ template<class charT, class traits = char_traits<charT> >
+ class basic_streambuf {
+ public:
+T void stossc();
+ // remainder unchanged
+ };
+ }
+
+ 8 An implementation may provide the following member functions that
+ overload signatures specified in clause _lib.iostreams_:
+
+ [Note: the following overloads should be #ifdef'd to permit
+ diagnostics to be emitted, by default, if used.]
+
+ template<class charT, class Traits> class basic_ios {
+ public:
+M void clear(io_state state);
+M void setstate(io_state state);
+ // remainder unchanged
+ };
+ class ios_base {
+ public:
+M void exceptions(io_state);
+ // remainder unchanged
+ };
+ template<class charT, class traits = char_traits<charT> >
+ class basic_streambuf {
+ public:
+M pos_type pubseekoff(off_type off, ios_base::seek_dir way,
+ ios_base::open_mode which = ios_base::in | ios_base::out);
+M pos_type pubseekpos(pos_type sp,
+ ios_base::open_mode which = ios_base::in | ios_base::out);
+ // remainder unchanged
+ };
+ template <class charT, class traits = char_traits<charT> >
+ class basic_filebuf : public basic_streambuf<charT,traits> {
+ public:
+M basic_filebuf<charT,traits>* open
+ (const char* s, ios_base::open_mode mode);
+ // remainder unchanged
+ };
+ template <class charT, class traits = char_traits<charT> >
+ class basic_ifstream : public basic_istream<charT,traits> {
+ public:
+M void open(const char* s, ios_base::open_mode mode = in);
+ // remainder unchanged
+ };
+ template <class charT, class traits = char_traits<charT> >
+ class basic_ofstream : public basic_ostream<charT,traits> {
+ public:
+M void open(const char* s, ios_base::open_mode mode = out | trunc);
+ // remainder unchanged
+ };
+ }
+
+
+
+ 1.7.1 Class strstreambuf [depr.strstreambuf]
+
+ [Note: It should be possible to adopt these components with only
+ minor changes from the 2.8 version of the library.]
+
+M class strstreambuf : public basic_streambuf<char> {
+ public:
+M explicit strstreambuf(streamsize alsize_arg = 0);
+M strstreambuf(void* (*palloc_arg)(size_t), void (*pfree_arg)(void*));
+M strstreambuf(char* gnext_arg, streamsize n, char* pbeg_arg = 0);
+M strstreambuf(const char* gnext_arg, streamsize n);
+M strstreambuf(signed char* gnext_arg, streamsize n,
+ signed char* pbeg_arg = 0);
+M strstreambuf(const signed char* gnext_arg, streamsize n);
+M strstreambuf(unsigned char* gnext_arg, streamsize n,
+ unsigned char* pbeg_arg = 0);
+M strstreambuf(const unsigned char* gnext_arg, streamsize n);
+M virtual ~strstreambuf();
+M void freeze(bool freezefl = true);
+M char* str();
+M int pcount();
+ protected:
+M virtual int_type overflow (int_type c = EOF);
+M virtual int_type pbackfail(int_type c = EOF);
+M virtual int_type underflow();
+M virtual pos_type seekoff(off_type off, ios_base::seekdir way,
+ ios_base::openmode which
+ = ios_base::in | ios_base::out);
+M virtual pos_type seekpos(pos_type sp, ios_base::openmode which
+ = ios_base::in | ios_base::out);
+M virtual streambuf<char>* setbuf(char* s, streamsize n);
+ }
+
+ 1.7.4 Class strstream [depr.strstream]
+
+M class strstream
+ : public basic_iostream<char> {
+ public:
+ // Types
+M typedef char char_type;
+M typedef typename char_traits<char>::int_type int_type
+M typedef typename char_traits<char>::pos_type pos_type;
+M typedef typename char_traits<char>::off_type off_type;
+ // consturctors/destructor
+M strstream();
+M strstream(char* s, int n,
+ ios_base::openmode mode = ios_base::in|ios_base::out);
+M virtual ~strstream();
+ // Members:
+M strstreambuf* rdbuf() const;
+M void freeze(bool freezefl = true);
+M int pcount() const;
+M char* str();
+ };
+
+</pre>
\ No newline at end of file
+++ /dev/null
-
-Changes made while bringing boost/concept_check.hpp to v3's concept_check.h:
-
-1) File format changed from DOS to Unix.
-2) Boost config.hpp and other workaround files dropped (unneeded in g++ v3).
-3) Conditionally-compiled code depending on those "breakage" macros was
- removed, or not, depending on the macro, so that the macros themselves
- are gone. Since the same code would always be compiled, let's make it
- easier on the reader and a few milliseconds faster for cpplib.
-4) Tests for NDEBUG were removed; if NDEBUG is defined, none of the checking
- code will even be included.
-5) BOOST_CLASS_REQUIRES* changed to accept a namespace parameter.
-6) SameTypeConcept added (simple wrapper around existing code).
-7) An unused variable in OutputIteratorConcept was removed.
-
-At checkin, this was the exact diff, modulo the end-of-line character changes:
-
-
---- concept_check.hpp.orig Sun Apr 1 08:59:46 2001
-+++ boost_concept_check.h Mon Apr 2 18:56:41 2001
-@@ -5,20 +5,15 @@
- // "as is" without express or implied warranty, and with no claim as
- // to its suitability for any purpose.
- //
-+
-+// GCC Note: based on version 1.12.0 of the Boost library.
- #ifndef BOOST_CONCEPT_CHECKS_HPP
- #define BOOST_CONCEPT_CHECKS_HPP
-
--#include <boost/config.hpp>
--#include <boost/iterator.hpp>
--#include <boost/iterator.hpp>
--#include <utility>
--#include <boost/pending/limits.hpp>
--
--#if (__GNUC__) || defined(__KCC) || defined(__ghs) || defined(__MWERKS__)
--#define BOOST_FPTR &
--#else
--#define BOOST_FPTR
--#endif
-+#pragma GCC system_header
-+#include <bits/stl_iterator_base_types.h> // for traits and tags
-+#include <utility> // for pair<>
-+
-
- namespace boost {
-
-@@ -27,80 +22,64 @@
- template <class Concept>
- void function_requires()
- {
--#if !defined(NDEBUG)
-- void (Concept::*x)() = BOOST_FPTR Concept::constraints;
-+ void (Concept::*x)() = &Concept::constraints;
- ignore_unused_variable_warning(x);
--#endif
- }
-
--// The BOOST_CLASS_REQUIRES macros use function pointers as
--// template parameters, which VC++ does not support.
--
--#if defined(BOOST_NO_FUNCTION_PTR_TEMPLATE_PARAMETERS)
--
--#define BOOST_CLASS_REQUIRES(type_var, concept)
--#define BOOST_CLASS_REQUIRES2(type_var1, type_var2, concept)
--#define BOOST_CLASS_REQUIRES3(type_var1, type_var2, type_var3, concept)
--#define BOOST_CLASS_REQUIRES4(type_var1, type_var2, type_var3, type_var4, concept)
-
--#else
--
--#define BOOST_CLASS_REQUIRES(type_var, concept) \
-- typedef void (concept <type_var>::* func##type_var##concept)(); \
-+#define BOOST_CLASS_REQUIRES(type_var, ns, concept) \
-+ typedef void (ns::concept <type_var>::* func##type_var##concept)(); \
- template <func##type_var##concept _Tp1> \
- struct concept_checking_##type_var##concept { }; \
- typedef concept_checking_##type_var##concept< \
-- BOOST_FPTR concept <type_var>::constraints> \
-+ &ns::concept <type_var>::constraints> \
- concept_checking_typedef_##type_var##concept
-
--#define BOOST_CLASS_REQUIRES2(type_var1, type_var2, concept) \
-- typedef void (concept <type_var1,type_var2>::* func##type_var1##type_var2##concept)(); \
-+#define BOOST_CLASS_REQUIRES2(type_var1, type_var2, ns, concept) \
-+ typedef void (ns::concept <type_var1,type_var2>::* func##type_var1##type_var2##concept)(); \
- template <func##type_var1##type_var2##concept _Tp1> \
- struct concept_checking_##type_var1##type_var2##concept { }; \
- typedef concept_checking_##type_var1##type_var2##concept< \
-- BOOST_FPTR concept <type_var1,type_var2>::constraints> \
-+ &ns::concept <type_var1,type_var2>::constraints> \
- concept_checking_typedef_##type_var1##type_var2##concept
-
--#define BOOST_CLASS_REQUIRES3(type_var1, type_var2, type_var3, concept) \
-- typedef void (concept <type_var1,type_var2,type_var3>::* func##type_var1##type_var2##type_var3##concept)(); \
-+#define BOOST_CLASS_REQUIRES3(type_var1, type_var2, type_var3, ns, concept) \
-+ typedef void (ns::concept <type_var1,type_var2,type_var3>::* func##type_var1##type_var2##type_var3##concept)(); \
- template <func##type_var1##type_var2##type_var3##concept _Tp1> \
- struct concept_checking_##type_var1##type_var2##type_var3##concept { }; \
- typedef concept_checking_##type_var1##type_var2##type_var3##concept< \
-- BOOST_FPTR concept <type_var1,type_var2,type_var3>::constraints> \
-+ &ns::concept <type_var1,type_var2,type_var3>::constraints> \
- concept_checking_typedef_##type_var1##type_var2##type_var3##concept
-
--#define BOOST_CLASS_REQUIRES4(type_var1, type_var2, type_var3, type_var4, concept) \
-- typedef void (concept <type_var1,type_var2,type_var3,type_var4>::* func##type_var1##type_var2##type_var3##type_var4##concept)(); \
-+#define BOOST_CLASS_REQUIRES4(type_var1, type_var2, type_var3, type_var4, ns, concept) \
-+ typedef void (ns::concept <type_var1,type_var2,type_var3,type_var4>::* func##type_var1##type_var2##type_var3##type_var4##concept)(); \
- template <func##type_var1##type_var2##type_var3##type_var4##concept _Tp1> \
- struct concept_checking_##type_var1##type_var2##type_var3##type_var4##concept { }; \
- typedef concept_checking_##type_var1##type_var2##type_var3##type_var4##concept< \
-- BOOST_FPTR concept <type_var1,type_var2,type_var3,type_var4>::constraints> \
-+ &ns::concept <type_var1,type_var2,type_var3,type_var4>::constraints> \
- concept_checking_typedef_##type_var1##type_var2##type_var3##type_var4##concept
-
-
--#endif
--
--#if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
- template <class T, class U>
- struct require_same { };
-
- template <class T>
- struct require_same<T,T> { typedef T type; };
--#else
--// This version does not perform checking, but will not do any harm.
--template <class T, class U>
--struct require_same { typedef T type; };
--#endif
-+
-+ template <class T, class U>
-+ struct SameTypeConcept
-+ {
-+ void constraints() {
-+ typedef typename require_same<T, U>::type req;
-+ }
-+ };
-
- template <class T>
- struct IntegerConcept {
- void constraints() {
--#if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
- errortype_must_be_an_integer_type();
--#endif
- }
- };
--#if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
- template <> struct IntegerConcept<short> { void constraints() {} };
- template <> struct IntegerConcept<unsigned short> { void constraints() {} };
- template <> struct IntegerConcept<int> { void constraints() {} };
-@@ -108,32 +87,24 @@
- template <> struct IntegerConcept<long> { void constraints() {} };
- template <> struct IntegerConcept<unsigned long> { void constraints() {} };
- // etc.
--#endif
-
- template <class T>
- struct SignedIntegerConcept {
- void constraints() {
--#if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
- errortype_must_be_a_signed_integer_type();
--#endif
- }
- };
--#if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
- template <> struct SignedIntegerConcept<short> { void constraints() {} };
- template <> struct SignedIntegerConcept<int> { void constraints() {} };
- template <> struct SignedIntegerConcept<long> { void constraints() {} };
- // etc.
--#endif
-
- template <class T>
- struct UnsignedIntegerConcept {
- void constraints() {
--#if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
- errortype_must_be_an_unsigned_integer_type();
--#endif
- }
- };
--#if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
- template <> struct UnsignedIntegerConcept<unsigned short>
- { void constraints() {} };
- template <> struct UnsignedIntegerConcept<unsigned int>
-@@ -141,7 +112,6 @@
- template <> struct UnsignedIntegerConcept<unsigned long>
- { void constraints() {} };
- // etc.
--#endif
-
- //===========================================================================
- // Basic Concepts
-@@ -159,15 +129,11 @@
- struct AssignableConcept
- {
- void constraints() {
--#if !defined(_ITERATOR_) // back_insert_iterator broken for VC++ STL
- a = a; // require assignment operator
--#endif
- const_constraints(a);
- }
- void const_constraints(const TT& b) {
--#if !defined(_ITERATOR_) // back_insert_iterator broken for VC++ STL
- a = b; // const required for argument to assignment
--#endif
- }
- TT a;
- };
-@@ -196,17 +162,13 @@
- {
- void constraints() {
- TT b(a);
--#if !defined(_ITERATOR_) // back_insert_iterator broken for VC++ STL
- a = a; // require assignment operator
--#endif
- const_constraints(a);
- ignore_unused_variable_warning(b);
- }
- void const_constraints(const TT& b) {
- TT c(b);
--#if !defined(_ITERATOR_) // back_insert_iterator broken for VC++ STL
- a = b; // const required for argument to assignment
--#endif
- ignore_unused_variable_warning(c);
- }
- TT a;
-@@ -304,6 +266,9 @@
- BOOST_DEFINE_BINARY_OPERATOR_CONSTRAINT(-, SubtractOpConcept);
- BOOST_DEFINE_BINARY_OPERATOR_CONSTRAINT(%, ModOpConcept);
-
-+#undef BOOST_DEFINE_BINARY_PREDICATE_OP_CONSTRAINT
-+#undef BOOST_DEFINE_BINARY_OPERATOR_CONSTRAINT
-+
- //===========================================================================
- // Function Object Concepts
-
-@@ -318,7 +283,6 @@
- };
-
-
--#if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
- template <class Func>
- struct GeneratorConcept<Func,void>
- {
-@@ -327,7 +291,6 @@
- }
- Func f;
- };
--#endif
-
- template <class Func, class Return, class Arg>
- struct UnaryFunctionConcept
-@@ -340,7 +303,6 @@
- Return r;
- };
-
--#if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
- template <class Func, class Arg>
- struct UnaryFunctionConcept<Func, void, Arg> {
- void constraints() {
-@@ -348,7 +310,6 @@
- }
- Func f;
- };
--#endif
-
- template <class Func, class Return, class First, class Second>
- struct BinaryFunctionConcept
-@@ -362,7 +323,6 @@
- Return r;
- };
-
--#if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
- template <class Func, class First, class Second>
- struct BinaryFunctionConcept<Func, void, First, Second>
- {
-@@ -373,7 +333,6 @@
- First first;
- Second second;
- };
--#endif
-
- template <class Func, class Arg>
- struct UnaryPredicateConcept
-@@ -422,9 +381,7 @@
- function_requires< AssignableConcept<TT> >();
- function_requires< DefaultConstructibleConcept<TT> >();
- function_requires< EqualityComparableConcept<TT> >();
--#ifndef BOOST_NO_STD_ITERATOR_TRAITS
- typedef typename std::iterator_traits<TT>::value_type V;
--#endif
- (void)*i; // require dereference operator
- }
- TT i;
-@@ -446,7 +403,6 @@
- void constraints() {
- function_requires< TrivialIteratorConcept<TT> >();
- // require iterator_traits typedef's
--#ifndef BOOST_NO_STD_ITERATOR_TRAITS
- typedef typename std::iterator_traits<TT>::difference_type D;
- function_requires< SignedIntegerConcept<D> >();
- typedef typename std::iterator_traits<TT>::reference R;
-@@ -455,7 +411,6 @@
- function_requires< ConvertibleConcept<
- typename std::iterator_traits<TT>::iterator_category,
- std::input_iterator_tag> >();
--#endif
- ++i; // require preincrement operator
- i++; // require postincrement operator
- }
-@@ -471,7 +426,7 @@
- i++; // require postincrement operator
- *i++ = t; // require postincrement and assignment
- }
-- TT i, j;
-+ TT i;
- ValueT t;
- };
-
-@@ -480,14 +435,12 @@
- {
- void constraints() {
- function_requires< InputIteratorConcept<TT> >();
--#ifndef BOOST_NO_STD_ITERATOR_TRAITS
- function_requires< ConvertibleConcept<
- typename std::iterator_traits<TT>::iterator_category,
- std::forward_iterator_tag> >();
- typedef typename std::iterator_traits<TT>::reference reference;
- reference r = *i;
- ignore_unused_variable_warning(r);
--#endif
- }
- TT i;
- };
-@@ -507,11 +460,9 @@
- {
- void constraints() {
- function_requires< ForwardIteratorConcept<TT> >();
--#ifndef BOOST_NO_STD_ITERATOR_TRAITS
- function_requires< ConvertibleConcept<
- typename std::iterator_traits<TT>::iterator_category,
- std::bidirectional_iterator_tag> >();
--#endif
- --i; // require predecrement operator
- i--; // require postdecrement operator
- }
-@@ -536,12 +487,10 @@
- void constraints() {
- function_requires< BidirectionalIteratorConcept<TT> >();
- function_requires< ComparableConcept<TT> >();
--#ifndef BOOST_NO_STD_ITERATOR_TRAITS
- function_requires< ConvertibleConcept<
- typename std::iterator_traits<TT>::iterator_category,
- std::random_access_iterator_tag> >();
- typedef typename std::iterator_traits<TT>::reference R;
--#endif
-
- i += n; // require assignment addition operator
- i = i + n; i = n + i; // require addition with difference type
-@@ -552,11 +501,7 @@
- }
- TT a, b;
- TT i, j;
--#ifndef BOOST_NO_STD_ITERATOR_TRAITS
- typename std::iterator_traits<TT>::difference_type n;
--#else
-- std::ptrdiff_t n;
--#endif
- };
-
- template <class TT>
-@@ -568,11 +513,7 @@
- i[n] = *i; // require element access and assignment
- }
- TT i;
--#ifndef BOOST_NO_STD_ITERATOR_TRAITS
- typename std::iterator_traits<TT>::difference_type n;
--#else
-- std::ptrdiff_t n;
--#endif
- };
-
- //===========================================================================
-
<meta name="AUTHOR" content="pme@gcc.gnu.org (Phil Edwards)" />
<meta name="DESCRIPTION" content="configury for libstdc++" />
<meta name="GENERATOR" content="vi and eight fingers" />
- <title>libstdc++-v3 configury</title>
+ <title>libstdc++ configury</title>
<link rel="StyleSheet" href="../lib3styles.css" type='text/css' />
<link rel="Start" href="../documentation.html" type="text/html"
title="GNU C++ Standard Library" />
<hr />
-<h2>Notes on libstdc++-v3 configury</h2>
+<h2>Notes on libstdc++ configury</h2>
<blockquote>
No problem is insoluble in all conceivable circumstances.<br />
-- The Cosmic AC,
+++ /dev/null
-// 1999-05-12 bkoz
-
-// Copyright (C) 1999 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.
-
-// 17.4.1.2 Headers
-
-
-// "C++" headers
-#include <algorithm>
-#include <bitset>
-#include <complex>
-#include <deque>
-#include <exception>
-#include <fstream>
-#include <functional>
-#include <iomanip>
-#include <ios>
-#include <iosfwd>
-#include <iostream>
-#include <istream>
-#include <iterator>
-#include <limits>
-#include <list>
-#include <locale>
-#include <map>
-#include <memory>
-#include <new>
-#include <numeric>
-#include <ostream>
-#include <queue>
-#include <set>
-#include <sstream>
-#include <stack>
-#include <stdexcept>
-#include <streambuf>
-#include <string>
-#include <typeinfo>
-#include <utility>
-#include <valarray>
-#include <vector>
-
-// "C" headers
-#include <cassert>
-#include <cctype>
-#include <cerrno>
-#include <cfloat>
-#include <ciso646>
-#include <climits>
-#include <clocale>
-#include <cmath>
-#include <csetjmp>
-#include <csignal>
-#include <cstdarg>
-#include <cstddef>
-#include <cstdio>
-#include <cstdlib>
-#include <cstring>
-#include <ctime>
-
-// "C" headers that might not work if wchar_t support is disabled.
-#include <bits/c++config.h>
-#if _GLIBCXX_USE_WCHAR_T
- #include <cwchar>
- #include <cwctype>
-#endif
-
-int main() { return 0; }
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1" />
- <meta name="AUTHOR" content="pme@gcc.gnu.org (Phil Edwards)" />
+ <meta name="AUTHOR" content="pme@gcc.gnu.org (Phil Edwards), Benjamin Kosnik, Felix Natter" />
<meta name="KEYWORDS" content="HOWTO, libstdc++, gcc, g++, libg++, STL" />
<meta name="DESCRIPTION" content="HOWTO for libstdc++ chapter 17." />
<meta name="GENERATOR" content="vi and eight fingers" />
- <title>libstdc++-v3 HOWTO: Chapter 17: Library Introduction</title>
+ <title>libstdc++ HOWTO: Chapter 17: Library Introduction</title>
<link rel="StyleSheet" href="../lib3styles.css" type="text/css" />
<link rel="Start" href="../documentation.html" type="text/html"
title="GNU C++ Standard Library" />
<hr />
<h1>Contents</h1>
<ul>
- <li><a href="#2">The Standard C++ header files</a></li>
- <li><a href="#3">The Standard C++ library and multithreading</a></li>
- <li><a href="#4"><code><foo></code> vs <code><foo.h></code></a></li>
- <li><a href="porting-howto.html">Porting HOWTO</a></li>
- <li><a href="#5">Behavior specific to libstdc++-v3</a></li>
- <li><a href="#6">Preprocessor macros controlling the library</a></li>
+ <li><a href="#2.1">Header Files</a></li>
+ <li><a href="#5">Implementation specific behavior</a></li>
+ <li><a href="#6">Macros</a></li>
+ <li><a href="#3">Multithreading</a></li>
</ul>
<hr />
<!-- ####################################################### -->
-<h2><a name="2">The Standard C++ header files</a></h2>
- <p>The Standard C++ Library specifies 50 header files that must be
+<h2><a name="2.1">Header Files</a></h2>
+ <p>The C++ standard specifies 50 header files that must be
available to all hosted implementations. Actually, the word
"files" is a misnomer, since the contents of the headers
don't necessarily have to be in any kind of external file. The
- only rule is that when you <code>#include</code> a certain header, the
+ only rule is that when one <code>#include</code>'s a certain header, the
contents of that header, as defined by the Standard, become
- available to you, no matter how.
- </p>
- <p>The names of the headers can be easily seen in
- <a href="headers_cc.txt"><code>testsuite/17_intro/headers.cc</code></a>,
- which is a small testbed we use to make certain that the headers
- all compile and run.
+ available, no matter how.
</p>
+<p>C++98/03 include files:
+</p>
+<pre>
+C++ Library Headers
+algorithm ios new stack
+bitset iosfwd numeric stdexcept
+complex iostream ostream streambuf
+ istream queue string
+deque iterator
+exception limits typeinfo
+fstream list set
+functional locale map
+iomanip memory sstream
+
+C++ Headers for C Library Facilities
+cassert cfloat cmath cstddef
+ccomplex csetjmp cstdio ctime
+cctype ciso646 csignal
+cerrno climits cstdarg cstdlib cwchar
+ clocale cstring cwctype
+</pre>
+
+<p>C++0x include files:
+</p>
+<pre>
+C++ Library Headers
+algorithm ios new stack
+array iosfwd numeric stdexcept
+bitset iostream ostream streambuf
+complex istream queue string
+deque iterator random system_error
+exception limits regex tuple
+fstream list set type_traits
+functional locale map typeinfo
+iomanip memory sstream
+
+C++ Headers for C Library Facilities
+cassert cfloat cmath cstddef ctgmath
+ccomplex cinttypes csetjmp cstdio ctime
+cctype ciso646 csignal cstdint cuchar
+cerrno climits cstdarg cstdlib cwchar
+cfenv clocale cstdbool cstring cwctype
+</pre>
+
+<p>In addition, TR1 includes as:
+</p>
+<pre>
+C++ Library Headers
+tr1/array, tr1/complex, tr1/functional, tr1/memory, tr1/random,
+tr1/regex, tr1/tuple, tr1/type_traits, tr1/unordered_map,
+tr1/unordered_set, tr1/utility
+
+C++ Headers for C Library Facilities
+tr1/cmath, tr1/ccomplex, tr1/cfenv, tr1/cfloat, tr1/cinttypes,
+tr1/climits, tr1/cstdarg, tr1/cstdbool, tr1/cstdint, tr1/cstdio,
+tr1/cstdlib, tr1/ctgmath, tr1/ctime, tr1/cwchar, tr1/cwctype
+
+C++ Compatibility Headers for C Library Facilities
+tr1/complex.h, tr1/ctype.h, tr1/float.h, tr1/limits.h, tr1/math.h,
+tr1/stdarg.h, tr1/stdbool.h, tr1/stdint.h, tr1/stdio.h, tr1/stdlib.h,
+tr1/tgmath.h, tr1/wchar.h, tr1/wctype.h
+</pre>
+
+<hr />
+<h2><a name="2.2">Headers and <code>namespace std::</code></a></h2>
+<p>
+ You should not use the C-headers (except for system-level
+ headers) from C++ programs. Instead, you should use a set of
+ headers that are named by prepending 'c' and, as usual,
+ omitting the extension (.h). For example, instead of using
+ <tt><math.h></tt>, you
+ should use <tt><cmath></tt>. In some cases this has
+ the advantage that the C++-header is more standardized than
+ the C-header (i.e. <tt><ctime></tt> (almost)
+ corresponds to either <tt><time.h></tt> or <tt><sys/time.h></tt>).
+
+ The standard specifies that if you include the C-style header
+ (<tt><math.h></tt> in
+ this case), the symbols will be available both in the global
+ namespace and in namespace <code>std::</code> (but
+ libstdc++ does not yet have fully compliant headers) On the
+ other hand, if you include only the new header (i.e. <tt><cmath></tt>), the symbols
+ will only be defined in namespace <code>std::</code>
+ (and macros will be converted to inline-functions).
+ </p>
+
+<p>FIXME: this is no longer accurate.</p>
+
+<p>
+ For more information on this, and for information on how the
+ GNU C++ implementation might reuse ("shadow") the C
+ library-functions, have a look at <a href="http://www.cantrip.org/cheaders.html" target="_top">
+ www.cantrip.org</a>.
+ </p>
+
+<hr />
+<h2><a name="2.5">Namespace <code>std::</code></a></h2>
+
+<p>
+ One standard requirement is that the library components are defined
+ in <code>namespace std::</code>. Thus, in order to use these types or
+ functions, one must do one of two things:
+</p>
+
+ <div class="itemizedlist"><ul type="disc"> <li><p>put a kind of
+<span class="emphasis"><i>using-declaration</i></span> in your source
+(either <code>using namespace std;</code> or i.e. <code>using
+std::string;</code>) This approach works well for individual source files, but
+should not be used in a global context, like header files.
+ </p></li> <li><p>use a <span class="emphasis"><i>fully
+qualified name</i></span> for each library symbol
+(i.e. <code>std::string</code>, <code>std::cout</code>) Always can be
+used, and usually enhanced, by strategic use of typedefs. (In the
+cases where the qualified verbage becomes unweidly.)
+ </p></li>
+</ul>
+
+<hr />
+<h2><a name="2.6">Using namespace composition</code></a></h2>
+
+<p>
+ <a href="http://gtkmm.sourceforge.net" target="_top">Gtk--</a> defines
+ most of its classes in namespace Gtk::. Thus, it was possible to
+ adapt Gtk-- to namespace std:: by using a C++-feature called
+ <span class="emphasis"><i>namespace composition</i></span>. This is what happens if
+ you put a <span class="emphasis"><i>using</i></span>-declaration into a
+ namespace-definition: the imported symbol(s) gets imported into the
+ currently active namespace(s). For example:
+ <pre class="programlisting">
+ namespace Gtk {
+ using std::string;
+ class Window { ... }
+ }
+ </pre>
+ In this example, <code>std::string</code> gets imported into
+ namespace Gtk::. The result is that you don't have to use
+ <code>std::string</code> in this header, but still
+ <code>std::string</code> does not get imported into
+ the global namespace (::) unless the user does
+ <code>using namespace Gtk;</code> (which is not recommended
+ practice for Gtk--, so it is not a problem). Additionally, the
+ <code>using</code>-declarations are wrapped in macros that
+ are set based on autoconf-tests to either "" or i.e. <code>using
+ std::string;</code> (depending on whether the system has
+ libstdc++ in <code>std::</code> or not). (ideas from
+ <tt><<a href="mailto:llewelly@dbritsch.dsl.xmission.com">llewelly@dbritsch.dsl.xmission.com</a>></tt>, Karl Nelson
+ <tt><<a href="mailto:kenelson@ece.ucdavis.edu">kenelson@ece.ucdavis.edu</a>></tt>)
+</p>
+
<hr />
<h2><a name="3">The Standard C++ library and multithreading</a></h2>
<p>This section discusses issues surrounding the proper compilation
href="../23_containers/howto.html#3">23</a> (containers), and <a
href="../27_io/howto.html#9">27</a> (I/O) for more information.
</p>
- <p>The libstdc++-v3 library (unlike libstdc++-v2, all of it, not
+ <p>The libstdc++ library (unlike libstdc++-v2, all of it, not
just the STL) has been designed so that multithreaded
applications using it may be written. The first problem is
finding a <em>fast</em> method of implementation portable to all
</p>
<hr />
-<h2><a name="4"><code><foo></code> vs <code><foo.h></code></a></h2>
- <p>The new-style headers are fully supported in libstdc++-v3. The compiler
- itself fully supports namespaces, including <code>std::</code>.
- </p>
- <p>For those of you new to ISO C++98, no, that isn't a typo, the headers
- really have new names. Marshall Cline's C++ FAQ Lite has a good
- explanation in
-<a href="http://www.parashift.com/c++-faq-lite/coding-standards.html#faq-27.4">item [27.4]</a>.
- </p>
- <p>Return <a href="#top">to top of page</a> or
- <a href="../faq/index.html">to the FAQ</a>.
- </p>
-
-<hr />
-<h2><a name="5">Behavior specific to libstdc++-v3</a></h2>
+<h2><a name="5">Behavior specific to libstdc++</a></h2>
<p>The ISO standard defines the following phrase:
</p>
<blockquote><dl>
<a href="../18_support/howto.html#1">here</a>.
</p>
<p><strong>[18.3]/8</strong> Even though it's listed in the library
- sections, libstdc++-v3 has zero control over what the cleanup code hands
+ sections, libstdc++ has zero control over what the cleanup code hands
back to the runtime loader. Talk to the compiler people. :-)
</p>
<p><strong>[18.4.2.1]/5</strong> (bad_alloc),<br />
</p>
<hr />
-<h2><a name="6">Preprocessor macros controlling the library</a></h2>
- <p>Some of the semantics of the libstdc++-v3 implementation are
- controlled by preprocessor macros, both during build/installation and
- during compilation of user code. Many of these choices are made when
- the library is built and installed (actually, during
- <a href="../configopts.html">the configuration step</a>, with the
- various --enable/--disable choices being translated to #define/#undef).
- </p>
- <p>All library macros begin with <code>_GLIBCPP_</code> in earlier
- versions, and <code>_GLIBCXX_</code> in later versions. The fact that
- these symbols start with a leading underscore should give you a clue
- that (by default) they aren't meant to be changed by the user. :-)
- </p>
- <p>These macros are all gathered in the file <code>c++config.h</code>,
- which is generated during installation. <strong>You must assume that
- these macros cannot be redefined by your own code</strong>, unless we
- document otherwise here. Some of the choices control code which has
- already been compiled (i.e., libstdc++.a/.so). If you explicitly
- #define or #undef these macros, the <em>headers</em> may see different
- code paths, but the <em>libraries</em> which you link against will not.
- If you want to experiment with different values, you must change the
- config headers before building/installing the library.
- </p>
- <p>Below are macros which, for 3.1 and later, you may change yourself,
- in your own code with #define/#undef or with -D/-U compiler flags.
- The default state of the symbol is listed. "Configurable"
- (or "Not configurable") means that the symbol is initially
- chosen (or not) based on --enable/--disable options at configure time.
- For 3.1 through 3.3, the prefixes are <code>_GLIBCPP_</code>.
+<h2><a name="6">Macros for libstdc++</a></h2>
+
+ <p>All pre-processor switches and configurations are all gathered
+ in the file <code>c++config.h</code>, which is generated during
+ the libstdc++ configuration and build process, and included by
+ files part of the public libstdc++ API. Most of these macros
+ should not be used by consumers of libstdc++, and are reserved
+ for internal implementation use. <strong>These macros cannot be
+ redefined</strong>. However, a select handful of these macro
+ control libstdc++ extensions and extra features, or provide
+ versioning information for the API, and are able to be used.
</p>
+
+ <p>All library macros begin with <code>_GLIBCXX_</code> (except for
+ versions 3.1.x to 3.3.x, which use <code>_GLIBCPP_</code>).
+ </p>
+
+ <p>Below is the macro which users may check for library version
+ information. </p>
+
+ <dl>
+ <dt><code>__GLIBCXX__</code></dt> <dd>The current version of
+ libstdc++ in compressed ISO date format, form of an unsigned
+ long. For details on the value of this particular macro for a
+ particular release, please consult this <a href="abi.html">
+ document</a>.</dd> </dl>
+
+ <p>Below are the macros which users may change with #define/#undef or
+ with -D/-U compiler flags. The default state of the symbol is
+ listed.</p>
+
+ <p>"Configurable" (or "Not configurable") means
+ that the symbol is initially chosen (or not) based on
+ --enable/--disable options at library build and configure time
+ (documented <a href="../configopts.html">here</a>), with the
+ various --enable/--disable choices being translated to
+ #define/#undef).
+ </p>
+
+ <p> "ABI" means that changing from the default value may
+ mean changing the ABI of compiled code. In other words, these
+ choices control code which has already been compiled (i.e., in a
+ binary such as libstdc++.a/.so). If you explicitly #define or
+ #undef these macros, the <em>headers</em> may see different code
+ paths, but the <em>libraries</em> which you link against will not.
+ Experimenting with different values with the expectation of
+ consistent linkage requires changing the config headers before
+ building/installing the library.
+ </p>
+
<dl>
<dt><code>_GLIBCXX_DEPRECATED</code></dt>
- <dd>Undefined by default. Not configurable. Turning this on enables
- older ARM-style iostreams code, and other anachronisms. This may be
- useful in updating old C++ programs which no longer meet the
- requirements of the language.
- </dd>
- <!--
- Can this actually be turned off and still produce a working lib? Must
- check. -pme
- No, it can't. Hmmm. -pme
- <dt><code>_GLIBCPP_RESOLVE_LIB_DEFECTS</code></dt>
- <dd>Defined by default. Not configurable. The library follows
- corrections and updates from the ISO committee, see
- <a href="../faq/index.html#5_2">here</a> and
- <a href="../ext/howto.html#5">here</a> for more on this feature.
- If you have code which depends on the first version of the standard,
- you might try undefining this macro.
- </dd>
- -->
- <dt><code>_GLIBCXX_CONCEPT_CHECKS</code></dt>
- <dd>Undefined by default. Configurable. When defined, performs
- compile-time checking on certain template instantiations to detect
- violations of the requirements of the standard. This is described
- in more detail <a href="../19_diagnostics/howto.html#3">here</a>.
+ <dd>Defined by default. Not configurable. ABI-changing. Turning this off
+ removes older ARM-style iostreams code, and other anachronisms
+ from the API. This macro is dependent on the version of the
+ standard being tracked, and as a result may give different results for
+ <code>-std=c++98</code> and <code>-std=c++0x</code>. This may
+ be useful in updating old C++ code which no longer meet the
+ requirements of the language, or for checking current code
+ against new language standards. </dd>
+
+ <dt><code>_GLIBCXX_FORCE_NEW</code></dt> <dd>Undefined by
+ default. When defined, memory allocation and allocators controlled
+ by libstdc++ call operator new/delete without caching and
+ pooling. Configurable via
+ <code>--enable-libstdcxx-allocator</code>. ABI-changing.</a>
</dd>
+
+
+ <dt><code>_GLIBCXX_CONCEPT_CHECKS</code></dt> <dd>Undefined by
+ default. Configurable via <code>--enable-concept-checks</code>.
+ When defined, performs compile-time checking on certain template
+ instantiations to detect violations of the requirements of the
+ standard. This is described in more detail <a
+ href="../19_diagnostics/howto.html#3">here</a>.</dd>
+
<dt><code>_GLIBCXX_DEBUG</code></dt>
- <dd>Undefined by default. Configurable. When defined, compiles
- user code using the <a href="../debug.html#safe">libstdc++ debug
+ <dd>Undefined by default. When defined, compiles
+ user code using the <a href="../ext/debug.html#safe">libstdc++ debug
mode</a>.
</dd>
<dt><code>_GLIBCXX_DEBUG_PEDANTIC</code></dt>
- <dd>Undefined by default. Configurable. When defined while
- compiling with the <a href="../debug.html#safe">libstdc++ debug
+ <dd>Undefined by default. When defined while
+ compiling with the <a href="../ext/debug.html#safe">libstdc++ debug
mode</a>, makes the debug mode extremely picky by making the use
of libstdc++ extensions and libstdc++-specific behavior into
errors.
</dd>
+ <dt><code>_GLIBCXX_PARALLEL</code></dt>
+ <dd>Undefined by default. When defined, compiles
+ user code using the <a href="../ext/parallel_mode.html">libstdc++ parallel
+ mode</a>.
+ </dd>
+
<!--
<dt><code></code></dt>
<dd>
<h2>The Code: Runtime GPL</h2>
<p>The source code of libstdc++ is distributed under version 2 of the
- <a href="COPYING">GNU General Public License</a>, with the so-called
+ <a href="COPYING" type="text/plain">GNU General Public License</a>, with the so-called
"runtime exception," as follows (or see any header or
implementation file):
</p>
<p>The documentation shipped with the library and made available over the
web, excluding the pages generated from source comments, are copyrighted
by the Free Software Foundation, and placed under
- the <a href="COPYING.DOC">GNU Free Documentation License version 1.1</a>.
+ the <a href="COPYING.DOC" type="text/plain">GNU Free Documentation License version 1.1</a>.
There are no Front-Cover Texts, no Back-Cover Texts, and
<!-- as far as I know -->
no Invariant Sections.
+++ /dev/null
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN" "http://www.w3.org/TR/REC-html40/loose.dtd">
-<html>
-<head>
-<meta content="text/html; charset=ISO-8859-1" http-equiv="Content-Type">
-<title>Libstdc++-porting-howto</title>
-<meta name="generator" content="DocBook XSL Stylesheets V1.48">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"><div class="article">
-<div class="titlepage">
-<div><h1 class="title">
-<a name="libstdc++-porting-howto"></a>Libstdc++-porting-howto</h1></div>
-<div><h3 class="author">Felix Natter</h3></div>
-<div><div class="legalnotice">
-<p class="legalnotice-title"><b>Legal Notice</b></p>
-<p>
- This document can be distributed under the FDL
- (<a href="http://www.gnu.org" target="_top">www.gnu.org</a>)
- </p>
-</div></div>
-<div><p class="pubdate">Tue Jun 5 20:07:49 2001</p></div>
-<div><div class="revhistory"><table border="1" width="100%" summary="Revision history">
-<tr><th align="left" valign="top" colspan="3"><b>Revision History</b></th></tr>
-<tr>
-<td align="left">Revision 0.5</td>
-<td align="left">Thu Jun 1 13:06:50 2000</td>
-<td align="left">fnatter</td>
-</tr>
-<tr><td align="left" colspan="3">First docbook-version.</td></tr>
-<tr>
-<td align="left">Revision 0.8</td>
-<td align="left">Sun Jul 30 20:28:40 2000</td>
-<td align="left">fnatter</td>
-</tr>
-<tr><td align="left" colspan="3">First released version using docbook-xml
- + second upload to libstdc++-page.
- </td></tr>
-<tr>
-<td align="left">Revision 0.9</td>
-<td align="left">Wed Sep 6 02:59:32 2000</td>
-<td align="left">fnatter</td>
-</tr>
-<tr><td align="left" colspan="3">5 new sections.</td></tr>
-<tr>
-<td align="left">Revision 0.9.1</td>
-<td align="left">Sat Sep 23 14:20:15 2000</td>
-<td align="left">fnatter</td>
-</tr>
-<tr><td align="left" colspan="3">added information about why file-descriptors are not in the
- standard</td></tr>
-<tr>
-<td align="left">Revision 0.9.2</td>
-<td align="left">Tue Jun 5 20:07:49 2001</td>
-<td align="left">fnatter</td>
-</tr>
-<tr><td align="left" colspan="3">
- a fix, added hint on increased portability of C-shadow-headers,
- added autoconf-test HAVE_CONTAINER_AT
- </td></tr>
-<tr>
-<td align="left">Revision 0.9.3</td>
-<td align="left">Fri Jun 29 16:15:56 2001</td>
-<td align="left">fnatter</td>
-</tr>
-<tr><td align="left" colspan="3">
- changed signature of nonstandard filebuf-constructor and
- update the section on filebuf::attach to point to ../ext/howto.html,
- added link to ../21/strings/howto.html
- in sec-stringstream, changed <link>-tags to have content
- (so that these links work),
- replace "user-space" by "global namespace"
- add note about gcc 3.0 and shadow-headers
- add section about ostream::form and istream::scan
- sec-vector-at: remove hint to modify headers
- fix spelling error in sec-stringstream
- </td></tr>
-<tr>
-<td align="left">Revision 0.9.4</td>
-<td align="left">Mon Nov 5 17:01:04 2001</td>
-<td align="left">fnatter</td>
-</tr>
-<tr><td align="left" colspan="3">
- rewrite section 1.1.3 because of gnu.gcc.help-post by
- Juergen Heinzl
- </td></tr>
-</table></div></div>
-<div><div class="abstract">
-<p><b>Abstract</b></p>
-<p>
- Some notes on porting applications from libstdc++-2.90 (or earlier
- versions) to libstdc++-v3. Not speaking in terms of the GNU libstdc++
- implementations, this means porting from earlier versions of the
- C++-Standard to ISO 14882.
- </p>
-</div></div>
-<hr>
-</div>
-<div class="toc">
-<p><b>Table of Contents</b></p>
-<dl>
-<dt>1. <a href="#sec-nsstd">Namespace std::</a>
-</dt>
-<dd><dl>
-<dt>1.1.1. <a href="#sec-gtkmm-hack">Using namespace
- composition if the project uses a separate
- namespace</a>
-</dt>
-<dt>1.1.2. <a href="#sec-emptyns">Defining an empty namespace std</a>
-</dt>
-<dt>1.1.3. <a href="#sec-avoidfqn">Avoid to use fully qualified names
- (i.e. std::string)</a>
-</dt>
-<dt>1.1.4. <a href="#sec-osprojects">How some open-source-projects deal
- with this</a>
-</dt>
-</dl></dd>
-<dt>2. <a href="#sec-nocreate">There is no ios::nocreate/ios::noreplace
- in ISO 14882</a>
-</dt>
-<dt>3. <a href="#sec-stream::attach">stream::attach(int
- fd) is not in the standard any more</a>
-</dt>
-<dt>4. <a href="#sec-headers">The new headers</a>
-</dt>
-<dd><dl>
-<dt>4.4.1. <a href="#sec-cheaders">New headers replacing C-headers</a>
-</dt>
-<dt>4.4.2. <a href="#sec-fstream-header">
- <fstream> does
- not define std::cout,
- std::cin etc.</a>
-</dt>
-</dl></dd>
-<dt>5. <a href="#sec-iterators">Iterators</a>
-</dt>
-<dt>6. <a href="#sec-macros">
- Libc-macros (i.e. isspace from
- <cctype>)</a>
-</dt>
-<dt>7. <a href="#sec-stream-state">State of streams</a>
-</dt>
-<dt>8. <a href="#sec-vector-at">vector::at is missing (i.e. gcc 2.95.x)</a>
-</dt>
-<dt>9. <a href="#sec-eof">Using std::char_traits<char>::eof()</a>
-</dt>
-<dt>10. <a href="#sec-string-clear">Using string::clear()/string::erase()</a>
-</dt>
-<dt>11. <a href="#sec-scan-form">GNU Extensions ostream::form and istream::scan</a>
-</dt>
-<dt>12. <a href="#sec-stringstream">Using stringstreams</a>
-</dt>
-<dt>13. <a href="#sec-about">About...</a>
-</dt>
-</dl>
-</div>
-<p>
- In the following, when I say portable, I will refer to "portable among ISO
- 14882-implementations". On the other hand, if I say "backportable" or
- "conservative", I am talking about "compiles with older
- libstdc++-implementations".
- </p>
-<div class="section">
-<div class="titlepage"><div><h2 class="title" style="clear: both">
-<a name="sec-nsstd"></a>Namespace std::</h2></div></div>
-<p>
- The latest C++-standard (ISO-14882) requires that the standard
- C++-library is defined in namespace std::. Thus, in order to use
- classes from the standard C++-library, you can do one of three
- things:
- <div class="itemizedlist"><ul type="disc">
-<li><p>wrap your code in <b>namespace std {
- ... }</b> => This is not an option because only symbols
- from the standard c++-library are defined in namespace std::.
- </p></li>
-<li><p>put a kind of
- <span class="emphasis"><i>using-declaration</i></span> in your source (either
- <b>using namespace std;</b> or i.e. <b>using
- std::string;</b>) => works well for source-files, but
- cannot be used in header-files.
- </p></li>
-<li><p>use a <span class="emphasis"><i>fully qualified name</i></span> for
- each libstdc++-symbol (i.e. <b>std::string</b>,
- <b>std::cout</b>) => can always be used
- </p></li>
-</ul></div>
-<p>
- Because there are many compilers which still use an implementation
- that does not have the standard C++-library in namespace
- <b>std::</b>, some care is required to support these as
- well.
- </p>
-<p>
- Namespace back-portability-issues are generally not a problem with
- g++, because versions of g++ that do not have libstdc++ in
- <b>std::</b> use <b>-fno-honor-std</b>
- (ignore <b>std::</b>, <b>:: = std::</b>) by
- default. That is, the responsibility for enabling or disabling
- <b>std::</b> is on the user; the maintainer does not have
- to care about it. This probably applies to some other compilers as
- well.
- </p>
-<p>
- The following sections list some possible solutions to support compilers
- that cannot ignore std::.
- </p>
-<div class="section">
-<div class="titlepage"><div><h3 class="title">
-<a name="sec-gtkmm-hack"></a>Using <span class="emphasis"><i>namespace
- composition</i></span> if the project uses a separate
- namespace</h3></div></div>
-<p>
- <a href="http://gtkmm.sourceforge.net" target="_top">Gtk--</a> defines
- most of its classes in namespace Gtk::. Thus, it was possible to
- adapt Gtk-- to namespace std:: by using a C++-feature called
- <span class="emphasis"><i>namespace composition</i></span>. This is what happens if
- you put a <span class="emphasis"><i>using</i></span>-declaration into a
- namespace-definition: the imported symbol(s) gets imported into the
- currently active namespace(s). For example:
- <pre class="programlisting">
- namespace Gtk {
- using std::string;
- class Window { ... }
- }
- </pre>
- In this example, <b>std::string</b> gets imported into
- namespace Gtk::. The result is that you don't have to use
- <b>std::string</b> in this header, but still
- <b>std::string</b> does not get imported into
- the global namespace (::) unless the user does
- <b>using namespace Gtk;</b> (which is not recommended
- practice for Gtk--, so it is not a problem). Additionally, the
- <b>using</b>-declarations are wrapped in macros that
- are set based on autoconf-tests to either "" or i.e. <b>using
- std::string;</b> (depending on whether the system has
- libstdc++ in <b>std::</b> or not). (ideas from
- <tt><<a href="mailto:llewelly@dbritsch.dsl.xmission.com">llewelly@dbritsch.dsl.xmission.com</a>></tt>, Karl Nelson
- <tt><<a href="mailto:kenelson@ece.ucdavis.edu">kenelson@ece.ucdavis.edu</a>></tt>)
-</div>
-<div class="section">
-<div class="titlepage"><div><h3 class="title">
-<a name="sec-emptyns"></a>Defining an empty namespace std</h3></div></div>
-<p>
- By defining an (empty) namespace <b>std::</b> before
- using it, you avoid getting errors on systems where no part of the
- library is in namespace std:
- <pre class="programlisting">
- namespace std { }
- using namespace std;
- </pre>
-</div>
-<div class="section">
-<div class="titlepage"><div><h3 class="title">
-<a name="sec-avoidfqn"></a>Avoid to use fully qualified names
- (i.e. std::string)</h3></div></div>
-<p>
- If some compilers complain about <b>using
- std::string;</b>, and if the "hack" for gtk-- mentioned above
- does not work, then I see two solutions:
-
- <div class="itemizedlist"><ul type="disc">
-<li><p>
- Define <b>std::</b> as a macro if the compiler
- doesn't know about <b>std::</b>.
- <pre class="programlisting">
- #ifdef OLD_COMPILER
- #define std
- #endif
- </pre>
- (thanks to Juergen Heinzl who posted this solution on
- gnu.gcc.help)
- </li>
-<li><p>
- Define a macro NS_STD, which is defined to
- either "" or "std"
- based on an autoconf-test. Then you should be able to use
- <b>NS_STD::string</b>, which will evaluate to
- <b>::string</b> ("string in the global namespace") on
- systems that do not put string in std::. (This is untested)
- </p></li>
-</ul></div>
-</div>
-<div class="section">
-<div class="titlepage"><div><h3 class="title">
-<a name="sec-osprojects"></a>How some open-source-projects deal
- with this</h3></div></div>
-<p>
- This information was gathered around May 2000. It may not be correct
- by the time you read this.
- </p>
-<div class="table">
-<p><b>Table 1. Namespace std:: in Open-Source programs</b></p>
-<table summary="Namespace std:: in Open-Source programs" border="1">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<tbody>
-<tr>
-<td><a href="http://www.clanlib.org" target="_top">clanlib</a></td>
-<td>usual</td>
-</tr>
-<tr>
-<td><a href="http://pingus.seul.org" target="_top">pingus</a></td>
-<td>usual</td>
-</tr>
-<tr>
-<td><a href="http://www.mozilla.org" target="_top">mozilla</a></td>
-<td>usual</td>
-</tr>
-<tr>
-<td><a href="http://libsigc.sourceforge.net" target="_top">
- libsigc++</a></td>
-<td>conservative-impl</td>
-</tr>
-</tbody>
-</table>
-</div>
-<div class="table">
-<p><b>Table 2. Notations for categories</b></p>
-<table summary="Notations for categories" border="1">
-<colgroup>
-<col>
-<col>
-</colgroup>
-<tbody>
-<tr>
-<td>usual</td>
-<td>mostly fully qualified names and some
- using-declarations (but not in headers)</td>
-</tr>
-<tr>
-<td>none</td>
-<td>no namespace std at all</td>
-</tr>
-<tr>
-<td>conservative-impl</td>
-<td>wrap all
- namespace-handling in macros to support compilers without
- namespace-support (no libstdc++ used in headers)</td>
-</tr>
-</tbody>
-</table>
-</div>
-<p>
- As you can see, this currently lacks an example of a project
- which uses libstdc++-symbols in headers in a back-portable way
- (except for Gtk--: see the <a href="#sec-gtkmm-hack" title="Using namespace
- composition if the project uses a separate
- namespace">section on the gtkmm-hack</a>).
- </p>
-</div>
-</div>
-<div class="section">
-<div class="titlepage"><div><h2 class="title" style="clear: both">
-<a name="sec-nocreate"></a>There is no ios::nocreate/ios::noreplace
- in ISO 14882</h2></div></div>
-<p>
- I have seen <b>ios::nocreate</b> being used for
- input-streams, most probably because the author thought it would be
- more correct to specify nocreate "explicitly". So you can simply
- leave it out for input-streams.
- </p>
-<p>
- For output streams, "nocreate" is probably the default, unless you
- specify <b>std::ios::trunc</b> ? To be safe, you can open
- the file for reading, check if it has been opened, and then decide
- whether you want to create/replace or not. To my knowledge, even
- older implementations support <b>app</b>,
- <b>ate</b> and <b>trunc</b> (except for
- <b>app</b> ?).
- </p>
-</div>
-<div class="section">
-<div class="titlepage"><div><h2 class="title" style="clear: both">
-<a name="sec-stream::attach"></a><b>stream::attach(int
- fd)</b> is not in the standard any more</h2></div></div>
-<p>
- Phil Edwards <tt><<a href="mailto:pedwards@disaster.jaj.com">pedwards@disaster.jaj.com</a>></tt> writes:
- It was considered and rejected. Not all environments use file
- descriptors. Of those 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
- <b>std::streambuf</b> (or
- <b>std::basic_streambuf<..></b>) which opens a file
- given a descriptor, and then pass an instance of this to the
- stream-constructor. For an example of this, refer to
- <a href="http://www.josuttis.com/cppcode/fdstream.html" target="_top">fdstream example</a>
- by Nicolai Josuttis.
- </p>
-
-<p>
- An extension is also available:
- <code><ext/stdio_filebuf.h></code> contains a derived class called
- <a href="http://gcc.gnu.org/onlinedocs/libstdc++/latest-doxygen/class____gnu__cxx_1_1stdio__filebuf.html"><code>__gnu_cxx::stdio_filebuf</code></a>.
- This class can be constructed from a C <code>FILE*</code> or a file
- descriptor, and provides the <code>fd()</code> function.
- </p>
-</div>
-<div class="section">
-<div class="titlepage"><div><h2 class="title" style="clear: both">
-<a name="sec-headers"></a>The new headers</h2></div></div>
-<p>
- All new headers can be seen in this <a href="headers_cc.txt" target="_top">
- source-code</a>.
- </p>
-<p>
- The old C++-headers (iostream.h etc.) are available, but gcc generates
- a warning that you are using deprecated headers.
- </p>
-<div class="section">
-<div class="titlepage"><div><h3 class="title">
-<a name="sec-cheaders"></a>New headers replacing C-headers</h3></div></div>
-<p>
- You should not use the C-headers (except for system-level
- headers) from C++ programs. Instead, you should use a set of
- headers that are named by prepending 'c' and, as usual,
- omitting the extension (.h). For example, instead of using
- <tt><math.h></tt>, you
- should use <tt><cmath></tt>. In some cases this has
- the advantage that the C++-header is more standardized than
- the C-header (i.e. <tt><ctime></tt> (almost)
- corresponds to either <tt><time.h></tt> or <tt><sys/time.h></tt>).
-
- The standard specifies that if you include the C-style header
- (<tt><math.h></tt> in
- this case), the symbols will be available both in the global
- namespace and in namespace <b>std::</b> (but
- libstdc++ does not yet have fully compliant headers) On the
- other hand, if you include only the new header (i.e. <tt><cmath></tt>), the symbols
- will only be defined in namespace <b>std::</b>
- (and macros will be converted to inline-functions).
- </p>
-<p>
- For more information on this, and for information on how the
- GNU C++ implementation might reuse ("shadow") the C
- library-functions, have a look at <a href="http://www.cantrip.org/cheaders.html" target="_top">
- www.cantrip.org</a>.
- </p>
-</div>
-<div class="section">
-<div class="titlepage"><div><h3 class="title">
-<a name="sec-fstream-header"></a>
- <tt><fstream></tt> does
- not define <b>std::cout</b>,
- <b>std::cin</b> etc.</h3></div></div>
-<p>
- In earlier versions of the standard,
- <tt><fstream.h></tt>,
- <tt><ostream.h></tt>
- and <tt><istream.h></tt>
- used to define
- <b>cout</b>, <b>cin</b> and so on. Because
- of the templatized iostreams in libstdc++-v3, you need to include
- <tt><iostream></tt>
- explicitly to define these.
- </p>
-</div>
-</div>
-<div class="section">
-<div class="titlepage"><div><h2 class="title" style="clear: both">
-<a name="sec-iterators"></a>Iterators</h2></div></div>
-<p>
- The following are not proper uses of iterators, but may be working
- fixes for existing uses of iterators.
- <div class="itemizedlist"><ul type="disc">
-<li><p>you cannot do
- <b>ostream::operator<<(iterator)</b> to
- print the address of the iterator => use
- <b>operator<< &*iterator</b> instead ?
- </p></li>
-<li><p>you cannot clear an iterator's reference
- (<b>iterator = 0</b>) => use
- <b>iterator = iterator_type();</b> ?
- </p></li>
-<li><p>
-<b>if (iterator)</b> won't work any
- more => use <b>if (iterator != iterator_type())</b>
- ?</p></li>
-</ul></div>
-</div>
-<div class="section">
-<div class="titlepage"><div><h2 class="title" style="clear: both">
-<a name="sec-macros"></a>
- Libc-macros (i.e. <b>isspace</b> from
- <tt><cctype></tt>)</h2></div></div>
-<p>
- Glibc 2.0.x and 2.1.x define the
- <tt><ctype.h></tt>
- -functionality as macros (isspace, isalpha etc.). Libstdc++-v3
- "shadows" these macros as described in the <a href="#sec-cheaders" title="New headers replacing C-headers">section about
- c-headers</a>.
- </p>
-<p>
- Older implementations of libstdc++ (g++-2 for egcs 1.x and g++-3
- for gcc 2.95.x), however, keep these functions as macros, and so it
- is not back-portable to use fully qualified names. For example:
- <pre class="programlisting">
- #include <cctype>
- int main() { std::isspace('X'); }
- </pre>
- will result in something like this (unless using g++-v3):
- <pre class="programlisting">
- std:: (__ctype_b[(int) ( ( 'X' ) )] & (unsigned short int)
- _ISspace ) ;
- </pre>
-<p>
- One solution I can think of is to test for -v3 using
- autoconf-macros, and define macros for each of the C-functions
- (maybe that is possible with one "wrapper" macro as well ?).
- </p>
-<p>
- Another solution which would fix g++ is to tell the user to modify a
- header-file so that g++-2 (egcs 1.x) and g++-3 (gcc 2.95.x) define a
- macro which tells <tt><ctype.h></tt> to define functions
- instead of macros:
- <pre class="programlisting">
- // This keeps isalnum, et al from being propagated as macros.
- #if __linux__
- #define __NO_CTYPE 1
- #endif
-
- [ now include <ctype.h> ]
- </pre>
-<p>
- Another problem arises if you put a <b>using namespace
- std;</b> declaration at the top, and include <tt><ctype.h></tt>. This will result in
- ambiguities between the definitions in the global namespace
- (<tt><ctype.h></tt>) and the
- definitions in namespace <b>std::</b>
- (<b><cctype></b>).
- </p>
-<p>
- The solution to this problem was posted to the libstdc++-v3
- mailing-list:
- Benjamin Kosnik <tt><<a href="mailto:bkoz@redhat.com">bkoz@redhat.com</a>></tt> writes:
- ‘
- --enable-cshadow-headers is currently broken. As a result, shadow
- headers are not being searched....
- ’
- This is now outdated, but gcc 3.0 still does not have fully
- compliant "shadow headers".
- </p>
-</div>
-<div class="section">
-<div class="titlepage"><div><h2 class="title" style="clear: both">
-<a name="sec-stream-state"></a>State of streams</h2></div></div>
-<p>
- At least some older implementations don't have
- <b>std::ios_base</b>, so you should use
- <b>std::ios::badbit</b>, <b>std::ios::failbit</b>
- and <b>std::ios::eofbit</b> and
- <b>std::ios::goodbit</b>.
- </p>
-</div>
-<div class="section">
-<div class="titlepage"><div><h2 class="title" style="clear: both">
-<a name="sec-vector-at"></a>vector::at is missing (i.e. gcc 2.95.x)</h2></div></div>
-<p>
- One solution is to add an autoconf-test for this:
- <pre class="programlisting">
- AC_MSG_CHECKING(for container::at)
- AC_TRY_COMPILE(
- [
- #include <vector>
- #include <deque>
- #include <string>
-
- using namespace std;
- ],
- [
- deque<int> test_deque(3);
- test_deque.at(2);
- vector<int> test_vector(2);
- test_vector.at(1);
- string test_string("test_string");
- test_string.at(3);
- ],
- [AC_MSG_RESULT(yes)
- AC_DEFINE(HAVE_CONTAINER_AT)],
- [AC_MSG_RESULT(no)])
- </pre>
- If you are using other (non-GNU) compilers it might be a good idea
- to check for <b>string::at</b> separately.
-</div>
-<div class="section">
-<div class="titlepage"><div><h2 class="title" style="clear: both">
-<a name="sec-eof"></a>Using std::char_traits<char>::eof()</h2></div></div>
-<p>
- <pre class="programlisting">
- #ifdef HAVE_CHAR_TRAITS
- #define CPP_EOF std::char_traits<char>::eof()
- #else
- #define CPP_EOF EOF
- #endif
- </pre>
-</div>
-<div class="section">
-<div class="titlepage"><div><h2 class="title" style="clear: both">
-<a name="sec-string-clear"></a>Using string::clear()/string::erase()</h2></div></div>
-<p>
- There are two functions for deleting the contents of a string:
- <b>clear</b> and <b>erase</b> (the latter
- returns the string).
- <pre class="programlisting">
- void
- clear() { _M_mutate(0, this->size(), 0); }
- </pre>
- <pre class="programlisting">
- basic_string&
- erase(size_type __pos = 0, size_type __n = npos)
- {
- return this->replace(_M_check(__pos), _M_fold(__pos, __n),
- _M_data(), _M_data());
- }
- </pre>
- The implementation of <b>erase</b> seems to be more
- complicated (from libstdc++-v3), but <b>clear</b> is not
- implemented in gcc 2.95.x's libstdc++, so you should use
- <b>erase</b> (which is probably faster than
- <b>operator=(charT*)</b>).
-</div>
-<div class="section">
-<div class="titlepage"><div><h2 class="title" style="clear: both">
-<a name="sec-scan-form"></a>GNU Extensions ostream::form and istream::scan</h2></div></div>
-<p>
- These are not supported any more - use
- <a href="#sec-stringstream" title="Using stringstreams">
- stringstreams</a> instead.
- </p>
-</div>
-<div class="section">
-<div class="titlepage"><div><h2 class="title" style="clear: both">
-<a name="sec-stringstream"></a>Using stringstreams</h2></div></div>
-<p>
- Libstdc++-v3 provides the new
- <b>i/ostringstream</b>-classes, (<tt><sstream></tt>), but for compatibility
- with older implementations you still have to use
- <b>i/ostrstream</b> (<tt><strstream></tt>):
- <pre class="programlisting">
- #ifdef HAVE_SSTREAM
- #include <sstream>
- #else
- #include <strstream>
- #endif
- </pre>
- <div class="itemizedlist"><ul type="disc">
-<li><p> <b>strstream</b> is considered to be
- deprecated
- </p></li>
-<li><p> <b>strstream</b> is limited to
- <b>char</b>
- </p></li>
-<li><p> with <b>ostringstream</b> you don't
- have to take care of terminating the string or freeing its
- memory
- </p></li>
-<li><p> <b>istringstream</b> can be re-filled
- (clear(); str(input);)
- </p></li>
-</ul></div>
-<p>
- You can then use output-stringstreams like this:
- <pre class="programlisting">
- #ifdef HAVE_SSTREAM
- std::ostringstream oss;
- #else
- std::ostrstream oss;
- #endif
- oss << "Name=" << m_name << ", number=" << m_number << std::endl;
- ...
- #ifndef HAVE_SSTREAM
- oss << std::ends; // terminate the char*-string
- #endif
- // str() returns char* for ostrstream and a string for ostringstream
- // this also causes ostrstream to think that the buffer's memory
- // is yours
- m_label.set_text(oss.str());
- #ifndef HAVE_SSTREAM
- // let the ostrstream take care of freeing the memory
- oss.freeze(false);
- #endif
- </pre>
-<p>
- Input-stringstreams can be used similarly:
- <pre class="programlisting">
- std::string input;
- ...
- #ifdef HAVE_SSTREAM
- std::istringstream iss(input);
- #else
- std::istrstream iss(input.c_str());
- #endif
- int i;
- iss >> i;
- </pre>
- One (the only?) restriction is that an istrstream cannot be re-filled:
- <pre class="programlisting">
- std::istringstream iss(numerator);
- iss >> m_num;
- // this is not possible with istrstream
- iss.clear();
- iss.str(denominator);
- iss >> m_den;
- </pre>
- If you don't care about speed, you can put these conversions in
- a template-function:
- <pre class="programlisting">
- template <class X>
- void fromString(const string& input, X& any)
- {
- #ifdef HAVE_SSTREAM
- std::istringstream iss(input);
- #else
- std::istrstream iss(input.c_str());
- #endif
- X temp;
- iss >> temp;
- if (iss.fail())
- throw runtime_error(..)
- any = temp;
- }
- </pre>
- Another example of using stringstreams is in <a href="../21_strings/howto.html" target="_top">this howto</a>.
-<p>
- I have read the Josuttis book on Standard C++, so some information
- comes from there. Additionally, there is information in
- "info iostream", which covers the old implementation that gcc 2.95.x
- uses.
- </p>
-</div>
-<div class="section">
-<div class="titlepage"><div><h2 class="title" style="clear: both">
-<a name="sec-about"></a>About...</h2></div></div>
-<p>
- Please send any experience, additions, corrections or questions to
- <a href="mailto:fnatter@gmx.net" target="_top">fnatter@gmx.net</a> or for
- discussion to the libstdc++-v3-mailing-list.
- </p>
-</div>
-</div></body>
-</html>
<html lang="en">
<head>
-<title>Porting libstdc++-v3</title>
+<title>Porting libstdc++</title>
<meta http-equiv="Content-Type" content="text/html">
-<meta name="description" content="Porting libstdc++-v3">
+<meta name="description" content="Porting libstdc++">
<meta name="generator" content="makeinfo 4.6">
<!--
Copyright © 2000, 2001, 2002, 2003, 2005 Free Software Foundation, Inc.
--></style>
</head>
<body>
-<h1 class="settitle">Porting libstdc++-v3</h1>
+<h1 class="settitle">Porting libstdc++</h1>
<div class="node">
<p><hr>
Node: <a name="Top">Top</a>,
<br>
</div>
-<h2 class="unnumbered">Porting libstdc++-v3</h2>
+<h2 class="unnumbered">Porting libstdc++</h2>
-<p>This document explains how to port libstdc++-v3 (the GNU C++ library) to
+<p>This document explains how to port libstdc++ (the GNU C++ library) to
a new target.
- <p>In order to make the GNU C++ library (libstdc++-v3) work with a new
+ <p>In order to make the GNU C++ library (libstdc++) work with a new
target, you must edit some configuration files and provide some new
-header files. Unless this is done, libstdc++-v3 will use generic
+header files. Unless this is done, libstdc++ will use generic
settings which may not be correct for your target; even if they are
correct, they will likely be inefficient.
<code>os_defines.h</code>. This file contains basic macro definitions
that are required to allow the C++ library to work with your C library.
- <p>Several libstdc++-v3 source files unconditionally define the macro
+ <p>Several libstdc++ source files unconditionally define the macro
<code>_POSIX_SOURCE</code>. On many systems, defining this macro causes
large portions of the C library header files to be eliminated
at preprocessing time. Therefore, you may have to <code>#undef</code> this
target. It will not work to simply define these macros in
<code>os_defines.h</code>.
- <p>At this time, there are a few libstdc++-v3-specific macros which may be
+ <p>At this time, there are a few libstdc++-specific macros which may be
defined:
<p><code>_GLIBCXX_USE_C99_CHECK</code> may be defined to 1 to check C99
certainly need some modification.
<p>The first file to write is <code>ctype_base.h</code>. This file provides
-some very basic information about character classification. The libstdc++-v3
+some very basic information about character classification. The libstdc++
library assumes that your C library implements <code><ctype.h></code> by using
a table (indexed by character code) containing integers, where each of
these integers is a bit-mask indicating whether the character is
document, but there are a few, particular bits that are necessary for
porting.
- <p>Some parts of the libstdc++-v3 library are compiled with the libtool
+ <p>Some parts of the libstdc++ library are compiled with the libtool
<code>--tags CXX</code> option (the C++ definitions for libtool). Therefore,
<code>ltcf-cxx.sh</code> in the top-level directory needs to have the correct
logic to compile and archive objects equivalent to the C version of libtool,
object files when the C++ library is built as a shared library, or
taking other system-specific actions.
- <p>The libstdc++-v3 library is linked with the C version of libtool, even
+ <p>The libstdc++ library is linked with the C version of libtool, even
though it is a C++ library. Therefore, the C version of libtool needs to
ensure that the run-time library initializers are run. The usual way to
do this is to build the library using <code>gcc -shared</code>.
<div class="contents">
<h2>Table of Contents</h2>
<ul>
-<li><a name="toc_Top" href="#Top">Porting libstdc++-v3</a>
+<li><a name="toc_Top" href="#Top">Porting libstdc++</a>
<li><a name="toc_Operating%20system" href="#Operating%20system">Operating system</a>
<li><a name="toc_CPU" href="#CPU">CPU</a>
<li><a name="toc_Character%20types" href="#Character%20types">Character types</a>
--- /dev/null
+<?xml version="1.0" encoding="ISO-8859-1"?>
+<!DOCTYPE html
+ PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+ "DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+
+<head>
+
+ <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1" />
+ <link rev="made" href="mailto:gcc@gcc.gnu.org" />
+ <link rel="shortcut icon" href="http://gcc.gnu.org/favicon.ico" />
+
+ <title>
+ Status of TR1 features in GCC
+ - GNU Project - Free Software Foundation (FSF)
+ </title>
+
+</head>
+
+<body>
+
+<h1 align="center">
+ Status of TR1 features in GCC
+</h1>
+
+<p>
+This table is based on the table of contents of ISO/IEC DTR 19768
+Doc No: N1836=05-0096 Date: 2005-06-24
+Draft Technical Report on C++ Library Extensions
+</p>
+
+<p>
+In this implementation the header names are prefixed by
+<code>tr1/</code>, for instance <code><tr1/functional></code>,
+<code><tr1/memory></code>, and so on.
+</p>
+
+<p>
+This page describes the TR1 support in mainline GCC SVN, not in any particular
+release.
+</p>
+
+<table border="1">
+ <thead>
+ <tr>
+ <td><span style="font-weight: bold;">Section</span></td>
+ <td><span style="font-weight: bold;">Description</span></td>
+ <td><span style="font-weight: bold;">Done</span></td>
+ <td><span style="font-weight: bold;">Broken</span></td>
+ <td><span style="font-weight: bold;">Missing</span></td>
+ <td><span style="font-weight: bold;">Comments</span></td>
+ </tr>
+ </thead>
+ <tbody>
+ <tr>
+ <td><b>2</b></td>
+ <td colspan="5"><b>General Utilities</b></td>
+ </tr>
+ <tr>
+ <td>2.1</td>
+ <td>Reference wrappers</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.1.1</td>
+ <td>Additions to header <code><functional></code> synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.1.2</td>
+ <td>Class template <code>reference_wrapper</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.1.2.1</td>
+ <td><code>reference_wrapper</code> construct/copy/destroy</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.1.2.2</td>
+ <td><code>reference_wrapper</code> assignment</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.1.2.3</td>
+ <td><code>reference_wrapper</code> access</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.1.2.4</td>
+ <td><code>reference_wrapper</code> invocation</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.1.2.5</td>
+ <td><code>reference_wrapper</code> helper functions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.2</td>
+ <td>Smart pointers</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.2.1</td>
+ <td>Additions to header <code><memory></code> synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.2.2</td>
+ <td>Class <code>bad_weak_ptr</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.2.3</td>
+ <td>Class template <code>shared_ptr</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td><a href="tr1.html#1">1</a></td>
+ </tr>
+ <tr>
+ <td>2.2.3.1</td>
+ <td><code>shared_ptr</code> constructors</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.2.3.2</td>
+ <td><code>shared_ptr</code> destructor</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.2.3.3</td>
+ <td><code>shared_ptr</code> assignment</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.2.3.4</td>
+ <td><code>shared_ptr</code> modifiers</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.2.3.5</td>
+ <td><code>shared_ptr</code> observers</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.2.3.6</td>
+ <td><code>shared_ptr</code> comparison</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.2.3.7</td>
+ <td><code>shared_ptr</code> I/O</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.2.3.8</td>
+ <td><code>shared_ptr</code> specialized algorithms</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.2.3.9</td>
+ <td><code>shared_ptr</code> casts</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.2.3.10</td>
+ <td><code>get_deleter</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.2.4</td>
+ <td>Class template <code>weak_ptr</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.2.4.1</td>
+ <td><code>weak_ptr</code> constructors</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.2.4.2</td>
+ <td><code>weak_ptr</code> destructor</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.2.4.3</td>
+ <td><code>weak_ptr</code> assignment</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.2.4.4</td>
+ <td><code>weak_ptr</code> modifiers</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.2.4.5</td>
+ <td><code>weak_ptr</code> observers</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.2.4.6</td>
+ <td><code>weak_ptr</code> comparison</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.2.4.7</td>
+ <td><code>weak_ptr</code> specialized algorithms</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>2.2.5</td>
+ <td>Class template <code>enable_shared_from_this</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td><b>3</b></td>
+ <td colspan="5"><b>Function objects</b></td>
+ </tr>
+ <tr>
+ <td>3.1</td>
+ <td>Definitions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>3.2</td>
+ <td>Additions to <code><functional> synopsis</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>3.3</td>
+ <td>Requirements</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>3.4</td>
+ <td>Function return types</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>3.5</td>
+ <td>Function template <code>mem_fn</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>3.6</td>
+ <td>Function object binders</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>3.6.1</td>
+ <td>Class template <code>is_bind_expression</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>3.6.2</td>
+ <td>Class template <code>is_placeholder</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>3.6.3</td>
+ <td>Function template <code>bind</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>3.6.4</td>
+ <td>Placeholders</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>3.7</td>
+ <td>Polymorphic function wrappers</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>3.7.1</td>
+ <td>Class <code>bad_function_call<code></code></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>3.7.1.1</td>
+ <td><code>bad_function_call</code> constructor</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>3.7.2</td>
+ <td>Class template <code>function</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>3.7.2.1</td>
+ <td><code>function</code> construct/copy/destroy</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>3.7.2.2</td>
+ <td><code>function</code> modifiers</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>3.7.2.3</td>
+ <td><code>function</code> capacity</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>3.7.2.4</td>
+ <td><code>function</code> invocation</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>3.7.2.5</td>
+ <td><code>function</code> target access</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>3.7.2.6</td>
+ <td>undefined operators</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>3.7.2.7</td>
+ <td>null pointer comparison operators</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>3.7.2.8</td>
+ <td>specialized algorithms</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td><b>4</b></td>
+ <td colspan="5"><b>Metaprogramming and type traits</b></td>
+ </tr>
+ <tr>
+ <td>4.1</td>
+ <td>Requirements</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>4.2</td>
+ <td>Header <code><type_traits></code> synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>4.3</td>
+ <td>Helper classes</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>4.4</td>
+ <td>General Requirements</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>4.5</td>
+ <td>Unary Type Traits</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>4.5.1</td>
+ <td>Primary Type Categories</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>4.5.2</td>
+ <td>Composite type traits</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>4.5.3</td>
+ <td>Type properties</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>4.6</td>
+ <td>Relationships between types</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>4.7</td>
+ <td>Transformations between types</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>4.7.1</td>
+ <td>Const-volatile modifications</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>4.7.2</td>
+ <td>Reference modifications</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>4.7.3</td>
+ <td>Array modifications</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>4.7.4</td>
+ <td>Pointer modifications</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>4.8</td>
+ <td>Other transformations</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>4.9</td>
+ <td>Implementation requirements</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td><b>5</b></td>
+ <td colspan="5"><b>Numerical facilities</b></td>
+ </tr>
+ <tr>
+ <td>5.1</td>
+ <td>Random number generation</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.1.1</td>
+ <td>Requirements</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.1.2</td>
+ <td>Header <code><random></code> synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.1.3</td>
+ <td>Class template <code>variate_generator</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.1.4</td>
+ <td>Random number engine class templates</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.1.4.1</td>
+ <td>Class template <code>linear_congruential</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.1.4.2</td>
+ <td>Class template <code>mersenne_twister</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.1.4.3</td>
+ <td>Class template <code>subtract_with_carry</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.1.4.4</td>
+ <td>Class template <code>subtract_with_carry_01</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.1.4.5</td>
+ <td>Class template <code>discard_block</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.1.4.6</td>
+ <td>Class template <code>xor_combine</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td>operator()() per N2079</td>
+ </tr>
+ <tr>
+ <td>5.1.5</td>
+ <td>Engines with predefined parameters</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.1.6</td>
+ <td>Class <code>random_device</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.1.7</td>
+ <td>Random distribution class templates</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.1.7.1</td>
+ <td>Class template <code>uniform_int</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.1.7.2</td>
+ <td>Class <code>bernoulli_distribution</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.1.7.3</td>
+ <td>Class template <code>geometric_distribution</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.1.7.4</td>
+ <td>Class template <code>poisson_distribution</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.1.7.5</td>
+ <td>Class template <code>binomial_distribution</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.1.7.6</td>
+ <td>Class template <code>uniform_real</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.1.7.7</td>
+ <td>Class template <code>exponential_distribution</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.1.7.8</td>
+ <td>Class template <code>normal_distribution</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.1.7.9</td>
+ <td>Class template <code>gamma_distribution</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2</td>
+ <td>Mathematical special functions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2.1</td>
+ <td>Additions to header <code><cmath></code> synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2.1.1</td>
+ <td>associated Laguerre polynomials</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2.1.2</td>
+ <td>associated Legendre functions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2.1.3</td>
+ <td>beta function</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2.1.4</td>
+ <td>(complete) elliptic integral of the first kind</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2.1.5</td>
+ <td>(complete) elliptic integral of the second kind</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2.1.6</td>
+ <td>(complete) elliptic integral of the third kind</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2.1.7</td>
+ <td>confluent hypergeometric functions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2.1.8</td>
+ <td>regular modified cylindrical Bessel functions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2.1.9</td>
+ <td>cylindrical Bessel functions (of the first kind)</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2.1.10</td>
+ <td>irregular modified cylindrical Bessel functions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2.1.11</td>
+ <td>cylindrical Neumann functions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2.1.12</td>
+ <td>(incomplete) elliptic integral of the first kind</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2.1.13</td>
+ <td>(incomplete) elliptic integral of the second kind</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2.1.14</td>
+ <td>(incomplete) elliptic integral of the third kind</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2.1.15</td>
+ <td>exponential integral</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2.1.16</td>
+ <td>Hermite polynomials</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2.1.17</td>
+ <td>hypergeometric functions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2.1.18</td>
+ <td>Laguerre polynomials</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2.1.19</td>
+ <td>Legendre polynomials</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2.1.20</td>
+ <td>Riemann zeta function</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2.1.21</td>
+ <td>spherical Bessel functions (of the first kind)</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2.1.22</td>
+ <td>spherical associated Legendre functions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2.1.23</td>
+ <td>spherical Neumann functions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>5.2.2</td>
+ <td>Additions to header <code><math.h></code> synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td><b>6</b></td>
+ <td colspan="5"><b>Containers</b></td>
+ </tr>
+ <tr>
+ <td>6.1</td>
+ <td>Tuple types</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.1.1</td>
+ <td>Header <code><tuple></code> synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.1.2</td>
+ <td>Additions to header <code><utility></code> synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.1.3</td>
+ <td>Class template <code>tuple</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.1.3.1</td>
+ <td>Construction</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.1.3.2</td>
+ <td>Tuple creation functions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.1.3.3</td>
+ <td>Tuple helper classes</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.1.3.4</td>
+ <td>Element access</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.1.3.5</td>
+ <td>Relational operators</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.1.4</td>
+ <td>Pairs</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.2</td>
+ <td>Fixed size array</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.2.1</td>
+ <td>Header <code><array></code> synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.2.2</td>
+ <td>Class template <code>array</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.2.2.1</td>
+ <td><code>array</code> constructors, copy, and assignment</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.2.2.2</td>
+ <td><code>array</code> specialized algorithms</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.2.2.3</td>
+ <td><code>array</code> size</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.2.2.4</td>
+ <td>Zero sized <code>array</code>s</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.2.2.5</td>
+ <td>Tuple interface to class template <code>array</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.3</td>
+ <td>Unordered associative containers</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.3.1</td>
+ <td>Unordered associative container requirements</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.3.1.1</td>
+ <td>Exception safety guarantees</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.3.2</td>
+ <td>Additions to header <code><functional></code> synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.3.3</td>
+ <td>Class template <code>hash</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.3.4</td>
+ <td>Unordered associative container classes</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.3.4.1</td>
+ <td>Header <code><unordered_set></code> synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.3.4.2</td>
+ <td>Header <code><unordered_map></code> synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.3.4.3</td>
+ <td>Class template <code>unordered_set</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.3.4.3.1</td>
+ <td><code>unordered_set</code> constructors</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.3.4.3.2</td>
+ <td><code>unordered_set</code> swap</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.3.4.4</td>
+ <td>Class template <code>unordered_map</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.3.4.4.1</td>
+ <td><code>unordered_map</code> constructors</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.3.4.4.2</td>
+ <td><code>unordered_map</code> element access</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.3.4.4.3</td>
+ <td><code>unordered_map</code> swap</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.3.4.5</td>
+ <td>Class template <code>unordered_multiset<code></code></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.3.4.5.1</td>
+ <td><code>unordered_multiset</code> constructors</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.3.4.5.2</td>
+ <td><code>unordered_multiset</code> swap</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.3.4.6</td>
+ <td>Class template <code>unordered_multimap</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.3.4.6.1</td>
+ <td><code>unordered_multimap</code> constructors</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>6.3.4.6.2</td>
+ <td><code>unordered_multimap</code> swap</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td><b>7</b></td>
+ <td colspan="5"><b>Regular expressions</b></td>
+ </tr>
+ <tr>
+ <td>7.1</td>
+ <td>Definitions</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.2</td>
+ <td>Requirements</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.3</td>
+ <td>Regular expressions summary</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.4</td>
+ <td>Header <code><regex></code> synopsis</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.5</td>
+ <td>Namespace <code>tr1::regex_constants</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.5.1</td>
+ <td>Bitmask Type <code>syntax_option_type</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.5.2</td>
+ <td>Bitmask Type <code>regex_constants::match_flag_type</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.5.3</td>
+ <td>Implementation defined <code>error_type</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.6</td>
+ <td>Class <code>regex_error</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.7</td>
+ <td>Class template <code>regex_traits</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.8</td>
+ <td>Class template <code>basic_regex</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.8.1</td>
+ <td><code>basic_regex</code> constants</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.8.2</td>
+ <td><code>basic_regex</code> constructors</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.8.3</td>
+ <td><code>basic_regex</code> assign</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.8.4</td>
+ <td><code>basic_regex</code> constant operations</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.8.5</td>
+ <td><code>basic_regex</code> locale</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.8.6</td>
+ <td><code>basic_regex</code> swap</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.8.7</td>
+ <td><code>basic_regex</code> non-member functions</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.8.7.1</td>
+ <td><code>basic_regex</code> non-member swap</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.9</td>
+ <td>Class template <code>sub_match</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.9.1</td>
+ <td><code>sub_match</code> members</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.9.2</td>
+ <td><code>sub_match</code> non-member operators</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.10</td>
+ <td>Class template <code>match_results</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.10.1</td>
+ <td><code>match_results</code> constructors</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.10.2</td>
+ <td><code>match_results</code> size</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.10.3</td>
+ <td><code>match_results</code> element access</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.10.4</td>
+ <td><code>match_results</code> formatting</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.10.5</td>
+ <td><code>match_results</code> allocator</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.10.6</td>
+ <td><code>match_results</code> swap</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.11</td>
+ <td>Regular expression algorithms</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.11.1</td>
+ <td>exceptions</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.11.2</td>
+ <td><code>regex_match</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.11.3</td>
+ <td><code>regex_search</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.11.4</td>
+ <td><code>regex_replace</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.12</td>
+ <td>Regular expression Iterators</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.12.1</td>
+ <td>Class template <code>regex_iterator</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.12.1.1</td>
+ <td><code>regex_iterator</code> constructors</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.12.1.2</td>
+ <td><code>regex_iterator</code> comparisons</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.12.1.3</td>
+ <td><code>regex_iterator</code> dereference</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.12.1.4</td>
+ <td><code>regex_iterator</code> increment</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.12.2</td>
+ <td>Class template <code>regex_token_iterator</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.12.2.1</td>
+ <td><code>regex_token_iterator</code> constructors</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.12.2.2</td>
+ <td><code>regex_token_iterator</code> comparisons</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.12.2.3</td>
+ <td><code>regex_token_iterator</code> dereference</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.12.2.4</td>
+ <td><code>regex_token_iterator</code> increment</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>7.13</td>
+ <td>Modified ECMAScript regular expression grammar</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td><b>8</b></td>
+ <td colspan="5"><b>C compatibility</b></td>
+ </tr>
+ <tr>
+ <td>8.1</td>
+ <td>Additions to header <code><complex></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.1.1</td>
+ <td>Synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.1.2</td>
+ <td>Function <code>acos</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.1.3</td>
+ <td>Function <code>asin</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.1.4</td>
+ <td>Function <code>atan</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.1.5</td>
+ <td>Function <code>acosh</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.1.6</td>
+ <td>Function <code>asinh</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.1.7</td>
+ <td>Function <code>atanh</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.1.8</td>
+ <td>Function <code>fabs</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.1.9</td>
+ <td>Additional Overloads</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.2</td>
+ <td>Header <code><ccomplex></code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td>DR 551</td>
+ </tr>
+ <tr>
+ <td>8.3</td>
+ <td>Header <code><complex.h></code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td>DR 551</td>
+ </tr>
+ <tr>
+ <td>8.4</td>
+ <td>Additions to header <code><cctype></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.4.1</td>
+ <td>Synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.4.2</td>
+ <td>Function <code>isblank</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.5</td>
+ <td>Additions to header <code><ctype.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.6</td>
+ <td>Header <code><cfenv></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.6.1</td>
+ <td>Synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.6.2</td>
+ <td>Definitions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.7</td>
+ <td>Header <code><fenv.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.8</td>
+ <td>Additions to header <code><cfloat></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.9</td>
+ <td>Additions to header <code><float.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.10</td>
+ <td>Additions to header <code><ios></code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.10.1</td>
+ <td>Synopsis</td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.10.2</td>
+ <td>Function <code>hexfloat</code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.11</td>
+ <td>Header <code><cinttypes></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.11.1</td>
+ <td>Synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td>DR 557</td>
+ </tr>
+ <tr>
+ <td>8.11.2</td>
+ <td>Definitions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.12</td>
+ <td>Header <code><inttypes.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.13</td>
+ <td>Additions to header <code><climits></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.14</td>
+ <td>Additions to header <code><limits.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.15</td>
+ <td>Additions to header <code><locale></code></td>
+ <td></td>
+ <td></td>
+ <td>missing</td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.16</td>
+ <td>Additions to header <code><cmath></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.16.1</td>
+ <td>Synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.16.2</td>
+ <td>Definitions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.16.3</td>
+ <td>Function template definitions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.16.4</td>
+ <td>Additional overloads</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td>DR 568; DR 550</td>
+ </tr>
+ <tr>
+ <td>8.17</td>
+ <td>Additions to header <code><math.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.18</td>
+ <td>Additions to header <code><cstdarg></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.19</td>
+ <td>Additions to header <code><stdarg.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.20</td>
+ <td>The header <code><cstdbool></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.21</td>
+ <td>The header <code><stdbool.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.22</td>
+ <td>The header <code><cstdint></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.22.1</td>
+ <td>Synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.22.2</td>
+ <td>Definitions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.23</td>
+ <td>The header <code><stdint.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.24</td>
+ <td>Additions to header <code><cstdio></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.24.1</td>
+ <td>Synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.24.2</td>
+ <td>Definitions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.24.3</td>
+ <td>Additional format specifiers</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td>C library responsibility</td>
+ </tr>
+ <tr>
+ <td>8.24.4</td>
+ <td>Additions to header <code><stdio.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.25</td>
+ <td>Additions to header <code><cstdlib></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.25.1</td>
+ <td>Synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.25.2</td>
+ <td>Definitions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.25.3</td>
+ <td>Function <code>abs</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.25.4</td>
+ <td>Function <code>div</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.26</td>
+ <td>Additions to header <code><stdlib.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.27</td>
+ <td>Header <code><ctgmath></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td>DR 551</td>
+ </tr>
+ <tr>
+ <td>8.28</td>
+ <td>Header <code><tgmath.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td>DR 551</td>
+ </tr>
+ <tr>
+ <td>8.29</td>
+ <td>Additions to header <code><ctime></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td>C library responsibility</td>
+ </tr>
+ <tr>
+ <td>8.30</td>
+ <td>Additions to header <code><cwchar></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.30.1</td>
+ <td>Synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.30.2</td>
+ <td>Definitions</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.30.3</td>
+ <td>Additional wide format specifiers</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td>C library responsibility</td>
+ </tr>
+ <tr>
+ <td>8.31</td>
+ <td>Additions to header <code><wchar.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.32</td>
+ <td>Additions to header <code><cwctype></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.32.1</td>
+ <td>Synopsis</td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.32.2</td>
+ <td>Function <code>iswblank</code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ <tr>
+ <td>8.33</td>
+ <td>Additions to header <code><wctype.h></code></td>
+ <td>done</td>
+ <td></td>
+ <td></td>
+ <td></td>
+ </tr>
+ </tbody>
+</table>
+
+<h3>Footnotes</h3>
+
+<ol>
+
+ <li>
+ <a name="1"/>
+ The shared_ptr implementation uses some code from the
+ <a href="http://www.boost.org/libs/smart_ptr/shared_ptr.htm">Boost
+ shared_ptr</a> library.
+ </li>
+
+</ol>
+
+<p>
+Please send FSF & GNU inquiries & questions to
+<a href="mailto:gnu@gnu.org">gnu@gnu.org</a>.
+There are also <a href="http://www.gnu.org/home.html#ContactInfo">other ways
+to contact</a> the FSF.
+</p>
+
+<p>
+These pages are maintained by
+<a href="http://gcc.gnu.org/about.html">the GCC team</a>.
+</p>
+
+<address>
+For questions related to the use of GCC, please consult these web
+pages and the <a href="http://gcc.gnu.org/onlinedocs/">GCC manuals</a>. If
+that fails, the <a href="mailto:gcc-help@gcc.gnu.org">gcc-help@gcc.gnu.org</a>
+mailing list might help.<br />
+Please send comments on these web pages and the development of GCC to our
+developer mailing list at <a href="mailto:gcc@gnu.org">gcc@gnu.org</a>
+or <a href="mailto:gcc@gcc.gnu.org">gcc@gcc.gnu.org</a>. All of our lists
+have <a href="http://gcc.gnu.org/lists.html">public archives</a>.
+</address>
+
+<p>
+Copyright (C) Free Software Foundation, Inc.,
+51 Franklin St, Fifth Floor, Boston, MA 02110, USA.
+</p>
+<p>
+Verbatim copying and distribution of this entire article is
+permitted in any medium, provided this notice is preserved.
+</p>
+
+<table width="100%" border="0">
+<tr>
+ <td>
+ <!-- IGNORE DIFF -->Last modified 2006-10-01
+ </td>
+ <td align="right" valign="bottom">
+ <a href="http://validator.w3.org/check/referer">
+ <img src="http://www.w3.org/Icons/valid-xhtml10"
+ alt="Valid XHTML 1.0" border="0" width="88" height="31" />
+ </a>
+ </td>
+</tr>
+</table>
+
+</body>
+</html>
<meta name="KEYWORDS" content="HOWTO, libstdc++, GCC, g++, libg++, STL" />
<meta name="DESCRIPTION" content="HOWTO for the libstdc++ chapter 18." />
<meta name="GENERATOR" content="vi and eight fingers" />
- <title>libstdc++-v3 HOWTO: Chapter 18: Library Support</title>
+ <title>libstdc++ HOWTO: Chapter 18: Library Support</title>
<link rel="StyleSheet" href="../lib3styles.css" type="text/css" />
<link rel="Start" href="../documentation.html" type="text/html"
title="GNU C++ Standard Library" />
<meta name="KEYWORDS" content="HOWTO, libstdc++, GCC, g++, libg++, STL" />
<meta name="DESCRIPTION" content="HOWTO for the libstdc++ chapter 19." />
<meta name="GENERATOR" content="vi and eight fingers" />
- <title>libstdc++-v3 HOWTO: Chapter 19: Diagnostics</title>
+ <title>libstdc++ HOWTO: Chapter 19: Diagnostics</title>
<link rel="StyleSheet" href="../lib3styles.css" type="text/css" />
<link rel="Start" href="../documentation.html" type="text/html"
title="GNU C++ Standard Library" />
<h1>Contents</h1>
<ul>
<li><a href="#1">Adding data to exceptions</a></li>
- <li><a href="#2">Exception class hierarchy diagram</a></li>
<li><a href="#3">Concept checkers -- <strong>new and improved!</strong></a></li>
</ul>
<a href="../faq/index.html">to the FAQ</a>.
</p>
-<hr />
-<h2><a name="2">Exception class hierarchy diagram</a></h2>
- <p>At one point we were going to make up a PDF of the exceptions
- hierarchy, akin to the one done for the I/O class hierarchy.
- Time was our enemy. Since then we've moved to Doxygen, which has
- the useful property of not sucking. Specifically, when the source
- code is changed, the diagrams are automatically brought up to date.
- For the old way, we had to update the diagrams separately.
- </p>
- <p>There are several links to the Doxygen-generated pages from
- <a href="../documentation.html">here</a>.
- </p>
- <p>Return <a href="#top">to top of page</a> or
- <a href="../faq/index.html">to the FAQ</a>.
- </p>
-
<hr />
<h2><a name="3">Concept checkers -- <strong>new and improved!</strong></a></h2>
<p>Better taste! Less fat! Literally!</p>
(or with <code>#define _GLIBCPP_CONCEPT_CHECKS</code> for versions
3.1, 3.2 and 3.3).
</p>
+
+ <p>Please note that the upcoming C++ standard has first-class
+ support for template parameter constraints based on concepts in the core
+ language. This will obviate the need for the library-simulated concept
+ checking described above.
+ </p>
+
<p>Return <a href="#top">to top of page</a> or
<a href="../faq/index.html">to the FAQ</a>.
</p>
</em></p>
<p><em>
- To the <a href="http://gcc.gnu.org/libstdc++/">libstdc++-v3 homepage</a>.
+ To the <a href="http://gcc.gnu.org/libstdc++/">libstdc++ homepage</a>.
</em></p>
<!-- ####################################################### -->
<hr />
<p> The C++ Standard encapsulates memory management characteristics
for strings, container classes, and parts of iostreams in a
- template class called <code>std::allocator</code>.
+ template class called <code>std::allocator</code>. This class, and
+ base classes of it, are the superset of available free store
+ ("heap") management classes.
</p>
<h3 class="left">
<p>What about threads? No problem: in a threadsafe environment, the
memory pool is manipulated atomically, so you can grow a container in
one thread and shrink it in another, etc. <strong>BUT</strong> what
- if threads in libstdc++-v3 aren't set up properly?
+ if threads in libstdc++ aren't set up properly?
<a href="../faq/index.html#5_6">That's been answered already</a>.
</p>
<p><strong>BUT</strong> what if you want to use your own allocator? What
<meta name="KEYWORDS" content="HOWTO, libstdc++, GCC, g++, libg++, STL" />
<meta name="DESCRIPTION" content="HOWTO for the libstdc++ chapter 20." />
<meta name="GENERATOR" content="vi and eight fingers" />
- <title>libstdc++-v3 HOWTO: Chapter 20: General Utilities</title>
+ <title>libstdc++ HOWTO: Chapter 20: General Utilities</title>
<link rel="StyleSheet" href="../lib3styles.css" type="text/css" />
<link rel="Start" href="../documentation.html" type="text/html"
title="GNU C++ Standard Library" />
<pre>
pair<int,MyClass> p = make_pair(4,myobject);
</pre>
- <p>Return <a href="#top">to top of page</a> or
- <a href="../faq/index.html">to the FAQ</a>.
- </p>
-<hr />
-<h2><a name="5">Memory allocators</a></h2>
- <p>The available free store ("heap") management classes are
- described <a href="allocator.html">here</a>.
- </p>
<p>Return <a href="#top">to top of page</a> or
<a href="../faq/index.html">to the FAQ</a>.
</p>
<meta name="KEYWORDS" content="HOWTO, libstdc++, GCC, g++, libg++, STL" />
<meta name="DESCRIPTION" content="HOWTO for the libstdc++ chapter 21." />
<meta name="GENERATOR" content="vi and eight fingers" />
- <title>libstdc++-v3 HOWTO: Chapter 21: Strings</title>
+ <title>libstdc++ HOWTO: Chapter 21: Strings</title>
<link rel="StyleSheet" href="../lib3styles.css" type="text/css" />
<link rel="Start" href="../documentation.html" type="text/html"
title="GNU C++ Standard Library" />
<em>if the implementors do it correctly</em>. The libstdc++
implementors did it correctly. Other vendors might not.
</li>
- <li>While parts of the SGI STL are used in libstdc++-v3, their
+ <li>While parts of the SGI STL are used in libstdc++, their
string class is not. The SGI <code>string</code> is essentially
<code>vector<char></code> and does not do any reference
- counting like libstdc++-v3's does. (It is O(n), though.)
+ counting like libstdc++'s does. (It is O(n), though.)
So if you're thinking about SGI's string or rope classes,
you're now looking at four possibilities: CString, the
libstdc++ string, the SGI string, and the SGI rope, and this
characters (hereafter referred to as wchar_t) and the standard type
char that is so beloved in classic "C" (which can now be referred to
as narrow characters.) This document attempts to describe how the GNU
-libstdc++-v3 implementation deals with the conversion between wide and
+libstdc++ implementation deals with the conversion between wide and
narrow characters, and also presents a framework for dealing with the
huge number of other encodings that iconv can convert, including
Unicode and UTF8. Design issues and requirements are addressed, and
into this limitation. However, as a quality of implementation issue,
the GNU C++ library would like to offer a solution that allows
multiple locales and or simultaneous usage with computationally
-correct results. In short, libstdc++-v3 is trying to offer, as an
+correct results. In short, libstdc++ is trying to offer, as an
option, a high-quality implementation, damn the additional complexity!
</p>
<p>
Neither of these two required specializations deals with Unicode
-characters. As such, libstdc++-v3 implements a partial specialization
+characters. As such, libstdc++ implements a partial specialization
of the codecvt class with and iconv wrapper class, encoding_state as the
third template parameter.
</p>
<p>
Neither of these two required specializations deals with Unicode
-characters. As such, libstdc++-v3 implements
+characters. As such, libstdc++ implements
</p>
<h2>
<meta name="KEYWORDS" content="HOWTO, libstdc++, GCC, g++, libg++, STL" />
<meta name="DESCRIPTION" content="HOWTO for the libstdc++ chapter 22." />
<meta name="GENERATOR" content="vi and eight fingers" />
- <title>libstdc++-v3 HOWTO: Chapter 22: Localization</title>
+ <title>libstdc++ HOWTO: Chapter 22: Localization</title>
<link rel="StyleSheet" href="../lib3styles.css" type="text/css" />
<link rel="Start" href="../documentation.html" type="text/html"
title="GNU C++ Standard Library" />
wide characters (hereafter referred to as wchar_t) and the standard
type char that is so beloved in classic "C" (which can
now be referred to as narrow characters.) This document attempts
- to describe how the GNU libstdc++-v3 implementation deals with the
+ to describe how the GNU libstdc++ implementation deals with the
conversion between wide and narrow characters, and also presents a
framework for dealing with the huge number of other encodings that
iconv can convert, including Unicode and UTF8. Design issues and
<li> Copy the binary files into the correct directory structure.
<p>
- <code>cp fr_FR.mo (dir)/fr_FR/LC_MESSAGES/libstdc++-v3.mo</code>
+ <code>cp fr_FR.mo (dir)/fr_FR/LC_MESSAGES/libstdc++.mo</code>
</p>
<p>
- <code>cp de_DE.mo (dir)/de_DE/LC_MESSAGES/libstdc++-v3.mo</code>
+ <code>cp de_DE.mo (dir)/de_DE/LC_MESSAGES/libstdc++.mo</code>
</p>
</li>
{
typedef messages<char>::catalog catalog;
const char* dir =
- "/mnt/egcs/build/i686-pc-linux-gnu/libstdc++-v3/po/share/locale";
+ "/mnt/egcs/build/i686-pc-linux-gnu/libstdc++/po/share/locale";
const locale loc_de("de_DE");
const messages<char>& mssg_de = use_facet<messages<char> >(loc_de);
<meta name="KEYWORDS" content="HOWTO, libstdc++, GCC, g++, libg++, STL" />
<meta name="DESCRIPTION" content="HOWTO for the libstdc++ chapter 23." />
<meta name="GENERATOR" content="vi and eight fingers" />
- <title>libstdc++-v3 HOWTO: Chapter 23: Containers</title>
+ <title>libstdc++ HOWTO: Chapter 23: Containers</title>
<link rel="StyleSheet" href="../lib3styles.css" type="text/css" />
<link rel="Start" href="../documentation.html" type="text/html"
title="GNU C++ Standard Library" />
along the lines of the third category, the author would love to hear
from you...
</p>
- <p>Also note that the implementation of bitset used in libstdc++-v3 has
+ <p>Also note that the implementation of bitset used in libstdc++ has
<a href="../ext/sgiexts.html#ch23">some extensions</a>.
</p>
<p>Return <a href="#top">to top of page</a> or
<p><em>However, please ignore all discussions about the user-level
configuration of the lock implementation inside the STL
container-memory allocator on those pages. For the sake of this
- discussion, libstdc++-v3 configures the SGI STL implementation,
+ discussion, libstdc++ configures the SGI STL implementation,
not you. This is quite different from how gcc pre-3.0 worked.
In particular, past advice was for people using g++ to
explicitly define _PTHREADS or other macros or port-specific
longer be done unless you really know what you are doing and
assume all responsibility.</em>
</p>
- <p>Since the container implementation of libstdc++-v3 uses the SGI
+ <p>Since the container implementation of libstdc++ uses the SGI
code, we use the same definition of thread safety as SGI when
discussing design. A key point that beginners may miss is the
fourth major paragraph of the first page mentioned above
client code (that'd be you, not us). There is a notable
exceptions to this rule. Allocators called while a container or
element is constructed uses an internal lock obtained and
- released solely within libstdc++-v3 code (in fact, this is the
+ released solely within libstdc++ code (in fact, this is the
reason STL requires any knowledge of the thread configuration).
</p>
<p>For implementing a container which does its own locking, it is
addresses this topic, but I will ignore it here because it is not yet
finalized.)
</p>
- <p>Here we'll describe how the hinting works in the libstdc++-v3
+ <p>Here we'll describe how the hinting works in the libstdc++
implementation, and what you need to do in order to take advantage of
it. (Insertions can change from logarithmic complexity to amortized
constant time, if the hint is properly used.) Also, since the current
<meta name="KEYWORDS" content="HOWTO, libstdc++, GCC, g++, libg++, STL" />
<meta name="DESCRIPTION" content="HOWTO for the libstdc++ chapter 24." />
<meta name="GENERATOR" content="vi and eight fingers" />
- <title>libstdc++-v3 HOWTO: Chapter 24: Iterators</title>
+ <title>libstdc++ HOWTO: Chapter 24: Iterators</title>
<link rel="StyleSheet" href="../lib3styles.css" type="text/css" />
<link rel="Start" href="../documentation.html" type="text/html"
title="GNU C++ Standard Library" />
<h2><a name="1">They ain't pointers!</a></h2>
<p><a href="../faq/index.html#5_1">FAQ 5.1</a> points out that iterators
are not implemented as pointers. They are a generalization of
- pointers, but they are implemented in libstdc++-v3 as separate classes.
+ pointers, but they are implemented in libstdc++ as separate classes.
</p>
<p>Keeping that simple fact in mind as you design your code will
prevent a whole lot of difficult-to-understand bugs.
<meta name="KEYWORDS" content="HOWTO, libstdc++, GCC, g++, libg++, STL" />
<meta name="DESCRIPTION" content="HOWTO for the libstdc++ chapter 25." />
<meta name="GENERATOR" content="vi and eight fingers" />
- <title>libstdc++-v3 HOWTO: Chapter 25: Algorithms</title>
+ <title>libstdc++ HOWTO: Chapter 25: Algorithms</title>
<link rel="StyleSheet" href="../lib3styles.css" type="text/css" />
<link rel="Start" href="../documentation.html" type="text/html"
title="GNU C++ Standard Library" />
<meta name="KEYWORDS" content="HOWTO, libstdc++, GCC, g++, libg++, STL" />
<meta name="DESCRIPTION" content="HOWTO for the libstdc++ chapter 26." />
<meta name="GENERATOR" content="vi and eight fingers" />
- <title>libstdc++-v3 HOWTO: Chapter 26: Numerics</title>
+ <title>libstdc++ HOWTO: Chapter 26: Numerics</title>
<link rel="StyleSheet" href="../lib3styles.css" type="text/css" />
<link rel="Start" href="../documentation.html" type="text/html"
title="GNU C++ Standard Library" />
<hr />
<h2><a name="4">C99</a></h2>
<p>In addition to the other topics on this page, we'll note here some
- of the C99 features that appear in libstdc++-v3.
+ of the C99 features that appear in libstdc++.
</p>
<p>The C99 features depend on the <code>--enable-c99</code> configure flag.
This flag is already on by default, but it can be disabled by the
<meta name="KEYWORDS" content="HOWTO, libstdc++, GCC, g++, libg++, STL" />
<meta name="DESCRIPTION" content="HOWTO for the libstdc++ chapter 27." />
<meta name="GENERATOR" content="vi and eight fingers" />
- <title>libstdc++-v3 HOWTO: Chapter 27: Input/Output</title>
+ <title>libstdc++ HOWTO: Chapter 27: Input/Output</title>
<link rel="StyleSheet" href="../lib3styles.css" type="text/css" />
<link rel="Start" href="../documentation.html" type="text/html"
title="GNU C++ Standard Library" />
<p>The special steps taken by libstdc++, at least for version 3.0,
involve doing very little buffering for the standard streams, leaving
most of the buffering to the underlying C library. (This kind of
- thing is <a href="../explanations.html#cstdio">tricky to get right</a>.)
+ thing is tricky to get right.)
The upside is that correctness is ensured. The downside is that
writing through <code>cout</code> can quite easily lead to awful
performance when the C++ I/O library is layered on top of the C I/O
<p>This gets a bit tricky. Please read carefully, and bear with me.
</p>
<h3>Structure</h3>
- <p>As described <a href="../explanations.html#cstdio">here</a>, a wrapper
+ <p>A wrapper
type called <code>__basic_file</code> provides our abstraction layer
for the <code>std::filebuf</code> classes. Nearly all decisions dealing
with actual input and output must be made in <code>__basic_file</code>.
like any other critical shared resource.
</p>
<h3>The future</h3>
- <p>As already mentioned <a href="../explanations.html#cstdio">here</a>, a
- second choice is available for I/O implementations: libio. This is
+ <p> A
+ second choice may be available for I/O implementations: libio. This is
disabled by default, and in fact will not currently work due to other
issues. It will be revisited, however.
</p>
<p>The v2 library included non-standard extensions to construct
<code>std::filebuf</code>s from C stdio types such as
<code>FILE*</code>s and POSIX file descriptors.
- Today the recommended way to use stdio types with libstdc++-v3
+ Today the recommended way to use stdio types with libstdc++
IOStreams is via the <code>stdio_filebuf</code> class (see below),
but earlier releases provided slightly different mechanisms.
</p>
+++ /dev/null
-
-PWD_COMMAND=$${PWDCMD-pwd}
-MAKEINFO=makeinfo
-INC=../../../gcc/doc/include
-
-all: documentation.html \
- faq/index.txt \
- 17_intro/confdeps.png \
- 17_intro/porting.html \
- 17_intro/porting-howto.html
-
-# chock full of GNUism, probably
-documentation.html: $(wildcard */howto.html)
- sed -n '1,/beginlist/p' $@ > tmp.top
- sed -n '/endlist/,$$p' $@ > tmp.bottom
- echo ' <ul>' > tmp.middle
- for i in [0-9]*/howto.html; do \
- title=`grep 'h1 ' $$i |\
- sed 's=.*\(Chapter [[:digit:]]*\):[[:space:]]*\(.*\)</a>.*=\2 (\1)='` ;\
- awk -v file=$$i -v "title=$$title" -f makedoc.awk $$i >> tmp.middle ;\
- done
- awk -v file=ext/howto.html -v "title=Extensions to the Standard Library"\
- -f makedoc.awk ext/howto.html >> tmp.middle ;\
- echo ' </ul>' >> tmp.middle
- cat tmp.top tmp.middle tmp.bottom > $@
- rm tmp.top tmp.middle tmp.bottom
-
-faq/index.txt: faq/index.html
- lynx -dump $< | sed "s%file://localhost`${PWD_COMMAND}`%..%" > $@
-
-17_intro/porting.html: 17_intro/porting.texi
- ${MAKEINFO} -I ${INC} --html --no-split $< -o $@
-
-17_intro/confdeps.png: 17_intro/confdeps.dot
- dot -Tpng -o $@ $<
-
-# vim:noet ts=4
+++ /dev/null
-<?xml version="1.0" encoding="ISO-8859-1"?>
-<!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" xml:lang="en" lang="en">
-<head>
- <meta name="AUTHOR" content="bkoz@gcc.gnu.org (Benjamin Kosnik)" />
- <meta name="KEYWORDS" content="C++, libstdc++, dynamic, shared, library, ABI, version" />
- <meta name="DESCRIPTION" content="C++ Standard Library ABI" />
- <meta name="GENERATOR" content="emacs and ten fingers" />
- <title>Standard C++ Library ABI</title>
-<link rel="StyleSheet" href="lib3styles.css" type="text/css" />
-<link rel="Start" href="documentation.html" type="text/html"
- title="GNU C++ Standard Library" />
-<link rel="Copyright" href="17_intro/license.html" type="text/html" />
-</head>
-<body>
-
-<h1 class="centered"><a name="top">C++ Standard Library ABI</a></h1>
-
-<p class="fineprint"><em>
- The latest version of this document is always available at
- <a href="http://gcc.gnu.org/onlinedocs/libstdc++/abi.html">
- http://gcc.gnu.org/onlinedocs/libstdc++/abi.html</a>.
-</em></p>
-
-<p><em>
- To the <a href="http://gcc.gnu.org/libstdc++/">libstdc++-v3 homepage</a>.
-</em></p>
-
-<!-- ####################################################### -->
-<hr />
-<h3 class="left">
- <a name="CXXinterface">The C++ interface</a>
-</h3>
-
-<p> C++ applications often dependent on specific language support
-routines, say for throwing exceptions, or catching exceptions, and
-perhaps also dependent on features in the C++ Standard Library.
-</p>
-
-<p> The C++ Standard Library has many include files, types defined in
-those include files, specific named functions, and other behavior. The
-text of these behaviors, as written in source include files, is called
-the Application Programing Interface, or API.
-</p>
-
-<p> Furthermore, C++ source that is compiled into object files is
- transformed by the compiler: it arranges objects with specific
- alignment and in a particular layout, mangling names according to a
- well-defined algorithm, has specific arrangements for the support of
- virtual functions, etc. These details are defined as the compiler
- Application Binary Interface, or ABI. The GNU C++ compiler uses an
- industry-standard C++ ABI starting with version 3. Details can be
- found in the <a href="http://www.codesourcery.com/cxx-abi/abi.html">
- ABI specification</a>.
-</p>
-
-<p>
- The GNU C++ compiler, g++, has a compiler command line option to
- switch between various different C++ ABIs. This explicit version
- switch is the flag <code> -fabi-version</code>. In addition, some
- g++ command line options may change the ABI as a side-effect of
- use. Such flags include <code>-fpack-struct</code> and
- <code>-fno-exceptions</code>, but include others: see the complete
- list in the GCC manual under the heading <a
- href="http://gcc.gnu.org/onlinedocs/gcc/Code-Gen-Options.html#Code%20Gen%20Options">Options
- for Code Generation Conventions</a>.
-</p>
-
-<p> The configure options used when building a specific libstdc++
-version may also impact the resulting library ABI. The available
-configure options, and their impact on the library ABI, are documented
-<a href="http://gcc.gnu.org/onlinedocs/libstdc++/configopts.html">
-here</a>.
-</p>
-
-<p> Putting all of these ideas together results in the C++ Standard
-library ABI, which is the compilation of a given library API by a
-given compiler ABI. In a nutshell:
-</p>
-
-<code> library API + compiler ABI = library ABI</code>
-
-<p>
- The library ABI is mostly of interest for end-users who have
- unresolved symbols and are linking dynamically to the C++ Standard
- library, and who thus must be careful to compile their application
- with a compiler that is compatible with the available C++ Standard
- library binary. In this case, compatible is defined with the equation
- above: given an application compiled with a given compiler ABI and
- library API, it will work correctly with a Standard C++ Library
- 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>
-
-<h3 class="left">
- <a name="ABI_versioning">Versioning</a>
-</h3>
-
-<p> The C++ interface has evolved throughout the history of the GNU
-C++ toolchain. With each release, various details have been changed so
-as to give distinct versions to the C++ interface.
-</p>
-
-<h5 class="left">
- <a name="goals">Goals of versioning</a>
-</h5>
-
-<p>Extending existing, stable ABIs. Versioning gives subsequent stable
-releases series libraries the ability to add new symbols and add
-functionality, all the while retaining backwards compatibility with
-the previous releases in the series. Note: the reverse is not true. It
-is not possible to take binaries linked with the latest version of a
-release series (if symbols have been added) and expect the initial
-release of the series to remain link compatible.
-</p>
-
-<p>Allows multiple, incompatible ABIs to coexist at the same time.
-</p>
-
-<p>
-</p>
-
-<h5 class="left">
- <a name="details"> Version History </a>
-</h5>
-<p>
- How can this complexity be managed? What does C++ versioning mean?
- Because library and compiler changes often make binaries compiled
- with one version of the GNU tools incompatible with binaries
- compiled with other (either newer or older) versions of the same GNU
- tools, specific techniques are used to make managing this complexity
- easier.
-</p>
-
-<p>
- The following techniques are used:
-</p>
-
- <ul>
-
- <li> <p>Release versioning on the libgcc_s.so binary. This is
-implemented via file names and the ELF DT_SONAME mechanism (at least
-on ELF systems).</p>
-
- <p>It is versioned as follows:
- </p>
- <ul>
- <li>gcc-3.0.0: libgcc_s.so.1</li>
- <li>gcc-3.0.1: libgcc_s.so.1</li>
- <li>gcc-3.0.2: libgcc_s.so.1</li>
- <li>gcc-3.0.3: libgcc_s.so.1</li>
- <li>gcc-3.0.4: libgcc_s.so.1</li>
- <li>gcc-3.1.0: libgcc_s.so.1</li>
- <li>gcc-3.1.1: libgcc_s.so.1</li>
- <li>gcc-3.2.0: libgcc_s.so.1</li>
- <li>gcc-3.2.1: libgcc_s.so.1</li>
- <li>gcc-3.2.2: libgcc_s.so.1</li>
- <li>gcc-3.2.3: libgcc_s.so.1</li>
- <li>gcc-3.3.0: libgcc_s.so.1</li>
- <li>gcc-3.3.1: libgcc_s.so.1</li>
- <li>gcc-3.3.2: libgcc_s.so.1</li>
- <li>gcc-3.3.3: libgcc_s.so.1</li>
- <li>gcc-3.4.x, gcc-4.0.x, gcc-4.1.x, gcc-4.2.x: on m68k-linux and
- hppa-linux this is either libgcc_s.so.1 (when configuring
- <code>--with-sjlj-exceptions</code>) or libgcc_s.so.2. For all
- others, this is libgcc_s.so.1. </li> </ul>
- <p></p>
- </li>
-
- <li>Symbol versioning on the libgcc_s.so binary.
- <p>mapfile: gcc/libgcc-std.ver</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>
- <ul>
- <li>gcc-3.0.0: GCC_3.0</li>
- <li>gcc-3.3.0: GCC_3.3</li>
- <li>gcc-3.3.1: GCC_3.3.1</li>
- <li>gcc-3.3.2: GCC_3.3.2</li>
- <li>gcc-3.3.4: GCC_3.3.4</li>
- <li>gcc-3.4.0: GCC_3.4</li>
- <li>gcc-3.4.2: GCC_3.4.2</li>
- <li>gcc-3.4.4: GCC_3.4.4</li>
- <li>gcc-4.0.0: GCC_4.0.0</li>
- <li>gcc-4.1.0: GCC_4.1.0</li>
- <li>gcc-4.2.0: GCC_4.2.0</li>
- </ul>
- <p></p>
- </li>
-
- <li>Release versioning on the libstdc++.so binary, implemented in the same was as the libgcc_s.so binary, above.
-
- <p>It is versioned as follows:
- </p>
- <ul>
- <li>gcc-3.0.0: libstdc++.so.3.0.0</li>
- <li>gcc-3.0.1: libstdc++.so.3.0.1</li>
- <li>gcc-3.0.2: libstdc++.so.3.0.2</li>
- <li>gcc-3.0.3: libstdc++.so.3.0.2 (Error should be libstdc++.so.3.0.3)</li>
- <li>gcc-3.0.4: libstdc++.so.3.0.4</li>
- <li>gcc-3.1.0: libstdc++.so.4.0.0</li>
- <li>gcc-3.1.1: libstdc++.so.4.0.1</li>
- <li>gcc-3.2.0: libstdc++.so.5.0.0</li>
- <li>gcc-3.2.1: libstdc++.so.5.0.1</li>
- <li>gcc-3.2.2: libstdc++.so.5.0.2</li>
- <li>gcc-3.2.3: libstdc++.so.5.0.3 (Not strictly required)</li>
- <li>gcc-3.3.0: libstdc++.so.5.0.4</li>
- <li>gcc-3.3.1: libstdc++.so.5.0.5</li>
- <li>gcc-3.3.2: libstdc++.so.5.0.5</li>
- <li>gcc-3.3.3: libstdc++.so.5.0.5</li>
- <li>gcc-3.4.0: libstdc++.so.6.0.0</li>
- <li>gcc-3.4.1: libstdc++.so.6.0.1</li>
- <li>gcc-3.4.2: libstdc++.so.6.0.2</li>
- <li>gcc-3.4.3: libstdc++.so.6.0.3</li>
- <li>gcc-3.4.4: libstdc++.so.6.0.3</li>
- <li>gcc-3.4.5: libstdc++.so.6.0.3</li>
- <li>gcc-3.4.6: libstdc++.so.6.0.3</li>
- <li>gcc-4.0.0: libstdc++.so.6.0.4</li>
- <li>gcc-4.0.1: libstdc++.so.6.0.5</li>
- <li>gcc-4.0.2: libstdc++.so.6.0.6</li>
- <li>gcc-4.0.3: libstdc++.so.6.0.7</li>
- <li>gcc-4.1.0: libstdc++.so.6.0.7</li>
- <li>gcc-4.1.1: libstdc++.so.6.0.8</li>
- <li>gcc-4.1.2: libstdc++.so.6.0.8</li>
- <li>gcc-4.2.0: libstdc++.so.6.0.9</li>
- </ul>
- <p></p>
- </li>
-
- <li>Symbol versioning on the libstdc++.so binary.
-
- <p>mapfile: libstdc++-v3/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
- particular release. Note, only symbol which are newly introduced
- will use the maximum version definition. Thus, for release series
- with the same label, but incremented version definitions, the later
- release has both versions. (An example of this would be the
- 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>
- <ul>
- <li>gcc-3.0.0: (Error, not versioned)</li>
- <li>gcc-3.0.1: (Error, not versioned)</li>
- <li>gcc-3.0.2: (Error, not versioned)</li>
- <li>gcc-3.0.3: (Error, not versioned)</li>
- <li>gcc-3.0.4: (Error, not versioned)</li>
- <li>gcc-3.1.0: GLIBCPP_3.1, CXXABI_1</li>
- <li>gcc-3.1.1: GLIBCPP_3.1, CXXABI_1</li>
- <li>gcc-3.2.0: GLIBCPP_3.2, CXXABI_1.2</li>
- <li>gcc-3.2.1: GLIBCPP_3.2.1, CXXABI_1.2</li>
- <li>gcc-3.2.2: GLIBCPP_3.2.2, CXXABI_1.2</li>
- <li>gcc-3.2.3: GLIBCPP_3.2.2, CXXABI_1.2</li>
- <li>gcc-3.3.0: GLIBCPP_3.2.2, CXXABI_1.2.1</li>
- <li>gcc-3.3.1: GLIBCPP_3.2.3, CXXABI_1.2.1</li>
- <li>gcc-3.3.2: GLIBCPP_3.2.3, CXXABI_1.2.1</li>
- <li>gcc-3.3.3: GLIBCPP_3.2.3, CXXABI_1.2.1</li>
- <li>gcc-3.4.0: GLIBCXX_3.4, CXXABI_1.3</li>
- <li>gcc-3.4.1: GLIBCXX_3.4.1, CXXABI_1.3</li>
- <li>gcc-3.4.2: GLIBCXX_3.4.2</li>
- <li>gcc-3.4.3: GLIBCXX_3.4.3</li>
- <li>gcc-4.0.0: GLIBCXX_3.4.4, CXXABI_1.3.1</li>
- <li>gcc-4.0.1: GLIBCXX_3.4.5</li>
- <li>gcc-4.0.2: GLIBCXX_3.4.6</li>
- <li>gcc-4.0.3: GLIBCXX_3.4.7</li>
- <li>gcc-4.1.1: GLIBCXX_3.4.8</li>
- <li>gcc-4.2.0: GLIBCXX_3.4.9</li>
- </ul>
- <p></p>
- </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
- be automatically defined whenever g++ is used (the curious can
- test this by invoking g++ with the '-v' flag.)
- </p>
-
- <p>
- This macro was defined in the file "lang-specs.h" in the gcc/cp directory.
- Later versions defined it in "c-common.c" in the gcc directory, and from
- G++ 3.4 it is defined in c-cppbuiltin.c and its value determined by the
- '-fabi-version' command line option.
- </p>
-
- <p>
- It is versioned as follows, where 'n' is given by '-fabi-version=n':
- </p>
- <ul>
- <li>gcc-3.0.x: 100</li>
- <li>gcc-3.1.x: 100 (Error, should be 101)</li>
- <li>gcc-3.2.x: 102</li>
- <li>gcc-3.3.x: 102</li>
- <li>gcc-3.4.x, gcc-4.0.x, gcc-4.1.x, gcc-4.2.x: 102 (when n=1)</li>
- <li>gcc-3.4.x, gcc-4.0.x, gcc-4.1.x, gcc-4.2.x: 1000 + n (when n>1)</li>
- <li>gcc-3.4.x, gcc-4.0.x, gcc-4.1.x, gcc-4.2.x: 999999 (when n=0)</li>
- </ul>
- <p></p>
- </li>
-
- <li>
- <p>Changes to the default compiler option for
- <code>-fabi-version</code>.
- </p>
- <p>
- It is versioned as follows:
- </p>
- <ul>
- <li>gcc-3.0.x: (Error, not versioned) </li>
- <li>gcc-3.1.x: (Error, not versioned) </li>
- <li>gcc-3.2.x: <code>-fabi-version=1</code></li>
- <li>gcc-3.3.x: <code>-fabi-version=1</code></li>
- <li>gcc-3.4.x, gcc-4.0.x, gcc-4.1.x, gcc-4.2.x: <code>-fabi-version=2</code></li>
- </ul>
- <p></p>
- </li>
-
- <li>
- <p>Incremental bumping of a library pre-defined macro. For releases
- before 3.4.0, the macro is __GLIBCPP__. For later releases, it's
- __GLIBCXX__. (The libstdc++ project generously changed from CPP to
- CXX throughout its source to allow the "C" pre-processor the CPP
- macro namespace.) These macros are defined as the date the library
- was released, in compressed ISO date format, as an unsigned long.
- </p>
-
- <p>
- This macro is defined in the file "c++config" in the
- "libstdc++-v3/include/bits" directory. (Up to gcc-4.1.0, it was
- changed every night by an automated script. Since gcc-4.1.0, it is
- the same value as gcc/DATESTAMP.)
- </p>
- <p>
- It is versioned as follows:
- </p>
- <ul>
- <li>gcc-3.0.0: 20010615</li>
- <li>gcc-3.0.1: 20010819</li>
- <li>gcc-3.0.2: 20011023</li>
- <li>gcc-3.0.3: 20011220</li>
- <li>gcc-3.0.4: 20020220</li>
- <li>gcc-3.1.0: 20020514</li>
- <li>gcc-3.1.1: 20020725</li>
- <li>gcc-3.2.0: 20020814</li>
- <li>gcc-3.2.1: 20021119</li>
- <li>gcc-3.2.2: 20030205</li>
- <li>gcc-3.2.3: 20030422</li>
- <li>gcc-3.3.0: 20030513</li>
- <li>gcc-3.3.1: 20030804</li>
- <li>gcc-3.3.2: 20031016</li>
- <li>gcc-3.3.3: 20040214</li>
- <li>gcc-3.4.0: 20040419</li>
- <li>gcc-3.4.1: 20040701</li>
- <li>gcc-3.4.2: 20040906</li>
- <li>gcc-3.4.3: 20041105</li>
- <li>gcc-3.4.4: 20050519</li>
- <li>gcc-3.4.5: 20051201</li>
- <li>gcc-3.4.6: 20060306</li>
- <li>gcc-4.0.0: 20050421</li>
- <li>gcc-4.0.1: 20050707</li>
- <li>gcc-4.0.2: 20050921</li>
- <li>gcc-4.0.3: 20060309</li>
- <li>gcc-4.1.0: 20060228</li>
- <li>gcc-4.1.1: 20060524</li>
- <li>gcc-4.1.2: 20070214</li>
- <li>gcc-4.2.0: 20070514</li>
- </ul>
- <p></p>
- </li>
-
- <li>
- <p>
- Incremental bumping of a library pre-defined macro,
- _GLIBCPP_VERSION. This macro is defined as the released version of
- the library, as a string literal. This is only implemented in
- gcc-3.1.0 releases and higher, and is deprecated in 3.4 (where it
- is called _GLIBCXX_VERSION).
- </p>
-
- <p>
- This macro is defined in the file "c++config" in the
- "libstdc++-v3/include/bits" directory and is generated
- automatically by autoconf as part of the configure-time generation
- of config.h.
- </p>
-
- <p>
- It is versioned as follows:
- </p>
- <ul>
- <li>gcc-3.0.0: "3.0.0"</li>
- <li>gcc-3.0.1: "3.0.0" (Error, should be "3.0.1")</li>
- <li>gcc-3.0.2: "3.0.0" (Error, should be "3.0.2")</li>
- <li>gcc-3.0.3: "3.0.0" (Error, should be "3.0.3")</li>
- <li>gcc-3.0.4: "3.0.0" (Error, should be "3.0.4")</li>
- <li>gcc-3.1.0: "3.1.0"</li>
- <li>gcc-3.1.1: "3.1.1"</li>
- <li>gcc-3.2.0: "3.2"</li>
- <li>gcc-3.2.1: "3.2.1"</li>
- <li>gcc-3.2.2: "3.2.2"</li>
- <li>gcc-3.2.3: "3.2.3"</li>
- <li>gcc-3.3.0: "3.3"</li>
- <li>gcc-3.3.1: "3.3.1"</li>
- <li>gcc-3.3.2: "3.3.2"</li>
- <li>gcc-3.3.3: "3.3.3"</li>
- <li>gcc-3.4.x: "version-unused"</li>
- <li>gcc-4.0.x: "version-unused"</li>
- <li>gcc-4.1.x: "version-unused"</li>
- <li>gcc-4.2.x: "version-unused"</li>
- </ul>
- <p></p>
- </li>
-
- <li>
- <p>
- Matching each specific C++ compiler release to a specific set of
- C++ include files. This is only implemented in gcc-3.1.1 releases
- and higher.
- </p>
- <p>
- All C++ includes are installed in include/c++, then nest in a
- directory hierarchy corresponding to the C++ compiler's released
- version. This version corresponds to the variable "gcc_version" in
- "libstdc++-v3/acinclude.m4," and more details can be found in that
- file's macro GLIBCXX_CONFIGURE (GLIBCPP_CONFIGURE before gcc-3.4.0).
- </p>
- <p>
- C++ includes are versioned as follows:
- </p>
- <ul>
- <li>gcc-3.0.0: include/g++-v3</li>
- <li>gcc-3.0.1: include/g++-v3</li>
- <li>gcc-3.0.2: include/g++-v3</li>
- <li>gcc-3.0.3: include/g++-v3</li>
- <li>gcc-3.0.4: include/g++-v3</li>
- <li>gcc-3.1.0: include/g++-v3</li>
- <li>gcc-3.1.1: include/c++/3.1.1</li>
- <li>gcc-3.2.0: include/c++/3.2</li>
- <li>gcc-3.2.1: include/c++/3.2.1</li>
- <li>gcc-3.2.2: include/c++/3.2.2</li>
- <li>gcc-3.2.3: include/c++/3.2.3</li>
- <li>gcc-3.3.0: include/c++/3.3</li>
- <li>gcc-3.3.1: include/c++/3.3.1</li>
- <li>gcc-3.3.2: include/c++/3.3.2</li>
- <li>gcc-3.3.3: include/c++/3.3.3</li>
- <li>gcc-3.4.0: include/c++/3.4.0</li>
- <li>gcc-3.4.1: include/c++/3.4.1</li>
- <li>gcc-3.4.2: include/c++/3.4.2</li>
- <li>gcc-3.4.3: include/c++/3.4.3</li>
- <li>gcc-3.4.4: include/c++/3.4.4</li>
- <li>gcc-3.4.5: include/c++/3.4.5</li>
- <li>gcc-3.4.6: include/c++/3.4.6</li>
- <li>gcc-4.0.0: include/c++/4.0.0</li>
- <li>gcc-4.0.1: include/c++/4.0.1</li>
- <li>gcc-4.0.2: include/c++/4.0.2</li>
- <li>gcc-4.0.3: include/c++/4.0.3</li>
- <li>gcc-4.1.0: include/c++/4.1.0</li>
- <li>gcc-4.1.1: include/c++/4.1.1</li>
- <li>gcc-4.1.2: include/c++/4.1.2</li>
- <li>gcc-4.2.0: include/c++/4.2.0</li>
- </ul>
- <p></p>
- </li>
- </ul>
-<p>
- Taken together, these techniques can accurately specify interface
- and implementation changes in the GNU C++ tools themselves. Used
- properly, they allow both the GNU C++ tools implementation, and
- programs using them, an evolving yet controlled development that
- maintains backward compatibility.
-</p>
-
-
-
-<h5 class="left">
- <a name="requirements"> Minimum requirements for a versioned ABI </a>
-</h5>
-<p>
- Minimum environment that supports a versioned ABI: A supported
- dynamic linker, a GNU linker of sufficient vintage to understand
- demangled C++ name globbing (ld), a shared executable compiled with
- g++, and shared libraries (libgcc_s, libstdc++-v3) compiled by a
- compiler (g++) with a compatible ABI. Phew.
-</p>
-
-<p>
- On top of all that, an additional constraint: libstdc++ did not
- attempt to version symbols (or age gracefully, really) until version
- 3.1.0.
-</p>
-
-<p>
- Most modern Linux and BSD versions, particularly ones using
- gcc-3.1.x tools and more recent vintages, will meet the requirements above.
-</p>
-
-
-<h5 class="left">
- <a name="config"> What configure options impact symbol versioning? </a>
-</h5>
-<p>
- It turns out that most of the configure options that change default
- behavior will impact the mangled names of exported symbols, and thus
- impact versioning and compatibility.
-</p>
-
-<p>
- For more information on configure options, including ABI impacts, see:
- http://gcc.gnu.org/onlinedocs/libstdc++/configopts.html
-</p>
-
-<p>
- There is one flag that explicitly deals with symbol versioning:
- --enable-symvers.
-</p>
-
-<p>
- In particular, libstdc++-v3/acinclude.m4 has a macro called
- GLIBCXX_ENABLE_SYMVERS that defaults to yes (or the argument passed
- in via --enable-symvers=foo). At that point, the macro attempts to
- make sure that all the requirement for symbol versioning are in
- place. For more information, please consult acinclude.m4.
-</p>
-
-
-<h5 class="left">
- <a name="active"> How to tell if symbol versioning is, indeed, active? </a>
-</h5>
-<p>
- When the GNU C++ library is being built with symbol versioning on,
- you should see the following at configure time for libstdc++-v3:
-</p>
-
-
-<code> checking versioning on shared library symbols... gnu</code>
-
-<p>
- If you don't see this line in the configure output, or if this line
- appears but the last word is 'no', then you are out of luck.
-</p>
-
-<p>
- If the compiler is pre-installed, a quick way to test is to compile
- the following (or any) simple C++ file and link it to the shared
- libstdc++ library:
-</p>
-
-<pre>
-#include <iostream>
-
-int main()
-{ std::cout << "hello" << std::endl; return 0; }
-
-%g++ hello.cc -o hello.out
-
-%ldd hello.out
- libstdc++.so.5 => /usr/lib/libstdc++.so.5 (0x00764000)
- libm.so.6 => /lib/tls/libm.so.6 (0x004a8000)
- libgcc_s.so.1 => /mnt/hd/bld/gcc/gcc/libgcc_s.so.1 (0x40016000)
- libc.so.6 => /lib/tls/libc.so.6 (0x0036d000)
- /lib/ld-linux.so.2 => /lib/ld-linux.so.2 (0x00355000)
-
-%nm hello.out
-</pre>
-
-<p>
-If you see symbols in the resulting output with "GLIBCXX_3" as part
-of the name, then the executable is versioned. Here's an example:
-</p>
-
- <code> U _ZNSt8ios_base4InitC1Ev@@GLIBCXX_3.4 </code>
-
-<h3 class="left">
- <a name="ABI_allowed">Library allowed ABI changes</a>
-</h3>
-<p>
-The following will cause the library minor version number to
-increase, say from "libstdc++.so.3.0.4" to "libstdc++.so.3.0.5".
-</p>
-<ul>
- <li>adding an exported global or static data member</li>
- <li>adding an exported function, static or non-virtual member function</li>
- <li>adding an exported symbol or symbols by additional instantiations</li>
-</ul>
-<p>
-</p>
-<p>
-Other allowed changes are possible.
-</p>
-
-
-<h3 class="left">
- <a name="ABI_disallowed">Library disallowed ABI changes</a>
-</h3>
-
-<p>
-The following non-exhaustive list will cause the library major version
-number to increase, say from "libstdc++.so.3.0.4" to
-"libstdc++.so.4.0.0".
-</p>
-<ul>
- <li>changes in the gcc/g++ compiler ABI</li>
-<li>changing size of an exported symbol</li>
-<li>changing alignment of an exported symbol</li>
-<li>changing the layout of an exported symbol</li>
-<li>changing mangling on an exported symbol</li>
-<li>deleting an exported symbol</li>
-<li>changing the inheritance properties of a type by adding or removing
- base classes</li>
-<li>
- changing the size, alignment, or layout of types
- specified in the C++ standard. These may not necessarily be
- instantiated or otherwise exported in the library binary, and
- include all the required locale facets, as well as things like
- std::basic_streambuf, et al.
-</li>
-
-<li> adding an explicit copy constructor or destructor to a
-class that would otherwise have implicit versions. This will change
-the way the compiler deals with this class in by-value return
-statements or parameters: instead of being passing instances of this
-class in registers, the compiler will be forced to use memory. See <a
-href="http://www.codesourcery.com/cxx-abi/abi.html#calls"> this part</a>
- of the C++ ABI documentation for further details.
- </li>
-
-</ul>
-
-<h3 class="left">
- <a name="implementation">Library implementation strategy</a> </h3>
-
-<ul>
- <li>Separation of interface and implementation
-<p>This is accomplished by two techniques that separate the API from
-the ABI: forcing undefined references to link against a library binary
-for definitions.
-</p>
-
- <dl>
- <dt>Include files have declarations, source files have defines</dt>
-
- <dd> For non-templatized types, such as much of <code>class
- locale</code>, the appropriate standard C++ include, say
- <code>locale</code>, can contain full declarations, while various
- source files (say <code> locale.cc, locale_init.cc,
- localename.cc</code>) contain definitions.</dd>
-
- <dt>Extern template on required types</dt>
-
- <dd>For parts of the standard that have an explicit list of required
- instantiations, the GNU extension syntax <code> extern template
- </code> can be used to control where template definitions
- reside. By marking required instantiations as <code> extern
- template </code> in include files, and providing explicit
- instantiations in the appropriate instantiation files, non-inlined
- template functions can be versioned. This technique is mostly used
- on parts of the standard that require <code> char</code> and <code>
- wchar_t</code> instantiations, and includes <code>
- basic_string</code>, the locale facets, and the types in <code>
- iostreams</code>.</dd>
-
- </dl>
- <p> In addition, these techniques have the additional benefit that
- they reduce binary size, which can increase runtime performance.
- </p>
- </li>
-
- <li>Namespaces linking symbol definitions to export mapfiles
-
-<p>All symbols in the shared library binary are processed by a linker
-script at build time that either allows or disallows external
-linkage. Because of this, some symbols, regardless of normal C/C++
-linkage, are not visible. Symbols that are internal have several
-appealing characteristics: by not exporting the symbols, there are no
-relocations when the shared library is started and thus this makes for
-faster runtime loading performance by the underlying dynamic loading
-mechanism. In addition, they have the possibility of changing without
-impacting ABI compatibility.
-</p>
-
-<p>The following namespaces are transformed by the mapfile:</p>
-
-<dl>
-<dt><code>namespace std</code></dt>
-<dd> 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.</dd>
-
-<dt><code>namespace __gnu_cxx</code></dt>
-<dd> Defaults to not exporting any symbols in label
-<code>GLIBCXX</code>, select items are allowed to be visible.</dd>
-
-<dt><code>namespace __gnu_internal</code></dt>
-<dd> Defaults to not exported, no items are allowed to be visible.</dd>
-
-<dt><code>namespace __cxxabiv1</code>, aliased to <code> namespace abi</code></dt>
-<dd> Defaults to not exporting any symbols in label
-<code>CXXABI</code>, select items are allowed to be visible.</dd>
-</dl>
-<p>
-</p>
-</li>
-
- <li>Freezing the API
- <p>Disallowed changes, as above, are not made on a stable release
-branch. Enforcement tends to be less strict with GNU extensions that
-standard includes.</p>
-</li>
-</ul>
-
-<h3 class="left">
- <a name="ABI_testing">Testing ABI changes</a>
-</h3>
-
-<p>
-Testing for GNU C++ ABI changes is composed of two distinct areas:
-testing the C++ compiler (g++) for compiler changes, and testing the
-C++ library (libstdc++) for library changes.
-</p>
-
-<p>
-Testing the C++ compiler ABI can be done various ways.
-</p>
-
-<p>
-One.
-Intel ABI checker. More information can be obtained
-<a href="http://developer.intel.com/software/products/opensource/">here.</a>
-</p>
-
-<p>
-Two.
-The second is yet unreleased, but has been announced on the gcc
-mailing list. It is yet unspecified if these tools will be freely
-available, and able to be included in a GNU project. Please contact
-Mark Mitchell (mark@codesourcery.com) for more details, and current
-status.
-</p>
-
-<p>
-Three.
-Involves using the vlad.consistency test framework. This has also been
-discussed on the gcc mailing lists.
-</p>
-
-<p>
-Testing the C++ library ABI can also be done various ways.
-</p>
-
-<p>
-One.
-(Brendan Kehoe, Jeff Law suggestion to run 'make check-c++' two ways,
-one with a new compiler and an old library, and the other with an old
-compiler and a new library, and look for testsuite regressions)
-</p>
-
-<p>
-Details on how to set this kind of test up can be found here:
-http://gcc.gnu.org/ml/gcc/2002-08/msg00142.html
-</p>
-
-<p>
-Two.
-Use the 'make check-abi' rule in the libstdc++-v3 Makefile.
-</p>
-
-<p>
-This is a proactive check the library ABI. Currently, exported symbol
-names that are either weak or defined are checked against a last known
-good baseline. Currently, this baseline is keyed off of 3.4.0
-binaries, as this was the last time the .so number was incremented. In
-addition, all exported names are demangled, and the exported objects
-are checked to make sure they are the same size as the same object in
-the baseline.
-
-Notice that each baseline is relative to a <strong>default</strong>
-configured library and compiler: in particular, if options such as
---enable-clocale, or --with-cpu, in case of multilibs, are used at
-configure time, the check may fail, either because of substantive
-differences or because of limitations of the current checking
-machinery.
-</p>
-
-<p>
-This dataset is insufficient, yet a start. Also needed is a
-comprehensive check for all user-visible types part of the standard
-library for sizeof() and alignof() changes.
-</p>
-
-<p>
-Verifying compatible layouts of objects is not even attempted. It
-should be possible to use sizeof, alignof, and offsetof to compute
-offsets for each structure and type in the standard library, saving to
-another datafile. Then, compute this in a similar way for new
-binaries, and look for differences.
-</p>
-
-<p>
-Another approach might be to use the -fdump-class-hierarchy flag to
-get information. However, currently this approach gives insufficient
-data for use in library testing, as class data members, their offsets,
-and other detailed data is not displayed with this flag.
-(See g++/7470 on how this was used to find bugs.)
-</p>
-
-<p>
-Perhaps there are other C++ ABI checkers. If so, please notify
-us. We'd like to know about them!
-</p>
-
-<h3 class="left">
- <a name="ABI_multi_testing">Testing Multi-ABI binaries</a>
-</h3>
-
-<p>
-A "C" application, dynamically linked to two shared libraries, liba,
-libb. The dependent library liba is C++ shared library compiled with
-gcc-3.3.x, and uses io, exceptions, locale, etc. The dependent library
-libb is a C++ shared library compiled with gcc-3.4.x, and also uses io,
-exceptions, locale, etc.
-</p>
-
-<p> As above, libone is constructed as follows: </p>
-<pre>
-%$bld/H-x86-gcc-3.4.0/bin/g++ -fPIC -DPIC -c a.cc
-
-%$bld/H-x86-gcc-3.4.0/bin/g++ -shared -Wl,-soname -Wl,libone.so.1 -Wl,-O1 -Wl,-z,defs a.o -o libone.so.1.0.0
-
-%ln -s libone.so.1.0.0 libone.so
-
-%$bld/H-x86-gcc-3.4.0/bin/g++ -c a.cc
-
-%ar cru libone.a a.o
-</pre>
-
-<p> And, libtwo is constructed as follows: </p>
-
-<pre>
-%$bld/H-x86-gcc-3.3.3/bin/g++ -fPIC -DPIC -c b.cc
-
-%$bld/H-x86-gcc-3.3.3/bin/g++ -shared -Wl,-soname -Wl,libtwo.so.1 -Wl,-O1 -Wl,-z,defs b.o -o libtwo.so.1.0.0
-
-%ln -s libtwo.so.1.0.0 libtwo.so
-
-%$bld/H-x86-gcc-3.3.3/bin/g++ -c b.cc
-
-%ar cru libtwo.a b.o
-</pre>
-
-<p> ...with the resulting libraries looking like </p>
-<pre>
-%ldd libone.so.1.0.0
- libstdc++.so.6 => /usr/lib/libstdc++.so.6 (0x40016000)
- libm.so.6 => /lib/tls/libm.so.6 (0x400fa000)
- libgcc_s.so.1 => /mnt/hd/bld/gcc/gcc/libgcc_s.so.1 (0x4011c000)
- libc.so.6 => /lib/tls/libc.so.6 (0x40125000)
- /lib/ld-linux.so.2 => /lib/ld-linux.so.2 (0x00355000)
-
-%ldd libtwo.so.1.0.0
- libstdc++.so.5 => /usr/lib/libstdc++.so.5 (0x40027000)
- libm.so.6 => /lib/tls/libm.so.6 (0x400e1000)
- libgcc_s.so.1 => /mnt/hd/bld/gcc/gcc/libgcc_s.so.1 (0x40103000)
- libc.so.6 => /lib/tls/libc.so.6 (0x4010c000)
- /lib/ld-linux.so.2 => /lib/ld-linux.so.2 (0x00355000)
-
-</pre>
-
-<p> Then, the "C" compiler is used to compile a source file that uses
-functions from each library.</p>
-<pre>
-gcc test.c -g -O2 -L. -lone -ltwo /usr/lib/libstdc++.so.5 /usr/lib/libstdc++.so.6
-</pre>
-
-<p>
-Which gives the expected:
-</p>
-<pre>
-%ldd a.out
- libstdc++.so.5 => /usr/lib/libstdc++.so.5 (0x00764000)
- libstdc++.so.6 => /usr/lib/libstdc++.so.6 (0x40015000)
- libc.so.6 => /lib/tls/libc.so.6 (0x0036d000)
- libm.so.6 => /lib/tls/libm.so.6 (0x004a8000)
- libgcc_s.so.1 => /mnt/hd/bld/gcc/gcc/libgcc_s.so.1 (0x400e5000)
- /lib/ld-linux.so.2 => /lib/ld-linux.so.2 (0x00355000)
-</pre>
-
-<p>
-This resulting binary, when executed, will be able to safely use code
-from both liba, and the dependent libstdc++.so.6, and libb, with the
-dependent libstdc++.so.5.
-</p>
-
-
-<h3 class="left">
- <a name="Outstanding Issues">Outstanding Issues</a>
-</h3>
-
-<p> Some features in the C++ language make versioning especially
-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:</p>
-
-<p>
-<a href="http://gcc.gnu.org/PR24660">24660: versioning weak symbols in libstdc++</a>
-</p>
-
-<p>
-<a href="http://gcc.gnu.org/PR19664">19664: libstdc++ headers should have pop/push of the visibility around the declarations</a>
-</p>
-
-<h3 class="left">
- <a name="references">Bibliography / Further Reading</a>
-</h3>
-
-<p>
-ABIcheck, a vague idea of checking ABI compatibility
-<br />
-<a href="http://abicheck.sourceforge.net/">http://abicheck.sourceforge.net/</a>
-</p>
-
-<p>
-C++ ABI reference
-<br />
-<a href="http://www.codesourcery.com/cxx-abi/">http://www.codesourcery.com/cxx-abi/</a>
-</p>
-
-<p>
-Intel ABI documentation, "Intel® Compilers for Linux* -Compatibility with the GNU Compilers"
-<br />
-<a href="http://developer.intel.com/software/products/compilers/techtopics/LinuxCompilersCompatibility.htm">http://developer.intel.com/software/products/compilers/techtopics/LinuxCompilersCompatibility.htm</a>
-</p>
-
-<p>
-Sun Solaris 2.9 docs
-<br />
-Linker and Libraries Guide (document 816-1386)
-<br />
-C++ Migration Guide (document 816-2459)
-<br />
-<a href="http://docs.sun.com/db/prod/solaris.9">http://docs.sun.com/db/prod/solaris.9</a>
-<br />
-<a href="http://docs.sun.com/?p=/doc/816-1386&a=load">http://docs.sun.com/?p=/doc/816-1386&a=load</a>
-</p>
-
-<p>
-Ulrich Drepper, "ELF Symbol Versioning"
-<br />
-<a href="http://people.redhat.com/drepper/symbol-versioning">http://people.redhat.com/drepper/symbol-versioning</a>
-</p>
-
-<p>
-C++ ABI for the ARM Architecture
-<br />
-<a href="http://www.arm.com/miscPDFs/8033.pdf">http://www.arm.com/miscPDFs/8033.pdf</a>
-</p>
-
-<p>
-Benjamin Kosnik, ISO C++ J16/06-0046
-<br />
-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n1976.html">Dynamic Shared Objects: Survey and Issues</a>
-</p>
-
-<p>
-Benjamin Kosnik, ISO C++ J16/06-0083
-<br />
-<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2013.html">Versioning With Namespaces</a>
-</p>
-
-</body>
-</html>
-
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
<head>
<meta name="AUTHOR" content="pme@gcc.gnu.org (Phil Edwards)" />
- <meta name="KEYWORDS" content="libstdc++, libstdc++-v3, GCC, g++" />
- <meta name="DESCRIPTION" content="Configuration options for libstdc++-v3." />
+ <meta name="KEYWORDS" content="libstdc++, libstdc++, GCC, g++" />
+ <meta name="DESCRIPTION" content="Configuration options for libstdc++." />
<meta name="GENERATOR" content="vi and eight fingers" />
- <title>libstdc++-v3 configure options</title>
+ <title>libstdc++ configure options</title>
<link rel="StyleSheet" href="lib3styles.css" type="text/css" />
<link rel="Copyright" href="17_intro/license.html" type="text/html" />
</head>
</em></p>
<p><em>
- To the <a href="http://gcc.gnu.org/libstdc++/">libstdc++-v3 homepage</a>.
+ To the <a href="http://gcc.gnu.org/libstdc++/">libstdc++ homepage</a>.
</em></p>
<!-- ####################################################### -->
<dt><code>--enable-cstdio=OPTION </code></dt>
<dd><p>Select a target-specific I/O package. At the moment, the only
choice is to use 'stdio', a generic "C" abstraction.
- The default is 'stdio'. A longer explanation is <a
- href="explanations.html#cstdio">here</a>.
+ The default is 'stdio'.
</p>
</dd>
</em></p>
<p><em>
- To the <a href="http://gcc.gnu.org/libstdc++/">libstdc++-v3 homepage</a>.
+ To the <a href="http://gcc.gnu.org/libstdc++/">libstdc++ homepage</a>.
</em></p>
<!-- ####################################################### -->
+++ /dev/null
-<?xml version="1.0" encoding="ISO-8859-1"?>
-<!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" xml:lang="en" lang="en">
-<head>
- <meta name="AUTHOR" content="gregod@cs.rpi.edu (Doug Gregor)" />
- <meta name="KEYWORDS" content="C++, GCC, libstdc++, g++, debug" />
- <meta name="DESCRIPTION" content="Design of the libstdc++ debug mode." />
- <meta name="GENERATOR" content="vi and eight fingers" />
- <title>Design of the libstdc++ debug mode</title>
-<link rel="StyleSheet" href="lib3styles.css" />
-</head>
-<body>
-
-<h1 class="centered"><a name="top">Design of the libstdc++ debug mode</a></h1>
-
-<p class="fineprint"><em>
- The latest version of this document is always available at
- <a href="http://gcc.gnu.org/onlinedocs/libstdc++/debug_mode.html">
- http://gcc.gnu.org/onlinedocs/libstdc++/debug_mode.html</a>.
-</em></p>
-
-<p><em>
- To the <a href="http://gcc.gnu.org/libstdc++/">libstdc++-v3 homepage</a>.
-</em></p>
-
-
-<!-- ####################################################### -->
-
-<hr />
-<h1>Debug mode design</h1>
-<p> The libstdc++ debug mode replaces unsafe (but efficient) standard
- containers and iterators with semantically equivalent safe standard
- containers and iterators to aid in debugging user programs. The
- following goals directed the design of the libstdc++ debug mode:</p>
-
- <ul>
-
- <li><b>Correctness</b>: the libstdc++ debug mode must not change
- the semantics of the standard library for all cases specified in
- the ANSI/ISO C++ standard. The essence of this constraint is that
- any valid C++ program should behave in the same manner regardless
- of whether it is compiled with debug mode or release mode. In
- particular, entities that are defined in namespace std in release
- mode should remain defined in namespace std in debug mode, so that
- legal specializations of namespace std entities will remain
- valid. A program that is not valid C++ (e.g., invokes undefined
- behavior) is not required to behave similarly, although the debug
- mode will abort with a diagnostic when it detects undefined
- behavior.</li>
-
- <li><b>Performance</b>: the additional of the libstdc++ debug mode
- must not affect the performance of the library when it is compiled
- in release mode. Performance of the libstdc++ debug mode is
- secondary (and, in fact, will be worse than the release
- mode).</li>
-
- <li><b>Usability</b>: the libstdc++ debug mode should be easy to
- use. It should be easily incorporated into the user's development
- environment (e.g., by requiring only a single new compiler switch)
- and should produce reasonable diagnostics when it detects a
- problem with the user program. Usability also involves detection
- of errors when using the debug mode incorrectly, e.g., by linking
- a release-compiled object against a debug-compiled object if in
- fact the resulting program will not run correctly.</li>
-
- <li><b>Minimize recompilation</b>: While it is expected that
- users recompile at least part of their program to use debug
- mode, the amount of recompilation affects the
- detect-compile-debug turnaround time. This indirectly affects the
- usefulness of the debug mode, because debugging some applications
- may require rebuilding a large amount of code, which may not be
- feasible when the suspect code may be very localized. There are
- several levels of conformance to this requirement, each with its
- own usability and implementation characteristics. In general, the
- higher-numbered conformance levels are more usable (i.e., require
- less recompilation) but are more complicated to implement than
- the lower-numbered conformance levels.
- <ol>
- <li><b>Full recompilation</b>: The user must recompile his or
- her entire application and all C++ libraries it depends on,
- including the C++ standard library that ships with the
- compiler. This must be done even if only a small part of the
- program can use debugging features.</li>
-
- <li><b>Full user recompilation</b>: The user must recompile
- his or her entire application and all C++ libraries it depends
- on, but not the C++ standard library itself. This must be done
- even if only a small part of the program can use debugging
- features. This can be achieved given a full recompilation
- system by compiling two versions of the standard library when
- the compiler is installed and linking against the appropriate
- one, e.g., a multilibs approach.</li>
-
- <li><b>Partial recompilation</b>: The user must recompile the
- parts of his or her application and the C++ libraries it
- depends on that will use the debugging facilities
- directly. This means that any code that uses the debuggable
- standard containers would need to be recompiled, but code
- that does not use them (but may, for instance, use IOStreams)
- would not have to be recompiled.</li>
-
- <li><b>Per-use recompilation</b>: The user must recompile the
- parts of his or her application and the C++ libraries it
- depends on where debugging should occur, and any other code
- that interacts with those containers. This means that a set of
- translation units that accesses a particular standard
- container instance may either be compiled in release mode (no
- checking) or debug mode (full checking), but must all be
- compiled in the same way; a translation unit that does not see
- that standard container instance need not be recompiled. This
- also means that a translation unit <em>A</em> that contains a
- particular instantiation
- (say, <code>std::vector<int></code>) compiled in release
- mode can be linked against a translation unit <em>B</em> that
- contains the same instantiation compiled in debug mode (a
- feature not present with partial recompilation). While this
- behavior is technically a violation of the One Definition
- Rule, this ability tends to be very important in
- practice. The libstdc++ debug mode supports this level of
- recompilation. </li>
-
- <li><b>Per-unit recompilation</b>: The user must only
- recompile the translation units where checking should occur,
- regardless of where debuggable standard containers are
- used. This has also been dubbed "<code>-g</code> mode",
- because the <code>-g</code> compiler switch works in this way,
- emitting debugging information at a per--translation-unit
- granularity. We believe that this level of recompilation is in
- fact not possible if we intend to supply safe iterators, leave
- the program semantics unchanged, and not regress in
- performance under release mode because we cannot associate
- extra information with an iterator (to form a safe iterator)
- without either reserving that space in release mode
- (performance regression) or allocating extra memory associated
- with each iterator with <code>new</code> (changes the program
- semantics).</li>
- </ol>
- </li>
- </ul>
-
-<h2><a name="other">Other implementations</a></h2>
-<p> There are several existing implementations of debug modes for C++
- standard library implementations, although none of them directly
- supports debugging for programs using libstdc++. The existing
- implementations include:</p>
-<ul>
- <li><a
- href="http://www.mathcs.sjsu.edu/faculty/horstman/safestl.html">SafeSTL</a>:
- SafeSTL was the original debugging version of the Standard Template
- Library (STL), implemented by Cay S. Horstmann on top of the
- Hewlett-Packard STL. Though it inspired much work in this area, it
- has not been kept up-to-date for use with modern compilers or C++
- standard library implementations.</li>
-
- <li><a href="http://www.stlport.org/">STLport</a>: STLport is a free
- implementation of the C++ standard library derived from the <a
- href="http://www.sgi.com/tech/stl/">SGI implementation</a>, and
- ported to many other platforms. It includes a debug mode that uses a
- wrapper model (that in some way inspired the libstdc++ debug mode
- design), although at the time of this writing the debug mode is
- somewhat incomplete and meets only the "Full user recompilation" (2)
- recompilation guarantee by requiring the user to link against a
- different library in debug mode vs. release mode.</li>
-
- <li><a href="http://www.metrowerks.com/mw/default.htm">Metrowerks
- CodeWarrior</a>: The C++ standard library that ships with Metrowerks
- CodeWarrior includes a debug mode. It is a full debug-mode
- implementation (including debugging for CodeWarrior extensions) and
- is easy to use, although it meets only the "Full recompilation" (1)
- recompilation guarantee.</li>
-</ul>
-
-<h2><a name="design">Debug mode design methodology</a></h2>
-<p>This section provides an overall view of the design of the
- libstdc++ debug mode and details the relationship between design
- decisions and the stated design goals.</p>
-
-<h3><a name="wrappers">The wrapper model</a></h3>
-<p>The libstdc++ debug mode uses a wrapper model where the debugging
- versions of library components (e.g., iterators and containers) form
- a layer on top of the release versions of the library
- components. The debugging components first verify that the operation
- is correct (aborting with a diagnostic if an error is found) and
- will then forward to the underlying release-mode container that will
- perform the actual work. This design decision ensures that we cannot
- regress release-mode performance (because the release-mode
- containers are left untouched) and partially enables <a
- href="#mixing">mixing debug and release code</a> at link time,
- although that will not be discussed at this time.</p>
-
-<p>Two types of wrappers are used in the implementation of the debug
- mode: container wrappers and iterator wrappers. The two types of
- wrappers interact to maintain relationships between iterators and
- their associated containers, which are necessary to detect certain
- types of standard library usage errors such as dereferencing
- past-the-end iterators or inserting into a container using an
- iterator from a different container.</p>
-
-<h4><a name="safe_iterator">Safe iterators</a></h4>
-<p>Iterator wrappers provide a debugging layer over any iterator that
- is attached to a particular container, and will manage the
- information detailing the iterator's state (singular,
- dereferenceable, etc.) and tracking the container to which the
- iterator is attached. Because iterators have a well-defined, common
- interface the iterator wrapper is implemented with the iterator
- adaptor class template <code>__gnu_debug::_Safe_iterator</code>,
- which takes two template parameters:</p>
-
-<ul>
- <li><code>Iterator</code>: The underlying iterator type, which must
- be either the <code>iterator</code> or <code>const_iterator</code>
- typedef from the sequence type this iterator can reference.</li>
-
- <li><code>Sequence</code>: The type of sequence that this iterator
- references. This sequence must be a safe sequence (discussed below)
- whose <code>iterator</code> or <code>const_iterator</code> typedef
- is the type of the safe iterator.</li>
-</ul>
-
-<h4><a name="safe_sequence">Safe sequences (containers)</a></h4>
-<p>Container wrappers provide a debugging layer over a particular
- container type. Because containers vary greatly in the member
- functions they support and the semantics of those member functions
- (especially in the area of iterator invalidation), container
- wrappers are tailored to the container they reference, e.g., the
- debugging version of <code>std::list</code> duplicates the entire
- interface of <code>std::list</code>, adding additional semantic
- checks and then forwarding operations to the
- real <code>std::list</code> (a public base class of the debugging
- version) as appropriate. However, all safe containers inherit from
- the class template <code>__gnu_debug::_Safe_sequence</code>,
- instantiated with the type of the safe container itself (an instance
- of the curiously recurring template pattern).</p>
-
-<p>The iterators of a container wrapper will be
- <a href="#safe_iterator">safe iterators</a> that reference sequences
- of this type and wrap the iterators provided by the release-mode
- base class. The debugging container will use only the safe
- iterators within its own interface (therefore requiring the user to
- use safe iterators, although this does not change correct user
- code) and will communicate with the release-mode base class with
- only the underlying, unsafe, release-mode iterators that the base
- class exports.</p>
-
-<p> The debugging version of <code>std::list</code> will have the
- following basic structure:</p>
-
-<pre>
-template<typename _Tp, typename _Allocator = allocator<_Tp>
- class debug-list :
- public release-list<_Tp, _Allocator>,
- public __gnu_debug::_Safe_sequence<debug-list<_Tp, _Allocator> >
- {
- typedef release-list<_Tp, _Allocator> _Base;
- typedef debug-list<_Tp, _Allocator> _Self;
-
- public:
- typedef __gnu_debug::_Safe_iterator<typename _Base::iterator, _Self> iterator;
- typedef __gnu_debug::_Safe_iterator<typename _Base::const_iterator, _Self> const_iterator;
-
- // duplicate std::list interface with debugging semantics
- };
-</pre>
-
-<h3><a name="precondition">Precondition checking</a></h3>
-<p>The debug mode operates primarily by checking the preconditions of
- all standard library operations that it supports. Preconditions that
- are always checked (regardless of whether or not we are in debug
- mode) are checked via the <code>__check_xxx</code> macros defined
- and documented in the source
- file <code>include/debug/debug.h</code>. Preconditions that may or
- may not be checked, depending on the debug-mode
- macro <code>_GLIBCXX_DEBUG</code>, are checked via
- the <code>__requires_xxx</code> macros defined and documented in the
- same source file. Preconditions are validated using any additional
- information available at run-time, e.g., the containers that are
- associated with a particular iterator, the position of the iterator
- within those containers, the distance between two iterators that may
- form a valid range, etc. In the absence of suitable information,
- e.g., an input iterator that is not a safe iterator, these
- precondition checks will silently succeed.</p>
-
-<p>The majority of precondition checks use the aforementioned macros,
- which have the secondary benefit of having prewritten debug
- messages that use information about the current status of the
- objects involved (e.g., whether an iterator is singular or what
- sequence it is attached to) along with some static information
- (e.g., the names of the function parameters corresponding to the
- objects involved). When not using these macros, the debug mode uses
- either the debug-mode assertion
- macro <code>_GLIBCXX_DEBUG_ASSERT</code> , its pedantic
- cousin <code>_GLIBCXX_DEBUG_PEDASSERT</code>, or the assertion
- check macro that supports more advance formulation of error
- messages, <code>_GLIBCXX_DEBUG_VERIFY</code>. These macros are
- documented more thoroughly in the debug mode source code.</p>
-
-<h3><a name="coexistence">Release- and debug-mode coexistence</a></h3>
-<p>The libstdc++ debug mode is the first debug mode we know of that
- is able to provide the "Per-use recompilation" (4) guarantee, that
- 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
- extension to the GNU C++ compiler (described in the GCC Manual for
- C++ Extensions, see <a
- href="http://gcc.gnu.org/onlinedocs/gcc/Strong-Using.html">strong
- using</a>), and a complex organization of debug- and
- release-modes. The end result is that we have achieved per-use
- recompilation but have had to give up some checking of the
- <code>std::basic_string</code> class template (namely, safe
- iterators).
-</p>
-
-<h4><a name="compile_coexistence">Compile-time coexistence of release- and
- debug-mode components</a></h4>
-<p>Both the release-mode components and the debug-mode
- components need to exist within a single translation unit so that
- the debug versions can wrap the release versions. However, only one
- of these components should be user-visible at any particular
- time with the standard name, e.g., <code>std::list</code>. </p>
-
-<p>In release mode, we define only the release-mode version of the
- component with its standard name and do not include the debugging
- component at all. The release mode version is defined within the
- namespace <code>std</code>. Minus the namespace associations, this
- method leaves the behavior of release mode completely unchanged from
- its behavior prior to the introduction of the libstdc++ debug
- mode. Here's an example of what this ends up looking like, in
- C++.</p>
-
-<pre>
-namespace std
-{
- template<typename _Tp, typename _Alloc = allocator<_Tp> >
- class list
- {
- // ...
- };
-} // namespace std
-</pre>
-
-<p>In debug mode we include the release-mode container (which is now
-defined in in the namespace <code>__norm</code>) and also the
-debug-mode container. The debug-mode container is defined within the
-namespace <code>__debug</code>, which is associated with namespace
-<code>std</code> via the GNU namespace association extension. This
-method allows the debug and release versions of the same component to
-coexist at compile-time and link-time without causing an unreasonable
-maintenance burden, while minimizing confusion. Again, this boils down
-to C++ code as follows:</p>
-
-<pre>
-namespace std
-{
- namespace __norm
- {
- template<typename _Tp, typename _Alloc = allocator<_Tp> >
- class list
- {
- // ...
- };
- } // namespace __gnu_norm
-
- namespace __debug
- {
- template<typename _Tp, typename _Alloc = allocator<_Tp> >
- class list
- : public __norm::list<_Tp, _Alloc>,
- public __gnu_debug::_Safe_sequence<list<_Tp, _Alloc> >
- {
- // ...
- };
- } // namespace __norm
-
- using namespace __debug __attribute__ ((strong));
-}
-</pre>
-
-<h4><a name="mixing">Link- and run-time coexistence of release- and
- debug-mode components</a></h4>
-
-<p>Because each component has a distinct and separate release and
-debug implementation, there are are no issues with link-time
-coexistence: the separate namespaces result in different mangled
-names, and thus unique linkage.</p>
-
-<p>However, components that are defined and used within the C++
-standard library itself face additional constraints. For instance,
-some of the member functions of <code> std::moneypunct</code> return
-<code>std::basic_string</code>. Normally, this is not a problem, but
-with a mixed mode standard library that could be using either
-debug-mode or release-mode <code> basic_string</code> objects, things
-get more complicated. As the return value of a function is not
-encoded into the mangled name, there is no way to specify a
-release-mode or a debug-mode string. In practice, this results in
-runtime errors. A simplified example of this problem is as follows.
-</p>
-
-<p> Take this translation unit, compiled in debug-mode: </p>
-<pre>
-// -D_GLIBCXX_DEBUG
-#include <string>
-
-std::string test02();
-
-std::string test01()
-{
- return test02();
-}
-
-int main()
-{
- test01();
- return 0;
-}
-</pre>
-
-<p> ... and linked to this translation unit, compiled in release mode:</p>
-
-<pre>
-#include <string>
-
-std::string
-test02()
-{
- return std::string("toast");
-}
-</pre>
-
-<p> For this reason we cannot easily provide safe iterators for
- the <code>std::basic_string</code> class template, as it is present
- throughout the C++ standard library. For instance, locale facets
- define typedefs that include <code>basic_string</code>: in a mixed
- debug/release program, should that typedef be based on the
- debug-mode <code>basic_string</code> or the
- release-mode <code>basic_string</code>? While the answer could be
- "both", and the difference hidden via renaming a la the
- debug/release containers, we must note two things about locale
- facets:</p>
-
-<ol>
- <li>They exist as shared state: one can create a facet in one
- translation unit and access the facet via the same type name in a
- different translation unit. This means that we cannot have two
- different versions of locale facets, because the types would not be
- the same across debug/release-mode translation unit barriers.</li>
-
- <li>They have virtual functions returning strings: these functions
- mangle in the same way regardless of the mangling of their return
- types (see above), and their precise signatures can be relied upon
- by users because they may be overridden in derived classes.</li>
-</ol>
-
-<p>With the design of libstdc++ debug mode, we cannot effectively hide
- the differences between debug and release-mode strings from the
- user. Failure to hide the differences may result in unpredictable
- behavior, and for this reason we have opted to only
- perform <code>basic_string</code> changes that do not require ABI
- changes. The effect on users is expected to be minimal, as there are
- simple alternatives (e.g., <code>__gnu_debug::basic_string</code>),
- and the usability benefit we gain from the ability to mix debug- and
- release-compiled translation units is enormous.</p>
-
-<h4><a name="coexistence_alt">Alternatives for Coexistence</a></h4>
-<p>The coexistence scheme above was chosen over many alternatives,
- including language-only solutions and solutions that also required
- extensions to the C++ front end. The following is a partial list of
- solutions, with justifications for our rejection of each.</p>
-
-<ul>
- <li><em>Completely separate debug/release libraries</em>: This is by
- far the simplest implementation option, where we do not allow any
- coexistence of debug- and release-compiled translation units in a
- program. This solution has an extreme negative affect on usability,
- because it is quite likely that some libraries an application
- depends on cannot be recompiled easily. This would not meet
- our <b>usability</b> or <b>minimize recompilation</b> criteria
- well.</li>
-
- <li><em>Add a <code>Debug</code> boolean template parameter</em>:
- Partial specialization could be used to select the debug
- implementation when <code>Debug == true</code>, and the state
- of <code>_GLIBCXX_DEBUG</code> could decide whether the
- default <code>Debug</code> argument is <code>true</code>
- or <code>false</code>. This option would break conformance with the
- C++ standard in both debug <em>and</em> release modes. This would
- not meet our <b>correctness</b> criteria. </li>
-
- <li><em>Packaging a debug flag in the allocators</em>: We could
- reuse the <code>Allocator</code> template parameter of containers
- by adding a sentinel wrapper <code>debug<></code> that
- signals the user's intention to use debugging, and pick up
- the <code>debug<></code> allocator wrapper in a partial
- specialization. However, this has two drawbacks: first, there is a
- conformance issue because the default allocator would not be the
- standard-specified <code>std::allocator<T></code>. Secondly
- (and more importantly), users that specify allocators instead of
- implicitly using the default allocator would not get debugging
- containers. Thus this solution fails the <b>correctness</b>
- criteria.</li>
-
- <li><em>Define debug containers in another namespace, and employ
- a <code>using</code> declaration (or directive)</em>: This is an
- enticing option, because it would eliminate the need for
- the <code>link_name</code> extension by aliasing the
- templates. However, there is no true template aliasing mechanism
- is C++, because both <code>using</code> directives and using
- declarations disallow specialization. This method fails
- the <b>correctness</b> criteria.</li>
-
- <li><em> Use implementation-specific properties of anonymous
- namespaces. </em>
- See <a
- href="http://gcc.gnu.org/ml/libstdc++/2003-08/msg00004.html"> this post
- </a>
- This method fails the <b>correctness</b> criteria.</li>
-
- <li><em>Extension: allow reopening on namespaces</em>: This would
- allow the debug mode to effectively alias the
- namespace <code>std</code> to an internal namespace, such
- as <code>__gnu_std_debug</code>, so that it is completely
- separate from the release-mode <code>std</code> namespace. While
- this will solve some renaming problems and ensure that
- debug- and release-compiled code cannot be mixed unsafely, it ensures that
- debug- and release-compiled code cannot be mixed at all. For
- instance, the program would have two <code>std::cout</code>
- objects! This solution would fails the <b>minimize
- recompilation</b> requirement, because we would only be able to
- support option (1) or (2).</li>
-
- <li><em>Extension: use link name</em>: This option involves
- complicated re-naming between debug-mode and release-mode
- components at compile time, and then a g++ extension called <em>
- link name </em> to recover the original names at link time. There
- are two drawbacks to this approach. One, it's very verbose,
- relying on macro renaming at compile time and several levels of
- include ordering. Two, ODR issues remained with container member
- functions taking no arguments in mixed-mode settings resulting in
- equivalent link names, <code> vector::push_back() </code> being
- one example.
- See <a
- href="http://gcc.gnu.org/ml/libstdc++/2003-08/msg00177.html">link
- name</a> </li>
-</ul>
-
-<p>Other options may exist for implementing the debug mode, many of
- which have probably been considered and others that may still be
- lurking. This list may be expanded over time to include other
- options that we could have implemented, but in all cases the full
- ramifications of the approach (as measured against the design goals
- for a libstdc++ debug mode) should be considered first. The DejaGNU
- testsuite includes some testcases that check for known problems with
- some solutions (e.g., the <code>using</code> declaration solution
- that breaks user specialization), and additional testcases will be
- added as we are able to identify other typical problem cases. These
- test cases will serve as a benchmark by which we can compare debug
- mode implementations.</p>
-
-<!-- ####################################################### -->
-
-<hr />
-<p class="fineprint"><em>
-See <a href="17_intro/license.html">license.html</a> for copying conditions.
-Comments and suggestions are welcome, and may be sent to
-<a href="mailto:libstdc++@gcc.gnu.org">the libstdc++ mailing list</a>.
-</em></p>
-
-
-</body>
-</html>
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
<head>
<meta name="KEYWORDS"
- content="libstdc++, homepage, home, C++, library, c++, std, g++, ABI, STL" />
- <title>GNU C++ Standard Library</title>
+ content="libstdc++, homepage, home, C++, library, c++, std, g++, STL" />
+ <title>The GNU C++ Library</title>
<link rel="StyleSheet" href="lib3styles.css" type="text/css" />
<link rel="Copyright" href="17_intro/license.html" type="text/html" />
<link rel="Help" href="faq/index.html" type="text/html" title="F.A.Q." />
</head>
<body>
+<h1>The GNU C++ Library</h1>
-<p><strong>All of these documents</strong> (in fact, this entire homepage set)
- are bundled with the library source, under the <code>docs</code>
- subdirectory, for releases and snapshots. The sole exception is the
- automatically-generated source documentation, available separately.
-</p>
-<hr />
-<br />
-<h2><a name="1">Introduction</a></h2>
- <p>This is a short list of text files pertaining to this implementation of
- ISO 14882. A brief description may follow the name of the file.
- </p>
- <ul>
- <li><a href="17_intro/COPYING">License</a>
- - GPL v2 license terms</li>
- <li><a href="abi.html">ABI Policy and Guidelines</a></li>
- <li><a href="17_intro/BUGS">BUGS</a></li>
- <li><a href="17_intro/PROBLEMS">PROBLEMS</a>
- - target-specific known issues</li>
- <!-- Linking to "../README" doesn't work; we are at the top level
- of the web pages. Punt. -->
- <li>README - directory structure</li>
- <li><a href="17_intro/RELEASE-NOTES">RELEASE-NOTES</a>
- - latest version info, recent changes and news</li>
- <li><a href="17_intro/TODO">TODO</a>
- - tasks yet undone</li>
- <li><a href="faq/index.html">FAQ (HTML)</a>,
- <a href="faq/index.txt">FAQ (text)</a></li>
- </ul>
+<h2><a name="3">Table of Contents</a></h2>
-<hr />
-<br />
-<h2><a name="2">Configuring, Building, Testing, Installing</a></h2>
-<ul>
- <li><a href="configopts.html">Configure options</a></li>
- <li><a href="install.html">Getting started: configure, build, install</a>
- </li>
- <li><a href="test.html">Testing details</a></li>
- <li><a href="debug.html">Debugging schemes and strategies</a>
- </li>
-</ul>
-
-
-<hr />
-<br />
-<h2><a name="4">Source-Level Documentation</a></h2>
-<p>The library sources have been specially formatted so that with the
- proper invocation of another tool (Doxygen), a set of HTML pages
- are generated from the sources files themselves. The resultant
- documentation is referred to as Source-Level Documentation, and is
- useful for examining the signatures of public member functions for
- the library classes, finding out what is in a particular include
- file, looking at inheritance diagrams, etc.
-</p>
-<p>The source-level documentation for the most recent releases can
- be viewed online:
-</p>
-<ul>
- <li><a href="libstdc++-html-USERS-3.4/index.html">for the 3.4 release</a></li>
- <li><a href="latest-doxygen/index.html">"the latest collection"</a>
- (for the main development tree; see the date on the first page)
- </li>
-</ul>
-<p>This generated HTML collection, as above, is also available for download in
- the libstdc++ snapshots directory at
- <code><URL:ftp://gcc.gnu.org/pub/gcc/libstdc++/doxygen/></code>.
- You will almost certainly need to use one of the
- <a href="http://gcc.gnu.org/mirrors.html">mirror sites</a> to download
- the tarball. After unpacking, simply load libstdc++-html-*/index.html
- into a browser.
+<p>
+The GNU Standard C++ Library is an ongoing <a
+href="http://gcc.gnu.org/libstdc++">project</a> to implement the ISO
+14882 Standard C++ library as described in chapters 17 through 27 and
+annex D, extensions as described by TR1, and future C++ library
+standards still in progress. For those who want to see exactly how far
+the project has come, or just want the latest bleeding-edge code, the
+up-to-date source is always publically available over anonymous SVN,
+and can be browsed over the <a
+href="http://gcc.gnu.org/svn.html">web</a>.
</p>
-<p>Documentation for older releases is available for download only, not
- online viewing.
-</p>
-<p>In addition, an initial set of man pages are also available in the
- same place as the HTML collections. Start with C++Intro(3).
-</p>
-
-<hr />
-<br />
-<h2><a name="3">Chapter-Specific Documentation</a></h2>
-<p>Information, extensions, notes and advice on specific implementation
- capabilites and/or liabilities broken down into chapter names based on the
- C++ standard.
+<p>Stable versions of libstdc++ are included with releases of
+ <a href="http://gcc.gnu.org/releases.html">the GCC compilers</a>.
</p>
<!--
The list below is automatically generated. To make changes in the text,
-->
<!-- beginlist -->
<ul>
- <li>Library Introduction (Chapter 17)
+ <li>Introduction
<ul>
- <li><a href="17_intro/howto.html#2">The Standard C++ header files</a></li>
- <li><a href="17_intro/howto.html#3">The Standard C++ library and multithreading</a></li>
- <li><a href="17_intro/howto.html#4"><code><foo></code> vs <code><foo.h></code></a></li>
- <li><a href="17_intro/porting-howto.html">Porting HOWTO</a></li>
- <li><a href="17_intro/howto.html#5">Behavior specific to libstdc++-v3</a></li>
- <li><a href="17_intro/howto.html#6">Preprocessor macros controlling the library</a></li>
+
+ <li> Status
+<ul>
+ <li>Implementation Status
+ <ul>
+ <li><a href="17_intro/c++1998_status.html">C++1998</a>,
+ including <a href="17_intro/howto.html#5">implementation-defined behavior</a> and <a href="ext/howto.html#5">LWG issues</a> </li>
+ <li><a href="17_intro/tr1_status.html">C++TR1</a></li>
+ <li><a href="17_intro/c++0x_status.html">C++0x</a></li>
+ <li>Extensions</li>
+ </ul>
+ </li>
+ <li><a href="17_intro/license.html">License</a></li>
+ <li><a href="http://gcc.gnu.org/bugzilla/buglist.cgi?cmdtype=runnamed&namedcmd=libstdc%2B%2B">Known Bugs</a></li>
+
+</ul>
+ </li>
+
+
+
+ <li> Configuring, Building, Testing, Installing
+<ul>
+ <li><a href="install.html">Getting started: configure, build, install</a>
+ </li>
+ <li><a href="configopts.html">Configure options</a></li>
+ <li><a href="test.html">Testing details</a></li>
+ </li>
+</ul>
+ </li>
+
+ <li> Using the Library
+ <ul>
+ <li>Header Files</li>
+ <ul>
+ <li><a href="17_intro/howto.html#2.1">Available headers</a></li>
+ <li><a href="17_intro/howto.html#2.2">Headers and <code>namespace std</code></a></li>
+ <li>Pre-compiled headers</li>
+ </ul>
+
+ <li>Namespaces</li>
+ <ul>
+ <li><a href="17_intro/howto.html#2.5">Namespace <code>std::</code></a></li>
+ <li><a href="17_intro/howto.html#2.6">Using namespace composition</a></li>
+ </ul>
+ <li><a href="17_intro/howto.html#6">Macros</a></li>
+
+ <li>Concurrency</li>
+ <ul>
+ <li>Atomic Operations</li>
+ <li><a href="17_intro/howto.html#3">Thread safety overview</a></li>
+
+ <li><a href="faq/index.html#5_6">Is it thread safe?</li>
+ <li><a href="23_containers/howto.html#3">Containers</a></li>
+ <li><a href="27_io/howto.html#9">IO</a></li>
+ </ul>
+ <li>Exception safety</li>
+
+ <li><a href="debug.html">Debugging support</a>
+ </ul>
+ </li>
+
</ul>
</li>
- <li>Library Support (Chapter 18)
+ <li>Support
<ul>
<li><a href="18_support/howto.html#1">Types</a></li>
- <li><a href="18_support/howto.html#2">Implementation properties</a></li>
+ <li><a href="18_support/howto.html#2">Implementation properties of builtin types</a></li>
<li><a href="18_support/howto.html#3">Start and Termination</a></li>
<li><a href="18_support/howto.html#4">Verbose <code>terminate</code></a></li>
<li><a href="18_support/howto.html#5">Dynamic memory management</a></li>
- <li><a href="18_support/howto.html#6">RTTI, the ABI, and demangling</a></li>
</ul>
</li>
- <li>Diagnostics (Chapter 19)
+ <li>Diagnostics
<ul>
+ <li>Exception class hierarchy</li>
<li><a href="19_diagnostics/howto.html#1">Adding data to exceptions</a></li>
- <li><a href="19_diagnostics/howto.html#2">Exception class hierarchy diagram</a></li>
- <li><a href="19_diagnostics/howto.html#3">Concept checkers -- <strong>new and improved!</strong></a></li>
+ <li><a href="19_diagnostics/howto.html#3">Concept checking</a></li>
</ul>
</li>
- <li>General Utilities (Chapter 20)
+ <li>General Utilities
<ul>
- <li><a href="20_util/howto.html#1"><code>auto_ptr</code> is not omnipotent</a></li>
- <li><a href="20_util/howto.html#2"><code>auto_ptr</code> inside container classes</a></li>
<li><a href="20_util/howto.html#3">Functors</a></li>
<li><a href="20_util/howto.html#4">Pairs</a></li>
- <li><a href="20_util/howto.html#5">Memory allocators</a></li>
+ <li>Memory</li>
+ <ul>
+ <li><a href="20_util/allocator.html">allocator</a></li>
+ <li>auto_ptr</li>
+ <ul>
+ <li><a href="20_util/howto.html#1"><code>auto_ptr</code> is not omnipotent</a></li>
+ <li><a href="20_util/howto.html#2"><code>auto_ptr</code> inside container classes</a></li>
+ </ul>
+ </ul>
</ul>
</li>
- <li>Strings (Chapter 21)
+ <li>Strings
<ul>
- <li><a href="21_strings/howto.html#1">MFC's CString</a></li>
<li><a href="21_strings/howto.html#2">A case-insensitive string class</a></li>
<li><a href="21_strings/howto.html#3">Breaking a C++ string into tokens</a></li>
<li><a href="21_strings/howto.html#4">Simple transformations</a></li>
<li><a href="21_strings/howto.html#5">Making strings of arbitrary character types</a></li>
<li><a href="21_strings/howto.html#6">Shrink-to-fit strings</a></li>
+ <li><a href="21_strings/howto.html#1">MFC's CString</a></li>
</ul>
</li>
- <li>Localization (Chapter 22)
+ <li>Localization
<ul>
<li><a href="22_locale/howto.html#1">class locale</a></li>
<li><a href="22_locale/howto.html#2">class codecvt</a></li>
<li><a href="22_locale/howto.html#3">class ctype</a></li>
- <li><a href="22_locale/howto.html#4">class messages</a></li>
- <li><a href="22_locale/howto.html#5">Bjarne Stroustrup on Locales</a></li>
- <li><a href="22_locale/howto.html#6">Nathan Myers on Locales</a></li>
<li><a href="22_locale/howto.html#7">Correct Transformations</a></li>
+ <li><a href="22_locale/howto.html#4">class messages</a></li>
</ul>
</li>
- <li>Containers (Chapter 23)
+ <li>Containers
<ul>
<li><a href="23_containers/howto.html#1">Making code unaware of the container/array difference</a></li>
- <li><a href="23_containers/howto.html#2">Variable-sized bitmasks</a></li>
- <li><a href="23_containers/howto.html#3">Containers and multithreading</a></li>
<li><a href="23_containers/howto.html#4">"Hinting" during insertion</a></li>
- <li><a href="23_containers/howto.html#5">Bitmasks and string arguments</a></li>
<li><a href="23_containers/howto.html#6"><code>std::list::size()</code> is O(n)!</a></li>
<li><a href="23_containers/howto.html#7">Space overhead management for vectors</a></li>
+ <li><a href="23_containers/howto.html#2">Variable-sized bitmasks</a></li>
+ <li><a href="23_containers/howto.html#5">Bitmasks and string arguments</a></li>
</ul>
</li>
- <li>Iterators (Chapter 24)
+ <li>Iterators
<ul>
<li><a href="24_iterators/howto.html#1">They ain't pointers!</a></li>
<li><a href="24_iterators/howto.html#2">It ends <em>where?</em></a></li>
</ul>
</li>
- <li>Algorithms (Chapter 25)
+ <li>Algorithms
<ul>
<li><a href="25_algorithms/howto.html#1">Prerequisites</a></li>
- <li><a href="25_algorithms/howto.html#2">Special <code>swap</code>s</a></li>
+ <li><a href="25_algorithms/howto.html#2">Specializations for <code>swap</code></a></li>
</ul>
</li>
- <li>Numerics (Chapter 26)
+ <li>Numerics
<ul>
<li><a href="26_numerics/howto.html#1">Complex Number Processing</a></li>
<li><a href="26_numerics/howto.html#2">Array Processing</a></li>
</ul>
</li>
- <li>Input/Output (Chapter 27)
+ <li>Input/Output
<ul>
<li><a href="27_io/howto.html#1">Copying a file</a></li>
<li><a href="27_io/howto.html#2">The buffering is screwing up my program!</a></li>
<li><a href="ext/howto.html#4">Compile-time checks</a></li>
<li><a href="debug_mode.html">Debug mode</a></li>
<li><a href="parallel_mode.html">Parallel mode</a></li>
- <li><a href="ext/pb_ds/index.html">Policy Based Data Structures</a></li>
- <li><a href="ext/howto.html#1">Ropes and trees and hashes, oh my!</a></li>
- <li><a href="ext/howto.html#2">Added members and types</a></li>
+ <li> Allocators</li>
+ <ul>
<li><a href="ext/mt_allocator.html"><code>__mt_alloc</code> </a></li>
- <li><a href="ext/howto.html#5">LWG Issues</a></li>
+ <li><a href="ext/ballocator_doc.html">Bitmap Allocator</a></li>
+ </ul>
+
+ <li> Containers </li>
+ <ul>
+ <li><a href="ext/pb_ds/index.html">Policy Based Data Structures</a></li>
+ <li><a href="ext/howto.html#1">Ropes and trees and hashes, oh my!</a></li>
+ </ul>
+
+ <li> Algorithms</li>
+<ul>
+ <li><a href="ext/sgiexts.html">HP/SGI STL Extensions</a></li>
+</ul>
+
+ <li> Input/Output</li>
+<ul>
+ <li><a href="27_io/howto.html#11">Derived filebuf classes</a></li>
+</ul>
<li><a href="ext/../18_support/howto.html#6">Demangling</a></li>
</ul>
</li>
- </ul>
-<!-- endlist -->
-
-<hr />
-<br />
-<h2><a name="5">Contributor-Specific Information</a></h2>
+ <li>Appendix
+ <ul>
+ <li>A. <a name="5">Contributing and Maintenance</a></li>
<ul>
<li><a href="17_intro/contribute.html">Contributor checklist</a></li>
- <li><a href="http://gcc.gnu.org/svnwrite.html">Getting SVN write access
+ <li><a href="http://gcc.gnu.org/svnwrite.html">Getting write access
(look for "Write after approval")</a></li>
<li><a href="17_intro/BADNAMES">BADNAMES</a>
- names to avoid because of potential collisions</li>
- <li><a href="17_intro/C++STYLE">C++STYLE</a>
- - coding style by example</li>
- <li> In the libstdc++-v3/docs/doxygen directory, see guide.html, a
- doxygen markup style guide</li>
- <li><a href="17_intro/CHECKLIST">CHECKLIST</a>
- - a list of required features and their status.</li>
+ <li><a href="17_intro/C++STYLE">Coding style, by example</a></li>
+ <li> Doxygen markup style guide. In the source docs/doxygen directory, see guide.html. Here's the a link to the current <a href="http://gcc.gnu.org/viewcvs/*checkout*/trunk/libstdc%2B%2B-v3/docs/doxygen/guide.html?content-type=text%2Fplain">page</a>.
+</li>
<li><a href="17_intro/DESIGN">DESIGN</a>
- overview of the implementation plan</li>
- <li><a href="17_intro/HEADER_POLICY">HEADER_POLICY</a>
- - header naming and sub-include structure</li>
+ <li>Header policy, namespace map, API conventions</li>
</ul>
-<!-- ####################################################### -->
+ <li>B. Porting</li>
+
+<ul>
+ <li><a href="17_intro/porting.html">Porting to new hardware or operating systems.</a></li>
+ <li><a href="17_intro/abi.html">ABI Policy and Guidelines</a></li>
+ <li><a href="17_intro/api.html">API Evolution and Deprecation History</a></li>
+</ul>
+
+ <li>C. <a href="http://www.gnu.org/software/libc/manual/html_node/Free-Manuals.html#Free-Manuals">Free Software Needs Free Documentation </a>
+ </ul>
+ </li>
+
+ </ul>
+<!-- endlist -->
+
+<hr />
+<br />
+<h2><a name="4">Source-Level Documentation</a></h2>
+<p>The library sources have been specially formatted so that with the
+ proper invocation of another tool (Doxygen), a set of HTML pages
+ are generated from the sources files themselves. The resultant
+ documentation is referred to as Source-Level Documentation, and is
+ useful for examining the signatures of public member functions for
+ the library classes, finding out what is in a particular include
+ file, looking at inheritance diagrams, etc.
+</p>
+<p>The source-level documentation for the most recent releases can
+ be viewed online:
+</p>
+<ul>
+ <li><a href="libstdc++-html-USERS-3.4/index.html">for the 3.4 release</a></li>
+ <li><a href="libstdc++-html-USERS-4.1/index.html">for the 4.1 release</a></li>
+ <li><a href="libstdc++-html-USERS-4.2/index.html">for the 4.2 release</a></li>
+ <li><a href="latest-doxygen/index.html">"the latest collection"</a>
+ (for the main development tree; see the date on the first page)
+ </li>
+</ul>
+<p>This generated HTML collection, as above, is also available for download in
+ the libstdc++ snapshots directory at
+ <code><URL:ftp://gcc.gnu.org/pub/gcc/libstdc++/doxygen/></code>.
+ You will almost certainly need to use one of the
+ <a href="http://gcc.gnu.org/mirrors.html">mirror sites</a> to download
+ the tarball. After unpacking, simply load libstdc++-html-*/index.html
+ into a browser.
+</p>
+<p>Documentation for older releases is available for download only, not
+ online viewing.
+</p>
+<p>In addition, an initial set of man pages are also available in the
+ same place as the HTML collections. Start with C++Intro(3).
+</p>
+
+<hr />
+<br />
+<h2><a name="7"><a href="faq/index.html">Frequently Asked Questions</a></a></h2
+
+<hr />
+<br />
+<p><strong>All of these documents</strong> (in fact, this entire homepage set)
+ are bundled with the library source, under the <code>docs</code>
+ subdirectory, for releases and snapshots. The sole exception is the
+ automatically-generated source documentation, available separately.
+</p>
+
+<!-- ####################################################### -->
<p>Return <a href="http://gcc.gnu.org/libstdc++/">to the libstdc++ homepage</a>.</p>
+
<hr />
<p class="fineprint"><em>
See <a href="17_intro/license.html">license.html</a> for copying conditions.
+++ /dev/null
-<?xml version="1.0" encoding="ISO-8859-1"?>
-<!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" xml:lang="en" lang="en">
-<head>
- <meta name="AUTHOR" content="pme@gcc.gnu.org (Phil Edwards)" />
- <meta name="KEYWORDS" content="libstdc++, libstdc++-v3, GCC, g++" />
- <meta name="DESCRIPTION" content="Explanatory notes about libstdc++-v3." />
- <meta name="GENERATOR" content="vi and eight fingers" />
- <title>Explanatory notes about libstdc++-v3 design</title>
-<link rel="StyleSheet" href="lib3styles.css" type="text/css" />
-<link rel="Copyright" href="17_intro/license.html" type="text/html" />
-</head>
-<body>
-
-<h1 class="centered"><a name="top">Explanatory notes about libstdc++-v3
-design</a></h1>
-
-<p class="fineprint"><em>
- The latest version of this document is always available at
- <a href="http://gcc.gnu.org/onlinedocs/libstdc++/explanations.html">
- http://gcc.gnu.org/onlinedocs/libstdc++/explanations.html</a>.
-</em></p>
-
-<p><em>
- To the <a href="http://gcc.gnu.org/libstdc++/">libstdc++-v3 homepage</a>.
-</em></p>
-
-
-<!-- ####################################################### -->
-<hr />
-<h3><a name="cstdio">"I/O packages", <code>--enable-cstdio</code></a></h3>
-<p>In addition to all the nifty things which C++ can do for I/O, its library
- also includes all of the I/O capabilites of C. Making them work together
- can be a challenge, not only
- <a href="27_io/howto.html#8">for the programmer</a> but for the
- implementors as well.
-</p>
-<p>There are two ways to do a C++ library: the cool way, and the easy way.
- More specifically, the cool-but-easy-to-get-wrong way, and the
- easy-to-guarantee-correct-behavior way. For 3.0, the easy way is used.
-</p>
-<p>Choosing 'stdio' is the easy way. It builds a C++ library which forwards
- all operations to the C library. Many of the C++ I/O functions are
- specified in the standard 'as if' they called a certain C function; the
- easiest way to get it correct is to actually call that function. The
- disadvantage is that the C++ code will run slower (fortunately, the layer
- is thin).
-</p>
-<p>Other packages are possible. For a new package, a header must be
- written to provide types like streamsize (usually just a typedef), as
- well as some internal types like<code> __c_file_type </code> and
- <code> __c_lock </code> (for the stdio case, these are FILE (as in
- "FILE*") and a simple POSIX mutex, respectively). An
- interface class called <code> __basic_file </code> must also be filled in;
- as an example, for the stdio case, these member functions are all
- inline calles to fread, fwrite, etc.
-</p>
-<p>Return <a href="#top">to the top of the page</a> or
- <a href="http://gcc.gnu.org/libstdc++/">to the homepage</a>.
-</p>
-
-
-<hr />
-<h3><a name="alloc">Internal Allocators</a></h3>
-<p>
-</p>
-<p>Return <a href="#top">to the top of the page</a> or
- <a href="http://gcc.gnu.org/libstdc++/">to the homepage</a>.
-</p>
-
-
-<!-- ####################################################### -->
-
-<hr />
-<p class="fineprint"><em>
-See <a href="17_intro/license.html">license.html</a> for copying conditions.
-Comments and suggestions are welcome, and may be sent to
-<a href="mailto:libstdc++@gcc.gnu.org">the libstdc++ mailing list</a>.
-</em></p>
-
-
-</body>
-</html>
href="http://gcc.gnu.org/onlinedocs/libstdc++/ext/ballocator_doc.html">
http://gcc.gnu.org/onlinedocs/libstdc++/ext/ballocator_doc.html</a>.</small></small></em><br>
<br>
-<em> To the <a href="http://gcc.gnu.org/libstdc++/">libstdc++-v3
+<em> To the <a href="http://gcc.gnu.org/libstdc++/">libstdc++
homepage</a>.</em><br>
<br>
<hr style="width: 100%; height: 2px;"><br>
create a function that returns the Max_Wastage_Percentage for us to use.<br>
<br>
<hr style="width: 100%; height: 2px;"><small><small><em> See <a
- href="file:///home/dhruv/projects/libstdc++-v3/gcc/libstdc++-v3/docs/html/17_intro/license.html">license.html</a>
+ href="file:///home/dhruv/projects/libstdc++/gcc/libstdc++/docs/html/17_intro/license.html">license.html</a>
for copying conditions. Comments and suggestions are welcome, and may
be
sent to <a href="mailto:libstdc++@gcc.gnu.org">the libstdc++ mailing
--- /dev/null
+<?xml version="1.0" encoding="ISO-8859-1"?>
+<!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" xml:lang="en" lang="en">
+<head>
+ <meta name="AUTHOR" content="gregod@cs.rpi.edu (Doug Gregor)" />
+ <meta name="KEYWORDS" content="C++, GCC, libstdc++, g++, debug" />
+ <meta name="DESCRIPTION" content="Design of the libstdc++ debug mode." />
+ <meta name="GENERATOR" content="vi and eight fingers" />
+ <title>Design of the libstdc++ debug mode</title>
+<link rel="StyleSheet" href="lib3styles.css" />
+</head>
+<body>
+
+<h1 class="centered"><a name="top">Design of the libstdc++ debug mode</a></h1>
+
+<p class="fineprint"><em>
+ The latest version of this document is always available at
+ <a href="http://gcc.gnu.org/onlinedocs/libstdc++/debug_mode.html">
+ http://gcc.gnu.org/onlinedocs/libstdc++/debug_mode.html</a>.
+</em></p>
+
+<p><em>
+ To the <a href="http://gcc.gnu.org/libstdc++/">libstdc++ homepage</a>.
+</em></p>
+
+
+<!-- ####################################################### -->
+
+<hr />
+<h1>Debug mode design</h1>
+<p> The libstdc++ debug mode replaces unsafe (but efficient) standard
+ containers and iterators with semantically equivalent safe standard
+ containers and iterators to aid in debugging user programs. The
+ following goals directed the design of the libstdc++ debug mode:</p>
+
+ <ul>
+
+ <li><b>Correctness</b>: the libstdc++ debug mode must not change
+ the semantics of the standard library for all cases specified in
+ the ANSI/ISO C++ standard. The essence of this constraint is that
+ any valid C++ program should behave in the same manner regardless
+ of whether it is compiled with debug mode or release mode. In
+ particular, entities that are defined in namespace std in release
+ mode should remain defined in namespace std in debug mode, so that
+ legal specializations of namespace std entities will remain
+ valid. A program that is not valid C++ (e.g., invokes undefined
+ behavior) is not required to behave similarly, although the debug
+ mode will abort with a diagnostic when it detects undefined
+ behavior.</li>
+
+ <li><b>Performance</b>: the additional of the libstdc++ debug mode
+ must not affect the performance of the library when it is compiled
+ in release mode. Performance of the libstdc++ debug mode is
+ secondary (and, in fact, will be worse than the release
+ mode).</li>
+
+ <li><b>Usability</b>: the libstdc++ debug mode should be easy to
+ use. It should be easily incorporated into the user's development
+ environment (e.g., by requiring only a single new compiler switch)
+ and should produce reasonable diagnostics when it detects a
+ problem with the user program. Usability also involves detection
+ of errors when using the debug mode incorrectly, e.g., by linking
+ a release-compiled object against a debug-compiled object if in
+ fact the resulting program will not run correctly.</li>
+
+ <li><b>Minimize recompilation</b>: While it is expected that
+ users recompile at least part of their program to use debug
+ mode, the amount of recompilation affects the
+ detect-compile-debug turnaround time. This indirectly affects the
+ usefulness of the debug mode, because debugging some applications
+ may require rebuilding a large amount of code, which may not be
+ feasible when the suspect code may be very localized. There are
+ several levels of conformance to this requirement, each with its
+ own usability and implementation characteristics. In general, the
+ higher-numbered conformance levels are more usable (i.e., require
+ less recompilation) but are more complicated to implement than
+ the lower-numbered conformance levels.
+ <ol>
+ <li><b>Full recompilation</b>: The user must recompile his or
+ her entire application and all C++ libraries it depends on,
+ including the C++ standard library that ships with the
+ compiler. This must be done even if only a small part of the
+ program can use debugging features.</li>
+
+ <li><b>Full user recompilation</b>: The user must recompile
+ his or her entire application and all C++ libraries it depends
+ on, but not the C++ standard library itself. This must be done
+ even if only a small part of the program can use debugging
+ features. This can be achieved given a full recompilation
+ system by compiling two versions of the standard library when
+ the compiler is installed and linking against the appropriate
+ one, e.g., a multilibs approach.</li>
+
+ <li><b>Partial recompilation</b>: The user must recompile the
+ parts of his or her application and the C++ libraries it
+ depends on that will use the debugging facilities
+ directly. This means that any code that uses the debuggable
+ standard containers would need to be recompiled, but code
+ that does not use them (but may, for instance, use IOStreams)
+ would not have to be recompiled.</li>
+
+ <li><b>Per-use recompilation</b>: The user must recompile the
+ parts of his or her application and the C++ libraries it
+ depends on where debugging should occur, and any other code
+ that interacts with those containers. This means that a set of
+ translation units that accesses a particular standard
+ container instance may either be compiled in release mode (no
+ checking) or debug mode (full checking), but must all be
+ compiled in the same way; a translation unit that does not see
+ that standard container instance need not be recompiled. This
+ also means that a translation unit <em>A</em> that contains a
+ particular instantiation
+ (say, <code>std::vector<int></code>) compiled in release
+ mode can be linked against a translation unit <em>B</em> that
+ contains the same instantiation compiled in debug mode (a
+ feature not present with partial recompilation). While this
+ behavior is technically a violation of the One Definition
+ Rule, this ability tends to be very important in
+ practice. The libstdc++ debug mode supports this level of
+ recompilation. </li>
+
+ <li><b>Per-unit recompilation</b>: The user must only
+ recompile the translation units where checking should occur,
+ regardless of where debuggable standard containers are
+ used. This has also been dubbed "<code>-g</code> mode",
+ because the <code>-g</code> compiler switch works in this way,
+ emitting debugging information at a per--translation-unit
+ granularity. We believe that this level of recompilation is in
+ fact not possible if we intend to supply safe iterators, leave
+ the program semantics unchanged, and not regress in
+ performance under release mode because we cannot associate
+ extra information with an iterator (to form a safe iterator)
+ without either reserving that space in release mode
+ (performance regression) or allocating extra memory associated
+ with each iterator with <code>new</code> (changes the program
+ semantics).</li>
+ </ol>
+ </li>
+ </ul>
+
+<h2><a name="other">Other implementations</a></h2>
+<p> There are several existing implementations of debug modes for C++
+ standard library implementations, although none of them directly
+ supports debugging for programs using libstdc++. The existing
+ implementations include:</p>
+<ul>
+ <li><a
+ href="http://www.mathcs.sjsu.edu/faculty/horstman/safestl.html">SafeSTL</a>:
+ SafeSTL was the original debugging version of the Standard Template
+ Library (STL), implemented by Cay S. Horstmann on top of the
+ Hewlett-Packard STL. Though it inspired much work in this area, it
+ has not been kept up-to-date for use with modern compilers or C++
+ standard library implementations.</li>
+
+ <li><a href="http://www.stlport.org/">STLport</a>: STLport is a free
+ implementation of the C++ standard library derived from the <a
+ href="http://www.sgi.com/tech/stl/">SGI implementation</a>, and
+ ported to many other platforms. It includes a debug mode that uses a
+ wrapper model (that in some way inspired the libstdc++ debug mode
+ design), although at the time of this writing the debug mode is
+ somewhat incomplete and meets only the "Full user recompilation" (2)
+ recompilation guarantee by requiring the user to link against a
+ different library in debug mode vs. release mode.</li>
+
+ <li><a href="http://www.metrowerks.com/mw/default.htm">Metrowerks
+ CodeWarrior</a>: The C++ standard library that ships with Metrowerks
+ CodeWarrior includes a debug mode. It is a full debug-mode
+ implementation (including debugging for CodeWarrior extensions) and
+ is easy to use, although it meets only the "Full recompilation" (1)
+ recompilation guarantee.</li>
+</ul>
+
+<h2><a name="design">Debug mode design methodology</a></h2>
+<p>This section provides an overall view of the design of the
+ libstdc++ debug mode and details the relationship between design
+ decisions and the stated design goals.</p>
+
+<h3><a name="wrappers">The wrapper model</a></h3>
+<p>The libstdc++ debug mode uses a wrapper model where the debugging
+ versions of library components (e.g., iterators and containers) form
+ a layer on top of the release versions of the library
+ components. The debugging components first verify that the operation
+ is correct (aborting with a diagnostic if an error is found) and
+ will then forward to the underlying release-mode container that will
+ perform the actual work. This design decision ensures that we cannot
+ regress release-mode performance (because the release-mode
+ containers are left untouched) and partially enables <a
+ href="#mixing">mixing debug and release code</a> at link time,
+ although that will not be discussed at this time.</p>
+
+<p>Two types of wrappers are used in the implementation of the debug
+ mode: container wrappers and iterator wrappers. The two types of
+ wrappers interact to maintain relationships between iterators and
+ their associated containers, which are necessary to detect certain
+ types of standard library usage errors such as dereferencing
+ past-the-end iterators or inserting into a container using an
+ iterator from a different container.</p>
+
+<h4><a name="safe_iterator">Safe iterators</a></h4>
+<p>Iterator wrappers provide a debugging layer over any iterator that
+ is attached to a particular container, and will manage the
+ information detailing the iterator's state (singular,
+ dereferenceable, etc.) and tracking the container to which the
+ iterator is attached. Because iterators have a well-defined, common
+ interface the iterator wrapper is implemented with the iterator
+ adaptor class template <code>__gnu_debug::_Safe_iterator</code>,
+ which takes two template parameters:</p>
+
+<ul>
+ <li><code>Iterator</code>: The underlying iterator type, which must
+ be either the <code>iterator</code> or <code>const_iterator</code>
+ typedef from the sequence type this iterator can reference.</li>
+
+ <li><code>Sequence</code>: The type of sequence that this iterator
+ references. This sequence must be a safe sequence (discussed below)
+ whose <code>iterator</code> or <code>const_iterator</code> typedef
+ is the type of the safe iterator.</li>
+</ul>
+
+<h4><a name="safe_sequence">Safe sequences (containers)</a></h4>
+<p>Container wrappers provide a debugging layer over a particular
+ container type. Because containers vary greatly in the member
+ functions they support and the semantics of those member functions
+ (especially in the area of iterator invalidation), container
+ wrappers are tailored to the container they reference, e.g., the
+ debugging version of <code>std::list</code> duplicates the entire
+ interface of <code>std::list</code>, adding additional semantic
+ checks and then forwarding operations to the
+ real <code>std::list</code> (a public base class of the debugging
+ version) as appropriate. However, all safe containers inherit from
+ the class template <code>__gnu_debug::_Safe_sequence</code>,
+ instantiated with the type of the safe container itself (an instance
+ of the curiously recurring template pattern).</p>
+
+<p>The iterators of a container wrapper will be
+ <a href="#safe_iterator">safe iterators</a> that reference sequences
+ of this type and wrap the iterators provided by the release-mode
+ base class. The debugging container will use only the safe
+ iterators within its own interface (therefore requiring the user to
+ use safe iterators, although this does not change correct user
+ code) and will communicate with the release-mode base class with
+ only the underlying, unsafe, release-mode iterators that the base
+ class exports.</p>
+
+<p> The debugging version of <code>std::list</code> will have the
+ following basic structure:</p>
+
+<pre>
+template<typename _Tp, typename _Allocator = allocator<_Tp>
+ class debug-list :
+ public release-list<_Tp, _Allocator>,
+ public __gnu_debug::_Safe_sequence<debug-list<_Tp, _Allocator> >
+ {
+ typedef release-list<_Tp, _Allocator> _Base;
+ typedef debug-list<_Tp, _Allocator> _Self;
+
+ public:
+ typedef __gnu_debug::_Safe_iterator<typename _Base::iterator, _Self> iterator;
+ typedef __gnu_debug::_Safe_iterator<typename _Base::const_iterator, _Self> const_iterator;
+
+ // duplicate std::list interface with debugging semantics
+ };
+</pre>
+
+<h3><a name="precondition">Precondition checking</a></h3>
+<p>The debug mode operates primarily by checking the preconditions of
+ all standard library operations that it supports. Preconditions that
+ are always checked (regardless of whether or not we are in debug
+ mode) are checked via the <code>__check_xxx</code> macros defined
+ and documented in the source
+ file <code>include/debug/debug.h</code>. Preconditions that may or
+ may not be checked, depending on the debug-mode
+ macro <code>_GLIBCXX_DEBUG</code>, are checked via
+ the <code>__requires_xxx</code> macros defined and documented in the
+ same source file. Preconditions are validated using any additional
+ information available at run-time, e.g., the containers that are
+ associated with a particular iterator, the position of the iterator
+ within those containers, the distance between two iterators that may
+ form a valid range, etc. In the absence of suitable information,
+ e.g., an input iterator that is not a safe iterator, these
+ precondition checks will silently succeed.</p>
+
+<p>The majority of precondition checks use the aforementioned macros,
+ which have the secondary benefit of having prewritten debug
+ messages that use information about the current status of the
+ objects involved (e.g., whether an iterator is singular or what
+ sequence it is attached to) along with some static information
+ (e.g., the names of the function parameters corresponding to the
+ objects involved). When not using these macros, the debug mode uses
+ either the debug-mode assertion
+ macro <code>_GLIBCXX_DEBUG_ASSERT</code> , its pedantic
+ cousin <code>_GLIBCXX_DEBUG_PEDASSERT</code>, or the assertion
+ check macro that supports more advance formulation of error
+ messages, <code>_GLIBCXX_DEBUG_VERIFY</code>. These macros are
+ documented more thoroughly in the debug mode source code.</p>
+
+<h3><a name="coexistence">Release- and debug-mode coexistence</a></h3>
+<p>The libstdc++ debug mode is the first debug mode we know of that
+ is able to provide the "Per-use recompilation" (4) guarantee, that
+ 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
+ extension to the GNU C++ compiler (described in the GCC Manual for
+ C++ Extensions, see <a
+ href="http://gcc.gnu.org/onlinedocs/gcc/Strong-Using.html">strong
+ using</a>), and a complex organization of debug- and
+ release-modes. The end result is that we have achieved per-use
+ recompilation but have had to give up some checking of the
+ <code>std::basic_string</code> class template (namely, safe
+ iterators).
+</p>
+
+<h4><a name="compile_coexistence">Compile-time coexistence of release- and
+ debug-mode components</a></h4>
+<p>Both the release-mode components and the debug-mode
+ components need to exist within a single translation unit so that
+ the debug versions can wrap the release versions. However, only one
+ of these components should be user-visible at any particular
+ time with the standard name, e.g., <code>std::list</code>. </p>
+
+<p>In release mode, we define only the release-mode version of the
+ component with its standard name and do not include the debugging
+ component at all. The release mode version is defined within the
+ namespace <code>std</code>. Minus the namespace associations, this
+ method leaves the behavior of release mode completely unchanged from
+ its behavior prior to the introduction of the libstdc++ debug
+ mode. Here's an example of what this ends up looking like, in
+ C++.</p>
+
+<pre>
+namespace std
+{
+ template<typename _Tp, typename _Alloc = allocator<_Tp> >
+ class list
+ {
+ // ...
+ };
+} // namespace std
+</pre>
+
+<p>In debug mode we include the release-mode container (which is now
+defined in in the namespace <code>__norm</code>) and also the
+debug-mode container. The debug-mode container is defined within the
+namespace <code>__debug</code>, which is associated with namespace
+<code>std</code> via the GNU namespace association extension. This
+method allows the debug and release versions of the same component to
+coexist at compile-time and link-time without causing an unreasonable
+maintenance burden, while minimizing confusion. Again, this boils down
+to C++ code as follows:</p>
+
+<pre>
+namespace std
+{
+ namespace __norm
+ {
+ template<typename _Tp, typename _Alloc = allocator<_Tp> >
+ class list
+ {
+ // ...
+ };
+ } // namespace __gnu_norm
+
+ namespace __debug
+ {
+ template<typename _Tp, typename _Alloc = allocator<_Tp> >
+ class list
+ : public __norm::list<_Tp, _Alloc>,
+ public __gnu_debug::_Safe_sequence<list<_Tp, _Alloc> >
+ {
+ // ...
+ };
+ } // namespace __norm
+
+ using namespace __debug __attribute__ ((strong));
+}
+</pre>
+
+<h4><a name="mixing">Link- and run-time coexistence of release- and
+ debug-mode components</a></h4>
+
+<p>Because each component has a distinct and separate release and
+debug implementation, there are are no issues with link-time
+coexistence: the separate namespaces result in different mangled
+names, and thus unique linkage.</p>
+
+<p>However, components that are defined and used within the C++
+standard library itself face additional constraints. For instance,
+some of the member functions of <code> std::moneypunct</code> return
+<code>std::basic_string</code>. Normally, this is not a problem, but
+with a mixed mode standard library that could be using either
+debug-mode or release-mode <code> basic_string</code> objects, things
+get more complicated. As the return value of a function is not
+encoded into the mangled name, there is no way to specify a
+release-mode or a debug-mode string. In practice, this results in
+runtime errors. A simplified example of this problem is as follows.
+</p>
+
+<p> Take this translation unit, compiled in debug-mode: </p>
+<pre>
+// -D_GLIBCXX_DEBUG
+#include <string>
+
+std::string test02();
+
+std::string test01()
+{
+ return test02();
+}
+
+int main()
+{
+ test01();
+ return 0;
+}
+</pre>
+
+<p> ... and linked to this translation unit, compiled in release mode:</p>
+
+<pre>
+#include <string>
+
+std::string
+test02()
+{
+ return std::string("toast");
+}
+</pre>
+
+<p> For this reason we cannot easily provide safe iterators for
+ the <code>std::basic_string</code> class template, as it is present
+ throughout the C++ standard library. For instance, locale facets
+ define typedefs that include <code>basic_string</code>: in a mixed
+ debug/release program, should that typedef be based on the
+ debug-mode <code>basic_string</code> or the
+ release-mode <code>basic_string</code>? While the answer could be
+ "both", and the difference hidden via renaming a la the
+ debug/release containers, we must note two things about locale
+ facets:</p>
+
+<ol>
+ <li>They exist as shared state: one can create a facet in one
+ translation unit and access the facet via the same type name in a
+ different translation unit. This means that we cannot have two
+ different versions of locale facets, because the types would not be
+ the same across debug/release-mode translation unit barriers.</li>
+
+ <li>They have virtual functions returning strings: these functions
+ mangle in the same way regardless of the mangling of their return
+ types (see above), and their precise signatures can be relied upon
+ by users because they may be overridden in derived classes.</li>
+</ol>
+
+<p>With the design of libstdc++ debug mode, we cannot effectively hide
+ the differences between debug and release-mode strings from the
+ user. Failure to hide the differences may result in unpredictable
+ behavior, and for this reason we have opted to only
+ perform <code>basic_string</code> changes that do not require ABI
+ changes. The effect on users is expected to be minimal, as there are
+ simple alternatives (e.g., <code>__gnu_debug::basic_string</code>),
+ and the usability benefit we gain from the ability to mix debug- and
+ release-compiled translation units is enormous.</p>
+
+<h4><a name="coexistence_alt">Alternatives for Coexistence</a></h4>
+<p>The coexistence scheme above was chosen over many alternatives,
+ including language-only solutions and solutions that also required
+ extensions to the C++ front end. The following is a partial list of
+ solutions, with justifications for our rejection of each.</p>
+
+<ul>
+ <li><em>Completely separate debug/release libraries</em>: This is by
+ far the simplest implementation option, where we do not allow any
+ coexistence of debug- and release-compiled translation units in a
+ program. This solution has an extreme negative affect on usability,
+ because it is quite likely that some libraries an application
+ depends on cannot be recompiled easily. This would not meet
+ our <b>usability</b> or <b>minimize recompilation</b> criteria
+ well.</li>
+
+ <li><em>Add a <code>Debug</code> boolean template parameter</em>:
+ Partial specialization could be used to select the debug
+ implementation when <code>Debug == true</code>, and the state
+ of <code>_GLIBCXX_DEBUG</code> could decide whether the
+ default <code>Debug</code> argument is <code>true</code>
+ or <code>false</code>. This option would break conformance with the
+ C++ standard in both debug <em>and</em> release modes. This would
+ not meet our <b>correctness</b> criteria. </li>
+
+ <li><em>Packaging a debug flag in the allocators</em>: We could
+ reuse the <code>Allocator</code> template parameter of containers
+ by adding a sentinel wrapper <code>debug<></code> that
+ signals the user's intention to use debugging, and pick up
+ the <code>debug<></code> allocator wrapper in a partial
+ specialization. However, this has two drawbacks: first, there is a
+ conformance issue because the default allocator would not be the
+ standard-specified <code>std::allocator<T></code>. Secondly
+ (and more importantly), users that specify allocators instead of
+ implicitly using the default allocator would not get debugging
+ containers. Thus this solution fails the <b>correctness</b>
+ criteria.</li>
+
+ <li><em>Define debug containers in another namespace, and employ
+ a <code>using</code> declaration (or directive)</em>: This is an
+ enticing option, because it would eliminate the need for
+ the <code>link_name</code> extension by aliasing the
+ templates. However, there is no true template aliasing mechanism
+ is C++, because both <code>using</code> directives and using
+ declarations disallow specialization. This method fails
+ the <b>correctness</b> criteria.</li>
+
+ <li><em> Use implementation-specific properties of anonymous
+ namespaces. </em>
+ See <a
+ href="http://gcc.gnu.org/ml/libstdc++/2003-08/msg00004.html"> this post
+ </a>
+ This method fails the <b>correctness</b> criteria.</li>
+
+ <li><em>Extension: allow reopening on namespaces</em>: This would
+ allow the debug mode to effectively alias the
+ namespace <code>std</code> to an internal namespace, such
+ as <code>__gnu_std_debug</code>, so that it is completely
+ separate from the release-mode <code>std</code> namespace. While
+ this will solve some renaming problems and ensure that
+ debug- and release-compiled code cannot be mixed unsafely, it ensures that
+ debug- and release-compiled code cannot be mixed at all. For
+ instance, the program would have two <code>std::cout</code>
+ objects! This solution would fails the <b>minimize
+ recompilation</b> requirement, because we would only be able to
+ support option (1) or (2).</li>
+
+ <li><em>Extension: use link name</em>: This option involves
+ complicated re-naming between debug-mode and release-mode
+ components at compile time, and then a g++ extension called <em>
+ link name </em> to recover the original names at link time. There
+ are two drawbacks to this approach. One, it's very verbose,
+ relying on macro renaming at compile time and several levels of
+ include ordering. Two, ODR issues remained with container member
+ functions taking no arguments in mixed-mode settings resulting in
+ equivalent link names, <code> vector::push_back() </code> being
+ one example.
+ See <a
+ href="http://gcc.gnu.org/ml/libstdc++/2003-08/msg00177.html">link
+ name</a> </li>
+</ul>
+
+<p>Other options may exist for implementing the debug mode, many of
+ which have probably been considered and others that may still be
+ lurking. This list may be expanded over time to include other
+ options that we could have implemented, but in all cases the full
+ ramifications of the approach (as measured against the design goals
+ for a libstdc++ debug mode) should be considered first. The DejaGNU
+ testsuite includes some testcases that check for known problems with
+ some solutions (e.g., the <code>using</code> declaration solution
+ that breaks user specialization), and additional testcases will be
+ added as we are able to identify other typical problem cases. These
+ test cases will serve as a benchmark by which we can compare debug
+ mode implementations.</p>
+
+<!-- ####################################################### -->
+
+<hr />
+<p class="fineprint"><em>
+See <a href="17_intro/license.html">license.html</a> for copying conditions.
+Comments and suggestions are welcome, and may be sent to
+<a href="mailto:libstdc++@gcc.gnu.org">the libstdc++ mailing list</a>.
+</em></p>
+
+
+</body>
+</html>
<meta name="KEYWORDS" content="HOWTO, libstdc++, GCC, g++, libg++, STL" />
<meta name="DESCRIPTION" content="Notes for the libstdc++ extensions." />
<meta name="GENERATOR" content="vi and eight fingers" />
- <title>libstdc++-v3 HOWTO: Extensions</title>
+ <title>libstdc++ HOWTO: Extensions</title>
<link rel="StyleSheet" href="../lib3styles.css" type="text/css" />
<link rel="Start" href="../documentation.html" type="text/html"
title="GNU C++ Standard Library" />
existence, of these extensions may change with little or no
warning. (Ideally, the really good ones will appear in the next
revision of C++.) Also, other platforms, other compilers, other
- versions of g++ or libstdc++-v3 may not recognize these names, or
+ versions of g++ or libstdc++ may not recognize these names, or
treat them differently, or... </li>
<li>You should know how to <a href="../faq/index.html#5_4">access
these headers properly</a>. </li>
<hr />
<h2><a name="4">Compile-time checks</a></h2>
- <p>Currently libstdc++-v3 uses the concept checkers from the Boost
+ <p>Currently libstdc++ uses the concept checkers from the Boost
library to perform <a href="../19_diagnostics/howto.html#3">optional
compile-time checking</a> of template instantiations of the standard
containers. They are described in the linked-to page.
for making changes to the library. They periodically publish an
Issues List containing problems and possible solutions. As they reach
a consensus on proposed solutions, we often incorporate the solution
- into libstdc++-v3.
+ into libstdc++.
</p>
<p>Here are the issues which have resulted in code changes to the library.
The links are to the specific defect reports from a <strong>partial
</em></p>
<p><em>
- To the <a href="http://gcc.gnu.org/libstdc++/">libstdc++-v3 homepage</a>.
+ To the <a href="http://gcc.gnu.org/libstdc++/">libstdc++ homepage</a>.
</em></p>
<!-- ####################################################### -->
--- /dev/null
+<?xml version="1.0" encoding="ISO-8859-1"?>
+<!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" xml:lang="en" lang="en">
+<head>
+ <meta name="AUTHOR" content="bkoz@gcc.gnu.org (Benjamin Kosnik)" />
+ <meta name="KEYWORDS" content="c++, libstdc++, gdb, g++, debug" />
+ <meta name="DESCRIPTION" content="The libstdc++ parallel mode." />
+ <meta name="GENERATOR" content="emacs and ten fingers" />
+ <title>The libstdc++ parallel mode</title>
+<link rel="StyleSheet" href="lib3styles.css" type="text/css" />
+<link rel="Copyright" href="17_intro/license.html" type="text/html" />
+</head>
+<body>
+
+<h1 class="centered"><a name="top">The libstdc++ parallel mode</a></h1>
+
+<p class="fineprint"><em>
+ The latest version of this document is always available at
+ <a href="http://gcc.gnu.org/onlinedocs/libstdc++/parallel_mode.html">
+ http://gcc.gnu.org/onlinedocs/libstdc++/parallel_mode.html</a>.
+</em></p>
+
+<p><em>
+ To the <a href="http://gcc.gnu.org/libstdc++/">libstdc++ homepage</a>.
+</em></p>
+
+<!-- ####################################################### -->
+<hr />
+<p> The libstdc++ parallel mode is an experimental parallel
+implementation of many algorithms the C++ Standard Library.
+</p>
+
+<p>
+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.
+</p>
+
+<h3 class="left"><a name="parallel">The libstdc++ parallel mode</a></h3>
+
+<p>The libstdc++ parallel mode performs parallelization of algorithms,
+function objects, classes, and functions in the C++ Standard.</p>
+
+<h4 class="left">Using the libstdc++ parallel mode</h4>
+
+<p>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 <a
+ href="http://gcc.gnu.org/onlinedocs/libgomp">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>-march=i686</code>,
+ <code>-march=native</code> or <code>-mcpu=v9</code>.
+</p>
+
+<p>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.</p>
+
+
+<p>The following library components in the include
+<code><numeric></code> are included in the parallel mode:</p>
+<ul>
+ <li><code>std::accumulate</code></li>
+ <li><code>std::adjacent_difference</code></li>
+ <li><code>std::inner_product</code></li>
+ <li><code>std::partial_sum</code></li>
+</ul>
+
+<p>The following library components in the include
+<code><algorithm></code> are included in the parallel mode:</p>
+<ul>
+ <li><code>std::adjacent_find</code></li>
+ <li><code>std::count</code></li>
+ <li><code>std::count_if</code></li>
+ <li><code>std::equal</code></li>
+ <li><code>std::find</code></li>
+ <li><code>std::find_if</code></li>
+ <li><code>std::find_first_of</code></li>
+ <li><code>std::for_each</code></li>
+ <li><code>std::generate</code></li>
+ <li><code>std::generate_n</code></li>
+ <li><code>std::lexicographical_compare</code></li>
+ <li><code>std::mismatch</code></li>
+ <li><code>std::search</code></li>
+ <li><code>std::search_n</code></li>
+ <li><code>std::transform</code></li>
+ <li><code>std::replace</code></li>
+ <li><code>std::replace_if</code></li>
+ <li><code>std::max_element</code></li>
+ <li><code>std::merge</code></li>
+ <li><code>std::min_element</code></li>
+ <li><code>std::nth_element</code></li>
+ <li><code>std::partial_sort</code></li>
+ <li><code>std::partition</code></li>
+ <li><code>std::random_shuffle</code></li>
+ <li><code>std::set_union</code></li>
+ <li><code>std::set_intersection</code></li>
+ <li><code>std::set_symmetric_difference</code></li>
+ <li><code>std::set_difference</code></li>
+ <li><code>std::sort</code></li>
+ <li><code>std::stable_sort</code></li>
+ <li><code>std::unique_copy</code></li>
+</ul>
+
+<p>The following library components in the includes
+<code><set></code> and <code><map></code> are included in the parallel mode:</p>
+<ul>
+ <li><code>std::(multi_)map/set<T>::(multi_)map/set(Iterator begin, Iterator end)</code> (bulk construction)</li>
+ <li><code>std::(multi_)map/set<T>::insert(Iterator begin, Iterator end)</code> (bulk insertion)</li>
+</ul>
+
+
+<h4 class="left">Using the parallel algorithms without parallel mode</h4>
+
+<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
+ drop-in algorithms used in parallel mode, but they are available in
+ a separate namespace as GNU extensions and may be used in programs
+ compiled with either release mode or with parallel mode. The
+ following table provides the names and headers of the parallel
+ algorithms:
+</p>
+
+
+<table title="Parallel algorithms" border="1">
+ <tr>
+ <th>Algorithm</th>
+ <th>Header</th>
+ <th>Parallel algorithm</th>
+ <th>Parallel header</th>
+ </tr>
+ <tr>
+ <td>std::accumulate</td>
+ <td><numeric></td>
+ <td>__gnu_parallel::accumulate</td>
+ <td><parallel/numeric></td>
+ </tr>
+ <tr>
+ <td>std::adjacent_difference</td>
+ <td><numeric></td>
+ <td>__gnu_parallel::adjacent_difference</td>
+ <td><parallel/numeric></td>
+ </tr>
+ <tr>
+ <td>std::inner_product</td>
+ <td><numeric></td>
+ <td>__gnu_parallel::inner_product</td>
+ <td><parallel/numeric></td>
+ </tr>
+ <tr>
+ <td>std::partial_sum</td>
+ <td><numeric></td>
+ <td>__gnu_parallel::partial_sum</td>
+ <td><parallel/numeric></td>
+ </tr>
+ <tr>
+ <td>std::adjacent_find</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::adjacent_find</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::count</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::count</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::count_if</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::count_if</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::equal</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::equal</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::find</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::find</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::find_if</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::find_if</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::find_first_of</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::find_first_of</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::for_each</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::for_each</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::generate</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::generate</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::generate_n</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::generate_n</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::lexicographical_compare</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::lexicographical_compare</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::mismatch</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::mismatch</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::search</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::search</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::search_n</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::search_n</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::transform</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::transform</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::replace</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::replace</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::replace_if</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::replace_if</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::max_element</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::max_element</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::merge</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::merge</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::min_element</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::min_element</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::nth_element</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::nth_element</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::partial_sort</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::partial_sort</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::partition</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::partition</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::random_shuffle</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::random_shuffle</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::set_union</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::set_union</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::set_intersection</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::set_intersection</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::set_symmetric_difference</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::set_symmetric_difference</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::set_difference</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::set_difference</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::sort</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::sort</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::stable_sort</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::stable_sort</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+ <tr>
+ <td>std::unique_copy</td>
+ <td><algorithm></td>
+ <td>__gnu_parallel::unique_copy</td>
+ <td><parallel/algorithm></td>
+ </tr>
+
+</table>
+
+
+<h4 class="left">Parallel mode semantics</h4>
+
+<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
+concurrent threads, either.
+It might work with other compilers, though.</p>
+
+
+<h4 class="left">Configuration and Tuning</h4>
+
+<p> Some algorithm variants can be enabled/disabled/selected at compile-time.
+See <a href="latest-doxygen/compiletime__settings_8h.html">
+<code><compiletime_settings.h></code></a> and
+See <a href="latest-doxygen/compiletime__settings_8h.html">
+<code><features.h></code></a> for details.
+</p>
+
+<p>
+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.
+</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>__gnu_parallel::Settings::[algorithm]_minimal_n</code>.
+Please see <a href="latest-doxygen/settings_8h.html">
+<code><settings.h></code><a> for details.</p>
+
+
+
+<h4 class="left">Interface basics and general design</h4>
+
+<p>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:
+
+<pre>
+namespace std
+{
+ template<typename _FIter>
+ _FIter
+ adjacent_find(_FIter, _FIter);
+}
+</pre>
+
+Which means that there should be something equivalent for the parallel
+version. Indeed, this is the case:
+
+<pre>
+namespace std
+{
+ namespace __parallel
+ {
+ template<typename _FIter>
+ _FIter
+ adjacent_find(_FIter, _FIter);
+
+ ...
+ }
+}
+</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>__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>.
+</p>
+
+<p> 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>.
+</p>
+
+<p> Putting all this together, the general view of overloads for the
+parallel algorithms look like this:
+<p>
+<ul>
+ <li>ISO C++ signature</li>
+ <li>ISO C++ signature + sequential_tag argument</li>
+ <li>ISO C++ signature + parallelism argument</li>
+</ul>
+
+<p> Please note that the implementation may use additional functions
+(designated with the <code>_switch</code> suffix) to dispatch from the
+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>
+
+
+<h4 class="left">Relevant namespaces</h4>
+
+<p> One namespace contain versions of code that are explicitly sequential:
+<code>__gnu_serial</code>.
+</p>
+
+<p> Two namespaces contain the parallel mode:
+<code>std::__parallel</code> and <code>__gnu_parallel</code>.
+</p>
+
+<p> 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
+<algorithm> has a parallel counterpart in
+<code>std::__parallel::transform</code> from
+<parallel/algorithm>. In addition, these parallel
+implementations are injected into <code>namespace
+__gnu_parallel</code> with using declarations.
+</p>
+
+<p> Support and general infrastructure is in <code>namespace
+__gnu_parallel</code>.
+</p>
+
+<p> More information, and an organized index of types and functions
+related to the parallel mode on a per-namespace basis, can be found in
+the generated source documentation.
+</p>
+
+<h4 class="left">Testing</h4>
+
+<p> Both the normal conformance and regression tests and the
+supplemental performance tests work.</p>
+
+<p> To run the conformance and regression tests with the parallel mode
+active,</p>
+<code>make check-parallel</code>
+
+<p>The log and summary files for conformance testing are in the
+<code>testsuite/parallel</code> directory.</p>
+
+<p> To run the performance tests with the parallel mode active, </p>
+<code>make check-performance-parallel</code>
+
+<p>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 doc-performance</code> rule in the
+testsuite's Makefile.</p>
+
+<p>Return <a href="#top">to the top of the page</a> or
+ <a href="http://gcc.gnu.org/libstdc++/">to the libstdc++ homepage</a>.
+</p>
+
+
+<h4 class="left">References / Further Reading</h4>
+
+<p>
+Johannes Singler, Peter Sanders, Felix Putze. The Multi-Core Standard Template Library. Euro-Par 2007: Parallel Processing. (LNCS 4641)
+</p>
+
+<p>
+Leonor Frias, Johannes Singler: Parallelization of Bulk Operations for STL Dictionaries. Workshop on Highly Parallel Processing on a Chip (HPPC) 2007. (LNCS)
+</p>
+
+<!-- ####################################################### -->
+
+<hr />
+<p class="fineprint"><em>
+See <a href="17_intro/license.html">license.html</a> for copying conditions.
+Comments and suggestions are welcome, and may be sent to
+<a href="mailto:libstdc++@gcc.gnu.org">the libstdc++ mailing list</a>.
+</em></p>
+
+
+</body>
+</html>
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
<head>
<meta name="AUTHOR" content="pme@gcc.gnu.org (Phil Edwards)" />
- <meta name="KEYWORDS" content="libstdc++, libstdc++-v3, GCC, g++, STL, SGI" />
- <meta name="DESCRIPTION" content="SGI extensions preserved in libstdc++-v3." />
+ <meta name="KEYWORDS" content="libstdc++, libstdc++, GCC, g++, STL, SGI" />
+ <meta name="DESCRIPTION" content="SGI extensions preserved in libstdc++." />
<meta name="GENERATOR" content="vi and eight fingers" />
- <title>SGI extensions to the library in libstdc++-v3</title>
+ <title>SGI extensions to the library in libstdc++</title>
<link rel="StyleSheet" href="../lib3styles.css" type="text/css" />
<link rel="Start" href="../documentation.html" type="text/html"
title="GNU C++ Standard Library" />
<body>
<h1 class="centered"><a name="top">SGI extensions to the library in
-libstdc++-v3</a></h1>
+libstdc++</a></h1>
<p>This page describes the extensions that SGI made to their version of the
STL subset of the Standard C++ Library. For a time we
documentation, buy a copy of Matt Austern's book. *grin*
</p>
-<p>Back to the <a href="howto.html">libstdc++-v3 extensions</a>.
+<p>Back to the <a href="howto.html">libstdc++ extensions</a>.
</p>
+++ /dev/null
-<?xml version="1.0" encoding="ISO-8859-1"?>
-<!DOCTYPE html
- PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
- "DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-
-<head>
-
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1" />
- <link rev="made" href="mailto:gcc@gcc.gnu.org" />
- <link rel="shortcut icon" href="http://gcc.gnu.org/favicon.ico" />
-
- <title>
- Status of TR1 features in GCC
- - GNU Project - Free Software Foundation (FSF)
- </title>
-
-</head>
-
-<body>
-
-<h1 align="center">
- Status of TR1 features in GCC
-</h1>
-
-<p>
-This table is based on the table of contents of ISO/IEC DTR 19768
-Doc No: N1836=05-0096 Date: 2005-06-24
-Draft Technical Report on C++ Library Extensions
-</p>
-
-<p>
-In this implementation the header names are prefixed by
-<code>tr1/</code>, for instance <code><tr1/functional></code>,
-<code><tr1/memory></code>, and so on.
-</p>
-
-<p>
-This page describes the TR1 support in mainline GCC SVN, not in any particular
-release.
-</p>
-
-<table border="1">
- <thead>
- <tr>
- <td><span style="font-weight: bold;">Section</span></td>
- <td><span style="font-weight: bold;">Description</span></td>
- <td><span style="font-weight: bold;">Done</span></td>
- <td><span style="font-weight: bold;">Broken</span></td>
- <td><span style="font-weight: bold;">Missing</span></td>
- <td><span style="font-weight: bold;">Comments</span></td>
- </tr>
- </thead>
- <tbody>
- <tr>
- <td><b>2</b></td>
- <td colspan="5"><b>General Utilities</b></td>
- </tr>
- <tr>
- <td>2.1</td>
- <td>Reference wrappers</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.1.1</td>
- <td>Additions to header <code><functional></code> synopsis</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.1.2</td>
- <td>Class template <code>reference_wrapper</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.1.2.1</td>
- <td><code>reference_wrapper</code> construct/copy/destroy</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.1.2.2</td>
- <td><code>reference_wrapper</code> assignment</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.1.2.3</td>
- <td><code>reference_wrapper</code> access</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.1.2.4</td>
- <td><code>reference_wrapper</code> invocation</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.1.2.5</td>
- <td><code>reference_wrapper</code> helper functions</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.2</td>
- <td>Smart pointers</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.2.1</td>
- <td>Additions to header <code><memory></code> synopsis</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.2.2</td>
- <td>Class <code>bad_weak_ptr</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.2.3</td>
- <td>Class template <code>shared_ptr</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td><a href="tr1.html#1">1</a></td>
- </tr>
- <tr>
- <td>2.2.3.1</td>
- <td><code>shared_ptr</code> constructors</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.2.3.2</td>
- <td><code>shared_ptr</code> destructor</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.2.3.3</td>
- <td><code>shared_ptr</code> assignment</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.2.3.4</td>
- <td><code>shared_ptr</code> modifiers</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.2.3.5</td>
- <td><code>shared_ptr</code> observers</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.2.3.6</td>
- <td><code>shared_ptr</code> comparison</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.2.3.7</td>
- <td><code>shared_ptr</code> I/O</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.2.3.8</td>
- <td><code>shared_ptr</code> specialized algorithms</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.2.3.9</td>
- <td><code>shared_ptr</code> casts</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.2.3.10</td>
- <td><code>get_deleter</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.2.4</td>
- <td>Class template <code>weak_ptr</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.2.4.1</td>
- <td><code>weak_ptr</code> constructors</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.2.4.2</td>
- <td><code>weak_ptr</code> destructor</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.2.4.3</td>
- <td><code>weak_ptr</code> assignment</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.2.4.4</td>
- <td><code>weak_ptr</code> modifiers</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.2.4.5</td>
- <td><code>weak_ptr</code> observers</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.2.4.6</td>
- <td><code>weak_ptr</code> comparison</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.2.4.7</td>
- <td><code>weak_ptr</code> specialized algorithms</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>2.2.5</td>
- <td>Class template <code>enable_shared_from_this</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td><b>3</b></td>
- <td colspan="5"><b>Function objects</b></td>
- </tr>
- <tr>
- <td>3.1</td>
- <td>Definitions</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>3.2</td>
- <td>Additions to <code><functional> synopsis</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>3.3</td>
- <td>Requirements</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>3.4</td>
- <td>Function return types</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>3.5</td>
- <td>Function template <code>mem_fn</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>3.6</td>
- <td>Function object binders</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>3.6.1</td>
- <td>Class template <code>is_bind_expression</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>3.6.2</td>
- <td>Class template <code>is_placeholder</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>3.6.3</td>
- <td>Function template <code>bind</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>3.6.4</td>
- <td>Placeholders</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>3.7</td>
- <td>Polymorphic function wrappers</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>3.7.1</td>
- <td>Class <code>bad_function_call<code></code></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>3.7.1.1</td>
- <td><code>bad_function_call</code> constructor</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>3.7.2</td>
- <td>Class template <code>function</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>3.7.2.1</td>
- <td><code>function</code> construct/copy/destroy</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>3.7.2.2</td>
- <td><code>function</code> modifiers</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>3.7.2.3</td>
- <td><code>function</code> capacity</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>3.7.2.4</td>
- <td><code>function</code> invocation</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>3.7.2.5</td>
- <td><code>function</code> target access</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>3.7.2.6</td>
- <td>undefined operators</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>3.7.2.7</td>
- <td>null pointer comparison operators</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>3.7.2.8</td>
- <td>specialized algorithms</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td><b>4</b></td>
- <td colspan="5"><b>Metaprogramming and type traits</b></td>
- </tr>
- <tr>
- <td>4.1</td>
- <td>Requirements</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>4.2</td>
- <td>Header <code><type_traits></code> synopsis</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>4.3</td>
- <td>Helper classes</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>4.4</td>
- <td>General Requirements</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>4.5</td>
- <td>Unary Type Traits</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>4.5.1</td>
- <td>Primary Type Categories</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>4.5.2</td>
- <td>Composite type traits</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>4.5.3</td>
- <td>Type properties</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>4.6</td>
- <td>Relationships between types</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>4.7</td>
- <td>Transformations between types</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>4.7.1</td>
- <td>Const-volatile modifications</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>4.7.2</td>
- <td>Reference modifications</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>4.7.3</td>
- <td>Array modifications</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>4.7.4</td>
- <td>Pointer modifications</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>4.8</td>
- <td>Other transformations</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>4.9</td>
- <td>Implementation requirements</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td><b>5</b></td>
- <td colspan="5"><b>Numerical facilities</b></td>
- </tr>
- <tr>
- <td>5.1</td>
- <td>Random number generation</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.1.1</td>
- <td>Requirements</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.1.2</td>
- <td>Header <code><random></code> synopsis</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.1.3</td>
- <td>Class template <code>variate_generator</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.1.4</td>
- <td>Random number engine class templates</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.1.4.1</td>
- <td>Class template <code>linear_congruential</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.1.4.2</td>
- <td>Class template <code>mersenne_twister</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.1.4.3</td>
- <td>Class template <code>subtract_with_carry</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.1.4.4</td>
- <td>Class template <code>subtract_with_carry_01</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.1.4.5</td>
- <td>Class template <code>discard_block</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.1.4.6</td>
- <td>Class template <code>xor_combine</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td>operator()() per N2079</td>
- </tr>
- <tr>
- <td>5.1.5</td>
- <td>Engines with predefined parameters</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.1.6</td>
- <td>Class <code>random_device</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.1.7</td>
- <td>Random distribution class templates</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.1.7.1</td>
- <td>Class template <code>uniform_int</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.1.7.2</td>
- <td>Class <code>bernoulli_distribution</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.1.7.3</td>
- <td>Class template <code>geometric_distribution</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.1.7.4</td>
- <td>Class template <code>poisson_distribution</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.1.7.5</td>
- <td>Class template <code>binomial_distribution</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.1.7.6</td>
- <td>Class template <code>uniform_real</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.1.7.7</td>
- <td>Class template <code>exponential_distribution</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.1.7.8</td>
- <td>Class template <code>normal_distribution</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.1.7.9</td>
- <td>Class template <code>gamma_distribution</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2</td>
- <td>Mathematical special functions</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2.1</td>
- <td>Additions to header <code><cmath></code> synopsis</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2.1.1</td>
- <td>associated Laguerre polynomials</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2.1.2</td>
- <td>associated Legendre functions</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2.1.3</td>
- <td>beta function</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2.1.4</td>
- <td>(complete) elliptic integral of the first kind</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2.1.5</td>
- <td>(complete) elliptic integral of the second kind</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2.1.6</td>
- <td>(complete) elliptic integral of the third kind</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2.1.7</td>
- <td>confluent hypergeometric functions</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2.1.8</td>
- <td>regular modified cylindrical Bessel functions</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2.1.9</td>
- <td>cylindrical Bessel functions (of the first kind)</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2.1.10</td>
- <td>irregular modified cylindrical Bessel functions</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2.1.11</td>
- <td>cylindrical Neumann functions</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2.1.12</td>
- <td>(incomplete) elliptic integral of the first kind</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2.1.13</td>
- <td>(incomplete) elliptic integral of the second kind</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2.1.14</td>
- <td>(incomplete) elliptic integral of the third kind</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2.1.15</td>
- <td>exponential integral</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2.1.16</td>
- <td>Hermite polynomials</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2.1.17</td>
- <td>hypergeometric functions</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2.1.18</td>
- <td>Laguerre polynomials</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2.1.19</td>
- <td>Legendre polynomials</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2.1.20</td>
- <td>Riemann zeta function</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2.1.21</td>
- <td>spherical Bessel functions (of the first kind)</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2.1.22</td>
- <td>spherical associated Legendre functions</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2.1.23</td>
- <td>spherical Neumann functions</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>5.2.2</td>
- <td>Additions to header <code><math.h></code> synopsis</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td><b>6</b></td>
- <td colspan="5"><b>Containers</b></td>
- </tr>
- <tr>
- <td>6.1</td>
- <td>Tuple types</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.1.1</td>
- <td>Header <code><tuple></code> synopsis</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.1.2</td>
- <td>Additions to header <code><utility></code> synopsis</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.1.3</td>
- <td>Class template <code>tuple</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.1.3.1</td>
- <td>Construction</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.1.3.2</td>
- <td>Tuple creation functions</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.1.3.3</td>
- <td>Tuple helper classes</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.1.3.4</td>
- <td>Element access</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.1.3.5</td>
- <td>Relational operators</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.1.4</td>
- <td>Pairs</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.2</td>
- <td>Fixed size array</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.2.1</td>
- <td>Header <code><array></code> synopsis</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.2.2</td>
- <td>Class template <code>array</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.2.2.1</td>
- <td><code>array</code> constructors, copy, and assignment</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.2.2.2</td>
- <td><code>array</code> specialized algorithms</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.2.2.3</td>
- <td><code>array</code> size</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.2.2.4</td>
- <td>Zero sized <code>array</code>s</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.2.2.5</td>
- <td>Tuple interface to class template <code>array</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.3</td>
- <td>Unordered associative containers</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.3.1</td>
- <td>Unordered associative container requirements</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.3.1.1</td>
- <td>Exception safety guarantees</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.3.2</td>
- <td>Additions to header <code><functional></code> synopsis</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.3.3</td>
- <td>Class template <code>hash</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.3.4</td>
- <td>Unordered associative container classes</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.3.4.1</td>
- <td>Header <code><unordered_set></code> synopsis</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.3.4.2</td>
- <td>Header <code><unordered_map></code> synopsis</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.3.4.3</td>
- <td>Class template <code>unordered_set</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.3.4.3.1</td>
- <td><code>unordered_set</code> constructors</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.3.4.3.2</td>
- <td><code>unordered_set</code> swap</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.3.4.4</td>
- <td>Class template <code>unordered_map</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.3.4.4.1</td>
- <td><code>unordered_map</code> constructors</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.3.4.4.2</td>
- <td><code>unordered_map</code> element access</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.3.4.4.3</td>
- <td><code>unordered_map</code> swap</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.3.4.5</td>
- <td>Class template <code>unordered_multiset<code></code></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.3.4.5.1</td>
- <td><code>unordered_multiset</code> constructors</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.3.4.5.2</td>
- <td><code>unordered_multiset</code> swap</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.3.4.6</td>
- <td>Class template <code>unordered_multimap</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.3.4.6.1</td>
- <td><code>unordered_multimap</code> constructors</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>6.3.4.6.2</td>
- <td><code>unordered_multimap</code> swap</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td><b>7</b></td>
- <td colspan="5"><b>Regular expressions</b></td>
- </tr>
- <tr>
- <td>7.1</td>
- <td>Definitions</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.2</td>
- <td>Requirements</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.3</td>
- <td>Regular expressions summary</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.4</td>
- <td>Header <code><regex></code> synopsis</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.5</td>
- <td>Namespace <code>tr1::regex_constants</code></td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.5.1</td>
- <td>Bitmask Type <code>syntax_option_type</code></td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.5.2</td>
- <td>Bitmask Type <code>regex_constants::match_flag_type</code></td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.5.3</td>
- <td>Implementation defined <code>error_type</code></td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.6</td>
- <td>Class <code>regex_error</code></td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.7</td>
- <td>Class template <code>regex_traits</code></td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.8</td>
- <td>Class template <code>basic_regex</code></td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.8.1</td>
- <td><code>basic_regex</code> constants</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.8.2</td>
- <td><code>basic_regex</code> constructors</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.8.3</td>
- <td><code>basic_regex</code> assign</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.8.4</td>
- <td><code>basic_regex</code> constant operations</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.8.5</td>
- <td><code>basic_regex</code> locale</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.8.6</td>
- <td><code>basic_regex</code> swap</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.8.7</td>
- <td><code>basic_regex</code> non-member functions</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.8.7.1</td>
- <td><code>basic_regex</code> non-member swap</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.9</td>
- <td>Class template <code>sub_match</code></td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.9.1</td>
- <td><code>sub_match</code> members</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.9.2</td>
- <td><code>sub_match</code> non-member operators</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.10</td>
- <td>Class template <code>match_results</code></td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.10.1</td>
- <td><code>match_results</code> constructors</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.10.2</td>
- <td><code>match_results</code> size</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.10.3</td>
- <td><code>match_results</code> element access</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.10.4</td>
- <td><code>match_results</code> formatting</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.10.5</td>
- <td><code>match_results</code> allocator</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.10.6</td>
- <td><code>match_results</code> swap</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.11</td>
- <td>Regular expression algorithms</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.11.1</td>
- <td>exceptions</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.11.2</td>
- <td><code>regex_match</code></td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.11.3</td>
- <td><code>regex_search</code></td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.11.4</td>
- <td><code>regex_replace</code></td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.12</td>
- <td>Regular expression Iterators</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.12.1</td>
- <td>Class template <code>regex_iterator</code></td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.12.1.1</td>
- <td><code>regex_iterator</code> constructors</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.12.1.2</td>
- <td><code>regex_iterator</code> comparisons</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.12.1.3</td>
- <td><code>regex_iterator</code> dereference</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.12.1.4</td>
- <td><code>regex_iterator</code> increment</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.12.2</td>
- <td>Class template <code>regex_token_iterator</code></td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.12.2.1</td>
- <td><code>regex_token_iterator</code> constructors</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.12.2.2</td>
- <td><code>regex_token_iterator</code> comparisons</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.12.2.3</td>
- <td><code>regex_token_iterator</code> dereference</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.12.2.4</td>
- <td><code>regex_token_iterator</code> increment</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>7.13</td>
- <td>Modified ECMAScript regular expression grammar</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td><b>8</b></td>
- <td colspan="5"><b>C compatibility</b></td>
- </tr>
- <tr>
- <td>8.1</td>
- <td>Additions to header <code><complex></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.1.1</td>
- <td>Synopsis</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.1.2</td>
- <td>Function <code>acos</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.1.3</td>
- <td>Function <code>asin</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.1.4</td>
- <td>Function <code>atan</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.1.5</td>
- <td>Function <code>acosh</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.1.6</td>
- <td>Function <code>asinh</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.1.7</td>
- <td>Function <code>atanh</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.1.8</td>
- <td>Function <code>fabs</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.1.9</td>
- <td>Additional Overloads</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.2</td>
- <td>Header <code><ccomplex></code></td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td>DR 551</td>
- </tr>
- <tr>
- <td>8.3</td>
- <td>Header <code><complex.h></code></td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td>DR 551</td>
- </tr>
- <tr>
- <td>8.4</td>
- <td>Additions to header <code><cctype></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.4.1</td>
- <td>Synopsis</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.4.2</td>
- <td>Function <code>isblank</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.5</td>
- <td>Additions to header <code><ctype.h></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.6</td>
- <td>Header <code><cfenv></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.6.1</td>
- <td>Synopsis</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.6.2</td>
- <td>Definitions</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.7</td>
- <td>Header <code><fenv.h></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.8</td>
- <td>Additions to header <code><cfloat></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.9</td>
- <td>Additions to header <code><float.h></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.10</td>
- <td>Additions to header <code><ios></code></td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>8.10.1</td>
- <td>Synopsis</td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>8.10.2</td>
- <td>Function <code>hexfloat</code></td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>8.11</td>
- <td>Header <code><cinttypes></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.11.1</td>
- <td>Synopsis</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td>DR 557</td>
- </tr>
- <tr>
- <td>8.11.2</td>
- <td>Definitions</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.12</td>
- <td>Header <code><inttypes.h></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.13</td>
- <td>Additions to header <code><climits></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.14</td>
- <td>Additions to header <code><limits.h></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.15</td>
- <td>Additions to header <code><locale></code></td>
- <td></td>
- <td></td>
- <td>missing</td>
- <td></td>
- </tr>
- <tr>
- <td>8.16</td>
- <td>Additions to header <code><cmath></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.16.1</td>
- <td>Synopsis</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.16.2</td>
- <td>Definitions</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.16.3</td>
- <td>Function template definitions</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.16.4</td>
- <td>Additional overloads</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td>DR 568; DR 550</td>
- </tr>
- <tr>
- <td>8.17</td>
- <td>Additions to header <code><math.h></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.18</td>
- <td>Additions to header <code><cstdarg></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.19</td>
- <td>Additions to header <code><stdarg.h></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.20</td>
- <td>The header <code><cstdbool></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.21</td>
- <td>The header <code><stdbool.h></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.22</td>
- <td>The header <code><cstdint></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.22.1</td>
- <td>Synopsis</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.22.2</td>
- <td>Definitions</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.23</td>
- <td>The header <code><stdint.h></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.24</td>
- <td>Additions to header <code><cstdio></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.24.1</td>
- <td>Synopsis</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.24.2</td>
- <td>Definitions</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.24.3</td>
- <td>Additional format specifiers</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td>C library responsability</td>
- </tr>
- <tr>
- <td>8.24.4</td>
- <td>Additions to header <code><stdio.h></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.25</td>
- <td>Additions to header <code><cstdlib></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.25.1</td>
- <td>Synopsis</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.25.2</td>
- <td>Definitions</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.25.3</td>
- <td>Function <code>abs</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.25.4</td>
- <td>Function <code>div</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.26</td>
- <td>Additions to header <code><stdlib.h></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.27</td>
- <td>Header <code><ctgmath></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td>DR 551</td>
- </tr>
- <tr>
- <td>8.28</td>
- <td>Header <code><tgmath.h></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td>DR 551</td>
- </tr>
- <tr>
- <td>8.29</td>
- <td>Additions to header <code><ctime></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td>C library responsability</td>
- </tr>
- <tr>
- <td>8.30</td>
- <td>Additions to header <code><cwchar></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.30.1</td>
- <td>Synopsis</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.30.2</td>
- <td>Definitions</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.30.3</td>
- <td>Additional wide format specifiers</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td>C library responsability</td>
- </tr>
- <tr>
- <td>8.31</td>
- <td>Additions to header <code><wchar.h></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.32</td>
- <td>Additions to header <code><cwctype></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.32.1</td>
- <td>Synopsis</td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.32.2</td>
- <td>Function <code>iswblank</code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- <tr>
- <td>8.33</td>
- <td>Additions to header <code><wctype.h></code></td>
- <td>done</td>
- <td></td>
- <td></td>
- <td></td>
- </tr>
- </tbody>
-</table>
-
-<h3>Footnotes</h3>
-
-<ol>
-
- <li>
- <a name="1"/>
- The shared_ptr implementation uses some code from the
- <a href="http://www.boost.org/libs/smart_ptr/shared_ptr.htm">Boost
- shared_ptr</a> library.
- </li>
-
-</ol>
-
-<p>
-Please send FSF & GNU inquiries & questions to
-<a href="mailto:gnu@gnu.org">gnu@gnu.org</a>.
-There are also <a href="http://www.gnu.org/home.html#ContactInfo">other ways
-to contact</a> the FSF.
-</p>
-
-<p>
-These pages are maintained by
-<a href="http://gcc.gnu.org/about.html">the GCC team</a>.
-</p>
-
-<address>
-For questions related to the use of GCC, please consult these web
-pages and the <a href="http://gcc.gnu.org/onlinedocs/">GCC manuals</a>. If
-that fails, the <a href="mailto:gcc-help@gcc.gnu.org">gcc-help@gcc.gnu.org</a>
-mailing list might help.<br />
-Please send comments on these web pages and the development of GCC to our
-developer mailing list at <a href="mailto:gcc@gnu.org">gcc@gnu.org</a>
-or <a href="mailto:gcc@gcc.gnu.org">gcc@gcc.gnu.org</a>. All of our lists
-have <a href="http://gcc.gnu.org/lists.html">public archives</a>.
-</address>
-
-<p>
-Copyright (C) Free Software Foundation, Inc.,
-51 Franklin St, Fifth Floor, Boston, MA 02110, USA.
-</p>
-<p>
-Verbatim copying and distribution of this entire article is
-permitted in any medium, provided this notice is preserved.
-</p>
-
-<table width="100%" border="0">
-<tr>
- <td>
- <!-- IGNORE DIFF -->Last modified 2006-10-01
- </td>
- <td align="right" valign="bottom">
- <a href="http://validator.w3.org/check/referer">
- <img src="http://www.w3.org/Icons/valid-xhtml10"
- alt="Valid XHTML 1.0" border="0" width="88" height="31" />
- </a>
- </td>
-</tr>
-</table>
-
-</body>
-</html>
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1" />
- <meta name="KEYWORDS" content="libstdc++, libstdc++-v3, GCC, g++, libg++, STL" />
+ <meta name="KEYWORDS" content="libstdc++, libstdc++, GCC, g++, libg++, STL" />
<meta name="DESCRIPTION" content="FAQ for the GNU libstdc++ effort." />
- <title>libstdc++-v3 FAQ</title>
+ <title>libstdc++ FAQ</title>
<link rel="StyleSheet" href="../lib3styles.css" />
<link rel="Start" rev="Help" href="../documentation.html" type="text/html"
title="GNU C++ Standard Library" />
</em></p>
<p><em>
- To the <a href="http://gcc.gnu.org/libstdc++/">libstdc++-v3 homepage</a>.
+ To the <a href="http://gcc.gnu.org/libstdc++/">libstdc++ homepage</a>.
</em></p>
<!-- ####################################################### -->
<li><a href="#1_0">General Information</a>
<!-- I suspect these will mostly be links to/into existing documents. -->
<ol>
- <li><a href="#1_1">What is libstdc++-v3?</a> </li>
+ <li><a href="#1_1">What is libstdc++?</a> </li>
<li><a href="#1_2">Why should I use libstdc++?</a> </li>
<li><a href="#1_3">Who's in charge of it?</a> </li>
- <li><a href="#1_4">How do I get libstdc++?</a> </li>
+ <li><a href="#1_4">[removed]</a> </li>
<li><a href="#1_5">When is libstdc++ going to be finished?</a> </li>
<li><a href="#1_6">How do I contribute to the effort?</a> </li>
<li><a href="#1_7">What happened to libg++? I need that!</a> </li>
<li><a href="#1_8">What if I have more questions?</a> </li>
- <li><a href="#1_9">What are the license terms for libstdc++-v3?</a> </li>
+ <li><a href="#1_9">What are the license terms for libstdc++?</a> </li>
</ol>
</li>
<li><a href="#2_0">Installation</a>
<ol>
- <li><a href="#2_1">How do I install libstdc++-v3?</a> </li>
+ <li><a href="#2_1">How do I install libstdc++?</a> </li>
<li><a href="#2_2">[removed]</a> </li>
<li><a href="#2_3">What is this SVN thing that you keep
mentioning?</a> </li>
<li><a href="#3_0">Platform-Specific Issues</a>
<ol>
- <li><a href="#3_1">Can libstdc++-v3 be used with <my
+ <li><a href="#3_1">Can libstdc++ be used with <my
favorite compiler>?</a> </li>
<li><a href="#3_2">[removed]</a> </li>
<li><a href="#3_3">[removed]</a> </li>
<li><a href="#4_0">Known Bugs and Non-Bugs</a>
<ol>
<li><a href="#4_1">What works already?</a> </li>
- <li><a href="#4_2">Bugs in gcc/g++ (not libstdc++-v3)</a> </li>
+ <li><a href="#4_2">Bugs in gcc/g++ (not libstdc++)</a> </li>
<li><a href="#4_3">Bugs in the C++ language/lib specification</a> </li>
<li><a href="#4_4">Things in libstdc++ that only look like bugs</a><ul>
<li><a href="#4_4_iostreamclear">reopening a stream fails</a> </li>
<ol>
<li><a href="#5_1">string::iterator is not char*;
vector<T>::iterator is not T*</a> </li>
- <li><a href="#5_2">What's next after libstdc++-v3?</a> </li>
+ <li><a href="#5_2">What's next after libstdc++?</a> </li>
<li><a href="#5_3">What about the STL from SGI?</a> </li>
<li><a href="#5_4">Extensions and Backward Compatibility</a> </li>
<li><a href="#5_5">Does libstdc++ support TR1?</a> </li>
- <li><a href="#5_6">Is libstdc++-v3 thread-safe?</a> </li>
+ <li><a href="#5_6">Is libstdc++ thread-safe?</a> </li>
<li><a href="#5_7">How do I get a copy of the ISO C++ Standard?</a> </li>
<li><a href="#5_8">What's an ABI and why is it so messy?</a> </li>
<li><a href="#5_9">How do I make std::vector<T>::capacity()
<h1><a name="1_0">1.0 General Information</a></h1>
<!-- I suspect these will mostly be links to/into existing documents. -->
- <h2><a name="1_1">1.1 What is libstdc++-v3?</a></h2>
+ <h2><a name="1_1">1.1 What is libstdc++?</a></h2>
<p>The GNU Standard C++ Library v3 is an
ongoing project to implement the ISO 14882 Standard C++ library
as described in chapters 17 through 27 and annex D.
For those who want to see exactly how
far the project has come, or just want the latest
bleeding-edge code, the up-to-date source is available over
- anonymous SVN, and can even be browsed over the Web (see
- <a href="#1_4">1.4</a> below).
- </p>
- <p>The older libstdc++-v2 project is no longer maintained; the code
- has been completely replaced and rewritten.
- <a href="#4_4_interface">If you are using V2</a>, then you need to
- report bugs to your system vendor, not to the V3 list.
- </p>
- <p>A more formal description of the V3 goals can be found in the
- official <a href="../17_intro/DESIGN">design document</a>.
+ anonymous SVN, and can even be browsed over the
+ <a href="http://gcc.gnu.org/svn.html">web</a>.
</p>
<hr />
is overseen by the
<a href="http://gcc.gnu.org/">GCC team</a>. All of
the rapid development and near-legendary
- <a href="http://gcc.gnu.org/gcc-3.3/buildstat.html">portability</a>
+ <a href="http://gcc.gnu.org/buildstat.html">portability</a>
that are the hallmarks of an open-source project are being
applied to libstdc++.
</p>
<hr />
<h2><a name="1_4">1.4 How do I get libstdc++?</a></h2>
- <p>The <a href="http://gcc.gnu.org/libstdc++/">homepage</a>
- has instructions for retrieving the latest SVN sources, and for
- browsing the SVN sources over the web.
- </p>
+
<p>Stable versions of libstdc++-v3 are included with releases of
<a href="http://gcc.gnu.org/releases.html">the GCC compilers</a>.
</p>
- <p>The subset commonly known as the Standard Template Library
- (chapters 23 through 25, mostly) is adapted from the final release
- of the SGI STL, with extensive changes.
- </p>
<hr />
<h2><a name="1_5">1.5 When is libstdc++ going to be finished?</a></h2>
<hr />
<h2><a name="1_8">1.8 What if I have more questions?</a></h2>
- <p>If you have read the README and RELEASE-NOTES files, and your
+ <p>If you have read the README file, and your
question remains unanswered, then just ask the mailing list.
At present, you do not need to be subscribed to the list to
send a message to it. More information is available on the
</p>
<hr />
- <h2><a name="1_9">1.9 What are the license terms for libstdc++-v3?</a></h2>
+ <h2><a name="1_9">1.9 What are the license terms for libstdc++?</a></h2>
<p>See <a href="../17_intro/license.html">our license description</a>
for these and related questions.
</p>
<hr />
<h1><a name="2_0">2.0 Installation</a></h1>
- <h2><a name="2_1">2.1 How do I install libstdc++-v3?</a></h2>
+ <h2><a name="2_1">2.1 How do I install libstdc++?</a></h2>
<p>Complete instructions are not given here (this is a FAQ, not
an installation document), but the tools required are few:
</p>
with new flags such as --enable-threads are there also, as well as
patches and instructions for working with GCC 2.95.
</p>
- <p>The top-level install.html and
- <a href="../17_intro/RELEASE-NOTES">RELEASE-NOTES</a> files contain
+ <p>The top-level install.html file contains
the exact build and installation instructions. You may wish to
browse those files over ViewVC ahead of time to get a feel for
- what's required. RELEASE-NOTES is located in the
- ".../docs/17_intro/" directory of the distribution.
+ what's required.
</p>
<hr />
<hr />
<h2><a name="2_4">2.4 How do I know if it works?</a></h2>
- <p>libstdc++-v3 comes with its own testsuite. You do not need
+ <p>libstdc++ comes with its own testsuite. You do not need
to actually install the library ("<code>make
install</code>") to run the testsuite, but you do need
DejaGNU, as described
into your executable, not the entire library. Unfortunately, even
if you only need a single function or variable from an object file,
the entire object file is extracted. (There's nothing unique to C++
- or libstdc++-v3 about this; it's just common behavior, given here
+ or libstdc++ about this; it's just common behavior, given here
for background reasons.)
</p>
<p>Some of the object files which make up libstdc++.a are rather large.
of your executable. Historically the best way around this was to
only place a very few functions (often only a single one) in each
source/object file; then extracting a single function is the same
- as extracting a single .o file. For libstdc++-v3 this is only
+ as extracting a single .o file. For libstdc++ this is only
possible to a certain extent; the object files in question contain
template classes and template functions, pre-instantiated, and
splitting those up causes severe maintenance headaches.
<hr />
<h1><a name="3_0">3.0 Platform-Specific Issues</a></h1>
- <h2><a name="3_1">3.1 Can libstdc++-v3 be used with <my
+ <h2><a name="3_1">3.1 Can libstdc++ be used with <my
favorite compiler>?</a></h2>
<p>Probably not. Yet.</p>
<p>Because GCC advances so rapidly, development and testing of
<h1><a name="4_0">4.0 Known Bugs and Non-Bugs</a></h1>
<em>Note that this section can get rapidly outdated -- such is the
nature of an open-source project. For the latest information, join
- the mailing list or look through recent archives. The RELEASE-
- NOTES and BUGS files are generally kept up-to-date.</em>
+ the mailing list or look through GCC bugzilla.</em>
<p>For 3.0.1, the most common "bug" is an apparently missing
"<code>../</code>" in include/Makefile, resulting in files
corner cases. Also, localization is incomplete. For whether it works
well, or as you expect it to work, see 5.2.
</p>
- <p>Long answer: See the docs/html/17_intro/CHECKLIST file, which is
- badly outdated... Also see the RELEASE-NOTES file, which is kept
- more up to date.
+ <p>Long answer: See the implementation status pages for C++98,
+ TR1, and C++0x.
</p>
<hr />
- <h2><a name="4_2">4.2 Bugs in gcc/g++ (not libstdc++-v3)</a></h2>
+ <h2><a name="4_2">4.2 Bugs in gcc/g++ (not libstdc++)</a></h2>
<p>This is by no means meant to be complete nor exhaustive, but
mentions some problems that users may encounter when building
or using libstdc++. If you are experiencing one of these
</p>
<p>Before reporting a bug, examine the
<a href="http://gcc.gnu.org/bugs.html">bugs database</a> with the
- category set to "libstdc++". The BUGS file in the source
- tree also tracks known serious problems.
+ category set to "libstdc++".
</p>
<ul>
<li>Debugging is problematic, due to bugs in line-number generation
libstdc++-v2 library, which is nonstandard and unmaintained. Do not
report problems with -v2 to the -v3 mailing list.
</p>
- <p>For GCC versions 3.0 and 3.1 the libstdc++-v3 header files are
+ <p>For GCC versions 3.0 and 3.1 the libstdc++ header files are
installed in <code>${prefix}/include/g++-v3</code> (see the 'v'?).
Starting with version 3.2 the headers are installed in
<code>${prefix}/include/c++/${version}</code> as this prevents
<p>Note that 2.95.x shipped with the
<a href="#4_4_interface">old v2 library</a> which is no longer
maintained. Also note that gcc 2.95.3 fixes this problem, but
- requires a separate patch for libstdc++-v3.
+ requires a separate patch for libstdc++.
</p>
<p><a name="4_4_checks"><strong>concept checks</strong></a>
If you see compilation errors containing messages about
</p>
<hr />
- <h2><a name="5_2">5.2 What's next after libstdc++-v3?</a></h2>
- <p>Hopefully, not much. The goal of libstdc++-v3 is to produce
+ <h2><a name="5_2">5.2 What's next after libstdc++?</a></h2>
+ <p>Hopefully, not much. The goal of libstdc++ is to produce
a fully-compliant, fully-portable Standard Library. After that,
we're mostly done: there won't <em>be</em> any more compliance
work to do. However:
<li><p>The current libstdc++ contains extensions to the Library which
must be explicitly requested by client code (for example, the
hash tables from SGI). Other extensions may be added to
- libstdc++-v3 if they seem to be "standard" enough.
+ libstdc++ if they seem to be "standard" enough.
(For example, the "long long" type from C99.)
Bugfixes and rewrites (to improve or fix thread safety, for
instance) will of course be a continuing task.
</p>
<hr />
- <h2><a name="5_6">5.6 Is libstdc++-v3 thread-safe?</a></h2>
- <p>libstdc++-v3 strives to be thread-safe when all of the following
+ <h2><a name="5_6">5.6 Is libstdc++ thread-safe?</a></h2>
+ <p>libstdc++ strives to be thread-safe when all of the following
conditions are met:
</p>
<ul>
+++ /dev/null
-
- #[1]GNU C++ Standard Library [2]Copyright
-
- libstdc++ Frequently Asked Questions
-
- The latest version of this document is always available at
- [3]http://gcc.gnu.org/onlinedocs/libstdc++/faq/. The main
- documentation page is at
- [4]http://gcc.gnu.org/onlinedocs/libstdc++/documentation.html.
-
- To the [5]libstdc++-v3 homepage.
- _________________________________________________________________
-
- Questions
-
- 1. [6]General Information
- 1. [7]What is libstdc++-v3?
- 2. [8]Why should I use libstdc++?
- 3. [9]Who's in charge of it?
- 4. [10]How do I get libstdc++?
- 5. [11]When is libstdc++ going to be finished?
- 6. [12]How do I contribute to the effort?
- 7. [13]What happened to libg++? I need that!
- 8. [14]What if I have more questions?
- 9. [15]What are the license terms for libstdc++-v3?
- 2. [16]Installation
- 1. [17]How do I install libstdc++-v3?
- 2. [18][removed]
- 3. [19]What is this SVN thing that you keep mentioning?
- 4. [20]How do I know if it works?
- 5. [21]This library is HUGE! And what's libsupc++?
- 6. [22]Why do I get an error saying libstdc++.so.X is missing
- when I run my program?
- 3. [23]Platform-Specific Issues
- 1. [24]Can libstdc++-v3 be used with <my favorite compiler>?
- 2. [25][removed]
- 3. [26][removed]
- 4. [27]I can't use 'long long' on Solaris
- 5. [28]_XOPEN_SOURCE / _GNU_SOURCE / etc is always defined
- 6. [29]OS X ctype.h is broken! How can I hack it?
- 7. [30]Threading is broken on i386
- 8. [31]Recent GNU/Linux glibc required?
- 9. [32]Can't use wchar_t/wstring on FreeBSD
- 10. [33]MIPS atomic operations
- 4. [34]Known Bugs and Non-Bugs
- 1. [35]What works already?
- 2. [36]Bugs in gcc/g++ (not libstdc++-v3)
- 3. [37]Bugs in the C++ language/lib specification
- 4. [38]Things in libstdc++ that only look like bugs
- o [39]reopening a stream fails
- o [40]-Weffc++ complains too much
- o [41]"ambiguous overloads" after including an old-style
- header
- o [42]The g++-3 headers are not ours
- o [43]compilation errors from streambuf.h
- o [44]errors about *Concept and constraints in the STL...
- o [45]program crashes when using library code in a
- dynamically-loaded library
- o [46]"memory leaks" in containers
- 5. [47]Aw, that's easy to fix!
- 5. [48]Miscellaneous
- 1. [49]string::iterator is not char*; vector<T>::iterator is not
- T*
- 2. [50]What's next after libstdc++-v3?
- 3. [51]What about the STL from SGI?
- 4. [52]Extensions and Backward Compatibility
- 5. [53]Does libstdc++ support TR1?
- 6. [54]Is libstdc++-v3 thread-safe?
- 7. [55]How do I get a copy of the ISO C++ Standard?
- 8. [56]What's an ABI and why is it so messy?
- 9. [57]How do I make std::vector<T>::capacity() ==
- std::vector<T>::size?
- _________________________________________________________________
-
- 1.0 General Information
-
-1.1 What is libstdc++-v3?
-
- The GNU Standard C++ Library v3 is an ongoing project to implement the
- ISO 14882 Standard C++ library as described in chapters 17 through 27
- and annex D. For those who want to see exactly how far the project has
- come, or just want the latest bleeding-edge code, the up-to-date
- source is available over anonymous SVN, and can even be browsed over
- the Web (see [58]1.4 below).
-
- The older libstdc++-v2 project is no longer maintained; the code has
- been completely replaced and rewritten. [59]If you are using V2, then
- you need to report bugs to your system vendor, not to the V3 list.
-
- A more formal description of the V3 goals can be found in the official
- [60]design document.
- _________________________________________________________________
-
-1.2 Why should I use libstdc++?
-
- The completion of the ISO C++ standardization gave the C++ community a
- powerful set of reuseable tools in the form of the C++ Standard
- Library. However, all existing C++ implementations are (as the Draft
- Standard used to say) "incomplet and incorrekt," and many suffer from
- limitations of the compilers that use them.
-
- The GNU C/C++/FORTRAN/<pick-a-language> compiler (gcc, g++, etc) is
- widely considered to be one of the leading compilers in the world. Its
- development is overseen by the [61]GCC team. All of the rapid
- development and near-legendary [62]portability that are the hallmarks
- of an open-source project are being applied to libstdc++.
-
- That means that all of the Standard classes and functions (such as
- string, vector<>, iostreams, and algorithms) will be freely available
- and fully compliant. Programmers will no longer need to "roll their
- own" nor be worried about platform-specific incompatibilities.
- _________________________________________________________________
-
-1.3 Who's in charge of it?
-
- The libstdc++ project is contributed to by several developers all over
- the world, in the same way as GCC or Linux. Benjamin Kosnik, Gabriel
- Dos Reis, Phil Edwards, Ulrich Drepper, Loren James Rittle, and Paolo
- Carlini are the lead maintainers of the SVN archive.
-
- Development and discussion is held on the libstdc++ mailing list.
- Subscribing to the list, or searching the list archives, is open to
- everyone. You can read instructions for doing so on the [63]homepage.
- If you have questions, ideas, code, or are just curious, sign up!
- _________________________________________________________________
-
-1.4 How do I get libstdc++?
-
- The [64]homepage has instructions for retrieving the latest SVN
- sources, and for browsing the SVN sources over the web.
-
- Stable versions of libstdc++-v3 are included with releases of [65]the
- GCC compilers.
-
- The subset commonly known as the Standard Template Library (chapters
- 23 through 25, mostly) is adapted from the final release of the SGI
- STL, with extensive changes.
- _________________________________________________________________
-
-1.5 When is libstdc++ going to be finished?
-
- Nathan Myers gave the best of all possible answers, responding to a
- Usenet article asking this question: Sooner, if you help.
- _________________________________________________________________
-
-1.6 How do I contribute to the effort?
-
- Here is [66]a page devoted to this topic. 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; anybody who
- is willing to help write documentation, for example, or has found a
- bug in code that we all thought was working, is more than welcome!
- _________________________________________________________________
-
-1.7 What happened to libg++? I need that!
-
- The most recent libg++ README states that libg++ is no longer being
- actively maintained. It should not be used for new projects, and is
- only being kicked along to support older code.
-
- The libg++ was designed and created when there was no Standard to
- provide guidance. Classes like linked lists are now provided for by
- list<T> and do not need to be created by genclass. (For that matter,
- templates exist now and are well-supported, whereas genclass (mostly)
- predates them.)
-
- There are other classes in libg++ that are not specified in the ISO
- Standard (e.g., statistical analysis). While there are a lot of really
- useful things that are used by a lot of people (e.g., statistics :-),
- the Standards Committee couldn't include everything, and so a lot of
- those "obvious" classes didn't get included.
-
- Since libstdc++ is an implementation of the Standard Library, we have
- no plans at this time to include non-Standard utilities in the
- implementation, however handy they are. (The extensions provided in
- the SGI STL aren't maintained by us and don't get a lot of our
- attention, because they don't require a lot of our time.) It is
- entirely plausable that the "useful stuff" from libg++ might be
- extracted into an updated utilities library, but nobody has started
- such a project yet.
-
- (The [67]Boost site houses free C++ libraries that do varying things,
- and happened to be started by members of the Standards Committee.
- Certain "useful stuff" classes will probably migrate there.)
-
- For the bold and/or desperate, the [68]GCC extensions page describes
- where to find the last libg++ source.
- _________________________________________________________________
-
-1.8 What if I have more questions?
-
- If you have read the README and RELEASE-NOTES files, and your question
- remains unanswered, then just ask the mailing list. At present, you do
- not need to be subscribed to the list to send a message to it. More
- information is available on the homepage (including how to browse the
- list archives); to send to the list, use [69]libstdc++@gcc.gnu.org.
-
- If you have a question that you think should be included here, or if
- you have a question about a question/answer here, contact [70]Phil
- Edwards or [71]Gabriel Dos Reis.
- _________________________________________________________________
-
-1.9 What are the license terms for libstdc++-v3?
-
- See [72]our license description for these and related questions.
- _________________________________________________________________
-
- 2.0 Installation
-
-2.1 How do I install libstdc++-v3?
-
- Complete instructions are not given here (this is a FAQ, not an
- installation document), but the tools required are few:
- * A 3.x release of GCC. Note that building GCC is much easier and
- more automated than building the GCC 2.[78] series was. If you are
- using GCC 2.95, you can still build earlier snapshots of
- libstdc++.
- * GNU Make is required for GCC 3.4 and later.
- * The GNU Autotools are needed if you are messing with the configury
- or makefiles.
-
- The file [73]documentation.html provides a good overview of the steps
- necessary to build, install, and use the library. Instructions for
- configuring the library with new flags such as --enable-threads are
- there also, as well as patches and instructions for working with GCC
- 2.95.
-
- The top-level install.html and [74]RELEASE-NOTES files contain the
- exact build and installation instructions. You may wish to browse
- those files over ViewVC ahead of time to get a feel for what's
- required. RELEASE-NOTES is located in the ".../docs/17_intro/"
- directory of the distribution.
- _________________________________________________________________
-
-2.2 [removed]
-
- This question has become moot and has been removed. The stub is here
- to preserve numbering (and hence links/bookmarks).
- _________________________________________________________________
-
-2.3 What is this SVN thing that you keep mentioning?
-
- Subversion is one of several revision control packages. It was
- selected for GNU projects because it's free (speech), free (beer), and
- very high quality. The [75]Subversion home page has a better
- description.
-
- The "anonymous client checkout" feature of SVN is similar to anonymous
- FTP in that it allows anyone to retrieve the latest libstdc++ sources.
-
- After the first of April, American users will have a "/pharmacy"
- command-line option...
- _________________________________________________________________
-
-2.4 How do I know if it works?
-
- libstdc++-v3 comes with its own testsuite. You do not need to actually
- install the library ("make install") to run the testsuite, but you do
- need DejaGNU, as described [76]here.
-
- To run the testsuite on the library after building it, use "make
- check" while in your build directory. To run the testsuite on the
- library after building and installing it, use "make check-install"
- instead.
-
- If you find bugs in the testsuite programs themselves, or if you think
- of a new test program that should be added to the suite, please write
- up your idea and send it to the list!
- _________________________________________________________________
-
-2.5 This library is HUGE! And what's libsupc++?
-
- Usually the size of libraries on disk isn't noticeable. When a link
- editor (or simply "linker") pulls things from a static archive
- library, only the necessary object files are copied into your
- executable, not the entire library. Unfortunately, even if you only
- need a single function or variable from an object file, the entire
- object file is extracted. (There's nothing unique to C++ or
- libstdc++-v3 about this; it's just common behavior, given here for
- background reasons.)
-
- Some of the object files which make up libstdc++.a are rather large.
- If you create a statically-linked executable with -static, those large
- object files are suddenly part of your executable. Historically the
- best way around this was to only place a very few functions (often
- only a single one) in each source/object file; then extracting a
- single function is the same as extracting a single .o file. For
- libstdc++-v3 this is only possible to a certain extent; the object
- files in question contain template classes and template functions,
- pre-instantiated, and splitting those up causes severe maintenance
- headaches.
-
- It's not a bug, and it's not really a problem. Nevertheless, some
- people don't like it, so here are two pseudo-solutions:
-
- If the only functions from libstdc++.a which you need are language
- support functions (those listed in [77]clause 18 of the standard,
- e.g., new and delete), then try linking against libsupc++.a (Using gcc
- instead of g++ and explicitly linking in -lsupc++ for the final link
- step will do it). This library contains only those support routines,
- one per object file. But if you are using anything from the rest of
- the library, such as IOStreams or vectors, then you'll still need
- pieces from libstdc++.a.
-
- The second method is one we hope to incorporate into the library build
- process. Some platforms can place each function and variable into its
- own section in a .o file. The GNU linker can then perform garbage
- collection on unused sections; this reduces the situation to only
- copying needed functions into the executable, as before, but all
- happens automatically.
-
- Unfortunately the garbage collection in GNU ld is buggy; sections
- (corresponding to functions and variables) which are used are
- mistakenly removed, leading to horrible crashes when your executable
- starts up. For the time being, this feature is not used when building
- the library.
- _________________________________________________________________
-
-2.6 Why do I get an error saying libstdc++.so.X is missing when I run my
-program?
-
- Depending on your platform and library version, the message might be
- similar to one of the following:
- ./a.out: error while loading shared libraries: libstdc++.so.6: cannot open
-shared object file: No such file or directory
-
- /usr/libexec/ld-elf.so.1: Shared object "libstdc++.so.6" not found
-
- This doesn't mean that the shared library isn't installed, only that
- the dynamic linker can't find it. When a dynamically-linked executable
- is run the linker finds and loads the required shared libraries by
- searching a pre-configured list of directories. If the directory where
- you've installed libstdc++ is not in this list then the libraries
- won't be found. The simplest way to fix this is to use the
- LD_LIBRARY_PATH environment variable, which is a colon-separated list
- of directories in which the linker will search for shared libraries:
- LD_LIBRARY_PATH=${prefix}/lib:$LD_LIBRARY_PATH
- export LD_LIBRARY_PATH
-
- The exact environment variable to use will depend on your platform,
- e.g. DYLD_LIBRARY_PATH for Darwin,
- LD_LIBRARY_PATH_32/LD_LIBRARY_PATH_64 for Solaris 32-/64-bit,
- LD_LIBRARYN32_PATH/LD_LIBRARY64_PATH for Irix N32/64-bit ABIs and
- SHLIB_PATH for HP-UX.
-
- See the man pages for ld(1), ldd(1) and ldconfig(8) for more
- information. The dynamic linker has different names on different
- platforms but the man page is usually called something such as ld.so /
- rtld / dld.so.
- _________________________________________________________________
-
- 3.0 Platform-Specific Issues
-
-3.1 Can libstdc++-v3 be used with <my favorite compiler>?
-
- Probably not. Yet.
-
- Because GCC advances so rapidly, development and testing of libstdc++
- is being done almost entirely under that compiler. If you are curious
- about whether other, lesser compilers (*grin*) support libstdc++, you
- are more than welcome to try. Configuring and building the library
- (see above) will still require certain tools, however. Also keep in
- mind that building libstdc++ does not imply that your compiler will be
- able to use all of the features found in the C++ Standard Library.
-
- Since the goal of ISO Standardization is for all C++ implementations
- to be able to share code, the final libstdc++ should, in theory, be
- usable under any ISO-compliant compiler. It will still be targeted and
- optimized for GCC/g++, however.
- _________________________________________________________________
-
-3.2 [removed]
-
- This question has become moot and has been removed. The stub is here
- to preserve numbering (and hence links/bookmarks).
- _________________________________________________________________
-
-3.3 [removed]
-
- This question has become moot and has been removed. The stub is here
- to preserve numbering (and hence links/bookmarks).
- _________________________________________________________________
-
-3.4 I can't use 'long long' on Solaris
-
- By default we try to support the C99 long long type. This requires
- that certain functions from your C library be present.
-
- Up through release 3.0.2 the tests performed were too general, and
- this feature was disabled when it did not need to be. The most
- commonly reported platform affected was Solaris.
-
- This has been fixed for 3.0.3 and onwards.
- _________________________________________________________________
-
-3.5 _XOPEN_SOURCE / _GNU_SOURCE / etc is always defined
-
- On Solaris, g++ (but not gcc) always defines the preprocessor macro
- _XOPEN_SOURCE. On GNU/Linux, the same happens with _GNU_SOURCE. (This
- is not an exhaustive list; other macros and other platforms are also
- affected.)
-
- These macros are typically used in C library headers, guarding new
- versions of functions from their older versions. The C++ standard
- library includes the C standard library, but it requires the C90
- version, which for backwards-compatability reasons is often not the
- default for many vendors.
-
- More to the point, the C++ standard requires behavior which is only
- available on certain platforms after certain symbols are defined.
- Usually the issue involves I/O-related typedefs. In order to ensure
- correctness, the compiler simply predefines those symbols.
-
- Note that it's not enough to #define them only when the library is
- being built (during installation). Since we don't have an 'export'
- keyword, much of the library exists as headers, which means that the
- symbols must also be defined as your programs are parsed and compiled.
-
- To see which symbols are defined, look for CPLUSPLUS_CPP_SPEC in the
- gcc config headers for your target (and try changing them to see what
- happens when building complicated code). You can also run "g++ -E -dM
- - < /dev/null" to display a list of predefined macros for any
- particular installation.
-
- This has been discussed on the mailing lists [78]quite a bit.
-
- This method is something of a wart. We'd like to find a cleaner
- solution, but nobody yet has contributed the time.
- _________________________________________________________________
-
-3.6 OS X ctype.h is broken! How can I hack it?
-
- This is a long-standing bug in the OS X support. Fortunately, the
- patch is quite simple, and well-known. [79]Here's a link to the
- solution.
- _________________________________________________________________
-
-3.7 Threading is broken on i386
-
- Support for atomic integer operations is/was broken on i386 platforms.
- The assembly code accidentally used opcodes that are only available on
- the i486 and later. So if you configured GCC to target, for example,
- i386-linux, but actually used the programs on an i686, then you would
- encounter no problems. Only when actually running the code on a i386
- will the problem appear.
-
- This is fixed in 3.2.2.
- _________________________________________________________________
-
-3.8 Recent GNU/Linux glibc required?
-
- When running on GNU/Linux, libstdc++ 3.2.1 (shared library version
- 5.0.1) and later uses localization and formatting code from the system
- C library (glibc) version 2.2.5. That version of glibc is over a year
- old and contains necessary bugfixes. Many GNU/Linux distros make glibc
- version 2.3.x available now.
-
- The guideline is simple: the more recent the C++ library, the more
- recent the C library. (This is also documented in the main GCC
- installation instructions.)
- _________________________________________________________________
-
-3.9 Can't use wchar_t/wstring on FreeBSD
-
- At the moment there are a few problems in FreeBSD's support for wide
- character functions, and as a result the libstdc++ configury decides
- that wchar_t support should be disabled. Once the underlying problems
- are fixed in FreeBSD (soon), the library support will automatically
- enable itself.
-
- You can fix the problems yourself, and learn more about the situation,
- by reading [80]this short thread ("_GLIBCPP_USE_WCHAR_T undefined in
- FreeBSD's c++config.h?").
- _________________________________________________________________
-
-3.10 MIPS atomic operations
-
- The atomic locking routines for MIPS targets requires MIPS II and
- later. A patch went in just after the 3.3 release to make mips* use
- the generic implementation instead. You can also configure for
- mipsel-elf as a workaround.
-
- mips*-*-linux* continues to use the MIPS II routines, and more work in
- this area is expected.
- _________________________________________________________________
-
- 4.0 Known Bugs and Non-Bugs
-
- Note that this section can get rapdily outdated -- such is the nature
- of an open-source project. For the latest information, join the
- mailing list or look through recent archives. The RELEASE- NOTES and
- BUGS files are generally kept up-to-date.
-
- For 3.0.1, the most common "bug" is an apparently missing "../" in
- include/Makefile, resulting in files like gthr.h and gthr-single.h not
- being found. Please read [81]the configuration instructions for GCC,
- specifically the part about configuring in a separate build directory,
- and how strongly recommended it is. Building in the source directory
- is fragile, is rarely tested, and tends to break, as in this case.
- This was fixed for 3.0.2.
-
- For 3.1, the most common "bug" is a parse error when using <fstream>,
- ending with a message, "bits/basic_file.h:52: parse error before `{'
- token." Please read [82]the installation instructions for GCC,
- specifically the part about not installing newer versions on top of
- older versions. If you install 3.1 over a 3.0.x release, then the
- wrong basic_file.h header will be found (its location changed between
- releases).
-
- Please do not report these as bugs. We know about them. Reporting this
- -- or any other problem that's already been fixed -- hinders the
- development of GCC, because we have to take time to respond to your
- report. Thank you.
- _________________________________________________________________
-
-4.1 What works already?
-
- Short answer: Pretty much everything works except for some corner
- cases. Also, localization is incomplete. For whether it works well, or
- as you expect it to work, see 5.2.
-
- Long answer: See the docs/html/17_intro/CHECKLIST file, which is badly
- outdated... Also see the RELEASE-NOTES file, which is kept more up to
- date.
- _________________________________________________________________
-
-4.2 Bugs in gcc/g++ (not libstdc++-v3)
-
- This is by no means meant to be complete nor exhaustive, but mentions
- some problems that users may encounter when building or using
- libstdc++. If you are experiencing one of these problems, you can find
- more information on the libstdc++ and the GCC mailing lists.
-
- Before reporting a bug, examine the [83]bugs database with the
- category set to "libstdc++". The BUGS file in the source tree also
- tracks known serious problems.
- * Debugging is problematic, due to bugs in line-number generation
- (mostly fixed in the compiler) and gdb lagging behind the compiler
- (lack of personnel). We recommend configuring the compiler using
- --with-dwarf2 if the DWARF2 debugging format is not already the
- default on your platform. Also, [84]changing your GDB settings can
- have a profound effect on your C++ debugging experiences. :-)
- _________________________________________________________________
-
-4.3 Bugs in the C++ language/lib specification
-
- Yes, unfortunately, there are some. In a [85]message to the list,
- Nathan Myers announced that he has started a list of problems in the
- ISO C++ Standard itself, especially with regard to the chapters that
- concern the library. The list itself is [86]posted on his website.
- Developers who are having problems interpreting the Standard may wish
- to consult his notes.
-
- For those people who are not part of the ISO Library Group (i.e.,
- nearly all of us needing to read this page in the first place :-), a
- public list of the library defects is occasionally published [87]here.
- Some of these have resulted in [88]code changes.
- _________________________________________________________________
-
-4.4 Things in libstdc++ that only look like bugs
-
- There are things which are not bugs in the compiler (4.2) nor the
- language specification (4.3), but aren't really bugs in libstdc++,
- either. Really! Please do not report these as bugs.
-
- -Weffc++ The biggest of these is the quadzillions of warnings about
- the library headers emitted when -Weffc++ is used. Making libstdc++
- "-Weffc++-clean" is not a goal of the project, for a few reasons.
- Mainly, that option tries to enforce object-oriented programming,
- while the Standard Library isn't necessarily trying to be OO.
-
- reopening a stream fails Did I just say that -Weffc++ was our biggest
- false-bug report? I lied. (It used to be.) Today it seems to be
- reports that after executing a sequence like
- #include <fstream>
- ...
- std::fstream fs("a_file");
- // .
- // . do things with fs...
- // .
- fs.close();
- fs.open("a_new_file");
-
- all operations on the re-opened fs will fail, or at least act very
- strangely. Yes, they often will, especially if fs reached the EOF
- state on the previous file. The reason is that the state flags are not
- cleared on a successful call to open(). The standard unfortunately did
- not specify behavior in this case, and to everybody's great sorrow,
- the [89]proposed LWG resolution in DR #22 is to leave the flags
- unchanged. You must insert a call to fs.clear() between the calls to
- close() and open(), and then everything will work like we all expect
- it to work. Update: for GCC 4.0 we implemented the resolution of
- [90]DR #409 and open() now calls clear() on success!
-
- rel_ops Another is the rel_ops namespace and the template comparison
- operator functions contained therein. If they become visible in the
- same namespace as other comparison functions (e.g., 'using' them and
- the <iterator> header), then you will suddenly be faced with huge
- numbers of ambiguity errors. This was discussed on the -v3 list;
- Nathan Myers [91]sums things up here. The collisions with
- vector/string iterator types have been fixed for 3.1.
-
- The g++-3 headers are not ours
-
- If you have found an extremely broken header file which is causing
- problems for you, look carefully before submitting a "high" priority
- bug report (which you probably shouldn't do anyhow; see the last
- paragraph of the page describing [92]the GCC bug database).
-
- If the headers are in ${prefix}/include/g++-3, or if the installed
- library's name looks like libstdc++-2.10.a or libstdc++-libc6-2.10.so,
- then you are using the old libstdc++-v2 library, which is nonstandard
- and unmaintained. Do not report problems with -v2 to the -v3 mailing
- list.
-
- For GCC versions 3.0 and 3.1 the libstdc++-v3 header files are
- installed in ${prefix}/include/g++-v3 (see the 'v'?). Starting with
- version 3.2 the headers are installed in
- ${prefix}/include/c++/${version} as this prevents headers from
- previous versions being found by mistake.
-
- glibc If you're on a GNU/Linux system and have just upgraded to glibc
- 2.2, but are still using gcc 2.95.2, then you should have read the
- glibc FAQ, specifically 2.34:
-2.34. When compiling C++ programs, I get a compilation error in streambuf.h.
-
-{BH} You are using g++ 2.95.2? After upgrading to glibc 2.2, you need to
-apply a patch to the include files in /usr/include/g++, because the fpos_t
-type has changed in glibc 2.2. The patch is at
-http://clisp.cons.org/~haible/gccinclude-glibc-2.2-compat.diff
-
-
- Note that 2.95.x shipped with the [93]old v2 library which is no
- longer maintained. Also note that gcc 2.95.3 fixes this problem, but
- requires a separate patch for libstdc++-v3.
-
- concept checks If you see compilation errors containing messages about
- fooConcept and a constraints member function, then most likely you
- have violated one of the requirements for types used during
- instantiation of template containers and functions. For example,
- EqualityComparableConcept appears if your types must be comparable
- with == and you have not provided this capability (a typo, or wrong
- visibility, or you just plain forgot, etc).
-
- More information, including how to optionally enable/disable the
- checks, is available [94]here.
-
- dlopen/dlsym If you are using the C++ library across
- dynamically-loaded objects, make certain that you are passing the
- correct options when compiling and linking:
- // compile your library components
- g++ -fPIC -c a.cc
- g++ -fPIC -c b.cc
- ...
- g++ -fPIC -c z.cc
-
- // create your library
- g++ -fPIC -shared -rdynamic -o libfoo.so a.o b.o ... z.o
-
- // link the executable
- g++ -fPIC -rdynamic -o foo ... -L. -lfoo -ldl
-
- "memory leaks" in containers A few people have reported that the
- standard containers appear to leak memory when tested with memory
- checkers such as [95]valgrind. 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 [96]Tips for
- memory leak hunting first.
- _________________________________________________________________
-
-4.5 Aw, that's easy to fix!
-
- If you have found a bug in the library and you think you have a
- working fix, then send it in! The main GCC site has a page on
- [97]submitting patches 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++ [98]contributors' page also
- talks about how to submit patches.
-
- In addition to the description, the patch, and the ChangeLog entry, it
- is a Good Thing if you can additionally create a small test program to
- test for the presence of the bug that your patch fixes. Bugs have a
- way of being reintroduced; if an old bug creeps back in, it will be
- caught immediately by the [99]testsuite -- but only if such a test
- exists.
- _________________________________________________________________
-
- 5.0 Miscellaneous
-
-5.1 string::iterator is not char*; vector<T>::iterator is not T*
-
- If you have code that depends on container<T> iterators being
- implemented as pointer-to-T, your code is broken.
-
- While there are arguments for iterators to be implemented in that
- manner, A) they aren't very good ones in the long term, and B) they
- were never guaranteed by the Standard anyway. The type-safety achieved
- by making iterators a real class rather than a typedef for T*
- outweighs nearly all opposing arguments.
-
- Code which does assume that a vector iterator i is a pointer can often
- be fixed by changing i in certain expressions to &*i . Future
- revisions of the Standard are expected to bless this usage for
- vector<> (but not for basic_string<>).
- _________________________________________________________________
-
-5.2 What's next after libstdc++-v3?
-
- Hopefully, not much. The goal of libstdc++-v3 is to produce a
- fully-compliant, fully-portable Standard Library. After that, we're
- mostly done: there won't be any more compliance work to do. However:
- 1. The ISO Committee will meet periodically to review Defect Reports
- in the C++ Standard. Undoubtedly some of these will result in
- changes to the Standard, which will be reflected in patches to
- libstdc++. Some of that is already happening, see [100]4.3. Some
- of those changes are being predicted by the library maintainers,
- and we add code to the library based on what the current proposed
- resolution specifies. Those additions are listed in [101]the
- extensions page.
- 2. Performance tuning. Lots of performance tuning. This too is
- already underway for post-3.0 releases, starting with memory
- expansion in container classes and buffer usage in synchronized
- stream objects.
- 3. An ABI for libstdc++ is being developed, so that multiple
- binary-incompatible copies of the library can be replaced with a
- single backwards-compatible library, like libgcc_s.so is.
- 4. The current libstdc++ contains extensions to the Library which
- must be explicitly requested by client code (for example, the hash
- tables from SGI). Other extensions may be added to libstdc++-v3 if
- they seem to be "standard" enough. (For example, the "long long"
- type from C99.) Bugfixes and rewrites (to improve or fix thread
- safety, for instance) will of course be a continuing task.
- 5. There is an effort underway to add significant extensions to the
- standard library specification. The latest version of this effort
- is described in [102]The C++ Library Technical Report 1. See
- [103]5.5.
-
- [104]This question about the next libstdc++ prompted some brief but
- interesting [105]speculation.
- _________________________________________________________________
-
-5.3 What about the STL from SGI?
-
- The [106]STL from SGI, version 3.3, was the final merge of the STL
- codebase. The code in libstdc++ contains many fixes and changes, and
- the SGI code is no longer under active development. We expect that no
- future merges will take place.
-
- In particular, string is not from SGI and makes no use of their "rope"
- class (which is included as an optional extension), nor is valarray
- and some others. Classes like vector<> are, however we have made
- significant changes to them since then.
-
- The FAQ for SGI's STL (one jump off of their main page) is recommended
- reading.
- _________________________________________________________________
-
-5.4 Extensions and Backward Compatibility
-
- Headers in the ext and backward subdirectories should be referred to
- by their relative paths:
- #include <ext/hash_map>
-
- rather than using -I or other options. This is more portable and
- forward-compatible. (The situation is the same as that of other
- headers whose directories are not searched directly, e.g.,
- <sys/stat.h>, <X11/Xlib.h>.
-
- 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 containers in the SGI STL. See
- [107]5.5 for more details.
-
- The extensions are no longer in the global or std namespaces, instead
- they are declared in the __gnu_cxx namespace. For maximum portability,
- consider defining a namespace alias to use to talk about extensions,
- e.g.:
- #ifdef __GNUC__
- #if __GNUC__ < 3
- #include <hash_map.h>
- namespace Sgi { using ::hash_map; }; // inherit globals
- #else
- #include <ext/hash_map>
- #if __GNUC_MINOR__ == 0
- namespace Sgi = std; // GCC 3.0
- #else
- namespace Sgi = ::__gnu_cxx; // GCC 3.1 and later
- #endif
- #endif
- #else // ... there are other compilers, right?
- namespace Sgi = std;
- #endif
-
- Sgi::hash_map<int,int> my_map;
-
- This is a bit cleaner than defining typedefs for all the
- instantiations you might need.
-
- Note: explicit template specializations must be declared in the same
- namespace as the original template. This means you cannot use a
- namespace alias when declaring an explicit specialization.
-
- Extensions to the library have [108]their own page.
- _________________________________________________________________
-
-5.5 Does libstdc++ support TR1?
-
- The C++ Standard Library Technical Report adds many new features to
- the library. The latest version of this effort is described in
- [109]Technical Report 1.
-
- libstdc++ strives to implement all of TR1. An [110]overview of the
- implementation status is available.
-
- Briefly, the features of TR1 and the current status are:
-
- Reference_wrapper - Complete - Useful to pass references to functions
- that take their parameters by value.
-
- Reference-counted smart pointers - Complete - The shared_ptr and
- weak_ptr allow several object to know about a pointer and whether it
- is valid. When the last reference to the pointer is destroyed the
- pointer is freed.
-
- Function objects - Complete - Function return types (i.e, result_of),
- the functions template mem_fn (a generalization of mem_fun and
- mem_fun_red), function object binders (e.g, bind, a generalization of
- bind1st and bind2nd), and polymorhpic function wrappers (e.g, class
- template function).
-
- Type traits - Complete - The type_traits class gives templates the
- ability to probe information about the input type and enable
- type-dependent logic to be performed without the need of template
- specializations.
-
- A random number engine - Complete - This library contains randow
- number generators with several different choices of distribution.
-
- Tuples - Complete - The tuple class implements small heterogeneous
- arrays. This is an enhanced pair. In fact, the standard pair is
- enhanced with a tuple interface.
-
- Fixed-size arrays - Complete - The array class implements small
- fixed-sized arrays with container semantics.
-
- Unordered containers - Complete - The unordered_set, unordered_map,
- unordered_multiset, and unordered_multimap containers are hashed
- versions of the map, set, multimap, and multiset containers
- respectively. These classes are suitable replacements for the SGI STL
- hash_map and hash_set extensions.
-
- C99 compatibility - Under construction - There are many features
- designed to minimize the divergence of the C and the C++ languages.
-
- Special functions - Under construction - Twenty-three mathematical
- functions familiar to physicists and engineers are included:
- cylindrical and spherical Bessel and Neumann functions, hypergeometric
- functions, Laguerre polynomials, Legendre functions, elliptic
- integrals, exponential integrals and the Riemann zeta function all for
- your computing pleasure.
-
- A regular expression engine This library provides for regular
- expression objects with traversal of text with return of
- subexpressions.
- _________________________________________________________________
-
-5.6 Is libstdc++-v3 thread-safe?
-
- libstdc++-v3 strives to be thread-safe when all of the following
- conditions are met:
- * The system's libc is itself thread-safe,
- * gcc -v reports a thread model other than 'single',
- * [pre-3.3 only] a non-generic implementation of atomicity.h exists
- for the architecture in question.
-
- The user-code must guard against concurrent method calls which may
- access any particular library object's state. Typically, the
- application programmer may infer what object locks must be held based
- on the objects referenced in a method call. Without getting into great
- detail, here is an example which requires user-level locks:
- library_class_a shared_object_a;
-
- thread_main () {
- library_class_b *object_b = new library_class_b;
- shared_object_a.add_b (object_b); // must hold lock for shared_object_
-a
- shared_object_a.mutate (); // must hold lock for shared_object_
-a
- }
-
- // Multiple copies of thread_main() are started in independent threads.
-
- Under the assumption that object_a and object_b are never exposed to
- another thread, here is an example that should not require any
- user-level locks:
- thread_main () {
- library_class_a object_a;
- library_class_b *object_b = new library_class_b;
- object_a.add_b (object_b);
- object_a.mutate ();
- }
-
- All library objects are safe to use in a multithreaded program as long
- as each thread carefully locks out access by any other thread while it
- uses any object visible to another thread, i.e., treat library objects
- like any other shared resource. In general, this requirement includes
- both read and write access to objects; unless otherwise documented as
- safe, do not assume that two threads may access a shared standard
- library object at the same time.
-
- See chapters [111]17 (library introduction), [112]23 (containers), and
- [113]27 (I/O) for more information.
- _________________________________________________________________
-
-5.7 How do I get a copy of the ISO C++ Standard?
-
- Copies of the full ISO 14882 standard are available on line via the
- ISO mirror site for committee members. Non-members, or those who have
- not paid for the privilege of sitting on the committee and sustained
- their two-meeting commitment for voting rights, may get a copy of the
- standard from their respective national standards organization. In the
- USA, this national standards organization is ANSI and their website is
- right [114]here. (And if you've already registered with them, clicking
- this link will take you to directly to the place where you can
- [115]buy the standard on-line.
-
- Who is your country's member body? Visit the [116]ISO homepage and
- find out!
- _________________________________________________________________
-
-5.8 What's an ABI and why is it so messy?
-
- "ABI" stands for "Application Binary Interface." Conventionally, it
- refers to a great mass of details about how arguments are arranged on
- the call stack and/or in registers, and how various types are arranged
- and padded in structs. A single CPU design may suffer multiple ABIs
- designed by different development tool vendors who made different
- choices, or even by the same vendor for different target applications
- or compiler versions. In ideal circumstances the CPU designer presents
- one ABI and all the OSes and compilers use it. In practice every ABI
- omits details that compiler implementers (consciously or accidentally)
- must choose for themselves.
-
- That ABI definition suffices for compilers to generate code so a
- program can interact safely with an OS and its lowest-level libraries.
- Users usually want an ABI to encompass more detail, allowing libraries
- built with different compilers (or different releases of the same
- compiler!) to be linked together. For C++, this includes many more
- details than for C, and CPU designers (for good reasons elaborated
- below) have not stepped up to publish C++ ABIs. The details include
- virtual function implementation, struct inheritance layout, name
- mangling, and exception handling. Such an ABI has been defined for GNU
- C++, and is immediately useful for embedded work relying only on a
- "free-standing implementation" that doesn't include (much of) the
- standard library. It is a good basis for the work to come.
-
- A useful C++ ABI must also incorporate many details of the standard
- library implementation. For a C ABI, the layouts of a few structs
- (such as FILE, stat, jmpbuf, and the like) and a few macros suffice.
- For C++, the details include the complete set of names of functions
- and types used, the offsets of class members and virtual functions,
- and the actual definitions of all inlines. C++ exposes many more
- library details to the caller than C does. It makes defining a
- complete ABI a much bigger undertaking, and requires not just
- documenting library implementation details, but carefully designing
- those details so that future bug fixes and optimizations don't force
- breaking the ABI.
-
- There are ways to help isolate library implementation details from the
- ABI, but they trade off against speed. Library details used in inner
- loops (e.g., getchar) must be exposed and frozen for all time, but
- many others may reasonably be kept hidden from user code, so they may
- later be changed. Deciding which, and implementing the decisions, must
- happen before you can reasonably document a candidate C++ ABI that
- encompasses the standard library.
- _________________________________________________________________
-
-5.9 How do I make std::vector<T>::capacity() == std::vector<T>::size()?
-
- The standard idiom for deallocating a std::vector<T>'s unused memory
- is to create a temporary copy of the vector and swap their contents,
- e.g. for std::vector<T> v
- std::vector<T>(v).swap(v);
-
-
- The copy will take O(n) time and the swap is constant time.
-
- See [117]Shrink-to-fit strings for a similar solution for strings.
- _________________________________________________________________
-
- See [118]license.html for copying conditions. Comments and suggestions
- are welcome, and may be sent to [119]the libstdc++ mailing list.
-
-References
-
- 1. ../documentation.html
- 2. ../17_intro/license.html
- 3. http://gcc.gnu.org/onlinedocs/libstdc++/faq/
- 4. http://gcc.gnu.org/onlinedocs/libstdc++/documentation.html
- 5. http://gcc.gnu.org/libstdc++/
- 6. ../faq/index.html#1_0
- 7. ../faq/index.html#1_1
- 8. ../faq/index.html#1_2
- 9. ../faq/index.html#1_3
- 10. ../faq/index.html#1_4
- 11. ../faq/index.html#1_5
- 12. ../faq/index.html#1_6
- 13. ../faq/index.html#1_7
- 14. ../faq/index.html#1_8
- 15. ../faq/index.html#1_9
- 16. ../faq/index.html#2_0
- 17. ../faq/index.html#2_1
- 18. ../faq/index.html#2_2
- 19. ../faq/index.html#2_3
- 20. ../faq/index.html#2_4
- 21. ../faq/index.html#2_5
- 22. ../faq/index.html#2_6
- 23. ../faq/index.html#3_0
- 24. ../faq/index.html#3_1
- 25. ../faq/index.html#3_2
- 26. ../faq/index.html#3_3
- 27. ../faq/index.html#3_4
- 28. ../faq/index.html#3_5
- 29. ../faq/index.html#3_6
- 30. ../faq/index.html#3_7
- 31. ../faq/index.html#3_8
- 32. ../faq/index.html#3_9
- 33. ../faq/index.html#3_10
- 34. ../faq/index.html#4_0
- 35. ../faq/index.html#4_1
- 36. ../faq/index.html#4_2
- 37. ../faq/index.html#4_3
- 38. ../faq/index.html#4_4
- 39. ../faq/index.html#4_4_iostreamclear
- 40. ../faq/index.html#4_4_Weff
- 41. ../faq/index.html#4_4_rel_ops
- 42. ../faq/index.html#4_4_interface
- 43. ../faq/index.html#4_4_glibc
- 44. ../faq/index.html#4_4_checks
- 45. ../faq/index.html#4_4_dlsym
- 46. ../faq/index.html#4_4_leak
- 47. ../faq/index.html#4_5
- 48. ../faq/index.html#5_0
- 49. ../faq/index.html#5_1
- 50. ../faq/index.html#5_2
- 51. ../faq/index.html#5_3
- 52. ../faq/index.html#5_4
- 53. ../faq/index.html#5_5
- 54. ../faq/index.html#5_6
- 55. ../faq/index.html#5_7
- 56. ../faq/index.html#5_8
- 57. ../faq/index.html#5_9
- 58. ../faq/index.html#1_4
- 59. ../faq/index.html#4_4_interface
- 60. ../17_intro/DESIGN
- 61. http://gcc.gnu.org/
- 62. http://gcc.gnu.org/gcc-3.3/buildstat.html
- 63. http://gcc.gnu.org/libstdc++/
- 64. http://gcc.gnu.org/libstdc++/
- 65. http://gcc.gnu.org/releases.html
- 66. ../17_intro/contribute.html
- 67. http://www.boost.org/
- 68. http://gcc.gnu.org/extensions.html
- 69. mailto:libstdc++@gcc.gnu.org
- 70. mailto:pme@gcc.gnu.org
- 71. mailto:gdr@gcc.gnu.org
- 72. ../17_intro/license.html
- 73. ../documentation.html
- 74. ../17_intro/RELEASE-NOTES
- 75. http://subversion.tigris.org/
- 76. http://gcc.gnu.org/install/test.html
- 77. ../18_support/howto.html
- 78. http://gcc.gnu.org/cgi-bin/htsearch?method=and&format=builtin-long&sort=score&words=_XOPEN_SOURCE+Solaris
- 79. http://gcc.gnu.org/ml/gcc/2002-03/msg00817.html
- 80. http://gcc.gnu.org/ml/libstdc++/2003-02/subjects.html#00286
- 81. http://gcc.gnu.org/install/configure.html
- 82. http://gcc.gnu.org/install/
- 83. http://gcc.gnu.org/bugs.html
- 84. http://gcc.gnu.org/ml/libstdc++/2002-02/msg00034.html
- 85. http://gcc.gnu.org/ml/libstdc++/1998/msg00006.html
- 86. http://www.cantrip.org/draft-bugs.txt
- 87. http://anubis.dkuug.dk/jtc1/sc22/wg21/
- 88. ../faq/index.html#5_2
- 89. ../ext/howto.html#5
- 90. ../ext/howto.html#5
- 91. http://gcc.gnu.org/ml/libstdc++/2001-01/msg00247.html
- 92. http://gcc.gnu.org/bugs.html
- 93. ../faq/index.html#4_4_interface
- 94. ../19_diagnostics/howto.html#3
- 95. http://developer.kde.org/~sewardj/
- 96. ../debug.html#mem
- 97. http://gcc.gnu.org/contribute.html
- 98. ../17_intro/contribute.html
- 99. ../faq/index.html#2_4
- 100. ../faq/index.html#4_3
- 101. ../ext/howto.html#5
- 102. http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1836.pdf
- 103. ../faq/index.html#5_5
- 104. http://gcc.gnu.org/ml/libstdc++/1999/msg00080.html
- 105. http://gcc.gnu.org/ml/libstdc++/1999/msg00084.html
- 106. http://www.sgi.com/tech/stl/
- 107. ../faq/index.html#5_5
- 108. ../ext/howto.html
- 109. http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1836.pdf
- 110. ../ext/tr1.html
- 111. ../17_intro/howto.html#3
- 112. ../23_containers/howto.html#3
- 113. ../27_io/howto.html#9
- 114. http://www.ansi.org/
- 115. http://webstore.ansi.org/ansidocstore/product.asp?sku=ISO%2FIEC+14882%3A2003
- 116. http://www.iso.ch/
- 117. ../21_strings/howto.html#6
- 118. ../17_intro/license.html
- 119. mailto:libstdc++@gcc.gnu.org
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
<head>
<meta name="AUTHOR" content="pme@gcc.gnu.org (Phil Edwards)" />
- <meta name="KEYWORDS" content="libstdc++, libstdc++-v3, GCC, g++" />
+ <meta name="KEYWORDS" content="libstdc++, libstdc++, GCC, g++" />
<meta name="DESCRIPTION" content="README for the GNU libstdc++ effort." />
<meta name="GENERATOR" content="vi and eight fingers" />
- <title>libstdc++-v3 Installation Instructions</title>
+ <title>libstdc++ Installation Instructions</title>
<link rel="StyleSheet" href="lib3styles.css" type="text/css" />
<link rel="Copyright" href="17_intro/license.html" type="text/html" />
</head>
</em></p>
<p><em>
- To the <a href="http://gcc.gnu.org/libstdc++/">libstdc++-v3 homepage</a>.
+ To the <a href="http://gcc.gnu.org/libstdc++/">libstdc++ homepage</a>.
</em></p>
<hr />
<h2>Contents</h2>
-<p>Because libstdc++-v3 is part of GCC, the primary source for
+<p>Because libstdc++ is part of GCC, the primary source for
installation instructions is
<a href="http://gcc.gnu.org/install/">the GCC install page</a>.
- Additional data is given here only where it applies to libstdc++-v3.
+ Additional data is given here only where it applies to libstdc++.
</p>
<ul>
<code>-ffunction-sections -fdata-sections -Wl,--gc-sections</code>.
To obtain maximum benefit from this, binutils after this date should
also be used (bugs were fixed with C++ exception handling related
- to this change in libstdc++-v3). The version of these tools should
+ to this change in libstdc++). The version of these tools should
be <code>2.10.90</code>, or later, and you can get snapshots (as
well as releases) of binutils
<a href="ftp://sources.redhat.com/pub/binutils">here</a>. The
Instructions</a> first. Read <em>all of them</em>.
<strong>Twice.</strong>
</p>
- <p>When building libstdc++-v3 you'll have to configure
- the entire <em>gccsrcdir</em> directory. The full list of libstdc++-v3
+ <p>When building libstdc++ you'll have to configure
+ the entire <em>gccsrcdir</em> directory. The full list of libstdc++
specific configuration options, not dependent on the specific compiler
release being used, can be found <a href="configopts.html">here</a>.
</p>
+++ /dev/null
-# Take apart bits of HTML and puts them back together again in new and
-# fascinating ways. Copyright (C) 2002 Free Software Foundation, Inc.
-# Contributed by Phil Edwards <pme@gcc.gnu.org>. Simple two-state automaton
-# inspired by Richard Henderson's gcc/mkmap-symver.awk.
-
-# 'file' is the name of the file on stdin
-# 'title' is the text to print at the start of the list
-
-BEGIN {
- state = "looking";
- entries = 0;
- printf (" <li>%s\n", title);
- printf (" <ul>\n");
-}
-
-# Searching for the little table of contents at the top.
-state == "looking" && /^<h1>Contents/ {
- state = "entries";
- next;
-}
-
-# Ignore everything else up to that point.
-state == "looking" {
- next;
-}
-
-# An entry in the table of contents. Pull that line apart.
-state == "entries" && /<li>/ {
- extract_info($0);
- next;
-}
-
-# End of the list. Don't bother reading the rest of the file. (It could
-# also contain more <li>'s, so that would be incorrect as well as wasteful.)
-state == "entries" && /^<\/ul>/ {
- exit;
-}
-
-END {
- for (i = 0; i < entries; i++)
- printf (" %s\n", entry[i]);
- printf (" </ul>\n </li>\n\n");
-}
-
-function extract_info(line) {
- # thistarget will be things like "#5" or "elsewhere.html"
- match(line,"href=\".*\"");
- thistarget = substr(line,RSTART+6,RLENGTH-7);
-
- # take apart the filename
- split(file,X,"/");
- if (thistarget ~ /^#/) {
- # local name, use directory and filename
- target = file thistarget
- } else {
- # different file, only use directory
- target = X[1] "/" thistarget
- }
-
- # visible text
- gsub("</a></li>","",line);
- start = index(line,"\">") + 2;
- thistext = substr(line,start);
-
- # Assemble and store the HTML for later output.
- entry[entries++] = "<li><a href=\"" target "\">" thistext "</a></li>"
-}
-
-# vim:sw=2
+++ /dev/null
-<?xml version="1.0" encoding="ISO-8859-1"?>
-<!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" xml:lang="en" lang="en">
-<head>
- <meta name="AUTHOR" content="bkoz@gcc.gnu.org (Benjamin Kosnik)" />
- <meta name="KEYWORDS" content="c++, libstdc++, gdb, g++, debug" />
- <meta name="DESCRIPTION" content="The libstdc++ parallel mode." />
- <meta name="GENERATOR" content="emacs and ten fingers" />
- <title>The libstdc++ parallel mode</title>
-<link rel="StyleSheet" href="lib3styles.css" type="text/css" />
-<link rel="Copyright" href="17_intro/license.html" type="text/html" />
-</head>
-<body>
-
-<h1 class="centered"><a name="top">The libstdc++ parallel mode</a></h1>
-
-<p class="fineprint"><em>
- The latest version of this document is always available at
- <a href="http://gcc.gnu.org/onlinedocs/libstdc++/parallel_mode.html">
- http://gcc.gnu.org/onlinedocs/libstdc++/parallel_mode.html</a>.
-</em></p>
-
-<p><em>
- To the <a href="http://gcc.gnu.org/libstdc++/">libstdc++-v3 homepage</a>.
-</em></p>
-
-<!-- ####################################################### -->
-<hr />
-<p> The libstdc++ parallel mode is an experimental parallel
-implementation of many algorithms the C++ Standard Library.
-</p>
-
-<p>
-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.
-</p>
-
-<h3 class="left"><a name="parallel">The libstdc++ parallel mode</a></h3>
-
-<p>The libstdc++ parallel mode performs parallelization of algorithms,
-function objects, classes, and functions in the C++ Standard.</p>
-
-<h4 class="left">Using the libstdc++ parallel mode</h4>
-
-<p>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 <a
- href="http://gcc.gnu.org/onlinedocs/libgomp">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>-march=i686</code>,
- <code>-march=native</code> or <code>-mcpu=v9</code>.
-</p>
-
-<p>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.</p>
-
-
-<p>The following library components in the include
-<code><numeric></code> are included in the parallel mode:</p>
-<ul>
- <li><code>std::accumulate</code></li>
- <li><code>std::adjacent_difference</code></li>
- <li><code>std::inner_product</code></li>
- <li><code>std::partial_sum</code></li>
-</ul>
-
-<p>The following library components in the include
-<code><algorithm></code> are included in the parallel mode:</p>
-<ul>
- <li><code>std::adjacent_find</code></li>
- <li><code>std::count</code></li>
- <li><code>std::count_if</code></li>
- <li><code>std::equal</code></li>
- <li><code>std::find</code></li>
- <li><code>std::find_if</code></li>
- <li><code>std::find_first_of</code></li>
- <li><code>std::for_each</code></li>
- <li><code>std::generate</code></li>
- <li><code>std::generate_n</code></li>
- <li><code>std::lexicographical_compare</code></li>
- <li><code>std::mismatch</code></li>
- <li><code>std::search</code></li>
- <li><code>std::search_n</code></li>
- <li><code>std::transform</code></li>
- <li><code>std::replace</code></li>
- <li><code>std::replace_if</code></li>
- <li><code>std::max_element</code></li>
- <li><code>std::merge</code></li>
- <li><code>std::min_element</code></li>
- <li><code>std::nth_element</code></li>
- <li><code>std::partial_sort</code></li>
- <li><code>std::partition</code></li>
- <li><code>std::random_shuffle</code></li>
- <li><code>std::set_union</code></li>
- <li><code>std::set_intersection</code></li>
- <li><code>std::set_symmetric_difference</code></li>
- <li><code>std::set_difference</code></li>
- <li><code>std::sort</code></li>
- <li><code>std::stable_sort</code></li>
- <li><code>std::unique_copy</code></li>
-</ul>
-
-<p>The following library components in the includes
-<code><set></code> and <code><map></code> are included in the parallel mode:</p>
-<ul>
- <li><code>std::(multi_)map/set<T>::(multi_)map/set(Iterator begin, Iterator end)</code> (bulk construction)</li>
- <li><code>std::(multi_)map/set<T>::insert(Iterator begin, Iterator end)</code> (bulk insertion)</li>
-</ul>
-
-
-<h4 class="left">Using the parallel algorithms without parallel mode</h4>
-
-<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
- drop-in algorithms used in parallel mode, but they are available in
- a separate namespace as GNU extensions and may be used in programs
- compiled with either release mode or with parallel mode. The
- following table provides the names and headers of the parallel
- algorithms:
-</p>
-
-
-<table title="Parallel algorithms" border="1">
- <tr>
- <th>Algorithm</th>
- <th>Header</th>
- <th>Parallel algorithm</th>
- <th>Parallel header</th>
- </tr>
- <tr>
- <td>std::accumulate</td>
- <td><numeric></td>
- <td>__gnu_parallel::accumulate</td>
- <td><parallel/numeric></td>
- </tr>
- <tr>
- <td>std::adjacent_difference</td>
- <td><numeric></td>
- <td>__gnu_parallel::adjacent_difference</td>
- <td><parallel/numeric></td>
- </tr>
- <tr>
- <td>std::inner_product</td>
- <td><numeric></td>
- <td>__gnu_parallel::inner_product</td>
- <td><parallel/numeric></td>
- </tr>
- <tr>
- <td>std::partial_sum</td>
- <td><numeric></td>
- <td>__gnu_parallel::partial_sum</td>
- <td><parallel/numeric></td>
- </tr>
- <tr>
- <td>std::adjacent_find</td>
- <td><algorithm></td>
- <td>__gnu_parallel::adjacent_find</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::count</td>
- <td><algorithm></td>
- <td>__gnu_parallel::count</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::count_if</td>
- <td><algorithm></td>
- <td>__gnu_parallel::count_if</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::equal</td>
- <td><algorithm></td>
- <td>__gnu_parallel::equal</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::find</td>
- <td><algorithm></td>
- <td>__gnu_parallel::find</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::find_if</td>
- <td><algorithm></td>
- <td>__gnu_parallel::find_if</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::find_first_of</td>
- <td><algorithm></td>
- <td>__gnu_parallel::find_first_of</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::for_each</td>
- <td><algorithm></td>
- <td>__gnu_parallel::for_each</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::generate</td>
- <td><algorithm></td>
- <td>__gnu_parallel::generate</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::generate_n</td>
- <td><algorithm></td>
- <td>__gnu_parallel::generate_n</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::lexicographical_compare</td>
- <td><algorithm></td>
- <td>__gnu_parallel::lexicographical_compare</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::mismatch</td>
- <td><algorithm></td>
- <td>__gnu_parallel::mismatch</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::search</td>
- <td><algorithm></td>
- <td>__gnu_parallel::search</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::search_n</td>
- <td><algorithm></td>
- <td>__gnu_parallel::search_n</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::transform</td>
- <td><algorithm></td>
- <td>__gnu_parallel::transform</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::replace</td>
- <td><algorithm></td>
- <td>__gnu_parallel::replace</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::replace_if</td>
- <td><algorithm></td>
- <td>__gnu_parallel::replace_if</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::max_element</td>
- <td><algorithm></td>
- <td>__gnu_parallel::max_element</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::merge</td>
- <td><algorithm></td>
- <td>__gnu_parallel::merge</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::min_element</td>
- <td><algorithm></td>
- <td>__gnu_parallel::min_element</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::nth_element</td>
- <td><algorithm></td>
- <td>__gnu_parallel::nth_element</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::partial_sort</td>
- <td><algorithm></td>
- <td>__gnu_parallel::partial_sort</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::partition</td>
- <td><algorithm></td>
- <td>__gnu_parallel::partition</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::random_shuffle</td>
- <td><algorithm></td>
- <td>__gnu_parallel::random_shuffle</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::set_union</td>
- <td><algorithm></td>
- <td>__gnu_parallel::set_union</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::set_intersection</td>
- <td><algorithm></td>
- <td>__gnu_parallel::set_intersection</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::set_symmetric_difference</td>
- <td><algorithm></td>
- <td>__gnu_parallel::set_symmetric_difference</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::set_difference</td>
- <td><algorithm></td>
- <td>__gnu_parallel::set_difference</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::sort</td>
- <td><algorithm></td>
- <td>__gnu_parallel::sort</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::stable_sort</td>
- <td><algorithm></td>
- <td>__gnu_parallel::stable_sort</td>
- <td><parallel/algorithm></td>
- </tr>
-
- <tr>
- <td>std::unique_copy</td>
- <td><algorithm></td>
- <td>__gnu_parallel::unique_copy</td>
- <td><parallel/algorithm></td>
- </tr>
-
-</table>
-
-
-<h4 class="left">Parallel mode semantics</h4>
-
-<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
-concurrent threads, either.
-It might work with other compilers, though.</p>
-
-
-<h4 class="left">Configuration and Tuning</h4>
-
-<p> Some algorithm variants can be enabled/disabled/selected at compile-time.
-See <a href="latest-doxygen/compiletime__settings_8h.html">
-<code><compiletime_settings.h></code></a> and
-See <a href="latest-doxygen/compiletime__settings_8h.html">
-<code><features.h></code></a> for details.
-</p>
-
-<p>
-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.
-</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>__gnu_parallel::Settings::[algorithm]_minimal_n</code>.
-Please see <a href="latest-doxygen/settings_8h.html">
-<code><settings.h></code><a> for details.</p>
-
-
-
-<h4 class="left">Interface basics and general design</h4>
-
-<p>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:
-
-<pre>
-namespace std
-{
- template<typename _FIter>
- _FIter
- adjacent_find(_FIter, _FIter);
-}
-</pre>
-
-Which means that there should be something equivalent for the parallel
-version. Indeed, this is the case:
-
-<pre>
-namespace std
-{
- namespace __parallel
- {
- template<typename _FIter>
- _FIter
- adjacent_find(_FIter, _FIter);
-
- ...
- }
-}
-</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>__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>.
-</p>
-
-<p> 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>.
-</p>
-
-<p> Putting all this together, the general view of overloads for the
-parallel algorithms look like this:
-<p>
-<ul>
- <li>ISO C++ signature</li>
- <li>ISO C++ signature + sequential_tag argument</li>
- <li>ISO C++ signature + parallelism argument</li>
-</ul>
-
-<p> Please note that the implementation may use additional functions
-(designated with the <code>_switch</code> suffix) to dispatch from the
-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>
-
-
-<h4 class="left">Relevant namespaces</h4>
-
-<p> One namespace contain versions of code that are explicitly sequential:
-<code>__gnu_serial</code>.
-</p>
-
-<p> Two namespaces contain the parallel mode:
-<code>std::__parallel</code> and <code>__gnu_parallel</code>.
-</p>
-
-<p> 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
-<algorithm> has a parallel counterpart in
-<code>std::__parallel::transform</code> from
-<parallel/algorithm>. In addition, these parallel
-implementations are injected into <code>namespace
-__gnu_parallel</code> with using declarations.
-</p>
-
-<p> Support and general infrastructure is in <code>namespace
-__gnu_parallel</code>.
-</p>
-
-<p> More information, and an organized index of types and functions
-related to the parallel mode on a per-namespace basis, can be found in
-the generated source documentation.
-</p>
-
-<h4 class="left">Testing</h4>
-
-<p> Both the normal conformance and regression tests and the
-supplemental performance tests work.</p>
-
-<p> To run the conformance and regression tests with the parallel mode
-active,</p>
-<code>make check-parallel</code>
-
-<p>The log and summary files for conformance testing are in the
-<code>testsuite/parallel</code> directory.</p>
-
-<p> To run the performance tests with the parallel mode active, </p>
-<code>make check-performance-parallel</code>
-
-<p>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 doc-performance</code> rule in the
-testsuite's Makefile.</p>
-
-<p>Return <a href="#top">to the top of the page</a> or
- <a href="http://gcc.gnu.org/libstdc++/">to the libstdc++ homepage</a>.
-</p>
-
-
-<h4 class="left">References / Further Reading</h4>
-
-<p>
-Johannes Singler, Peter Sanders, Felix Putze. The Multi-Core Standard Template Library. Euro-Par 2007: Parallel Processing. (LNCS 4641)
-</p>
-
-<p>
-Leonor Frias, Johannes Singler: Parallelization of Bulk Operations for STL Dictionaries. Workshop on Highly Parallel Processing on a Chip (HPPC) 2007. (LNCS)
-</p>
-
-<!-- ####################################################### -->
-
-<hr />
-<p class="fineprint"><em>
-See <a href="17_intro/license.html">license.html</a> for copying conditions.
-Comments and suggestions are welcome, and may be sent to
-<a href="mailto:libstdc++@gcc.gnu.org">the libstdc++ mailing list</a>.
-</em></p>
-
-
-</body>
-</html>
<meta name="KEYWORDS" content="c++, libstdc++, test, regression, g++" />
<meta name="DESCRIPTION" content="README for the GNU libstdc++ effort." />
<meta name="GENERATOR" content="vi and eight fingers" />
- <title>libstdc++-v3 Testing Instructions</title>
+ <title>libstdc++ Testing Instructions</title>
<link rel="StyleSheet" href="lib3styles.css" />
</head>
<body>
</em></p>
<p><em>
- To the <a href="http://gcc.gnu.org/libstdc++/">libstdc++-v3 homepage</a>.
+ To the <a href="http://gcc.gnu.org/libstdc++/">libstdc++ homepage</a>.
</em></p>
<!-- ####################################################### -->
</pre>
<p>
- More examples can be found in the libstdc++-v3/testsuite/*/*.cc files.
+ More examples can be found in the libstdc++/testsuite/*/*.cc files.
</p>
<hr />
<pre> make check</pre>
<p>in the <em>libbuilddir</em> directory.</p>
<p>or</p>
- <pre> make check-target-libstdc++-v3</pre>
+ <pre> make check-target-libstdc++</pre>
<p>in the <em>gccbuilddir</em> directory.</p>
<p>
</p>
<pre>
-make check-target-libstdc++-v3 RUNTESTFLAGS="-v"
+make check-target-libstdc++ RUNTESTFLAGS="-v"
</pre>
or
<pre>
-make check-target-libstdc++-v3 RUNTESTFLAGS="-v -v"
+make check-target-libstdc++ RUNTESTFLAGS="-v -v"
</pre>
<p> To run a subset of the library tests, try using a command like the
Example flags to pass down for various embedded builds are as follows:
<pre>
--target=powerpc-eabism (libgloss/sim)
-make check-target-libstdc++-v3 RUNTESTFLAGS="--target_board=powerpc-sim"
+make check-target-libstdc++ RUNTESTFLAGS="--target_board=powerpc-sim"
--target=calmrisc32 (libgloss/sid)
-make check-target-libstdc++-v3 RUNTESTFLAGS="--target_board=calmrisc32-sid"
+make check-target-libstdc++ RUNTESTFLAGS="--target_board=calmrisc32-sid"
--target=xscale-elf (newlib/sim)
-make check-target-libstdc++-v3 RUNTESTFLAGS="--target_board=arm-sim"
+make check-target-libstdc++ RUNTESTFLAGS="--target_board=arm-sim"
</pre>
<p> Also, here is an example of how to run the libstdc++ testsuite for a
multilibed build directory with different ABI settings:
</p>
<pre>
-make check-target-libstdc++-v3 RUNTESTFLAGS='--target_board \"unix{-mabi=32,,-mabi=64}\"'
+make check-target-libstdc++ RUNTESTFLAGS='--target_board \"unix{-mabi=32,,-mabi=64}\"'
</pre>
<p>
If your GCC source tree is at <code>/path/to/gcc</code>, then you can
run the tests as follows:
<pre>
-runtest --tool libstdc++ --srcdir=/path/to/gcc/libstdc++-v3/testsuite
+runtest --tool libstdc++ --srcdir=/path/to/gcc/libstdc++/testsuite
</pre>
The testsuite will create a number of files in the directory in which you
run this command,. Some of those files might use the same name as
explicit
auto_ptr_ref(_Tp1* __p): _M_ptr(__p) { }
- } _GLIBCXX_DEPRECATED;
+ } _GLIBCXX_DEPRECATED_ATTR;
/**
template<typename _Tp1>
operator auto_ptr<_Tp1>() throw()
{ return auto_ptr<_Tp1>(this->release()); }
- } _GLIBCXX_DEPRECATED;
+ } _GLIBCXX_DEPRECATED_ATTR;
// _GLIBCXX_RESOLVE_LIB_DEFECTS
// 541. shared_ptr template assignment and void
{
public:
typedef void element_type;
- } _GLIBCXX_DEPRECATED;
+ } _GLIBCXX_DEPRECATED_ATTR;
_GLIBCXX_END_NAMESPACE
typename _Operation::result_type
operator()(typename _Operation::second_argument_type& __x) const
{ return op(value, __x); }
- } _GLIBCXX_DEPRECATED;
+ } _GLIBCXX_DEPRECATED_ATTR;
/// One of the @link s20_3_6_binder binder functors@endlink.
template<typename _Operation, typename _Tp>
typename _Operation::result_type
operator()(typename _Operation::first_argument_type& __x) const
{ return op(__x, value); }
- } _GLIBCXX_DEPRECATED;
+ } _GLIBCXX_DEPRECATED_ATTR;
/// One of the @link s20_3_6_binder binder functors@endlink.
template<typename _Operation, typename _Tp>
// Macros for visibility.
// _GLIBCXX_HAVE_ATTRIBUTE_VISIBILITY
-// _GLIBCXX_VISIBILITY
+// _GLIBCXX_VISIBILITY_ATTR
#define _GLIBCXX_HAVE_ATTRIBUTE_VISIBILITY
#if _GLIBCXX_HAVE_ATTRIBUTE_VISIBILITY
-# define _GLIBCXX_VISIBILITY(V) __attribute__ ((__visibility__ (#V)))
+# define _GLIBCXX_VISIBILITY_ATTR(V) __attribute__ ((__visibility__ (#V)))
#else
-# define _GLIBCXX_VISIBILITY(V)
+# define _GLIBCXX_VISIBILITY_ATTR(V)
#endif
// Macros for deprecated.
-// _GLIBCXX_USE_DEPRECATED
// _GLIBCXX_DEPRECATED
-#ifndef _GLIBCXX_USE_DEPRECATED
-# define _GLIBCXX_USE_DEPRECATED 1
+// _GLIBCXX_DEPRECATED_ATTR
+#ifndef _GLIBCXX_DEPRECATED
+# define _GLIBCXX_DEPRECATED 1
#endif
#if defined(__DEPRECATED) && defined(__GXX_EXPERIMENTAL_CXX0X__)
-# define _GLIBCXX_DEPRECATED __attribute__ ((__deprecated__))
+# define _GLIBCXX_DEPRECATED_ATTR __attribute__ ((__deprecated__))
#else
-# define _GLIBCXX_DEPRECATED
+# define _GLIBCXX_DEPRECATED_ATTR
#endif
// Macros for activating various namespace association modes.
# define _GLIBCXX_STD std
# define _GLIBCXX_BEGIN_NESTED_NAMESPACE(X, Y) _GLIBCXX_BEGIN_NAMESPACE(X)
# define _GLIBCXX_END_NESTED_NAMESPACE _GLIBCXX_END_NAMESPACE
-# define _GLIBCXX_BEGIN_NAMESPACE(X) namespace X _GLIBCXX_VISIBILITY(default) {
+# define _GLIBCXX_BEGIN_NAMESPACE(X) namespace X _GLIBCXX_VISIBILITY_ATTR(default) {
# define _GLIBCXX_END_NAMESPACE }
#else
# define _GLIBCXX_STD_D __norm
# define _GLIBCXX_STD_P _GLIBCXX_STD
# define _GLIBCXX_STD __cxx1998
-# define _GLIBCXX_BEGIN_NAMESPACE(X) namespace X _GLIBCXX_VISIBILITY(default) {
+# define _GLIBCXX_BEGIN_NAMESPACE(X) namespace X _GLIBCXX_VISIBILITY_ATTR(default) {
# define _GLIBCXX_END_NAMESPACE }
# define _GLIBCXX_EXTERN_TEMPLATE 0
# endif
# define _GLIBCXX_STD_D _GLIBCXX_STD
# define _GLIBCXX_STD_P __norm
# define _GLIBCXX_STD __cxx1998
-# define _GLIBCXX_BEGIN_NAMESPACE(X) namespace X _GLIBCXX_VISIBILITY(default) {
+# define _GLIBCXX_BEGIN_NAMESPACE(X) namespace X _GLIBCXX_VISIBILITY_ATTR(default) {
# define _GLIBCXX_END_NAMESPACE }
# define _GLIBCXX_EXTERN_TEMPLATE 0
# endif
# define _GLIBCXX_STD_D __norm
# define _GLIBCXX_STD_P __norm
# define _GLIBCXX_STD __cxx1998
-# define _GLIBCXX_BEGIN_NAMESPACE(X) namespace X _GLIBCXX_VISIBILITY(default) {
+# define _GLIBCXX_BEGIN_NAMESPACE(X) namespace X _GLIBCXX_VISIBILITY_ATTR(default) {
# define _GLIBCXX_END_NAMESPACE }
# define _GLIBCXX_EXTERN_TEMPLATE 0
# endif
without inlining due to lack of weak symbols
# endif
-# define _GLIBCXX_BEGIN_NESTED_NAMESPACE(X, Y) namespace X { namespace Y _GLIBCXX_VISIBILITY(default) {
+# define _GLIBCXX_BEGIN_NESTED_NAMESPACE(X, Y) namespace X { namespace Y _GLIBCXX_VISIBILITY_ATTR(default) {
# define _GLIBCXX_END_NESTED_NAMESPACE } }
#endif
_GLIBCXX_END_NAMESPACE
-#if !defined(__GXX_EXPERIMENTAL_CXX0X__) || _GLIBCXX_USE_DEPRECATED
+#if !defined(__GXX_EXPERIMENTAL_CXX0X__) || _GLIBCXX_DEPRECATED
# include <backward/binders.h>
#endif
# include <bits/stl_function.h> // std::less
# include <debug/debug.h>
# include <type_traits>
-# if _GLIBCXX_USE_DEPRECATED
+# if _GLIBCXX_DEPRECATED
# include <backward/auto_ptr.h>
# endif
# if defined(_GLIBCXX_INCLUDE_AS_CXX0X)
overflow(int_type /* __c */ = traits_type::eof())
{ return traits_type::eof(); }
-#if _GLIBCXX_USE_DEPRECATED
+#if _GLIBCXX_DEPRECATED
// Annex D.6
public:
/**
* been read.
*
* See http://gcc.gnu.org/ml/libstdc++/2002-05/msg00168.html
- *
- * @note This function has been deprecated by the standard. You
- * must define @c _GLIBCXX_DEPRECATED to make this visible; see
- * c++config.h.
- */
+ */
void
stossc()
{
}
}
-#if !defined(__GXX_EXPERIMENTAL_CXX0X__) || _GLIBCXX_USE_DEPRECATED
+#if !defined(__GXX_EXPERIMENTAL_CXX0X__) || _GLIBCXX_DEPRECATED
// Special case for auto_ptr<_Tp> to provide the strong guarantee.
template<typename _Tp>
explicit
/**
* @post use_count() == 1 and __r.get() == 0
*/
-#if !defined(__GXX_EXPERIMENTAL_CXX0X__) || _GLIBCXX_USE_DEPRECATED
+#if !defined(__GXX_EXPERIMENTAL_CXX0X__) || _GLIBCXX_DEPRECATED
template<typename _Tp1>
explicit
__shared_ptr(std::auto_ptr<_Tp1>& __r)
return *this;
}
-#if !defined(__GXX_EXPERIMENTAL_CXX0X__) || _GLIBCXX_USE_DEPRECATED
+#if !defined(__GXX_EXPERIMENTAL_CXX0X__) || _GLIBCXX_DEPRECATED
template<typename _Tp1>
__shared_ptr&
operator=(std::auto_ptr<_Tp1>& __r)
shared_ptr(const weak_ptr<_Tp1>& __r)
: __shared_ptr<_Tp>(__r) { }
-#if !defined(__GXX_EXPERIMENTAL_CXX0X__) || _GLIBCXX_USE_DEPRECATED
+#if !defined(__GXX_EXPERIMENTAL_CXX0X__) || _GLIBCXX_DEPRECATED
template<typename _Tp1>
explicit
shared_ptr(std::auto_ptr<_Tp1>& __r)
return *this;
}
-#if !defined(__GXX_EXPERIMENTAL_CXX0X__) || _GLIBCXX_USE_DEPRECATED
+#if !defined(__GXX_EXPERIMENTAL_CXX0X__) || _GLIBCXX_DEPRECATED
template<typename _Tp1>
shared_ptr&
operator=(std::auto_ptr<_Tp1>& __r)
_GLIBCXX_END_NAMESPACE
-namespace __gnu_internal _GLIBCXX_VISIBILITY(hidden)
+namespace __gnu_internal _GLIBCXX_VISIBILITY_ATTR(hidden)
{
using namespace std;
using namespace __gnu_cxx;
#include <ext/stdio_filebuf.h>
#include <ext/stdio_sync_filebuf.h>
-namespace __gnu_internal _GLIBCXX_VISIBILITY(hidden)
+namespace __gnu_internal _GLIBCXX_VISIBILITY_ATTR(hidden)
{
using namespace __gnu_cxx;
projects / gcc.git / commitdiff