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. ---------------------------------------------------------------------- X [C header names must be in std:: to qualify. Related to shadow/ dir.] X Macro: X errno, declared or defined in . Macro fn: X setjmp(jmp_buf), declared or defined in X va_end(va_list), declared or defined in 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 X NULL X offsetof X ptrdiff_t X size_t 18.2 Implementation properties [lib.support.limits] , , and 18.2.1 Numeric limits [lib.limits] X template class numeric_limits; T enum float_round_style; T enum float_denorm_style; T template<> class numeric_limits; T template<> class numeric_limits; T template<> class numeric_limits; T template<> class numeric_limits; T template<> class numeric_limits; T template<> class numeric_limits; T template<> class numeric_limits; T template<> class numeric_limits; T template<> class numeric_limits; T template<> class numeric_limits; T template<> class numeric_limits; X template<> class numeric_limits; X template<> class numeric_limits; X template<> class numeric_limits; 18.2.1.1 Template class numeric_limits [lib.numeric.limits] T template 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 (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 (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 (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 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 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 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 (variable arguments), (nonlocal jumps), (system clock clock(), time()), (signal handling), and (runtime environment getenv(), system()). Table 6--Header synopsis Macros: va_arg va_end va_start X Type: va_list Table 7--Header synopsis Macro: setjmp | X Type: jmp_buf Function: longjmp Table 8--Header synopsis Macros: CLOCKS_PER_SEC X Types: clock_t Functions: clock Table 9--Header 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 synopsis X Functions: getenv system 19.1 Exception classes [lib.std.exceptions] Header 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 synopsis X Macro: assert 19.3 Error numbers [lib.errno] Table 3--Header synopsis X |Macros: EDOM ERANGE errno | 20.2 Utility components [lib.utility] Header synopsis // _lib.operators_, operators: T namespace rel_ops { T template bool operator!=(const T&, const T&); T template bool operator> (const T&, const T&); T template bool operator<=(const T&, const T&); T template bool operator>=(const T&, const T&); } // _lib.pairs_, pairs: T template struct pair; T template bool operator==(const pair&, const pair&); T template bool operator< (const pair&, const pair&); T template bool operator!=(const pair&, const pair&); T template bool operator> (const pair&, const pair&); T template bool operator>=(const pair&, const pair&); T template bool operator<=(const pair&, const pair&); T template pair make_pair(const T1&, const T2&); 20.2.2 Pairs [lib.pairs] T template 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 pair(const pair &p); }; 20.3 Function objects [lib.function.objects] Header synopsis // _lib.base_, base: V template struct unary_function; V template struct binary_function; // _lib.arithmetic.operations_, arithmetic operations: V template struct plus; V template struct minus; V template struct multiplies; V template struct divides; V template struct modulus; V template struct negate; // _lib.comparisons_, comparisons: V template struct equal_to; V template struct not_equal_to; V template struct greater; V template struct less; V template struct greater_equal; V template struct less_equal; // _lib.logical.operations_, logical operations: V template struct logical_and; V template struct logical_or; V template struct logical_not; // _lib.negators_, negators: template struct unary_negate; V template unary_negate not1(const Predicate&); V template struct binary_negate; V template binary_negate not2(const Predicate&); // _lib.binders_, binders: V template class binder1st; V template binder1st bind1st(const Operation&, const T&); V template class binder2nd; V template binder2nd bind2nd(const Operation&, const T&); // _lib.function.pointer.adaptors_, adaptors: V template class pointer_to_unary_function; V template pointer_to_unary_function ptr_fun(Result (*)(Arg)); V template class pointer_to_binary_function; V template pointer_to_binary_function ptr_fun(Result (*)(Arg1,Arg2)); // _lib.member.pointer.adaptors_, adaptors: V template class mem_fun_t; V template class mem_fun1_t; V template mem_fun_t mem_fun(S (T::*f)()); V template mem_fun1_t mem_fun(S (T::*f)(A)); V template class mem_fun_ref_t; V template class mem_fun1_ref_t; V template mem_fun_ref_t mem_fun_ref(S (T::*f)()); V template mem_fun1_ref_t mem_fun_ref(S (T::*f)(A)); V template class const_mem_fun_t; V template class const_mem_fun1_t; V template const_mem_fun_t mem_fun(S (T::*f)() const); V template const_mem_fun1_t mem_fun(S (T::*f)(A) const); V template class const_mem_fun_ref_t; V template class const_mem_fun1_ref_t; V template const_mem_fun_ref_t mem_fun_ref(S (T::*f)() const); V template const_mem_fun1_ref_t mem_fun_ref(S (T::*f)(A) const); } 20.3.1 Base [lib.base] V template struct unary_function { V typedef Arg argument_type; V typedef Result result_type; }; V template 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 struct plus : binary_function { V T operator()(const T& x, const T& y) const; }; T template struct minus : binary_function { V T operator()(const T& x, const T& y) const; }; T template struct multiplies : binary_function { V T operator()(const T& x, const T& y) const; }; T template struct divides : binary_function { V T operator()(const T& x, const T& y) const; }; T template struct modulus : binary_function { V T operator()(const T& x, const T& y) const; }; T template struct negate : unary_function { V T operator()(const T& x) const; }; 20.3.3 Comparisons [lib.comparisons] T template struct equal_to : binary_function { V bool operator()(const T& x, const T& y) const; }; T template struct not_equal_to : binary_function { V bool operator()(const T& x, const T& y) const; }; T template struct greater : binary_function { V bool operator()(const T& x, const T& y) const; }; T template struct less : binary_function { V bool operator()(const T& x, const T& y) const; }; T template struct greater_equal : binary_function { V bool operator()(const T& x, const T& y) const; }; T template struct less_equal : binary_function { V bool operator()(const T& x, const T& y) const; }; 20.3.4 Logical operations [lib.logical.operations] T template struct logical_and : binary_function { V bool operator()(const T& x, const T& y) const; }; T template struct logical_or : binary_function { V bool operator()(const T& x, const T& y) const; }; T template struct logical_not : unary_function { V bool operator()(const T& x) const; }; 20.3.5 Negators [lib.negators] T template class unary_negate : public unary_function { public: T explicit unary_negate(const Predicate& pred); V bool operator()(const typename Predicate::argument_type& x) const; }; T template class binary_negate : public binary_function { 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 binder1st : public unary_function { 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 binder1st bind1st(const Operation& op, const T& x); 20.3.6.3 Template class binder2nd [lib.binder.2nd] T template class binder2nd : public unary_function { 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 binder2nd 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 pointer_to_unary_function : public unary_function { public: T explicit pointer_to_unary_function(Result (*f)(Arg)); V Result operator()(Arg x) const; }; T template pointer_to_unary_function ptr_fun(Result (*f)(Arg)); T template class pointer_to_binary_function : public binary_function { 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 mem_fun_t : public unary_function { public: T explicit mem_fun_t(S (T::*p)()); V S operator()(T* p) const; }; T template class mem_fun1_t : public binary_function { public: T explicit mem_fun1_t(S (T::*p)(A)); V S operator()(T* p, A x) const; }; V template mem_fun_t mem_fun(S (T::*f)()); V template mem_fun1_t mem_fun(S (T::*f)(A)); T template class mem_fun_ref_t : public unary_function { public: T explicit mem_fun_ref_t(S (T::*p)()); V S operator()(T& p) const; }; T template class mem_fun1_ref_t : public binary_function { public: T explicit mem_fun1_ref_t(S (T::*p)(A)); V S operator()(T& p, A x) const; }; T template mem_fun_ref_t mem_fun_ref(S (T::*f)()); T template mem_fun1_ref_t mem_fun_ref(S (T::*f)(A)); T template class const_mem_fun_t : public unary_function { public: T explicit const_mem_fun_t(S (T::*p)() const); V S operator()(const T* p) const; }; T template class const_mem_fun1_t : public binary_function { public: T explicit const mem_fun1_t(S (T::*p)(A) const); V S operator()(const T* p, A x) const; }; V template const_mem_fun_t mem_fun(S (T::*f)() const); V template const_mem_fun1_t mem_fun(S (T::*f)(A) const); T template class const_mem_fun_ref_t : public unary_function { public: T explicit const_mem_fun_ref_t(S (T::*p)() const); V S operator()(const T& p) const; }; T template class const_mem_fun1_ref_t : public binary_function { public: T explicit const_mem_fun1_ref_t(S (T::*p)(A) const); V S operator()(const T& p, A x) const; }; T template const_mem_fun_ref_t mem_fun_ref(S (T::*f)() const); T template const_mem_fun1_ref_t mem_fun_ref(S (T::*f)(A) const); 20.4 Memory [lib.memory] Header synopsis // _lib.default.allocator_, the default allocator: T template class allocator; T template <> class allocator; T template bool operator==(const allocator&, const allocator&) throw(); T template bool operator!=(const allocator&, const allocator&) throw(); // _lib.storage.iterator_, raw storage iterator: T template class raw_storage_iterator; // _lib.temporary.buffer_, temporary buffers: T template pair get_temporary_buffer(ptrdiff_t n); T template void return_temporary_buffer(T* p); // _lib.specialized.algorithms_, specialized algorithms: T template ForwardIterator uninitialized_copy(InputIterator first, InputIterator last, ForwardIterator result); T template void uninitialized_fill(ForwardIterator first, ForwardIterator last, const T& x); T template void uninitialized_fill_n(ForwardIterator first, Size n, const T& x); // _lib.auto.ptr_, pointers: X template class auto_ptr; } 20.4.1 The default allocator [lib.default.allocator] T template class allocator; // specialize for void: T template <> class allocator { public: T typedef void* pointer; T typedef const void* const_pointer; // reference-to-void members are impossible. T typedef void value_type; T template struct rebind { typedef allocator other; }; }; T template 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 struct rebind { typedef allocator other; }; T allocator() throw(); T allocator(const allocator&) throw(); T template allocator(const allocator&) throw(); T ~allocator() throw(); T pointer address(reference x) const; T const_pointer address(const_reference x) const; T pointer allocate( size_type, allocator::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 bool operator==(const allocator&, const allocator&) throw(); T template bool operator!=(const allocator&, const allocator&) throw(); 20.4.2 Raw storage iterator [lib.storage.iterator] T template class raw_storage_iterator : public iterator { public: T explicit raw_storage_iterator(OutputIterator x); T raw_storage_iterator& operator*(); T raw_storage_iterator& operator=(const T& element); T raw_storage_iterator& operator++(); T raw_storage_iterator operator++(int); }; 20.4.3 Temporary buffers [lib.temporary.buffer] T template pair get_temporary_buffer(ptrdiff_t n); T template 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 ForwardIterator uninitialized_copy(InputIterator first, InputIterator last, ForwardIterator result); 20.4.4.2 uninitialized_fill [lib.uninitialized.fill] V template void uninitialized_fill(ForwardIterator first, ForwardIterator last, const T& x); 20.4.4.3 uninitialized_fill_n [lib.uninitialized.fill.n] V template void uninitialized_fill_n(ForwardIterator first, Size n, const T& x); 20.4.5 Template class auto_ptr [lib.auto.ptr] X template class auto_ptr { template 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 auto_ptr(auto_ptr&) throw(); T auto_ptr& operator=(auto_ptr&) throw(); T template auto_ptr& operator=(auto_ptr&) 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) throw(); X template operator auto_ptr_ref() throw(); X template operator auto_ptr() throw(); }; 20.4.6 C Library [lib.c.malloc] Table 7--Header synopsis X Functions: calloc malloc free realloc Table 8--Header synopsis X Macro: NULL X Type: size_t X Functions: memchr memcmp X memcpy memmove memset Table 9--Header 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 struct char_traits; shall be provided in the header as a basis for explicit spe- cializations. 21.1.3.1 struct [lib.char.traits.specializations.char] char_traits T template<> struct char_traits { 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 V template<> struct char_traits { 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 struct char_traits; V template <> struct char_traits; V template <> struct char_traits; // _lib.basic.string_, basic_string: V template, class Allocator = allocator > class basic_string; V template basic_string operator+(const basic_string& lhs, const basic_string& rhs); V template basic_string operator+(const charT* lhs, const basic_string& rhs); V template basic_string operator+(charT lhs, const basic_string& rhs); V template basic_string operator+(const basic_string& lhs, const charT* rhs); V template basic_string operator+(const basic_string& lhs, charT rhs); V template bool operator==(const basic_string& lhs, const basic_string& rhs); V template bool operator==(const charT* lhs, const basic_string& rhs); V template bool operator==(const basic_string& lhs, const charT* rhs); V template bool operator!=(const basic_string& lhs, const basic_string& rhs); V template bool operator!=(const charT* lhs, const basic_string& rhs); V template bool operator!=(const basic_string& lhs, const charT* rhs); V template bool operator< (const basic_string& lhs, const basic_string& rhs); V template bool operator< (const basic_string& lhs, const charT* rhs); V template bool operator< (const charT* lhs, const basic_string& rhs); V template bool operator> (const basic_string& lhs, const basic_string& rhs); V template bool operator> (const basic_string& lhs, const charT* rhs); V template bool operator> (const charT* lhs, const basic_string& rhs); V template bool operator<=(const basic_string& lhs, const basic_string& rhs); V template bool operator<=(const basic_string& lhs, const charT* rhs); V template bool operator<=(const charT* lhs, const basic_string& rhs); V template bool operator>=(const basic_string& lhs, const basic_string& rhs); V template bool operator>=(const basic_string& lhs, const charT* rhs); V template bool operator>=(const charT* lhs, const basic_string& rhs); // _lib.string.special_: V template void swap(basic_string& lhs, basic_string& rhs); V template basic_istream& operator>>(basic_istream& is, basic_string& str); T template basic_ostream& operator<<(basic_ostream& os, const basic_string& str); V template basic_istream& getline(basic_istream& is, basic_string& str, charT delim); V template basic_istream& getline(basic_istream& is, basic_string& str); V typedef basic_string string; T typedef basic_string wstring; } 21.3 Template class basic_string [lib.basic.string] V namespace std { template, class Allocator = allocator > 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 reverse_iterator; typedef std::reverse_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 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 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 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 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 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&); // _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 synopsis isalnum isdigit isprint isupper tolower X isalpha isgraph ispunct isxdigit toupper iscntrl islower isspace Table 11--Header synopsis X Macro: WEOF X Types: wctrans_t wctype_t wint_t Functions: X iswalnum iswctype iswlower iswspace towctrans wctrans X iswalpha iswdigit iswprint iswupper towlower wctype X iswcntrl iswgraph iswpunct iswxdigit towupper Table 12--Header synopsis X Macro: NULL X Type: size_t 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 synopsis Macros: NULL WCHAR_MAX WCHAR_MIN WEOF Types: mbstate_t wint_t 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 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 synopsis // _lib.locale_, locale: T class locale; T template const Facet& use_facet(const locale&); T template bool has_facet(const locale&) throw(); // _lib.locale.convenience_, convenience interfaces: T template bool isspace (charT c, const locale& loc); T template bool isprint (charT c, const locale& loc); T template bool iscntrl (charT c, const locale& loc); T template bool isupper (charT c, const locale& loc); T template bool islower (charT c, const locale& loc); T template bool isalpha (charT c, const locale& loc); T template bool isdigit (charT c, const locale& loc); T template bool ispunct (charT c, const locale& loc); T template bool isxdigit(charT c, const locale& loc); T template bool isalnum (charT c, const locale& loc); T template bool isgraph (charT c, const locale& loc); T template charT toupper(charT c, const locale& loc); T template charT tolower(charT c, const locale& loc); // _lib.category.ctype_ and _lib.facet.ctype.special_, ctype: class ctype_base; T template class ctype; T template <> class ctype; // specialization S template class ctype_byname; S template <> class ctype_byname; // specialization T class codecvt_base; X template class codecvt; S template class codecvt_byname; // _lib.category.numeric_ and _lib.facet.numpunct_, numeric: X template class num_get; X template class num_put; T template class numpunct; S template class numpunct_byname; // _lib.category.collate_, collation: T template class collate; S template class collate_byname; // _lib.category.time_, date and time: T class time_base; S template class time_get; S template class time_get_byname; S template class time_put; S template class time_put_byname; // _lib.category.monetary_, money: T class money_base; S template class money_get; S template class money_put; S template class moneypunct; S template class moneypunct_byname; // _lib.category.messages_, message retrieval: T class messages_base; S template class messages; S template 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 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 locale combine(const locale& other) const; // locale operations: X basic_string name() const; T bool operator==(const locale& other) const; T bool operator!=(const locale& other) const; T template bool operator()(const basic_string& s1, const basic_string& 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, collate T ctype, ctype T codecvt, S codecvt T moneypunct, moneypunct T moneypunct, moneypunct, S money_get, money_get, money_put T numpunct, numpunct, X num_get, num_get X num_put, num_put S time_get, time_get, S time_put, time_put S messages, messages [required instantiations] S collate_byname, collate_byname S ctype_byname, ctype_byname S codecvt_byname, S codecvt_byname S moneypunct_byname, S moneypunct_byname, S money_get, S money_put S numpunct_byname, numpunct_byname X num_get, num_put S time_get, S time_get_byname, S time_get, S time_get_byname, S time_put, S time_put_byname, S time_put S time_put_byname S messages_byname, messages_byname 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 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 ctype_byname : public ctype { public: T typedef ctype::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 : 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 X template <> class ctype_byname : public ctype { 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 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 codecvt_byname : public codecvt { 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 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 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 numpunct : public locale::facet { public: T typedef charT char_type; T typedef basic_string 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 numpunct_byname : public numpunct { // this class is specialized for char and wchar_t. public: T typedef charT char_type; T typedef basic_string 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 collate : public locale::facet { public: T typedef charT char_type; T typedef basic_string 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 collate_byname : public collate { public: T typedef basic_string 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 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 time_get_byname : public time_get { 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 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 time_put_byname : public time_put { 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 money_get : public locale::facet { public: T typedef charT char_type; T typedef InputIterator iter_type; T typedef basic_string 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 money_put : public locale::facet { public: T typedef charT char_type; T typedef OutputIterator iter_type; T typedef basic_string 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 moneypunct : public locale::facet, public money_base { public: T typedef charT char_type; T typedef basic_string 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 moneypunct_byname : public moneypunct { public: T typedef money_base::pattern pattern; T typedef basic_string 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 messages : public locale::facet, public messages_base { public: T typedef charT char_type; T typedef basic_string string_type; T explicit messages(size_t refs = 0); T catalog open(const basic_string& 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&, 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 messages_byname : public messages { public: T typedef messages_base::catalog catalog; T typedef basic_string 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&, 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 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] , , , , and . Header synopsis T template > class deque; T template bool operator==(const deque& x, const deque& y); T template bool operator< (const deque& x, const deque& y); T template bool operator!=(const deque& x, const deque& y); T template bool operator> (const deque& x, const deque& y); T template bool operator>=(const deque& x, const deque& y); T template bool operator<=(const deque& x, const deque& y); T template void swap(deque& x, deque& y); } Header synopsis T template > class list; T template bool operator==(const list& x, const list& y); T template bool operator< (const list& x, const list& y); T template bool operator!=(const list& x, const list& y); T template bool operator> (const list& x, const list& y); T template bool operator>=(const list& x, const list& y); T template bool operator<=(const list& x, const list& y); T template void swap(list& x, list& y); } Header synopsis namespace std { T template > class queue; T template bool operator==(const queue& x, const queue& y); T template bool operator< (const queue& x, const queue& y); T template bool operator!=(const queue& x, const queue& y); T template bool operator> (const queue& x, const queue& y); T template bool operator>=(const queue& x, const queue& y); T template bool operator<=(const queue& x, const queue& y); T template , class Compare = less > T class priority_queue; } Header synopsis namespace std { T template > class stack; T template bool operator==(const stack& x, const stack& y); T template bool operator< (const stack& x, const stack& y); T template bool operator!=(const stack& x, const stack& y); T template bool operator> (const stack& x, const stack& y); T template bool operator>=(const stack& x, const stack& y); T template bool operator<=(const stack& x, const stack& y); } Header synopsis T template > class vector; T template bool operator==(const vector& x, const vector& y); T template bool operator< (const vector& x, const vector& y); T template bool operator!=(const vector& x, const vector& y); T template bool operator> (const vector& x, const vector& y); T template bool operator>=(const vector& x, const vector& y); T template bool operator<=(const vector& x, const vector& y); T template void swap(vector& x, vector& y); T template class vector; T template bool operator==(const vector& x, const vector& y); T template bool operator< (const vector& x, const vector& y); T template bool operator!=(const vector& x, const vector& y); T template bool operator> (const vector& x, const vector& y); T template bool operator>=(const vector& x, const vector& y); T template bool operator<=(const vector& x, const vector& y); T template void swap(vector& x, vector& y); } 23.2.1 Template class deque [lib.deque] template > 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 reverse_iterator; T typedef std::reverse_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 deque(InputIterator first, InputIterator last, const Allocator& = Allocator()); T deque(const deque& x); T ~deque(); T deque& operator=(const deque& x); T template 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 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 void clear(); }; T template bool operator==(const deque& x, const deque& y); T template bool operator< (const deque& x, const deque& y); T template bool operator!=(const deque& x, const deque& y); T template bool operator> (const deque& x, const deque& y); T template bool operator>=(const deque& x, const deque& y); T template bool operator<=(const deque& x, const deque& y); // specialized algorithms: T template void swap(deque& x, deque& y); 23.2.2 Template class list [lib.list] T template > 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 reverse_iterator; T typedef std::reverse_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 list(InputIterator first, InputIterator last, const Allocator& = Allocator()); T list(const list& x); T ~list(); T list& operator=(const list& x); T template 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 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 void clear(); // _lib.list.ops_ list operations: T void splice(iterator position, list& x); T void splice(iterator position, list& x, iterator i); T void splice(iterator position, list& x, iterator first, iterator last); T void remove(const T& value); T template void remove_if(Predicate pred); T void unique(); T template void unique(BinaryPredicate binary_pred); T void merge(list& x); T template void merge(list& x, Compare comp); void sort(); T template void sort(Compare comp); void reverse(); }; T template bool operator==(const list& x, const list& y); T template bool operator< (const list& x, const list& y); T template bool operator!=(const list& x, const list& y); T template bool operator> (const list& x, const list& y); T template bool operator>=(const list& x, const list& y); T template bool operator<=(const list& x, const list& y); // specialized algorithms: T template void swap(list& x, list& y); 23.2.3.1 Template class queue [lib.queue] T template > 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 bool operator==(const queue& x, const queue& y); T template bool operator< (const queue& x, const queue& y); T template bool operator!=(const queue& x, const queue& y); T template bool operator> (const queue& x, const queue& y); T template bool operator>=(const queue& x, const queue& y); T template bool operator<=(const queue& x, const queue& y); 23.2.3.2 Template class priority_queue [lib.priority.queue] T template , class Compare = less > 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 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 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 bool operator==(const stack& x, const stack& y); T template bool operator< (const stack& x, const stack& y); T template bool operator!=(const stack& x, const stack& y); T template bool operator> (const stack& x, const stack& y); T template bool operator>=(const stack& x, const stack& y); T template bool operator<=(const stack& x, const stack& y); 23.2.4 Template class vector [lib.vector] template > 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 reverse_iterator; T typedef std::reverse_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 vector(InputIterator first, InputIterator last, const Allocator& = Allocator()); T vector(const vector& x); T ~vector(); T vector& operator=(const vector& x); T template 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 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 void clear(); }; T template bool operator==(const vector& x, const vector& y); T template bool operator< (const vector& x, const vector& y); T template bool operator!=(const vector& x, const vector& y); T template bool operator> (const vector& x, const vector& y); T template bool operator>=(const vector& x, const vector& y); T template bool operator<=(const vector& x, const vector& y); // specialized algorithms: T template void swap(vector& x, vector& y); 23.2.5 Class vector [lib.vector.bool] T template class vector { 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 reverse_iterator; T typedef std::reverse_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 vector(InputIterator first, InputIterator last, const Allocator& = Allocator()); T vector(const vector& x); T ~vector(); T vector& operator=(const vector& x); T template 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 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 static void swap(reference x, reference y); T void flip(); // flips all bits T void clear(); }; T template bool operator==(const vector& x, const vector& y); T template bool operator< (const vector& x, const vector& y); T template bool operator!=(const vector& x, const vector& y); T template bool operator> (const vector& x, const vector& y); T template bool operator>=(const vector& x, const vector& y); T template bool operator<=(const vector& x, const vector& y); // specialized algorithms: T template void swap(vector& x, vector& y); 23.3 Associative containers [lib.associative] and : Header synopsis template , class Allocator = allocator > > T class map; T template bool operator==(const map& x, const map& y); T template bool operator< (const map& x, const map& y); T template bool operator!=(const map& x, const map& y); T template bool operator> (const map& x, const map& y); T template bool operator>=(const map& x, const map& y); T template bool operator<=(const map& x, const map& y); T template void swap(map& x, map& y); T template , class Allocator = allocator > > class multimap; T template bool operator==(const multimap& x, const multimap& y); T template bool operator< (const multimap& x, const multimap& y); T template bool operator!=(const multimap& x, const multimap& y); T template bool operator> (const multimap& x, const multimap& y); T template bool operator>=(const multimap& x, const multimap& y); T template bool operator<=(const multimap& x, const multimap& y); T template void swap(multimap& x, multimap& y); } Header synopsis template , class Allocator = allocator > T class set; T template bool operator==(const set& x, const set& y); T template bool operator< (const set& x, const set& y); T template bool operator!=(const set& x, const set& y); T template bool operator> (const set& x, const set& y); T template bool operator>=(const set& x, const set& y); T template bool operator<=(const set& x, const set& y); T template void swap(set& x, set& y); T template , class Allocator = allocator > class multiset; T template bool operator==(const multiset& x, const multiset& y); T template bool operator< (const multiset& x, const multiset& y); T template bool operator!=(const multiset& x, const multiset& y); T template bool operator> (const multiset& x, const multiset& y); T template bool operator>=(const multiset& x, const multiset& y); T template bool operator<=(const multiset& x, const multiset& y); T template void swap(multiset& x, multiset& y); } 23.3.1 Template class map [lib.map] template , class Allocator = allocator > > T class map { public: // types: T typedef Key key_type; T typedef T mapped_type; T typedef pair 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 reverse_iterator; T typedef std::reverse_iterator const_reverse_iterator; T class value_compare : public binary_function { 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 map(InputIterator first, InputIterator last, const Compare& comp = Compare(), const Allocator& = Allocator()); T map(const map& x); T ~map(); T map& operator=(const map& 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 insert(const value_type& x); T iterator insert(iterator position, const value_type& x); T template 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&); 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 equal_range(const key_type& x); T pair equal_range(const key_type& x) const; }; T template bool operator==(const map& x, const map& y); T template bool operator< (const map& x, const map& y); T template bool operator!=(const map& x, const map& y); T template bool operator> (const map& x, const map& y); T template bool operator>=(const map& x, const map& y); T template bool operator<=(const map& x, const map& y); // specialized algorithms: T template void swap(map& x, map& y); 23.3.2 Template class multimap [lib.multimap] template , class Allocator = allocator > > T class multimap { public: // types: T typedef Key key_type; T typedef T mapped_type; T typedef pair value_type; T typedef Compare key_compare; T typedef A